Fixed-dimensional acoustic embeddings of variable-length segments in low-resource settings. - Keith D. Levin; Katharine Henry; Aren Jansen; Karen Livescu (ASRU, 2013)

A summary of the 2012 JHU CLSP workshop on zero resource speech technologies and models of early language acquisition. - Aren Jansen; Emmanuel Dupoux; Sharon Goldwater; Mark Johnson 001; Sanjeev Khudanpur; Kenneth Church 001; Naomi Feldman; Hynek Hermansky; Florian Metze; Richard C. Rose; Mike Seltzer; Pascal Clark; et al. (ICASSP, 2013)

Clustering on Sliding Windows in Polylogarithmic Space. - Vladimir Braverman; Harry Lang; Keith D. Levin; Morteza Monemizadeh (FSTTCS, 2015)

Segmental acoustic indexing for zero resource keyword search. - Keith D. Levin; Aren Jansen; Benjamin Van Durme (ICASSP, 2015)

A Unified Approach for Clustering Problems on Sliding Windows. - Vladimir Braverman; Harry Lang; Keith D. Levin; Morteza Monemizadeh (CoRR, 2015)

Clustering Problems on Sliding Windows. - Vladimir Braverman; Harry Lang; Keith D. Levin; Morteza Monemizadeh (SODA, 2016)

On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching. - Vince Lyzinski; Keith D. Levin; Donniell E. Fishkind; Carey E. Priebe (J. Mach. Learn. Res., 2016)

Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams. - Vladimir Braverman; Harry Lang; Keith D. Levin (CALDAM, 2017)

A Central Limit Theorem for an Omnibus Embedding of Multiple Random Dot Product Graphs. - Keith D. Levin; Avanti Athreya; Minh Tang; Vince Lyzinski; Carey E. Priebe (ICDM Workshops, 2017)

Query-by-Example Search with Discriminative Neural Acoustic Word Embeddings. - Shane Settle; Keith D. Levin; Herman Kamper; Karen Livescu (INTERSPEECH, 2017)

Statistical Inference on Random Dot Product Graphs: a Survey. - Avanti Athreya; Donniell E. Fishkind; Minh Tang; Carey E. Priebe; Youngser Park; Joshua T. Vogelstein; Keith D. Levin; Vince Lyzinski; Yichen Qin; Daniel L. Sussman (J. Mach. Learn. Res., 2017)

Laplacian Eigenmaps From Sparse, Noisy Similarity Measurements. - Keith D. Levin; Vince Lyzinski (IEEE Trans. Signal Process., 2017)

Out-of-sample extension of graph adjacency spectral embedding. - Keith D. Levin; Farbod Roosta-Khorasani; Michael W. Mahoney; Carey E. Priebe (ICML, 2018)

Recovering low-rank structure from multiple networks with unknown edge distributions. - Keith D. Levin; Asad Lodhia; Elizaveta Levina (CoRR, 2019)

On Consistent Vertex Nomination Schemes. - Vince Lyzinski; Keith D. Levin; Carey E. Priebe (J. Mach. Learn. Res., 2019)

On the role of features in vertex nomination: Content and context together are better (sometimes). - Keith D. Levin; Carey E. Priebe; Vince Lyzinski (CoRR, 2020)

Vertex nomination: The canonical sampling and the extended spectral nomination schemes. - Jordan Yoder; Li Chen; Henry Pao; Eric Bridgeford; Keith D. Levin; Donniell E. Fishkind; Carey E. Priebe; Vince Lyzinski (Comput. Stat. Data Anal., 2020)

Comment: Ridge Regression and Regularization of Large Matrices. - Can M. Le; Keith D. Levin; Peter J. Bickel; Elizaveta Levina (Technometrics, 2020)

Metric k-median clustering in insertion-only streams. - Vladimir Braverman; Harry Lang; Keith D. Levin; Yevgeniy Rudoy (Discret. Appl. Math., 2021)

Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings. - Keith D. Levin; Fred Roosta; Minh Tang; Michael W. Mahoney; Carey E. Priebe (J. Mach. Learn. Res., 2021)

Recovering shared structure from multiple networks with unknown edge distributions. - Keith D. Levin; Asad Lodhia; Elizaveta Levina (J. Mach. Learn. Res., 2022)

Fast generation of exchangeable sequences of clusters data. - Keith D. Levin; Brenda Betancourt (Stat. Comput., 2024)