• arXiv 2018 (Fast and Faster Convergence of SGD for Over-Parameterized Models (and an Accelerated Perceptron))
• OPTL 2018 ("Active-set complexity" of proximal-gradient: How long does it take to find the sparsity pattern?)
• arXiv 2017 (Let's Make Block Coordinate Descent Go Fast: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence)
• ECML 2016 (Linear Convergence of Gradient and Proximal-Gradient Methods under the Polyak-Lojasiewicz Condition)
• NIPS 2015 (Stop Wasting My Gradients: Practical SVRG)
• ICML 2015 (Coordinate descent converges faster with the Gauss-Southwell rule than random selection)
• AI/Stats 2015 (Non-Uniform Stochastic Average Gradient for Training Conditional Random Fields)
• arXiv 2013 (MAPR 2017) (Minimizing Finite Sums with the Stochastic Average Gradient)
• ICML 2013 (Block-coordinate Frank-Wolfe Optimization for Structural SVMs)
• NIPS 2012 (A Stochastic Gradient Method with an Exponential Convergence Rate for Finite Training Sets)

• Counting objects in images
• Outdoor image segmentation and depth estimation
• Artistic style transfer for images and videos
• Image restoration and inpainting
• Assessing malignance in mammography images
• Computed tomography muscle segmentation
• Heart motion abnormality detection
• Automatic brain tumor segmentation

• Modeling kinematics of DNA strands
• Propagating ideas in social networks
• Product recommendation in social networks
• Natural language sequence labeling
• Acoustic waveform inversion for seismic imaging
• Predicting the effects of new combinations of interventions
• Modeling perturbations in intracellular flow cytometry
• Finding groups of correlated mutual funds
• Network models of gene expression data
• Biomedical named-entity recognition

Presentations

• ISMP 2018 (Convergence Rate of Expectation Maximization)
• DIMACS Opt and ML 2018 ("Active-set complexity" of proximal-gradient: How long does it take to find the sparsity pattern?)
• Simons Institute 2017 (Let's Make Block Coordinate Descent Go Fast!)
• NIPS OptOpt 2016 (Do we need "Harmless" Bayesian Optimization and "First-Order" Bayesian Optimization)
• ECML 2016 (Linear Convergence under the Polyak-Lojasiewicz Inequality)
• ISMP 2015 (Advances in the Minimization of Finite Sums)
• Opt and Big Data 2015 (Is Greedy Coordinate Descent a Terrible Algorithm?)
• NIPS OPT 2014 (Non-Uniform Stochastic Average Gradient for Training Conditional Random Fields)
• Google 2014 (Minimizing Finite Sums with the SAG Algorithm)
• ICML 2013 (Block-Coordinate Frank-Wolfe Optimization for Structural SVMs)

• SIOPT 2017 (Converging on the Ultimate Algorithm for Minimizing Convex Sums)
• Northwestern 2016 (The Why and How of Releasing Applied Math Code)
• TAAI 2014 (Tractable Big Data and Big Models in Machine Learning)
• Kyoto 2014 (Opening up the black box)
• Paris-6 2013 (Linearly-Convergent Stochastic-Gradient Methods)
• Edinburgh 2012 (Inexact Proximal-Gradient Methods and Linearly-Convergent Stochastic-Gradient Methods)
• INRA 2011 (Structure Learning in Undirected Graphical Models)
• NIPS OPT 2010 (Limited-Memory Quasi-Newton and Hessian-Free Newton Methods)
• Thesis Talk 2010 (Graphical Model Structure Learning with L1-Regularization)

• NIPS WiML and OPT 2017 (Linear Convergence and Support Vector Identification of Sequential Minimal Optimization)
• NIPS WiML 2017 (Let's Make Block Coordinate Descent Go Fast!)
• NIPS OPT 2017 (Convergence Rate of Expectation Maximization)
• NIPS OPT 2017 ("Active-set complexity" of proximal-gradient: How long does it take to find the sparsity pattern?)
• NIPS BayesOpt 2016 (Do we need "Harmless" Bayesian Optimization and "First-Order" Bayesian Optimization?)
• ECML 2016 (Linear Convergence of Gradient and Proximal-Gradient Methods under the Polyak-Lojasiewicz Condition)
• UAI 2016 (Faster Stochastic Variational Inference using Proximal-Gradient Methods with General Divergence Functions)
• UAI 2016 (Convergence Rates for Greedy Kaczmarz Algorithms and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph)
• NIPS 2015 (Stop Wasting My Gradients: Practical SVRG)
• ICML 2015 (Coordinate descent converges faster with the Gauss-Southwell rule than random selection)

• Simons Institute 2017 (Let's Make Block Coordinate Descent Go Fast)
• ICML 2015 (Coordinate Descent Converges Faster with the Gauss-Southwell Rule than Random Selection)
• NIPS OPT 2014 (Non-Uniform Stochastic Average Gradient for Training Conditional Random Fields)
• BIRS 2014 (Minimizing Finite Sums with the Stochastic Average Gradient)
• Boulder 2014 (Fast Non-Smooth and Big-Data Optimization)
• ICML 2013 (Block-Coordinate Frank-Wolfe Optimization)
• NIPS 2012 (A Stochastic Gradient Method with an Exponential Convergence Rate)
• NIPS 2011 (Convergence Rates of Inexact Proximal-Gradient Methods)
• NIPS OPT 2010 (Limited-Memory Quasi-Newton and Hessian-Free Newton Methods)
• AI/Stats 2010 (Convex Structure Learning in Log-Linear Models: Beyond Pairwise Potentials)

Code

• matLearn (2016, machine learning in Matlab)
• SAG4CRF (2015, stochastic average gradient for conditional random fields)
• SAG (2013, L2-regularized logistic regression)
• thesis (2012, code from my thesis)
  • examples with simple regularizers
• batching (2011) (growing-batch optimization)
• UGM (updated 2011) (undirected graphical models)
• L1General (updated 2010, L1-regularized optimization)
  • examples
• minConf (2009, optimization with simple constraints)
  • examples with bound constraints
  • examples with simple constraints
• lasso (updated 2008, L1-regularized least squares)
• minFunc (updated 2012, differentiable optimization)
  • examples

Teaching and Research Groups