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,742 papers · 148 categories

Trend · papers per month

123245368490 · Jun 202019922001200920172026
48 results for universal lower bounds

It is shown that the diameter of a compact shrinking Ricci soliton has a universal lower bound. This is proved by extending universal estimates for the first non-zero eigenvalue of Laplacian on compact Riemannian manifolds with lower Ricci curvature bound to a twisted Laplacian on compact shrinking Ricci solitons.

2010-07-11abs ↗pdf ↗

In this survey article we will consider universal lower bounds on the volume of a Riemannian manifold, given in terms of the volume of lower dimensional objects (primarily the lengths of geodesics). By `universal' we mean without curvature assumptions. The restriction to results with no (or only minimal) curvature assu…

2003-02-20abs ↗pdf ↗

Paper establishes universal lower bounds and optimal rates for clustering sub-exponential mixture models.

problem Achieving optimal error rates in clustering sub-exponential mixture models.
method Establishes universal lower bounds and demonstrates iterative algorithms' optimality in sub-exponential mixture models.
result Iterative algorithms achieve the universal lower bound in sub-exponential mixture models.

Study on scalar curvature bounds and manifold topological complexity.

problem Understanding the topological complexity of manifolds with scalar curvature constraints.
method Introduced a small scale index theorem to establish bounds for Gromov's simplicial norm.
result Upper bound for Gromov's simplicial norm established in terms of scalar curvature, volume, and injectivity radius.

New lower bounds on embedding dimensions for neural network architectures.

problem Ensuring neural networks can handle symmetries like permutations in high dimensions.
method Novel technique to prove lower bounds on embedding dimensions.
result Proves new lower bounds on embedding dimensions for Deep Sets and Janossy pooling.

This work sets a universal lower bound for learning causal DAGs with atomic interventions.

problem Learning causal DAGs using only observational data results in a Markov equivalence class, requiring interventions to fully orient.
method Developed CBSP orderings and used them to prove a universal lower bound on the number of single-node interventions needed.
result The universal lower bound is within a factor of two of the minimum number of single-node interventions required to fully orient a given Markov equivalence class.

We discuss optimal lower bounds for eigenvalues of Laplacians on weighted graphs. These bounds are formulated in terms of the geometry and, more specifically, the inradius of subsets of the graph. In particular, we study the first non-zero eigenvalue in the finite volume case and the first eigenvalue of the Dirichlet L…

2019-03-06abs ↗pdf ↗

We prove that if YY is the Gromov-Hausdorff limit of a sequence of compact manifolds, MinM^n_i, with a uniform lower bound on Ricci curvature and a uniform upper bound on diameter, then YY has a universal cover. We then show that, for ii sufficiently large, the fundamental group of MiM_i has a surjective homeomorphis…

2000-08-29abs ↗pdf ↗

Smooths metrics on manifolds with curvature bounds and injectivity radius constraints.

problem Smooth metrics on manifolds with curvature and injectivity constraints.
method Bi-Lipschitz smoothing with controlled smoothing and volume lower bounds.
result Proves existence of smooth metrics with curvature bounds and injectivity radius constraints.

Paper establishes a universal growth rate for smooth surrogate losses in classification.

problem Analyzing growth rates of consistency bounds for various surrogate losses.
method Proves square-root growth rate for smooth margin-based losses; extends to multi-class classification.
result Demonstrates a universal square-root growth rate for smooth comp-sum and constrained losses.

We show that deep narrow Boltzmann machines are universal approximators of probability distributions on the activities of their visible units, provided they have sufficiently many hidden layers, each containing the same number of units as the visible layer. We show that, within certain parameter domains, deep Boltzmann…

2014-11-14abs ↗pdf ↗

We first show that a Laplace isospectral family of Riemannian orbifolds, satisfying a lower Ricci curvature bound, contains orbifolds with points of only finitely many isotropy types. If we restrict our attention to orbifolds with only isolated singularities, and assume a lower sectional curvature bound, then the numbe…

2003-01-30abs ↗pdf ↗

We study eigenvalues of polyharmonic operators on compact Riemannian manifolds with boundary (possibly empty). In particular, we prove a universal inequality for the eigenvalues of the polyharmonic operators on compact domains in a Euclidean space. This inequality controls the kkth eigenvalue by the lower eigenvalues,…

2009-10-12abs ↗pdf ↗

The paper studies families of curves on surfaces that realize all types of pants decompositions.

problem Finding the minimal size of families of curves on surfaces that realize all types of pants decompositions.
method Investigates exponential and superlinear bounds for surfaces without punctures, and provides bounds for surfaces with punctures.
result Provides bounds for the minimal size of families of curves on surfaces with and without punctures.

We consider a sequential learning problem with Gaussian payoffs and side information: after selecting an action ii, the learner receives information about the payoff of every action jj in the form of Gaussian observations whose mean is the same as the mean payoff, but the variance depends on the pair (i,j)(i,j) (and may…

2015-10-27abs ↗pdf ↗

We present Rotated Adaptive Tetra-iterated Quantizer (RATQ), a fixed-length quantizer for gradients in first order stochastic optimization. RATQ is easy to implement and involves only a Hadamard transform computation and adaptive uniform quantization with appropriately chosen dynamic ranges. For noisy gradients with al…

2019-08-22abs ↗pdf ↗

The paper proves a quantitative rigidity result for spaces with specific curvature bounds.

problem Understanding the rigidity of spaces with almost maximal volume entropy.
method Analyzing Riemannian manifolds and RCD\operatorname{RCD}-spaces with specific curvature conditions.
result Spaces with almost maximal volume entropy are closely related to hyperbolic space forms.

Sharp bounds on scalar curvature spectrum and rigidity theorems.

problem Understanding scalar curvature bounds and rigidity on manifolds.
method Sharp upper bounds for the bottom spectrum of the Beltrami Laplacian, scalar curvature rigidity theorem.
result Sharp upper bound for the bottom spectrum of the Beltrami Laplacian and scalar curvature rigidity theorem.

We show that the cusp volume of a hyperbolic alternating knot can be bounded above and below in terms of the twist number of an alternating diagram of the knot. This leads to diagrammatic estimates on lengths of slopes, and has some applications to Dehn surgery. Another consequence is that there is a universal lower bo…

2014-10-23abs ↗pdf ↗

Nearly all Gaussian points in high dimensions lie on a common ellipsoid.

problem Finding an ellipsoid that fits a large set of Gaussian points in high dimensions.
method Analyzing a random set of Gaussian points and proving a bound on their concentration.
result The bound nearly confirms a conjecture about fitting Gaussian points to ellipsoids.

The paper proves impossibilities and positive results for universal machine translation.

problem Learning shared sentence representations across multiple language pairs.
method Formal proofs and analysis of natural generative processes.
result Lower bound on translation error and positive results under natural structure.

In his work on singularities, expanders and topology of maps, Gromov showed, using isoperimetric inequalities in graded algebras, that every real valued map on the nn-torus admits a fibre whose homological size is bounded below by some universal constant depending on nn. He obtained similar estimates for maps with va…

2017-03-07abs ↗pdf ↗

We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with L2 regularization: We introduce the margin-adapted dimension, which is a simple function of the second order statistics of the data distribution, and show distribution-specific upper and lower bounds on…

2012-04-05abs ↗pdf ↗

In this paper, we prove uniform lower bounds on the volume growth of balls in the universal covers of Riemannian surfaces and graphs. More precisely, there exists a constant δ>0δ>0 such that if (M,hyp)(M,hyp) is a closed hyperbolic surface and hh another metric on MM with $\area(M,h)\leq δ\area(M,hyp)$ then for every radiu…

2013-04-12abs ↗pdf ↗

This paper studies eigenvalues of the buckling problem of arbitrary order on bounded domains in Euclidean spaces and spheres. We prove universal bounds for the k-th eigenvalue in terms of the lower ones independent of the domains. Our results strengthen the recent work in [28] and generalize Cheng-Yang's recent estimat…

2010-10-12abs ↗pdf ↗

We investigate the filtered theory corresponding to the universal sl(2) foam cohomology Ha,hH_{a,h} for links, where a and h are complex numbers. We show that there is a spectral sequence converging to Ha,hH_{a,h} which is invariant under the Reidemeister moves, and whose E1 term is isomorphic to Khovanov homology. This sp…

2010-06-14abs ↗pdf ↗

Guaranteed bounds for posterior inference in probabilistic programs.

problem Approximating the posterior distribution of probabilistic programs with provable correctness.
method Interval-based trace semantics, soundness and completeness proofs, weight-aware interval type system.
result Guaranteed bounds on the posterior distribution of probabilistic programs are computed and proven to be correct.

Consider a compact Kähler manifold MmM^m with Ricci curvature lower bound RicM2(m+1).Ric_M\geq -2(m+1) . Assume that its universal cover % \widetilde{M} has maximal bottom of spectrum λ1(M~λ_1(\widetilde{M}%) =m^2. Then we prove that M~\widetilde{M} is isometric to the complex hyperbolic space CHm.\Bbb{CH}^m.

2008-02-03abs ↗pdf ↗

New approach finds minimum width for deep, narrow MLPs.

problem Finding the minimum width for deep, narrow MLPs to approximate continuous functions.
method Proposes a framework to simplify finding minimum width into determining a geometrical function w(dx,dy)w(d_x, d_y) based on input and output dimensions.
result Proves that w(dx,dy)w(d_x, d_y) equals the optimal minimum width for deep, narrow MLPs to achieve universality.

Optimal noise excitation for linear system identification reduces sample complexity.

problem Efficiently identifying linear systems with minimal data.
method Active learning algorithm using ordinary least squares and semidefinite programming.
result The proposed algorithm matches lower bounds on sample complexity for any active learning method.