Publications (35)
Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networks
Sanjeev Arora, Simon S. Du, Wei Hu +2
Towards a better approximation for sparsest cut?
Sanjeev Arora, Rong Ge, Ali Kemal Sinop
Theoretical limitations of Encoder-Decoder GAN architectures
Sanjeev Arora, Andrej Risteski, Yi Zhang
A Reformulation of the Arora-Rao-Vazirani Structure Theorem
Sanjeev Arora, James Lee, Sushant Sachdeva
On the Optimization of Deep Networks: Implicit Acceleration by Overparameterization
Sanjeev Arora, Nadav Cohen, Elad Hazan
Euclidean distortion and the Sparsest Cut
Sanjeev Arora, James R. Lee, Assaf Naor
Do GANs actually learn the distribution? An empirical study
Sanjeev Arora, Yi Zhang
A Practical Algorithm for Topic Modeling with Provable Guarantees
Sanjeev Arora, Rong Ge, Yoni Halpern +5
Provable benefits of representation learning
Sanjeev Arora, Andrej Risteski
Testing Permanent Oracles -- Revisited
Sanjeev Arora, Arnab Bhattacharyya, Rajsekar Manokaran +1
Linear Algebraic Structure of Word Senses, with Applications to Polysemy
Sanjeev Arora, Yuanzhi Li, Yingyu Liang +2
Provable Bounds for Learning Some Deep Representations
Sanjeev Arora, Aditya Bhaskara, Rong Ge +1
Computing a Nonnegative Matrix Factorization -- Provably
Sanjeev Arora, Rong Ge, Ravi Kannan +1
Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders
Sanjeev Arora, Rong Ge, Ankur Moitra +1
Learning Topic Models - Going beyond SVD
Sanjeev Arora, Rong Ge, Ankur Moitra
Learning mixtures of separated nonspherical Gaussians
Sanjeev Arora, Ravi Kannan
Theoretical Analysis of Auto Rate-Tuning by Batch Normalization
Sanjeev Arora, Zhiyuan Li, Kaifeng Lyu
Generalization and Equilibrium in Generative Adversarial Nets (GANs)
Sanjeev Arora, Rong Ge, Yingyu Liang +2
Simple, Efficient, and Neural Algorithms for Sparse Coding
Sanjeev Arora, Rong Ge, Tengyu Ma +1
A Theoretical Analysis of Contrastive Unsupervised Representation Learning
Sanjeev Arora, Hrishikesh Khandeparkar, Mikhail Khodak +2
Finding Overlapping Communities in Social Networks: Toward a Rigorous Approach
Sanjeev Arora, Rong Ge, Sushant Sachdeva +1
A La Carte Embedding: Cheap but Effective Induction of Semantic Feature Vectors
Mikhail Khodak, Nikunj Saunshi, Yingyu Liang +3
Why are deep nets reversible: A simple theory, with implications for training
Sanjeev Arora, Yingyu Liang, Tengyu Ma
Provable Algorithms for Inference in Topic Models
Sanjeev Arora, Rong Ge, Frederic Koehler +2
Mapping Between fMRI Responses to Movies and their Natural Language Annotations
Kiran Vodrahalli, Po-Hsuan Chen, Yingyu Liang +8
A Latent Variable Model Approach to PMI-based Word Embeddings
Sanjeev Arora, Yuanzhi Li, Yingyu Liang +2
An Analysis of the t-SNE Algorithm for Data Visualization
Sanjeev Arora, Wei Hu, Pravesh K. Kothari
Extending and Improving Wordnet via Unsupervised Word Embeddings
Mikhail Khodak, Andrej Risteski, Christiane Fellbaum +1
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
Prahladh Harsha, Moses Charikar, Matthew Andrews +14
Stronger generalization bounds for deep nets via a compression approach
Sanjeev Arora, Rong Ge, Behnam Neyshabur +1
A Simple Saliency Method That Passes the Sanity Checks
Arushi Gupta, Sanjeev Arora
How NP got a new definition: a survey of probabilistically checkable proofs
Sanjeev Arora
More Algorithms for Provable Dictionary Learning
Sanjeev Arora, Aditya Bhaskara, Rong Ge +1
Provable learning of Noisy-or Networks
Sanjeev Arora, Rong Ge, Tengyu Ma +1
New Algorithms for Learning Incoherent and Overcomplete Dictionaries
Sanjeev Arora, Rong Ge, Ankur Moitra