Saved in:
| Main Authors: | Kim, Seok-Jin, Kim, Gi-Soo, Oh, Min-hwan |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.13390 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit
by: Kim, Seok-Jin, et al.
Published: (2024)
by: Kim, Seok-Jin, et al.
Published: (2024)
Nearly Optimal Best Arm Identification for Semiparametric Bandits
by: Kim, Seok-Jin
Published: (2026)
by: Kim, Seok-Jin
Published: (2026)
Queueing Matching Bandits with Preference Feedback
by: Kim, Jung-hun, et al.
Published: (2024)
by: Kim, Jung-hun, et al.
Published: (2024)
Stochastic Matching Bandits with Rare Optimization Updates
by: Kim, Jung-hun, et al.
Published: (2025)
by: Kim, Jung-hun, et al.
Published: (2025)
Tractable Multinomial Logit Contextual Bandits with Non-Linear Utilities
by: Hwang, Taehyun, et al.
Published: (2026)
by: Hwang, Taehyun, et al.
Published: (2026)
Oracle-Efficient Combinatorial Semi-Bandits
by: Kim, Jung-hun, et al.
Published: (2025)
by: Kim, Jung-hun, et al.
Published: (2025)
Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicality
by: Kim, Chaiwon, et al.
Published: (2025)
by: Kim, Chaiwon, et al.
Published: (2025)
Infrequent Exploration in Linear Bandits
by: Lee, Harin, et al.
Published: (2025)
by: Lee, Harin, et al.
Published: (2025)
Optimal and Practical Batched Linear Bandit Algorithm
by: Yu, Sanghoon, et al.
Published: (2025)
by: Yu, Sanghoon, et al.
Published: (2025)
Improved Online Confidence Bounds for Multinomial Logistic Bandits
by: Lee, Joongkyu, et al.
Published: (2025)
by: Lee, Joongkyu, et al.
Published: (2025)
Nearly Minimax Optimal Regret for Multinomial Logistic Bandit
by: Lee, Joongkyu, et al.
Published: (2024)
by: Lee, Joongkyu, et al.
Published: (2024)
Blessings of Multiple Good Arms in Multi-Objective Linear Bandits
by: Ann, Heesang, et al.
Published: (2026)
by: Ann, Heesang, et al.
Published: (2026)
Nonstationary Generalized Linear Bandits with Discounted Online Mirror Descent
by: Lee, Joongkyu, et al.
Published: (2026)
by: Lee, Joongkyu, et al.
Published: (2026)
Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning
by: Lee, Harin, et al.
Published: (2026)
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)
by: Yu, Sanghoon, et al.
Published: (2026)
Exploration via Feature Perturbation in Contextual Bandits
by: Yi, Seouh-won, et al.
Published: (2025)
by: Yi, Seouh-won, et al.
Published: (2025)
Linear Bandits with Partially Observable Features
by: Kim, Wonyoung, et al.
Published: (2025)
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)
by: Kim, Byeongchan, et al.
Published: (2026)
Lasso Bandit with Compatibility Condition on Optimal Arm
by: Lee, Harin, et al.
Published: (2024)
by: Lee, Harin, et al.
Published: (2024)
Thompson Sampling for Multi-Objective Linear Contextual Bandit
by: Park, Somangchan, et al.
Published: (2025)
by: Park, Somangchan, et al.
Published: (2025)
ADAM Optimization with Adaptive Batch Selection
by: Kim, Gyu Yeol, et al.
Published: (2025)
by: Kim, Gyu Yeol, et al.
Published: (2025)
Dynamic Assortment Selection and Pricing with Censored Preference Feedback
by: Kim, Jung-hun, et al.
Published: (2025)
by: Kim, Jung-hun, et al.
Published: (2025)
Convergence of Muon with Newton-Schulz
by: Kim, Gyu Yeol, et al.
Published: (2026)
by: Kim, Gyu Yeol, et al.
Published: (2026)
Optimal Design for Multinomial Logit Model with Applications to Best Assortment Identification
by: Lee, Joongkyu, et al.
Published: (2026)
by: Lee, Joongkyu, et al.
Published: (2026)
Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems
by: Lee, Jongyeong, et al.
Published: (2025)
by: Lee, Jongyeong, et al.
Published: (2025)
Symmetry-Aware GFlowNets
by: Kim, Hohyun, et al.
Published: (2025)
by: Kim, Hohyun, et al.
Published: (2025)
Latent Representation Alignment for Offline Goal-Conditioned Reinforcement Learning
by: Kang, Hyungkyu, et al.
Published: (2026)
by: Kang, Hyungkyu, et al.
Published: (2026)
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)
by: Lee, Jongyeong, et al.
Published: (2024)
Pursuing Overall Welfare in Federated Learning through Sequential Decision Making
by: Hahn, Seok-Ju, et al.
Published: (2024)
by: Hahn, Seok-Ju, et al.
Published: (2024)
Minimax Optimal Reinforcement Learning with Quasi-Optimism
by: Lee, Harin, et al.
Published: (2025)
by: Lee, Harin, et al.
Published: (2025)
Combinatorial Reinforcement Learning with Preference Feedback
by: Lee, Joongkyu, et al.
Published: (2025)
by: Lee, Joongkyu, et al.
Published: (2025)
Demystifying Linear MDPs and Novel Dynamics Aggregation Framework
by: Lee, Joongkyu, et al.
Published: (2024)
by: Lee, Joongkyu, et al.
Published: (2024)
Model-Based Reinforcement Learning with Multinomial Logistic Function Approximation
by: Hwang, Taehyun, et al.
Published: (2022)
by: Hwang, Taehyun, et al.
Published: (2022)
Improved Regret of Linear Ensemble Sampling
by: Lee, Harin, et al.
Published: (2024)
by: Lee, Harin, et al.
Published: (2024)
Adversarial Policy Optimization for Offline Preference-based Reinforcement Learning
by: Kang, Hyungkyu, et al.
Published: (2025)
by: Kang, Hyungkyu, et al.
Published: (2025)
RelFlexformer: Efficient Attention 3D-Transformers for Integrable Relative Positional Encodings
by: Kim, Byeongchan, et al.
Published: (2026)
by: Kim, Byeongchan, et al.
Published: (2026)
A Temporally Correlated Latent Exploration for Reinforcement Learning
by: Oh, SuMin, et al.
Published: (2024)
by: Oh, SuMin, et al.
Published: (2024)
Semiparametric Counterfactual Regression
by: Kim, Kwangho
Published: (2025)
by: Kim, Kwangho
Published: (2025)
Preference-based Reinforcement Learning beyond Pairwise Comparisons: Benefits of Multiple Options
by: Lee, Joongkyu, et al.
Published: (2025)
by: Lee, Joongkyu, et al.
Published: (2025)
Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function Approximation
by: Cho, Wooseong, et al.
Published: (2024)
by: Cho, Wooseong, et al.
Published: (2024)
Similar Items
-
Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit
by: Kim, Seok-Jin, et al.
Published: (2024) -
Nearly Optimal Best Arm Identification for Semiparametric Bandits
by: Kim, Seok-Jin
Published: (2026) -
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) -
Tractable Multinomial Logit Contextual Bandits with Non-Linear Utilities
by: Hwang, Taehyun, et al.
Published: (2026)