Skip to content
No description, website, or topics provided.
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
ICML-camera-ready
ICML-submission
arxiv
draft
poster-and-slides
.gitignore
README.md
adaptivity.bib
banditron.pdf
header.tex
main.tex
nips_2017.sty
ptf_margin.tex

README.md

Separable Bandit Classification

This repository contains source files of the paper titled Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case authored by Alina Beygelzimer, Dávid Pál, Balázs Szörényi, Devanathan Thiruvenkatachari, Chen-Yu Wei and Chicheng Zhang. The paper was accepted at ICML 2019.

Bandit multiclass classification is a problem where in each round an algorithm receives a feature vector and it needs to predict one of K classes, after which it receives binary feedback whether or not the class was correct. We design efficient algorithms under the assumption that data are linearly separable.

You can’t perform that action at this time.