Follow
Andrej Risteski
Title
Cited by
Cited by
Year
A latent variable model approach to PMI-based word embeddings
S Arora, Y Li, Y Liang, T Ma, A Risteski
Transactions of the Association for Computational Linguistics 4, 385-399, 2016
3432016
Linear algebraic structure of word senses, with applications to polysemy
S Arora, Y Li, Y Liang, T Ma, A Risteski
Transactions of the Association of Computational Linguistics 6, 483-495, 2018
1872018
Do GANs learn the distribution? some theory and empirics
S Arora, A Risteski, Y Zhang
International Conference on Learning Representations, 2018
134*2018
The Risks of Invariant Risk Minimization
E Rosenfeld, P Ravikumar, A Risteski
arXiv preprint arXiv:2010.05761, 2020
1222020
On the ability of neural nets to express distributions
H Lee, R Ge, T Ma, A Risteski, S Arora
Conference on Learning Theory, 1271-1296, 2017
722017
Approximability of Discriminators Implies Diversity in GANs
Y Bai, T Ma, A Risteski
arXiv preprint arXiv:1806.10586, 2018
622018
Random walks on context spaces: Towards an explanation of the mysteries of semantic word embeddings
S Arora, Y Li, Y Liang, T Ma, A Risteski
arXiv preprint arXiv:1502.03520, 385-399, 2015
602015
Automated WordNet Construction Using Word Embeddings
M Khodak, A Risteski, C Fellbaum, S Arora
Proceedings of the 1st Workshop on Sense, Concept and Entity Representations …, 2017
42*2017
Provable learning of noisy-or networks
S Arora, R Ge, T Ma, A Risteski
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
322017
Recovery Guarantee of Non-negative Matrix Factorization via Alternating Updates
Y Li, Y Liang, A Risteski
Advances in Neural Information Processing Systems 29, 4987-4995, 2016
312016
Recovery guarantee of non-negative matrix factorization via alternating updates
Y Li, Y Liang, A Risteski
Advances in Neural Information Processing Systems, 4987-4995, 2016
312016
Recovery guarantee of weighted low-rank approximation via alternating minimization
Y Li, Y Liang, A Risteski
International Conference on Machine Learning, 2358-2367, 2016
292016
Beyond log-concavity: Provable guarantees for sampling multi-modal distributions using simulated tempering langevin monte carlo
H Lee, A Risteski, R Ge
Advances in neural information processing systems 31, 7847-7856, 2018
282018
Algorithms and matching lower bounds for approximately-convex optimization
A Risteski, Y Li
Advances in Neural Information Processing Systems 29, 4745-4753, 2016
222016
Algorithms and matching lower bounds for approximately-convex optimization
A Risteski, Y Li
Advances in Neural Information Processing Systems 29, 4745-4753, 2016
222016
Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective
V Jain, F Koehler, A Risteski
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
192019
On some provably correct cases of variational inference for topic models
P Awasthi, A Risteski
Advances in Neural Information Processing Systems, 2098-2106, 2015
192015
Empirical study of the benefits of overparameterization in learning latent variable models
RD Buhai, Y Halpern, Y Kim, A Risteski, D Sontag
International Conference on Machine Learning, 1211-1219, 2020
14*2020
Representational Power of ReLU Networks and Polynomial Kernels: Beyond Worst-Case Analysis
F Koehler, A Risteski
arXiv preprint arXiv:1805.11405, 2018
142018
Label optimal regret bounds for online local learning
P Awasthi, M Charikar, KA Lai, A Risteski
Conference on Learning Theory, 150-166, 2015
142015
The system can't perform the operation now. Try again later.
Articles 1–20