default search action
Martin J. Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c10]Mo Tiwari, Ryan Kang, Jaeyong Lee, Donghyun Lee, Christopher Piech, Sebastian Thrun, Ilan Shomorony, Martin Jinye Zhang:
Faster Maximum Inner Product Search in High Dimensions. ICML 2024 - 2023
- [c9]Mo Tiwari, Ryan Kang, Donghyun Lee, Sebastian Thrun, Ilan Shomorony, Martin J. Zhang:
BanditPAM++: Faster k-medoids Clustering. NeurIPS 2023 - [i8]Mo Tiwari, Ryan Kang, Donghyun Lee, Sebastian Thrun, Chris Piech, Ilan Shomorony, Martin Jinye Zhang:
BanditPAM++: Faster k-medoids Clustering. CoRR abs/2310.18844 (2023) - 2022
- [c8]Tony Ginart, Martin Jinye Zhang, James Zou:
MLDemon: Deployment Monitoring for Machine Learning Systems. AISTATS 2022: 3962-3997 - [c7]Mo Tiwari, Ryan Kang, Jaeyong Lee, Chris Piech, Ilan Shomorony, Sebastian Thrun, Martin J. Zhang:
MABSplit: Faster Forest Training Using Multi-Armed Bandits. NeurIPS 2022 - [i7]Mo Tiwari, Ryan Kang, Je-Yong Lee, Sebastian Thrun, Chris Piech, Ilan Shomorony, Martin Jinye Zhang:
MABSplit: Faster Forest Training Using Multi-Armed Bandits. CoRR abs/2212.07473 (2022) - [i6]Mo Tiwari, Ryan Kang, Je-Yong Lee, Luke Lee, Chris Piech, Sebastian Thrun, Ilan Shomorony, Martin Jinye Zhang:
Faster Maximum Inner Product Search in High Dimensions. CoRR abs/2212.07551 (2022) - 2021
- [i5]Antonio Ginart, Martin Jinye Zhang, James Zou:
MLDemon: Deployment Monitoring for Machine Learning Systems. CoRR abs/2104.13621 (2021) - 2020
- [c6]Mo Tiwari, Martin Jinye Zhang, James Mayclin, Sebastian Thrun, Chris Piech, Ilan Shomorony:
BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits. NeurIPS 2020 - [i4]Mo Tiwari, Martin Jinye Zhang, James Mayclin, Sebastian Thrun, Chris Piech, Ilan Shomorony:
Bandit-PAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits. CoRR abs/2006.06856 (2020)
2010 – 2019
- 2019
- [c5]Martin J. Zhang, James Zou, David Tse:
Adaptive Monte Carlo Multiple Testing via Multi-Armed Bandits. ICML 2019: 7512-7522 - [c4]Martin J. Zhang, Fei Xia, James Zou:
AdaFDR: A Fast, Powerful and Covariate-Adaptive Approach to Multiple Hypothesis Testing. RECOMB 2019: 330-333 - [i3]Martin J. Zhang, James Zou, David Tse:
Adaptive Monte Carlo Multiple Testing via Multi-Armed Bandits. CoRR abs/1902.00197 (2019) - 2018
- [c3]Vivek Kumar Bagaria, Govinda M. Kamath, Vasilis Ntranos, Martin J. Zhang, David Tse:
Medoids in Almost-Linear Time via Multi-Armed Bandits. AISTATS 2018: 500-509 - 2017
- [c2]Fei Xia, Martin J. Zhang, James Y. Zou, David Tse:
NeuralFDR: Learning Discovery Thresholds from Hypothesis Features. NIPS 2017: 1541-1550 - [i2]Abubakar Abid, Vivek Kumar Bagaria, Martin J. Zhang, James Y. Zou:
Contrastive Principal Component Analysis. CoRR abs/1709.06716 (2017) - [i1]Vivek Kumar Bagaria, Govinda M. Kamath, Vasilis Ntranos, Martin J. Zhang, David Tse:
Medoids in almost linear time via multi-armed bandits. CoRR abs/1711.00817 (2017) - 2016
- [c1]Martin J. Zhang, Zhijian Ou:
Block-wise map inference for determinantal point processes with application to change-point detection. SSP 2016: 1-5
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-11-18 20:49 CET 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: