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

78155233310 · Jun 202019922001200920172026
48 results for Lipschitz solutions

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.

Study properties of solutions with singularities in the negative cone.

problem Properties of solutions with singularities in the negative cone.
method Proved PDE for trace and normal derivatives, showed hypersurface is minimal for k=2.
result Hypersurface is minimal for k=2 and satisfies certain PDE.

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.

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.

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

We show for k2k \geq 2 that the locally Lipschitz viscosity solution to the σkσ_k-Loewner-Nirenberg problem on a given annulus {a<x<b}\{a < |x| < b\} is Cloc1,1kC^{1,\frac{1}{k}}_{\rm loc} in each of {a<xab}\{a < |x| \leq \sqrt{ab}\} and {abx<b}\{\sqrt{ab} \leq |x| < b\} and has a jump in radial derivative across x=ab|x| = \sqrt{ab}. Further…

2020-01-13abs ↗pdf ↗

We show the existence of a global unique and analytic solution for the mean curvature flow, the surface diffusion flow and the Willmore flow of entire graphs for Lipschitz initial data with small Lipschitz norm. We also show the existence of a global unique and analytic solution to the Ricci-DeTurck flow on euclidean s…

2009-02-09abs ↗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.

We consider the mean curvature flow of entire Lagrangian graphs with Lipschitz continuous initial data. Assuming only a certain bound on the Lipschitz norm of an initial entire Lagrangian graph in R2n\R^{2n}, we show that the parabolic equation \eqref{PMA} for the Lagrangian potential has a longtime solution which is sm…

2009-02-19abs ↗pdf ↗

Proves continuum limits of Lipschitz learning using Γ-convergence.

problem Semi-supervised learning with graph-based methods and continuum limits of pp-Laplacian learning.
method Proves continuum limits of Lipschitz learning using Γ-convergence.
result Proves ΓΓ-convergence in the LL^\infty-topology to the supremum norm of the gradient.

By using Bäcklund transformation for the sine-Gordon equation, new periodic exact solutions of the constant astigmatism equation zyy+(1/z)xx+2=0 z_{yy} + ({1}/{z})_{xx} + 2 = 0 are generated from a seed which corresponds to Lipschitz surfaces of constant astigmatism.

2017-07-03abs ↗pdf ↗

We find maximal representatives within equivalence classes of metric spheres. For Ahlfors regular spheres these are uniquely characterized by satisfying the seemingly unrelated notions of Sobolev-to-Lipschitz property, or volume rigidity. We also apply our construction to solutions of the Plateau problem in metric spac…

2019-09-23abs ↗pdf ↗

Study proves interaction of three impulsive gravitational waves, showing local solution and Lipschitz continuity.

problem Interaction of three impulsive gravitational waves in Einstein vacuum equations.
method Geometric estimates and wave estimates to prove local solution and continuity.
result Local solution to Einstein vacuum equations with three impulsive gravitational waves, Lipschitz continuity.

Study on curvature equation in Heisenberg group with convex boundary.

problem Existence of solutions to prescribed mean curvature equation in sub-Finsler Heisenberg group.
method Finsler approximation scheme to prove existence of Lipschitz solutions.
result Existence of a Lipschitz solution for the Dirichlet problem.

A new algorithm solves minimax problems without needing parameters.

problem Convex-concave minimax optimization problems in machine learning.
method Proposes a fully parameter-free LF-CR and FF-CR algorithms for solving these problems.
result The FF-CR algorithm achieves the best iteration complexity under gradient norm termination criterion.

New framework enhances neural network robustness against adversarial attacks.

problem Vulnerability of deep neural networks to small perturbations.
method Integrates Lipschitz constraint using optimal transport and hinge regularization.
result Proposes a new loss function that certifies adversarial robustness.

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.

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.

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.

Probabilistic learning is increasingly being tackled as an optimization problem, with gradient-based approaches as predominant methods. When modelling multivariate likelihoods, a usual but undesirable outcome is that the learned model fits only a subset of the observed variables, overlooking the rest. In this work, we …

2020-02-26abs ↗pdf ↗

Develops new strategy for Hessian estimates in Lagrangian mean curvature equation.

problem Interior Hessian estimates for solutions with prescribed Lipschitz phases.
method Allard-type regularity theorem, geometric measure theory, geometry of Lagrangian graphs, De Giorgi-Nash-Moser iteration.
result Sharp interior Hessian estimates for solutions with critical and supercritical phases.

The paper proves Lipschitz regularity of graph Laplacian eigenvectors on random data clouds.

problem Analyzing the regularity of solutions to graph Laplacian equations on random data points.
method Probabilistic coupling of random walks and interpolation method for point clouds to continuum.
result Graph Laplacian eigenvectors are essentially Lipschitz with constants depending on eigenvalues.

We consider a class of constrained optimization problems with a possibly nonconvex non-Lipschitz objective and a convex feasible set being the intersection of a polyhedron and a possibly degenerate ellipsoid. Such problems have a wide range of applications in data science, where the objective is used for inducing spars…

2014-09-09abs ↗pdf ↗

Neural operators learn to solve LQ MFGs efficiently in infinite dimensions.

problem Solving many related LQ MFG problems in infinite-dimensional settings.
method Training neural operators to map problem data to equilibrium strategies.
result NOs reliably solve unseen LQ MFG variants with controlled parameters.

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.

We investigate the existence of weak expanding solutions of the harmonic map flow for maps with values into a smooth closed Riemannian manifold. We prove the existence of such solutions in case the target manifold is isometrically embedded as a hypersurface of some Euclidean space and the initial condition is a Lipschi…

2018-01-24abs ↗pdf ↗

We give multiplicity results for the solutions of a nonlinear elliptic equation, with an asymmetric double well potential of Van der Waals-Allen--Cahn--Hilliard type, satisfying a linear volume constraint, on a bounded Lipschitz domain $Ω\subset\mathds R^N$. The number of solutions is estimated in terms of topological …

2019-07-29abs ↗pdf ↗

Solves Calabi-Yau equation on symplectic manifolds using measurable Kahler metrics.

problem Solving the Calabi-Yau equation on symplectic manifolds.
method Global deformation of almost complex structures compatible with symplectic form, constructing measurable Lipschitz Kahler metric.
result Existence theorem for solutions to the one-form type Calabi-Yau equation on closed symplectic manifolds.