Showing cs.ITShow all
3 papers · 1 filter
cs.IT2026
A Layered Simplex Architecture for Large Alphabets
Meir Feder, Yaniv Fogel, Ruediger Urbanke
Probability estimation over large alphabets under log loss is a well-studied problem, with celebrated methods such as the Good-Turing estimator. We introduce and study a new Bayesi…
cs.IT2026
Misspecified Universal Learning
Shlomi Vituri, Meir Feder
This paper addresses the problem of universal learning under model misspecification with log-loss. In this setting, the learner operates with a hypothesis class of models denoted b…
cs.IT2025
Leave-One-Out Learning with Log-Loss
Yaniv Fogel, Meir Feder
We study batch learning with log-loss in the individual setting, where the outcome sequence is deterministic. Because empirical statistics are not directly applicable in this regim…