We provide an example of a zero-dimensional compact metric space and its closed subspace such that there is no continuous linear extension operator for the Lipschitz pseudometrics on to the Lipschitz pseudometrics on . The construction is based on results of A. Brudnyi and Yu. Brudnyi concerning linear e…
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
48 results for “Lipschitz operators”
Abstract cone operators prove scalar curvature comparisons on singular manifolds.
problem Proving scalar curvature inequalities on manifolds with cone singularities.
method Using index theory for twisted Dirac operators on Lipschitz bundles.
result Lipschitz rigidity for scalar curvature on odd-dimensional manifolds.
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 model how Lipschitz continuity changes during neural network training.
problem Understanding how Lipschitz continuity evolves during training.
method We use a system of stochastic differential equations to capture the dynamics of Lipschitz continuity under SGD.
result We identify three factors driving the evolution of Lipschitz continuity: gradient flow projection, gradient noise, and Hessian projection.
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.
The study establishes minimax bounds for estimating operators from noisy samples.
problem Estimating unknown operators between Hilbert spaces from noisy data.
method Developed a minimax theory for uniformly bounded Lipschitz operators, proving lower and upper bounds.
result Sharp characterizations of minimax risk for generic Lipschitz operators, showing a curse of sample complexity.
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 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.
New Lipschitz de Rham theorem for -cohomology.
problem Developing a new de Rham theorem for -cohomology.
method Regularization procedure in Lipschitz de Rham calculus applied to metric simplicial complexes.
result Established Lipschitz de Rham theorem for -cohomology.
Graph-based framework for provably robust adversarial training.
problem Adversarial robustness of machine learning models.
method Formulates adversarial robustness as loss minimization with a Lipschitz constraint, using graph-based discretization and primal-dual algorithms.
result Establishes a connection between elliptic operators and adversarial learning, and proves fundamental lower bounds on adversarial sensitivity.
Study on residual Monge-Ampère mass of complex functions with directional Lipschitz continuity.
problem Estimating the residual Monge-Ampère mass of plurisubharmonic functions.
method General decomposition formula under Sasakian structure, -apriori estimate, upper-bound estimate on residual mass.
result Upper-bound estimate on residual mass for uniformly directional Lipschitz continuity confirmed.
A map between manifolds is an isometry if it's Lipschitz and scalar curvature bounded.
problem Characterizing maps between manifolds based on their scalar curvature and Lipschitz continuity.
method Spectral properties of Dirac operators and index theory for low regularity metrics and bundles.
result A 1-Lipschitz map between manifolds is an isometry if it has bounded scalar curvature.
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…
Unified framework for analyzing graph neural operators converging to graph limits.
problem Analyzing convergence of graph neural operators to graph limits.
method Develops a unified spectral framework for graph neural operators under various graphon assumptions.
result Unified framework enables direct comparison of convergence rates and tradeoffs.
In this work we compute lower Lipschitz bounds of pooling operators for as well as pooling operators preceded by half-rectification layers. These give sufficient conditions for the design of invertible neural network layers. Numerical experiments on MNIST and image patches confirm tha…
New Transformers maintain Lipschitz continuity for robustness.
problem Ensuring robustness in Transformers for safety-sensitive applications.
method Introducing gradient-descent-type in-context Transformers with explicit Euler steps of negative gradient flows.
result Universal approximation theorem for Lipschitz continuous Transformers.
New method for efficient proximal mapping of 1-path-norm in shallow networks.
problem Efficiently handling the 1-path-norm of shallow neural networks.
method Closed-form proximal operator for efficient computation and upper bound on Lipschitz constant.
result Proximal mapping allows robust training against adversarial perturbations.
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.
Deep neural operators learn complex probabilistic models efficiently.
problem Learning complex probabilistic models with global Lipschitz conditions.
method Deep neural-operator framework under global Lipschitz conditions.
result Explicit network-size bounds for universal approximation of probabilistic models.
On a smooth complete Riemannian spin manifold with smooth compact boundary, we demonstrate that the Atiyah-Singer Dirac operator in depends Riesz continuously on perturbations of local boundary conditions . The Lipschitz bound for the map ${…
LiST improves neural network robustness and calibration without manual tuning.
problem Developing robust and calibrated neural networks simultaneously.
method Lipschitz Scaling Training (LiST) that iteratively adjusts the global Lipschitz constant.
result LiST yields an out-of-the-box calibrated network with competitive accuracy and robustness.
ARBITER learns SPX-VIX term structures without arbitrage constraints.
problem Arbitrage-free modeling of SPX-VIX term structures.
method Risk-neutral neural operator mapping market states to operator outputs enforcing static arbitrage constraints.
result ARBITER outperforms other models in derivatives term structure evaluation metrics.
Study improves Poincaré-Sobolev inequalities for differential forms.
problem Improving Sobolev space embeddings for differential forms.
method Utilizes -cohomology and bi-Lipschitz images to estimate embedding norms.
result Estimates for embedding norms in Euclidean balls and their images.
Deep neural nets estimate operators between infinite-dimensional spaces with fast rates.
problem Estimating operators between infinite-dimensional spaces.
method Deep neural networks for nonparametric estimation of Lipschitz operators.
result Error bounds decay with fast rates depending on intrinsic dimension.
Lipschitz constraints under L2 norm on deep neural networks are useful for provable adversarial robustness bounds, stable training, and Wasserstein distance estimation. While heuristic approaches such as the gradient penalty have seen much practical success, it is challenging to achieve similar practical performance wh…
Comparison principles and Lipschitz regularity for some nonlinear degenerate elliptic equationsmath.AP
We establish interior Lipschitz regularity for continuous viscosity solutions of fully nonlinear, conformally invariant, degenerate elliptic equations. As a by-product of our method, we also prove a weak form of the strong comparison principle, which we refer to as the principle of propagation of touching points, for o…
1-Lipschitz networks are as accurate as classical networks and offer robustness.
problem Misconceptions about 1-Lipschitz neural networks and their properties.
method Analysis of 1-Lipschitz neural networks' accuracy, robustness, and generalization.
result 1-Lipschitz neural networks are as accurate as classical networks and can fit arbitrarily difficult boundaries.
Decay of scalar curvature on uniformly contractible manifolds with finite asymptotic dimensionmath.DG
The paper proves scalar curvature decay for uniformly contractible manifolds with finite asymptotic dimension.
problem Proving decay of scalar curvature for uniformly contractible manifolds with finite asymptotic dimension.
method Using index pairing between Dirac operators and compactly supported vector bundles with Lipschitz control, and Lipschitz control for topological K-theory of finite dimensional simplicial complexes.
result The scalar curvature decays to zero at a rate depending only on the contractibility radius and the diameter control of the asymptotic dimension.
Paper introduces a new metric to select optimal Graph Shift Operator for GNNs.
problem Empirical selection of Graph Shift Operator remains challenging.
method Introduces a novel alignment gain metric connecting geometric distortion to generalization bounds via spectral proxy.
result Provides a principled, computation-efficient criterion to rank and select optimal GSO.
Extragradient-Type Methods with Last-Iterate Convergence Rates for Co-Hypomonotone Inclusionsmath.OC
Two accelerated extragradient methods converge at rate for co-hypomonotone inclusions.
problem Solving co-hypomonotone inclusions with sum of Lipschitz and multivalued operators.
method Developed two Nesterov's accelerated extragradient methods for co-hypomonotone inclusions.
result Achieve last-iterate convergence rates on the residual norm.
Develops a new framework for temporal anchoring in deep embedding spaces.
problem Temporal anchoring in deep embedding spaces, especially drift and convergence issues.
method Operator-theoretic framework with drift maps and event-indexed blocks, proving convergence theorems and equivalence theorems.
result Proves convergence theorems and equivalence theorems for the proposed framework.
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…
Exciting new work on the generalization bounds for neural networks (NN) given by Neyshabur et al. , Bartlett et al. closely depend on two parameter-depenedent quantities: the Lipschitz constant upper-bound and the stable rank (a softer version of the rank operator). This leads to an interesting question of whether cont…
Paper proves DN map determination for simple surfaces with low regularity metrics.
problem Determining DN map from scattering relation for surfaces with low regularity metrics.
method Modified technical results and used microlocal analysis for metrics with finite regularity.
result Scattering relation determines DN map for surfaces, and for metrics using Lipschitz distance function.
Paper proves convergence for private FL on non-Lipschitz convex objectives using normalization instead of clipping.
problem Lack of convergence results for differentially private federated learning with non-Lipschitz objectives.
method Developed a convergence result for private FL on smooth convex objectives without assuming Lipschitzness, using normalization instead of clipping.
result Normalization-based private FL algorithm converges better than clipping-based counterpart on smooth convex functions.
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…
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.
Accelerated first-order methods for convex optimization with locally Lipschitz continuous gradientmath.OC
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.
Paper explores properties of slice-matching operators for measure transfer.
problem Efficiently transferring measures in high dimensions.
method Examines an associated slice-matching operator with source, target measures and slicing directions.
result Establishes invariance, equivariance, Lipschitz continuity, and error bounds.
This paper shows that scientific discovery can be efficiently learned via compositional function trees, reducing the sample complexity.
problem Statistical and computational intractability of scientific discovery via symbolic regression.
method PAC learning approach focusing on compositional function trees built from a finite vocabulary of smooth operators.
result The Rademacher complexity and excess risk are controlled by depth and Lipschitz constants of the base operators, leading to finite-union bounds and high-probability risk bounds.
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…
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.
Proves continuum limits of Lipschitz learning using Γ-convergence.
problem Semi-supervised learning with graph-based methods and continuum limits of -Laplacian learning.
method Proves continuum limits of Lipschitz learning using Γ-convergence.
result Proves -convergence in the -topology to the supremum norm of the gradient.
Proves regularity for quasilinear elliptic equations in metric spaces.
problem Regularity of quasilinear elliptic equations in metric measure spaces.
method Galerkin's method as an alternative to difference quotients.
result Second-order and Lipschitz regularity for a wide class of elliptic equations.
VR-GHAL method solves stochastic fixed-point equations with high probability.
problem Solving stochastic fixed-point equations in normed spaces with nonexpansive or contractive operators.
method VR-GHAL, a variance-reduced gradual Halpern method for quadratically smoothable Banach spaces, using clipped stochastic differences.
result The method achieves a high-probability residual bound, reducing the residual nearly geometrically across epochs.
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 -deformations.
result Global Morse index theorem holds for arbitrary Lipschitz domains.
For free boundary problems on Euclidean spaces, the monotonicity formulas of Alt-Caffarelli-Friedman and Caffarelli-Jerison-Kenig are cornerstones for the regularity theory as well as the existence theory. In this article we establish the analogs of these results for the Laplace-Beltrami operator on Riemannian manifold…