Method approximates Lipschitz domains with smoother shapes.
problem Approximating bounded Lipschitz domains.
method Sequence of smooth, bounded domains with weak curvatures.
result Uniform isocapacitary estimates for approximating sets.
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 C1,α, 0<α≤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 …
Corners can be identified by a drum's sound spectrum.
problem Determining the presence of corners in a drum's shape from its sound.
method Proving spectral invariance of corners in domains with Lipschitz, piecewise smooth boundaries.
result Corners are uniquely determined by a drum's spectrum among domains with fixed genus.
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.
Develops risk measures on Lipschitz spaces for financial positions.
problem Lack of standard cash-additive methods in Lipschitz spaces.
method Proposes Lipschitz-free space, uses additivity along benchmark-deviation instruments.
result Derives dual representations for convex and coherent risk measures.
For a bounded domain equipped with a piecewise Lipschitz continuous Riemannian metric g, we consider harmonic map from (Ω,g) to a compact Riemannian manifold (N,h)⊂Rk 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.
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.
The paper quantifies the regularity of attention operations.
problem Quantifying the regularity of attention operations.
method Proposes a new mathematical framework using measure theory and integral operators.
result Proves attention operation is Lipschitz continuous on compact domains and provides an estimate of its Lipschitz constant.
Study finds multiple solutions to a complex equation with volume constraint.
problem Finding multiple solutions to a nonlinear elliptic equation with a specific potential.
method Analyzes a Van der Waals-Allen-Cahn-Hilliard equation with a linear volume constraint on a bounded Lipschitz domain.
result Estimates the number of solutions using topological and homological invariants.
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.
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…
Continuous analysis techniques for deforming domains in manifolds.
problem Analyzing continuity of analysis objects in deforming domains.
method Introducing quasi-Lipschitz domains and studying monotone C0-deformations. result Global Morse index theorem holds for arbitrary Lipschitz domains.
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.
The thesis defines and proves invariants for manifolds of bounded geometry.
problem Lipschitz-homotopy invariants for manifolds of bounded geometry.
method Definition of a controvariant functor and invariance of the Roe index and ρ-class.
result Lipschitz-homotopy invariants are defined and proven for manifolds of bounded geometry.
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 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.
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 sn×sn→sn (n=1,3,7) 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.
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.
This paper tackles safe global optimization of noisy functions with a Lipschitz condition.
problem Safe global maximization of expensive, noisy, Lipschitz functions.
method Develops a δ-Lipschitz framework and two algorithms to ensure safety constraints are met.
result The proposed methods ensure safety constraints are met before evaluating noisy functions.
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.
For a bounded domain Ω⊂Rm,m≥2, of class C0, 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.
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 study the homeomorphic extension of biholomorphisms between convex domains in Cd 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…
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.
problem Reconstruction of length spaces from travel time data on a closed subset.
method Lipschitz stability proof for certain types of length spaces.
result Reconstruction of length spaces is Lipschitz stable from travel time data on a closed subset.
Proves smoothness of minimal surfaces near polyhedral boundaries.
problem Smoothness of free-boundary minimal surfaces near polyhedral domains.
method Allard-type regularity theorem for minimal surfaces in convex polyhedra.
result Minimal surfaces are C1,α graphical over a free-boundary plane if close to it. 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.
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.
Improved adaptive rates for Lipschitz bandit problem.
problem Sequentially maximize an unknown Lipschitz function with noisy evaluations.
method Characterizes regret through integrals of suboptimality gaps over level sets, adapting to local growth.
result Improved adaptive rates strictly improving over classical zooming bounds.
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…
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 study and solve the Dirichlet problem for graphs of prescribed mean curvature in Rn+1 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 n-dimensional Riemannian polyhedral complex X into a CAT(1) space. Provided that the metric on X 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 Rn collapses to a domain in Rn−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…
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.
problem Lack of theoretical understanding of attention in neural networks.
method Proposes a measure-theoretic model of attention and interprets self-attention as a system of self-interacting particles.
result Shows that attention is Lipschitz-continuous under suitable assumptions.
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.
The paper classifies capillary graphs on manifolds with Ricci lower bounds.
problem Understanding capillary graphs on manifolds with Ricci lower bounds.
method Gradient estimate for positive CMC graphs on manifolds with Ricci lower bounds.
result Classification of capillary graphs over specific domains.
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.
LipKernel adds robustness to CNNs by enforcing Lipschitz bounds.
problem Improving robustness of CNNs in real-time applications.
method Dissipative layers parameterized by LMIs and 2-D Roesser model.
result Orders of magnitude faster run-time compared to state-of-the-art methods.
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.