54k citations · 58.7k across the 46 of their papers we have counts for
Showing 2018 · stat.MLShow all
2 papers · 2 filters
stat.ML2018★ 3 cited
A Fast, Principled Working Set Algorithm for Exploiting Piecewise Linear Structure in Convex Problems
Tyler B. Johnson, Carlos Guestrin
By reducing optimization to a sequence of smaller subproblems, working set algorithms achieve fast convergence times for many machine learning problems. Despite such performance, w…
stat.ML2018★ 2 cited
Compact Factorization of Matrices Using Generalized Round-Rank
Pouya Pezeshkpour, Carlos Guestrin, Sameer Singh
Matrix factorization is a well-studied task in machine learning for compactly representing large, noisy data. In our approach, instead of using the traditional concept of matrix ra…