Extensions of Lipschitz mappings into a Hilbert space
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Sketching information divergences
- Volume distortion for subsets of Euclidean spaces
- Lower bounds for local versions of dimension reductions
- Extending Lipschitz and Hölder maps between metric spaces
- A simple proof of the restricted isometry property for random matrices
- Fast dimension reduction using Rademacher series on dual BCH codes
- Banach spaces with a weak cotype 2 property
- On Lipschitz embedding of finite metric spaces in Hilbert space
- The Johnson-Lindenstrauss lemma and the sphericity of some graphs
- Markov chains, Riesz transforms and Lipschitz maps
- A remark on almost extensions of Lipschitz functions
- Randomized nonlinear projections uncover high-dimensional structure
- On embedding expanders into \(\ell_p\) spaces
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- More on the duality conjecture for entropy numbers.
- Problems and results in extremal combinatorics. I.
- Low dimensional embeddings of ultrametrics.
- Latent semantic indexing: A probabilistic analysis
- Extension of the Hilbert-valued Lipschitz mappings
- Stability of the Lipschitz extension property under metric transforms
- On approximating planar metrics by tree metrics.
- On approximate nearest neighbors under \(l_\infty\) norm
- On principal components regression, random projections, and column subsampling
- Gaussian random projections for Euclidean membership problems
- A Gaussian small deviation inequality for convex functions
- On Dvoretzky's theorem for subspaces of \(L_p\)
- Efficient clustering on Riemannian manifolds: a kernelised random projection approach
- Isometries and additive mapping on the unit spheres of normed spaces
- Robustness properties of dimensionality reduction with Gaussian random matrices
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings
- Lipschitz extensions to finitely many points
- Entropy dimension reduction method for randomized machine learning problems
- Forecasting using random subspace methods
- Bayesian compressed vector autoregressions
- Scalable density-based clustering with quality guarantees using random projections
- Graph summarization with quality guarantees
- Learning the geometry of common latent variables using alternating-diffusion
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- Fast, linear time, m-adic hierarchical clustering for search and retrieval using the Baire metric, with linkages to generalized ultrametrics, hashing, formal concept analysis, and precision of data measurement
- Extending Lipschitz functions via random metric partitions
- Learning mixtures of separated nonspherical Gaussians
- Deep network based on stacked orthogonal convex incremental ELM autoencoders
- Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering
- Finite metric spaces needing high dimension for Lipschitz embeddings in Banach spaces
- On computing the diameter of a point set in high dimensional Euclidean space.
- Proportional concentration phenomena on the sphere
- Remarks on the geometry of coordinate projections in \(\mathbb{R}^n\)
- The geometry of graphs and some of its algorithmic applications
- On the distortion required for embedding finite metric spaces into normed spaces
- Hard Sard: quantitative implicit function and extension theorems for Lipschitz maps
- An introduction to the Ribe program
- Absolutely minimal Lipschitz extension of tree-valued mappings
- Ensemble clustering using semidefinite programming with applications
- On embedding trees into uniformly convex Banach spaces
- On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
- GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions
- Geometric component analysis and its applications to data analysis
- Random projections for conic programs
- An average John theorem
- No dimension reduction for doubling subsets of \(\ell_q\) when \(q>2\) revisited
- Robust \(k\)-means clustering for distributions with two moments
- Random projection-based auxiliary information can improve tree-based nearest neighbor search
- Bayesian random projection-based signal detection for Gaussian scale space random fields
- Optimal fast Johnson-Lindenstrauss embeddings for large data sets
- Dimensionality reduction for \(k\)-distance applied to persistent homology
- An asymptotic thin shell condition and large deviations for random multidimensional projections
- High-dimensional outlier detection using random projections
- Dimension reduction in recurrent networks by canonicalization
- Fast and memory-optimal dimension reduction using Kac's walk
- Manifold reconstruction and denoising from scattered data in high dimension
- Variance reduction in feature hashing using MLE and control variate method
- On the perceptron's compression
- A refined approximation for Euclidean \(k\)-means
- Pass-efficient methods for compression of high-dimensional turbulent flow data
- Derandomized compressed sensing with nonuniform guarantees for _1 recovery
- Random embeddings with an almost Gaussian distortion
- Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
- Lower bounds on lattice sieving and information set decoding
- High-dimensional clustering via random projections
- Continuity of extensions of Lipschitz maps
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- Spectral estimation from simulations via sketching
- Efficient binary embedding of categorical data using BinSketch
- Numerical bifurcation analysis of PDEs from lattice Boltzmann model simulations: a parsimonious machine learning approach
- Infinite lattice learner: an ensemble for incremental learning
- Covariance matrix testing in high dimension using random projections
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- The perfect marriage and much more: combining dimension reduction, distance measures and covariance
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Randomization and entropy in machine learning and data processing
- A survey of outlier detection in high dimensional data streams
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
- A simple test for zero multiple correlation coefficient in high-dimensional normal data using random projection
- Distance geometry and data science
- Estimates on the Markov convexity of Carnot groups and quantitative nonembeddability
- Adaptive iterative Hessian sketch via A-optimal subsampling
- Random projections for quadratic programs
- One-trial correction of legacy AI systems and stochastic separation theorems
- A weighted multiple classifier framework based on random projection
- Linear dimension reduction approximately preserving a function of the $1$-norm
This page was built for publication: Extensions of Lipschitz mappings into a Hilbert space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3326256)
