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

Trend · papers per month

66133199265 · May 202619922001200920172026
48 results for locally Lipschitz

Constructs a map with prescribed local Lipschitz constants on a subset of a manifold.

problem Creating a Lipschitz map with specific local Lipschitz constants on a subset of a manifold.
method Constructs a Lipschitz map that matches a given map on a subset and has a local Lipschitz constant defined by a continuous function.
result A Lipschitz map can be constructed with a local Lipschitz constant prescribed by a continuous function.

Extends Lipschitz functions while preserving local constants.

problem Extending Lipschitz functions on metric spaces while maintaining local constants.
method Extends Lipschitz functions on metric spaces while locally preserving the asymptotic Lipschitz constant.
result Sobolev spaces on metric measure spaces are invariant under isomorphism of mm-structures.

Solutions to a specific problem are shown to be locally Lipschitz but not differentiable.

problem Locally Lipschitz viscosity solutions to the σkσ_k-Loewner-Nirenberg problem on annuli.
method Analytical proof of regularity and non-differentiability.
result Solutions are $C^{1, rac{1}{k}}_{ m loc}$ in each of the annulus regions and have a jump in radial derivative.

New methods show robustness and accuracy can coexist.

problem Inevitability of robustness-accuracy tradeoff in deep learning.
method Prove robustness and accuracy achievable through locally Lipschitz functions; explore combining dropout with robust training methods.
result Achieving robustness and accuracy requires methods imposing local Lipschitzness and deep learning generalization techniques.

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.

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.

The Abstract Boundary singularity theorem was first proven by Ashley and Scott. It links the existence of incomplete causal geodesics in strongly causal, maximally extended spacetimes to the existence of Abstract Boundary essential singularities, i.e., non-removable singular boundary points. We give two generalizations…

2015-08-19abs ↗pdf ↗

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.

New methods solve MI problems with locally Lipschitz operators, improving solution efficiency.

problem Solving monotone inclusions with locally Lipschitz continuous operators.
method Primal-dual extrapolation methods using backtracking line search.
result Improved operation complexity for solving MI problems.

HALO uses local Lipschitz constants to optimize functions efficiently.

problem Efficiently solving global optimization problems with complex objective functions.
method Hybrid Adaptive Lipschizian Optimization (HALO) algorithm that estimates local Lipschitz constants and balances global and local information.
result HALO outperforms other global optimization algorithms on numerous test functions.

We focus our attention on the notion of intrinsic Lipschitz graphs, inside a special class of metric spaces i.e. the Carnot groups. More precisely, we provide a characterization of locally intrinsic Lipschitz functions in Carnot groups of step 2 in terms of their intrinsic distributional gradients.

2019-03-06abs ↗pdf ↗

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.

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 ↗

Uniform Lipschitz continuity of isoperimetric profiles in evolving surfaces.

problem Uniform Lipschitz continuity of isoperimetric profiles in evolving surfaces.
method Normalized Ricci flow on compact surfaces.
result Uniform Lipschitz continuity of isoperimetric profiles under normalized Ricci flow.

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 ↗

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 ↗

Local Lipschitz continuity of sub-elliptic harmonic maps into CAT(0) spaces proved.

problem Proving Lipschitz continuity of sub-elliptic harmonic maps between singular spaces.
method Analyzing sub-elliptic harmonic maps from the Heisenberg group into CAT(0) spaces.
result Local Lipschitz continuity established for sub-elliptic harmonic maps.

Extends involutivity to non-Lipschitz subbundles and proves the Frobenius Theorem.

problem Defining involutivity for non-Lipschitz subbundles and proving the Frobenius Theorem.
method Using generalized functions, the Frobenius Theorem is extended to log-Lipschitz subbundles with sharp regularity estimates.
result For log-Lipschitz involutive subbundles, there exists a homeomorphism with specific regularity properties.

We extend the Newlander-Nirenberg theorem to manifolds with almost complex structures that have somewhat less than Lipschitz regularity. We also discuss the regularity of local holomorphic coordinates in the integrable case, with particular attention to Lipschitz almost complex structures.

2007-10-11abs ↗pdf ↗

Optimistic bounds for multi-output learning using self-bounding Lipschitz condition.

problem Learning vector-valued functions from supervised data.
method Introducing self-bounding Lipschitz condition and proving optimistic bounds using local Rademacher complexity and Srebro's inequality.
result Minimax optimal generalization bounds for multi-output learning, up to logarithmic factors.

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.

We prove that the locally finite simplicial volume and the Lipschitz simplicial volume are additive with respect to certain gluings of manifolds. In particular, we prove that in dimension 3\geq 3 they are additive with respect to connected sums and gluings along π1π_1-injective, amenable aspherical boundary components…

2017-04-15abs ↗pdf ↗

New methods for convex optimization with locally Lipschitz gradient, achieving faster convergence.

problem Optimization problems with locally Lipschitz continuous gradient.
method Accelerated proximal gradient (APG) methods and proximal augmented Lagrangian method.
result Achieved faster convergence rates for convex optimization problems with locally Lipschitz gradient.

Techniques known as Nonlinear Set Membership prediction, Kinky Inference or Lipschitz Interpolation are fast and numerically robust approaches to nonparametric machine learning that have been proposed to be utilised in the context of system identification and learning-based control. They utilise presupposed Lipschitz p…

2017-02-28abs ↗pdf ↗

In 1997, J. Jost [27] and F. H. Lin [39], independently proved that every energy minimizing harmonic map from an Alexandrov space with curvature bounded from below to an Alexandrov space with non-positive curvature is locally Hölder continuous. In [39], F. H. Lin proposed a challenge problem: Can the Hölder continuity …

2013-11-06abs ↗pdf ↗