The Price of Differential Privacy for Low-Rank Factorization
暂无分享,去创建一个
[1] Ivan Markovsky,et al. Structured low-rank approximation and its applications , 2008, Autom..
[2] Santosh S. Vempala,et al. Adaptive Sampling and Fast Low-Rank Matrix Approximation , 2006, APPROX-RANDOM.
[3] Aaron Roth,et al. A learning theory approach to non-interactive database privacy , 2008, STOC.
[4] Aaron Roth,et al. The Algorithmic Foundations of Differential Privacy , 2014, Found. Trends Theor. Comput. Sci..
[5] Yoram Singer,et al. Local Low-Rank Matrix Approximation , 2013, ICML.
[6] Ivan Markovsky,et al. Low Rank Approximation - Algorithms, Implementation, Applications , 2018, Communications and Control Engineering.
[7] Peter Bro Miltersen,et al. On data structures and asymmetric communication complexity , 1994, STOC '95.
[8] Nina Mishra,et al. Privacy via the Johnson-Lindenstrauss Transform , 2012, J. Priv. Confidentiality.
[9] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[10] Michael W. Mahoney. Randomized Algorithms for Matrices and Data , 2011, Found. Trends Mach. Learn..
[11] Christos Boutsidis,et al. Communication-optimal Distributed Principal Component Analysis in the Column-partition Model , 2015, ArXiv.
[12] Nello Cristianini,et al. Kernel Methods for Pattern Analysis , 2004 .
[13] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .
[14] Úlfar Erlingsson,et al. RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response , 2014, CCS.
[15] Aaron Roth,et al. Beating randomized response on incoherent matrices , 2011, STOC '12.
[16] Sofya Raskhodnikova,et al. What Can We Learn Privately? , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[17] Alan M. Frieze,et al. Fast Monte-Carlo algorithms for finding low-rank approximations , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[18] Amos Fiat,et al. Web search via hub synthesis , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[19] Jack J. Dongarra,et al. A Parallel Divide and Conquer Algorithm for the Symmetric Eigenvalue Problem on Distributed Memory Architectures , 1999, SIAM J. Sci. Comput..
[20] Adam D. Smith,et al. Is Interaction Necessary for Distributed Private Learning? , 2017, 2017 IEEE Symposium on Security and Privacy (SP).
[21] Jalaj Upadhyay,et al. Differentially Private Linear Algebra in the Streaming Model , 2014, IACR Cryptol. ePrint Arch..
[22] Avner Magen,et al. Low rank matrix-valued chernoff bounds and approximate matrix multiplication , 2010, SODA '11.
[23] Jalaj Upadhyay,et al. Randomness Efficient Fast-Johnson-Lindenstrauss Transform with Applications in Differential Privacy and Compressed Sensing , 2014, 1410.2470.
[24] Avrim Blum,et al. The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[25] David P. Woodruff,et al. Turnstile streaming algorithms might as well be linear sketches , 2014, STOC.
[26] Christos Boutsidis,et al. Optimal principal component analysis in distributed and streaming models , 2015, STOC.
[27] Cynthia Dwork,et al. Practical privacy: the SuLQ framework , 2005, PODS.
[28] Moni Naor,et al. Differential privacy under continual observation , 2010, STOC '10.
[29] David P. Woodruff,et al. Low-Rank PSD Approximation in Input-Sparsity Time , 2017, SODA.
[30] Alwin Stegeman,et al. Low-Rank Approximation of Generic p˟q˟2 Arrays and Diverging Components in the Candecomp/Parafac Model , 2008, SIAM J. Matrix Anal. Appl..
[31] Petros Drineas,et al. On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning , 2005, J. Mach. Learn. Res..
[32] Daniel M. Kane,et al. Sparser Johnson-Lindenstrauss Transforms , 2010, JACM.
[33] Michael B. Cohen,et al. Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling , 2015, SODA.
[34] Irit Dinur,et al. Revealing information while preserving privacy , 2003, PODS.
[35] Michael B. Cohen,et al. Dimensionality Reduction for k-Means Clustering and Low Rank Approximation , 2014, STOC.
[36] Sanjeev Khanna,et al. Distributed Private Heavy Hitters , 2012, ICALP.
[37] Moritz Hardt,et al. The Noisy Power Method: A Meta Algorithm with Applications , 2013, NIPS.
[38] Alan M. Frieze,et al. Clustering Large Graphs via the Singular Value Decomposition , 2004, Machine Learning.
[39] Frank McSherry,et al. Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[40] Jayant R. Haritsa,et al. A Framework for High-Accuracy Privacy-Preserving Mining , 2005, ICDE.
[41] Prateek Jain,et al. Low-rank matrix completion using alternating minimization , 2012, STOC '13.
[42] David P. Woodruff,et al. Improved Distributed Principal Component Analysis , 2014, NIPS.
[43] Pravesh Kothari,et al. 25th Annual Conference on Learning Theory Differentially Private Online Learning , 2022 .
[44] David P. Woodruff. Sketching as a Tool for Numerical Linear Algebra , 2014, Found. Trends Theor. Comput. Sci..
[45] Alexandre V. Evfimievski,et al. Limiting privacy breaches in privacy preserving data mining , 2003, PODS.
[46] Dimitris Achlioptas,et al. Fast computation of low-rank matrix approximations , 2007, JACM.
[47] Moni Naor,et al. Our Data, Ourselves: Privacy Via Distributed Noise Generation , 2006, EUROCRYPT.
[48] Michael W. Mahoney,et al. Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression , 2012, STOC '13.
[49] S. Muthukrishnan,et al. Data streams: algorithms and applications , 2005, SODA '03.
[50] Elaine Shi,et al. Private and Continual Release of Statistics , 2010, ICALP.
[51] Ohad Shamir,et al. Communication-efficient Algorithms for Distributed Stochastic Principal Component Analysis , 2017, ICML.
[52] Robert A. van de Geijn,et al. Elemental: A New Framework for Distributed Memory Dense Matrix Computations , 2013, TOMS.
[54] Dimitris Achlioptas,et al. On Spectral Learning of Mixtures of Distributions , 2005, COLT.
[55] Vitaly Shmatikov,et al. Robust De-anonymization of Large Sparse Datasets , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).
[56] Petros Drineas,et al. FAST MONTE CARLO ALGORITHMS FOR MATRICES II: COMPUTING A LOW-RANK APPROXIMATION TO A MATRIX∗ , 2004 .
[57] Anna R. Karlin,et al. Spectral analysis of data , 2001, STOC '01.
[58] Franklin T. Luk,et al. Principal Component Analysis for Distributed Data Sets with Updating , 2005, APPT.
[59] Santosh S. Vempala,et al. Latent semantic indexing: a probabilistic analysis , 1998, PODS '98.
[60] Raef Bassily,et al. Local, Private, Efficient Protocols for Succinct Histograms , 2015, STOC.
[61] Santosh S. Vempala,et al. The Spectral Method for General Mixture Models , 2005, COLT.
[62] David P. Woodruff,et al. Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[63] Sofya Raskhodnikova,et al. Analyzing Graphs with Node Differential Privacy , 2013, TCC.
[64] M. Newman,et al. Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[65] Martin J. Wainwright,et al. Local privacy and statistical minimax rates , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[66] N. Samatova,et al. Principal Component Analysis for Dimension Reduction in Massive Distributed Data Sets ∗ , 2002 .
[67] Santosh S. Vempala,et al. Matrix approximation and projective clustering via volume sampling , 2006, SODA '06.
[68] Nina Mishra,et al. Privacy via pseudorandom sketches , 2006, PODS.
[69] Leonard J. Schulman,et al. Clustering for Edge-Cost Minimization , 1999, Electron. Colloquium Comput. Complex..
[70] Tamás Sarlós,et al. Improved Approximation Algorithms for Large Matrices via Random Projections , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[71] Nathan Halko,et al. Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..
[72] C. Eckart,et al. The approximation of one matrix by another of lower rank , 1936 .
[73] J. Bourgain. On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .
[74] Kunal Talwar,et al. On differentially private low rank approximation , 2013, SODA.
[75] Zhihua Zhang,et al. Wishart Mechanism for Differentially Private Principal Components Analysis , 2015, AAAI.
[76] Volkan Cevher,et al. Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage , 2017, AISTATS.
[77] Shipra Agrawal,et al. FRAPP: a framework for high-accuracy privacy-preserving mining , 2004, 21st International Conference on Data Engineering (ICDE'05).
[78] Ilya Mironov,et al. Differentially private recommender systems: building privacy into the net , 2009, KDD.
[79] Mark Rudelson,et al. Sampling from large matrices: An approach through geometric functional analysis , 2005, JACM.
[80] Prabhakar Raghavan,et al. Competitive recommendation systems , 2002, STOC '02.
[81] Aaron Roth,et al. Beyond worst-case analysis in private singular vector computation , 2012, STOC '13.
[82] S L Warner,et al. Randomized response: a survey technique for eliminating evasive answer bias. , 1965, Journal of the American Statistical Association.
[83] Santosh S. Vempala,et al. Kernels as features: On kernels, margins, and low-dimensional mappings , 2006, Machine Learning.
[84] Adam D. Smith,et al. (Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings , 2013, NIPS.
[85] Michael W. Mahoney,et al. Approximating a Gram Matrix for Improved Kernel-Based Learning (Extended Abstract) , 2005 .
[86] R. DeVore,et al. A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .
[87] David P. Woodruff,et al. Numerical linear algebra in the streaming model , 2009, STOC '09.
[88] Li Zhang,et al. Analyze gauss: optimal bounds for privacy-preserving principal component analysis , 2014, STOC.
[89] Huy L. Nguyen,et al. OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings , 2012, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[90] Martin J. Wainwright,et al. Privacy Aware Learning , 2012, JACM.
[91] Anand D. Sarwate,et al. Near-optimal Differentially Private Principal Components , 2012, NIPS.
[92] David P. Woodruff,et al. Low rank approximation and regression in input sparsity time , 2012, STOC '13.
[93] Trac D. Tran,et al. A fast and efficient algorithm for low-rank approximation of a matrix , 2009, STOC '09.
[94] Guy N. Rothblum,et al. Boosting and Differential Privacy , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[95] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2016, J. Priv. Confidentiality.
[96] Santosh S. Vempala,et al. The Random Projection Method , 2005, DIMACS Series in Discrete Mathematics and Theoretical Computer Science.
[97] Martin J. Wainwright,et al. Information-theoretic lower bounds on the oracle complexity of convex optimization , 2009, NIPS.
[98] Bernard Chazelle,et al. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform , 2006, STOC '06.
[99] Gianluca Bontempi,et al. Distributed Principal Component Analysis for Wireless Sensor , 2008 .
[100] Darren T. Andrews,et al. Maximum likelihood principal component analysis , 1997 .