paper-with-me

Papers

EfficientMIL: Efficient Linear-Complexity MIL Method for WSI Classification

2025-09-28 · Chengying She, Chengwei Chen, Dongjie Fan, Lizhuang Liu, Chengwei Shao, Yun Bian, Ben Wang, Xinran Zhang arxiv

Whole slide images (WSIs) classification represents a fundamental challenge in computational pathology, where multiple instance learning (MIL) has emerged as the dominant paradigm. Current state-of-the-art (SOTA) MIL methods rely on attention mechanisms, achieving good performance but requiring substantial computational resources due to quadratic complexity when processing hundreds of thousands of patches. To address this computational bottleneck, we introduce EfficientMIL, a novel linear-complexity MIL approach for WSIs classification with the patches selection module Adaptive Patch Selector (APS) that we designed, replacing the quadratic-complexity self-attention mechanisms in Transformer-based MIL methods with efficient sequence models including RNN-based GRU, LSTM, and State Space Model (SSM) Mamba. EfficientMIL achieves significant computational efficiency improvements while outperforming other MIL methods across multiple histopathology datasets. On TCGA-Lung dataset, EfficientMIL-Mamba achieved AUC of 0.976 and accuracy of 0.933, while on CAMELYON16 dataset, EfficientMIL-GRU achieved AUC of 0.990 and accuracy of 0.975, surpassing previous state-of-the-art methods. Extensive experiments demonstrate that APS is also more effective for patches selection than conventional selection strategies.

📄 PDF Abstract BibTeX arXiv:2509.23640

Code (0)

등록된 구현이 없습니다.

Tasks

Multiple Instance LearningComputational Efficiency

Results from the Paper

RankTaskDatasetModelMetrics
#10 Multiple Instance Learning CAMELYON16 EfficientMIL AUC: 0.933
#9 Multiple Instance Learning TCGA EfficientMIL AUC: 0.976

Similar Papers 제목 키워드 기반

A Polylog Pivot Steps Simplex Algorithm for Classification

2012-12-01 · NeurIPS 2012 12 · Elad Hazan, Zohar Karnin

We present a simplex algorithm for linear programming in a linear classification formulation. The paramount complexity parameter in linear classification problems is called the margin. We prove that for margin values of …

ClassificationGeneral Classification

Exploring Complexity Changes in Diseased ECG Signals for Enhanced Classification

2025-09-24 · Camilo Quiceno Quintero, Sandip Varkey George arxiv

The complex dynamics of the heart are reflected in its electrical activity, captured through electrocardiograms (ECGs). In this study we use nonlinear time series analysis to understand how ECG complexity varies with car…

Time Series Analysis

Hash-SVM: Scalable Kernel Machines for Large-Scale Visual Classification

2014-06-01 · CVPR 2014 6 · Yadong Mu, Gang Hua, Wei Fan, Shih-Fu Chang

This paper presents a novel algorithm which uses compact hash bits to greatly improve the efficiency of non-linear kernel SVM in very large scale visual classification problems. Our key idea is to represent each sample w…

ClassificationGeneral Classification

Linear Video Transformer with Feature Fixation

2022-10-15 · Kaiyue Lu, Zexiang Liu, Jianyuan Wang, Weixuan Sun 외

Vision Transformers have achieved impressive performance in video classification, while suffering from the quadratic complexity caused by the Softmax attention mechanism. Some studies alleviate the computational costs by…

Feature ImportanceVideo Classification

Binary Stochastic Representations for Large Multi-class Classification

2019-06-24 · Thomas Gerald, Aurélia Léon, Nicolas Baskiotis, Ludovic Denoyer

Classification with a large number of classes is a key problem in machine learning and corresponds to many real-world applications like tagging of images or textual documents in social networks. If one-vs-all methods usu…

ClassificationGeneral ClassificationMulti-class Classification