Saved in:
| Main Authors: | Chen, Li, Qin, Hanzhang, Xu, Yunbei, Zhu, Ruihao, Zhang, Weizhou |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.09900 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits
by: Xu, Yunbei, et al.
Published: (2020)
by: Xu, Yunbei, et al.
Published: (2020)
On Pareto Optimality for Parametric Choice Bandits
by: Zuo, Jierui, et al.
Published: (2025)
by: Zuo, Jierui, et al.
Published: (2025)
Pointwise Generalization in Deep Neural Networks
by: Li, Shaojie, et al.
Published: (2026)
by: Li, Shaojie, et al.
Published: (2026)
Deep Generative Demand Learning for Newsvendor and Pricing
by: Gong, Shijin, et al.
Published: (2024)
by: Gong, Shijin, et al.
Published: (2024)
Statistical Properties of Robust Satisficing
by: Li, Zhiyi, et al.
Published: (2024)
by: Li, Zhiyi, et al.
Published: (2024)
Bayesian Design Principles for Frequentist Sequential Learning
by: Xu, Yunbei, et al.
Published: (2023)
by: Xu, Yunbei, et al.
Published: (2023)
Closing the Gaps: Optimality of Sample Average Approximation for Data-Driven Newsvendor Problems
by: Lyu, Jiameng, et al.
Published: (2024)
by: Lyu, Jiameng, et al.
Published: (2024)
Autoregressive Learning in Joint KL: Sharp Oracle Bounds and Lower Bounds
by: Xu, Yunbei, et al.
Published: (2026)
by: Xu, Yunbei, et al.
Published: (2026)
On the Power of Adaptivity for $\varepsilon$-Best Arm Identification in Linear Bandits
by: Maiti, Arnab, et al.
Published: (2026)
by: Maiti, Arnab, et al.
Published: (2026)
The Data-Driven Censored Newsvendor Problem
by: Hssaine, Chamsi, et al.
Published: (2024)
by: Hssaine, Chamsi, et al.
Published: (2024)
Survey of Data-driven Newsvendor: Unified Analysis and Spectrum of Achievable Regrets
by: Chen, Zhuoxin, et al.
Published: (2024)
by: Chen, Zhuoxin, et al.
Published: (2024)
Sample-Mean Anchored Thompson Sampling for Offline-to-Online Learning with Distribution Shift
by: Li, Bochao, et al.
Published: (2026)
by: Li, Bochao, et al.
Published: (2026)
Constrained Linear Thompson Sampling
by: Gangrade, Aditya, et al.
Published: (2025)
by: Gangrade, Aditya, et al.
Published: (2025)
Distilled Thompson Sampling: Practical and Efficient Thompson Sampling via Imitation Learning
by: Namkoong, Hongseok, et al.
Published: (2020)
by: Namkoong, Hongseok, et al.
Published: (2020)
Understanding the Transferability of Representations via Task-Relatedness
by: Mehra, Akshay, et al.
Published: (2023)
by: Mehra, Akshay, et al.
Published: (2023)
Test-time Assessment of a Model's Performance on Unseen Domains via Optimal Transport
by: Mehra, Akshay, et al.
Published: (2024)
by: Mehra, Akshay, et al.
Published: (2024)
Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox
by: Zhang, Raymond, et al.
Published: (2024)
by: Zhang, Raymond, et al.
Published: (2024)
Regenerative Particle Thompson Sampling
by: Zhou, Zeyu, et al.
Published: (2022)
by: Zhou, Zeyu, et al.
Published: (2022)
Risk-Aware Linear Bandits: Theory and Applications in Smart Order Routing
by: Ji, Jingwei, et al.
Published: (2022)
by: Ji, Jingwei, et al.
Published: (2022)
EVA-0: Test-Time Model Evolution with Only Two Forward Passes per Sample
by: Chen, Guohao, et al.
Published: (2026)
by: Chen, Guohao, et al.
Published: (2026)
Robust Thompson Sampling Algorithms Against Reward Poisoning Attacks
by: Xu, Yinglun, et al.
Published: (2024)
by: Xu, Yinglun, et al.
Published: (2024)
Adaptive Data Augmentation for Thompson Sampling
by: Kim, Wonyoung
Published: (2025)
by: Kim, Wonyoung
Published: (2025)
A Broader View of Thompson Sampling
by: Qu, Yanlin, et al.
Published: (2025)
by: Qu, Yanlin, et al.
Published: (2025)
Online Resource Allocation with Non-Stationary Customers
by: Zhang, Xiaoyue, et al.
Published: (2024)
by: Zhang, Xiaoyue, et al.
Published: (2024)
Graph Neural Thompson Sampling
by: Wu, Shuang, et al.
Published: (2024)
by: Wu, Shuang, et al.
Published: (2024)
Is Thompson Sampling Susceptible to Algorithmic Collusion?
by: Xiong, Yi, et al.
Published: (2024)
by: Xiong, Yi, et al.
Published: (2024)
Large-Scale Optimization Model Auto-Formulation: Harnessing LLM Flexibility via Structured Workflow
by: Liang, Kuo, et al.
Published: (2026)
by: Liang, Kuo, et al.
Published: (2026)
Stochastically Constrained Best Arm Identification with Thompson Sampling
by: Yang, Le, et al.
Published: (2025)
by: Yang, Le, et al.
Published: (2025)
Learning When to Restart: Nonstationary Newsvendor from Uncensored to Censored Demand
by: Chen, Xin, et al.
Published: (2025)
by: Chen, Xin, et al.
Published: (2025)
Epsilon-Greedy Thompson Sampling to Bayesian Optimization
by: Do, Bach, et al.
Published: (2024)
by: Do, Bach, et al.
Published: (2024)
Gaussian Process Thompson Sampling via Rootfinding
by: Adebiyi, Taiwo A., et al.
Published: (2024)
by: Adebiyi, Taiwo A., et al.
Published: (2024)
Contextual Online Pricing with (Biased) Offline Data
by: Zhang, Yixuan, et al.
Published: (2025)
by: Zhang, Yixuan, et al.
Published: (2025)
On the Peril of (Even a Little) Nonstationarity in Satisficing Regret Minimization
by: Zhang, Yixuan, et al.
Published: (2026)
by: Zhang, Yixuan, et al.
Published: (2026)
BFTS: Thompson Sampling with Bayesian Additive Regression Trees
by: Deng, Ruizhe, et al.
Published: (2026)
by: Deng, Ruizhe, et al.
Published: (2026)
Fast, Precise Thompson Sampling for Bayesian Optimization
by: Sweet, David
Published: (2024)
by: Sweet, David
Published: (2024)
Thompson Sampling in Partially Observable Contextual Bandits
by: Park, Hongju, et al.
Published: (2024)
by: Park, Hongju, et al.
Published: (2024)
Online Learning of Decision Trees with Thompson Sampling
by: Chaouki, Ayman, et al.
Published: (2024)
by: Chaouki, Ayman, et al.
Published: (2024)
On Regret Bounds of Thompson Sampling for Bayesian Optimization
by: Takeno, Shion, et al.
Published: (2026)
by: Takeno, Shion, et al.
Published: (2026)
A Conformal Approach to Feature-based Newsvendor under Model Misspecification
by: Cao, Junyu
Published: (2024)
by: Cao, Junyu
Published: (2024)
What is the Value of Censored Data? An Exact Analysis for the Data-driven Newsvendor
by: Kumar, Rachitesh, et al.
Published: (2026)
by: Kumar, Rachitesh, et al.
Published: (2026)
Similar Items
-
Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits
by: Xu, Yunbei, et al.
Published: (2020) -
On Pareto Optimality for Parametric Choice Bandits
by: Zuo, Jierui, et al.
Published: (2025) -
Pointwise Generalization in Deep Neural Networks
by: Li, Shaojie, et al.
Published: (2026) -
Deep Generative Demand Learning for Newsvendor and Pricing
by: Gong, Shijin, et al.
Published: (2024) -
Statistical Properties of Robust Satisficing
by: Li, Zhiyi, et al.
Published: (2024)