Folgen
Simon Lacoste-Julien
Simon Lacoste-Julien
Associate Professor - Canada CIFAR AI Chair, University of Montreal / Mila
Bestätigte E-Mail-Adresse bei iro.umontreal.ca - Startseite
Titel
Zitiert von
Zitiert von
Jahr
SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives
A Defazio, F Bach, S Lacoste-Julien
NIPS 2014 - Advances in Neural Information Processing Systems 27, 1646-1654, 2014
15822014
A Closer Look at Memorization in Deep Networks
D Arpit, S Jastrzębski, N Ballas, D Krueger, E Bengio, MS Kanwal, ...
ICML 2017 - Proceedings of the 34th International Conference on Machine Learning, 2017
9822017
DiscLDA: Discriminative learning for dimensionality reduction and classification
S Lacoste-Julien, F Sha, MI Jordan
NIPS 2008 - Advances in Neural Information Processing Systems 21, 2008
5092008
Block-Coordinate Frank-Wolfe Optimization for Structural SVMs
S Lacoste-Julien, M Jaggi, M Schmidt, P Pletscher
ICML 2013 - Proceedings of the 30th International Conference on Machine …, 2013
3912013
On the Global Linear Convergence of Frank-Wolfe Optimization Variants
S Lacoste-Julien, M Jaggi
NIPS 2015 - Advances in Neural Information Processing Systems 28, 2015
3582015
A Variational Inequality Perspective on Generative Adversarial Nets
G Gidel, H Berard, G Vignoud, P Vincent, S Lacoste-Julien
ICLR 2019 - Seventh International Conference on Learning Representations, 2019
267*2019
A discriminative matching approach to word alignment
B Taskar, S Lacoste-Julien, D Klein
EMNLP 2005 - Proceedings of the conference on Human Language Technology and …, 2005
2532005
Unsupervised Learning from Narrated Instruction Videos
JB Alayrac, P Bojanowski, N Agrawal, J Sivic, I Laptev, S Lacoste-Julien
CVPR 2016 - Proceedings of the IEEE Conference on Computer Vision and …, 2016
2502016
A Simpler Approach to Obtaining an O(1/t) Convergence Rate for the Projected Stochastic Subgradient Method
S Lacoste-Julien, M Schmidt, F Bach
arXiv preprint arXiv:1212.2002, 2012
2072012
SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases
S Lacoste-Julien, K Palla, A Davies, G Kasneci, T Graepel, Z Ghahramani
KDD 2013 - Proceedings of the 19th ACM SIGKDD international conference on …, 2013
1652013
On Pairwise Costs for Network Flow Multi-Object Tracking
V Chari, S Lacoste-Julien, I Laptev, J Sivic
CVPR 2015 - Proceedings of the IEEE Conference on Computer Vision and …, 2015
1602015
Convergence Rate of Frank-Wolfe for Non-Convex Objectives
S Lacoste-Julien
arXiv preprint arXiv:1607.00345, 2016
1532016
On the Equivalence between Herding and Conditional Gradient Algorithms
F Bach, S Lacoste-Julien, G Obozinski
ICML 2012 - Proceedings of the 29th International Conference on Machine Learning, 2012
1472012
Structured prediction, dual extragradient and Bregman projections
B Taskar, S Lacoste-Julien, MI Jordan
JMLR - Journal of Machine Learning Research 7, 1627-1653, 2006
1402006
Negative Momentum for Improved Game Dynamics
G Gidel, R Askari, M Pezeshki, R Le Priol, G Huang, S Lacoste-Julien, ...
AISTATS 2019 - Proceedings of the 22nd International Conference on …, 2019
1362019
PAC-Bayesian Theory Meets Bayesian Inference
P Germain, F Bach, A Lacoste, S Lacoste-Julien
NIPS 2016 - Advances in Neural Information Processing Systems 29, 2016
1302016
Variance Reduced Stochastic Gradient Descent with Neighbors
T Hofmann, A Lucchi, S Lacoste-Julien, B McWilliams
NIPS 2015 - Advances in Neural Information Processing Systems 28, 2015
1252015
Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Rates
S Vaswani, A Mishkin, I Laradji, M Schmidt, G Gidel, S Lacoste-Julien
NeurIPS 2019 - Advances in Neural Information Processing Systems 32, 2019
1202019
Asaga: Asynchronous Parallel Saga
R Leblond, F Pedregosa, S Lacoste-Julien
AISTATS 2017 -- Proceedings of the 20th International Conference on …, 2017
1202017
A Modern Take on the Bias-Variance Tradeoff in Neural Networks
B Neal, S Mittal, A Baratin, V Tantia, M Scicluna, S Lacoste-Julien, ...
arXiv preprint arXiv:1810.08591, 2018
1122018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20