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

Trend · papers per month

138276413551 · Jun 202019922001200920172026
48 results for Stability Analysis

Lyapunov's second theorem is an essential tool for stability analysis of differential equations. The paper provides an analog theorem for incremental stability analysis by lifting the Lyapunov function to the tangent bundle. The Lyapunov function endows the state-space with a Finsler structure. Incremental stability is…

2012-08-14abs ↗pdf ↗

Improved stability analysis of neural network systems using Zames-Falb multipliers.

problem Analyzing stability of linear systems with neural network nonlinearities.
method Using integral quadratic constraints, sector-bounded and slope-restricted structure, and acausal Zames-Falb multipliers.
result Flexible and versatile framework for stability analysis with improved computational efficiency.

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.

This paper analyzes stability and generalization of Markov chain stochastic gradient methods.

problem Analyzing stability and generalization of Markov chain stochastic gradient methods.
method Algorithmic stability in statistical learning theory.
result Established optimal generalization bounds for both smooth and non-smooth cases.

Future grid scenario analysis requires a major departure from conventional power system planning, where only a handful of most critical conditions is typically analyzed. To capture the inter-seasonal variations in renewable generation of a future grid scenario necessitates the use of computationally intensive time-seri…

2016-12-14abs ↗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.

This work examines the stability of GD and SGD near minima, revealing nonlinear dynamics that differ from linear analysis.

problem The stability of optimization algorithms like GD and SGD near minima is not well understood.
method The authors derive an exact criterion for stable oscillations of GD near minima in the multivariate setting, considering high-order derivatives.
result Nonlinear dynamics can diverge in expectation even if a single batch is unstable, challenging linear analysis.

Paper improves stability analysis of SGD for various loss functions and data distributions.

problem Improving stability analysis of SGD for non-convex loss functions and data distributions.
method Analyzes stability of SGD for convex and non-convex loss functions, and improves data-dependent bounds.
result Improved stability bounds for non-convex loss functions and convex regularized loss functions.

This paper analyzes HTL using stability theory for binary classification.

problem Analyzing HTL's theoretical behavior in binary classification tasks.
method Stability analysis of regularized empirical risk minimizers.
result Derives generalization bounds for training error, excess risk, and cross-validation.

Study on reducing dimensionality in high-dimensional regression with kernel methods and stability analysis.

problem Analyzing errors in high-dimensional regression with dimensionality reduction and kernel regression.
method Derive a stability result for kernel regression with Wasserstein distance and apply it to PCA to deduce convergence rates.
result Two-step procedure yields useful convergence rates in semi-supervised settings.

Geometric stability measures neural network robustness, distinguishing from similarity metrics.

problem Lack of robustness in neural network representations.
method Introduces geometric stability, quantified by Shesha metric measuring self-consistency.
result Stability and similarity are uncorrelated, revealing distinct properties of neural network robustness.

Study shows how to control jump-diffusion processes with stable feedback controls in reinforcement learning.

problem Control jump-diffusion processes with unknown coefficients in reinforcement learning.
method Lipschitz continuous optimal feedback controls, stability analysis of forward-backward SDEs, least-squares algorithm.
result Achieves O(NlnN)O(\sqrt{N\ln N}) regret for linear-convex learning problems with jumps.

This paper analyzes the stability and generalization of triplet learning algorithms.

problem Lack of theoretical understanding of triplet learning's generalization performance.
method Stability analysis and high-probability generalization bounds for triplet learning algorithms.
result Established general high-probability generalization bound for triplet learning algorithms.

Paper analyzes stability and generalization of SCO algorithms.

problem Understanding how SCO algorithms perform on unseen data.
method Algorithmic stability analysis in statistical learning theory.
result Derives dimension-independent excess risk bounds for SCGD and SCSC.

Study stability of contingent claim solutions under probabilistic perturbations.

problem Stability of solutions to discrete-time contingent-claim problems under uncertainty.
method Use Rockafellian perturbations to analyze stability of solutions.
result Establishes convergence of dual problems and shadow prices.

The article analyzes the stability of a curve shortening flow for planar networks.

problem Stability analysis of anisotropic curve shortening flow for planar networks.
method Used Lojasiewicz-Simon gradient inequality to derive stability results.
result For initial data close to an energy minimizer, the flow exists globally and converges to a different energy minimum.

The paper explores stability and generalization of deep GCNs.

problem Understanding the stability and generalization of deep GCNs from a theoretical perspective.
method Theoretical analysis of stability and generalization properties of deep GCNs.
result The stability and generalization of deep GCNs are influenced by the maximum absolute eigenvalue of the graph filter operators and the depth of the network.

Paper proposes an unsupervised feature selection algorithm with stability guarantees.

problem Feature selection for dimension reduction and interpretability.
method Proposes a novel unsupervised feature selection algorithm with stability guarantees.
result The algorithm has superior generalization performance and stable selected features.

The paper analyzes stability and generalization of shallow neural networks using gradient methods.

problem Understanding the generalization of overparameterized shallow neural networks.
method The paper uses gradient descent and stochastic gradient descent to study shallow neural networks, developing consistent excess risk bounds.
result The analysis improves on existing methods by providing a refined estimation of iterates and Hessian eigenvalues, leading to better excess risk bounds.

Stability of biharmonic maps in critical dimension proven.

problem Stability of biharmonic maps between manifolds in critical dimension.
method Generalization of Morse stability theory to biharmonic maps, development of strong energy quantization method.
result Strong energy quantization in a wide class of problems in geometric analysis.

New rigidity results for scalar curvature with stabilized conditions.

problem Establishing rigidity for scalar curvature with stabilized conditions.
method Construction of foliations and development of a monotone quantity using Ricci flow and heat equation.
result Generalized classical scalar curvature rigidity results to the \(T^{ times}\)-stabilized setting.

New cyclicity measures defined in weighted Besov spaces, with stability and geometric analysis.

problem Characterizing cyclicity in weighted Besov spaces.
method Defining cyclicity indices based on potential theory and capacity, studying stability under perturbations, and linking zero set structure to cyclicity.
result Novel invariants and conditions for cyclicity in various function spaces.

The study analyzes numerical stability in large language models using mixed-precision arithmetic.

problem Numerical stability of large language models using low-precision arithmetic.
method Developed a mixed-precision analysis of transformer inference, deriving bounds for condition numbers and forward error.
result Established that numerical stability is determined by the interplay between weight magnitude and the growth of the residual stream.

New analysis improves understanding of bilevel optimization stability and generalization.

problem Understanding how well bilevel optimization algorithms generalize.
method Algorithmic stability arguments and generalization bounds for three bilevel minimax solvers.
result Precise trade-off between algorithmic stability, generalization gaps, and practical settings.

Study on stability of 3D sessile drops, identifying degenerate kernel.

problem Linear stability of three-dimensional sessile drops with a free contact line.
method Derived constrained second variation, formulated Jacobi problem, combined geometric and Fourier analysis.
result Kernel of the constrained Jacobi operator is exactly the space of horizontal translations under pressure-volume nondegeneracy.

Gradient descent at edge of stability stabilizes implicitly, following projected gradient descent.

problem Gradient descent's stability and sharpness behavior at the edge of instability.
method Cubic Taylor expansion analysis of gradient descent dynamics.
result Gradient descent at edge of stability implicitly follows projected gradient descent.

Local Neural Operators enable efficient system-level analysis of complex PDEs.

problem System-level analysis of large-scale dynamical systems using neural operators.
method Integrating local Neural Operators with Krylov subspace iterative methods for stability and bifurcation analysis.
result Demonstrated effectiveness of local Neural Operators in fixed-point, stability, and bifurcation analysis of nonlinear PDEs.

Study on stability of GCNNs under graph perturbations.

problem Limited theoretical understanding of GCNN stability.
method Proposes a probabilistic framework to analyze GCNN stability under various graph perturbations.
result Demonstrates the importance of data distribution in stability analysis.

In this paper, simple mathematical models from Control Theory are applied to three very important economic paradigms, namely (a) minimum wages in self-regulating markets, (b) market-versus-true values and currency rates, and (c) government spending and taxation levels. Analytical solutions are provided in all three par…

2013-03-23abs ↗pdf ↗

This paper enhances stability selection by evaluating overall results robustness and identifying optimal regularization values.

problem Improving the robustness and reliability of high-dimensional variable selection.
method Developed a stability estimator to evaluate stability of stability selection results, calibrating key parameters.
result Identified optimal regularization value and improved stability of variable selection.

Stochastic momentum methods have been widely adopted in training deep neural networks. However, their theoretical analysis of convergence of the training objective and the generalization error for prediction is still under-explored. This paper aims to bridge the gap between practice and theory by analyzing the stochast…

2018-08-30abs ↗pdf ↗

In this paper we extend the stability results of [4]}. Our utility maximization problem is defined as an essential supremum of conditional expectations of the terminal values of wealth processes, conditioned on the filtration at the stopping time ττ. To establish our results, we extend the classical results of convex …

2010-10-20abs ↗pdf ↗

The paper analyzes Indian stock sectors using multifractal analysis for long and short-term investment.

problem Investment risk and stability in Indian stock sectors.
method Sector-wise multifractal analysis of Bombay Stock Exchange, India, over short and long time scales.
result Long-term investment in stable sectors is more profitable, while sectors with large fluctuations may lead to downturns.