How robust are linear sketches to adaptive inputs?

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 121-130

  Hardt, Moritz ^a   Woodruff, David P ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Compressed sensing; Robustness; Sketches

Indexed keywords

ALGORITHMIC TOOLS; EUCLIDEAN NORM; MULTIPLICATIVE APPROXIMATIONS; NORM ESTIMATIONS; POLYNOMIAL NUMBER; RUNNING TIME; SKETCHES; UNBOUNDED COMPUTATIONS;

COMPRESSED SENSING; POLYNOMIAL APPROXIMATION; PROBABILITY DISTRIBUTIONS; ROBUSTNESS (CONTROL SYSTEMS); SIGNAL RECONSTRUCTION;

COMPUTATION THEORY;

EID: 84879825768     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488624     Document Type: Conference Paper

References (18)

1. K. J. Ahn, S. Guha, A. McGregor. Analyzing graph structure via linear measurements. In SODA, 2012.
2. K. J. Ahn, S. Guha, A. McGregor. Graph sketches: sparsification, spanners, and subgraphs. In PODS, 2012.
3. N. Alon, Y. Matias, M. Szegedy. The Space Complexity of Approximating the Frequency Moments. J. Comput. Syst. Sci., 58(1):137-147, 1999.
4. J. T. Chang, D. Pollard. Conditioning as disintegration. Statistica Neerlandica, 51(3):287-317, 1997.
5. G. Cormode, S. Muthukrishnan, K. Yi. Algorithms for distributed functional monitoring. ACM Transactions on Algorithms, 7(2):21, 2011.
6. C. Dwork, F. McSherry, K. Nissim, A. Smith. Calibrating noise to sensitivity in private data analysis. In TCC, 2006.
7. C. Dwork, M. Naor, S. Vadhan. The privacy of the analyst and the power of the state. In FOCS, 2012.
8. A. C. Gilbert, B. Hemenway, A. Rudra, M. J. Strauss, M. Wootters. Recovering simple signals. In ITA, 2012.
9. Anna C. Gilbert, Brett Hemenway, Martin J. Strauss, David P. Woodruff, Mary Wootters. Reusable low-error compressive sampling schemes through privacy. In SSP, 2012.
10. M. Hardt, G. Rothblum. A multiplicative weights mechanism for privacy-preserving data analysis. In FOCS, 2010.
11. P. Indyk. Sketching, streaming and sublinear-space algorithms, 2007. Graduate course notes available at http://stellar.mit.edu/S/course/6/fa07/6.895/ .
12. P. Indyk, E. Price, D. P. Woodruff. On the power of adaptivity in sparse recovery. In FOCS, 2011.
13. S. Madden, M. J. Franklin, J. M. Hellerstein, W. Hong. Tag: A tiny aggregation service for ad-hoc sensor networks. In OSDI, 2002.
14. A. McGregor, I. Mironov, T. Pitassi, O. Reingold, K. Talwar, S. P. Vadhan. The limits of two-party differential privacy. In FOCS, 2010.
15. I. Mironov, M. Naor, G. Segev. Sketching in adversarial environments. In STOC, 2008.
16. S. Muthukrishnan. Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science, 1(2):117-236, 2005.
17. E. Price, D. P. Woodruff. Lower bounds for adaptive sparse recovery. In SODA, 2013.
18. A. Roth, T. Roughgarden. Interactive privacy via the median mechanism. In STOC, 2010.