Browse State-of-the-Art › Multiple Instance Learning

Multiple Instance Learning

322 papers with code · 5 benchmarks · 13 datasets archive 2025-07-28

Methodology

Multiple Instance Learning is a type of weakly supervised learning algorithm where training data is arranged in bags, where each bag contains a set of instances X= x₁,x₂, …,x_M, and there is one single label Y per bag, Y∈ 0, 1 in the case of a binary classification problem. It is assumed that individual labels y₁, y₂,…, y_M exist for the instances within a bag, but they are unknown during training. In the standard Multiple Instance assumption, a bag is considered negative if all its instances are negative. On the other hand, a bag is positive, if at least one instance in the bag is positive.

Source: Monte-Carlo Sampling applied to Multiple Instance Learning for Histological Image Classification

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

5 leaderboard tables shown for this task, 5 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.

DatasetBest model (first row in archive order)PaperCodeSyntologyCompare
CAMELYON16 (14 rows) Snuffy (DINO Exhaustive) Snuffy: Efficient Whole Slide Image Classifier code — Compare
TCGA (8 rows) DTFD-MIL (AFS) DTFD-MIL: Double-Tier Feature Distillation Multiple Instance... code Syntology ran 2 of 6 samples · 4 unverified Compare
Elephant (2 rows) Snuffy Snuffy: Efficient Whole Slide Image Classifier code — Compare
Musk v1 (2 rows) Snuffy Snuffy: Efficient Whole Slide Image Classifier code — Compare
Musk v2 (2 rows) DSMIL Dual-stream Multiple Instance Learning Network for Whole Slide... code Syntology ran 4 of 6 samples · 2 unverified Compare

Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

13 datasets whose archive record lists this task, ordered by the archive's paper count.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Most implemented papers archive 2025-07-28

30 shown of 322 papers with code (744 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.

Syntology lines on 16 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections