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

17345067 · Jul 202619922001200920182026
48 results for geodesic sub-manifolds

In this paper, we introduce a concept of B-minimal sub-manifolds and discuss the stability of such a sub-manifold in a Riemannian manifold (M,g)(M,g). Assume B(x)B(x) is a smooth function on MM. By definition, we call a sub-manifold ΣΣ {\em B-minimal} in (M,g)(M,g) if the product sub-manifold Σ×S1Σ\times S^1 is a {\em minimal}…

2003-04-30abs ↗pdf ↗

Conic singular sub-manifolds are Lipschitz Normally Embedded in compact non-Euclidean manifolds.

problem Understanding the Lipschitz geometry of conic singular sub-manifolds.
method Analyzing the metric properties of conic singular sub-manifolds in compact non-Euclidean manifolds.
result Connected conic singular sub-manifolds are Lipschitz Normally Embedded.

Optimal transport natural gradient improves optimization in statistical models.

problem Improving optimization in statistical models with continuous sample spaces.
method Pulling back the Wasserstein metric tensor to a parameter space, creating a Riemannian manifold.
result Natural gradient descent outperforms standard gradient descent in Wasserstein distance optimization.

KPCA-BO improves BO for high-dimensional optimization problems by learning a non-linear sub-manifold.

problem High-dimensional optimization problems where Gaussian Process regression requires too much data and computation.
method KPCA-BO embeds a non-linear sub-manifold in the search space, learning a GPR model on this sub-manifold.
result KPCA-BO outperforms vanilla BO in convergence speed, especially as dimensionality increases.

Paper proposes methods to learn sub-manifolds and estimate densities in normalizing flows.

problem Normalizing flows struggle with finding sub-manifolds in high-dimensional data.
method Introduces per-pixel penalized log-likelihood and hierarchical training approaches.
result Validated superior performance in manifold learning and density estimation.

New convex projective structures found on non-hyperbolic 3-manifolds.

problem Understanding when convex projective structures can be applied to non-hyperbolic 3-manifolds.
method Deforming cusped hyperbolic 3-manifolds to convex projective structures with totally geodesic boundaries and gluing them.
result Many doubles of cusped hyperbolic 3-manifolds admit convex projective structures.

The paper studies Finsler spheres with constant flag curvature and finite orbits of prime closed geodesics.

problem Investigating Finsler spheres with specific curvature properties and geodesic orbits.
method Analyzing the action of isometries and loops on Finsler spheres, focusing on finite orbits of prime closed geodesics.
result The existence of geometrically distinct orbits of prime closed geodesics and their properties.

Inference for normal and Monte Carlo distributions using minimum relative entropy.

problem Inference from partial information on expectations and covariances.
method Minimum relative entropy sub-manifolds, analytical formulas, Monte Carlo simulations.
result Improved numerical implementation for inference from partial information.

I-BBS identifies latent sub-manifolds from distance matrices, robust to noise.

problem Identifying latent sub-manifolds from distance matrices in high-dimensional spaces.
method Coordinate-free inference using random distance matrix theory and generative noise models.
result Recovering latent geometry from integer-stable signatures of eigenvalues.

Many procedures in science, engineering and medicine produce data in the form of geometric shapes. Mathematically, a shape can be modeled as an un-parameterized immersed sub-manifold, which is the notion of shape used here. Endowing shape space with a Riemannian metric opens up the world of Riemannian differential geom…

2012-11-15abs ↗pdf ↗

A new classifier updates sequentially using maximum margin principles.

problem Sequential data collection and partial labeling.
method Maximum margin classifier with Maximum Entropy Discrimination principle, kernel representation, and regularization.
result Improved performance compared to non-sequential classifiers.

Detects phase transitions in collective behavior using manifold curvature.

problem Identifying phase transitions in multi-agent systems.
method Uses curvature and singular value ratios to detect phase transitions on manifolds.
result Phase transitions can be detected and separated into distinct sub-manifolds.

Submanifolds of finite type were introduced by the author during the late 1970s. The first results on this subject had been collected in author's book [Total mean curvature and sub manifolds of finite type, World Scientific, NJ, 1984]. A list of ten open problems and three conjectures on submanifolds of finite type was…

2013-07-24abs ↗pdf ↗

Hyperbolic 3-manifolds can be approximated by removing Cantor sets from the 3-sphere.

problem Approximating hyperbolic 3-manifolds using Cantor set complements in the 3-sphere.
method Using exhaustion by π1π_1-injective sub-manifolds and removing Cantor sets.
result Hyperbolic 3-manifolds can be geometrically approximated by removing Cantor sets from the 3-sphere.

It was recently shown that there exists an explicit bound for the number of Pachner moves needed to connect any two triangulation of any Haken 3-manifold which contains no fibred sub-manifolds as strongly simple pieces of its JSJ-decomposition. In this paper we prove a generalisation of that result to all knot compleme…

2003-06-06abs ↗pdf ↗

CLAMP uses neural manifold packing to improve self-supervised learning.

problem Improving self-supervised learning for vision tasks.
method CLAMP recasts representation learning as a manifold packing problem, introducing a loss function inspired by particle systems.
result CLAMP achieves competitive performance with state-of-the-art models and separates neural manifolds effectively.

Study moduli spaces of solutions to Bogomolny equations on surfaces.

problem Understanding solutions to Bogomolny equations on surfaces with specific boundary conditions.
method Refined Kobayashi-Hitchin correspondence and identification with Higgs bundles.
result Identified moduli spaces as holomorphic lagrangian sub-manifolds.

Suppose that we observe noisy linear measurements of an unknown signal that can be modeled as the sum of two component signals, each of which arises from a nonlinear sub-manifold of a high dimensional ambient space. We introduce SPIN, a first order projected gradient method to recover the signal components. Despite the…

2012-02-08abs ↗pdf ↗

New method adapts neural networks without losing prior knowledge.

problem Understanding and enabling flexible adaptation of neural networks.
method Differential geometry framework, functionally invariant paths (FIP).
result Achieves comparable state-of-the-art performance on continual learning and sparsification tasks.

Study torus knots in lens spaces using Gromov-Witten invariants and topological recursion.

problem Computing Gromov-Witten invariants for torus knots in lens spaces.
method Construct Lagrangian sub-manifolds and relate to topological recursion.
result Verify a conjecture in lens space for Gromov-Witten invariants.

A new method simulates implied volatility surfaces for multiple assets.

problem Generating consistent market scenarios for multiple asset implied volatilities.
method Combining functional data analysis and neural SDEs with a penalty for model misspecification.
result Simulated market scenarios are consistent with historical features and lie within the sub-manifold of essentially free static arbitrage.

New geometric properties discovered in a specific Frobenius manifold.

problem Exploring hidden geometric aspects of a specific Frobenius manifold.
method Proved the manifold is pseudo-elliptic, sub-manifold of a Lorentzian projective manifold, and unraveled Maurer-Cartan structures.
result Found causality conditions bridging Lorentzian and probabilistic concepts.

A new multi-scale vector quantization method for unsupervised data.

problem Efficiently reconstructing unsupervised data with minimal distortion.
method Reconstruction trees, inspired by decision trees, explore data in a multi-scale fashion.
result Analysis of expected distortion under fixed unknown distribution, with asymptotic and finite sample results.

The structure of a diffeomorphism invariant Lagrangians for an extended object W embedded in a bulk space M is discussed by following a close analogy with the relativistic particle in electromagnetic field as a system that is reparametrization-invariant. The current construction naturally contains, relativistic point p…

2003-11-06abs ↗pdf ↗

Study uniform convergence of random walk Laplacians to diffusion Laplacian on smooth manifolds.

problem Uniform convergence of random walk Laplacians to diffusion Laplacian on smooth manifolds.
method Analysis of random walks on geometric and directed kNN graphs, using concentration tools and differential geometry.
result Uniform convergence of kkNN Laplacians to diffusion Laplacian, without continuity of transition kernel.

Joint training with autoencoder improves relation learning in knowledge bases.

problem Learning relations in knowledge bases is challenging due to compositional constraints.
method Joint training of relations with an autoencoder to capture compositional constraints.
result Joint training leads to interpretable sparse codings and improved performance.

The paper analyzes the latent geometry of generative diffusion models.

problem The manifold overfitting phenomenon in generative models.
method Statistical physics approach to analyze the spectrum of eigenvalues and singular values of the Jacobian of the score function.
result Three distinct qualitative phases during the generative process: trivial, manifold coverage, and consolidation phases.

We write the Euler characteristic X(G) of a four dimensional finite simple geometric graph G=(V,E) in terms of the Euler characteristic X(G(w)) of two-dimensional geometric subgraphs G(w). The Euler curvature K(x) of a four dimensional graph satisfying the Gauss-Bonnet relation sum_x K(x) = X(G) can so be rewritten as …

2013-07-15abs ↗pdf ↗