On approximating functions of the singular values in a stream

@inproceedings{Li2016OnAF,
  title={On approximating functions of the singular values in a stream},
  author={Y. Li and D. Woodruff},
  booktitle={STOC 2016},
  year={2016}
}
  • Y. Li, D. Woodruff
  • Published in STOC 2016
  • Computer Science, Mathematics
  • For any real number <i>p</i> > 0, we nearly completely characterize the space complexity of estimating ||<i>A</i>||<sub><i>p</i></sub><sup><i>p</i></sup> = ∑<sub><i>i</i>=1</sub><sup><i>n</i></sup> σ<sub><i>i</i></sub><sup><i>p</i></sup> for <i>n</i> × <i>n</i> matrices <i>A</i> in which each row and each column has <i>O</i>(1) non-zero entries and whose entries are presented one at a time in a data stream model. Here the σ<sub><i>i</i></sub> are the singular values of <i>A</i>, and when <i>p… CONTINUE READING

    Tables and Topics from this paper.

    Embeddings of Schatten Norms with Applications to Data Streams
    • 12
    • PDF
    Spectrum Estimation from a Few Entries
    • 5
    • Highly Influenced
    • PDF
    Testing Matrix Rank, Optimally
    • 10
    • PDF
    On the Gap Between Strict-Saddles and True Convexity: An Omega(log d) Lower Bound for Eigenvector Approximation
    • 6
    • PDF

    References

    Publications referenced by this paper.
    Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
    • 44
    • Highly Influential
    • PDF