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

3468102136 · Jun 202019922001200920172026
48 results for Lipschitz comparison

The paper introduces new volume measures and volume comparison inequalities for Lorentzian spaces.

problem Volume comparison in Lorentzian pre-length spaces.
method Introducing modified timelike Hausdorff measures and establishing volume comparison inequalities using timelike Lipschitz maps.
result Coincidence of modified and original volume measures on smooth spacetimes and some pre-length spaces.

Abstract cone operators prove scalar curvature comparisons on singular manifolds.

problem Proving scalar curvature inequalities on manifolds with cone singularities.
method Using index theory for twisted Dirac operators on Lipschitz bundles.
result Lipschitz rigidity for scalar curvature on odd-dimensional manifolds.

The paper proves new comparison theorems for sub-Laplacian in foliations with minimal leaves.

problem Proving comparison theorems for sub-Laplacian in Riemannian foliations with minimal leaves.
method Using Riemannian foliations with minimal leaves, the paper proves comparison theorems for the sub-Laplacian.
result The comparison theorems yield a Bonnet-Myers type theorem, stochastic completeness, and Lipschitz regularization property for the sub-Riemannian semigroup.

This paper develops a theory of Lipschitz comparisons of hyperbolic surfaces analogous to the theory of quasi-conformal comparisons. Extremal Lipschitz maps (minimal stretch maps) and geodesics for the `Lipschitz metric' are constructed. The extremal Lipschitz constant equals the maximum ratio of lengths of measured la…

1998-01-09abs ↗pdf ↗

We give a definition of convergence of differential of Lipschitz functions with respect to measured Gromov-Hausdorff topology. As their applications, we give a characterization of harmonic functions with polynomial growth on asymptotic cones of manifolds with nonnegative Ricci curvature and Euclidean volume growth, and…

2010-05-06abs ↗pdf ↗

We study the Lipschitz metric on Teichmuller space (defined by Thurston) and compare it with the Teichmuller metric. We show that in the thin part of Teichmuller space the Lipschitz metric is approximated up to bounded additive distortion by the sup metric on a product of lower-dimensional spaces (similar to the Teichm…

2005-10-07abs ↗pdf ↗

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.

Let ΣΣ be a hypersurface in an nn-dimensional Riemannian manifold MM, n2n\geqslant 2. We study the isometric extension problem for isometric immersions f:ΣRnf:Σ\to\mathbb R^n, where Rn\mathbb R^n is equipped with the Euclidean standard metric. We prove a general curvature obstruction to the existence of merely differen…

2015-01-13abs ↗pdf ↗

We prove that if a geodesic metric measure space satisfies a comparison condition for isoperimetric profile and if the observable variance is maximal, then the space is foliated by minimal geodesics, where the observable variance is defined to be the supremum of the variance of 1-Lipschitz functions on the space. Our r…

2018-01-04abs ↗pdf ↗

ECPv2 optimizes Lipschitz functions efficiently and scalably.

problem Global optimization of Lipschitz-continuous functions with unknown Lipschitz constants.
method Adapting the Every Call is Precious (ECP) framework, ECPv2 introduces adaptive lower bounds, Worst-m memory, and random projections to reduce computational cost and improve acceptance regions.
result ECPv2 retains ECP's no-regret guarantees with optimal finite-time bounds and expands the acceptance region with high probability.

Given a pseudo-Riemannian metric of regularity C1,1C^{1,1} on a smooth manifold, we prove that the corresponding exponential map is a bi-Lipschitz homeomorphism locally around any point. We also establish the existence of totally normal neighborhoods in an appropriate sense. The proofs are based on regularization, combin…

2013-06-20abs ↗pdf ↗

The paper extends the collar theorem to non-compact surfaces using new comparison theorems.

problem Proving the collar theorem for non-compact surfaces.
method Developed new Toponogov-type triangle comparison theorems.
result Eliminated the compactness hypothesis for the collar theorem.

Recently, in [49], a new definition for lower Ricci curvature bounds on Alexandrov spaces was introduced by the authors. In this article, we extend our research to summarize the geometric and analytic results under this Ricci condition. In particular, two new results, the rigidity result of Bishop-Gromov volume compari…

2010-07-23abs ↗pdf ↗

Unified framework for analyzing graph neural operators converging to graph limits.

problem Analyzing convergence of graph neural operators to graph limits.
method Develops a unified spectral framework for graph neural operators under various graphon assumptions.
result Unified framework enables direct comparison of convergence rates and tradeoffs.

We provide algorithms that guarantee regret RT(u)O~(Gu3+G(u+1)T)R_T(u)\le \tilde O(G\|u\|^3 + G(\|u\|+1)\sqrt{T}) or RT(u)O~(Gu3T1/3+GT1/3+GuT)R_T(u)\le \tilde O(G\|u\|^3T^{1/3} + GT^{1/3}+ G\|u\|\sqrt{T}) for online convex optimization with GG-Lipschitz losses for any comparison point uu without prior knowledge of either GG or u\|u\|. Previous algorithms …

2019-02-24abs ↗pdf ↗

Two accelerated extragradient methods converge at O(1/k)O(1/k) rate for co-hypomonotone inclusions.

problem Solving co-hypomonotone inclusions with sum of Lipschitz and multivalued operators.
method Developed two Nesterov's accelerated extragradient methods for co-hypomonotone inclusions.
result Achieve O(1/k)\mathcal{O}(1/k) last-iterate convergence rates on the residual norm.

Wasserstein-GANs have been introduced to address the deficiencies of generative adversarial networks (GANs) regarding the problems of vanishing gradients and mode collapse during the training, leading to improved convergence behaviour and improved image quality. However, Wasserstein-GANs require the discriminator to be…

2019-11-29abs ↗pdf ↗

There are several Teichmüller spaces associated to a surface of infinite topological type, after the choice of a particular basepoint (a complex or a hyperbolic structure on the surface). These spaces include the quasiconformal Teichmüller space, the length spectrum Teichmüller space, the Fenchel-Nielsen Teichmüller sp…

2010-12-11abs ↗pdf ↗

Researchers find the optimal exercise time for American options using a specific type of diffusion process.

problem Finding the optimal time to exercise American options with a time-dependent Ornstein-Uhlenbeck process.
method Optimal stopping problem, probabilistic arguments, non-linear Volterra-type integral equation, Picard iteration algorithm.
result They derive a non-linear Volterra-type integral equation and prove the exercise boundary's Lipschitz continuity and differentiability almost everywhere.

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.

Unified bounds for iterative algorithms with Gaussian data matrices.

problem Establishing non-asymptotic bounds for iterative algorithms with Gaussian data.
method Explicit coupling between iterates and Gaussian process with deterministic covariance.
result Tight, dimension-free bounds for generalized first-order methods.

Generative Adversarial Networks (GANs) have been promising in the field of image generation, however, they have been hard to train for language generation. GANs were originally designed to output differentiable values, so discrete language generation is challenging for them which causes high levels of instability in tr…

2018-04-08abs ↗pdf ↗

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.

Let QD1(Mg,n)QD^1(\mathcal{M}_{g,n}) be the unit cotangent bundle of the moduli space of Riemann surfaces Mg,n\mathcal{M}_{g,n}. There is a metric dEd_E on QD1(Mg,n)QD^1(\mathcal{M}_{g,n}) that is locally bi-Lipschitz to the Euclidean metrics defined by systems of period coordinates coming from of short and moderate-length saddle conn…

2017-12-01abs ↗pdf ↗

We propose a second-order (Hessian or Hessian-free) based optimization method for variational inference inspired by Gaussian backpropagation, and argue that quasi-Newton optimization can be developed as well. This is accomplished by generalizing the gradient computation in stochastic backpropagation via a reparametriza…

2015-09-09abs ↗pdf ↗

We tackle tensor denoising with unknown permutations, achieving optimal recovery with polynomial estimators.

problem Structured tensor denoising with unknown permutations in recommendation systems, neuroimaging, etc.
method Developed a constrained least-squares estimator in a block-wise polynomial family.
result Achieved the minimax error bound with polynomial estimators of degree up to (m2)(m+1)/2(m-2)(m+1)/2.

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.

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 ↗

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.