88 citations · 101 across the 5 of their papers we have counts for
6 papers
Convergence Rates for Greedy Kaczmarz Algorithms, and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph
Julie Nutini, Behrooz Sepehry, Issam Laradji +3
The Kaczmarz method is an iterative algorithm for solving systems of linear equalities and inequalities, that iteratively projects onto these constraints. Recently, Strohmer and Ve…
Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection
Julie Nutini, Mark Schmidt, Issam H. Laradji +2
There has been significant recent work on the theory and application of randomized coordinate descent algorithms, beginning with the work of Nesterov [SIAM J. Optim., 22(2), 2012],…
A General Hybrid Clustering Technique
Saeid Amiri, Bertrand Clarke, Jennifer Clarke +1
Here, we propose a clustering technique for general clustering problems including those that have non-convex clusters. For a given desired number of clusters , we use three stag…
An Algorithmic Theory of Dependent Regularizers, Part 1: Submodular Structure
Hoyt Koepke, Marina Meila
We present an exploration of the rich theoretical connections between several classes of regularized models, network flows, and recent results in submodular function theory. This w…
Efficient Identification of Equivalences in Dynamic Graphs and Pedigree Structures
Hoyt Koepke, Elizabeth Thompson
We propose a new framework for designing test and query functions for complex structures that vary across a given parameter such as genetic marker position. The operations we are i…
Fast Prediction of New Feature Utility
Hoyt Koepke, Mikhail Bilenko
We study the new feature utility prediction problem: statistically testing whether adding a new feature to the data representation can improve predictive accuracy on a supervised l…