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

202405607809 · Jun 202019922001200920172026
48 results for Lipschitz continuous functions

GroupSort neural networks can approximate Lipschitz continuous functions.

problem Understanding and improving the expressive power of neural networks with Lipschitz constraints.
method Introduced and studied GroupSort neural networks with constraints on weights, proving their ability to approximate Lipschitz continuous functions.
result GroupSort networks can represent any Lipschitz continuous piecewise linear functions and are well-suited for approximating general Lipschitz continuous functions.

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.

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 ↗

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.

Study on residual Monge-Ampère mass of complex functions with directional Lipschitz continuity.

problem Estimating the residual Monge-Ampère mass of plurisubharmonic functions.
method General decomposition formula under Sasakian structure, L1L^{1}-apriori estimate, upper-bound estimate on residual mass.
result Upper-bound estimate on residual mass for uniformly directional Lipschitz continuity confirmed.

Efficient binary sampling method for global optimization of univariate functions with low regret.

problem Global optimization of univariate loss functions.
method Binary sampling approach to circumvent hard-to-determine query points in traditional methods.
result At most Llog(3T)L\log (3T) and 2.25H2.25H regret for LL-Lipschitz continuous and HH-Lipschitz smooth functions respectively.

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.

Efficient algorithm for global optimization of multivariate Lipschitz functions.

problem Global optimization of multivariate Lipschitz continuous functions.
method Proposes an efficient minimax optimal algorithm using a predetermined query creation rule.
result Achieves an average regret bound of O(LnT1n)O(L\sqrt{n}T^{-\frac{1}{n}}), minimax optimal.

ECP optimizes expensive functions without knowing Lipschitz constant.

problem Optimizing expensive, non-convex functions with unknown Lipschitz constants.
method ECP minimizes evaluations by focusing on potentially optimal regions, eliminating Lipschitz constant estimation.
result Guaranteed no-regret performance and minimax-optimal regret bounds.

LALR adapts learning rate for faster convergence in regression and neural nets.

problem Finding optimal learning rates for faster convergence in regression and neural networks.
method Lipschitz continuity theory applied to Mean Absolute Error and Quantile loss functions.
result Adaptive learning rate policy enables up to 20x faster convergence.

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.

For a bounded domain equipped with a piecewise Lipschitz continuous Riemannian metric g, we consider harmonic map from (Ω,g)(Ω, g) to a compact Riemannian manifold (N,h)Rk(N,h)\subset\mathbb R^k without boundary. We generalize the notion of stationary harmonic map and prove the partial regularity. We also discuss the global Li…

2011-08-22abs ↗pdf ↗

We provide an example of a zero-dimensional compact metric space XX and its closed subspace AA such that there is no continuous linear extension operator for the Lipschitz pseudometrics on AA to the Lipschitz pseudometrics on XX. The construction is based on results of A. Brudnyi and Yu. Brudnyi concerning linear e…

2004-08-15abs ↗pdf ↗

The curse of dimensionality affects neural network optimization, especially with smooth functions.

problem The curse of dimensionality in neural network optimization.
method Examined through the evolution of the parameter distribution under 2-Wasserstein gradient flow.
result The curse of dimensionality persists in neural network optimization, even with smooth functions.

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.

RVFL networks can efficiently approximate Lipschitz functions in L∞ norm.

problem Efficiently approximating Lipschitz continuous functions in L∞ norm.
method Random Vector Functional Link (RVFL) network with ReLU activation functions, proving approximation in L∞ norm.
result An RVFL with ReLU activation functions can approximate Lipschitz continuous functions in L∞ norm.

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.

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.

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.

Lipschitz maps on metric surfaces are rigid if they preserve area.

problem Understanding the rigidity of Lipschitz maps on metric surfaces.
method Established a coarea inequality for continuous Sobolev functions on metric surfaces.
result Proved that 1-Lipschitz maps from a closed metric surface to a closed Riemannian surface preserving area are isometries.

We show that the isoperimetric profile hg(t)(ξ)h_{g(t)}(ξ) of a compact Riemannian manifold (M,g)(M,g) is jointly continuous when metrics g(t)g(t) vary continuously. We also show that, when MM is a compact surface and g(t)g(t) evolves under normalized Ricci flow, hg(t)2(ξ)h^2_{g(t)}(ξ) is uniform Lipschitz continuous and hence $h_{g(t)}(…

2020-01-02abs ↗pdf ↗

We show that for every Lipschitz function ff defined on a separable Riemannian manifold MM (possibly of infinite dimension), for every continuous ε:M(0,+)ε:M\to (0,+\infty), and for every positive number r>0r>0, there exists a CC^\infty smooth Lipschitz function g:MRg:M\to\mathbb{R} such that f(p)g(p)ε(p)|f(p)-g(p)|\leqε(p) for every …

2006-02-02abs ↗pdf ↗

Bayesian optimization and Lipschitz optimization have developed alternative techniques for optimizing black-box functions. They each exploit a different form of prior about the function. In this work, we explore strategies to combine these techniques for better global optimization. In particular, we propose ways to use…

2018-10-10abs ↗pdf ↗

This research explores principles of Lipschitz continuity in neural networks for robustness and generalization.

problem Ensuring robustness and generalization in neural networks, especially to small input perturbations and out-of-distribution data.
method Two complementary perspectives: internal (training dynamics) and external (frequency signal propagation).
result Advances in understanding the principles of Lipschitz continuity in neural networks.

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.

In this note we prove that reconstruction from magnitudes of frame coefficients (the so called "phase retrieval problem") can be performed using Lipschitz continuous maps. Specifically we show that when the nonlinear analysis map α:HRmα:{\mathcal H}\rightarrow\mathbb{R}^m is injective, with (α(x))k=<x,fk>2(α(x))_k=|<x,f_k>|^2, where $…

2014-03-10abs ↗pdf ↗

The paper designs neural networks with assurance for controlling nonlinear systems.

problem Designing neural networks with assurance for nonlinear system control.
method Bounding the number of affine functions needed for a CPWA function, connecting it to a TLL NN architecture.
result The TLL NN architecture is parameterized by the number of affine functions in the CPWA function it realizes.

We model how Lipschitz continuity changes during neural network training.

problem Understanding how Lipschitz continuity evolves during training.
method We use a system of stochastic differential equations to capture the dynamics of Lipschitz continuity under SGD.
result We identify three factors driving the evolution of Lipschitz continuity: gradient flow projection, gradient noise, and Hessian projection.

A new method optimizes in nonstationary environments with many arms efficiently.

problem Optimizing in nonstationary environments with a large number of arms.
method Gaussian interpolation to learn continuous Lipschitz reward functions in nonstationary environments.
result Efficiently learns continuous Lipschitz reward functions with O(T)\mathcal{O}^*(\sqrt{T}) cumulative regret.

We study online optimization of smoothed piecewise constant functions over the domain [0, 1). This is motivated by the problem of adaptively picking parameters of learning algorithms as in the recently introduced framework by Gupta and Roughgarden (2016). Majority of the machine learning literature has focused on Lipsc…

2016-04-07abs ↗pdf ↗

Adversarial attacks against machine learning models are a rather hefty obstacle to our increasing reliance on these models. Due to this, provably robust (certified) machine learning models are a major topic of interest. Lipschitz continuous models present a promising approach to solving this problem. By leveraging the …

2019-04-09abs ↗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 ↗

We study finite energy classes of quasiplurisubharmonic (qpsh) functions in the setting of toric compact K{ä}hler manifolds. We characterize toric qpsh functions and give necessary and sufficient conditions for them to have finite (weighted) energy, both in terms of the associated convex function in R n , and through t…

2018-04-10abs ↗pdf ↗

Lipschitz regularity proved for harmonic map heat flows into CAT(0) spaces.

problem Proving Lipschitz regularity for harmonic map heat flows into CAT(0) spaces.
method Elliptic approximation method
result Every weak solution of the harmonic map heat flow into CAT(0) spaces is Lipschitz continuous in both space and time.