paper-with-me

Papers

Sparse Coding Driven Deep Decision Tree Ensembles for Nuclear Segmentation in Digital Pathology Images

2020-08-13 · Jie Song, Liang Xiao, Mohsen Molaei, Zhichao Lian

In this paper, we propose an easily trained yet powerful representation learning approach with performance highly competitive to deep neural networks in a digital pathology image segmentation task. The method, called sparse coding driven deep decision tree ensembles that we abbreviate as ScD2TE, provides a new perspective on representation learning. We explore the possibility of stacking several layers based on non-differentiable pairwise modules and generate a densely concatenated architecture holding the characteristics of feature map reuse and end-to-end dense learning. Under this architecture, fast convolutional sparse coding is used to extract multi-level features from the output of each layer. In this way, rich image appearance models together with more contextual information are integrated by learning a series of decision tree ensembles. The appearance and the high-level context features of all the previous layers are seamlessly combined by concatenating them to feed-forward as input, which in turn makes the outputs of subsequent layers more accurate and the whole model efficient to train. Compared with deep neural networks, our proposed ScD2TE does not require back-propagation computation and depends on less hyper-parameters. ScD2TE is able to achieve a fast end-to-end pixel-wise training in a layer-wise manner. We demonstrated the superiority of our segmentation technique by evaluating it on the multi-disease state and multi-organ dataset where consistently higher performances were obtained for comparison against several state-of-the-art deep learning methods such as convolutional neural networks (CNN), fully convolutional networks (FCN), etc.

📄 PDF Abstract BibTeX arXiv:2008.05657

Code (0)

등록된 구현이 없습니다.

Tasks

Image SegmentationNuclear SegmentationRepresentation LearningSemantic Segmentation

Similar Papers 제목 키워드 기반

Fast Sparse Decision Tree Optimization via Reference Ensembles

2021-12-01 · Hayden McTavish, Chudi Zhong, Reto Achermann, Ilias Karimalis 외

Sparse decision tree optimization has been one of the most fundamental problems in AI since its inception and is a challenge at the core of interpretable machine learning. Sparse decision tree optimization is computation…

Interpretable Machine Learning

Data-Aware and Scalable Sensitivity Analysis for Decision Tree Ensembles

2026-02-07 · Namrita Varshney, Ashutosh Gupta, Arhaan Ahmad, Tanay V. Tayal 외 arxiv

Decision tree ensembles are widely used in critical domains, making robustness and sensitivity analysis essential to their trustworthiness. We study the feature sensitivity problem, which asks whether an ensemble is sens…

Boosting-Based Sequential Meta-Tree Ensemble Construction for Improved Decision Trees

2024-02-09 · Ryota Maniwa, Naoki Ichijo, Yuta Nakahara, Toshiyasu Matsushima

A decision tree is one of the most popular approaches in machine learning fields. However, it suffers from the problem of overfitting caused by overly deepened trees. Then, a meta-tree is recently proposed. It solves the…

On Computing Optimal Tree Ensembles

2023-06-07 · Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge

Random forests and, more generally, (decision\nobreakdash-)tree ensembles are widely used methods for classification and regression. Recent algorithmic advances allow to compute decision trees that are optimal for variou…

Quantifying Sensitivity for Tree Ensembles: A symbolic and compositional approach

2026-05-13 · Ajinkya Naik, Chaitanya Garg, S. Akshay, Ashutosh Gupta 외 arxiv

Decision tree ensembles (DTE) are a popular model for a wide range of AI classification tasks, used in multiple safety critical domains, and hence verifying properties on these models has been an active topic of study ov…