Cover Image

Oracle-Efficient Combinatorial Semi-Bandits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kim, Jung-hun, Vojnović, Milan, Oh, Min-hwan
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Queueing Matching Bandits with Preference Feedback
by: Kim, Jung-hun, et al.
Published: (2024)

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

An Adaptive Approach for Infinitely Many-armed Bandits under Generalized Rotting Constraints
by: Kim, Jung-hun, et al.
Published: (2024)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
by: Kim, Jung-hun, et al.
Published: (2021)

Dynamic Assortment Selection and Pricing with Censored Preference Feedback
by: Kim, Jung-hun, et al.
Published: (2025)

Infrequent Exploration in Linear Bandits
by: Lee, Harin, et al.
Published: (2025)

Combinatorial Reinforcement Learning with Preference Feedback
by: Lee, Joongkyu, et al.
Published: (2025)

Tracking Most Significant Shifts in Infinite-Armed Bandits
by: Suk, Joe, et al.
Published: (2025)

Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit
by: Kim, Seok-Jin, et al.
Published: (2024)

Optimal and Practical Batched Linear Bandit Algorithm
by: Yu, Sanghoon, et al.
Published: (2025)

Adversarial Bandits against Arbitrary Strategies
by: Kim, Jung-hun, et al.
Published: (2022)

Improved Online Confidence Bounds for Multinomial Logistic Bandits
by: Lee, Joongkyu, et al.
Published: (2025)

Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
by: Lee, Joongkyu, et al.
Published: (2024)

Experimental Design for Semiparametric Bandits
by: Kim, Seok-Jin, et al.
Published: (2025)

Tractable Multinomial Logit Contextual Bandits with Non-Linear Utilities
by: Hwang, Taehyun, et al.
Published: (2026)

Blessings of Multiple Good Arms in Multi-Objective Linear Bandits
by: Ann, Heesang, et al.
Published: (2026)

Nonstationary Generalized Linear Bandits with Discounted Online Mirror Descent
by: Lee, Joongkyu, et al.
Published: (2026)

Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicality
by: Kim, Chaiwon, et al.
Published: (2025)

Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning
by: Lee, Harin, et al.
Published: (2026)

Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates
by: Yu, Sanghoon, et al.
Published: (2026)

Exploration via Feature Perturbation in Contextual Bandits
by: Yi, Seouh-won, et al.
Published: (2025)

Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles
by: Kim, Jung-hun, et al.
Published: (2017)

Lasso Bandit with Compatibility Condition on Optimal Arm
by: Lee, Harin, et al.
Published: (2024)

Thompson Sampling for Multi-Objective Linear Contextual Bandit
by: Park, Somangchan, et al.
Published: (2025)

Linear Bandits with Partially Observable Features
by: Kim, Wonyoung, et al.
Published: (2025)

Peng's Q($λ$) for Conservative Value Estimation in Offline Reinforcement Learning
by: Kim, Byeongchan, et al.
Published: (2026)

Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems
by: Lee, Jongyeong, et al.
Published: (2025)

Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds
by: Lee, Jongyeong, et al.
Published: (2024)

ADAM Optimization with Adaptive Batch Selection
by: Kim, Gyu Yeol, et al.
Published: (2025)

Learning in Prophet Inequalities with Noisy Observations
by: Kim, Jung-hun, et al.
Published: (2026)

What is the Alignment Objective of GRPO?
by: Vojnovic, Milan, et al.
Published: (2025)

Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits
by: Li, Mengmeng, et al.
Published: (2025)

Convergence of Muon with Newton-Schulz
by: Kim, Gyu Yeol, et al.
Published: (2026)

Symmetry-Aware GFlowNets
by: Kim, Hohyun, et al.
Published: (2025)

Minimax Optimal Reinforcement Learning with Quasi-Optimism
by: Lee, Harin, et al.
Published: (2025)

Latent Representation Alignment for Offline Goal-Conditioned Reinforcement Learning
by: Kang, Hyungkyu, et al.
Published: (2026)

Demystifying Linear MDPs and Novel Dynamics Aggregation Framework
by: Lee, Joongkyu, et al.
Published: (2024)

Model-Based Reinforcement Learning with Multinomial Logistic Function Approximation
by: Hwang, Taehyun, et al.
Published: (2022)

Optimal Design for Multinomial Logit Model with Applications to Best Assortment Identification
by: Lee, Joongkyu, et al.
Published: (2026)

Improved Regret of Linear Ensemble Sampling
by: Lee, Harin, et al.
Published: (2024)