Soumya Basu

Orcid: 0000-0001-5486-2448

Affiliations:
  • Google, CA, USA
  • Uiversity of Texas at Austin, TX, USA (former)
  • IIT Kharagpur, India (former)


According to our database1, Soumya Basu authored at least 26 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Double Auctions with Two-sided Bandit Feedback.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

A Statistical Perspective on Retrieval-Based Models.
Proceedings of the International Conference on Machine Learning, 2023

2022
Generalization Properties of Retrieval-based Models.
CoRR, 2022

Recoverability Landscape of Tree Structured Markov Random Fields under Symmetric Noise.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Episodic Bandits with Stochastic Experts.
CoRR, 2021

Robust Estimation of Tree Structured Markov Random Fields.
CoRR, 2021

No Regrets for Learning the Prior in Bandits.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

MmWave Codebook Selection in Rapidly-Varying Channels via Multinomial Thompson Sampling.
Proceedings of the MobiHoc '21: The Twenty-second International Symposium on Theory, 2021

Combinatorial Blocking Bandits with Stochastic Delays.
Proceedings of the 38th International Conference on Machine Learning, 2021

Beyond log<sup>2</sup>(T) regret for decentralized bandits in matching markets.
Proceedings of the 38th International Conference on Machine Learning, 2021

Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Contextual Blocking Bandits.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
On Generalization of Adaptive Methods for Over-parameterized Linear Regression.
CoRR, 2020

Stochastic Linear Bandits with Protected Subspace.
CoRR, 2020

Dominate or Delete: Decentralized Competing Bandits with Uniform Valuation.
CoRR, 2020

Warm Starting Bandits with Side Information from Confounded Data.
CoRR, 2020

Learning Mixtures of Graphs from Epidemic Cascades.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Disentangling Mixtures of Epidemics on Graphs.
CoRR, 2019

Blocking Bandits.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Switching Constrained Max-Weight Scheduling for Wireless Networks.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

Pareto Optimal Streaming Unsupervised Classification.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Adaptive TTL-Based Caching for Content Delivery.
IEEE/ACM Trans. Netw., 2018

A Submodular Approach for Electricity Distribution Network Reconfiguration.
Proceedings of the 51st Hawaii International Conference on System Sciences, 2018

2017
Reconciling Selfish Routing with Social Good.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2015
New Complexity Results and Algorithms for the Minimum Tollbooth Problem.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

2014
Locating primary users in cognitive radio networks by generalized method of moments.
Proceedings of the IEEE Global Communications Conference, 2014


  Loading...