Pages that link to "Item:Q4798181"

The following pages link to An elementary proof of a theorem of Johnson and Lindenstrauss (Q4798181):

Displaying 50 items.

• Rigorous RG algorithms and area laws for low energy eigenstates in 1D (Q2412377) (← links)
• A central limit theorem for convex sets (Q2457766) (← links)
• A note on linear function approximation using random projections (Q2519761) (← links)
• Empirical processes and random projections (Q2566243) (← links)
• Random fusion frames are nearly equiangular and tight (Q2637128) (← links)
• Optimal stable nonlinear approximation (Q2671290) (← links)
• The geometry of off-the-grid compressed sensing (Q2684465) (← links)
• Random projections of linear and semidefinite problems with linear inequalities (Q2689146) (← links)
• Sparse Learning for Large-Scale and High-Dimensional Data: A Randomized Convex-Concave Optimization Approach (Q2830269) (← links)
• How accurately should I compute implicit matrix-vector products when applying the Hutchinson trace estimator? (Q2831087) (← links)
• Old Tails and New Trails in High Dimensions (Q2858972) (← links)
• On the efficiency of Hamiltonian-based quantum computation for low-rank matrices (Q2861773) (← links)
• Random projections and Hotelling's \(T^2\) statistics for change detection in high-dimensional data streams (Q2872879) (← links)
• The coefficient regularized regression with random projection (Q2911899) (← links)
• Equality, Revisited (Q2946382) (← links)
• Almost Optimal Explicit Johnson-Lindenstrauss Families (Q3088132) (← links)
• Johnson-Lindenstrauss lemma for circulant matrices** (Q3094609) (← links)
• A Powerful Bayesian Test for Equality of Means in High Dimensions (Q3121565) (← links)
• Fast Phase Retrieval from Local Correlation Measurements (Q3179618) (← links)
• Sparser Johnson-Lindenstrauss Transforms (Q3189639) (← links)
• An Introduction to Compressed Sensing (Q3296174) (← links)
• Classification Scheme for Binary Data with Extensions (Q3296178) (← links)
• Statistical mechanics of complex neural systems and high dimensional data (Q3301560) (← links)
• A Computationally Efficient Projection-Based Approach for Spatial Generalized Linear Mixed Models (Q3391151) (← links)
• Deterministic Truncation of Linear Matroids (Q3448849) (← links)
• Compressive Sensing with Redundant Dictionaries and Structured Measurements (Q3455237) (← links)
• A Survey of Compressed Sensing (Q3460827) (← links)
• On variants of the Johnson–Lindenstrauss lemma (Q3522833) (← links)
• A Uniform Lower Error Bound for Half-Space Learning (Q3529911) (← links)
• Random Projection RBF Nets for Multidimensional Density Estimation (Q3601357) (← links)
• Generalizing the Johnson–Lindenstrauss lemma to k-dimensional affine subspaces (Q3651152) (← links)
• Randomized algorithms in numerical linear algebra (Q4594242) (← links)
• Representation and coding of signal geometry (Q4603712) (← links)
• Time for dithering: fast and quantized random embeddings via the restricted isometry property (Q4603715) (← links)
• Literature survey on low rank approximation of matrices (Q4603753) (← links)
• Simple Classification using Binary Data (Q4614095) (← links)
• Optimal Bounds for Johnson-Lindenstrauss Transformations (Q4614115) (← links)
• A Well-Tempered Landscape for Non-convex Robust Subspace Recovery (Q4633049) (← links)
• (Q4636971) (← links)
• (Q4637072) (← links)
• (Q4638103) (← links)
• Frames as Codes (Q4912897) (← links)
• The Bottleneck Degree of Algebraic Varieties (Q4959845) (← links)
• On Geometric Prototype and Applications (Q5009580) (← links)
• Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing (Q5020144) (← links)
• Two Models of Double Descent for Weak Features (Q5027013) (← links)
• Overcomplete Order-3 Tensor Decomposition, Blind Deconvolution, and Gaussian Mixture Models (Q5065479) (← links)
• Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering (Q5067443) (← links)
• (Q5088977) (← links)
• The complexity of quantum disjointness (Q5111229) (← links)