Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2108.13637

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2108.13637 (cs)
[Submitted on 31 Aug 2021 (v1) , last revised 2 Nov 2021 (this version, v4)]

Title: When are Deep Networks really better than Decision Forests at small sample sizes, and how?

Title: 深度网络在小样本情况下何时真正优于决策森林,以及如何实现?

Authors:Haoyin Xu, Kaleab A. Kinfu, Will LeVine, Sambit Panda, Jayanta Dey, Michael Ainsworth, Yu-Chung Peng, Madi Kusmanov, Florian Engert, Christopher M. White, Joshua T. Vogelstein, Carey E. Priebe
Abstract: Deep networks and decision forests (such as random forests and gradient boosted trees) are the leading machine learning methods for structured and tabular data, respectively. Many papers have empirically compared large numbers of classifiers on one or two different domains (e.g., on 100 different tabular data settings). However, a careful conceptual and empirical comparison of these two strategies using the most contemporary best practices has yet to be performed. Conceptually, we illustrate that both can be profitably viewed as "partition and vote" schemes. Specifically, the representation space that they both learn is a partitioning of feature space into a union of convex polytopes. For inference, each decides on the basis of votes from the activated nodes. This formulation allows for a unified basic understanding of the relationship between these methods. Empirically, we compare these two strategies on hundreds of tabular data settings, as well as several vision and auditory settings. Our focus is on datasets with at most 10,000 samples, which represent a large fraction of scientific and biomedical datasets. In general, we found forests to excel at tabular and structured data (vision and audition) with small sample sizes, whereas deep nets performed better on structured data with larger sample sizes. This suggests that further gains in both scenarios may be realized via further combining aspects of forests and networks. We will continue revising this technical report in the coming months with updated results.
Abstract: 深度网络和决策森林(如随机森林和梯度提升树)分别是结构化和表格数据的领先机器学习方法。 许多论文在一种或两种不同的领域(例如,在100种不同的表格数据设置上)对大量分类器进行了经验比较。 然而,使用最新的最佳实践对这两种策略进行仔细的概念和实证比较尚未进行。 概念上,我们说明了这两种方法都可以有益地视为“划分和投票”方案。 具体来说,它们学习的表示空间是特征空间的一个划分,由凸多面体的并集组成。 在推理时,每个方法都基于激活节点的投票来决定。 这种表述使得对这些方法之间关系的基本统一理解成为可能。 实证上,我们在数百个表格数据设置以及几个视觉和听觉设置上比较了这两种策略。 我们的重点是样本数最多为10,000的数据集,这些数据集代表了科学和生物医学数据集的很大一部分。 一般来说,我们发现森林在小样本量的表格和结构化数据(视觉和听觉)上表现优异,而深度网络在大样本量的结构化数据上表现更好。 这表明,通过进一步结合森林和网络的各个方面,两种情况下都可能获得进一步的提升。 我们将继续在接下来的几个月内对本技术报告进行修订,并更新结果。
Subjects: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Neurons and Cognition (q-bio.NC); Machine Learning (stat.ML)
Cite as: arXiv:2108.13637 [cs.LG]
  (or arXiv:2108.13637v4 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2108.13637
arXiv-issued DOI via DataCite

Submission history

From: Haoyin Xu [view email]
[v1] Tue, 31 Aug 2021 06:33:17 UTC (534 KB)
[v2] Tue, 28 Sep 2021 18:44:50 UTC (2,054 KB)
[v3] Tue, 5 Oct 2021 17:01:07 UTC (2,054 KB)
[v4] Tue, 2 Nov 2021 21:40:52 UTC (1,990 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
stat.ML
< prev   |   next >
new | recent | 2021-08
Change to browse by:
cs
cs.AI
cs.LG
q-bio
q-bio.NC
stat

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号