:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chandran, G Dhinesh, Reddy, Kota Srinivas, Bhashyam, Srikrishna
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2601.09162
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Clustering of Data Sequences with Bandit Information
by: Chandran, G Dhinesh, et al.
Published: (2025)

Sequential Spectral Clustering of Data Sequences
by: Chandran, G Dhinesh, et al.
Published: (2025)

Exponentially Consistent Nonparametric Linkage-Based Clustering of Data Sequences
by: Singh, Bhupender, et al.
Published: (2024)

On the Regret of Coded Caching with Adversarial Requests
by: Nayak, Anupam, et al.
Published: (2024)

Simultaneous Communication and Tracking using Fused Bistatic Measurements
by: M, Avinash, et al.
Published: (2024)

Fixed-Confidence Best Arm Identification with Decreasing Variance
by: Roychowdhury, Tamojeet, et al.
Published: (2025)

Laplacian Score Sharpening for Mitigating Hallucination in Diffusion Models
by: C, Barath Chandran., et al.
Published: (2025)

Data-Dependent Smoothing for Protein Discovery with Walk-Jump Sampling
by: Anumasa, Srinivas, et al.
Published: (2025)

Stochastic Bandits for Egalitarian Assignment
by: Lim, Eugene, et al.
Published: (2024)

Stochastic Gradient Succeeds for Bandits
by: Mei, Jincheng, et al.
Published: (2024)

Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
by: Huang, Ziyi, et al.
Published: (2024)

Are Stochastic Multi-objective Bandits Harder than Single-objective Bandits?
by: Guan, Changkun, et al.
Published: (2026)

Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contexts
by: Li, Zhuohua, et al.
Published: (2025)

Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits
by: Lin, Jiabin, et al.
Published: (2024)

Batched Stochastic Bandit for Nondegenerate Functions
by: Liu, Yu, et al.
Published: (2024)

Stochastic Bandits Robust to Adversarial Attacks
by: Wang, Xuchuang, et al.
Published: (2024)

Lipschitz Bandits with Stochastic Delayed Feedback
by: Liu, Zhongxuan, et al.
Published: (2025)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
by: Ye, Zichun, et al.
Published: (2025)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
by: Nie, Guanyu, et al.
Published: (2024)

Nonparametric Kernel Clustering with Bandit Feedback
by: Thuot, Victor, et al.
Published: (2026)

Online Clustering of Dueling Bandits
by: Wang, Zhiyong, et al.
Published: (2025)

Optimal Clustering with Bandit Feedback
by: Yang, Junwen, et al.
Published: (2022)

Meta Clustering of Neural Bandits
by: Ban, Yikun, et al.
Published: (2024)

Conformal-Style Quantile Analyses for Stochastic Bandits
by: Du, Chengyu, et al.
Published: (2026)

Active Learning for Stochastic Contextual Linear Bandits
by: Brunskill, Emma, et al.
Published: (2026)

Offline Local Search for Online Stochastic Bandits
by: Benadè, Gerdus, et al.
Published: (2026)

Stochastic Graph Bandit Learning with Side-Observations
by: Gong, Xueping, et al.
Published: (2023)

Stochastic Matching Bandits with Rare Optimization Updates
by: Kim, Jung-hun, et al.
Published: (2025)

Biased Dueling Bandits with Stochastic Delayed Feedback
by: Yi, Bongsoo, et al.
Published: (2024)

Best Arm Identification for Stochastic Rising Bandits
by: Mussi, Marco, et al.
Published: (2023)

DOPL: Direct Online Preference Learning for Restless Bandits with Preference Feedback
by: Xiong, Guojun, et al.
Published: (2024)

Offline Clustering of Linear Bandits: The Power of Clusters under Limited Data
by: Liu, Jingyuan, et al.
Published: (2025)

Stochastic Multi-Armed Bandits with Limited Control Variates
by: Verma, Arun, et al.
Published: (2026)

Stochastic Online Conformal Prediction with Semi-Bandit Feedback
by: Ge, Haosen, et al.
Published: (2024)

Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
by: Cassel, Asaf, et al.
Published: (2024)

Multi-Agent Stochastic Bandits Robust to Adversarial Corruptions
by: Ghaffari, Fatemeh, et al.
Published: (2024)

Thompson Sampling-like Algorithms for Stochastic Rising Bandits
by: Fiandri, Marco, et al.
Published: (2025)

Individual Regret in Cooperative Stochastic Multi-Armed Bandits
by: Barnea, Idan, et al.
Published: (2024)

Efficient Algorithms for Logistic Contextual Slate Bandits with Bandit Feedback
by: Goyal, Tanmay, et al.
Published: (2025)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
by: Pedramfar, Mohammad, et al.
Published: (2023)