Beyond worst-case analysis in private singular vector computation
Authors:
Open Access
- 1 June 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 331-340
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- On differentially private low rank approximation2013
- The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy2012
- Beating randomized response on incoherent matrices2012
- Iterative Constructions and Private Data Release2012
- A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis2010
- The Power of Convex Relaxation: Near-Optimal Matrix CompletionIEEE Transactions on Information Theory, 2010
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Robust De-anonymization of Large Sparse Datasets2008 IEEE Symposium on Security and Privacy (SP 2008), 2008
- Practical privacy2005
- Revealing information while preserving privacy2003