Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox

Picture for Keith Levin

On the role of features in vertex nomination: Content and context together are better (sometimes)

May 06, 2020
Keith Levin, Carey E. Priebe, Vince Lyzinski

  Access Paper or Ask Questions

Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings

Sep 29, 2019
Keith Levin, Fred Roosta, Minh Tang, Michael W. Mahoney, Carey E. Priebe

* Portions of this work originally appeared in ICML2018 as "Out-of-sample extension of graph adjacency spectral embedding" (accompanying technical report available at arXiv:1802.06307). This work extends the results of that earlier paper to a second graph embedding technique called the Laplacian spectral embedding and presents additional experiments 

  Access Paper or Ask Questions

Recovering low-rank structure from multiple networks with unknown edge distributions

Jun 13, 2019
Keith Levin, Asad Lodhia, Elizaveta Levina

  Access Paper or Ask Questions

On consistent vertex nomination schemes

May 29, 2018
Vince Lyzinski, Keith Levin, Carey E. Priebe

* 29 pages, 4 figures 

  Access Paper or Ask Questions

Out-of-sample extension of graph adjacency spectral embedding

Feb 17, 2018
Keith Levin, Farbod Roosta-Khorasani, Michael W. Mahoney, Carey E. Priebe

  Access Paper or Ask Questions

Vertex nomination: The canonical sampling and the extended spectral nomination schemes

Feb 14, 2018
Jordan Yoder, Li Chen, Henry Pao, Eric Bridgeford, Keith Levin, Donniell Fishkind, Carey Priebe, Vince Lyzinski

  Access Paper or Ask Questions

Statistical inference on random dot product graphs: a survey

Sep 16, 2017
Avanti Athreya, Donniell E. Fishkind, Keith Levin, Vince Lyzinski, Youngser Park, Yichen Qin, Daniel L. Sussman, Minh Tang, Joshua T. Vogelstein, Carey E. Priebe

* Journal of Machine Learning Research, 2018 
* An expository survey paper on a comprehensive paradigm for inference for random dot product graphs, centered on graph adjacency and Laplacian spectral embeddings. Paper outlines requisite background; summarizes theory, methodology, and applications from previous and ongoing work; and closes with a discussion of several open problems 

  Access Paper or Ask Questions

Query-by-Example Search with Discriminative Neural Acoustic Word Embeddings

Jun 12, 2017
Shane Settle, Keith Levin, Herman Kamper, Karen Livescu

* To appear Interspeech 2017 

  Access Paper or Ask Questions

On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching

Aug 27, 2016
Vince Lyzinski, Keith Levin, Donniell E. Fishkind, Carey E. Priebe

  Access Paper or Ask Questions

Laplacian Eigenmaps from Sparse, Noisy Similarity Measurements

Aug 16, 2016
Keith Levin, Vince Lyzinski

  Access Paper or Ask Questions