Tasuku Soma · SlidesLive

Multinomial Logit Contextual Bandits: Provable Optimality and Practicality

Condorcet Relaxation In Spatial Voting

Multinomial Logit Contextual Bandits: Provable Optimality and Practicality

Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent

Improving Causal Discovery By Optimal Bayesian Network Learning

Yuichi Yoshida · SlidesLive

On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems

Improving Causal Discovery By Optimal Bayesian Network Learning

Regret Bounds for Batched Bandits

Improving Causal Discovery By Optimal Bayesian Network Learning

Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent

On Online Optimization: Dynamic Regret Analysis of Strongly Convex and Smooth Problems