NIPS Proceedingsβ

Mehryar Mohri

23 Papers

  • Boosting with Abstention (2016)
  • Optimistic Bandit Convex Optimization (2016)
  • Structured Prediction Theory Based on Factor Graph Complexity (2016)
  • Learning Theory and Algorithms for Forecasting Non-stationary Time Series (2015)
  • Revenue Optimization against Strategic Buyers (2015)
  • Conditional Swap Regret and Conditional Correlated Equilibrium (2014)
  • Multi-Class Deep Boosting (2014)
  • Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers (2014)
  • Learning Kernels Using Local Rademacher Complexity (2013)
  • Accuracy at the Top (2012)
  • Spectral Learning of General Weighted Automata via Constrained Matrix Completion (2012)
  • Learning Bounds for Importance Weighting (2010)
  • Efficient Large-Scale Distributed Training of Conditional Maximum Entropy Models (2009)
  • Ensemble Nystrom Method (2009)
  • Learning Non-Linear Combinations of Kernels (2009)
  • Polynomial Semantic Indexing (2009)
  • Domain Adaptation with Multiple Sources (2008)
  • Rademacher Complexity Bounds for Non-I.I.D. Processes (2008)
  • Stability Bounds for Non-i.i.d. Processes (2007)
  • On Transductive Regression (2006)
  • Confidence Intervals for the Area Under the ROC Curve (2004)
  • AUC Optimization vs. Error Rate Minimization (2003)
  • Rational Kernels (2002)