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

4080119159 · May 202619922001200920172026
48 results for Lipschitz stability

CLIP controls neural network stability by bounding Lipschitz constants.

problem Neural networks lack mathematical guarantees of stability, especially to adversarial examples.
method Develops a variational regularization method (CLIP) to control the Lipschitz constant of neural networks.
result CLIP provides a tighter bound on the actual Lipschitz constant compared to layer-wise methods.

New method tightens Lipschitz bounds for CNNs efficiently.

problem Lipschitz regularization of Convolutional Neural Networks (CNNs).
method Using Toeplitz matrix theory, introduces a tight and computationally efficient upper bound for convolutional layers.
result Developed an algorithm to train Lipschitz regularized CNNs.

Study examines stability of image-reconstruction algorithms using variational regularization.

problem Stability and robustness of image-reconstruction algorithms in medical imaging.
method Review and novel stability results for p\ell_p-regularized linear inverse problems, focusing on p(1,)p\in(1,\infty).
result Guarantees Lipschitz continuity for small pp and Hölder continuity for larger pp in Lp(Ω)L_p(Ω) function spaces.

The paper proves topological stability between RCD spaces and Riemannian manifolds.

problem Proving topological stability between RCD spaces and Riemannian manifolds.
method Using Gromov-Hausdorff distance and regular homeomorphisms, the paper constructs a map between spaces.
result There exists a regular homeomorphism between RCD spaces and Riemannian manifolds under certain conditions.

We introduce the notion of good coverings of metric spaces, and prove that if a metric space admits a good covering, then it has the same locally Lipschitz homotopy type as the nerve complex of the covering. As an application, we obtain a Lipschitz homotopy stability result for a moduli space of compact Alexandrov spac…

2017-04-28abs ↗pdf ↗

The paper stabilizes invertible neural networks by using Gaussian mixture models.

problem Invertible neural networks can have exploding Lipschitz constants, leading to numerical errors.
method The authors use Gaussian mixture models to stabilize the latent distribution of invertible neural networks.
result Numerical simulations confirm that this modification improves sampling quality in multimodal applications.

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.

An eεe^ε-Lipschitz and co-Lipschitz map, as a metric analogue of an εε-Riemannian submersion, naturally arises from a sequence of Alexandrov spaces with curvature uniformly bounded below that converges to a space of only weak singularities. In this paper we prove its homotopy lifting property and its homotopy stabilit…

2012-11-26abs ↗pdf ↗

The paper trains neural networks with robustness guarantees using semidefinite constraints.

problem Training neural networks with robustness and stability guarantees.
method Exploiting the banded structure of semidefinite constraints, an efficient and scalable training scheme based on interior point methods is set up.
result The method allows for enforcing Lipschitz constraints in large-scale deep neural networks, as demonstrated in numerical examples.

Optimally estimates stability in Lorentzian isoperimetric inequalities.

problem Stability estimates in Lorentzian isoperimetric inequalities.
method Quantitative stability estimates using Fraenkel asymmetry and Lipschitz bounds.
result Optimal stability estimates with universal constants for Lorentzian isoperimetric inequalities.

We study transversality for Lipschitz-Fredholm maps in the context of bounded Fréchet manifolds. We show that the set of all Lipschitz-Fredholm maps of a fixed index between Fréchet spaces has the transverse stability property. We give a straightforward extension of the Smale transversality theorem by using the general…

2015-08-21abs ↗pdf ↗

Generative adversarial networks (GANs) are one of the most popular approaches when it comes to training generative models, among which variants of Wasserstein GANs are considered superior to the standard GAN formulation in terms of learning stability and sample quality. However, Wasserstein GANs require the critic to b…

2019-07-12abs ↗pdf ↗

New scalable Lipschitz bounds improve neural network robustness analysis.

problem Computing tight Lipschitz bounds for deep neural networks is challenging and computationally expensive.
method Derived new closed-form Lipschitz bounds using more general feasible points of LipSDP, avoiding SDP solvers.
result Improved scalability and precision of Lipschitz estimation for large neural networks.

Push-forward models struggle to fit multimodal distributions due to high Lipschitz constants.

problem Expressivity of push-forward generative models in fitting multimodal distributions.
method Analyzing the Lipschitz constant and its relation to the total variation distance and Kullback-Leibler divergence.
result Push-forward models require high Lipschitz constants to approximate multimodal distributions, leading to a trade-off between expressivity and stability.

Given a free factor A of the rank n free group F_n, we characterize when the subgroup of Out(F_n) that stabilizes the conjugacy class of A is distorted in Out(F_n). We also prove that the image of the natural embedding of Aut(F_{n-1}) in Aut(F_n) is nondistorted, that the stabilizer in Out(F_n) of the conjugacy class o…

2010-09-25abs ↗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.

Let ΩR3Ω\subset \mathbb{R}^3 be a Lipschitz domain, and consider a harmonic map v:ΩS2v: Ω\rightarrow \mathbb{S}^2 with boundary data vΩ=φv|\partialΩ= \varphi which minimises the Dirichlet energy. For p2p\geq 2, we show that any energy minimiser uu whose boundary map ψψ has a small W1,pW^{1,p}-distance to φ\varphi is close t…

2018-10-24abs ↗pdf ↗

The Lookahead optimizer improves SGD's performance and generalization without restrictive assumptions.

problem Improving the generalization of SGD with Lookahead.
method A rigorous stability and generalization analysis of the Lookahead optimizer with minibatch SGD, leveraging on-average model stability.
result Derives generalization bounds for convex and strongly convex problems without the restrictive Lipschitzness assumption, demonstrating a linear speedup with batch size.

The paper studies Lipschitz bounds for integral kernels under differentiability assumptions.

problem Understanding the Lipschitz continuity of feature maps associated with integral kernels.
method Analyzes differentiability assumptions to derive explicit formulas for Lipschitz constants and conditions for non-Lipschitz continuity.
result Explicit formulas and conditions for Lipschitz continuity of feature maps associated with various kernels.

The goal of this paper is to study the stability of pure nilpotent structures on a manifold associated to different collapsed metrics. We prove that if two metrics on a nn-manifold of bounded sectional curvature are L0L_0-bi-Lipchitz equivalent and sufficient collapsed (depending on L0L_0 and nn), then up to a diffeo…

2018-05-16abs ↗pdf ↗

The paper studies stability of mean-field variational inference for log-concave distributions.

problem Stability of mean-field variational inference for log-concave distributions.
method Novel approach via linearized optimal transport, lifting non-convex problem to convex optimization over transport maps.
result Dimension-free Lipschitz continuity of the MFVI optimizer with respect to the target distribution, measured in 2-Wasserstein distance.

Study on Gaussian interpolation flows for generative modeling.

problem Theoretical properties and regularizing effect of Gaussian denoising in continuous normalizing flows.
method Unified framework of Gaussian interpolation flow, Lipschitz regularity, existence and uniqueness of flow, stability analysis.
result Established theoretical properties of Gaussian interpolation flows, including Lipschitz continuity and existence of flow.

Study tackles inverse problems on low-dimensional manifolds, proving stability and proposing a reconstruction algorithm.

problem Inverse problems in infinite-dimensional spaces with nonlinear and ill-posed nature.
method Assumption of low-dimensional manifold, proving stability, proposing Landweber-type algorithm.
result Global convergence of the proposed algorithm, Lipschitz stability for specific inverse problems.

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.

Normalization layers control deep neural network capacity, improving stability and generalization.

problem Excessive capacity in deep neural networks leads to overfitting and poor generalization.
method Developed a theoretical framework to explain normalization's role in capacity control.
result Normalization layers reduce the Lipschitz constant exponentially, smoothing the loss landscape and enhancing generalization.

CGNNs use wavelets for continuous function generation in infinite-dimensional spaces.

problem Generating continuous functions in infinite-dimensional spaces for applications like inverse problems.
method Inspired by DCGAN, CGNNs use wavelet multiresolution analysis with convolutional and nonlinear layers.
result CGNNs can be injective under certain conditions on filters and nonlinearity, leading to Lipschitz stability estimates.

Develops a framework for distilling flow models from few steps.

problem Improving few-step sampling in diffusion models for better performance.
method Local approximation errors and dynamical amplification controlled through analytical tractability.
result Deep residual compositions efficiently approximate long-horizon transport with controlled global error.

Improved DP SO with large Lipschitz parameters, handling outliers and heavy-tailed data.

problem Differential privacy in stochastic optimization with large Lipschitz parameters.
method Assumes bounded k-th order moments, provides linear-time algorithms for smooth convex and non-smooth convex losses.
result Improved risk bounds scaling with k-th moment, not uniform Lipschitz parameter.