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

119237356474 · Jun 202019922001200920172026
48 results for stability bound

Paper relaxes stability and generalization assumptions for SGD.

problem Stability and generalization for SGD under restrictive assumptions.
method Introduces on-average model stability and develops novel bounds.
result First-ever-known fast bounds in low-noise setting using stability approach.

New bounds improve generalization in learning scenarios.

problem Limitations of existing information-theoretic bounds in SCO problems.
method Sample-conditioned hypothesis stability and neighboring-hypothesis matrix.
result Sharper generalization guarantees in various learning scenarios.

We introduce a notion of algorithmic stability of learning algorithms---that we term \emph{argument stability}---that captures stability of the hypothesis output by the learning algorithm in the normed space of functions from which hypotheses are selected. The main result of the paper bounds the generalization error of…

2017-02-28abs ↗pdf ↗

The paper explores stability properties of cohomology groups and norms in symplectic and mapping class groups.

problem Stability properties of bounded cohomology in mapping class groups and symplectic groups.
method Utilizes results from Bestvina and Fujiwara, calculates norms of signature classes, and estimates cohomology norms.
result The bounded cohomology of mapping class groups does not stabilize, while that of symplectic groups does not stabilize via isometries.

Paper proposes a new framework to improve stability-based bounds in deep learning.

problem Explaining generalization in overparameterized neural networks.
method Decomposes excess risk dynamics into signal and noise components, applying stability-based bounds only to the noise.
result The decomposition framework improves stability-based bounds and explains generalization in neural networks.

New stability framework relaxes boundedness assumptions for generalization bounds.

problem Overly restrictive assumptions for modern learning settings with heavy-tailed or unbounded losses.
method Develops a stability-based framework requiring only finite LpL_p moment conditions.
result Sharp generalization bounds derived for various learning paradigms.

Paper improves generalization bounds for noisy stochastic algorithms.

problem Improving generalization bounds for noisy stochastic algorithms.
method Introduces Exponential Family Langevin Dynamics (EFLD) and establishes data-dependent expected stability based generalization bounds.
result Sharp generalization bounds with O(1/n) sample dependence and gradient discrepancy.

The study examines stability of Sobolev inequalities on manifolds with Ricci bounds.

problem Stability of Sobolev inequalities on Riemannian manifolds with Ricci curvature lower bounds.
method Combines techniques from smooth and non-smooth geometry, focusing on direct strategies.
result Effective methods revealed for stability of Sobolev inequalities on manifolds with non-negative Ricci curvature and Euclidean volume growth.

The paper relaxes the stability condition to boost confidence in generalization for randomized learning algorithms.

problem The tension between uniform stability and L2L_2-stability in generalization bounds.
method Establishes in-expectation first moment generalization error bounds for L2L_2-stable randomized learning algorithms and uses subbagging to achieve near-tight exponential bounds.
result Improves generalization bounds for convex and non-convex optimization problems with SGD.

There is accumulating evidence in the literature that stability of learning algorithms is a key characteristic that permits a learning algorithm to generalize. Despite various insightful results in this direction, there seems to be an overlooked dichotomy in the type of stability-based generalization bounds we have in …

2019-03-12abs ↗pdf ↗

The paper derives uniform stability-based coverage bounds for conformal prediction methods.

problem Establishing theoretical guarantees for conformal prediction methods.
method Uniform stability perspective applied to full-conformal, jackknife+, and CV+ prediction regions.
result Coverage bounds for finite-dimensional models derived using a concentration argument.

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.

New framework improves worst-case generalization bounds for stochastic optimization.

problem Challenges in providing generalization guarantees for stochastic optimization algorithms.
method Introduces random set stability and empirically relevant complexity measures to avoid intractable mutual information terms.
result Bounded worst-case generalization error in terms of random set stability and empirically relevant complexity measures.

The present paper provides a new generic strategy leading to non-asymptotic theoretical guarantees on the Leave-one-Out procedure applied to a broad class of learning algorithms. This strategy relies on two main ingredients: the new notion of LqL^q stability, and the strong use of moment inequalities. LqL^q stability e…

2016-08-23abs ↗pdf ↗

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 ↗

The paper analyzes stability and convergence rates of entropic and Sinkhorn potentials.

problem Stability and convergence rates of entropic and Sinkhorn potentials.
method Semiconcavity properties of entropic potentials and Schrödinger bridges.
result Exponential convergence rates for gradient and Hessian of Sinkhorn iterates.

This paper considers the stability of online learning algorithms and its implications for learnability (bounded regret). We introduce a novel quantity called {\em forward regret} that intuitively measures how good an online learning algorithm is if it is allowed a one-step look-ahead into the future. We show that given…

2012-11-26abs ↗pdf ↗

New bounds show faster convergence for learning algorithms.

problem Improving risk bounds for learning algorithms.
method Using algorithmic stability and common assumptions like Polyak-Lojasiewicz condition, smoothness, and Lipschitz continuity.
result Achieves convergence rate of O(log2(n)/n2)O(\log^2(n)/n^2) with high probability.

Stability of Yang-Mills connections' Morse indices and nullity in 4D.

problem Stability of Yang-Mills connections' Morse indices and nullity in 4D under weak convergence.
method Proves stability results of the Morse index plus nullity of Yang-Mills connections in dimension 4 under weak convergence.
result Stability of the sum of Morse indices and nullity of a sequence of Yang-Mills connections.

The paper analyzes generalization bounds for NC-SC/NC-C stochastic minimax optimization.

problem Generalization analysis of nonconvex-(strongly)-concave stochastic minimax optimization.
method Established algorithm-agnostic and algorithm-dependent generalization bounds via uniform convergence and stability arguments.
result Sample complexities and generalization bounds for NC-SC and NC-C settings.

We prove some criteria for uniform K-stability of log Fano pairs. In particular, we show that uniform K-stability is equivalent to ββ-invariant having a positive lower bound. Then we study the relation between optimal destabilization conjecture and the conjectural equivalence between uniform K-stability and K-stabilit…

2019-07-11abs ↗pdf ↗

Study shows closed manifolds close to flat tori under Kato Ricci curvature bounds.

problem Stability of closed Riemannian manifolds with small Kato Ricci curvature.
method Geometric and diffeomorphic stability results for manifolds with small Kato Ricci curvature.
result Closed manifolds with small Kato Ricci curvature are close to flat tori and diffeomorphic to tori.

The abstract discusses connections between K-stability, heights, and rational points on Fano varieties.

problem Understanding the density of rational points on Fano varieties.
method Exploring connections between height bounds, K-stability, and Peyre's conjecture.
result Established an analog of height inequalities for real points, related to Kähler-Einstein metrics.

The paper proves stability of Ricci flow for certain initial conditions.

problem Stability of Ricci flow for non-smooth initial metrics.
method Analyzes stability of Ricci flows starting from Reifenberg spaces with bounded curvature.
result Smooth three-dimensional, uniformly Ricci-pinched manifolds are either compact or flat.

The study bounds the stability of Gaussian mixtures under small perturbations.

problem Stability of Gaussian mixtures under small changes in distribution.
method Deriving an explicit bound on parameter stability of spherical Gaussian Mixture Models (sGMM) in a pre-defined model class.
result Upper bound on parameter distance of close sGMMs to the original sGMM, dependent only on the original model.

Upper bounds on revised first Betti number and torus stability for RCD spaces.

problem Bounding the revised first Betti number and stability of RCD spaces.
method Proving an upper bound on the rank of the abelianised revised fundamental group and establishing torus stability.
result Spaces with saturated upper bound on revised first Betti number are mGH-close to flat tori.

New stability theorem for hyperbolic metrics without volume bounds.

problem Stability of finite volume hyperbolic metrics without upper volume bounds.
method Abstract axiomatic framework and bootstrap argument to extend stability result.
result Weaker exponential control of the metric allows for a broader application of the stability theorem.

New algorithm achieves small-loss bounds in online learning with improved rates.

problem Achieving strong stability in online learning algorithms.
method Introduces ρρ-separation to enforce strong stability, unifying previous approaches.
result Oracle-efficient algorithm achieves small-loss bounds with improved rates.

Generalizes tools for studying collapsed manifolds to new geometry.

problem Studying collapsed manifolds with bounded sectional curvature.
method Generalizes fibration and stability theorems for compact group actions on manifolds with local bounded Ricci covering geometry.
result Two generalized results used in Xiaochun Rong's work on almost flat manifolds.

In this paper, We define a F\mathcal{F}-functional and study F\mathcal{F}-stability of λλ-hypersurfaces, which extend a result of Colding-Minicozzi. Lower bound growth and upper bound growth of area for complete and non-compact λλ-hypersurfaces are studied.

2019-11-02abs ↗pdf ↗

PAC-Bayes bounds have been proposed to get risk estimates based on a training sample. In this paper the PAC-Bayes approach is combined with stability of the hypothesis learned by a Hilbert space valued algorithm. The PAC-Bayes setting is used with a Gaussian prior centered at the expected output. Thus a novelty of our …

2018-06-18abs ↗pdf ↗

We show that the number of stabilizations needed to interchange the handlebodies of a Heegaard splitting of a closed 3-manifold by an isotopy is bounded below by the smaller of twice its genus or half its Hempel distance. This is a combinatorial version of a proof by Hass, Thompson and Thurston of a similar theorem, bu…

2008-05-28abs ↗pdf ↗

Global stability bounds for matrix frames in phase retrieval problems.

problem Phase retrieval for matrix frames in various applications.
method Computable global stability bounds for the quasi-linear analysis map β, using Whitney stratification of positive semidefinite matrices of low rank.
result Novel conditions for a frame to be generalized phase retrievable.

The paper explores the generalization of quantum neural networks using stability theory.

problem Understanding the generalization properties of quantum neural networks.
method The authors use algorithmic stability to establish generalization bounds for quantum neural networks.
result The paper provides practical insights into the design and training of quantum neural networks.