1 citations · 1 across the 7 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2024
Regret Minimization and Statistical Inference in Online Decision Making with High-dimensional Covariates
Congyuan Duan, Wanteng Ma, Jiashuo Jiang +1
This paper investigates regret minimization, statistical inference, and their interplay in high-dimensional online decision-making based on the sparse linear context bandit model.…
cs.LG2023
High-dimensional Linear Bandits with Knapsacks
Wanteng Ma, Dong Xia, Jiashuo Jiang
We investigate the contextual bandits with knapsack (CBwK) problem in a high-dimensional linear setting, where the feature dimension can be very large. Our goal is to harness spars…
cs.LG2022★ 1 cited
Optimal Regularized Online Allocation by Adaptive Re-Solving
Wanteng Ma, Ying Cao, Danny H. K. Tsang +1
This paper introduces a dual-based algorithm framework for solving the regularized online resource allocation problems, which have potentially non-concave cumulative rewards, hard…