Extensions of Lipschitz mappings into a Hilbert space

DOI10.1090/CONM/026/737400zbMath0539.46017OpenAlexW2979473749WikidataQ57253306 ScholiaQ57253306MaRDI QIDQ3326256

William B. Johnson, Joram Lindenstrauss

Publication date: 1984

Published in: Conference on Modern Analysis and Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/conm/026/737400

zbMATH Keywords

metric spaces Hilbert space Lipschitz map Lipschitz norm

Mathematics Subject Classification ID

Geometry and structure of normed linear spaces (46B20) Theorems of Hahn-Banach type; extension and lifting of functionals and operators (46A22) Isomorphic theory (including renorming) of Banach spaces (46B03)

Related Items (only showing first 100 items - show all)

A Simple Tool for Bounding the Deviation of Random Matrices on Geometric Sets ⋮ Johnson–Lindenstrauss Embeddings with Kronecker Structure ⋮ Random projection preserves stability with high probability ⋮ Randomized numerical linear algebra: Foundations and algorithms ⋮ Randomized QR with Column Pivoting ⋮ Lower bounds on the low-distortion embedding dimension of submanifolds of $\mathbb{R}^n$ ⋮ PLSS: A Projected Linear Systems Solver ⋮ Algebraic compressed sensing ⋮ Tighter guarantees for the compressive multi-layer perceptron ⋮ Around the log-rank conjecture ⋮ Towards Practical Large-Scale Randomized Iterative Least Squares Solvers through Uncertainty Quantification ⋮ An Outer-Product-of-Gradient Approach to Dimension Reduction and its Application to Classification in High Dimensional Space ⋮ Random Projection Ensemble Classification with High-Dimensional Time Series ⋮ M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions ⋮ A hybrid stochastic interpolation and compression method for kernel matrices ⋮ Proximinality and uniformly approximable sets in $L^p$ ⋮ Secure sampling with sublinear communication ⋮ Neural ODE Control for Classification, Approximation, and Transport ⋮ $\mathrm{MIP}^* = \mathrm{RE}$: a negative resolution to Connes' embedding problem and Tsirelson's problem ⋮ Labelings vs. embeddings: on distributed and prioritized representations of distances ⋮ $ \varepsilon $-isometric dimension reduction for incompressible subsets of $\ell_p$ ⋮ Minimum cost flow in the CONGEST model ⋮ On fast Johnson-Lindenstrauss embeddings of compact submanifolds of $\mathbb{R}^N$ with boundary ⋮ Fast Metric Embedding into the Hamming Cube ⋮ Neural manifold analysis of brain circuit dynamics in health and disease ⋮ Unnamed Item ⋮ Correlation-based sparse inverse Cholesky factorization for fast Gaussian-process inference ⋮ Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers ⋮ Large deviation principles induced by the Stiefel manifold, and random multidimensional projections ⋮ Statistical embedding: beyond principal components ⋮ Distributed estimation and inference for spatial autoregression model with large scale networks ⋮ Geometric bounds on the fastest mixing Markov chain ⋮ On the distance to low-rank matrices in the maximum norm ⋮ Euclidean distortion and the sparsest cut ⋮ Unnamed Item ⋮ Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. ⋮ Visual Categorization with Random Projection ⋮ Advances in metric embedding theory ⋮ Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis ⋮ Approximate F_2-Sketching of Valuation Functions ⋮ Log-Lipschitz embeddings of homogeneous sets with sharp logarithmic exponents and slicing products of balls ⋮ Comparison of Metric Spectral Gaps ⋮ Testing the manifold hypothesis ⋮ On dominated $\ell_1$ metrics ⋮ Speeding-Up Lattice Reduction with Random Projections (Extended Abstract) ⋮ Approximate minimum enclosing balls in high dimensions using core-sets ⋮ Some applications of Ball’s extension theorem ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ Local embeddings of metric spaces ⋮ Random Projections for Linear Programming ⋮ On the Atomic Decomposition of Coorbit Spaces with Non-integrable Kernel ⋮ Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation ⋮ A Simple Proof of the Johnson–Lindenstrauss Extension Theorem ⋮ On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ ⋮ Nonadditivity of Rényi entropy and Dvoretzky’s theorem ⋮ Beta Random Projection ⋮ The legacy of Jean Bourgain in geometric functional analysis ⋮ Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization ⋮ Sampling, Metric Entropy, and Dimensionality Reduction ⋮ Euclidean arrangements in Banach spaces ⋮ Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fast Cluster Tendency Assessment for Big, High-Dimensional Data ⋮ An accelerated randomized Kaczmarz method via low-rank approximation ⋮ On principal components regression, random projections, and column subsampling ⋮ Robust vertex enumeration for convex hulls in high dimensions ⋮ Matrix sketching for supervised classification with imbalanced classes ⋮ Banach spaces with a weak cotype 2 property ⋮ Remarks on the geometry of coordinate projections in $\mathbb{R}^n$ ⋮ Dimension reduction and construction of feature space for image pattern recognition ⋮ Loda: lightweight on-line detector of anomalies ⋮ Gaussian random projections for Euclidean membership problems ⋮ A unified framework for linear dimensionality reduction in L1 ⋮ Compressed sensing and dynamic mode decomposition ⋮ An algorithmic theory of learning: robust concepts and random projection ⋮ Kernels as features: on kernels, margins, and low-dimensional mappings ⋮ A Gaussian small deviation inequality for convex functions ⋮ Metric embedding, hyperbolic space, and social networks ⋮ On Dvoretzky's theorem for subspaces of $L_p$ ⋮ On Lipschitz embedding of finite metric spaces in Hilbert space ⋮ Randomized nonlinear projections uncover high-dimensional structure ⋮ On embedding expanders into $\ell_p$ spaces ⋮ Efficient clustering on Riemannian manifolds: a kernelised random projection approach ⋮ The Johnson-Lindenstrauss lemma and the sphericity of some graphs ⋮ Randomized projective methods for the construction of binary sparse vector representations ⋮ Isometries and additive mapping on the unit spheres of normed spaces ⋮ Dimension reduction for finite trees in $\ell_1$ ⋮ A nonlinear approach to dimension reduction ⋮ Fast density-weighted low-rank approximation spectral clustering ⋮ Randomized anisotropic transform for nonlinear dimensionality reduction ⋮ Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation ⋮ Database-friendly random projections: Johnson-Lindenstrauss with binary coins. ⋮ Compression bounds for Lipschitz maps from the Heisenberg group to $L_{1}$ ⋮ Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis ⋮ A variant of the Johnson-Lindenstrauss lemma for circulant matrices ⋮ Dense fast random projections and Lean Walsh transforms ⋮ Shape classification by manifold learning in multiple observation spaces

This page was built for publication: Extensions of Lipschitz mappings into a Hilbert space