Fourier PCA and robust tensor decomposition

DOI10.1145/2591796.2591875zbMath1315.68209arXiv1306.5825OpenAlexW2080207853MaRDI QIDQ5259594

Y. Xiao, Navin Goyal, Santosh Vempala

Publication date: 26 June 2015

Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.5825

zbMATH Keywords

tensor decompositionsample complexityindpendent component analysis

Mathematics Subject Classification ID

Related Items (9)

Smoothed analysis for tensor methods in unsupervised learning ⋮ On the optimization landscape of tensor decompositions ⋮ Overcomplete Order-3 Tensor Decomposition, Blind Deconvolution, and Gaussian Mixture Models ⋮ Complete decomposition of symmetric tensors in linear time and polylogarithmic precision ⋮ Estimation under group actions: recovering orbits from invariants ⋮ Estimating Higher-Order Moments Using Symmetric Tensor Decomposition ⋮ Eigenvectors of Orthogonally Decomposable Functions ⋮ Multi-Reference Alignment in High Dimensions: Sample Complexity and Phase Transition ⋮ The Sample Complexity of Multireference Alignment

Uses Software

• SuLQ

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for privately releasing marginals via convex relaxations
• The Geometry of Differential Privacy: The Small Database and Approximate Cases
• Faster Algorithms for Privately Releasing Marginals
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Privately Releasing Conjunctions and the Statistical Query Barrier
• On the geometry of differential privacy
• Interactive privacy via the median mechanism
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Lower Bounds in Differential Privacy
• Iterative Constructions and Private Data Release
• Characterizing the sample complexity of private learners
• Faster private release of marginals on small databases
• Bounds on the Sample Complexity for Private Learning and Private Data Release
• Differential Privacy and the Fat-Shattering Dimension of Linear Queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Collusion-secure fingerprinting for digital data
• On the complexity of differentially private data release
• Advances in Cryptology – CRYPTO 2004
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Theory of Cryptography

This page was built for publication: Fourier PCA and robust tensor decomposition