122 citations · 227 across the 3 of their papers we have counts for
3 papers
stat.ML2012★ 39 cited
Convex Relaxation for Combinatorial Penalties
Guillaume Obozinski, Francis Bach
In this paper, we propose an unifying view of several recently proposed structured sparsity-inducing norms. We consider the situation of a model simultaneously (a) penalized by a s…
cs.LG2012★ 66 cited
On the Equivalence between Herding and Conditional Gradient Algorithms
Francis Bach, Simon Lacoste-Julien, Guillaume Obozinski
We show that the herding procedure of Welling (2009) takes exactly the form of a standard convex optimization algorithm--namely a conditional gradient algorithm minimizing a quadra…
cs.LG2010★ 122 cited
Network Flow Algorithms for Structured Sparsity
Julien Mairal, Rodolphe Jenatton, Guillaume Obozinski +1
We consider a class of learning problems that involve a structured sparsity-inducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effor…