NIPS Proceedingsβ

Satyen Kale

8 Papers

  • Hardness of Online Sleeping Combinatorial Optimization Problems (2016)
  • Online Gradient Boosting (2015)
  • Adaptive Market Making via Online Learning (2013)
  • Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction (2011)
  • Non-Stochastic Bandit Slate Problems (2010)
  • Beyond Convexity: Online Submodular Minimization (2009)
  • On Stochastic and Worst-case Models for Investing (2009)
  • Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria (2007)