Web: http://arxiv.org/abs/2206.11780

June 24, 2022, 1:10 a.m. | Nicolas Christianson, Tinashe Handina, Adam Wierman

cs.LG updates on arXiv.org arxiv.org

We consider the problem of convex function chasing with black-box advice,
where an online decision-maker aims to minimize the total cost of making and
switching between decisions in a normed vector space, aided by black-box advice
such as the decisions of a machine-learned algorithm. The decision-maker seeks
cost comparable to the advice when it performs well, known as
$\textit{consistency}$, while also ensuring worst-case $\textit{robustness}$
even when the advice is adversarial. We first consider the common paradigm of
algorithms that switch …

advice arxiv lg

More from arxiv.org / cs.LG updates on arXiv.org

Machine Learning Researcher - Saalfeld Lab

@ Howard Hughes Medical Institute - Chevy Chase, MD | Ashburn, Virginia

Project Director, Machine Learning in US Health

@ ideas42.org | Remote, US

Data Science Intern

@ NannyML | Remote

Machine Learning Engineer NLP/Speech

@ Play.ht | Remote

Research Scientist, 3D Reconstruction

@ Yembo | Remote, US

Clinical Assistant or Associate Professor of Management Science and Systems

@ University at Buffalo | Buffalo, NY