4 citations · 8 across the 8 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021★ 1 cited
Universal Online Learning with Bounded Loss: Reduction to Binary Classification
Moïse Blanchard, Romain Cosson
We study universal consistency of non-i.i.d. processes in the context of online learning. A stochastic process is said to admit universal consistency if there exists a learner that…
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…