← Indietro
EsameEsame completoTesto d’esame

25 10 2023 E T

Esame completo di Online Learning Applications per il corso di Computer Engineering presso Politecnico di Milano. Materiale proveniente dall’archivio storico Studwiz e classificato per la consultazione online.

Online Learning ApplicationsEsame completo

Informazioni sul documento

Cosa trovi in questo materiale

Esame completo di Online Learning Applications per il corso di Computer Engineering presso Politecnico di Milano. Materiale proveniente dall’archivio storico Studwiz e classificato per la consultazione online.

Qualità dell’importazione: il testo è stato estratto direttamente dal documento originale.

Contenuti estratti dal documento

Passaggi rappresentativi riconosciuti nelle diverse parti del materiale. Il testo completo resta presente nella pagina per la ricerca, mentre l’anteprima compatta rende più semplice la lettura.

Pagina 1

Online Learning Applications Mock Exam Date Exam of Online Learning Applications Mock Exam Name: Surname: Student ID: Signature: Instructions: • The total number of points is 16. • The duration of the exam is: 2h00min. • During this exam you are not allowed to use books, notes, and electronic devices. • You are allowed to write the exam either with a pen or a pencil. • You are allowed to withdraw from the exam at any time. • Before you exit the room, you must hand in your exam. Online Learning Applications Mock Exam Date 1. (4 points) Answer the following questions about multi-armed bandits: • Explain the differences between full and bandit feedback • Explain the difference between stochastic and adversarial environments • In an stochastic environment, which algorithm has better performance between UCB1 and EXP3? • In an adversarial environment, which algorithm has better performance between UCB1 and EXP3? Online Learning Applications Mock Exam Date 2. (4 points) Answer the following questions about dynamic pricing: • Describe the properties of a dynamic pricing environment, e.g., the properties of the demand curve and action set • Describe an algorithm for dynamic pricing and its guarantees • How can you exploit information about the buyer (prior to setting the price)? Online Learning Applications Mock Exam Date 3. (4 points) Answer the following questions about truthful auctions: • Describe the second-price auction • Describe the parameters of an auction and which parameters are known to which agents • Describe an algorithm for online bidding in truthful auctions with a single slot Online Learning Applications Mock Exam Date 4. (4 points) Answer the following questions about combinatorial bandits: • Describe the combinatorial bandit framework • Show why the standard…

Anteprima

Prima pagina del documento.

Prima pagina: 25 10 2023 E T