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

70140209279 · Jun 202019922001200920172026
48 results for Lipschitz domains

We define self-adjoint extensions of the Hodge Laplacian on Lipschitz domains in Riemannian manifolds, corresponding to either the absolute or the relative boundary condition, and examine regularity properties of these operators' domains and form domains. We obtain results valid for general Lipschitz domains, and stron…

2004-08-31abs ↗pdf ↗

In \cite{kamz} the author proved that every quasiconformal harmonic mapping between two Jordan domains with C1,αC^{1,α}, 0<α10<α\le 1, boundary is bi-Lipschitz, providing that the domain is convex. In this paper we avoid the restriction of convexity. More precisely we prove: any quasiconformal harmonic mapping between two …

2009-01-25abs ↗pdf ↗

New algorithms for online learning without boundedness or Lipschitz loss assumptions.

problem Online learning with unbounded domains and non-Lipschitz losses.
method Developed an algorithm with a specific regret bound and used it for saddle-point optimization.
result First algorithm achieving non-trivial dynamic regret in an unbounded domain for non-Lipschitz losses.

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 ↗

Novel boundary integral equations for Dirac operators in 3D Lipschitz domains.

problem Developing equations for Dirac operators in complex 3D domains.
method First-kind boundary integral equations, generalized Garding inequalities, Fredholm operators, finite dimensional kernels, Betti numbers.
result Finite dimensional kernels equal to the sum of Betti numbers, explaining the bilinear forms.

JacNet learns Jacobians to enforce structure on derivatives for invertibility and Lipschitz functions.

problem Enforcing structure on derivatives of neural network mappings.
method Proposes using a neural network to directly learn the Jacobian of the input-output function, allowing control over derivative structure.
result Demonstrates learning invertible approximations to simple and 1-Lipschitz functions.

Given a Hopf fibration of a round sphere by parallel great subspheres, we prove that the projection map to the base space is, up to isometries of domain and range, the unique Lipschitz constant minimizer in its homotopy class. Similarly, given a Hopf fibration of a round sphere by parallel great circles, we view a unit…

2010-09-28abs ↗pdf ↗

Paper investigates Lipschitz constants of self-attention modules in neural networks.

problem Lipschitz constants of self-attention modules in neural networks.
method Proved standard dot-product self-attention is not Lipschitz for unbounded input domain. Proposed L2 self-attention that is Lipschitz. Derived upper bound on L2 self-attention's Lipschitz constant.
result Proved standard self-attention is not Lipschitz for unbounded input domain and proposed an alternative L2 self-attention that is Lipschitz.

Analytic functions on specific domains are characterized by their smoothness and composites with polynomial curves.

problem Characterizing real analytic functions on closed subanalytic domains.
method Analyzing functions defined on closed uniformly polynomially cuspidal sets in Rn\mathbb{R}^n using composites with polynomial curves.
result Conditions for a function to be real analytic are effectively related to the regularity of the boundary of the domain.

LOT improves adversarial robustness by training 1-Lipschitz convolution layers.

problem Improving adversarial robustness of deep neural networks.
method LOT: Layer-wise Orthogonal Training for 1-Lipschitz convolution layers.
result LOT significantly enhances certified robustness of Lipschitz-bounded models.

Stochastic Lipschitz bandit algorithms balance exploration and exploitation, and have been used for a variety of important task domains. In this paper, we present a framework for Lipschitz bandit methods that adaptively learns partitions of context- and arm-space. Due to this flexibility, the algorithm is able to effic…

2019-01-26abs ↗pdf ↗

The Piyavskii-Shubert algorithm is analyzed for global optimization of Lipschitz functions.

problem Maximizing a non-concave Lipschitz function over a compact domain.
method Sequential function evaluations using a bandit-optimization approach.
result New bounds on the number of evaluations needed for optimization accuracy.

Study Lipschitz regularity for manifold-constrained ROF model on curved surfaces.

problem Lipschitz regularity for manifold-constrained ROF model on curved surfaces.
method Generalization of ROF model, existence and uniqueness of minimizers, regularity results on PDE system.
result Lipschitz regularity of minimizers without convexity requirements.

Study shows shallow ReLU networks struggle with high-dimensional Lipschitz functions.

problem Expressing high-dimensional Lipschitz functions with shallow ReLU networks.
method Established lower bounds on shallow network complexity for polynomial approximation.
result Shallow ReLU networks suffer from the curse of dimensionality for Lipschitz functions.

Study compares hyperbolic and quasihyperbolic metrics in plane domains.

problem Comparing hyperbolic and quasihyperbolic metrics in plane domains.
method Analyzes metric spaces and boundaries of hyperbolic domains, proving equivalence and constructing counterexamples.
result Hyperbolic and quasihyperbolic metric spaces are quasiisometrically equivalent for finitely connected hyperbolic domains, but not in general.

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.

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 ↗

A scattering transform defines a signal representation which is invariant to translations and Lipschitz continuous relatively to deformations. It is implemented with a non-linear convolution network that iterates over wavelet and modulus operators. Lipschitz continuity locally linearizes deformations. Complex classes o…

2011-12-05abs ↗pdf ↗

Paper shows robust generative learning with minimal assumptions on target distributions.

problem Learning generative models with minimal assumptions on target distributions.
method Lipschitz-regularized αα-divergences with minimal assumptions.
result Stable learning across various target distributions with minimal assumptions.

Study Bernstein-Gelfand-Gelfand complexes on Lipschitz domains, computing cohomology and applying to elasticity models.

problem Cohomology of BGG complexes on bounded Lipschitz domains.
method Computes cohomology of conformal deformation and Hessian complexes in Sobolev spaces, allowing multiple input complexes.
result Establishes conformal Korn inequality and proposes generalizations of continuum models with microstructures.

Algorithm tackles adaptive discretization in adversarial Lipschitz bandits for dynamic pricing and auctions.

problem Adaptive discretization in adversarial Lipschitz bandits.
method Adversarial Zooming algorithm for adaptive discretization.
result First algorithm for adversarial Lipschitz bandits with instance-dependent regret bounds.

We determine regularity results for energy minimizing maps from an nn-dimensional Riemannian polyhedral complex XX into a CAT(1) space. Provided that the metric on XX is Lipschitz regular, we prove Hölder regularity with Hölder constant and exponent dependent on the total energy of the map and the metric on the doma…

2016-10-25abs ↗pdf ↗

Our main result is that if a generic convex domain in Rn\R^n collapses to a domain in Rn1\R^{n-1}, then the difference between the first two Dirichlet eigenvalues of the Euclidean Laplacian, known as the fundamental gap, diverges. The boundary of the domain need not be smooth, merely Lipschitz continuous. To motivate th…

2008-10-27abs ↗pdf ↗

Most transport theorems---that is, a formula for the rate of change of an integral in which both the integrand and domain of integration depend on time---involve domains that evolve according to a flow map. Such domains are said to be convecting. Here a transport theorem for nonconvecting domains evolving on an embedde…

2018-08-24abs ↗pdf ↗

Maps persistence diagrams into Hilbert and Euclidean spaces with explicit distortions.

problem Embedding persistence diagrams into Euclidean spaces for statistical analysis.
method Explicit geometric maps with distortion functions.
result Controlled geometric information loss through explicit distortion functions.

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.

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.