Hoyt A. Koepke

According to our database, Hoyt A. Koepke authored at least 9 papers between 2008 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2016

Convergence Rates for Greedy Kaczmarz Algorithms, and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph.

Julie Nutini, Behrooz Sepehry, Issam H. Laradji, Mark Schmidt, Hoyt A. Koepke, Alim Virani

CoRR, 2016

Convergence Rates for Greedy Kaczmarz Algorithms, and Randomized Kaczmarz Rules Using the Orthogonality Graph.

Julie Nutini, Behrooz Sepehry, Issam H. Laradji, Mark Schmidt, Hoyt A. Koepke, Alim Virani

Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, 2016

2015

A General Hybrid Clustering Technique.

Saeid Amiri, Bertrand S. Clarke, Jennifer Clarke, Hoyt A. Koepke

CoRR, 2015

Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection.

Julie Nutini, Mark Schmidt, Issam H. Laradji, Michael P. Friedlander, Hoyt A. Koepke

Proceedings of the 32nd International Conference on Machine Learning, 2015

2013

A Bayesian criterion for cluster stability.

Hoyt A. Koepke, Bertrand S. Clarke

Stat. Anal. Data Min., 2013

Efficient Identification of Equivalences in Dynamic Graphs and Pedigree Structures.

Hoyt A. Koepke, Elizabeth Thompson

J. Comput. Biol., 2013

2012

Fast Prediction of New Feature Utility.

Hoyt A. Koepke, Mikhail Bilenko

Proceedings of the 29th International Conference on Machine Learning, 2012

2011

On the limits of clustering in high dimensions via cost functions.

Hoyt A. Koepke, Bertrand S. Clarke

Stat. Anal. Data Min., 2011

2008

A Bayesian Approach to Cluster Validation.

Hoyt A. Koepke, Bertrand S. Clarke

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008