Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.02292 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910471983988736 |
|---|---|
| author | Pacheco, Armando J. Cabrera Derr, Rabanus Williamson, Robert C. |
| author_facet | Pacheco, Armando J. Cabrera Derr, Rabanus Williamson, Robert C. |
| contents | Supervised learning has gone beyond the expected risk minimization framework. Central to most of these developments is the introduction of more general aggregation functions for losses incurred by the learner. In this paper, we turn towards online learning under expert advice. Via easily justified assumptions we characterize a set of reasonable loss aggregation functions as quasi-sums. Based upon this insight, we suggest a variant of the Aggregating Algorithm tailored to these more general aggregation functions. This variant inherits most of the nice theoretical properties of the AA, such as recovery of Bayes' updating and a time-independent bound on quasi-sum regret. Finally, we argue that generalized aggregations express the attitude of the learner towards losses. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_02292 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An Axiomatic Approach to Loss Aggregation and an Adapted Aggregating Algorithm Pacheco, Armando J. Cabrera Derr, Rabanus Williamson, Robert C. Machine Learning Supervised learning has gone beyond the expected risk minimization framework. Central to most of these developments is the introduction of more general aggregation functions for losses incurred by the learner. In this paper, we turn towards online learning under expert advice. Via easily justified assumptions we characterize a set of reasonable loss aggregation functions as quasi-sums. Based upon this insight, we suggest a variant of the Aggregating Algorithm tailored to these more general aggregation functions. This variant inherits most of the nice theoretical properties of the AA, such as recovery of Bayes' updating and a time-independent bound on quasi-sum regret. Finally, we argue that generalized aggregations express the attitude of the learner towards losses. |
| title | An Axiomatic Approach to Loss Aggregation and an Adapted Aggregating Algorithm |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2406.02292 |