default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSoumya Basu 0001
Person information
- affiliation: Google, CA, USA
- affiliation (former): Uiversity of Texas at Austin, TX, USA
- affiliation (former): IIT Kharagpur, India
Other persons with the same name
- Soumya Basu 0002
![[0000-0002-5912-6324]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-5912-6324")
— Swiss Federal Institute of Technology Lausanne (EPFL), Lausanne, Switzerland - Soumya Basu 0003 — Cornell University, Ithaca, NY, USA
- Soumya Basu 0004 — SRM University Tech Park, SRM University, Kattankulathur, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Nihal Sharma, Rajat Sen, Soumya Basu, Karthikeyan Shanmugam, Sanjay Shakkottai:
Bandits with Stochastic Experts: Constant Regret, Empirical Experts and Episodes. ACM Trans. Model. Perform. Evaluation Comput. Syst. 9(3): 12:1-12:33 (2024)- [c19]Soumya Basu, Ankit Singh Rawat, Manzil Zaheer:
A Statistical Framework for Data-dependent Retrieval-Augmented Models. ICML 2024 - [i19]Soumya Basu, Ankit Singh Rawat, Manzil Zaheer:
A Statistical Framework for Data-dependent Retrieval-Augmented Models. CoRR abs/2408.15399 (2024) - 2023
- [c18]Soumya Basu, Ankit Singh Rawat, Manzil Zaheer:
A Statistical Perspective on Retrieval-Based Models. ICML 2023: 1852-1886 - [c17]Soumya Basu, Abishek Sankararaman:
Double Auctions with Two-sided Bandit Feedback. NeurIPS 2023 - 2022
- [c16]Ashish Katiyar, Soumya Basu, Vatsal Shah, Constantine Caramanis:
Recoverability Landscape of Tree Structured Markov Random Fields under Symmetric Noise. AISTATS 2022: 9356-9399 - [i18]Soumya Basu, Abishek Sankararaman:
Double Auctions with Two-sided Bandit Feedback. CoRR abs/2208.06536 (2022) - [i17]Soumya Basu, Ankit Singh Rawat, Manzil Zaheer:
Generalization Properties of Retrieval-based Models. CoRR abs/2210.02617 (2022) - 2021
- [c15]Soumya Basu, Orestis Papadigenopoulos, Constantine Caramanis, Sanjay Shakkottai:
Contextual Blocking Bandits. AISTATS 2021: 271-279 - [c14]Abishek Sankararaman, Soumya Basu, Karthik Abinav Sankararaman:
Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship. AISTATS 2021: 1252-1260 - [c13]Alexia Atsidakou, Orestis Papadigenopoulos, Soumya Basu, Constantine Caramanis, Sanjay Shakkottai:
Combinatorial Blocking Bandits with Stochastic Delays. ICML 2021: 404-413 - [c12]Soumya Basu, Karthik Abinav Sankararaman, Abishek Sankararaman:
Beyond log2(T) regret for decentralized bandits in matching markets. ICML 2021: 705-715 - [c11]Yi Zhang, Soumya Basu, Sanjay Shakkottai, Robert W. Heath Jr.:
MmWave Codebook Selection in Rapidly-Varying Channels via Multinomial Thompson Sampling. MobiHoc 2021: 151-160 - [c10]Soumya Basu, Branislav Kveton, Manzil Zaheer, Csaba Szepesvári:
No Regrets for Learning the Prior in Bandits. NeurIPS 2021: 28029-28041 - [i16]Ashish Katiyar, Soumya Basu, Vatsal Shah, Constantine Caramanis:
Robust Estimation of Tree Structured Markov Random Fields. CoRR abs/2102.08554 (2021) - [i15]Soumya Basu, Karthik Abinav Sankararaman, Abishek Sankararaman:
Beyond log2(T) Regret for Decentralized Bandits in Matching Markets. CoRR abs/2103.07501 (2021) - [i14]Alexia Atsidakou, Orestis Papadigenopoulos, Soumya Basu, Constantine Caramanis, Sanjay Shakkottai:
Combinatorial Blocking Bandits with Stochastic Delays. CoRR abs/2105.10625 (2021) - [i13]Nihal Sharma, Soumya Basu, Karthikeyan Shanmugam, Sanjay Shakkottai:
Episodic Bandits with Stochastic Experts. CoRR abs/2107.03263 (2021) - [i12]Soumya Basu, Branislav Kveton, Manzil Zaheer, Csaba Szepesvári:
No Regrets for Learning the Prior in Bandits. CoRR abs/2107.06196 (2021) - 2020
- [c9]Jessica Hoffmann, Soumya Basu, Surbhi Goel, Constantine Caramanis:
Learning Mixtures of Graphs from Epidemic Cascades. ICML 2020: 4342-4352 - [i11]Nihal Sharma, Soumya Basu, Karthikeyan Shanmugam, Sanjay Shakkottai:
Warm Starting Bandits with Side Information from Confounded Data. CoRR abs/2002.08405 (2020) - [i10]Soumya Basu, Orestis Papadigenopoulos, Constantine Caramanis, Sanjay Shakkottai:
Contextual Blocking Bandits. CoRR abs/2003.03426 (2020) - [i9]Abishek Sankararaman, Soumya Basu, Karthik Abinav Sankararaman:
Dominate or Delete: Decentralized Competing Bandits with Uniform Valuation. CoRR abs/2006.15166 (2020) - [i8]Advait Parulekar, Soumya Basu, Aditya Gopalan, Karthikeyan Shanmugam, Sanjay Shakkottai:
Stochastic Linear Bandits with Protected Subspace. CoRR abs/2011.01016 (2020) - [i7]Vatsal Shah, Soumya Basu, Anastasios Kyrillidis, Sujay Sanghavi:
On Generalization of Adaptive Methods for Over-parameterized Linear Regression. CoRR abs/2011.14066 (2020)
2010 – 2019
- 2019
- [c8]Soumya Basu, Steven Gutstein, Brent Lance, Sanjay Shakkottai:
Pareto Optimal Streaming Unsupervised Classification. ICML 2019: 505-514 - [c7]Soumya Basu, Sanjay Shakkottai:
Switching Constrained Max-Weight Scheduling for Wireless Networks. INFOCOM 2019: 2314-2322 - [c6]Soumya Basu, Rajat Sen, Sujay Sanghavi, Sanjay Shakkottai:
Blocking Bandits. NeurIPS 2019: 4785-4794 - [i6]Jessica Hoffmann, Soumya Basu, Surbhi Goel, Constantine Caramanis:
Disentangling Mixtures of Epidemics on Graphs. CoRR abs/1906.06057 (2019) - [i5]Soumya Basu, Rajat Sen, Sujay Sanghavi, Sanjay Shakkottai:
Blocking Bandits. CoRR abs/1907.11975 (2019) - 2018
- [j1]Soumya Basu, Aditya Sundarrajan, Javad Ghaderi, Sanjay Shakkottai, Ramesh K. Sitaraman:
Adaptive TTL-Based Caching for Content Delivery. IEEE/ACM Trans. Netw. 26(3): 1063-1077 (2018) - [c5]Ali Khodabakhsh, Ger Yang, Soumya Basu, Evdokia Nikolova, Michael Caramanis, Thanasis Lianeas, Emmanouil Pountourakis:
A Submodular Approach for Electricity Distribution Network Reconfiguration. HICSS 2018: 1-10 - 2017
- [c4]Soumya Basu, Ger Yang, Thanasis Lianeas, Evdokia Nikolova, Yitao Chen:
Reconciling Selfish Routing with Social Good. SAGT 2017: 147-159 - [c3]Soumya Basu, Aditya Sundarrajan, Javad Ghaderi, Sanjay Shakkottai, Ramesh K. Sitaraman:
Adaptive TTL-Based Caching for Content Delivery. SIGMETRICS (Abstracts) 2017: 45-46 - [i4]Soumya Basu, Aditya Sundarrajan, Javad Ghaderi, Sanjay Shakkottai, Ramesh K. Sitaraman:
Adaptive TTL-Based Caching for Content Delivery. CoRR abs/1704.04448 (2017) - [i3]Soumya Basu, Ger Yang, Thanasis Lianeas, Evdokia Nikolova, Yitao Chen:
Reconciling Selfish Routing with Social Good. CoRR abs/1707.00208 (2017) - [i2]Ali Khodabakhsh, Ger Yang, Soumya Basu, Evdokia Nikolova, Michael C. Caramanis, Thanasis Lianeas, Emmanouil Pountourakis:
A Submodular Approach for Electricity Distribution Network Reconfiguration. CoRR abs/1711.03517 (2017) - 2015
- [c2]Soumya Basu, Thanasis Lianeas, Evdokia Nikolova:
New Complexity Results and Algorithms for the Minimum Tollbooth Problem. WINE 2015: 89-103 - [i1]Soumya Basu, Thanasis Lianeas, Evdokia Nikolova:
New Complexity Results and Algorithms for the Minimum Tollbooth Problem. CoRR abs/1509.07260 (2015) - 2014
- [c1]Soumya Basu, Maryam Ahmadi, Minming Ni, Jianping Pan:
Locating primary users in cognitive radio networks by generalized method of moments. GLOBECOM 2014: 929-934
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-04 21:01 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:
