A unified framework for linear dimensionality reduction in L1 (Q310869): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00025-015-0475-x / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964301151 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1405.1332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tutorial on large deviations for the binomial distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the restricted isometry property for random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Distribution of Rademacher Sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds for Restricted Isometry Constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing with coherent and redundant dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary proof of a theorem of Johnson and Lindenstrauss / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric structures in \(L_1\): dimension, snowflakes, and average distortion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical introduction to compressive sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The best constants in the Khintchine inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation of Quasi-Normed Spaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable distributions, pseudorandom generators, embeddings, and data stream computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for the low-rank approximation of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest singular value of random matrices and geometry of random polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Bit Compressed Sensing by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight embedding of subspaces of 𝐿_{𝑝} in ℓ_{𝑝}ⁿ for even 𝑝 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Sensing With Cross Validation / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00025-015-0475-X / rank
 
Normal rank

Latest revision as of 15:05, 9 December 2024

scientific article
Language Label Description Also known as
English
A unified framework for linear dimensionality reduction in L1
scientific article

    Statements

    A unified framework for linear dimensionality reduction in L1 (English)
    0 references
    0 references
    0 references
    8 September 2016
    0 references
    For a family of interpolation norms \(\|\cdot \|_{1,2,s}\) on \(\mathbb{R}^n\) the authors provide a distribution over random matrices \(\Phi_s\in\mathbb{R}^{m\times n}\) parametrized by sparsity level \(s\) such that for a fixed set \(X\) of K points in \(\mathbb{R}^n\) holds: if \(m\geq Cs\log (K)\) then with high probability \(\frac12 \| x\|_{1,2,s}\leq \|\Phi_s(x)\|_1\leq 2\| x\|_{1,2,s}\) for all \(x\in X\). In this way, they manage to recove some existiong results in the literature (for \(s=n\), \(s=1\)).
    0 references
    interpolation norm, random variable
    0 references
    linear dimensionality reduction
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references