A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Study uses satellite and lidar data to map forest height and biomass in France.
Forest tree species mapped with high accuracy using satellite data.
SLIC-UAV monitors forest recovery using UAVs and machine learning.
Researchers predict butt rot volume using harvester data and remote sensing.
In this study we investigate the potential for using synthetic aperture radar (SAR) data to provide high resolution defoliation and regrowth mapping of trees in the tundra-forest ecotone. Using aerial photographs, four areas with live forest and four areas with dead trees were identified. Quad-polarimetric SAR data fro…
We present an extension to the model-free anomaly detection algorithm, Isolation Forest. This extension, named Extended Isolation Forest (EIF), resolves issues with assignment of anomaly score to given data points. We motivate the problem using heat maps for anomaly scores. These maps suffer from artifacts generated by…
Dealing with uncertainty in Bayesian Network structures using maximum a posteriori (MAP) estimation or Bayesian Model Averaging (BMA) is often intractable due to the superexponential number of possible directed, acyclic graphs. When the prior is decomposable, two classes of graphs where efficient learning can take plac…
We present Neural Random Forest Imitation - a novel approach for transforming random forests into neural networks. Existing methods propose a direct mapping and produce very inefficient architectures. In this work, we introduce an imitation learning approach by generating training data from a random forest and learning…
Chimera state refers to coexistence of coherent and non-coherent phases in identically coupled dynamical units found in various complex dynamical systems. Identification of Chimera, on one hand is essential due to its applicability in various areas including neuroscience, and on other hand is challenging due to its wid…
Label ranking aims to learn a mapping from instances to rankings over a finite number of predefined labels. Random forest is a powerful and one of the most successful general-purpose machine learning algorithms of modern times. In this paper, we present a powerful random forest label ranking method which uses random de…
Mapping forest aboveground biomass (AGB) has become an important task, particularly for the reporting of carbon stocks and changes. AGB can be mapped using synthetic aperture radar data (SAR) or passive optical data. However, these data are insensitive to high AGB levels (\textgreater{}150 Mg/ha, and \textgreater{}300 …
Bayesian learning for forests and trees improves graph detection and structure learning.
Paper proposes a new method for supervised manifold learning using random forest proximities.
Proposes autoencoding with random forests using spectral graph theory.
We propose a novel methodology, forest floor, to visualize and interpret random forest (RF) models. RF is a popular and useful tool for non-linear multi-variate classification and regression, which yields a good trade-off between robustness (low variance) and adaptiveness (low bias). Direct interpretation of a RF model…
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…
Study of wild mapping class groups on complex reflection groups.
iMondrian forest combines isolation forest and Mondrian forest for better anomaly detection.
Tree-based models biased when trained on imbalanced data, requiring new calibration methods.
Ensembles of randomized decision trees, usually referred to as random forests, are widely used for classification and regression tasks in machine learning and statistics. Random forests achieve competitive predictive performance and are computationally efficient to train and test, making them excellent candidates for r…
In Random Forests, proximity distances are a metric representation of data into decision space. By observing how changes in input map to the movement of instances in this space we are able to determine the independent contribution of each feature to the decision-making process. For binary feature vectors, this process …
Paper develops a deforestation detection system using optical and SAR data.
New methods improve tree ensemble models by compressing them while maintaining accuracy.
Exploratory data analysis is crucial for developing and understanding classification models from high-dimensional datasets. We explore the utility of a new unsupervised tree ensemble called uncharted forest for visualizing class associations, sample-sample associations, class heterogeneity, and uninformative classes fo…
New random forest method provides optimal rates and confidence bands.
RFpredInterval package builds prediction intervals for random forests and boosted forests.
We propose random hinge forests, a simple, efficient, and novel variant of decision forests. Importantly, random hinge forests can be readily incorporated as a general component within arbitrary computation graphs that are optimized end-to-end with stochastic gradient descent or variants thereof. We derive random hinge…
Improved random forest proximities capture data geometry.
Deep forests enhance expressiveness exponentially with depth, not width or tree size.
This paper improves forest pruning to balance accuracy and interpretability.
This paper is a comment on the survey paper by Biau and Scornet (2016) about random forests. We focus on the problem of quantifying the impact of each ingredient of random forests on their performance. We show that such a quantification is possible for a simple pure forest , leading to conclusions that could apply more…
Forest-guided smoothing uses random forest outputs for interpretable local smoothers.
In this paper we propose using the principle of boosting to reduce the bias of a random forest prediction in the regression setting. From the original random forest fit we extract the residuals and then fit another random forest to these residuals. We call the sum of these two random forests a \textit{one-step boosted …
First European crop map created using satellite data.
By seeking the narrowest prediction intervals (PIs) that satisfy the specified coverage probability requirements, the recently proposed quality-based PI learning principle can extract high-quality PIs that better summarize the predictive certainty in regression tasks, and has been widely applied to solve many practical…
Improves time series classification with forest proximities.
Random forests reduce bias and variance, especially in low SNR settings.
New random forest variants achieve optimal performance in high dimensions.
Enhances random forest consistency and introduces DMRF for improved performance.
Online random forests improve Q-learning performance in specific gym environments.
New method learns representations for decision forests using input perturbation.
Improved random forest models enhance machine learning predictions.
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…
Method uses aggregate crop statistics to improve satellite-based crop type mapping.
We investigate the effect of the proportional hazards assumption on prognostic and predictive models of the survival time of patients suffering from amyotrophic lateral sclerosis (ALS). We theoretically compare the underlying model formulations of several variants of survival forests and implementations thereof, includ…
Many scientific and engineering challenges -- ranging from personalized medicine to customized marketing recommendations -- require an understanding of treatment effect heterogeneity. In this paper, we develop a non-parametric causal forest for estimating heterogeneous treatment effects that extends Breiman's widely us…
Decision forests, including Random Forests and Gradient Boosting Trees, have recently demonstrated state-of-the-art performance in a variety of machine learning settings. Decision forests are typically ensembles of axis-aligned decision trees; that is, trees that split only along feature dimensions. In contrast, many r…
A fast method for finding counterfactual explanations for decision forests.