NIPS Proceedingsβ

Hanna Sumita

3 Papers

  • Improved Regret Bounds for Bandit Combinatorial Optimization (2019)
  • Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback (2019)
  • Regret Bounds for Online Portfolio Selection with a Cardinality Constraint (2018)