default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSubhojyoti Mukherjee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Subhojyoti Mukherjee, Qiaomin Xie, Josiah P. Hanna, Robert D. Nowak:
SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Bandits. AISTATS 2024: 2962-2970- [c9]Subhojyoti Mukherjee, Josiah P. Hanna, Robert D. Nowak:
SaVeR: Optimal Data Collection Strategy for Safe Policy Evaluation in Tabular MDP. ICML 2024 - [i15]Subhojyoti Mukherjee, Ge Liu, Aniket Deshmukh, Anusha Lalitha, Yifei Ma, Branislav Kveton:
Experimental Design for Active Transductive Inference in Large Language Models. CoRR abs/2404.08846 (2024) - [i14]Subhojyoti Mukherjee, Anusha Lalitha, Kousha Kalantari, Aniket Deshmukh, Ge Liu, Yifei Ma, Branislav Kveton:
Optimal Design for Human Feedback. CoRR abs/2404.13895 (2024) - [i13]Subhojyoti Mukherjee, Josiah P. Hanna, Robert D. Nowak:
SaVeR: Optimal Data Collection Strategy for Safe Policy Evaluation in Tabular MDP. CoRR abs/2406.02165 (2024) - [i12]Subhojyoti Mukherjee, Josiah P. Hanna, Qiaomin Xie, Robert D. Nowak:
Pretraining Decision Transformers with Reward Prediction for In-Context Multi-task Structured Bandit Learning. CoRR abs/2406.05064 (2024) - [i11]Aniruddha Bhargava, Lalit Jain, Branislav Kveton, Ge Liu, Subhojyoti Mukherjee:
Off-Policy Evaluation from Logged Human Feedback. CoRR abs/2406.10030 (2024) - 2023
- [c8]Subhojyoti Mukherjee, Qiaomin Xie, Josiah Hanna, Robert D. Nowak:
Multi-task Representation Learning for Pure Exploration in Bilinear Bandits. NeurIPS 2023 - [i10]Subhojyoti Mukherjee, Qiaomin Xie, Josiah Hanna, Robert D. Nowak:
SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Bandits. CoRR abs/2301.12357 (2023) - [i9]Subhojyoti Mukherjee, Ruihao Zhu, Branislav Kveton:
Efficient and Interpretable Bandit Algorithms. CoRR abs/2310.14751 (2023) - [i8]Subhojyoti Mukherjee, Qiaomin Xie, Josiah P. Hanna, Robert D. Nowak:
Multi-task Representation Learning for Pure Exploration in Bilinear Bandits. CoRR abs/2311.00327 (2023) - 2022
- [c7]Subhojyoti Mukherjee
, Ardhendu S. Tripathy, Robert D. Nowak:
Chernoff Sampling for Active Testing and Extension to Active Regression. AISTATS 2022: 7384-7432 - [c6]Blake Mason, Lalit Jain, Subhojyoti Mukherjee, Romain Camilleri, Kevin G. Jamieson, Robert D. Nowak:
Nearly Optimal Algorithms for Level Set Estimation. AISTATS 2022: 7625-7658 - [c5]Subhojyoti Mukherjee:
Safety aware changepoint detection for piecewise i.i.d. bandits. UAI 2022: 1402-1412 - [c4]Subhojyoti Mukherjee, Josiah P. Hanna, Robert D. Nowak:
ReVar: Strengthening policy evaluation via reduced variance sampling. UAI 2022: 1413-1422 - [i7]Subhojyoti Mukherjee, Josiah P. Hanna, Robert D. Nowak:
ReVar: Strengthening Policy Evaluation via Reduced Variance Sampling. CoRR abs/2203.04510 (2022) - [i6]Subhojyoti Mukherjee:
Safety Aware Changepoint Detection for Piecewise i.i.d. Bandits. CoRR abs/2205.13689 (2022) - 2021
- [c3]Samarth Gupta, Shreyas Chaudhari, Subhojyoti Mukherjee, Gauri Joshi, Osman Yagan:
A Unified Approach to Translate Classical Bandit Algorithms to Structured Bandits. ICASSP 2021: 3360-3364 - [i5]Blake Mason, Romain Camilleri, Subhojyoti Mukherjee, Kevin Jamieson, Robert D. Nowak, Lalit Jain:
Nearly Optimal Algorithms for Level Set Estimation. CoRR abs/2111.01768 (2021) - 2020
- [j1]Samarth Gupta, Shreyas Chaudhari, Subhojyoti Mukherjee, Gauri Joshi, Osman Yagan:
A Unified Approach to Translate Classical Bandit Algorithms to the Structured Bandit Setting. IEEE J. Sel. Areas Inf. Theory 1(3): 840-853 (2020) - [i4]Subhojyoti Mukherjee, Ardhendu Tripathy, Robert D. Nowak:
Generalized Chernoff Sampling for Active Learning and Structured Bandit Algorithms. CoRR abs/2012.08073 (2020)
2010 – 2019
- 2019
- [i3]Subhojyoti Mukherjee, Odalric-Ambrym Maillard:
Distribution-dependent and Time-uniform Bounds for Piecewise i.i.d Bandits. CoRR abs/1905.13159 (2019) - 2018
- [c2]Subhojyoti Mukherjee, K. P. Naveen, Nandan Sudarsanam, Balaraman Ravindran:
Efficient-UCBV: An Almost Optimal Algorithm Using Variance Estimates. AAAI 2018: 6417-6424 - 2017
- [c1]Subhojyoti Mukherjee, Kolar Purushothama Naveen, Nandan Sudarsanam, Balaraman Ravindran:
Thresholding Bandits with Augmented UCB. IJCAI 2017: 2515-2521 - [i2]Subhojyoti Mukherjee, Kolar Purushothama Naveen, Nandan Sudarsanam, Balaraman Ravindran:
Thresholding Bandits with Augmented UCB. CoRR abs/1704.02281 (2017) - [i1]Subhojyoti Mukherjee, K. P. Naveen, Nandan Sudarsanam, Balaraman Ravindran:
Efficient-UCBV: An Almost Optimal Algorithm using Variance Estimates. CoRR abs/1711.03591 (2017)
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-04 00:31 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:
