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

3096199281,237 · Jun 202019922001200920172026
48 results for uniform generalization bounds

Sharp bounds on uniform generalization errors in binary linear classification.

problem Understanding the uniform generalization errors in binary linear classification.
method Isoperimetric arguments, Poincaré and log-Sobolev inequalities for joint distributions.
result Sharp concentration bounds on uniform generalization errors, almost sure convergence in broad settings.

We generalize Roe's index theorem for graded generalized Dirac operators on amenable manifolds to multigraded elliptic uniform pseudodifferential operators. This generalization will follow as a corollary from a local index theorem that is valid on any manifold of bounded geometry. This local formula incorporates the un…

2015-02-02abs ↗pdf ↗

PAC-Bayesian theory applied to data-dependent hypothesis sets yields uniform generalization bounds.

problem Proving uniform generalization bounds for data-dependent hypothesis sets.
method Applying PAC-Bayesian framework on 'random sets' and considering data-dependent hypothesis sets.
result Data-dependent uniform generalization bounds are proven, providing tighter and unified results.

This work studies the robustness certification problem of neural network models, which aims to find certified adversary-free regions as large as possible around data points. In contrast to the existing approaches that seek regions bounded uniformly along all input features, we consider non-uniform bounds and use it to …

2019-03-15abs ↗pdf ↗

Study shows gap between uniform convergence and test error in random feature models.

problem Understanding the gap between uniform convergence and test error in random feature models.
method Analytical expressions for uniform convergence over norm balls, interpolators, and minimum norm interpolator risk derived and proved.
result Uniform convergence over interpolators still gives a non-trivial bound of test error even when classical uniform convergence is vacuous.

New algorithms achieve uniform-PAC guarantees for RL with bounded eluder dimension.

problem Achieving strong performance guarantees in reinforcement learning.
method Proposes algorithms for nonlinear bandits and model-based episodic RL with a bounded eluder dimension.
result Achieves uniform-PAC sample complexity that matches state-of-the-art regret bounds or sample complexity guarantees.

This paper refines homotopy theory for cubical sets and uniform spaces.

problem Classical homotopy theory limitations in cubical sets and uniform spaces.
method Develops a uniform-theoretic refinement for cubical sets and uniform spaces, lifting to a full and faithful embedding.
result Lifts classical homotopy categories to new uniform homotopy categories, generalizing cohomology theories.

Equivalence proven between uniformizing varieties and tensors, generalizing uniformization results.

problem Characterizing complex-projective varieties with klt singularities and ample canonical divisors.
method Constructing a uniformizing variation of Hodge structure from slope zero tensors and vice versa.
result Generalization of uniformization results to singular settings, including quotients of tube domains.

We generalize Roe's Index Theorem for operators of Dirac type on open manifolds to elliptic pseudodifferential operators. To this end we introduce a class of pseudodifferential operators on manifolds of bounded geometry which is more general than similar classes defined by other authors. We revisit Spakula's uniform K-…

2014-10-29abs ↗pdf ↗

We revisit Spakula's uniform K-homology, construct the external product for it and use this to deduce homotopy invariance of uniform K-homology. We define uniform K-theory and on manifolds of bounded geometry we give an interpretation of it via vector bundles of bounded geometry. We further construct a cap product with…

2018-08-23abs ↗pdf ↗

Uniform entropy bound for Ricci shrinkers with bounded curvature.

problem Bounding entropy for Ricci shrinkers with specific curvature constraints.
method Establishing uniform entropy bounds for simply connected Ricci shrinkers with a finite second homotopy group and uniform curvature bounds.
result Uniform entropy bound for simply connected Ricci shrinkers with a finite second homotopy group and uniform curvature bounds.

Deep learning generalizes well despite being overparameterized.

problem Why deep networks generalize well despite fitting training data perfectly.
method Empirical study of training methods and derivation of data-dependent generalization bounds.
result Uniform convergence alone is insufficient for explaining generalization in overparameterized settings.

Study infinite genus surfaces and Schottky groups for uniformization.

problem Investigate infinite genus surfaces and Schottky groups for uniformization.
method Definitions and proofs for infinite genus surfaces and Schottky groups, showing uniformization by Schottky groups.
result Infinite genus surfaces and handlebodies can be topologically and quasiconformally uniformized by Schottky groups.

One fundamental goal in any learning algorithm is to mitigate its risk for overfitting. Mathematically, this requires that the learning algorithm enjoys a small generalization risk, which is defined either in expectation or in probability. Both types of generalization are commonly used in the literature. For instance, …

2016-08-22abs ↗pdf ↗

We generalize Roe's index theorem for graded generalized Dirac operators on amenable manifolds to multigraded elliptic uniform pseudodifferential operators. The generalization will follow from a local index theorem that is valid on any manifold of bounded geometry. This local formula incorporates the uniform estimates …

2018-06-06abs ↗pdf ↗

Unified bounds for sketched bilinear forms in machine learning and statistics.

problem Uniform bounds on sketched bilinear forms for modern analyses.
method Generic chaining and new techniques for handling suprema over pairs of sets.
result Improved convergence bounds for sketched Federated Learning and bandit algorithms.

New PAC-Bayesian bounds improve understanding of quantum machine learning generalization.

problem Lack of data-dependent, non-uniform generalization bounds for quantum models.
method Derive PAC-Bayesian generalization bounds for quantum models using channel perturbation analysis.
result First non-uniform, data-dependent generalization bounds for quantum models.

A new method achieves optimal uniformity in designs with minimal flexibility.

problem Achieving optimal uniformity in designs with minimal flexibility.
method Derive a lower bound on the uniformity constant and use a greedy construction to achieve this bound, then extend the scheme for more flexibility.
result A simple greedy construction achieves the optimal uniformity constant.

In this paper we study the uniform perfectness, boundedness and uniform simplicity of diffeomorphism groups of compact manifolds with boundary and open manifolds and obtain some upper bounds of their diameters with respect to commutator length, those with support in balls and conjugation-generated norm.

2019-05-19abs ↗pdf ↗

We derive a uniform bound for the total betti number of a closed manifold in terms of a Ricci curvature lower bound, a conjugate radius lower bound and a diameter upper bound. The result is based on an angle version of Toponogov comparison estimate for small triangles in a complete manifold with a Ricci curvature lower…

1994-11-07abs ↗pdf ↗

The paper provides a new uniform tail bound for empirical processes.

problem Developing a uniform tail bound for empirical processes indexed by a class of functions.
method Introducing a deflation step to the standard generic chaining argument, and using a natural seminorm based on Cramér functions.
result Established a new uniform tail bound for empirical processes.

New bounds on self-normalized martingales improve online linear regression performance.

problem Improving regret bounds in online linear regression.
method Characterizing scale-invariant bounds on self-normalized martingales.
result For d=1d=1, O(logT)O(\log T) doubly-uniform regret is possible; for d>1d>1, sublinear doubly-uniform regret is impossible.

We prove a uniform version of the Tits alternative. As a consequence, we obtain uniform lower bounds for the Cheeger constant of Cayley grahs of finitely generated non virtually solvable linear groups in arbitrary characteristic. Also we show that the algebraic entropy of discrete subgroups of a given Lie group is unif…

2005-07-21abs ↗pdf ↗

We design and mathematically analyze sampling-based algorithms for regularized loss minimization problems that are implementable in popular computational models for large data, in which the access to the data is restricted in some way. Our main result is that if the regularizer's effect does not become negligible as th…

2019-05-26abs ↗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 ↗

The study examines metrics on Riemannian spaces with bounded properties and finds conditions for Lipschitz and uniform bounds.

problem Investigating bounded rough Riemannian metrics and their properties.
method Analyzing the structure of bounded rough Riemannian metrics and finding conditions for Lipschitz and uniform bounds.
result Weak conditions are identified for Lipschitz and uniform bounds on the metrics.

New algorithm for learning mixtures with mostly uniform weights, improving on previous bounds.

problem Learning mixtures of Gaussians with uniform weights and mostly uniform component weights.
method Statistical Query (SQ) lower bound and quasi-polynomial upper bound for testing.
result Quasi-polynomial upper bound for testing mixtures with mostly uniform weights.

Uniform eigenvalue bounds for Hodge Laplacian on manifolds with Ricci curvature and injectivity radius bounds.

problem Establishing uniform bounds for eigenvalues of the Hodge Laplacian on manifolds with specific geometric constraints.
method Using uniform bounds on Ricci curvature, injectivity radius, and diameter, we derive eigenvalue estimates for the Hodge Laplacian.
result Uniform upper bounds for eigenvalues of the Hodge Laplacian on differential forms on manifolds with given geometric constraints.

Unified stability bounds for noisy SGD across convex and non-convex losses.

problem Deriving generalization bounds for noisy stochastic gradient descent.
method Unified approach using Lyapunov functions and applied probability.
result Time-uniform stability bounds for SGD on various loss functions.

A local deformation property for uniform embeddings in metric manifolds (LD) is formulated and its behaviour is studied in a formal view point. It is shown that any metric manifold with a geometric group action, typical metric spaces (Euclidean space, hyperbolic space and cylinders) and for κ\leq 0 the κ-cone ends over…

2013-01-15abs ↗pdf ↗

New method detects communities in complex hypergraphs, matching theoretical limits.

problem Detecting communities in non-uniform hypergraphs with varying hyperedge sizes.
method Developed a spectral theory for weighted non-backtracking operators on non-uniform hypergraphs.
result Achieved the Kesten-Stigum bound for weak recovery in a general class of non-uniform HSBMs.