NIPS Proceedingsβ

Ken-Ichi Kawarabayashi

4 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)
  • Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation (2017)