Enhances random forest consistency and introduces DMRF for improved performance.
problem Improving the consistency and efficiency of random forest algorithms.
method Strengthened proof methods and propose DMRF algorithm.
result DMRF achieves better theoretical and experimental performance than previous variants.
Deep forests enhance expressiveness exponentially with depth, not width or tree size.
problem Understanding the role of depth, width, and tree size in deep forest performance.
method Provided upper and lower bounds on deep forest approximation complexity.
result Depth exponentially enhances deep forest expressiveness.
We improve random forest consistency and performance with DMRF, a new variant.
problem Improving the consistency and performance of random forest models.
method Developed DMRF, a data-driven multinomial random forest, by modifying proof methods and improving data utilization.
result DMRF achieves strong consistency with probability 1, surpassing previous models in classification tasks.
Machine learning identifies chimera states in complex dynamical systems.
problem Chimera states are hard to identify due to their varied appearance and peculiar nature.
method Machine learning techniques, specifically random forest and oblique random forest with null space regularization.
result High accuracy in identifying chimera states across different dynamical models.
Mondrian random forests improve statistical inference for regression.
problem Improving statistical inference for regression functions.
method Combining bias and variance characterizations with debiasing and variance estimation.
result Valid statistical inference methods for unknown regression functions with error bounds.
Study models forest transitions with deep learning for parameter estimation.
problem Complex dynamics of forest, agricultural, and abandoned lands.
method Developed a stochastic differential equation model and used deep learning for parameter estimation.
result Deep learning approach estimates model parameters from time-series data.
Paper proposes a new financial fraud detection system using improved RF and GBM.
problem Detecting financial fraud with high accuracy and efficiency.
method Introduces GBM-SSRF, a novel model combining GBM and SSRF.
result GBM-SSRF model outperforms traditional methods in fraud detection.
We introduce an exact distributed algorithm to train Random Forest models as well as other decision forest models without relying on approximating best split search. We explain the proposed algorithm and compare it to related approaches for various complexity measures (time, ram, disk, and network complexity analysis).…
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estimation, we do not assume the true distribution corresponds to a forest; rather, we form kernel density estimates of the bivariate and univaria…
Introduced by Breiman, Random Forests are widely used classification and regression algorithms. While being initially designed as batch algorithms, several variants have been proposed to handle online learning. One particular instance of such forests is the \emph{Mondrian Forest}, whose trees are built using the so-cal…
Simplifies random forests by breaking down trees into rules for better interpretability.
problem Balancing model complexity and accuracy in random forests.
method Breaking down random forest trees into individual classification rules and selecting a subset.
result A few selected rules can achieve acceptable accuracy similar to the original model, leading to simpler models.
Study uses SAR data to map defoliation and regrowth in tundra-forest areas.
problem Mapping defoliation and regrowth in tundra-forest areas using SAR data.
method Novel guided nonlocal means speckle filtering of polarimetric covariance matrix.
result Over 99.7% classification accuracy in defoliation and regrowth mapping.
Random forests perform bootstrap-aggregation by sampling the training samples with replacement. This enables the evaluation of out-of-bag error which serves as a internal cross-validation mechanism. Our motivation lies in using the unsampled training samples to improve each decision tree in the ensemble. We study the e…
New random forest algorithm improves regression with missing data.
problem Regression with missing data values.
method New random forest algorithm compared to existing techniques.
result Improved performance in quadratic errors and bias compared to existing methods.
This paper describes structuring data and constructing plots to explore forest classification models interactively. A forest classifier is an example of an ensemble, produced by bagging multiple trees. The process of bagging and combining results from multiple trees, produces numerous diagnostics which, with interactiv…
Approximate Bayesian computation (ABC) methods provide an elaborate approach to Bayesian inference on complex models, including model choice. Both theoretical arguments and simulation experiments indicate, however, that model posterior probabilities may be poorly evaluated by standard ABC techniques. We propose a novel…
Proposes methods to improve interpretability of Isolation Forest for anomaly detection.
problem Lack of interpretability in Isolation Forest.
method Defines feature importance scores and unsupervised feature selection methods.
result Improves interpretability of Isolation Forest for anomaly detection.
Develops a new random forest method for clustered data with improved prediction and inference.
problem Improving prediction and inference accuracy for clustered data with within-cluster dependence.
method Clustered Random Forests, using weighted least squares estimators for leaf predictions.
result Optimal prediction and inference weights vary under covariate shift, necessitating user-chosen weights.
New Random Forest variants estimate heterogeneous treatment effects using Wasserstein distances.
problem Estimating heterogeneous treatment effects in complex situations.
method Proposes natural variants of Random Forests using Wasserstein distances.
result Natural variants of Random Forests are well-suited for estimating conditional distributions.
Proposes a new random forest weighted local Fréchet regression method.
problem Complex metric space valued responses and curse of dimensionality in Fréchet regression.
method Locally adaptive kernel generated by random forests for local average and local linear Fréchet regression.
result Significantly improves existing Fréchet regression methods with theoretical guarantees.
Random forest (Leo Breiman 2001a) (RF) is a non-parametric statistical method requiring no distributional assumptions on covariate relation to the response. RF is a robust, nonlinear technique that optimizes predictive accuracy by fitting an ensemble of trees to stabilize model estimates. Random survival forests (RSF) …
This paper explains CART random forests using stochastic control theory.
problem Understanding the inner workings of CART random forests.
method Developed a stochastic-control perspective on CART random forests, interpreting feature subsampling as a random feasible action set and the split rule as a policy.
result Established that the CART policy is locally stabilizing but globally suboptimal for the forest objective.
SDRF estimates complex survey designs for conditional distributions.
problem Estimating conditional distributions under complex survey designs.
method Survey-calibrated distributional random forest (SDRF) with pseudo-population bootstrap and MMD split criterion.
result Established design consistency and model consistency for survey designs.
A new method, Multi-Label Deep Forest, tackles multi-label learning problems.
problem Leveraging label correlations in multi-label learning models.
method Designs a deep forest framework with two mechanisms: measure-aware feature reuse and measure-aware layer growth.
result Outperforms compared methods on six measures across benchmark datasets.
Random forests use randomness to improve model performance in noisy data.
problem Improving model performance in low signal-to-noise ratio settings.
method Demonstrates that randomness in random forests acts as implicit regularization, similar to shrinkage penalties in regularized regression.
result Random forests achieve strong performance by implicitly regularizing model complexity, especially in noisy data.
Random forests are a statistical learning method widely used in many areas of scientific research because of its ability to learn complex relationships between input and output variables and also its capacity to handle high-dimensional data. However, current random forest approaches are not flexible enough to handle he…
GCQRF predicts survival quantiles without linearity assumptions.
problem Survival analysis with right censoring and nonlinearity.
method Global Censored Quantile Random Forest (GCQRF) for complex relationships.
result GCQRF outperforms existing methods in predictive accuracy.
There is a large literature explaining why AdaBoost is a successful classifier. The literature on AdaBoost focuses on classifier margins and boosting's interpretation as the optimization of an exponential likelihood function. These existing explanations, however, have been pointed out to be incomplete. A random forest …
OPFython simplifies Optimum-Path Forest for Python users.
problem Lack of diversity and complexity in conventional classification algorithms.
method Develops a Python-based Optimum-Path Forest framework.
result OPFython provides a more friendly and faster prototyping environment.
New inequalities for learning from graph-dependent data with stability bounds.
problem Learning from dependent data with graph dependency.
method Proved McDiarmid-type concentration inequalities for graph-dependent variables, showed concentration relies on forest complexity.
result Proved stability bounds for learning from graph-dependent data.
OMERF extends random forest for hierarchical data and ordinal responses.
problem Analyzing hierarchical data and ordinal responses using tree-based methods.
method Ordinal Mixed-Effects Random Forest (OMERF) that preserves flexibility and hierarchical structure.
result OMERF identifies discriminating student characteristics and estimates school effects.
Random Forests [Breiman:2001] (RF) are a fully non-parametric statistical method requiring no distributional assumptions on covariate relation to the response. RF are a robust, nonlinear technique that optimizes predictive accuracy by fitting an ensemble of trees to stabilize model estimates. The randomForestSRC packag…
Paper introduces a novel method for dynamic covariance estimation with random forests.
problem Estimating high-dimensional dynamic covariance matrices with multiple covariates.
method Nonparametric approach using random forests.
result Uniform consistency theory and error rates established for high-dimensional scenarios.
Two complexes share a common covering but not a finite one.
problem Common covering of complexes with specific properties.
method Constructing CW-complexes K and L with a common covering.
result K is homeomorphic to a complex with a single 2-cell.
FuBIF enhances AD by using real-valued functions for more flexible anomaly detection.
problem Limitations of the Isolation Forest in adaptability and bias.
method Introduces FuBIF, a generalization of IF using real-valued functions for branching in evaluation trees.
result FuBIF significantly improves flexibility and evaluation tree construction.
Study rare-event simulation for neural networks and random forests.
problem Safety evaluation and robustness quantification of machine learning models.
method Importance sampling scheme integrating large deviations and sequential mixed integer programming.
result Efficiency guarantees and numerical demonstrations for various neural network architectures.
SHAKE-GNN scales GNNs for large graphs with multi-scale representations.
problem Scaling Graph Neural Networks (GNNs) to large graphs.
method SHAKE-GNN uses a hierarchy of Kirchhoff Forests for stochastic multi-resolution graph decompositions.
result SHAKE-GNN achieves competitive performance on large-scale graph classification benchmarks.
AugBagg improves random forest accuracy with added noise variables.
problem Improving model accuracy with random forest.
method AugBagg procedure using additional noise variables.
result Out-of-sample predictive accuracy improved with AugBagg.
FedForest adapts RF for federated learning, improving performance and efficiency.
problem Adapting RF for federated learning with heterogeneous data.
method FedForest uses a novel splitting procedure to aggregate client statistics, allowing non-parametric personalization.
result FedForest's federated RF achieves performance close to centralized models while being communication-efficient.
iMondrian forest combines isolation forest and Mondrian forest for better anomaly detection.
problem Anomaly detection in batch and online settings.
method Hybrid of isolation forest and Mondrian forest, using depth in Mondrian forest structure.
result iMondrian forest outperforms existing methods in batch and online settings.
Proposes modifications to model-based forests for HTE estimation in observational data.
problem Estimating heterogeneous treatment effects in observational studies with complex outcomes.
method Orthogonalization strategy from Robinson (1988) applied to model-based forests.
result The orthogonalization strategy reduces confounding effects in simulated studies.
This paper improves deep forest models with soft routing and topology learning.
problem Expensive computational costs and lack of interpretability in deep neural networks.
method Soft routing in probabilistic trees and topology learning for joint optimization.
result Empowered deep forests achieve better performance with reduced model complexity.
Paper introduces a new, tractable measure of model complexity.
problem Need for a reliable measure of model complexity.
method Mathematically rigorous measure based on gradient similarities.
result Generalizes to various model types and insights into double descent.
A new random forest algorithm uncovers feature interdependencies better than traditional methods.
problem Tackles the sub-optimality of greedy decision tree implementations in random forests.
method Presented a 'stepwise lookahead' variation of random forests that considers multiple split nodes simultaneously.
result Significantly outperforms greedy random forests in uncovering feature interdependencies, especially in high-noise environments.
Develops new algorithms for QRF to handle mixed-frequency and longitudinal data.
problem Handling mixed-frequency and longitudinal data in quantile regression.
method Mixed-Frequency Quantile Regression Forest (MIDAS-QRF) and Finite Mixture Quantile Regression Forest (FM-QRF).
result Valid and flexible models for complex empirical settings in financial risk management and climate-change impact evaluation.
A new feature selection method using random forest and Kolmogorov filter.
problem Ultra-high dimensional data feature selection.
method Fused Kolmogorov filter with random forest based recursive feature elimination.
result Selection and L2 consistency under weak conditions. The paper describes the structure of injective LOT-complexes and proves they are aspherical.
problem The unresolved asphericity question for labeled oriented trees encoding spines of ribbon discs.
method Complete description of the link of a reduced injective LOT complex, proving asphericity.
result Reduced injective LOT complexes are aspherical, with specific conditions for non-boundary sub-LOTs.
Paper introduces a medoid-based approach for efficient Fréchet regression.
problem Regression in metric spaces with random objects.
method Adapted random forest algorithm with medoid-based splitting rule.
result Asymptotic equivalence and consistency of the regression estimator.