The paper extends a link criterion for Lipschitz normal embeddings to definable sets in o-minimal structures.
problem Characterizing Lipschitz normal embeddings of definable sets.
method Extending a known result about subanalytic germs to definable germs in any o-minimal structure.
result The link criterion holds for definable germs in o-minimal structures, but is not sufficient for all homomorphisms.
The study examines Lipschitz normally embedded Hölder triangles in 4D space.
problem Comparing ambient and outer Lipschitz geometry of Hölder triangles.
method Analyzes Lipschitz normally embedded Hölder triangles in \(\mathbb{R}^4\).
result Infinitely many equivalence classes of microknots.
Analytic sets with unique infinite tangent cone are algebraic.
problem Characterizing analytic sets with unique infinite tangent cones.
method Analytic and algebraic set properties, degree of complex algebraic sets.
result Degree of Lipschitz normally embedded sets equals their infinite tangent cone degree.
Study conic singular manifolds, proving Lipschitz normal embedding.
problem Understanding metric properties of conic singular manifolds.
method Analyzing interplay between conic and asymptotically conic behavior.
result Proves Lipschitz normal embedding for conic singular sub-manifolds.
Conic singular sub-manifolds are Lipschitz Normally Embedded in compact non-Euclidean manifolds.
problem Understanding the Lipschitz geometry of conic singular sub-manifolds.
method Analyzing the metric properties of conic singular sub-manifolds in compact non-Euclidean manifolds.
result Connected conic singular sub-manifolds are Lipschitz Normally Embedded.
Characterizes hypergenerated stratified groups with flat boundaries.
problem Characterizing stratified groups with flat boundaries.
method Algebraic characterization and embedding analysis.
result Hypergenerated groups have locally bi-Lipschitz embeddings of non-characteristic hypersurfaces.
The study examines the limitations of bi-Lipschitz Normalizing Flows in approximating certain distributions.
problem The expressivity of bi-Lipschitz Normalizing Flows in approximating specific target distributions.
method Characterization of expressivity through lower bounds on Total Variation distance and discussion of potential remedies.
result Several target distributions are difficult to approximate using bi-Lipschitz Normalizing Flows, and lower bounds on their approximation are provided.
Defines smoothness of definable sets in o-minimal structures.
problem Characterizing smoothness of definable sets in o-minimal structures.
method Characterizes smoothness using tangent cones and metric properties.
result Equivalence of several conditions for C1 smoothness of definable sets. Characterizes quasi-isometric embeddings in coarsely Lipschitz category.
problem Understanding quasi-isometric embeddings in geometric terms.
method Formalizes quasi-isometric embeddings as regular monomorphisms in coarsely Lipschitz category.
result Quasi-isometric embeddings are equivalently characterised as effective, strong, or extremal monomorphisms.
Bi-Lipschitz flows approximate a wide range of distributions.
problem Characterizing the expressivity of bi-Lipschitz normalizing flows.
method Linking score regularity to transport map bi-Lipschitzness via probability flow ODE.
result Gaussian pullbacks induced by bi-Lipschitz variance-preserving transport maps are L1-dense among all probability densities. Lipschitz continuity recently becomes popular in generative adversarial networks (GANs). It was observed that the Lipschitz regularized discriminator leads to improved training stability and sample quality. The mainstream implementations of Lipschitz continuity include gradient penalty and spectral normalization. In th…
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.
Let X be a closed semialgebraic set of dimension k. If n≥2k+1, then there is a bi-Lipschitz and semialgebraic embedding of X into Rn. Moreover, if n≥2k+2, then this embedding is unique (up to a bi-Lipschitz and semialgebraic homeomorphism of Rn.
This paper examines weight initialization for 1-Lipschitz networks to improve robustness against adversarial attacks.
problem Improving the robustness of deep neural networks against adversarial attacks.
method Examined weight parametrization of AOL and SLL networks, calculated weight variance bounds, and demonstrated weight decay.
result Weight initialization causes deep 1-Lipschitz networks to decay to zero, and weight variance does not affect output variance distribution.
We show that the isoperimetric profile hg(t)(ξ) of a compact Riemannian manifold (M,g) is jointly continuous when metrics g(t) vary continuously. We also show that, when M is a compact surface and g(t) evolves under normalized Ricci flow, hg(t)2(ξ) is uniform Lipschitz continuous and hence $h_{g(t)}(…
Lipschitz normalization boosts deep attention models, especially for graph neural networks.
problem Gradient explosion in deep graph attention networks leads to poor performance.
method Enforcing Lipschitz continuity by normalizing attention scores.
result Deep GAT models with LipschitzNorm achieve state-of-the-art results for tasks with long-range dependencies.
GraN-GAN normalizes gradients for better GAN performance.
problem Improving image generation in GANs with piecewise linear discriminators.
method Piecewise Gradient Normalization (GraN) for input-dependent normalization.
result Significant performance gains in image generation across various datasets.
ELF simplifies normalizing flows, making them more efficient and universal.
problem Computational inefficiency of normalizing flows.
method ELF introduces a simple, one-layer network with closed-form Lipschitz constants, combining the ease of residual flows with the performance of autoregressive flows.
result ELF is a provably universal density approximator, more efficient computationally and parameter-wise.
The paper extends Lipschitz metric isometries between Outer Spaces of virtually free groups.
problem Extending isometry properties of Lipschitz metric to virtually free groups.
method Analyzing finite-index subgroups and their covers, identifying folding paths, and using deformation retraction.
result Existence of candidates for Lipschitz distance and deformation retraction of spine.
We prove that each sub-Riemannian manifold can be embedded in some Euclidean space preserving the length of all the curves in the manifold. The result is an extension of Nash C1 Embedding Theorem. For more general metric spaces the same result is false, e.g., for Finsler non-Riemannian manifolds. However, we also sh…
Proves isometric embeddings in Euclidean spaces for RCD spaces.
problem Isometric immersions of RCD spaces in Euclidean spaces.
method Analyzes regular isometric immersions and eigenmaps of compact non-collapsed RCD spaces.
result Eigenmaps of compact non-collapsed RCD spaces are locally bi-Lipschitz embeddings to spheres.
The study examines the normal growth exponent of submanifolds in negatively curved manifolds.
problem Understanding the normal growth exponent of submanifolds in negatively curved manifolds.
method Analyzing the geodesic flow and operator norms on submanifolds bi-Lipschitz to hyperbolic spaces.
result If a submanifold's normal growth exponent is at most 1, the ambient manifold is bi-Lipschitz to hyperbolic space.
Normalization layers control deep neural network capacity, improving stability and generalization.
problem Excessive capacity in deep neural networks leads to overfitting and poor generalization.
method Developed a theoretical framework to explain normalization's role in capacity control.
result Normalization layers reduce the Lipschitz constant exponentially, smoothing the loss landscape and enhancing generalization.
Residual flows are shown to approximate MMD well.
problem Lack of theoretical understanding of normalizing flows' expressiveness.
method Proved residual flows are universal approximators in MMD.
result Residual flows can approximate MMD with a bounded number of blocks.
The paper proves the existence of hypersurfaces with prescribed mean curvature.
problem Proving the existence of hypersurfaces with prescribed mean curvature.
method PDE theoretic approach using mountain pass construction and regularity results for integral varifolds.
result Existence of quasi-embedded, boundaryless hypersurfaces with prescribed mean curvature.
We construct bi-Lipschitz embeddings into Euclidean space for manifolds and orbifolds of bounded diameter and curvature. The distortion and dimension of such embeddings is bounded by diameter, curvature and dimension alone. Our results also apply for bounded subsets of complete Riemannian manifolds, and complete flat a…
Nilpotent groups can't be biLipschitz embedded into L1.
problem Proving that simply connected nilpotent Lie groups cannot be biLipschitz embedded into L1. method Using a pull-back distance and cut measures, the authors show that bi-Lipschitz embeddings can't exist in non-abelian settings.
result Every Carnot group that biLipschitz embeds into L1 is abelian. The paper extends quasimorphisms on subgroups to larger groups.
problem Extending quasimorphisms from subgroups to larger groups.
method Provides a general sufficient condition for extendability of quasimorphisms on subgroups.
result New results for quasimorphisms on normal subgroups, including bi-Lipschitz equivalence of stable commutator length and group-theoretic Dehn filling.
SRNF framework extends surface distance to Lipschitz surfaces.
problem Defining a distance metric for unparametrized surfaces.
method Square Root Normal Fields (SRNF) and Wasserstein Fisher Rao (WFR) metric.
result SRNF distance on Lipschitz surfaces is equivalent to WFR metric.
For all k,n≥1, we construct a biLipschitz embedding of Sn into the jet space Carnot group Jk(Rn) that does not admit a Lipschitz extension to Bn+1. Let f:Bn→R be a smooth, positive function with kth-order derivatives that are approximately linear …
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.
Generative adversarial networks (GANs) are one of the most popular approaches when it comes to training generative models, among which variants of Wasserstein GANs are considered superior to the standard GAN formulation in terms of learning stability and sample quality. However, Wasserstein GANs require the critic to b…
We provide a characterization of r-regular sets in terms of the Lipschitz regularity of normal vector fields to the boundary.
Continuous MDS embeds sequences of dissimilarities in Euclidean space.
problem Embedding sequences of dissimilarities as n increases. method Continuous MDS reformulates MDS for sequences of dissimilarity matrices.
result Uniform convergence of interpolated embeddings.
Study improves Poincaré-Sobolev inequalities for differential forms.
problem Improving Sobolev space embeddings for differential forms.
method Utilizes Lq,p-cohomology and bi-Lipschitz images to estimate embedding norms. result Estimates for embedding norms in Euclidean balls and their images.
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…
Curvature measures uniquely determined by invariance under embeddings.
problem Characterizing curvature measures uniquely.
method Applied Weyl principle and Künneth-type formula.
result Curvature measures uniquely characterized by invariance under isometric embeddings.
We show that a family of isolated complex hypersurface singularities with constant Milnor number may fail, in the strongest sense, to have constant bi-Lipschitz type. Our example is the Briac con--Speder family $X_t:=\{(x,y,z)\in\C^3 | x^5+z^{15}+y^7z+txy^6=0 \}$ of normal complex surface germs; we show the germ $(X_0,…
Hyperbolic space outperforms Euclidean in learning hierarchical data.
problem Learning hierarchical data in Euclidean space requires exponentially many samples.
method Established geometric obstruction in Euclidean space and showed hyperbolic space's advantage.
result Hyperbolic space enables learning with O(mRlogm) samples, matching information-theoretic optimum. This paper presents a margin-based multiclass generalization bound for neural networks that scales with their margin-normalized "spectral complexity": their Lipschitz constant, meaning the product of the spectral norms of the weight matrices, times a certain correction factor. This bound is empirically investigated for…
We discuss a variation of Gromov's notion of asymptotic dimension that was introduced and named Nagata dimension by Assouad. The Nagata dimension turns out to be a quasisymmetry invariant of metric spaces. The class of metric spaces with finite Nagata dimension includes in particular all doubling spaces, metric trees, …
We show that, for all α≥0, the generalized Grushin plane Gα is bi-Lipschitz homeomorphic to a 2-dimensional quasiplane in the Euclidean space R[α]+2, where [α] is the integer part of α. The target dimension is sharp. This generalizes a recent result of Wu.
In the Engel group with its Carnot group structure we study subsets of locally finite subRiemannian perimeter and possessing constant subRiemannian normal. We prove the rectifiability of such sets: more precisely we show that, in some specific coordinates, they are upper-graphs of entire Lipschitz functions (with respe…
The Nash-Kuiper Theorem states that the collection of C1-isometric embeddings from a Riemannian manifold Mn into EN is C0-dense within the collection of all smooth 1-Lipschitz embeddings provided that n<N. This result is now known to be a consequence of Gromov's more general h-principle. Ther…
Normalizing flows optimize Jacobian determinant for unique likelihood objective.
problem Optimizing normalizing flows for unique likelihood.
method Showed Jacobian determinant is unique for given distributions, leading to a unique global optimum. Used eigenvalues of auto-correlation matrix for explicit likelihood expression.
result Explicit expression of likelihood for flows, independent of neural network parameterization, with theoretical optimal value.
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 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…
Study on Gaussian interpolation flows for generative modeling.
problem Theoretical properties and regularizing effect of Gaussian denoising in continuous normalizing flows.
method Unified framework of Gaussian interpolation flow, Lipschitz regularity, existence and uniqueness of flow, stability analysis.
result Established theoretical properties of Gaussian interpolation flows, including Lipschitz continuity and existence of flow.