Locating primary users in cognitive radio networks by generalized method of moments. - Soumya Basu 001; Maryam Ahmadi; Minming Ni; Jianping Pan 001 (GLOBECOM, 2014)

New Complexity Results and Algorithms for the Minimum Tollbooth Problem. - Soumya Basu 001; Thanasis Lianeas; Evdokia Nikolova (WINE, 2015)

Reconciling Selfish Routing with Social Good. - Soumya Basu 001; Ger Yang; Thanasis Lianeas; Evdokia Nikolova; Yitao Chen (SAGT, 2017)

A Submodular Approach for Electricity Distribution Network Reconfiguration. - Ali Khodabakhsh 002; Ger Yang; Soumya Basu 001; Evdokia Nikolova; Michael Caramanis; Thanasis Lianeas; Emmanouil Pountourakis (HICSS, 2018)

Adaptive TTL-Based Caching for Content Delivery. - Soumya Basu 001; Aditya Sundarrajan; Javad Ghaderi; Sanjay Shakkottai; Ramesh K. Sitaraman (IEEE/ACM Trans. Netw., 2018)

Pareto Optimal Streaming Unsupervised Classification. - Soumya Basu 001; Steven Gutstein; Brent Lance; Sanjay Shakkottai (ICML, 2019)

Switching Constrained Max-Weight Scheduling for Wireless Networks. - Soumya Basu 001; Sanjay Shakkottai (INFOCOM, 2019)

Blocking Bandits. - Soumya Basu 001; Rajat Sen; Sujay Sanghavi; Sanjay Shakkottai (NeurIPS, 2019)

Disentangling Mixtures of Epidemics on Graphs. - Jessica Hoffmann; Soumya Basu 001; Surbhi Goel; Constantine Caramanis (CoRR, 2019)

Learning Mixtures of Graphs from Epidemic Cascades. - Jessica Hoffmann; Soumya Basu 001; Surbhi Goel; Constantine Caramanis (ICML, 2020)

Warm Starting Bandits with Side Information from Confounded Data. - Nihal Sharma; Soumya Basu 001; Karthikeyan Shanmugam; Sanjay Shakkottai (CoRR, 2020)

Dominate or Delete: Decentralized Competing Bandits with Uniform Valuation. - Abishek Sankararaman; Soumya Basu 001; Karthik Abinav Sankararaman (CoRR, 2020)

Stochastic Linear Bandits with Protected Subspace. - Advait Parulekar; Soumya Basu 001; Aditya Gopalan; Karthikeyan Shanmugam; Sanjay Shakkottai (CoRR, 2020)

On Generalization of Adaptive Methods for Over-parameterized Linear Regression. - Vatsal Shah; Soumya Basu 001; Anastasios Kyrillidis; Sujay Sanghavi (CoRR, 2020)

Contextual Blocking Bandits. - Soumya Basu 001; Orestis Papadigenopoulos; Constantine Caramanis; Sanjay Shakkottai (AISTATS, 2021)

Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship. - Abishek Sankararaman; Soumya Basu 001; Karthik Abinav Sankararaman (AISTATS, 2021)

Beyond log2(T) regret for decentralized bandits in matching markets. - Soumya Basu 001; Karthik Abinav Sankararaman; Abishek Sankararaman (ICML, 2021)

Combinatorial Blocking Bandits with Stochastic Delays. - Alexia Atsidakou; Orestis Papadigenopoulos; Soumya Basu 001; Constantine Caramanis; Sanjay Shakkottai (ICML, 2021)

MmWave Codebook Selection in Rapidly-Varying Channels via Multinomial Thompson Sampling. - Yi Zhang 021; Soumya Basu 001; Sanjay Shakkottai; Robert W. Heath Jr. (MobiHoc, 2021)

No Regrets for Learning the Prior in Bandits. - Soumya Basu 001; Branislav Kveton; Manzil Zaheer; Csaba Szepesvári (NeurIPS, 2021)

Robust Estimation of Tree Structured Markov Random Fields. - Ashish Katiyar; Soumya Basu 001; Vatsal Shah; Constantine Caramanis (CoRR, 2021)

Episodic Bandits with Stochastic Experts. - Nihal Sharma; Soumya Basu 001; Karthikeyan Shanmugam; Sanjay Shakkottai (CoRR, 2021)

Recoverability Landscape of Tree Structured Markov Random Fields under Symmetric Noise. - Ashish Katiyar; Soumya Basu 001; Vatsal Shah; Constantine Caramanis (AISTATS, 2022)

Generalization Properties of Retrieval-based Models. - Soumya Basu 001; Ankit Singh Rawat; Manzil Zaheer (CoRR, 2022)

A Statistical Perspective on Retrieval-Based Models. - Soumya Basu 001; Ankit Singh Rawat; Manzil Zaheer (ICML, 2023)

Double Auctions with Two-sided Bandit Feedback. - Soumya Basu 001; Abishek Sankararaman (NeurIPS, 2023)

A Statistical Framework for Data-dependent Retrieval-Augmented Models. - Soumya Basu 001; Ankit Singh Rawat; Manzil Zaheer (ICML, 2024)

Competing Bandits in Decentralized Large Contextual Matching Markets. - Satush Parikh; Soumya Basu 001; Avishek Ghosh; Abishek Sankararaman (CoRR, 2024)

Bandits with Mean Bounds. - Nihal Sharma; Soumya Basu 001; Karthikeyan Shanmugam; Sanjay Shakkottai (Trans. Mach. Learn. Res., 2024)

Bandits with Stochastic Experts: Constant Regret, Empirical Experts and Episodes. - Nihal Sharma; Rajat Sen; Soumya Basu 001; Karthikeyan Shanmugam; Sanjay Shakkottai (ACM Trans. Model. Perform. Evaluation Comput. Syst., 2024)

Competing Bandits in Matching Markets via Super Stability. - Soumya Basu 001 (CoRR, 2025)