122 citations · 122 across the 2 of their papers we have counts for
2 papers
cs.LG2021
Predicting the utility of search spaces for black-box optimization: a simple, budget-aware approach
Setareh Ariafar, Justin Gilmer, Zachary Nado +3
Black box optimization requires specifying a search space to explore for solutions, e.g. a d-dimensional compact space, and this choice is critical for getting the best results at…
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…