Efficient bandit algorithms for online multiclass prediction

No abstract is available for this paper.

• Publication year

  2008

• Venue

  International Conference on Machine Learning

• Publication date

  2008-07-05

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/1390156.1390212
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Epoch-Greedy algorithm for contextual multi-armed bandits

  2007cited by this paper
• A primal-dual perspective of online learning algorithms

  2007cited by this paper
• Online multiclass learning by interclass hypothesis sharing

  2006cited by this paper
• Online convex optimization in the bandit setting

  2005cited by this paper
• Nearly Tight Bounds for the Continuum-Armed Bandit Problem

  2004cited by this paper
• Online convex optimization in the bandit setting: gradient descent without a gradient

  2004influential reference
• Ultraconservative Online Algorithms for Multiclass Problems

  2003cited by this paper
• Online Passive-Aggressive Algorithms

  2003cited by this paper
• A kernel method for multi-labelled classification

  2001cited by this paper
• An algorithmic theory of learning: Robust concepts and random projection

  1999cited by this paper
• Support vector machines for multi-class pattern recognition

  1999cited by this paper
• Large Margin Classification Using the Perceptron Algorithm

  1998cited by this paper
• Statistical learning theory

  1998cited by this paper
• Exponentiated Gradient Versus Gradient Descent for Linear Predictors

  1997cited by this paper
• Gambling in a rigged casino: The adversarial multi-armed bandit problem

  1995cited by this paper
• Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm

  1987cited by this paper
• Pattern classification and scene analysis

  1974cited by this paper
• Pattern classification and scene analysis

  1974cited by this paper
• The perceptron: a probabilistic model for information storage and organization in the brain.

  1958influential reference

• Bandit Neural Architecture Search for Digital Twin Optimisation: A Scientific Machine Learning Approach

  2026cites this paper
• Policy Gradient with Adaptive Entropy Annealing for Continual Fine-Tuning

  2026cites this paper
• Dynamic Trust Calibration Using Contextual Bandits

  2025cites this paper
• Bandit and Delayed Feedback in Online Structured Prediction

  2025cites this paper
• Robust Learning of Multi-index Models via Iterative Subspace Approximation

  2025cites this paper
• Multiclass Classification Using Bayesian Multivariate Adaptive Regression Splines

  2025cites this paper
• A Unified Framework for Bandit Online Multiclass Prediction

  2025influential citation
• Generalized Prediction Set with Bandit Feedback

  2025cites this paper
• From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards

  2025cites this paper
• Statistical Query Hardness of Multiclass Linear Classification with Random Classification Noise

  2025cites this paper
• An energy-efficient spiking neural network with continuous learning for self-adaptive brain-machine interface

  2025cites this paper
• Online-Optimized RAG for Tool Use and Function Calling

  2025cites this paper
• A conversion theorem and minimax optimality for continuum contextual bandits

  2024cites this paper
• Variance-Aware Linear UCB with Deep Representation for Neural Contextual Bandits

  2024cites this paper
• Optimistic Information Directed Sampling

  2024cites this paper
• Fast Rates for Bandit PAC Multiclass Classification

  2024cites this paper
• Efficient Online Set-valued Classification with Bandit Feedback

  2024influential citation
• Online Structured Prediction with Fenchel-Young Losses and Improved Surrogate Regret for Online Multiclass Classification with Logistic Loss

  2024cites this paper
• The Real Price of Bandit Information in Multiclass Classification

  2024cites this paper
• Nearest Neighbour with Bandit Feedback

  2023cites this paper
• Multiclass Online Learnability under Bandit Feedback

  2023cites this paper
• Mixtron: Bandit Online Multiclass Prediction with Implicit Feedback

  2023cites this paper
• Designing Interaction with AI for Human Learning: Towards Human-Machine Teaming in Radiology Training

  2023cites this paper
• Online Learning with Set-Valued Feedback

  2023cites this paper
• Online Learning With Incremental Feature Space and Bandit Feedback

  2023cites this paper
• Partial feedback online transfer learning with multi-source domains

  2022cites this paper
• Adaptive Algorithm for Multi-Armed Bandit Problem with High-Dimensional Covariates

  2022cites this paper
• Active Learning with Label Comparisons

  2022cites this paper
• Delaytron: Efficient Learning of Multiclass Classifiers with Delayed Bandit Feedbacks

  2022cites this paper
• Learning With Bandit Feedback

  2022influential citation
• Online transfer learning with partial feedback

  2022cites this paper
• Truncated LinUCB for Stochastic Linear Bandits

  2022cites this paper
• Multiclass Classification using dilute bandit feedback

  2021influential citation
• Efficient Methods for Online Multiclass Logistic Regression

  2021cites this paper
• Beyond Bandit Feedback in Online Multiclass Classification

  2021influential citation
• Margin-Independent Online Multiclass Learning via Convex Geometry

  2021cites this paper
• Counterfactual Contextual Multi-Armed Bandit: a Real-World Application to Diagnose Apple Diseases

  2021cites this paper
• Counterfactual Contextual Multi-Armed Bandit to Diagnose Post-Harvest Diseases of Apple

  2021cites this paper
• Contextual Bandits

  2020cites this paper
• Bandit Algorithms

  2020cites this paper
• Stochastic Bandits

  2020cites this paper
• The Explore-Then-Commit Algorithm

  2020cites this paper
• Foundations of Information Theory

  2020cites this paper
• Bayesian Bandits

  2020cites this paper
• Asymptotic Lower Bounds for Stochastic Linear Bandits

  2020cites this paper
• Preface

  2020cites this paper
• Pure Exploration

  2020cites this paper
• Minimax Lower Bounds for Stochastic Linear Bandits

  2020cites this paper
• Stochastic Processes and Markov Chains

  2020cites this paper
• Exp3 for Adversarial Linear Bandits

  2020cites this paper
• Exact Passive-Aggressive Algorithms for Multiclass Classification Using Bandit Feedbacks

  2020influential citation
• The Relation between Adversarial and Stochastic Linear Bandits

  2020cites this paper
• Stochastic Linear Bandits with Finitely Many Arms

  2020cites this paper
• Confidence Bounds for Least Squares Estimators

  2020cites this paper
• Instance-Dependent Lower Bounds

  2020cites this paper
• Thompson Sampling

  2020cites this paper
• Introduction

  2020cites this paper
• Contextual User Browsing Bandits for Large-Scale Online Mobile Recommendation

  2020cites this paper
• Exploiting the Surrogate Gap in Online Multiclass Classification

  2020influential citation
• The Upper Confidence Bound Algorithm: Asymptotic Optimality

  2020cites this paper
• Adversarial Linear Bandits

  2020cites this paper
• The Upper Confidence Bound Algorithm

  2020cites this paper
• Stochastic Bandits with Finitely Many Arms

  2020cites this paper
• High-Probability Lower Bounds

  2020cites this paper
• Other Topics

  2020cites this paper
• The Exp3 Algorithm

  2020cites this paper
• Beyond Bandits

  2020cites this paper
• Stochastic Linear Bandits

  2020cites this paper
• Stochastic Linear Bandits with Sparsity

  2020cites this paper
• Lower Bounds: Basic Ideas

  2020cites this paper
• Foundations of Convex Analysis

  2020cites this paper
• The Exp3-IX Algorithm

  2020cites this paper
• Concentration of Measure

  2020cites this paper
• Contextual and Linear Bandits

  2020cites this paper
• Online Decision Making with High-Dimensional Covariates

  2020cites this paper
• Markov Decision Processes

  2020cites this paper
• Combinatorial Bandits

  2020cites this paper
• Bibliography

  2020cites this paper
• Safe Exploration for Optimizing Contextual Bandits

  2020cites this paper
• Lightweight Reinforcement Algorithms for autonomous, scalable intra-cortical Brain Machine Interfaces

  2020cites this paper
• Lower Bounds for Bandits with Finitely Many Arms

  2020cites this paper
• Foundations of Bayesian Learning

  2020cites this paper
• Learning Multiclass Classifier Under Noisy Bandit Feedback

  2020influential citation
• The Upper Confidence Bound Algorithm: Minimax Optimality

  2020cites this paper
• Adversarial Bandits with Finitely Many Arms

  2020cites this paper
• Ranking

  2020cites this paper
• Optimal Design for Least Squares Estimators

  2020cites this paper
• The Upper Confidence Bound Algorithm: Bernoulli Noise

  2020cites this paper
• Foundations of Probability

  2020cites this paper
• Towards Autonomous Intra-cortical Brain Machine Interfaces: Applying Bandit Algorithms for Online Reinforcement Learning

  2020influential citation
• Bandits, Probability and Concentration

  2020cites this paper
• Efficient and Robust Algorithms for Adversarial Linear Contextual Bandits

  2020cites this paper
• Follow-the-regularised-Leader and Mirror Descent

  2020cites this paper
• Non-stationary Bandits

  2020cites this paper
• Learning in high dimensions with asymmetric costs

  2019cites this paper
• Minimax Lower Bounds

  2019cites this paper
• Exploration by Optimisation in Partial Monitoring

  2019cites this paper
• Learning with Vertically-Partitioned Data, Binary Feedback, and Random Parameter Update

  2019cites this paper
• Learning about the learning process: from active querying to fine-tuning

  2019cites this paper
• Neural Contextual Bandits with UCB-based Exploration

  2019cites this paper