scientific article; zbMATH DE number 6860808

zbMath1435.68255arXiv1608.06408MaRDI QIDQ4637020

Sougata Chaudhuri, Ambuj Tewari

Publication date: 17 April 2018

Full work available at URL: https://arxiv.org/abs/1608.06408

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

learning theoryonline learninglearning to rankpartial monitoringonline bandits

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probabilistic games; gambling (91A60) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Scalable Collaborative Ranking for Personalized Prediction

Uses Software

• SVMstruct

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calibration and regret bounds for order-preserving surrogate losses in learning to rank
• The asymptotics of ranking algorithms
• Efficient algorithms for online decision problems
• Test Collection Based Evaluation of Information Retrieval Systems
• Partial Monitoring with Side Information
• Learning to Rank for Information Retrieval
• Statistical Analysis of Bayes Optimal Subset Ranking
• Partial Monitoring—Classification, Regret Bounds, and Algorithms
• Subset Ranking Using Regression
• Regret Minimization Under Partial Monitoring
• Convexity, Classification, and Risk Bounds

This page was built for publication: