all AI news
Max-Quantile Grouped Infinite-Arm Bandits. (arXiv:2210.01295v1 [stat.ML])
Oct. 5, 2022, 1:13 a.m. | Ivan Lau, Yan Hao Ling, Mayank Shrivastava, Jonathan Scarlett
stat.ML updates on arXiv.org arxiv.org
In this paper, we consider a bandit problem in which there are a number of
groups each consisting of infinitely many arms. Whenever a new arm is requested
from a given group, its mean reward is drawn from an unknown reservoir
distribution (different for each group), and the uncertainty in the arm's mean
reward can only be reduced via subsequent pulls of the arm. The goal is to
identify the infinite-arm group whose reservoir distribution has the highest
$(1-\alpha)$-quantile (e.g., …
More from arxiv.org / stat.ML updates on arXiv.org
Inexact subgradient methods for semialgebraic functions
1 day, 21 hours ago |
arxiv.org
Online and Offline Robust Multivariate Linear Regression
1 day, 21 hours ago |
arxiv.org
Jobs in AI, ML, Big Data
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Data Analyst (Digital Business Analyst)
@ Activate Interactive Pte Ltd | Singapore, Central Singapore, Singapore