Results 111 to 120 of about 497,803 (209)
Balanced Linear Contextual Bandits
Contextual bandit algorithms are sensitive to the estimation method of the outcome model as well as the exploration method used, particularly in the presence of rich heterogeneity or complex outcome models, which can lead to difficult estimation problems along the path of learning.
Maria Dimakopoulou +3 more
openaire +4 more sources
Statistical Inference for Online Decision-Making: In a Contextual Bandit Setting. [PDF]
Chen H, Lu W, Song R.
europepmc +1 more source
Tree Ensembles for Contextual Bandits
We propose a new framework for contextual multi-armed bandits based on tree ensembles. Our framework adapts two widely used bandit methods, Upper Confidence Bound and Thompson Sampling, for both standard and combinatorial settings. As part of this framework, we propose a novel method of estimating the uncertainty in tree ensemble predictions.
Hannes Nilsson +3 more
openaire +3 more sources
Linear Contextual Bandits with Knapsacks
We consider the linear contextual bandit problem with resource consumption, in addition to reward generation. In each round, the outcome of pulling an arm is a reward as well as a vector of resource consumptions. The expected values of these outcomes depend linearly on the context of that arm.
Shipra Agrawal 0001, Nikhil R. Devanur
openaire +3 more sources
Action Centered Contextual Bandits
to appear at NIPS ...
Kristjan H. Greenewald +3 more
openaire +4 more sources
Strategic Linear Contextual Bandits
To appear at NeurIPS ...
Thomas Kleine Buening +3 more
openaire +4 more sources
Contextual Bandits with Stochastic Experts
20 pages, 2 Figures, Accepted for publication in AISTATS ...
Sen, Rajat +3 more
openaire +3 more sources
Video footage from the WBAP-TV station in Fort Worth, Texas to accompany a news story about Dallas Police apprehending the so-called pants ...
WBAP-TV (Television station : Fort Worth, Tex.)
core +2 more sources
Time-Varying Preference Bandits for Robot Behavior Personalization
Robots are increasingly employed in diverse services, from room cleaning to coffee preparation, necessitating an accurate understanding of user preferences.
Chanwoo Kim +3 more
doaj +1 more source
Combining Cmab with Matrix Factorization and Clustering For Enhanced Movie Recommendations [PDF]
The contextual multi-armed bandit (CMAB) algorithm faces problems of a large-scale, sparse data matrix and many arms. This paper proposes a method that combines matrix factorization with a clustering algorithm to enhance the performance of the CMAB ...
Xiong Shuyue
doaj +1 more source

