research
∙
02/20/2023
Escaping limit cycles: Global convergence for constrained nonconvex-nonconcave minimax problems
This paper introduces a new extragradient-type algorithm for a class of ...
share
research
∙
02/17/2023
Solving stochastic weak Minty variational inequalities without increasing batch size
This paper introduces a family of stochastic extragradient-type algorith...
research
∙
09/06/2020
Screening Rules and its Complexity for Active Set Identification
Screening rules were recently introduced as a technique for explicitly i...
research
∙
07/13/2020
Random extrapolation for primal-dual coordinate descent
We introduce a randomly extrapolated primal-dual coordinate descent meth...
research
∙
02/18/2020
Improved Optimistic Algorithms for Logistic Bandits
The generalized linear bandit framework has attracted a lot of attention...
research
∙
01/31/2019
Improving Evolutionary Strategies with Generative Neural Networks
Evolutionary Strategies (ES) are a popular family of black-box zeroth-or...
research
∙
01/29/2019
Stochastic Conditional Gradient Method for Composite Convex Minimization
In this paper, we propose the first practical algorithm to minimize stoc...
research
∙
10/12/2018
Safe Grid Search with Optimal Complexity
Popular machine learning estimators involve regularization parameters th...
research
∙
11/09/2017
Smooth Primal-Dual Coordinate Descent Algorithms for Nonsmooth Convex Optimization
We propose a new randomized coordinate descent method for a convex optim...
research
∙
05/27/2017
Generalized Concomitant Multi-Task Lasso for sparse multimodal regression
In high dimension, it is customary to consider Lasso-type estimators to ...
research
∙
11/17/2016
Gap Safe screening rules for sparsity enforcing penalties
In high dimensional regression settings, sparsity enforcing penalties ha...
research
∙
06/08/2016
Efficient Smoothed Concomitant Lasso Estimation for High Dimensional Regression
In high dimensional settings, sparse structures are crucial for efficien...
research
∙
02/19/2016
GAP Safe Screening Rules for Sparse-Group-Lasso
In high dimensional settings, sparse structures are crucial for efficien...
research
∙
06/11/2015
GAP Safe screening rules for sparse multi-task and multi-class models
High dimensional regression benefits from sparsity promoting regularizat...
research
∙
05/13/2015
Mind the duality gap: safer rules for the Lasso
Screening rules allow to early discard irrelevant variables from the opt...
research
∙
12/20/2013
Accelerated, Parallel and Proximal Coordinate Descent
We propose a new stochastic coordinate descent method for minimizing the...
research
∙
10/07/2013
Parallel coordinate descent for the Adaboost problem
We design a randomised parallel version of Adaboost based on previous st...
research
∙
09/23/2013