AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

A Framework of Online Learning with Imbalanced Streaming Data

Yan Yan, Tianbao Yang, Yi Yang, Jianhui Chen

AAAI 2017 · Bandits and online learning › Online convex optimization and games · approach: Online learning with feedback graphs · 27 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
learn multiple cost-sensitive classifiers and sample among them by performance (OMCSL) instead of fixed or ad-hoc costsOMCSL · covtype1v5, w8a, aloi-1online F-measure, AUROC, AUPRCImproved
compare OMCSL against methods that directly optimize the target measure (OFO, OPAUC)OMCSL · covtype1v5, w8a, aloi-1F-measure, AUROCNo clear effect
increase class imbalance (lower positive-to-negative ratio)OMCSL advantage over baselines · three imbalanced datasetsonline performance gapMixed
use logistic loss instead of hinge loss for the base learnersOMCSL, OCS1, OCS2 · covtype1v5, w8a, aloi-1online performanceNo clear effect
let OMCSL select cost adaptively instead of grid searching c+ over 0.55 to 0.95OMCSL · covtype1v5, w8a, aloi-1absolute error of estimated best c+Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy