research
∙
05/31/2023
Pareto Front Identification with Regret Minimization
We consider Pareto front identification for linear bandits (PFILin) wher...
share
research
∙
01/31/2023
Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback
We consider the linear contextual multi-class multi-period packing probl...
research
∙
09/15/2022
Double Doubly Robust Thompson Sampling for Generalized Linear Contextual Bandits
We propose a novel contextual bandit algorithm for generalized linear re...
research
∙
06/11/2022
Squeeze All: Novel Estimator and Self-Normalized Bound for Linear Contextual Bandits
We propose a novel algorithm for linear contextual bandits with O(√(dT l...
research
∙
02/01/2021
Doubly Robust Thompson Sampling for linear payoffs
A challenging aspect of the bandit problem is that a stochastic reward i...
research
∙
06/05/2020
Principled Learning Method for Wasserstein Distributionally Robust Optimization with Local Perturbations
Wasserstein distributionally robust optimization (WDRO) attempts to lear...
research
∙
01/28/2019