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

110219329438 · Jun 202019922001200920172026
48 results for universal bounds

Novel approach to universal online learning for bounded losses, closing open problems.

problem Characterizing processes for universal online learning under non-i.i.d. conditions.
method Characterization of processes admitting strong and weak universal learning, introduction of optimistically universal learning rule.
result Introduction of a novel 1NN algorithm that is optimistically universal for bounded losses.

Minimum width for ReLU networks to approximate L^p functions is max(d_x+1, d_y).

problem Characterizing the minimum width for ReLU networks to approximate L^p functions.
method Analyzing networks with ReLU activation functions and proving the minimum width required.
result The minimum width required for the universal approximation of L^p functions is exactly max(d_x+1, d_y).

In analogy with the vector bundle theory we define universal and strongly universal Lefschetz fibrations over bounded surfaces. After giving a characterization of these fibrations we construct very special strongly universal Lefschetz fibrations when the fiber is the torus or an orientable surface with connected bounda…

2011-06-17abs ↗pdf ↗

The paper tightens bounds on distances between Reeb graphs.

problem Certifying quasi-universality of distances between Reeb graphs.
method Establishes tight bi-Lipschitz bounds for various distances.
result Proves strict universality of the functional contortion distance for contour trees and coincides with interleaving distance for merge trees.

In this paper, we investigate universal estimates for eigenvalues of a buckling problem. For a bounded domain in a Euclidean space, we give a positive contribution for obtaining a sharp universal inequality for eigenvalues of the buckling problem. For a domain in the unit sphere, we give an important improvement on the…

2009-08-26abs ↗pdf ↗

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 ↗

The universal Liouville action equals the renormalized volume of a hyperbolic 3-manifold.

problem Understanding the geometric significance of the universal Liouville action.
method Analyzing the Weil-Petersson universal Teichmüller space and its relation to hyperbolic 3-manifolds.
result The gradient flow of the universal Liouville action converges to the origin, providing a bound on Weil-Petersson distance.

Metric spaces with certain curvature properties are universally infinitesimally Hilbertian.

problem Analyzing the infinitesimal geometry of metric spaces with curvature bounds.
method Proving a metric space with a Gromov-Hausdorff tangent splitting property is universally infinitesimally Hilbertian.
result Metric spaces with curvature bounds are universally infinitesimally Hilbertian.

Group invariant and equivariant Multilayer Perceptrons (MLP), also known as Equivariant Networks, have achieved remarkable success in learning on a variety of data structures, such as sequences, images, sets, and graphs. Using tools from group theory, this paper proves the universality of a broad class of equivariant M…

2020-02-07abs ↗pdf ↗

New method achieves both universality and adaptivity in online convex optimization.

problem Achieve optimal regret guarantees without prior knowledge of function curvature.
method Introduces UniGrad, a novel approach that achieves both universality and adaptivity.
result Achieves universal regret guarantees that adapt to gradient variation.

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 ↗

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 ↗

In this paper we study the growth rates of Artin monoids and we show that 4 is a universal upper bound. We also show that the generating functions of the associated right-angled Artin monoids are given by families of Chebyshev polynomials. Applications to Artin groups and positive braids are given.

2008-05-17abs ↗pdf ↗

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.

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.

We construct a universal space for the class of proper metric spaces of bounded geometry and of given asymptotic dimension. As a consequence of this result, we establish coincidence of the asymptotic dimension with the asymptotic inductive dimensions.

2002-11-04abs ↗pdf ↗

Complex-valued neural networks can approximate any continuous function with bounded widths and depths.

problem Approximating continuous functions with complex-valued neural networks of bounded widths and depths.
method Analyzing activation functions and proving universality for complex-valued networks.
result Deep narrow complex-valued networks are universal if and only if their activation function is neither holomorphic, nor antiholomorphic, nor R\mathbb{R}-affine.

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.

This paper gives a quantitative version of Thurston's hyperbolic Dehn surgery theorem. Applications include the first universal bounds on the number of non-hyperbolic Dehn fillings on a cusped hyperbolic 3-manifold, and estimates on the changes in volume and core geodesic length during hyperbolic Dehn filling. The proo…

2002-04-30abs ↗pdf ↗

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a stochastically independent uniformly distributed unit vector. When the set of unit vectors …

2015-11-19abs ↗pdf ↗

We will discuss fundamental domains for actions of discrete groups on the 3-dimensional Einstein Universe. These will be bounded by crooked surfaces, which are conformal compactifications of surfaces that arise in the construction of Margulis spacetimes. We will show that there exist pairwise disjoint crooked surfaces …

2013-07-24abs ↗pdf ↗

We study the size of the isometry group Isom(M, g) of Riemannian manifolds (M, g) as g varies. For M not admitting a circle action, we show that the order of Isom(M, g) can be universally bounded in terms of the bounds on Ricci curvature, diameter, and injectivity radius of M. This generalizes results known for negativ…

2014-05-09abs ↗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.

We consider the setting of Reeb graphs of piecewise linear functions and study distances between them that are stable, meaning that functions which are similar in the supremum norm ought to have similar Reeb graphs. We define an edit distance for Reeb graphs and prove that it is stable and universal, meaning that it pr…

2018-01-05abs ↗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 ↗

This work shows MLPs can approximate monotonic functions without bounded activations.

problem Optimizing MLPs with monotonic constraints and bounded activations.
method Generalized theoretical results showing MLPs with non-negative weights and saturating activations are universal approximators.
result MLPs with non-negative weights and saturating activations are universal approximators for monotonic functions.