Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,341 papers · 148 categories

Trend · papers per month

2975948911,188 · Jun 202019922001200920182026
48 results for Gromov's method

A method for learning embeddings from multi-view data using Gromov-Wasserstein.

problem Challenges in learning low-dimensional representations from multi-view relational data with differing geometries.
method Bary-GWMDS and Mean-GWMDS-C, Gromov-Wasserstein-based methods operating on distance matrices.
result Stable and geometrically meaningful embeddings learned from synthetic and real-world datasets.

Proposes a novel framework for graph matching and node embedding.

problem Graph matching and node embedding in real-world networks.
method Gromov-Wasserstein discrepancy for graph dissimilarity, optimal transport for correspondence, structural regularizers for learning.
result Superior performance in graph matching compared to alternative approaches.

A new conformal prediction framework for graph-valued outputs using Z-Gromov-Wasserstein distances.

problem Lack of principled uncertainty quantification for graph-valued supervised prediction.
method Proposes a conformal prediction framework using Z-Gromov-Wasserstein distances for graph-valued outputs.
result Provides distribution-free coverage guarantees for graph-valued outputs.

We give here some extensions of Gromov's and Polterovich's theorems on $\karea$ of CPn \mathbb{CP} ^{n}, particularly in the symplectic and Hamiltonian context. Our main methods involve Gromov-Witten theory, and some connections with Bott periodicity, and loop groups. The argument is closely connected with study of jump…

2010-06-22abs ↗pdf ↗

We make an estimation of the value of the Gromov norm of the Cartesian product of two surfaces. Our method uses a connection between these norms and the minimal size of triangulations of the products of two polygons. This allows us to prove that the Gromov norm of this product is between 32 and 52 when both factors hav…

2004-07-12abs ↗pdf ↗

Develops a private synthetic graph generator using Gromov-Wasserstein distance.

problem Creating private synthetic networks for complex data.
method Random connection model, fused Gromov-Wasserstein distance, differential privacy.
result Effective algorithm for generating private synthetic graphs with theoretical guarantees.

New method learns disentangled representations using Gromov-Monge maps.

problem Learning disentangled representations from unlabelled data.
method Introduces a novel approach based on Gromov-Monge maps to preserve geometric features while aligning data distributions.
result Demonstrates effectiveness on four benchmarks, outperforming other methods.

Unified method to calculate Gromov norm for Kähler classes of bounded symmetric domains.

problem Calculating the Gromov norm of Kähler classes for all bounded symmetric domains.
method Combination of ideas from Domin-Toledo and Toledo, aided by the Polydisc Theorem.
result Unified and simplified calculation of Gromov norm for all bounded symmetric domains.

It is well known that quasi-isometric embeddings of Gromov hyperbolic spaces induce topological embeddings of their Gromov boundaries. A more general question is to detect classes of functions between Gromov hyperbolic spaces that induce continuous maps between their Gromov boundaries. In this paper we introduce the cl…

2015-06-27abs ↗pdf ↗

GWIB improves counterfactual regression by balancing latent distributions and reducing selection bias.

problem Selection bias between control and treatment groups negatively impacts counterfactual regression performance.
method GWIB uses Gromov-Wasserstein information bottleneck to maximize mutual information between covariates and outcomes while penalizing kernelized mutual information between latent representations and covariates.
result GWIB consistently outperforms state-of-the-art CFR methods in ITE estimation tasks.

In 1969 M. Gromov in his PhD thesis greatly generalized Smale-Hirsch-Phillips immersion-submersion theory by proving what is now called the h-principle for invariant open differential relations over open manifolds. Gromov extracted the original geometric idea of Smale and put it to work in the maximal possible generali…

2001-01-23abs ↗pdf ↗

Compact sequences of manifolds with boundary converge smoothly under conformal transformations.

problem Compactness of sequences of manifolds with boundary under conformal transformations.
method Use of stable elliptic estimates and the 'flatzoomer' method.
result Smooth Cheeger-Gromov convergence of sequences of manifolds with boundary under conformal transformations.

Differentiable optimization bridges arbitrary metrics to tree metrics.

problem Designing algorithms to convert arbitrary metrics to tree metrics with guarantees.
method DeltaZero framework, leveraging differentiable Gromov hyperbolicity.
result DeltaZero consistently achieves state-of-the-art distortion on synthetic and real-world datasets.

Boundary rigidity defined for hyperbolic spaces, tied to geometric properties.

problem Understanding boundary rigidity in Gromov hyperbolic spaces.
method Analyzing properties of Gromov hyperbolic spaces and their boundaries.
result Boundary rigidity is equivalent to positive Cheeger isoperimetric constant and non-amenability.

Study on non-Gromov hyperbolic tube domains and their geometric properties.

problem Characterizing non-Gromov hyperbolic tube domains with convex bases.
method Provided a criterion for non-Gromov hyperbolicity, studied Hilbert metric, and continuity properties of complex geodesics.
result Similarity of geometry of tube domains and convex domains, connections between metrics.

Extends Gromov's optimal systolic inequality to manifolds with specific cohomology properties.

problem Finding optimal systolic inequalities for manifolds with complex cohomology structures.
method Extends Gromov's inequality to manifolds with fundamental cohomology classes as cup products of 2-dimensional classes.
result Provides an optimal systolic inequality for a new class of manifolds.