default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbishek Sankararaman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Avishek Ghosh
, Abishek Sankararaman, Kannan Ramchandran:
Model Selection for Generic Contextual Bandits. IEEE Trans. Inf. Theory 70(1): 656-675 (2024)- [j5]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran, Tara Javidi, Arya Mazumdar:
Competing Bandits in Non-Stationary Matching Markets. IEEE Trans. Inf. Theory 70(4): 2831-2850 (2024) - [c18]Sophia Huiwen Sun, Abishek Sankararaman, Balakrishnan Narayanaswamy:
Online Adaptive Anomaly Thresholding with Confidence Sequences. ICML 2024 - [i20]Satush Parikh, Soumya Basu, Avishek Ghosh, Abishek Sankararaman:
Competing Bandits in Decentralized Large Contextual Matching Markets. CoRR abs/2411.11794 (2024) - 2023
- [j4]Ronshee Chawla, Abishek Sankararaman, Sanjay Shakkottai:
Multiagent Low-Dimensional Linear Bandits. IEEE Trans. Autom. Control. 68(5): 2667-2682 (2023) - [c17]Soumya Basu, Abishek Sankararaman:
Double Auctions with Two-sided Bandit Feedback. NeurIPS 2023 - [c16]Abishek Sankararaman, Balakrishnan Narayanaswamy:
Online robust non-stationary estimation. NeurIPS 2023 - [c15]Abishek Sankararaman, Balakrishnan Narayanaswamy:
Online Heavy-tailed Change-point detection. UAI 2023: 1815-1826 - [i19]Abishek Sankararaman, Balakrishnan Narayanaswamy:
Online Heavy-tailed Change-point detection. CoRR abs/2306.09548 (2023) - 2022
- [c14]Avishek Ghosh, Abishek Sankararaman:
Breaking the $\sqrt{T}$ Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits. ICML 2022: 7531-7549 - [c13]Abishek Sankararaman, Balakrishnan Narayanaswamy, Vikramank Y. Singh, Zhao Song:
FITNESS: (Fine Tune on New and Similar Samples) to detect anomalies in streams with drift and outliers. ICML 2022: 19153-19177 - [c12]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran:
Multi-agent Heterogeneous Stochastic Linear Bandits. ECML/PKDD (4) 2022: 300-316 - [i18]Avishek Ghosh, Abishek Sankararaman:
Breaking the √T Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits. CoRR abs/2205.09899 (2022) - [i17]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran, Tara Javidi, Arya Mazumdar:
Decentralized Competing Bandits in Non-Stationary Matching Markets. CoRR abs/2206.00120 (2022) - [i16]Soumya Basu, Abishek Sankararaman:
Double Auctions with Two-sided Bandit Feedback. CoRR abs/2208.06536 (2022) - [i15]Kaustubh Sridhar, Vikramank Y. Singh, Balakrishnan Narayanaswamy, Abishek Sankararaman:
Predict-and-Critic: Accelerated End-to-End Predictive Control for Cloud Computing through Reinforcement Learning. CoRR abs/2212.01348 (2022) - 2021
- [c11]Abishek Sankararaman, Soumya Basu, Karthik Abinav Sankararaman:
Dominate or Delete: Decentralized Competing Bandits in Serial Dictatorship. AISTATS 2021: 1252-1260 - [c10]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran:
Problem-Complexity Adaptive Model Selection for Stochastic Linear Bandits. AISTATS 2021: 1396-1404 - [c9]Soumya Basu, Karthik Abinav Sankararaman, Abishek Sankararaman:
Beyond log2(T) regret for decentralized bandits in matching markets. ICML 2021: 705-715 - [i14]Soumya Basu, Karthik Abinav Sankararaman, Abishek Sankararaman:
Beyond log2(T) Regret for Decentralized Bandits in Matching Markets. CoRR abs/2103.07501 (2021) - [i13]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran:
Collaborative Learning and Personalization in Multi-Agent Stochastic Linear Bandits. CoRR abs/2106.08902 (2021) - [i12]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran:
Model Selection for Generic Contextual Bandits. CoRR abs/2107.03455 (2021) - 2020
- [j3]Aditya Gopalan, Abishek Sankararaman, Anwar Walid, Sriram Vishwanath:
Stability and Scalability of Blockchain Systems. Proc. ACM Meas. Anal. Comput. Syst. 4(2): 35:1-35:35 (2020) - [c8]Ronshee Chawla, Abishek Sankararaman, Ayalvadi Ganesh, Sanjay Shakkottai:
The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits. AISTATS 2020: 3471-3481 - [c7]Abishek Sankararaman, Ayalvadi Ganesh, Sanjay Shakkottai:
Social Learning in Multi Agent Multi Armed Bandits. SIGMETRICS (Abstracts) 2020: 29-30 - [c6]Aditya Gopalan, Abishek Sankararaman, Anwar Walid, Sriram Vishwanath:
Stability and Scalability of Blockchain Systems. SIGMETRICS (Abstracts) 2020: 71-72 - [i11]Ronshee Chawla, Abishek Sankararaman, Ayalvadi Ganesh, Sanjay Shakkottai:
The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits. CoRR abs/2001.05452 (2020) - [i10]Aditya Gopalan, Abishek Sankararaman, Anwar Walid, Sriram Vishwanath:
Stability and Scalability of Blockchain Systems. CoRR abs/2002.02567 (2020) - [i9]Avishek Ghosh, Abishek Sankararaman, Kannan Ramchandran:
Problem-Complexity Adaptive Model Selection for Stochastic Linear Bandits. CoRR abs/2006.02612 (2020) - [i8]Abishek Sankararaman, Soumya Basu, Karthik Abinav Sankararaman:
Dominate or Delete: Decentralized Competing Bandits with Uniform Valuation. CoRR abs/2006.15166 (2020) - [i7]Ronshee Chawla, Abishek Sankararaman, Sanjay Shakkottai:
Multi-Agent Low-Dimensional Linear Bandits. CoRR abs/2007.01442 (2020)
2010 – 2019
- 2019
- [j2]Abishek Sankararaman, Ayalvadi Ganesh, Sanjay Shakkottai:
Social Learning in Multi Agent Multi Armed Bandits. Proc. ACM Meas. Anal. Comput. Syst. 3(3): 53:1-53:35 (2019) - [i6]Abishek Sankararaman, Ayalvadi Ganesh, Sanjay Shakkottai:
Social Learning in Multi Agent Multi Armed Bandits. CoRR abs/1910.02100 (2019) - [i5]Abishek Sankararaman, Haris Vikalo, François Baccelli:
ComHapDet: A Spatial Community Detection Algorithm for Haplotype Assembly. CoRR abs/1911.12285 (2019) - 2018
- [c5]Abishek Sankararaman, François Baccelli:
Community Detection on Euclidean Random Graphs. SODA 2018: 2181-2200 - 2017
- [j1]Abishek Sankararaman, François Baccelli:
Spatial Birth-Death Wireless Networks. IEEE Trans. Inf. Theory 63(6): 3964-3982 (2017) - [c4]Abishek Sankararaman, François Baccelli:
Community detection on euclidean random graphs. Allerton 2017: 510-517 - [i4]Abishek Sankararaman, François Baccelli:
Community Detection on Euclidean Random Graphs. CoRR abs/1706.09942 (2017) - [i3]Abishek Sankararaman, François Baccelli, Sergey Foss:
Interference Queuing Networks on Grids. CoRR abs/1710.09797 (2017) - 2016
- [c3]Abishek Sankararaman, François Baccelli:
Spatial birth-death wireless networks. Allerton 2016: 916-923 - [c2]Abishek Sankararaman, Jeong-woo Cho, François Baccelli:
Performance-Oriented Association in Large Cellular Networks with Technology Diversity. ITC 2016: 94-102 - [i2]Abishek Sankararaman, Jeong-woo Cho, François Baccelli:
Performance-Oriented Association in Large Cellular Networks with Technology Diversity. CoRR abs/1603.06928 (2016) - [i1]Abishek Sankararaman, François Baccelli:
Spatial Birth-Death Wireless Networks. CoRR abs/1604.07884 (2016) - 2015
- [c1]Abishek Sankararaman, François Baccelli:
CSMA k-SIC - A class of distributed MAC protocols and their performance evaluation. INFOCOM 2015: 2002-2010
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 2025-01-20 22:53 CET 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:
