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

131262392523 · Jun 202019922001200920172026
48 results for dimension bounds

The paper introduces gapped scale-sensitive dimensions to improve learning rate bounds.

problem Improving lower bounds on rates of convergence in statistical and online learning.
method Introducing and analyzing gapped scale-sensitive dimensions for function classes.
result Gapped dimensions lead to stronger lower bounds on offset Rademacher averages.

Lower bounds on cone density for nontrivial complements in low dimensions.

problem Finding density limits for minimal cones with nontrivial complements.
method Proving lower bounds on cone density for cones of dimensions less than seven with nontrivial complements.
result Established lower bounds on cone density for minimal cones with nontrivial complements in dimensions less than seven.

Sharp bound on singular set dimension for specific geometric problems.

problem Hausdorff dimension of singular set in free boundary problems.
method Analysis of noncollapsed limits of manifolds with Ricci curvature bounds.
result Dimension bound of singular set is n5n-5.

Paper introduces new bounds linking data compressibility to generalization error.

problem Establishing data-dependent generalization bounds.
method Variable-size compressibility framework linking generalization error to compression rate of input data.
result New bounds depend on empirical data measure, subsuming existing PAC-Bayes and intrinsic dimension bounds.

New bounds for adaptive control in high dimensions without fixed state space.

problem Adaptive control of linear systems in high or infinite dimensions.
method Novel perturbation bound for certainty equivalence, scaling with prediction error.
result First regret bounds for LQR in infinite dimensional systems, independent of ambient dimension.

New bounds found for vertices of hyperbolic polyhedra in dimensions 5 to 12.

problem Determining minimum number of ideal and finite vertices in hyperbolic polyhedra.
method Geometric method of orthogonal gluings combined with double counting and recurrence relations.
result Improved lower bounds for vertices in all dimensions up to 12.

Any closed, connected Riemannian manifold MM can be smoothly embedded by its Laplacian eigenfunction maps into Rm\mathbb{R}^m for some mm. We call the smallest such mm the maximal embedding dimension of MM. We show that the maximal embedding dimension of MM is bounded from above by a constant depending only on the…

2016-05-04abs ↗pdf ↗

Combinatorial dimensions play an important role in the theory of machine learning. For example, VC dimension characterizes PAC learning, SQ dimension characterizes weak learning with statistical queries, and Littlestone dimension characterizes online learning. In this paper we aim to develop combinatorial dimensions th…

2020-02-08abs ↗pdf ↗

Vapnik-Chervonenkis (VC) dimension is a fundamental measure of the generalization capacity of learning algorithms. However, apart from a few special cases, it is hard or impossible to calculate analytically. Vapnik et al. [10] proposed a technique for estimating the VC dimension empirically. While their approach behave…

2011-11-15abs ↗pdf ↗

The study proves curvature bounds for hyperkähler manifolds.

problem Proving curvature invariants of hyperkähler manifolds.
method Analytical proof in complex dimension four, experimental proof in higher dimensions, verification for known manifolds.
result The conjectured curvature invariants are proven to be positive/negative for all known hyperkähler manifolds up to dimension eight.

New lower bounds for sampling from log-concave distributions in higher dimensions.

problem Proving lower bounds for sampling from log-concave distributions in higher dimensions.
method Multiscale construction inspired by geometric measure theory and reduction to block Krylov algorithms.
result Query lower bounds for sampling from log-concave distributions in higher dimensions are established.

We bound two global invariants of cusped hyperbolic manifolds: the length of the shortest closed geodesic (the systole), and the radius of the biggest embedded ball (the inradius). We give an upper bound for the systole, expressed in terms of the dimension and simplicial volume. We find a positive lower bound on the in…

2011-07-28abs ↗pdf ↗

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.

For any manifold with polynomial volume growth, we show: The dimension of the space of ancient caloric functions with polynomial growth is bounded by the degree of growth times the dimension of harmonic functions with the same growth. As a consequence, we get a sharp bound for the dimension of ancient caloric functions…

2019-02-05abs ↗pdf ↗

Paper relates asymptotic dimension to cofinal dimension using coarse proximities.

problem Relating asymptotic dimension to cofinal dimension in metric spaces.
method Introducing coarse proximities and inverse limit constructions.
result Asymptotic dimension is bounded by coarse cofinal dimension and cofinal dimension of Higson corona.

Researchers calculate cohomological dimensions of manifold configuration spaces, proving arithmeticity and providing bounds.

problem Calculating the cohomological dimensions of configuration spaces of manifolds.
method Defined a reduced Chevalley Eilenberg complex and provided precise formulas and bounds.
result Arithmeticity of cohomological dimensions in configuration spaces of manifolds with non-trivial co-dimension one cohomology groups.

In this paper, we use a weighted isoperimetric inequality to give a lower bound on the first Dirichlet eigenvalue of the Laplacian on a bounded domain inside a Euclidean cone. Our bound is sharp, in that only sectors realize it. This result generalizes a lower bound of Payne and Weinberger in two dimensions.

2009-05-03abs ↗pdf ↗

Quantifies scalar curvature under C0C^0 convergence, proving a refined version in all dimensions.

problem Proving a refined quantitative bound for scalar curvature under C0C^0 convergence.
method Established the refined quantitative bound in all dimensions using smoothing techniques.
result Established the refined quantitative bound for scalar curvature in all dimensions.

Study extends compactness theorems to weighted manifolds with integral curvature bounds.

problem Estimating diameter of weighted manifolds under curvature constraints.
method Extended Sprouse's compactness theorems to weighted manifolds with integral curvature bounds. Used ε-range to handle specific cases. Extended segment inequality to weighted manifolds.
result Proved theorems for weighted manifolds with effective dimension ≤ 1 and ≥ dimension.

This work proves lower bounds on a greedy teaching set construction algorithm.

problem Characterize the best-case teaching dimension of a concept class.
method A greedy algorithm that iteratively adds points to the teaching set to restrict the concept class the most.
result Lower bounds on the performance of the greedy approach for small k, extending up to k ≤ c*d for small constant c.

We analyze Lorentzian spacetimes subject to curvature-dimension bounds using the Bakry-Émery-Ricci tensor. We extend the Hawking-Penrose type singularity theorem and the Lorentzian timelike splitting theorem to synthetic dimensions N1N\le 1, including all negative synthetic dimensions. The rigidity of the timelike spli…

2017-07-27abs ↗pdf ↗

This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles needed to forma triangulated embedded orientable surface in R^d having P as its geo…

2002-02-18abs ↗pdf ↗

New bounds on SGD's final iterate convergence rate in constant dimension.

problem Characterize the convergence rate of SGD's final iterate in constant dimension.
method Proved lower bounds of Ω(logd/T)Ω(\log d/\sqrt{T}) and Ω(logd/T)Ω(\log d/T) for non-smooth Lipschitz convex and strongly convex functions respectively.
result First general dimension dependent lower bound on SGD's final iterate convergence rate.

Perimeter minimizers in curved spaces have a singular set no more than 5 dimensions.

problem Understanding the structure of minimizers in spaces with bounded Ricci curvature.
method Analysis of non-collapsed Ricci limit spaces with two-sided curvature bounds.
result The Hausdorff dimension of the singular set is at most \(N-5\).

We introduce the notion of asymptotic cohomology based on the bounded cohomology and define cohomological asymptotic dimension $\as_{\Z} X$ of metric spaces. We show that it agrees with the asymptotic dimension $\as X$ when the later is finite. Then we use this fact to construct an example of a metric space XX of boun…

2006-08-09abs ↗pdf ↗

Lower Ricci curvature bound prevents first Betti number from dropping more than dimension in collapsing manifolds.

problem Understanding how the first Betti number behaves under manifold collapse with Ricci curvature bounds.
method Analyzing sequences of Riemannian manifolds with lower Ricci curvature bounds.
result The first Betti number cannot drop more than the dimension in collapsing manifolds.

Study on Hausdorff dimension and curvature bounds in sub-Lorentzian Heisenberg group.

problem Hausdorff dimension and curvature bounds in sub-Lorentzian Heisenberg group.
method Elementary variational approach, Lorentzian isoperimetric problem, uniform estimate of causal diamonds.
result Heisenberg group has Lorentzian Hausdorff dimension 4 and satisfies neither timelike curvature-dimension nor measure contraction properties.

In Statistical Learning, the Vapnik-Chervonenkis (VC) dimension is an important combinatorial property of classifiers. To our knowledge, no theoretical results yet exist for the VC dimension of edited nearest-neighbour (1NN) classifiers with reference set of fixed size. Related theoretical results are scattered in the …

2019-02-07abs ↗pdf ↗

Two main theorems are proved in this paper. Theorem 1: There is a constant C(n, D) depending only on n and D such that for a closed Riemannian n-manifold satisfying Ric > -(n-1) and Diam < D, the ith bounded Betti number is bounded by C(n, D). Here the ith bounded Betti number is defined as the dimension of the image o…

1999-12-15abs ↗pdf ↗

New insights on eluder dimension for function approximation in machine learning.

problem Complexity measure for online bandits and reinforcement learning with function approximation.
method Study the relationship between eluder dimension and generalized rank for different activation functions.
result Eluder dimension can be exponentially smaller or larger than generalized rank depending on the activation function.