English
Related papers

Related papers: Nonlinear Dimension Reduction via Outer Bi-Lipschi…

200 papers

We prove a quantitative version of the following statement. Given a Lipschitz function f from the k-dimensional unit cube into a general metric space, one can decomposed f into a finite number of BiLipschitz functions f|_{F_i} so that the…

Metric Geometry · Mathematics 2008-06-12 Raanan Schul

Given a pointed metric space $M$, we study when there exist $n$-dimensional linear subspaces of $\operatorname{Lip}_0(M)$ consisting of strongly norm-attaining Lipschitz functionals, for $n\in\mathbb{N}$. We show that this is always the…

Functional Analysis · Mathematics 2022-03-04 Vladimir Kadets , Óscar Roldán

We propose a method for solving constrained fixed point problems involving compositions of Lipschitz pseudo contractive and firmly nonexpansive operators in Hilbert spaces. Each iteration of the method uses separate evaluations of these…

Optimization and Control · Mathematics 2011-01-10 Luis M. Briceño-Arias

We study the complexity of producing $(\delta,\epsilon)$-stationary points of Lipschitz objectives which are possibly neither smooth nor convex, using only noisy function evaluations. Recent works proposed several stochastic zero-order…

Optimization and Control · Mathematics 2024-04-16 Guy Kornowski , Ohad Shamir

Embeddings play a pivotal role across various disciplines, offering compact representations of complex data structures. Randomized methods like Johnson-Lindenstrauss (JL) provide state-of-the-art and essentially unimprovable theoretical…

Machine Learning · Statistics 2024-12-11 Nikos Tsikouras , Constantine Caramanis , Christos Tzamos

This note studies numerical methods for solving compositional optimization problems, where the inner function is smooth, and the outer function is Lipschitz continuous, non-smooth, and non-convex but exhibits one of two special structures…

Optimization and Control · Mathematics 2024-11-22 Yao Yao , Qihang Lin , Tianbao Yang

Teichm\"uller's classical mapping problem for plane domains concerns finding a lower bound for the maximal dilatation of a quasiconformal homeomorphism which holds the boundary pointwise fixed, maps the domain onto itself, and maps a given…

Complex Variables · Mathematics 2013-04-15 Matti Vuorinen , Xiaohui Zhang

We study here limit spaces $(M_\alpha,g_\alpha,p_\alpha)\stackrel{GH}{\rightarrow} (Y,d_Y,p)$, where the $M_\alpha$ have a lower Ricci curvature bound and are volume noncollapsed. Such limits $Y$ may be quite singular, however it is known…

Differential Geometry · Mathematics 2011-11-10 Tobias Holck Colding , Aaron Naber

The sparse Johnson-Lindenstrauss transform is one of the central techniques in dimensionality reduction. It supports embedding a set of $n$ points in $\mathbb{R}^d$ into $m=O(\varepsilon^{-2} \lg n)$ dimensions while preserving all pairwise…

Data Structures and Algorithms · Computer Science 2023-02-14 Mikael Møller Høgsgaard , Lion Kamma , Kasper Green Larsen , Jelani Nelson , Chris Schwiegelshohn

We consider the problem of efficient randomized dimensionality reduction with norm-preservation guarantees. Specifically we prove data-dependent Johnson-Lindenstrauss-type geometry preservation guarantees for Ho's random subspace method:…

Machine Learning · Statistics 2017-05-19 Nick Lim , Robert J. Durrant

We combine Kirchheim's metric differentials with Cheeger charts in order to establish a non-embeddability principle for any collection $\mathcal C$ of Banach (or metric) spaces: if a metric measure space $X$ bi-Lipschitz embeds in some…

We introduce and study finite $d$-volumes - the high dimensional generalization of finite metric spaces. Having developed a suitable combinatorial machinery, we define $\ell_1$-volumes and show that they contain Euclidean volumes and…

Data Structures and Algorithms · Computer Science 2010-08-03 Ilan Newman , Yuri Rabinovich

We consider four related problems. (1) Obtaining dimension estimates for the set of exceptional vantage points for the pinned Falconer distance problem. (2) Nonlinear projection theorems, in the spirit of Kaufman, Bourgain, and Shmerkin.…

Classical Analysis and ODEs · Mathematics 2024-02-27 Orit E. Raz , Joshua Zahl

The main goal of this paper is to improve the result of Ostrovskii (2012) on the finite determination of bilipschitz and coarse embeddability of locally finite metric spaces into Banach spaces. There are two directions of the improvement:…

Functional Analysis · Mathematics 2023-07-31 Florin Catrina , Mikhail I. Ostrovskii

In the Teichm\"uller space of a hyperbolic surface of finite type, we construct geodesic lines for Thurston's asymmetric metric having the property that when they are traversed in the reverse direction, they are also geodesic lines (up to…

Geometric Topology · Mathematics 2010-01-14 Athanase Papadopoulos , Guillaume Théret

This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…

Metric Geometry · Mathematics 2023-11-28 Oliver Roche-Newton , Dmitrii Zhelezov

We discuss a new pseudometric on the space of all norms on a finite-dimensional vector space (or free module) $\mathbb{F}^k$, with $\mathbb{F}$ the real, complex, or quaternion numbers. This metric arises from the Lipschitz-equivalence of…

Metric Geometry · Mathematics 2018-11-01 Apoorva Khare

Lawson-Osserman constructed three types of non-parametric minimal cones of high codimensions based on Hopf maps between spheres, which correspond to Lipschitz but non-differentiable solutions to the minimal surface equations, thereby making…

Differential Geometry · Mathematics 2017-04-10 Xiaowei Xu , Ling Yang , Yongsheng Zhang

We present a class of one-dimensional systems of nonlinear parabolic equations for which long-time phase dynamics can be described by an ODE with a Lipschitz vector field in R^n. In the considered case of the Dirichlet boundary value…

Analysis of PDEs · Mathematics 2022-10-04 A. V. Romanov

Randomized dimensionality reduction is a widely-used algorithmic technique for speeding up large-scale Euclidean optimization problems. In this paper, we study dimension reduction for a variety of maximization problems, including…

Data Structures and Algorithms · Computer Science 2025-06-03 Jie Gao , Rajesh Jayaram , Benedikt Kolbe , Shay Sapir , Chris Schwiegelshohn , Sandeep Silwal , Erik Waingarten