Method approximates Lipschitz domains with smoother shapes.
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.
Trend · papers per month
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…
In \cite{kamz} the author proved that every quasiconformal harmonic mapping between two Jordan domains with , , 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 …
Corners can be identified by a drum's sound spectrum.
New algorithms for online learning without boundedness or Lipschitz loss assumptions.
Develops risk measures on Lipschitz spaces for financial positions.
For a bounded domain equipped with a piecewise Lipschitz continuous Riemannian metric g, we consider harmonic map from to a compact Riemannian manifold without boundary. We generalize the notion of stationary harmonic map and prove the partial regularity. We also discuss the global Li…
Novel boundary integral equations for Dirac operators in 3D Lipschitz domains.
The paper quantifies the regularity of attention operations.
In this paper we prove a new version of the Schoenflies extension theorem for collared domains in Euclidean n-space: for 1 < p < n, locally bi-Lipschitz homeomorphisms between collared domains with locally p-integrable, second-order weak derivatives admit homeomorphic extensions of the same regularity. Moreover, the th…
JacNet learns Jacobians to enforce structure on derivatives for invertibility and 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…
Continuous analysis techniques for deforming domains in manifolds.
Paper investigates Lipschitz constants of self-attention modules in neural networks.
The thesis defines and proves invariants for manifolds of bounded geometry.
Analytic functions on specific domains are characterized by their smoothness and composites with polynomial curves.
LOT improves adversarial robustness by training 1-Lipschitz convolution layers.
We prove local Holder continuity of quasi-n-harmonic mappings from Euclidean domains into metric spaces with non-positive curvature in the sense of Alexandrov. We also obtain global Holder continuity of such mappings from bounded Lipschitz domains.
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…
We prove that the multiplication maps () for unit complex, quaternion and octonion numbers are, up to isometries of domain and range, the unique Lipschitz constant minimizers in their homotopy classes. Other geometrically natural maps, such as pro…
The Piyavskii-Shubert algorithm is analyzed for global optimization of Lipschitz functions.
Study Lipschitz regularity for manifold-constrained ROF model on curved surfaces.
Study shows shallow ReLU networks struggle with high-dimensional Lipschitz functions.
For a bounded domain of class , the properties are studied of fields of `good directions', that is the directions with respect to which can be locally represented as the graph of a continuous function. For any such domain there is a canonical smooth field of good direct…
Study compares hyperbolic and quasihyperbolic metrics in plane domains.
This research explores principles of Lipschitz continuity in neural networks for robustness and generalization.
We study the homeomorphic extension of biholomorphisms between convex domains in without boundary regularity and boundedness assumptions. Our approach relies on methods from coarse geometry, namely the correspondence between the Gromov boundary and the topological boundaries of the domains and the dynamic…
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 …
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…
Study shows stability of travel time data reconstruction from closed subsets.
Proves smoothness of minimal surfaces near polyhedral boundaries.
We show that the nearest point retraction is a uniform quasi-isometry from the Thurston metric on a hyperbolic domain in the Riemann sphere to the boundary of the convex hull of its complement. As a corollary, one obtains explicit bounds on the quasi-isometry constant of the nearest point retraction with respect to the…
Paper shows robust generative learning with minimal assumptions on target distributions.
Improved adaptive rates for Lipschitz bandit problem.
Given a C2-domain with compact boundary in an arbitrary complete Riemannian manifold, we search for smallness conditions on the boundary data for which the Dirichlet problem for the minimal hypersurface equation is solvable. We obtain an extension to Riemannian manifolds of an existence result of G. H. Williams ( J. Re…
In this paper, the problem of safe global maximization (it should not be confused with robust optimization) of expensive noisy black-box functions satisfying the Lipschitz condition is considered. The notion "safe" means that the objective function during optimization should not violate a "safety" threshold, for…
Study Bernstein-Gelfand-Gelfand complexes on Lipschitz domains, computing cohomology and applying to elasticity models.
Algorithm tackles adaptive discretization in adversarial Lipschitz bandits for dynamic pricing and auctions.
We study and solve the Dirichlet problem for graphs of prescribed mean curvature in over general domains without requiring a mean convexity assumption. By using pieces of nodoids as barriers we first give sufficient conditions for the solvability in case of zero boundary values. Applying a result …
We determine regularity results for energy minimizing maps from an -dimensional Riemannian polyhedral complex into a CAT(1) space. Provided that the metric on 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…
Our main result is that if a generic convex domain in collapses to a domain in , 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…
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…
Mathematical framework for understanding attention in neural networks.
Maps persistence diagrams into Hilbert and Euclidean spaces with explicit distortions.
The paper classifies capillary graphs on manifolds with Ricci lower bounds.
Study on curvature equation in Heisenberg group with convex boundary.
LipKernel adds robustness to CNNs by enforcing Lipschitz bounds.
HALO uses local Lipschitz constants to optimize functions efficiently.