activity
20112026
most citedSAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives

927 citations · 2.7k across the 88 of their papers we have counts for

collaborators
Showing 2018Show all

9 papers · 1 filter

cs.LG2018★ 1 cited

Quantifying Learning Guarantees for Convex but Inconsistent Surrogates

Kirill Struminsky, Simon Lacoste-Julien, Anton Osokin

We study consistency properties of machine learning methods based on minimizing convex surrogates. We extend the recent framework of Osokin et al. (2017) for the quantitative analy…

cs.LG2018★ 67 cited

A Modern Take on the Bias-Variance Tradeoff in Neural Networks

Brady Neal, Sarthak Mittal, Aristide Baratin +4

The bias-variance tradeoff tells us that as model complexity increases, bias falls and variances increases, leading to a U-shaped test error curve. However, recent empirical result…

cs.LG2018★ 78 cited

Scattering Networks for Hybrid Representation Learning

Edouard Oyallon, Sergey Zagoruyko, Gabriel Huang +4

Scattering networks are a class of designed Convolutional Neural Networks (CNNs) with fixed weights. We argue they can serve as generic representations for modelling images. In par…

cs.LG2018★ 18 cited

Predicting Tactical Solutions to Operational Planning Problems under Imperfect Information

Eric Larsen, Sébastien Lachapelle, Yoshua Bengio +3

This paper offers a methodological contribution at the intersection of machine learning and operations research. Namely, we propose a methodology to quickly predict expected tactic…

cs.LG2018★ 16 cited

Negative Momentum for Improved Game Dynamics

Gauthier Gidel, Reyhane Askari Hemmat, Mohammad Pezeshki +4

Games generalize the single-objective optimization paradigm by introducing different objective functions for different players. Differentiable games often proceed by simultaneous o…

math.OC2018★ 9 cited

Frank-Wolfe Splitting via Augmented Lagrangian Method

Gauthier Gidel, Fabian Pedregosa, Simon Lacoste-Julien

Minimizing a function over an intersection of convex sets is an important task in optimization that is often much more challenging than minimizing it over each individual constrain…