Skip to content
onsuggest
Log in
Article en

On the Computational Tractability of Robust Bandits

Source: LessWrong ·

Vanessa Kosoy and I recently uploaded a new paper to arXiv. In this post, I briefly describe what the paper does, and attempt to explain in a self-contained way why this is a useful thing to do for ASI alignment. For a more complete background, see several previous articles . The technical contribution of the paper is two-fold. First, we identify a class of instances of the robust bandits problem that can be learned both statistically and computationally efficiently. Previous work on the problem had only identified a class that was statistically tractable. Second, we show that most ways to gen

What is On the Computational Tractability of Robust Bandits?

On the Computational Tractability of Robust Bandits is a article discovery curated from LessWrong. Vanessa Kosoy and I recently uploaded a new paper to arXiv. In this post, I briefly describe what the paper does, and attempt to explain in a self-contained way why this is a…

How can I access or experience this?

You can experience this content directly on its original host (LessWrong) by clicking the "Open Original" button.

Where does this content come from?

Curated from LessWrong by the OnSuggest team to surface the most interesting and serendipitous content on the web.

Keyboard shortcuts

Previous discovery
←P
Next discovery
→N
Like
L
Not for me
X
Save
S
Show this help
?
Close
Esc

Shortcuts work on the discovery page.