Extensions of Lipschitz mappings into a Hilbert space
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On \(b\)-bit min-wise hashing for large-scale regression and classification with sparse data
- Sketched ridge regression: optimization perspective, statistical perspective, and model averaging
- Randomized complete pivoting for solving symmetric indefinite linear systems
- How to measure the researcher impact with the aid of its impactable area: a concrete approach using distance geometry
- Sharp-SSL: Selective High-Dimensional Axis-Aligned Random Projections for Semi-Supervised Learning
- PLSS: A Projected Linear Systems Solver
- An algorithmic theory of learning: robust concepts and random projection
- Statistical methods for tissue array images -- algorithmic scoring and co-training
- Random projections for quadratic programs
- Fast Metric Embedding into the Hamming Cube
- Extensions of vector-valued functions with preservation of derivatives
- Entropy dimension reduction method for randomized machine learning problems
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
- Markov chains in smooth Banach spaces and Gromov-hyperbolic metric spaces
- An extension of the contraction mapping principle to Lipschitzian mappings
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Dimension reduction by random hyperplane tessellations
- Proximinality and uniformly approximable sets in L^p
- Fast Phase Retrieval from Local Correlation Measurements
- Local embeddings of metric spaces
- Fast cross-polytope locality-sensitive hashing
- Randomized large distortion dimension reduction
- Randomized signature methods in optimal portfolio selection
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- Non-isometry, state dependence and holography
- A survey on unsupervised outlier detection in high‐dimensional numerical data
- Gaussian random projections of convex cones: approximate kinematic formulae and applications
- Extensions of Lipschitz maps into Hadamard spaces
- Detecting interactions in high-dimensional data using cross leverage scores
- Hypercube LSH for approximate near neighbors
- Random-walk based approximate \(k\)-nearest neighbors algorithm for diffusion state distance
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- Parameterized approximation algorithms and lower bounds for k-center clustering and variants
- On the distortion required for embedding finite metric spaces into normed spaces
- Randomized Sampling for Basis Function Construction in Generalized Finite Element Methods
- Banach spaces with a weak cotype 2 property
- Euclidean arrangements in Banach spaces
- Binary vectors for fast distance and similarity estimation
- Euclidean distortion and the sparsest cut
- Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering
- On deterministic sketching and streaming for sparse recovery and norm estimation
- Quantization and compressive sensing
- Dimension reduction and construction of feature space for image pattern recognition
- Loda: lightweight on-line detector of anomalies
- Hierarchically compositional kernels for scalable nonparametric learning
- An O(N N) hierarchical random compression method for kernel matrices by sampling partial matrix entries
- Gaussian random projections for Euclidean membership problems
- Approximate F₂-Sketching of Valuation Functions
- Testing and estimating change-points in the covariance matrix of a high-dimensional time series
- An algorithmic theory of learning: Robust concepts and random projection
- Theory and applications of compressed sensing
- Six mathematical gems from the history of distance geometry
- scientific article; zbMATH DE number 1521483 (Why is no real title available?)
- Spectral estimation from simulations via sketching
- Efficient binary embedding of categorical data using BinSketch
- Derandomized compressed sensing with nonuniform guarantees for _1 recovery
- 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
- Compressed labeling on distilled labelsets for multi-label learning
- Extending Lipschitz functions via random metric partitions
- Random Projection RBF Nets for Multidimensional Density Estimation
- A class of sparse Johnson-Lindenstrauss transforms and analysis of their extreme singular values
- The Mailman algorithm: a note on matrix-vector multiplication
- Low distortion metric embedding into constant dimension
- Bounds on Dimension Reduction in the Nuclear Norm
- On multiplicative \(\lambda\)-approximations and some geometric applications
- scientific article; zbMATH DE number 4138748 (Why is no real title available?)
- Compressive Gaussian mixture estimation
- Learning in compressed space
- Randomized interpolative decomposition of separated representations
- Random projections of linear and semidefinite problems with linear inequalities
- Variance estimates and almost Euclidean structure
- Convexification with bounded gap for randomly projected quadratic optimization
- Opinion maximization in social networks via link recommendation
- Diagonal of pseudoinverse of graph Laplacian: fast estimation and exact results
- Neural manifold analysis of brain circuit dynamics in health and disease
- Distance geometry and data science
- Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers
- Noise-shaping quantization methods for frame-based and compressive sampling systems
- Remarks on the geometry of coordinate projections in \(\mathbb{R}^n\)
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
- What relations are reliably embeddable in Euclidean space?
- Explicit constructions of RIP matrices and related problems
- \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores
- Sparsified randomization algorithms for low rank approximations and applications to integral equations and inhomogeneous random field simulation
- Holographic phenomenology via overlapping degrees of freedom
- Limitations on quantum dimensionality reduction
- Indexability, concentration, and VC theory
- Simple tests on multiple correlation coefficient in high-dimensional normal data
- Exponential lower bounds for planning in MDPs with linearly-realizable optimal action-value functions
- Subspace embeddings under nonlinear transformations
- The geometry of graphs and some of its algorithmic applications
- An Outer-Product-of-Gradient Approach to Dimension Reduction and its Application to Classification in High Dimensional Space
- Linear dimension reduction approximately preserving a function of the $1$-norm
- Lipschitz subtype
- On computing the diameter of a point set in high dimensional Euclidean space.
- Large deviation principles induced by the Stiefel manifold, and random multidimensional projections
- Lossless prioritized embeddings
- A unified framework for linear dimensionality reduction in L1
- Compressed sensing and dynamic mode decomposition
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)
