NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (34)

cs.DS2011

Lower Bounds for Sparse Recovery

Khanh Do Ba, Piotr Indyk, Eric Price +1

cs.DS2012

Nearly Optimal Sparse Fourier Transform

Haitham Hassanieh, Piotr Indyk, Dina Katabi +1

cs.DS2019

Optimal Identity Testing with High Probability

Ilias Diakonikolas, Themis Gouleakis, John Peebles +1

cs.DS2016

Fourier-sparse interpolation without a frequency gap

Xue Chen, Daniel M. Kane, Eric Price +1

cs.DS2016

A Robust Sparse Fourier Transform in the Continuous Setting

Eric Price, Zhao Song

cs.DS2018

Stochastic Multi-armed Bandits in Constant Space

David Liau, Eric Price, Zhao Song +1

cs.DS2017

Fast Regression with an $\ell_\infty$ Guarantee

Eric Price, Zhao Song, David P. Woodruff

cs.CG2012

Compressive Sensing with Local Geometric Features

Rishi Gupta, Piotr Indyk, Eric Price +1

stat.ML2017

Compressed Sensing using Generative Models

Ashish Bora, Ajil Jalal, Eric Price +1

cs.DS2018

The Sketching Complexity of Graph and Hypergraph Counting

John Kallaugher, Michael Kapralov, Eric Price

cs.DS2017

Robust polynomial regression up to the information theoretic limit

Daniel Kane, Sushrut Karmalkar, Eric Price

cs.DS2015

The Noisy Power Method: A Meta Algorithm with Applications

Moritz Hardt, Eric Price

cs.DS2013

Improved Concentration Bounds for Count-Sketch

Gregory T. Minton, Eric Price

cs.DS2019

Compressed Sensing with Adversarial Sparse Noise via L1 Regression

Sushrut Karmalkar, Eric Price

cs.DS2019

A Hybrid Sampling Scheme for Triangle Counting

John Kallaugher, Eric Price

cs.LG2019

Active Regression via Linear-Sample Sparsification

Xue Chen, Eric Price

stat.ML2018

Adversarial examples from computational constraints

Sébastien Bubeck, Eric Price, Ilya Razenshteyn

cs.LG2016

Equality of Opportunity in Supervised Learning

Moritz Hardt, Eric Price, Nathan Srebro

cs.DS2011

On the Power of Adaptivity in Sparse Recovery

Piotr Indyk, Eric Price, David P. Woodruff

cs.LG2018

Adversarial Examples from Cryptographic Pseudo-Random Generators

Sébastien Bubeck, Yin Tat Lee, Eric Price +1

cs.DS2010

Efficient Sketches for the Set Query Problem

Eric Price

cs.LG2015

Tight bounds for learning a mixture of two gaussians

Moritz Hardt, Eric Price

cs.DS2015

Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching

Arturs Backurs, Piotr Indyk, Eric Price +2

cs.DS2012

K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance

Piotr Indyk, Eric Price

cs.DS2012

Lower Bounds for Adaptive Sparse Recovery

Eric Price, David P. Woodruff

cs.DS2018

Batch Sparse Recovery, or How to Leverage the Average Sparsity

Alexandr Andoni, Lior Kamma, Robert Krauthgamer +1

cs.DS2019

Estimating the Frequency of a Clustered Signal

Xue Chen, Eric Price

cs.DS2012

New constructions of RIP matrices with fast multiplication and fewer rows

Jelani Nelson, Eric Price, Mary Wootters

cs.NE2016

Extensions and Limitations of the Neural GPU

Eric Price, Wojciech Zaremba, Ilya Sutskever

cs.DS2013

Sample-Optimal Average-Case Sparse Fourier Transform in Two Dimensions

Badih Ghazi, Haitham Hassanieh, Piotr Indyk +3

cs.DS2019

Binary Embedding: Fundamental Limits and Fast Algorithm

Xinyang Yi, Constantine Caramanis, Eric Price

cs.DS2016

Collision-based Testers are Optimal for Uniformity and Closeness

Ilias Diakonikolas, Themis Gouleakis, John Peebles +1

cs.DS2011

(1+eps)-approximate Sparse Recovery

Eric Price, David P. Woodruff

cs.DS2014

Optimal Lower Bound for Itemset Frequency Indicator Sketches

Eric Price