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.

168,695 papers · 148 categories

Trend · papers per month

63126189252 · Jun 202619922001200920172026
48 results for Manifold Hypothesis

The paper refutes the manifold hypothesis for image data and proposes the union of manifolds hypothesis.

problem The manifold hypothesis fails to capture the structure of image data.
method Empirical verification of the union of manifolds hypothesis on image datasets.
result Image data lies on a disconnected set with varying intrinsic dimensions.

Study shows diffusion models adapt to manifold hypothesis without dimensionality issues.

problem Empirical success of diffusion models in high-dimensional data.
method Developed a new framework connecting diffusion models to Gaussian Processes theory.
result Achieves rates independent of ambient dimension in terms of score learning and sampling complexity.

New approach combines geometric and probabilistic methods to estimate manifold dimension in high-dimensional data.

problem Estimating the dimension of manifolds in high-dimensional data.
method Combines a modified box-counting algorithm (geometric) and a new probabilistic method (nearest neighbor distance analysis).
result The combined method is robust, fast, and effective in estimating manifold dimension.

Paper investigates hardness of learning neural networks under manifold hypothesis.

problem Hardness of learning neural networks under the manifold hypothesis.
method Extending proofs of hardness in the SQ and cryptographic settings to the geometric setting.
result Learning is hard under input manifolds of bounded curvature but learnable with additional assumptions on manifold volume.

This paper proves the manifold hypothesis for lower embedding dimensions using osculating hyperspheres.

problem The dataset lies on a low-dimensional submanifold in high-dimensional space.
method Constructing osculating hyperspheres and applying surgery theory to embed the hypersurface.
result The manifold hypothesis holds for embedding dimensionalities up to d1d-1.

Unpublished results of S Straus and W Browder state that two notions of homotopy equivalence for manifolds with smooth group actions - isovariant and equivariant - often coincide under a condition called the Gap Hypothesis; the proofs use deep results in geometric topology. This paper analyzes the difference between th…

2009-04-03abs ↗pdf ↗

IMA addresses non-identifiability in nonlinear ICA by assuming orthogonal Jacobian columns.

problem Non-identifiability in nonlinear ICA.
method IMA assumes orthogonal Jacobian columns and extends to manifold settings.
result IMA circumvents non-identifiability issues and can be beneficial for higher-dimensional observations.

Langevin Dynamics speeds up mixing time with manifold hypothesis and multi-scale approach.

problem Langevin Dynamics struggles in high dimensions and nonconvex landscapes.
method Utilizes manifold hypothesis to reduce mixing time and employs multi-scale approach to improve image generation quality.
result Mixing time depends on intrinsic dimension rather than ambient dimension, significantly reducing computational complexity.

Diffusion models adapt to data geometry through log-domain smoothing.

problem Understanding why diffusion models generalize well across diverse domains.
method Investigating the role of score matching and log-domain smoothing in diffusion models.
result Log-domain smoothing adapts the diffusion model to the data manifold.

Optimal systolic inequality proved for manifolds with positive bi-Ricci curvature.

problem Proving optimal systolic inequalities on manifolds with positive bi-Ricci curvature.
method Minimal surfaces method under the Generic Regularity Hypothesis.
result Optimal systolic inequality proved in all dimensions.

A result of M. Ledoux is that a complete Riemannian manifold with non negative Ricci curvature satisfying the Euclidean Sobolev inequality is the Euclidean space. We present a shortcut of the proof. We also give a refinement of a result of B-L. Chen et X-P. Zhu about locally conformally flat manifolds with non negative…

2011-07-29abs ↗pdf ↗

Estimates curvature of network manifolds to understand community structure.

problem Understanding the geometry of network models to infer community structure.
method Develops hypothesis tests to determine manifold type, dimension, and curvature from noisy distance matrices.
result Consistently estimates manifold type, dimension, and curvature from Riemannian manifolds of constant curvature.

Under suitable invertibility hypothesis, the spectrum of the Dirac operator on certain open spin Riemannian manifolds is discrete, and obeys a growth law depending qualitatively on the (in)finiteness of the volume.

2003-10-06abs ↗pdf ↗

Method constructs rigid associative submanifolds in twisted G2-manifolds.

problem Constructing rigid associative submanifolds in twisted G2-manifolds.
method Introducing a gluing theorem for asymptotically cylindrical associative submanifolds in ACyl G2-manifolds.
result Yields many new topological types of rigid associative submanifolds.

Diffusion models can generalize well even with coarse scores, thanks to the manifold hypothesis.

problem Understanding why diffusion models generate novel samples with coarse scores.
method Exploring the manifold hypothesis to explain diffusion model behavior.
result Diffusion models trained with coarse scores can achieve near-parametric rates of generalization, faster than estimating the full data distribution.

The hypothesis that high dimensional data tend to lie in the vicinity of a low dimensional manifold is the basis of manifold learning. The goal of this paper is to develop an algorithm (with accompanying complexity guarantees) for fitting a manifold to an unknown probability distribution supported in a separable Hilber…

2013-10-01abs ↗pdf ↗

A framework for hypothesis testing on attributed graphs using sampling.

problem Statistical testing on graph data, especially large attributed graphs.
method Sampling-based framework with PHASE and PHASEopt for accurate and efficient hypothesis testing.
result PHASE and PHASEopt improve accuracy and efficiency of hypothesis testing in attributed graphs.

We study transversely Lorentzian foliations on the closed 3-manifolds. We classify them under a completeness hypothesis and we deduce the dual classification of codimension 1 geodesically complete timelike totally geodesic foliations. Besides we provide an example of a Lorentzian foliation on a compact 3-manifold which…

2006-01-19abs ↗pdf ↗

Generative models can approximate high-dimensional data from lower dimensions without needing a latent dimension equal to or greater than the data's intrinsic dimension.

problem Theoretical limitations on the latent dimension required for generative models to approximate high-dimensional data distributions.
method Inspired by space-filling curves, the work demonstrates that generative networks can approximate distributions on dd-dimensional manifolds from inputs of any arbitrary dimension, even lower than dd.
result Generative models can approximate high-dimensional data distributions from lower-dimensional inputs without needing a latent dimension equal to or greater than the data's intrinsic dimension.

A new Gaussian process regression method infers implicit manifold structure from data.

problem Scaling Gaussian process regression to high-dimensional data.
method Proposes a fully differentiable Gaussian process regression technique that infers implicit manifold structure from data.
result Improves predictive performance and calibration of standard Gaussian process regression in high-dimensional settings.

In 1941 Sumner Myers proved that if the Ricci curvature of a complete Riemann manifold has a positive infimum then the manifold is compact and its diameter is bounded in terms of the infimum. Subsequently the curvature hypothesis has been weakened, and in this paper we weaken it further in an attempt to find the ultima…

2005-01-24abs ↗pdf ↗

The paper proves that most metrics satisfy a strong version of Arnold's conjecture for Laplace eigenvalues.

problem Understanding metrics that satisfy a strong version of Arnold's conjecture for Laplace eigenvalues.
method Using geometric characterizations and perturbation theory, the paper proves the conjecture for most metrics.
result The Strong Arnold Hypothesis is satisfied for all metrics except for a set of infinite codimension.

Paper proves diffusion models work on manifolds.

problem Current diffusion models assume densities are w.r.t. Lebesgue measure, limiting their applicability.
method Introduced convergence results for diffusion models on more general target distributions.
result Quantitative bounds on Wasserstein distance for target and generated distributions.

We prove that for certain sequences of hyperbolic three--manifolds with cusps which converge to hyperbolic three--space in a weak ("Benjamini-Schramm") sense and certain coefficient systems the regularized analytic torsion approximates the L2L^2-torsion of the universal cover under an additional hypothesis. We also pro…

2012-12-13abs ↗pdf ↗

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.

MSA compares neural representations' intrinsic geometry for better understanding.

problem Existing similarity measures fail to capture subtle distinctions between neural network solutions.
method Metric similarity analysis (MSA) using Riemannian geometry.
result MSA can disentangle features of neural computations and compare nonlinear dynamics.

We present a study of generalization for data-dependent hypothesis sets. We give a general learning guarantee for data-dependent hypothesis sets based on a notion of transductive Rademacher complexity. Our main result is a generalization bound for data-dependent hypothesis sets expressed in terms of a notion of hypothe…

2019-04-09abs ↗pdf ↗

Generative models learn complex data from low-dimensional manifolds.

problem Theoretical justification for generative models on manifold structures.
method Prove statistical guarantees of generative networks under Wasserstein-1 loss, considering intrinsic dimensionality.
result Generative networks converge to zero at a fast rate depending on intrinsic dimensionality, not ambient data dimension.

This paper proposes grid cells encode position via a conformal isometric embedding of 2D physical space.

problem Hexagonal grid firing patterns in grid cells.
method Learning a distance-preserving position embedding in neural space using a recurrent neural network.
result The conformal isometric embedding of 2D physical space into neural space explains hexagonal grid firing patterns.

The paper sets thresholds for testing correlation in hypergraphs, distinguishing between independent and correlated states.

problem Testing correlation between two hypergraphs under different models.
method Derives sharp information-theoretic thresholds for distinguishing between null and alternative hypotheses.
result The testing threshold decreases as the hypergraph's uniformity (m) increases, making correlation testing easier for higher uniformity.

We give an intrinsic definition of the special geometry which arises in global N=2 supersymmetry in four dimensions. The base of an algebraic integrable system exhibits this geometry, and with an integrality hypothesis any special Kahler manifold is so related to an integrable system. The cotangent bundle of a special …

1997-12-04abs ↗pdf ↗

Hypothesis testing is an important problem with applications in target localization, clinical trials etc. Many active hypothesis testing strategies operate in two phases: an exploration phase and a verification phase. In the exploration phase, selection of experiments is such that a moderate level of confidence on the …

2018-12-04abs ↗pdf ↗

Learnable multiclass hypothesis classes don't always have a sample compression scheme of fixed size.

problem The limitation of sample compression schemes for multiclass hypothesis classes.
method Analysis of DS dimension and sample compression schemes.
result Learnable multiclass hypothesis classes do not always have a sample compression scheme of fixed size.