4 papers · 1 filter
GAE Falls Short in Imperfect-Information Self-Play Reinforcement Learning
Zhiyuan Fan, Gabriele Farina
Competitive multi-agent reinforcement learning in imperfect-information games requires agents to act under partial observability and against adversarial opponents, necessitating st…
Defensive Generation
Gabriele Farina, Juan Carlos Perdomo
We study the problem of efficiently producing, in an online fashion, generative models of scalar, multiclass, and vector-valued outcomes that cannot be falsified on the basis of th…
On the Universal Near Optimality of Hedge in Combinatorial Settings
Zhiyuan Fan, Arnab Maiti, Kevin Jamieson +2
In this paper, we study the classical Hedge algorithm in combinatorial settings. In each round, the learner selects a vector from a set ,…
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
Arnab Maiti, Zhiyuan Fan, Kevin Jamieson +2
In this paper, we study the online shortest path problem in directed acyclic graphs (DAGs) under bandit feedback against an adaptive adversary. Given a DAG with a sour…