Hoyt A. Koepke

12 papers A* 2A 1Misc 1Journal 8
YearRankTypeTitle / Venue / Authors
2016 J jnl
Convergence Rates for Greedy Kaczmarz Algorithms, and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph.
CoRR
Julie Nutini, Behrooz Sepehry, Issam H. Laradji, Mark Schmidt, Hoyt A. Koepke, Alim Virani
2016 A conf
Convergence Rates for Greedy Kaczmarz Algorithms, and Randomized Kaczmarz Rules Using the Orthogonality Graph.
UAI
Julie Nutini, Behrooz Sepehry, Issam H. Laradji, Mark Schmidt, Hoyt A. Koepke, Alim Virani
2015 J jnl
A General Hybrid Clustering Technique.
CoRR
Saeid Amiri, Bertrand S. Clarke, Jennifer Clarke, Hoyt A. Koepke
2015 A* conf
Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection.
ICML
Julie Nutini, Mark Schmidt, Issam H. Laradji, Michael P. Friedlander, Hoyt A. Koepke
2015 J jnl
Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection.
CoRR
Julie Nutini, Mark Schmidt, Issam H. Laradji, Michael P. Friedlander, Hoyt A. Koepke
2013 J jnl
A Bayesian criterion for cluster stability.
Stat. Anal. Data Min.
Hoyt A. Koepke, Bertrand S. Clarke
2013 J jnl
Efficient Identification of Equivalences in Dynamic Graphs and Pedigree Structures
CoRR
Hoyt A. Koepke, Elizabeth Thompson
2013 J jnl
Efficient Identification of Equivalences in Dynamic Graphs and Pedigree Structures.
J. Comput. Biol.
Hoyt A. Koepke, Elizabeth Thompson
2012 J jnl
Fast Prediction of New Feature Utility
CoRR
Hoyt A. Koepke, Mikhail Bilenko
2012 A* conf
Fast Prediction of New Feature Utility.
ICML
Hoyt A. Koepke, Mikhail Bilenko
2011 J jnl
On the limits of clustering in high dimensions via cost functions.
Stat. Anal. Data Min.
Hoyt A. Koepke, Bertrand S. Clarke
2008 Misc conf
A Bayesian Approach to Cluster Validation.
ISAIM
Hoyt A. Koepke, Bertrand S. Clarke