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

Trend · papers per month

275481108 · May 202619922001200920172026
48 results for Lipschitz coefficients

Study proves existence and uniqueness for differential equations with non-Lipschitz coefficients.

problem Existence and uniqueness for differential equations with non-Lipschitz coefficients.
method Relying on robust Itô integration, prove existence and uniqueness results.
result Existence and uniqueness for one-dimensional differential equations with non-Lipschitz coefficients.

New estimates for nodal and singular sets of parabolic inequalities.

problem Understanding the structure of nodal and singular sets in parabolic inequalities.
method Establishing new estimates for the size and structure of nodal and singular sets using parabolic Lipschitz coefficients.
result Almost all nodal and singular sets are covered by regular parabolic Lipschitz graphs with estimates.

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 ↗

Improved MLMC method for barrier options with non-Lipschitz coefficients.

problem Efficiency improvement for barrier option pricing with non-Lipschitz diffusion.
method Interpolated Drift Implicit Euler MLMC method, Lamperti transformation, Brownian bridge technique.
result Improved efficiency of MLMC for barrier options with non-Lipschitz coefficients.

Study on the nodal set of Dirac equation solutions on manifolds.

problem Understanding the structure of nodal sets of solutions to Dirac equations.
method Proved Hausdorff dimension of nodal sets, extended to locally Lipschitz coefficients, provided stratification results.
result Stratification result for nodal sets, providing new insights even in the smooth case.

We prove strong existence and uniqueness, and Hölder regularity, of a large class of stochastic Volterra equations, with singular kernels and non-Lipschitz diffusion coefficient. Extending Yamada-Watanabe's theorem, our proof relies on an approximation of the process by a sequence of semimartingales with regularised ke…

2019-12-12abs ↗pdf ↗

The paper studies nodal sets of solutions to parabolic equations, proving finiteness and monotonicity properties.

problem Analyzing nodal sets of solutions to parabolic equations with general coefficients.
method Generalized methods to handle time-dependent and Lipschitz continuous coefficients.
result Finiteness and monotonicity properties of the (n1)(n-1)-dimensional Hausdorff measure of nodal sets.

We give a very short and rather elementary proof of Gromov's filling volume inequality for n-dimensional Lipschitz cycles (with integer and Z_2-coefficients) in LL^\infty-spaces. This inequality is used in the proof of Gromov's systolic inequality for closed aspherical Riemannian manifolds and is often regarded as the…

2007-03-29abs ↗pdf ↗

For a normal covering over a closed oriented topological manifold we give a proof of the L2-signature theorem with twisted coefficients, using Lipschitz structures and the Lipschitz signature operator introduced by Teleman. We also prove that the L-theory isomorphism conjecture as well as the C^*_max-version of the Bau…

2002-09-13abs ↗pdf ↗

Continuity of roots of hyperbolic polynomials with smooth coefficients.

problem Continuity of the solution map for hyperbolic polynomials.
method Proving continuity of the solution map from hyperbolic polynomials of degree d with C^d coefficients to their increasingly ordered roots.
result Continuity of the solution map for hyperbolic polynomials with C^d coefficients.

This paper is concerned with the question of reconstructing a vector in a finite-dimensional real Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We analyze various Lipschitz bounds of the nonlinear analysis map and we establish theoretical performance bo…

2013-08-21abs ↗pdf ↗

A major issue in harmonic analysis is to capture the phase dependence of frequency representations, which carries important signal properties. It seems that convolutional neural networks have found a way. Over time-series and images, convolutional networks often learn a first layer of filters which are well localized i…

2018-10-29abs ↗pdf ↗

The covariance of a stationary process XX is diagonalized by a Fourier transform. It does not take into account the complex Fourier phase and defines Gaussian maximum entropy models. We introduce a general family of phase harmonic covariance moments, which rely on complex phases to capture non-Gaussian properties. The…

2019-11-22abs ↗pdf ↗

Paper tackles robust control of SDEs with ambiguity, proving value function existence and applying to investment problems.

problem Robust control of SDEs with ambiguity parameters and non-Lipschitz coefficients.
method Existence and uniqueness of value function established through BSDEs with non-linear growth conditions.
result Existence and uniqueness of value function in proper space, verified through BSDEs.

The paper optimizes interpolation schedules in generative models to improve sampling accuracy.

problem Improving sampling accuracy in generative models with fewer resources.
method Minimizing the averaged squared Lipschitzness of the drift field, using transfer formulas.
result Designed schedules yield more accurate fine-scale statistics at fixed integrator budget.

GenMod uses generative models to approximate high-dimensional PDE solutions with limited evaluations.

problem Quantifying uncertainty in high-dimensional PDE systems with random parameters.
method Develops a method using generative models to approximate polynomial chaos coefficients in underdetermined systems.
result The method outperforms sparsity-promoting methods in approximating PDE solutions with limited evaluations.

We show that for a metric space with an even number of points there is a 1-Lipschitz map to a tree-like space with the same matching number. This result gives the first basic version of an unoriented Kantorovich duality. The study of the duality gives a version of global calibrations for 1-chains with coefficients in $…

2014-09-30abs ↗pdf ↗

Study shows how to control jump-diffusion processes with stable feedback controls in reinforcement learning.

problem Control jump-diffusion processes with unknown coefficients in reinforcement learning.
method Lipschitz continuous optimal feedback controls, stability analysis of forward-backward SDEs, least-squares algorithm.
result Achieves O(NlnN)O(\sqrt{N\ln N}) regret for linear-convex learning problems with jumps.

We prove that every stationary polyhedral varifold minimizes area in the following senses: (1) its area cannot be decreased by a one-to-one Lipschitz ambient deformation that coincides with the identity outside of a compact set, and (2) it is the varifold associated to a mass-minimizing flat chain with coefficients in …

2019-11-30abs ↗pdf ↗

This paper identifies drift Lipschitz budget K as key to diffusion policy expressivity and statistical trade-offs.

problem Understanding and maximizing the expressivity of diffusion policies while managing statistical limitations.
method Identifying drift Lipschitz budget K as central, quantifying expressivity and statistical behavior, proving lower bounds, and providing practical implementation guidelines.
result Balancing expressivity and statistical complexity yields a finite-sample performance gap, with rates depending on sample size and drift type.

Study on non-negative solutions for stochastic Volterra equations with jumps.

problem Existence and uniqueness of non-negative solutions for stochastic Volterra equations with jumps and non-Lipschitz coefficients.
method Developed a nonnegative approximation approach and used Yamada--Watanabe approximation technique for convergence proof.
result Established conditions for strong existence and pathwise uniqueness of non-negative solutions.

We define lines of minima in the thick part of Outer space for the free group Fn with n>2 generators. We show that these lines of minima are contracting for the Lipschitz metric. Every fully irreducible outer automorphism of Fn defines such a line a minima. Now let G be a subgroup of the outer automorphism group of Fn …

2009-11-18abs ↗pdf ↗

Improved training boosts certified robustness of L-infinity distance nets.

problem Certified robustness of L-infinity distance nets is not as strong as conventional networks.
method Improved training process combining scaled cross-entropy and clipped hinge loss with a decaying mixing coefficient.
result Certified accuracy of L-infinity distance nets improved from 33.30% to 40.06% on CIFAR-10.

We prove existence, uniqueness, and regularity of viscosity solutions to the stationary and evolution obstacle problems defined by a class of nonlocal operators that are not stable-like and may have supercritical drift. We give sufficient conditions on the coefficients of the operator to obtain Hölder and Lipschitz con…

2017-09-29abs ↗pdf ↗

A new model for forward curves captures behavior through a single equation.

problem Modeling forward curves in a complex function space.
method Developed a stochastic partial differential equation with locally state-dependent coefficients.
result The model retains simplicity while capturing entire forward curve behavior.

In this paper we study solutions to elliptic linear equations L(u)=i(aij(x)ju)+bi(x)iu+c(x)u=0L(u)=\partial_i(a^{ij}(x)\partial_j u) + b^i(x) \partial_i u + c(x) u=0, either on RnR^n or a Riemannian manifold, under the assumption of Lipschitz control on the coefficients aija^{ij}. We focus our attention on the critical set $Cr(u)\equiv\{x:|\nabla u|…

2014-03-17abs ↗pdf ↗

Two-layer neural networks must be robust, even with arbitrary weights.

problem Proving the robustness of two-layer neural networks with arbitrary weights.
method Developed a new function-space covering method to prove the robustness law, replacing parameter-space covering.
result Proved the conjectured law for two-layer networks with arbitrary real weights, biases, and affine skip connections.

The CEV model is given by the stochastic differential equation Xt=X0+0tμXsds+0tσ(Xs+)pdWsX_t=X_0+\int_0^tμX_sds+\int_0^tσ(X^+_s)^pdW_s, 12p<1\frac{1}{2}\le p<1. It features a non-Lipschitz diffusion coefficient and gets absorbed at zero with a positive probability. We show the weak convergence of Euler-Maruyama approximations XtnX_t^n to the proc…

2010-05-05abs ↗pdf ↗

This paper analyzes SHAP values using Fourier expansions for model interpretability.

problem Understanding and interpreting SHAP values in complex models.
method Developed a spectral framework using Fourier expansions for SHAP values in various model regimes.
result SHAP values are Lipschitz continuous in the deterministic regime and converge to Gaussian process values in the probabilistic regime.

Given a solution uu to a linear homogeneous second order elliptic equation with Lipschitz coefficients, we introduce techniques for giving improved estimates of the critical set $\Cr(u)\equiv \{x:|\nabla u|(x)=0\}$. The results are new even for harmonic functions on $\dR^n$. Given such a uu, the standard {\it first o…

2012-07-17abs ↗pdf ↗

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.

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.

In this paper, we propose a new framework to study the generalization property of classifier chains trained over observations associated with multiple and interdependent class labels. The results are based on large deviation inequalities for Lipschitz functions of weakly dependent sequences proposed by Rio in 2000. We …

2018-07-26abs ↗pdf ↗

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.

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.