default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTavor Z. Baharav
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Tavor Z. Baharav, Tze Leung Lai:
Adaptive Data Depth via Multi-Armed Bandits. J. Mach. Learn. Res. 24: 155:1-155:29 (2023)- 2022
- [c7]Tavor Z. Baharav, Gary Cheng, Mert Pilanci, David Tse:
Approximate Function Evaluation via Multi-Armed Bandits. AISTATS 2022: 108-135 - [c6]Yifei Wang, Tavor Z. Baharav, Yanjun Han, Jiantao Jiao, David Tse:
Beyond the Best: Distribution Functional Estimation in Infinite-Armed Bandits. NeurIPS 2022 - [i7]Tavor Z. Baharav, Gary Cheng, Mert Pilanci, David Tse:
Approximate Function Evaluation via Multi-Armed Bandits. CoRR abs/2203.10124 (2022) - [i6]Yifei Wang, Tavor Z. Baharav, Yanjun Han, Jiantao Jiao, David Tse:
Beyond the Best: Estimating Distribution Functionals in Infinite-Armed Bandits. CoRR abs/2211.01743 (2022) - [i5]Tavor Z. Baharav, Tze Leung Lai:
Adaptive Data Depth via Multi-Armed Bandits. CoRR abs/2211.03985 (2022) - 2021
- [j3]Ilai Bistritz
, Tavor Z. Baharav, Amir Leshem, Nicholas Bambos:
One for All and All for One: Distributed Learning of Fair Allocations With Multi-Player Bandits. IEEE J. Sel. Areas Inf. Theory 2(2): 584-598 (2021) - [j2]Vivek Kumar Bagaria, Tavor Z. Baharav, Govinda M. Kamath, David N. C. Tse:
Bandit-Based Monte Carlo Optimization for Nearest Neighbors. IEEE J. Sel. Areas Inf. Theory 2(2): 599-610 (2021) - [c5]Tavor Z. Baharav, Daniel L. Jiang, Kedarnath Kolluri, Sujay Sanghavi, Inderjit S. Dhillon:
Enabling Efficiency-Precision Trade-offs for Label Trees in Extreme Classification. CIKM 2021: 3717-3726 - [i4]Tavor Z. Baharav, Daniel L. Jiang, Kedarnath Kolluri, Sujay Sanghavi, Inderjit S. Dhillon:
Enabling Efficiency-Precision Trade-offs for Label Trees in Extreme Classification. CoRR abs/2106.00730 (2021) - 2020
- [j1]Tavor Z. Baharav, Govinda M. Kamath, David N. C. Tse, Ilan Shomorony:
Spectral Jaccard Similarity: A New Approach to Estimating Pairwise Sequence Alignments. Patterns 1(6): 100081 (2020) - [c4]Ilai Bistritz, Tavor Z. Baharav, Amir Leshem, Nicholas Bambos:
My Fair Bandit: Distributed Learning of Max-Min Fairness with Multi-player Bandits. ICML 2020: 930-940 - [c3]Govinda M. Kamath, Tavor Z. Baharav, Ilan Shomorony:
Adaptive Learning of Rank-One Models for Efficient Pairwise Sequence Alignment. NeurIPS 2020 - [c2]Tavor Z. Baharav, Govinda M. Kamath, David N. C. Tse, Ilan Shomorony:
Spectral Jaccard Similarity: A New Approach to Estimating Pairwise Sequence Alignments. RECOMB 2020: 223-225 - [i3]Ilai Bistritz, Tavor Z. Baharav, Amir Leshem, Nicholas Bambos:
My Fair Bandit: Distributed Learning of Max-Min Fairness with Multi-player Bandits. CoRR abs/2002.09808 (2020) - [i2]Govinda M. Kamath, Tavor Z. Baharav, Ilan Shomorony:
Adaptive Learning of Rank-One Models for Efficient Pairwise Sequence Alignment. CoRR abs/2011.04832 (2020)
2010 – 2019
- 2019
- [c1]Tavor Z. Baharav, David Tse:
Ultra Fast Medoid Identification via Correlated Sequential Halving. NeurIPS 2019: 3650-3659 - [i1]Tavor Z. Baharav, David N. C. Tse:
Ultra Fast Medoid Identification via Correlated Sequential Halving. CoRR abs/1906.04356 (2019)
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-09-13 00:43 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:
