z-logo
open-access-imgOpen Access
First-order regret bounds for combinatorial semi-bandits
Author(s) -
Neu, Gergely
Publication year - 2015
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
Subject(s) - regret , order (exchange) , computer science , mathematical optimization , mathematical economics , operations research , mathematics , machine learning , economics , finance

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here