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

101201302402 · May 202619922001200920172026
48 results for Lipschitz bounds

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.

The paper calculates upper bounds on ReLU network Lipschitz constants.

problem Determining the maximum perturbation size for robustness of neural networks.
method Analyzing ReLU, affine-ReLU, and max pooling functions; combining results; tracking zero elements; using a computational approach.
result The method produces the largest known bounds on minimum adversarial perturbations for large networks.

Geodesically complete spaces with curvature bounded above have maps with finite energy that are Lipschitz.

problem Analyzing the properties of geodesically complete spaces with curvature constraints.
method Geometric perturbations of geodesics to curves with zero length on singular sets.
result Every Sobolev map in W1,W^{1,\infty} space has a Lipschitz representative with the same Lipschitz constant as its infinity energy.

Investigates Lipschitz continuity in neural networks across various settings.

problem Understanding the Lipschitz behavior of neural networks.
method Empirical investigation of Lipschitz bounds in different neural network architectures and datasets.
result Remarkable fidelity of the lower Lipschitz bound and a Double Descent trend in both upper and lower bounds.

New parameterization of neural networks with Lipschitz bounds for robustness.

problem Developing robust neural networks with Lipschitz bounds.
method Introducing a new parameterization that admits a Lipschitz bound during training without requiring projections or barrier functions.
result The new parameterization improves robustness to adversarial attacks in image classification.

Efficient local Lipschitz bounds improve neural network robustness.

problem Certifying robustness of neural networks is challenging and often leads to over-regularization.
method Proposes an efficient trainable local Lipschitz upper bound by considering activation functions and weight matrices.
result Consistently outperforms state-of-the-art methods in clean and certified accuracy on various datasets.

New method for differentially private optimization with general Lipschitz conditions.

problem Differentially private optimization under general Lipschitz conditions.
method Generalized Lipschitz condition for per-sample gradients, tuning clip norm based on minimum per-sample Lipschitz constant.
result Efficacy of the recommended clip norm tuning method verified on 8 datasets.

This paper bounds the Lipschitz constants of neural networks and their gradients.

problem Estimating the Lipschitz constant of complex models like neural networks.
method Local upper and lower bounds on Lipschitz constants computed with respect to network parameters.
result It is impossible to derive global upper bounds for the Lipschitz constants of neural networks.

The study connects polyhedral manifolds to Riemannian ones with geometric bounds.

problem Connecting polyhedral manifolds to Riemannian manifolds with geometric constraints.
method Using a theorem by C. Lange and B. Bowditch, the study bounds the curvature and injectivity radius of Riemannian manifolds.
result Polyhedral manifolds with bounded geometry are bi-Lipschitz homeomorphic to Riemannian manifolds with controlled curvature and injectivity radius.

We examine the impact of learning Lipschitz continuous models in the context of model-based reinforcement learning. We provide a novel bound on multi-step prediction error of Lipschitz models where we quantify the error using the Wasserstein metric. We go on to prove an error bound for the value-function estimate arisi…

2018-04-19abs ↗pdf ↗

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.

New MIP formulations for neural network Lipschitz constant estimation.

problem Ensuring robustness of neural networks by calculating their Lipschitz constant.
method Reformulating the neural network Lipschitz estimation problem as a Quadratically Constrained MIP (MIQCQP) problem.
result Solutions of the MIQCQP formulations provide bounds on the Lipschitz constant, with conditions for exactness.

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.

This paper studies bounds for the Lipschitz constant of random neural networks.

problem Quantifying the worst-case robustness of neural networks against adversarial perturbations.
method Analyzes upper and lower bounds for the Lipschitz constant of random ReLU neural networks under specific initialization conditions.
result For deep networks, the upper bound is larger than the lower bound by a logarithmic factor in width.

The study examines the limitations of bi-Lipschitz Normalizing Flows in approximating certain distributions.

problem The expressivity of bi-Lipschitz Normalizing Flows in approximating specific target distributions.
method Characterization of expressivity through lower bounds on Total Variation distance and discussion of potential remedies.
result Several target distributions are difficult to approximate using bi-Lipschitz Normalizing Flows, and lower bounds on their approximation are provided.

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.

Study risk-sensitive reinforcement learning with Lipschitz dynamic risk measures, establishing regret bounds.

problem Risk-sensitive reinforcement learning in Markov decision processes.
method Two model-based algorithms for Lipschitz dynamic risk measures, focusing on regret bounds.
result Upper bounds demonstrate optimal dependencies on actions and episodes, reflecting risk sensitivity vs. sample complexity trade-off.

Improved robustness of 1D CNNs for heart arrhythmia classification.

problem Improving the robustness of 1D CNNs for classification tasks.
method Parameterization using Cayley transform and controllability Gramian for Lipschitz-bounded CNNs.
result Improved robustness of trained Lipschitz-bounded 1D CNNs for heart arrhythmia classification.

Uniform heat kernel bounds lead to synthetic Ricci curvature conditions for Lipschitz manifolds.

problem Establishing synthetic Ricci curvature conditions for Lipschitz manifolds.
method Uniform heat kernel bounds and synthetic Ricci curvature conditions.
result Uniform heat kernel bounds lead to synthetic Ricci curvature conditions for Lipschitz manifolds.

The paper calculates bounds on the local Lipschitz constants of neural network layers.

problem Understanding the Lipschitz constants of neural network layers for robustness analysis.
method Analytical approach to determine upper bounds on local Lipschitz constants of affine-ReLU functions.
result The method produces tighter bounds than the standard conservative bound, especially for small perturbations.

The paper establishes a uniform Lipschitz bound on the square root of the systole function in Teichmüller space.

problem Uniform Lipschitz bounds on geometric functions in Teichmüller space.
method Injectivity radius analysis and Lipschitz bounds on systole function.
result Uniform Lipschitz constant for the square root of the systole function on Teichmüller space.

The paper proposes a method to train NNs with a small Lipschitz constant to improve robustness.

problem Neural networks' susceptibility to adversarial perturbations in safety-critical applications.
method The paper introduces a framework to train multi-layer NNs by minimizing their Lipschitz constant, using an optimization scheme based on the Alternating Direction Method of Multipliers.
result The proposed training procedure successfully increases the robustness of neural networks.

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 ↗

New Lipschitz bound for ReLU networks resists weight rescaling.

problem Lack of robustness guarantees for ReLU networks under weight perturbations.
method Rescaling-invariant Lipschitz bound based on path-metrics.
result The new bound applies to various ReLU-DAG architectures and resists neuron-wise rescalings.

Paper investigates Lipschitz constants of self-attention modules in neural networks.

problem Lipschitz constants of self-attention modules in neural networks.
method Proved standard dot-product self-attention is not Lipschitz for unbounded input domain. Proposed L2 self-attention that is Lipschitz. Derived upper bound on L2 self-attention's Lipschitz constant.
result Proved standard self-attention is not Lipschitz for unbounded input domain and proposed an alternative L2 self-attention that is Lipschitz.

Sharp Lipschitz bounds and gradient estimates for fully nonlinear parabolic equations.

problem Understanding moduli of continuity for fully nonlinear parabolic equations.
method Proving moduli of continuity of viscosity solutions are subsolutions of one-dimensional parabolic equations.
result Sharp Lipschitz bounds and gradient estimates for fully nonlinear parabolic equations with bounded initial data.

Smooths metrics on manifolds with curvature bounds and injectivity radius constraints.

problem Smooth metrics on manifolds with curvature and injectivity constraints.
method Bi-Lipschitz smoothing with controlled smoothing and volume lower bounds.
result Proves existence of smooth metrics with curvature bounds and injectivity radius constraints.

New algorithms for online learning without boundedness or Lipschitz loss assumptions.

problem Online learning with unbounded domains and non-Lipschitz losses.
method Developed an algorithm with a specific regret bound and used it for saddle-point optimization.
result First algorithm achieving non-trivial dynamic regret in an unbounded domain for non-Lipschitz losses.

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.

The study shows that certain graphs are regular at boundary points.

problem Boundary regularity of anisotropic minimal Lipschitz graphs.
method Proves regularity for graphs with bounded anisotropic mean curvature and atomic energy condition.
result Regularity at boundary points with density bounded above by 1/2 + σ.

Sharp Lipschitz bounds for flow-matching and diffusion models with optimal sampling rates.

problem Establishing optimal Lipschitz regularity for flow-matching and diffusion models.
method Sharp Lipschitz regularity theory for flow-matching vector fields and diffusion-model scores.
result Achieves optimal sampling rate of d/N\sqrt{d}/N for Euler-type samplers in dimension dd.

Considering the Teichmüller space of a surface equipped with Thurston's Lipschitz metric, we study geodesic segments whose endpoints have bounded combinatorics. We show that these geodesics are cobounded, and that the closest-point projection to these geodesics is strongly contracting. Consequently, these geodesics are…

2010-11-28abs ↗pdf ↗

Algorithm tackles adaptive discretization in adversarial Lipschitz bandits for dynamic pricing and auctions.

problem Adaptive discretization in adversarial Lipschitz bandits.
method Adversarial Zooming algorithm for adaptive discretization.
result First algorithm for adversarial Lipschitz bandits with instance-dependent regret bounds.

We construct a smooth compact n-dimensional manifold Y with one point singularity such that all its Lipschitz homotopy groups are trivial, but Lipschitz mappings Lip(S^n,Y) are not dense in the Sobolev space W^{1,n}(S^n,Y). On the other hand we show that if a metric space Y is Lipschitz (n-1)-connected, then Lipschitz …

2013-06-27abs ↗pdf ↗

Proposes a weaker version of Strong Cosmic Censorship with curvature bounds.

problem The original Strong Cosmic Censorship conjecture.
method Weakens the conjecture to allow manifolds with bounded curvature and Lipschitz continuity of metrics.
result Proves the conjecture with bounded curvature for sufficiently large p (p>4 with uniform bounds, p>2 without uniform bounds).

Optimizes privacy-preserving optimization for heavy-tailed data.

problem Privacy-preserving optimization with heavy-tailed gradients.
method Pure ε-differential privacy framework for Lipschitz extensions.
result Minimax optimal excess-risk rate for pure ε-DP heavy-tailed SCO.

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.