Abishek Sankararaman

Orcid: 0000-0002-3309-8652

According to our database1, Abishek Sankararaman authored at least 27 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Competing Bandits in Non-Stationary Matching Markets.
IEEE Trans. Inf. Theory, April, 2024

Model Selection for Generic Contextual Bandits.
IEEE Trans. Inf. Theory, January, 2024

2023
Multiagent Low-Dimensional Linear Bandits.
IEEE Trans. Autom. Control., May, 2023

Online Heavy-tailed Change-point detection.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

Online robust non-stationary estimation.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 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

2022
Predict-and-Critic: Accelerated End-to-End Predictive Control for Cloud Computing through Reinforcement Learning.
CoRR, 2022

Decentralized Competing Bandits in Non-Stationary Matching Markets.
CoRR, 2022

Breaking the √T Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits.
CoRR, 2022

Multi-agent Heterogeneous Stochastic Linear Bandits.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2022

FITNESS: (Fine Tune on New and Similar Samples) to detect anomalies in streams with drift and outliers.
Proceedings of the International Conference on Machine Learning, 2022

Breaking the $\sqrt{T}$ Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits.
Proceedings of the International Conference on Machine Learning, 2022

2021
Collaborative Learning and Personalization in Multi-Agent Stochastic Linear Bandits.
CoRR, 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

Problem-Complexity Adaptive Model Selection for Stochastic Linear Bandits.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Stability and Scalability of Blockchain Systems.
Proc. ACM Meas. Anal. Comput. Syst., 2020

Multi-Agent Low-Dimensional Linear Bandits.
CoRR, 2020

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

The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Social Learning in Multi Agent Multi Armed Bandits.
Proc. ACM Meas. Anal. Comput. Syst., 2019

ComHapDet: A Spatial Community Detection Algorithm for Haplotype Assembly.
CoRR, 2019

2018
Community Detection on Euclidean Random Graphs.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Spatial Birth-Death Wireless Networks.
IEEE Trans. Inf. Theory, 2017

Interference Queuing Networks on Grids.
CoRR, 2017

2016
Performance-Oriented Association in Large Cellular Networks with Technology Diversity.
Proceedings of the 28th International Teletraffic Congress, 2016

2015
CSMA k-SIC - A class of distributed MAC protocols and their performance evaluation.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015


  Loading...