default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeith D. Levin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j10]Keith D. Levin, Brenda Betancourt:
Fast generation of exchangeable sequences of clusters data. Stat. Comput. 34(2): 72 (2024)- 2022
- [j9]Keith D. Levin, Asad Lodhia, Elizaveta Levina:
Recovering shared structure from multiple networks with unknown edge distributions. J. Mach. Learn. Res. 23: 3:1-3:48 (2022) - 2021
- [j8]Vladimir Braverman, Harry Lang, Keith D. Levin, Yevgeniy Rudoy:
Metric k-median clustering in insertion-only streams. Discret. Appl. Math. 304: 164-180 (2021) - [j7]Keith D. Levin, Fred Roosta, Minh Tang, Michael W. Mahoney, Carey E. Priebe:
Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings. J. Mach. Learn. Res. 22: 194:1-194:59 (2021) - 2020
- [j6]Jordan Yoder, Li Chen, Henry Pao, Eric Bridgeford
, Keith D. Levin, Donniell E. Fishkind, Carey E. Priebe, Vince Lyzinski:
Vertex nomination: The canonical sampling and the extended spectral nomination schemes. Comput. Stat. Data Anal. 145: 106916 (2020) - [j5]Can M. Le, Keith D. Levin, Peter J. Bickel, Elizaveta Levina:
Comment: Ridge Regression and Regularization of Large Matrices. Technometrics 62(4): 443-446 (2020) - 2019
- [j4]Vince Lyzinski, Keith D. Levin, Carey E. Priebe:
On Consistent Vertex Nomination Schemes. J. Mach. Learn. Res. 20: 69:1-69:39 (2019) - 2017
- [j3]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:
Statistical Inference on Random Dot Product Graphs: a Survey. J. Mach. Learn. Res. 18: 226:1-226:92 (2017) - [j2]Keith D. Levin, Vince Lyzinski:
Laplacian Eigenmaps From Sparse, Noisy Similarity Measurements. IEEE Trans. Signal Process. 65(8): 1988-2003 (2017) - 2016
- [j1]Vince Lyzinski, Keith D. Levin, Donniell E. Fishkind, Carey E. Priebe:
On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum Likelihood Estimation and Graph Matching. J. Mach. Learn. Res. 17: 179:1-179:34 (2016)
Conference and Workshop Papers
- 2018
- [c9]Keith D. Levin, Farbod Roosta-Khorasani, Michael W. Mahoney, Carey E. Priebe:
Out-of-sample extension of graph adjacency spectral embedding. ICML 2018: 2981-2990 - 2017
- [c8]Vladimir Braverman, Harry Lang, Keith D. Levin:
Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams. CALDAM 2017: 72-82 - [c7]Keith D. Levin, Avanti Athreya, Minh Tang, Vince Lyzinski, Carey E. Priebe:
A Central Limit Theorem for an Omnibus Embedding of Multiple Random Dot Product Graphs. ICDM Workshops 2017: 964-967 - [c6]Shane Settle, Keith D. Levin, Herman Kamper, Karen Livescu:
Query-by-Example Search with Discriminative Neural Acoustic Word Embeddings. INTERSPEECH 2017: 2874-2878 - 2016
- [c5]Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh:
Clustering Problems on Sliding Windows. SODA 2016: 1374-1390 - 2015
- [c4]Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh:
Clustering on Sliding Windows in Polylogarithmic Space. FSTTCS 2015: 350-364 - [c3]Keith D. Levin, Aren Jansen, Benjamin Van Durme:
Segmental acoustic indexing for zero resource keyword search. ICASSP 2015: 5828-5832 - 2013
- [c2]Keith D. Levin, Katharine Henry, Aren Jansen, Karen Livescu:
Fixed-dimensional acoustic embeddings of variable-length segments in low-resource settings. ASRU 2013: 410-415 - [c1]Aren Jansen, Emmanuel Dupoux, Sharon Goldwater, Mark Johnson, Sanjeev Khudanpur, Kenneth Church, Naomi Feldman, Hynek Hermansky, Florian Metze, Richard C. Rose, Mike Seltzer, Pascal Clark, Ian McGraw, Balakrishnan Varadarajan, Erin Bennett, Benjamin Börschinger, Justin T. Chiu, Ewan Dunbar, Abdellah Fourtassi, David Harwath, Chia-ying Lee, Keith D. Levin, Atta Norouzian, Vijayaditya Peddinti, Rachael Richardson, Thomas Schatz, Samuel Thomas:
A summary of the 2012 JHU CLSP workshop on zero resource speech technologies and models of early language acquisition. ICASSP 2013: 8111-8115
Informal and Other Publications
- 2020
- [i5]Keith D. Levin, Carey E. Priebe, Vince Lyzinski:
On the role of features in vertex nomination: Content and context together are better (sometimes). CoRR abs/2005.02151 (2020) - 2019
- [i4]Keith D. Levin, Asad Lodhia, Elizaveta Levina:
Recovering low-rank structure from multiple networks with unknown edge distributions. CoRR abs/1906.07265 (2019) - [i3]Keith D. Levin, Fred Roosta, Minh Tang, Michael W. Mahoney, Carey E. Priebe:
Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings. CoRR abs/1910.00423 (2019) - 2017
- [i2]Shane Settle, Keith D. Levin, Herman Kamper, Karen Livescu:
Query-by-Example Search with Discriminative Neural Acoustic Word Embeddings. CoRR abs/1706.03818 (2017) - 2015
- [i1]Vladimir Braverman, Harry Lang, Keith D. Levin, Morteza Monemizadeh:
A Unified Approach for Clustering Problems on Sliding Windows. CoRR abs/1504.05553 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
