Author of the publication

How to Fake Multiply by a Gaussian Matrix.

, , and . ICML, volume 48 of JMLR Workshop and Conference Proceedings, page 2101-2110. JMLR.org, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Optimal Space Lower Bound for Approximating MAX-CUT., and . CoRR, (2018)NNS Lower Bounds via Metric Expansion for l ∞ and EMD., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 545-556. Springer, (2012)Towards tight bounds for spectral sparsification of hypergraphs., , , and . STOC, page 598-611. ACM, (2021)Noisy Boolean Hidden Matching with Applications., , , , and . ITCS, volume 215 of LIPIcs, page 91:1-91:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling., , and . ITCS, volume 124 of LIPIcs, page 6:1-6:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)How to Fake Multiply by a Gaussian Matrix., , and . ICML, volume 48 of JMLR Workshop and Conference Proceedings, page 2101-2110. JMLR.org, (2016)Prediction strategies without loss., and . NIPS, page 828-836. (2011)Fast and Space Efficient Spectral Sparsification in Dynamic Streams., , , , , , and . SODA, page 1814-1833. SIAM, (2020)Better bounds for matchings in the streaming model.. SODA, page 1679-1697. SIAM, (2013)Online Submodular Welfare Maximization: Greedy is Optimal., , and . SODA, page 1216-1225. SIAM, (2013)