Andrej Risteski

According to our database1, Andrej Risteski authored at least 33 papers between 2012 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
The Risks of Invariant Risk Minimization.
CoRR, 2020

Representational aspects of depth and conditioning in normalizing flows.
CoRR, 2020

Efficient sampling from the Bingham distribution.
CoRR, 2020

On Learning Language-Invariant Representations for Universal Machine Translation.
CoRR, 2020

Fast Convergence for Langevin Diffusion with Matrix Manifold Structure.
CoRR, 2020

2019
Benefits of Overparameterization in Single-Layer Latent Variable Generative Models.
CoRR, 2019

Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

The Comparative Power of ReLU Networks and Polynomial Kernels in the Presence of Sparse Latent Structure.
Proceedings of the 7th International Conference on Learning Representations, 2019

Approximability of Discriminators Implies Diversity in GANs.
Proceedings of the 7th International Conference on Learning Representations, 2019

Sum-of-squares meets square loss: Fast rates for agnostic tensor completion.
Proceedings of the Conference on Learning Theory, 2019

2018
Linear Algebraic Structure of Word Senses, with Applications to Polysemy.
Trans. Assoc. Comput. Linguistics, 2018

Simulated Tempering Langevin Monte Carlo II: An Improved Proof using Soft Markov Chain Decomposition.
CoRR, 2018

Representational Power of ReLU Networks and Polynomial Kernels: Beyond Worst-Case Analysis.
CoRR, 2018

Beyond Log-concavity: Provable Guarantees for Sampling Multi-modal Distributions using Simulated Tempering Langevin Monte Carlo.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Do GANs learn the distribution? Some Theory and Empirics.
Proceedings of the 6th International Conference on Learning Representations, 2018

2017
Theoretical limitations of Encoder-Decoder GAN architectures.
CoRR, 2017

Extending and Improving Wordnet via Unsupervised Word Embeddings.
CoRR, 2017

Provable benefits of representation learning.
CoRR, 2017

Provable learning of noisy-OR networks.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

On the Ability of Neural Nets to Express Distributions.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
A Latent Variable Model Approach to PMI-based Word Embeddings.
Trans. Assoc. Comput. Linguistics, 2016

On Routing Disjoint Paths in Bounded Treewidth Graphs.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Algorithms and matching lower bounds for approximately-convex optimization.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Approximate maximum entropy principles via Goemans-Williamson with applications to provable variational methods.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Recovery Guarantee of Non-negative Matrix Factorization via Alternating Updates.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Recovery guarantee of weighted low-rank approximation via alternating minimization.
Proceedings of the 33nd International Conference on Machine Learning, 2016

How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
Random Walks on Context Spaces: Towards an Explanation of the Mysteries of Semantic Word Embeddings.
CoRR, 2015

On some provably correct cases of variational inference for topic models.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Label optimal regret bounds for online local learning.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Skeletal configurations of ribbon trees.
Discret. Appl. Math., 2014

2012
Skeletal Rigidity of Phylogenetic Trees
CoRR, 2012

What makes a Tree a Straight Skeleton?
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012


  Loading...