Chiudi

Aggiungi l'articolo in

Chiudi
Aggiunto

L’articolo è stato aggiunto alla lista dei desideri

Chiudi

Crea nuova lista

Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems - Sebastien Bubeck,Cesa-Bianchi Nicolo - cover
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems - Sebastien Bubeck,Cesa-Bianchi Nicolo - cover
Dati e Statistiche
Wishlist Salvato in 0 liste dei desideri
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Disponibile in 2 settimane
127,70 €
127,70 €
Disp. in 2 settimane
Chiudi
Altri venditori
Prezzo e spese di spedizione
ibs
127,70 € Spedizione gratuita
disponibile in 2 settimane disponibile in 2 settimane
Info
Nuovo
Altri venditori
Prezzo e spese di spedizione
ibs
127,70 € Spedizione gratuita
disponibile in 2 settimane disponibile in 2 settimane
Info
Nuovo
Altri venditori
Prezzo e spese di spedizione
Chiudi

Tutti i formati ed edizioni

Chiudi
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems - Sebastien Bubeck,Cesa-Bianchi Nicolo - cover
Chiudi

Promo attive (0)

Descrizione


A multi-armed bandit problem - or, simply, a bandit problem - is a sequential allocation problem defined by a set of actions. At each time step, a unit resource is allocated to an action and some observable payoff is obtained. The goal is to maximize the total payoff obtained in a sequence of allocations. The name bandit refers to the colloquial term for a slot machine (a ""one-armed bandit"" in American slang). In a casino, a sequential allocation problem is obtained when the player is facing many slot machines at once (a ""multi-armed bandit""), and must repeatedly choose where to insert the next coin. Multi-armed bandit problems are the most basic examples of sequential decision problems with an exploration-exploitation trade-off. This is the balance between staying with the option that gave highest payoffs in the past and exploring new options that might give higher payoffs in the future. Although the study of bandit problems dates back to the 1930s, exploration-exploitation trade-offs arise in several modern applications, such as ad placement, website optimization, and packet routing. Mathematically, a multi-armed bandit is defined by the payoff process associated with each option. In this book, the focus is on two extreme cases in which the analysis of regret is particularly simple and elegant: independent and identically distributed payoffs and adversarial payoffs. Besides the basic setting of finitely many actions, it also analyzes some of the most important variants and extensions, such as the contextual bandit model. This monograph is an ideal reference for students and researchers with an interest in bandit problems.
Leggi di più Leggi di meno

Dettagli

Foundations and Trends (R) in Machine Learning
2012
Paperback / softback
138 p.
Testo in English
234 x 156 mm
205 gr.
9781601986269
Chiudi
Aggiunto

L'articolo è stato aggiunto al carrello

Chiudi

Aggiungi l'articolo in

Chiudi
Aggiunto

L’articolo è stato aggiunto alla lista dei desideri

Chiudi

Crea nuova lista

Chiudi

Chiudi

Siamo spiacenti si è verificato un errore imprevisto, la preghiamo di riprovare.

Chiudi

Verrai avvisato via email sulle novità di Nome Autore