A Reduction of Imitation Learning and Structured Prediction to No-Regret Online Learning
Pourquoi ce travail est-il dans la base ?
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Aucune affiliation canadienne. Une base fondée sur la seule affiliation (le devis habituel) n'aurait jamais vu ce travail. C'est l'un des travaux qui justifient l'inversion de la base.
Résumé
Sequential prediction problems such as imitation learning, where future observations depend on previous predictions (actions), violate the common i.i.d. assumptions made in statistical learning. This leads to poor performance in theory and often in practice. Some recent approaches provide stronger guarantees in this setting, but remain somewhat unsatisfactory as they train either non-stationary or stochastic policies and require a large number of iterations. In this paper, we propose a new iterative algorithm, which trains a stationary deterministic policy, that can be seen as a no regret algorithm in an online learning setting. We show that any such no regret algorithm, combined with additional reduction assumptions, must find a policy with good performance under the distribution of observations it induces in such sequential settings. We demonstrate that this new approach outperforms previous approaches on two challenging imitation learning problems and a benchmark sequence labeling problem.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
La notice
- Revue
- arXiv (Cornell University)
- Thématique
- Advanced Bandit Algorithms Research
- Domaine
- Decision Sciences
- Établissements canadiens
- —
- Organismes subventionnaires
- Natural Sciences and Engineering Research Council of CanadaOffice of Naval ResearchMultidisciplinary University Research Initiative
- Mots-clés
- RegretComputer scienceBenchmark (surveying)Artificial intelligenceImitationOnline learningReduction (mathematics)Machine learningSequence (biology)Iterative learning controlOnline machine learningConvergence (economics)Mathematical optimizationActive learning (machine learning)MathematicsEconomicsPsychology
- Résumé présent dans OpenAlex
- oui