atlas

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

Online Maximization of Non-Decomposable Test and Population Utilities

NeurIPS 2026 · Bandits and online learning › Online convex optimization and games · approach: Online learning with feedback graphs

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Studies online learning for non-decomposable classification metrics (e.g., Jaccard index, F-measure) that are general functions of the confusion matrix, with regret defined on the final empirical metric.

Problem

Classification metrics such as the Jaccard index and F-measure are non-decomposable across instances, so standard online learning with per-instance losses does not directly apply; the learner must make irrevocable sequential predictions and is judged by the final empirical metric.

Approach

Frames the task as online regret minimization on the final confusion-matrix-based metric, covering both the test-time sequence and a population utility; details beyond the abstract are not available.

Experimental setup

Metrics: regret Jaccard index F-measure

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