Saved in:
| Main Authors: | Sharma, Nihal, Sen, Rajat, Basu, Soumya, Shanmugam, Karthikeyan, Shakkottai, Sanjay |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2107.03263 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Bandits with Mean Bounds
by: Sharma, Nihal, et al.
Published: (2020)
by: Sharma, Nihal, et al.
Published: (2020)
Blocking Bandits
by: Basu, Soumya, et al.
Published: (2019)
by: Basu, Soumya, et al.
Published: (2019)
Efficient Approximate Posterior Sampling with Annealed Langevin Monte Carlo
by: Parulekar, Advait, et al.
Published: (2025)
by: Parulekar, Advait, et al.
Published: (2025)
Regret minimization in Linear Bandits with offline data via extended D-optimal exploration
by: Vijayan, Sushant, et al.
Published: (2025)
by: Vijayan, Sushant, et al.
Published: (2025)
Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)
by: Tatlı, Meltem, et al.
Published: (2025)
Risk-sensitive Bandits: Arm Mixture Optimality and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)
by: Tatlı, Meltem, et al.
Published: (2025)
Improved Regret Bounds for Bandits with Expert Advice
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)
by: Cesa-Bianchi, Nicolò, et al.
Published: (2024)
Fine-Tuning Diffusion Models via Intermediate Distribution Shaping
by: Anil, Gautham Govind, et al.
Published: (2025)
by: Anil, Gautham Govind, et al.
Published: (2025)
Stochastic Online Instrumental Variable Regression: Regrets for Endogeneity and Bandit Feedback
by: Della Vecchia, Riccardo, et al.
Published: (2023)
by: Della Vecchia, Riccardo, et al.
Published: (2023)
Competing Bandits in Matching Markets via Super Stability
by: Basu, Soumya
Published: (2025)
by: Basu, Soumya
Published: (2025)
Asymptotically-Optimal Gaussian Bandits with Side Observations
by: Atsidakou, Alexia, et al.
Published: (2025)
by: Atsidakou, Alexia, et al.
Published: (2025)
Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits
by: Chawla, Ronshee, et al.
Published: (2023)
by: Chawla, Ronshee, et al.
Published: (2023)
The Gossiping Insert-Eliminate Algorithm for Multi-Agent Bandits
by: Chawla, Ronshee, et al.
Published: (2020)
by: Chawla, Ronshee, et al.
Published: (2020)
Competing Bandits in Decentralized Contextual Matching Markets
by: Parikh, Satush, et al.
Published: (2024)
by: Parikh, Satush, et al.
Published: (2024)
p-Mean Regret for Stochastic Bandits
by: Krishna, Anand, et al.
Published: (2024)
by: Krishna, Anand, et al.
Published: (2024)
Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution
by: Feng, Qing, et al.
Published: (2024)
by: Feng, Qing, et al.
Published: (2024)
Bayesian Collaborative Bandits with Thompson Sampling for Improved Outreach in Maternal Health Program
by: Dasgupta, Arpan, et al.
Published: (2024)
by: Dasgupta, Arpan, et al.
Published: (2024)
Combinatorial Multi-armed Bandits: Arm Selection via Group Testing
by: Mukherjee, Arpan, et al.
Published: (2024)
by: Mukherjee, Arpan, et al.
Published: (2024)
Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
by: Cassel, Asaf, et al.
Published: (2024)
by: Cassel, Asaf, et al.
Published: (2024)
Individual Regret in Cooperative Stochastic Multi-Armed Bandits
by: Barnea, Idan, et al.
Published: (2024)
by: Barnea, Idan, et al.
Published: (2024)
Bandits with Abstention under Expert Advice
by: Pasteris, Stephen, et al.
Published: (2024)
by: Pasteris, Stephen, et al.
Published: (2024)
Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
by: Ito, Shinji, et al.
Published: (2025)
by: Ito, Shinji, et al.
Published: (2025)
Budgeted Online Active Learning with Expert Advice and Episodic Priors
by: Goebel, Kristen, et al.
Published: (2025)
by: Goebel, Kristen, et al.
Published: (2025)
Anchored Diffusion Language Model
by: Rout, Litu, et al.
Published: (2025)
by: Rout, Litu, et al.
Published: (2025)
Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit
by: Zhou, Julien, et al.
Published: (2024)
by: Zhou, Julien, et al.
Published: (2024)
Selective classification using a robust meta-learning approach
by: Jain, Nishant, et al.
Published: (2022)
by: Jain, Nishant, et al.
Published: (2022)
Glauber Generative Model: Discrete Diffusion Models via Binary Classification
by: Varma, Harshit, et al.
Published: (2024)
by: Varma, Harshit, et al.
Published: (2024)
Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits
by: Di, Qiwei, et al.
Published: (2023)
by: Di, Qiwei, et al.
Published: (2023)
Representation Learning Preserving Ignorability and Covariate Matching for Treatment Effects
by: Nanavati, Praharsh, et al.
Published: (2025)
by: Nanavati, Praharsh, et al.
Published: (2025)
Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
by: Ye, Zichun, et al.
Published: (2025)
by: Ye, Zichun, et al.
Published: (2025)
Machine Unlearning under Overparameterization
by: Block, Jacob L., et al.
Published: (2025)
by: Block, Jacob L., et al.
Published: (2025)
Thompson Sampling for Stochastic Bandits with Noisy Contexts: An Information-Theoretic Regret Analysis
by: Jose, Sharu Theresa, et al.
Published: (2024)
by: Jose, Sharu Theresa, et al.
Published: (2024)
Learning from Label Proportions: Bootstrapping Supervised Learners via Belief Propagation
by: Havaldar, Shreyas, et al.
Published: (2023)
by: Havaldar, Shreyas, et al.
Published: (2023)
Optimal Regret of Bernoulli Bandits under Global Differential Privacy
by: Azize, Achraf, et al.
Published: (2025)
by: Azize, Achraf, et al.
Published: (2025)
Stochastic Multi-Objective Multi-Armed Bandits: Regret Definition and Algorithm
by: Davoodi, Mansoor, et al.
Published: (2025)
by: Davoodi, Mansoor, et al.
Published: (2025)
Semantic Image Inversion and Editing using Rectified Stochastic Differential Equations
by: Rout, Litu, et al.
Published: (2024)
by: Rout, Litu, et al.
Published: (2024)
AnCoder: Anchored Code Generation via Discrete Diffusion Models
by: Xue, Anton, et al.
Published: (2026)
by: Xue, Anton, et al.
Published: (2026)
Temper-Then-Tilt: Principled Unlearning for Generative Models through Tempering and Classifier Guidance
by: Block, Jacob L., et al.
Published: (2026)
by: Block, Jacob L., et al.
Published: (2026)
Bayesian Regret Minimization in Offline Bandits
by: Petrik, Marek, et al.
Published: (2023)
by: Petrik, Marek, et al.
Published: (2023)
Optimal Regret for Single Index Bandits
by: Dey, Devdan, et al.
Published: (2026)
by: Dey, Devdan, et al.
Published: (2026)
Similar Items
-
Bandits with Mean Bounds
by: Sharma, Nihal, et al.
Published: (2020) -
Blocking Bandits
by: Basu, Soumya, et al.
Published: (2019) -
Efficient Approximate Posterior Sampling with Annealed Langevin Monte Carlo
by: Parulekar, Advait, et al.
Published: (2025) -
Regret minimization in Linear Bandits with offline data via extended D-optimal exploration
by: Vijayan, Sushant, et al.
Published: (2025) -
Preference-centric Bandits: Optimality of Mixtures and Regret-efficient Algorithms
by: Tatlı, Meltem, et al.
Published: (2025)