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

25.0%50.0%75.0%100.0% · May 199319922001200920172026
48 results for Lipschitz condition

Maps between certain Lipschitz manifolds are isometries if they preserve volume.

problem Volume preservation and isometry conditions for Lipschitz manifolds.
method Volume-preserving 1-Lipschitz maps from integral currents onto infinitesimally Euclidean Lipschitz manifolds.
result Volume-preserving maps are isometries under given conditions.

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.

New method improves optimization algorithms without Lipschitz smoothness.

problem Improving optimization algorithms in the absence of Lipschitz smoothness.
method Dual kernel conditioning (DKC) to provide dual Lipschitz continuity.
result First complexity bounds and iterate convergence for random reshuffling mirror descent.

Proves conditions for Fourier transforms in rank 1 symmetric spaces.

problem Understanding Fourier transform bounds in symmetric spaces.
method Proves sufficient and necessary conditions using Lipschitz and Fourier type integral conditions.
result Establishes bounds for Fourier transforms in rank 1 symmetric spaces with specific moduli of continuity.

We present sufficient conditions for the cohomology of a closed aspherical manifold to be proper Lipschitz in sense of Connes-Gromov-Moscovici [CGM]. The conditions are stated in terms of the Stone-Čech compactification of the universal cover of a manifold. We show that these conditions are formally weaker than the suf…

2002-05-15abs ↗pdf ↗

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 + σ.

Investigates intrinsic Lipschitz sections in nonlinear quotient maps.

problem Analyzing intrinsic Lipschitz sections in non-linear quotient maps.
method Introduced Leibniz formula for intrinsic slope under weaker conditions, used properties of intrinsic dilations in Carnot groups, and provided conditions for sum of sections.
result Found conditions for sum of intrinsically Lipschitz sections in Carnot groups of step 2.

Study maps in semidirect products of groups, proving Lipschitz properties without intrinsic dilations.

problem Proving Lipschitz conditions in semidirect products of groups without intrinsic dilations.
method Using equivalent conditions and properties of projection maps in metric spaces.
result Proves the same Lipschitz results as in Carnot groups, without intrinsic dilations.

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.

In this paper we prove that every definable set has a definable triangulation which is locally Lipschitz and weakly bi-Lipschitz on the natural simplicial stratification of the simplicial complex. We also distinguish a class T of regularity conditions and give a universal construction of a definable triangulation with …

2009-04-08abs ↗pdf ↗

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.

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.

In this paper, two sufficient conditions are provided for given two K-equivalent map-germs to be bi-Lipschitz A-equivalent. These are Lipschitz analogues of the known results on C^r-A-equivalence (0r)(0 \leq r \leq \infty) for given two K-equivalent map-germs. As a corollary of one of our results, a Lipschitz version of …

2013-02-20abs ↗pdf ↗

We characterize locally Lipschitz mappings and existence of Lipschitz extensions through a first order nonlinear system of PDEs. We extend this study to graded group-valued Lipschitz mappings defined on compact Riemannian manifolds. Through a simple application, we emphasize the connection between these PDEs and the Ru…

2007-11-30abs ↗pdf ↗

This is the first paper of two ones. Here we prove that two compact Alexandrov surfaces of bounded integral curvature having no peak points are bi-Lipschitz equivalent if they are homeomorphic one to the other. Also conditions under that two ends having finite integral negative curvature are bi-Lipschitz equivalent are…

2004-09-20abs ↗pdf ↗

A generalization of the Flow-box Theorem is given. The assumption of continuous differentiability of the vector field is relaxed to a local Lipschitz condition. The theorem holds in any Banach space.

2003-05-14abs ↗pdf ↗

The local Lipschitz constant of a neural network is a useful metric with applications in robustness, generalization, and fairness evaluation. We provide novel analytic results relating the local Lipschitz constant of nonsmooth vector-valued functions to a maximization over the norm of the generalized Jacobian. We prese…

2020-03-02abs ↗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.

We define self-adjoint extensions of the Hodge Laplacian on Lipschitz domains in Riemannian manifolds, corresponding to either the absolute or the relative boundary condition, and examine regularity properties of these operators' domains and form domains. We obtain results valid for general Lipschitz domains, and stron…

2004-08-31abs ↗pdf ↗

New shuffling methods improve convergence without Lipschitz smoothness.

problem Lack of convergence guarantees for shuffling methods under non-Lipschitz conditions.
method Revisit shuffling methods, prove convergence under general bounded variance condition.
result Matched current best-known convergence rates without Lipschitz smoothness.

We investigate the challenge of multi-output learning, where the goal is to learn a vector-valued function based on a supervised data set. This includes a range of important problems in Machine Learning including multi-target regression, multi-class classification and multi-label classification. We begin our analysis b…

2020-02-22abs ↗pdf ↗

The paper examines bi-Lipschitz triviality of function germs on singular varieties.

problem Analyzing the bi-Lipschitz triviality of deformations of function germs on singular varieties.
method Introducing strongly rational RX\mathscr R_X-bi-Lipschitz trivial families and providing an infinitesimal criterion for bi-Lipschitz triviality.
result Bi-Lipschitz triviality of deformations of ff on (X,0)(X,0) when XX and ff are homogeneous of the same degree.

In this paper, we study the convergence of generative adversarial networks (GANs) from the perspective of the informativeness of the gradient of the optimal discriminative function. We show that GANs without restriction on the discriminative function space commonly suffer from the problem that the gradient produced by …

2019-02-15abs ↗pdf ↗

The study provides conditions for approximating Riemannian manifolds with polyhedral metrics.

problem Approximating Riemannian manifolds with polyhedral metrics.
method Conditions on curvature tensors for Lipschitz and local polyhedral approximations.
result Conditions are sufficient for local polyhedral approximations, conjectured to be sufficient for global approximations.

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.

We consider the problem of finding sufficient conditions for a locally Lipschitz mapping between Finsler manifolds to be a global homeomorphism. For this purpose, we develop the notion of Clarke generalized differential in this context and, using this, we obtain a version of the Hadamard integral condition for invertib…

2012-01-23abs ↗pdf ↗

The study establishes equivalence of conditions on metric manifolds with finite volume.

problem Characterizing metric spaces with a metric fundamental class.
method Analyzing three conditions on metric manifolds with finite volume.
result Conditions (1), (2), and (3) are equivalent for metric manifolds with finite Nagata dimension.

The paper examines partial regularity of Lipschitz solutions to minimal surface system.

problem Understanding the regularity of solutions to the minimal surface system.
method Investigation of stationary, integral weak, and viscosity solutions; interior gradient estimate using maximum principle.
result Partial regularity results for Lipschitz solutions, including interior gradient estimate.

Lipschitz equivalence of self-similar sets is an important area in the study of fractal geometry. It is known that two dust-like self-similar sets with the same contraction ratios are always Lipschitz equivalent. However, when self-similar sets have touching structures the problem of Lipschitz equivalence becomes much …

2012-07-28abs ↗pdf ↗

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.

The goal of the paper is to design sequential strategies which lead to efficient optimization of an unknown function under the only assumption that it has a finite Lipschitz constant. We first identify sufficient conditions for the consistency of generic sequential algorithms and formulate the expected minimax rate for…

2017-03-07abs ↗pdf ↗

We give sufficient conditions for a Cc1 C^1_c -local diffeomorphism between Fréchet spaces to be a global one. We extend the Clarke's theory of generalized gradients to the more general setting of Fréchet spaces. As a consequence, we define the Chang Palais-Smale condition for Lipschitz functions and show that a functio…

2019-03-12abs ↗pdf ↗

ResNets can approximate input distances under certain conditions, but existing theory is flawed.

problem Theoretical justification for regularizing ResNets to preserve input distances is flawed.
method Frequency analysis perspective to explain effectiveness of regularization schemes.
result Regularization schemes enforce a lower Lipschitz bound on low-frequency projections of images.