ForestPrune: Compact Depth-Controlled Tree Ensembles

No abstract is available for this paper.

• Publication year

  2022

• Venue

  arXiv.org

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers
  DOI 10.48550/arXiv.2206.00128
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Sparse regression at scale: branch-and-bound rooted in first-order optimization

  2020cited by this paper
• Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithms

  2018cited by this paper
• Sparse high-dimensional regression: Exact scalable algorithms and phase transitions

  2017cited by this paper
• Post-Learning Optimization of Tree Ensembles for Efficient Ranking

  2016cited by this paper
• Numba: a LLVM-based Python JIT compiler

  2015cited by this paper
• Best Subset Selection via a Modern Optimization Lens

  2015cited by this paper
• Coordinate descent algorithms

  2015cited by this paper
• OpenML: networked science in machine learning

  2014cited by this paper
• Integer and Combinatorial Optimization

  2013cited by this paper
• L1-based compression of random forest models

  2012cited by this paper
• Scikit-learn: Machine Learning in Python

  2011cited by this paper
• Regularization Paths for Generalized Linear Models via Coordinate Descent.

  2010cited by this paper
• An Analysis of Ensemble Pruning Techniques Based on Ordered Aggregation

  2009cited by this paper
• Importance Sampled Learning Ensembles

  2003cited by this paper
• Stochastic gradient boosting

  2002cited by this paper
• Random Forests

  2001cited by this paper
• Greedy function approximation: A gradient boosting machine.

  2001cited by this paper
• Ridge Regression: Biased Estimation for Nonorthogonal Problems

  2000cited by this paper
• An Empirical Evaluation of Bagging and Boosting

  1997cited by this paper

• No citing papers are available for this paper.