2 citations · 2 across the 6 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.LG2024
Bisimulation Metrics are Optimal Transport Distances, and Can be Computed Efficiently
Sergio Calo, Anders Jonsson, Gergely Neu +2
We propose a new framework for formulating optimal transport distances between Markov chains. Previously known formulations studied couplings between the entire joint distribution…
cs.LG2024
Optimistic Information Directed Sampling
Gergely Neu, Matteo Papini, Ludovic Schwartz
We study the problem of online learning in contextual bandit problems where the loss function is assumed to belong to a known parametric function class. We propose a new analytic f…