Skip to main content
Princeton University Library
Toggle navigation
Home
About
Contact
Search
Browse
Departmental Collections
Browse by:
Author
Issue Date
Search
All
Computer Science
Search
Reset
Add filters:
Use filters to refine the search results.
Title
Author
Date Issued
Equals
Contains
ID
Not Equals
Not Contains
Not ID
71-80 of 1125
previous
1
...
5
6
7
8
9
10
11
...
113
next
Item hits:
Publication Date
Article Title
Author(s)
2012
Finding overlapping communities in social networks: Toward a rigorous approach
Arora, Sanjeev; Ge, R; Sachdeva, S; Schoenebeck, G
2012
Learning topic models - Going beyond SVD
Arora, Sanjeev; Ge, R; Moitra, A
2012
Testing permanent oracles - Revisited
Arora, Sanjeev; Bhattacharyya, A; Manokaran, R; Sachdeva, S
1-Dec-2012
Thurston equivalence to a rational map is decidable
Sylvain, B; Braverman, Mark; Yampolsky, MY
2017
Provable learning of noisy-or networks
Arora, Sanjeev; Ge, R; Ma, T; Risteski, A
2018
On the optimization of deep networks: Implicit acceleration by overparameterization
Arora, Sanjeev; Cohen, N; Hazan, Elad
2017
Generalization and equilibrium in generative adversarial nets (GANs)
Arora, Sanjeev; Ge, R; Liang, Y; Ma, T; Zhang, Y
2018
A la carte embedding: Cheap but effective induction of semantic feature vectors
Khodak, M; Saunshi, N; Liang, Y; Ma, T; Stewart, Brandon, et al
2018
Stronger generalization bounds for deep nets via a compression approach
Arora, Sanjeev; Ge, R; Neyshabur, B; Zhang, Y
2017
Reducing reparameterization gradient variance
Miller, AC; Foti, NJ; D Amour, A; Adams, Ryan P