43 citations · 83 across the 10 of their papers we have counts for
20 papers
Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization
Gideon Dresdner, Maria-Luiza Vladarean, Gunnar Rätsch +3
We propose a stochastic conditional gradient method (CGM) for minimizing convex finite-sum objectives formed as a sum of smooth and non-smooth terms. Existing CGM variants for this…
Screening Rules and its Complexity for Active Set Identification
Eugene Ndiaye, Olivier Fercoq, Joseph Salmon
Screening rules were recently introduced as a technique for explicitly identifying active structures such as sparsity, in optimization problem arising in machine learning. This has…
Random extrapolation for primal-dual coordinate descent
Ahmet Alacaoglu, Olivier Fercoq, Volkan Cevher
We introduce a randomly extrapolated primal-dual coordinate descent method that adapts to sparsity of the data matrix and the favorable structures of the objective function. Our me…
Improved Optimistic Algorithms for Logistic Bandits
Louis Faury, Marc Abeille, Clément Calauzènes +1
The generalized linear bandit framework has attracted a lot of attention in recent years by extending the well-understood linear setting and allowing to model richer reward structu…
Scalable Semidefinite Programming
Alp Yurtsever, Joel A. Tropp, Olivier Fercoq +2
Semidefinite programming (SDP) is a powerful framework from convex optimization that has striking potential for data science applications. This paper develops a provably correct ra…
Linear convergence of dual coordinate descent on non-polyhedral convex problems
Ion Necoara, Olivier Fercoq
This paper deals with constrained convex problems, where the objective function is smooth strongly convex and the feasible set is given as the intersection of a large number of clo…