paper-with-me

홈 › Papers

Ensemble of Weak Spectral Total Variation Learners: a PET-CT Case Study

2025-07-11 · Anna Rosenberg, John Kennedy, Zohar Keidar, Yehoshua Y. Zeevi, Guy Gilboa arxiv

Solving computer vision problems through machine learning, one often encounters lack of sufficient training data. To mitigate this we propose the use of ensembles of weak learners based on spectral total-variation (STV) features (Gilboa 2014). The features are related to nonlinear eigenfunctions of the total-variation subgradient and can characterize well textures at various scales. It was shown (Burger et-al 2016) that, in the one-dimensional case, orthogonal features are generated, whereas in two-dimensions the features are empirically lowly correlated. Ensemble learning theory advocates the use of lowly correlated weak learners. We thus propose here to design ensembles using learners based on STV features. To show the effectiveness of this paradigm we examine a hard real-world medical imaging problem: the predictive value of computed tomography (CT) data for high uptake in positron emission tomography (PET) for patients suspected of skeletal metastases. The database consists of 457 scans with 1524 unique pairs of registered CT and PET slices. Our approach is compared to deep-learning methods and to Radiomics features, showing STV learners perform best (AUC=0.87), compared to neural nets (AUC=0.75) and Radiomics (AUC=0.79). We observe that fine STV scales in CT images are especially indicative for the presence of high uptake in PET.

📄 PDF Abstract BibTeX arXiv:2507.08735

Code (0)

등록된 구현이 없습니다.

Tasks

Ensemble Learning

Similar Papers 제목 키워드 기반

Combination of Weak Learners eXplanations to Improve Random Forest eXplicability Robustness

2024-02-29 · Riccardo Pala, Esteban García-Cuesta

The notion of robustness in XAI refers to the observed variations in the explanation of the prediction of a learned model with respect to changes in the input leading to that prediction. Intuitively, if the input being e…

Prediction

ProBoost: a Boosting Method for Probabilistic Classifiers

2022-09-04 · Fábio Mendonça, Sheikh Shanawaz Mostafa, Fernando Morgado-Dias, Antonio G. Ravelo-García 외

ProBoost, a new boosting algorithm for probabilistic classifiers, is proposed in this work. This algorithm uses the epistemic uncertainty of each training sample to determine the most challenging/uncertain ones; the rele…

SpecificityVariational Inference

Neural Ensemble Search for Uncertainty Estimation and Dataset Shift

2020-06-15 · NeurIPS 2021 12 · Sheheryar Zaidi, Arber Zela, Thomas Elsken, Chris Holmes 외

Ensembles of neural networks achieve superior performance compared to stand-alone networks in terms of accuracy, uncertainty calibration and robustness to dataset shift. \emph{Deep ensembles}, a state-of-the-art method f…

AutoMLDiversityImage ClassificationNeural Architecture Search

LIBRE: Learning Interpretable Boolean Rule Ensembles

2019-11-15 · Graziano Mita, Paolo Papotti, Maurizio Filippone, Pietro Michiardi

We present a novel method - LIBRE - to learn an interpretable classifier, which materializes as a set of Boolean rules. LIBRE uses an ensemble of bottom-up weak learners operating on a random subset of features, which al…

Aggregated f-average Neural Network for Interpretable Ensembling

2023-10-09 · Mathieu Vu, Emilie Chouzenoux, Jean-Christophe Pesquet, Ismail Ben Ayed

Ensemble learning leverages multiple models (i.e., weak learners) on a common machine learning task to enhance prediction performance. Basic ensembling approaches average the weak learners outputs, while more sophisticat…

class-incremental learningClass Incremental LearningEnsemble LearningFew-Shot Class-Incremental Learning+2