Showing cs.LGShow all
2 papers · 1 filter
cs.LG2026
On the Slow Convergence to Trivial Solutions of Algorithms for Hard Optimization Problems
Ali Hussaini Umar, Jean Barbier, Matthieu Jonckheere +1
Hard combinatorial optimization problems, many of which are NP-hard, present fundamental algorithmic challenges. Average-case analysis on random instances has emerged as a powerful…
cs.LG2023
Policy Optimization via Adv2: Adversarial Learning on Advantage Functions
Matthieu Jonckheere, Chiara Mignacco, Gilles Stoltz
We revisit the reduction of learning in adversarial Markov decision processes [MDPs] to adversarial learning based on --values; this reduction has been considered in a number of…