1 citations · 1 across the 1 of their papers we have counts for
2 papers
stat.ML2022★ 1 cited
Universal Online Learning with Unbounded Losses: Memory Is All You Need
Moise Blanchard, Romain Cosson, Steve Hanneke
We resolve an open problem of Hanneke on the subject of universally consistent online learning with non-i.i.d. processes and unbounded losses. The notion of an optimistically unive…
cs.DS2021
Quantifying Variational Approximation for the Log-Partition Function
Romain Cosson, Devavrat Shah
Variational approximation, such as mean-field (MF) and tree-reweighted (TRW), provide a computationally efficient approximation of the log-partition function for a generic graphica…