Research
On-device research index

arXiv research

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.

168,695 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · May 199319922001200920172026
48 results for conditional forest

The paper develops a theory for random forests, separating variance components and providing methods for estimating prediction intervals.

problem Understanding the variance and uncertainty in random forest predictions.
method Design-based theory, Monte Carlo averaging, PASR resampling.
result The floor of prediction uncertainty is positive and persists even without observation overlap, providing conservative prediction intervals.

New methods estimate survival functions with time-varying covariates.

problem Estimating survival functions with time-varying covariates.
method Generalized conditional inference and relative risk forests, adapted transformation forest.
result Proposed methods outperform traditional models in estimating survival functions.

The paper uses regression trees/random forests to price Bermudan options more efficiently.

problem Pricing Bermudan options with conditional expectation estimation.
method Estimates conditional expectations using regression trees or random forests instead of traditional regression methods.
result Regression trees/random forests provide better results in high dimensions.

Random forests is a common non-parametric regression technique which performs well for mixed-type data and irrelevant covariates, while being robust to monotonic variable transformations. Existing random forest implementations target regression or classification. We introduce the RFCDE package for fitting random forest…

2018-04-16abs ↗pdf ↗

DRF improves confidence and uncertainty assessment for multivariate conditional distributions.

problem Estimating multivariate conditional distributions with confidence and uncertainty.
method Developed a bootstrap approximation of the asymptotic distribution of DRF to derive inferential tools.
result Asymptotic coverage guarantees for confidence regions and hypothesis testing.

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.

Quantile regression using random forest proximities improves prediction and uncertainty quantification.

problem Forecasting corporate bond volume with uncertainty quantification.
method Introduced a novel approach to compute quantile regressions from random forests using proximity metrics.
result Superior performance in approximating conditional target distributions and prediction intervals.

Theoretical study of random forests for nonlinear time series.

problem Theoretical justification for using random forests in time series modeling.
method Uniform concentration inequality for regression trees and random forests consistency proof.
result Consistency of random forests for nonlinear autoregressive processes.

Regression models for supervised learning problems with a continuous target are commonly understood as models for the conditional mean of the target given predictors. This notion is simple and therefore appealing for interpretation and visualisation. Information about the whole underlying conditional distribution is, h…

2017-01-09abs ↗pdf ↗

We introduce a unified framework for random forest prediction error estimation based on a novel estimator of the conditional prediction error distribution function. Our framework enables simple plug-in estimation of key prediction uncertainty metrics, including conditional mean squared prediction errors, conditional bi…

2019-12-16abs ↗pdf ↗

A new imputation method MissARF uses adversarial random forests for fast and accurate missing value imputation.

problem Handling missing values in biostatistical analyses.
method Adversarial Random Forests (ARF) for density estimation and data synthesis.
result MissARF performs comparably to state-of-the-art methods in imputation quality and runtime.

A new variable importance measure for DRFs detects broader impacts on output distributions.

problem Estimating full conditional distributions of multivariate outputs given inputs.
method Based on the drop and relearn principle and MMD distance.
result Consistent and high-performing variable importance measure for DRFs.

Random forests have proven to be reliable predictive algorithms in many application areas. Not much is known, however, about the statistical properties of random forests. Several authors have established conditions under which their predictions are consistent, but these results do not provide practical estimates of ran…

2014-05-02abs ↗pdf ↗

A new method estimates conditional canonical correlations using random forests.

problem Estimating relationships between two sets of variables given covariates.
method Random Forest with Canonical Correlation Analysis (RFCCA)
result RFCCA provides accurate canonical correlation estimations and well-controlled Type-1 error.

We propose an algorithm named best-scored random forest for binary classification problems. The terminology "best-scored" means to select the one with the best empirical performance out of a certain number of purely random tree candidates as each single tree in the forest. In this way, the resulting forest can be more …

2019-05-27abs ↗pdf ↗

New algorithm combines Geostatistics and Quantile Random Forests for non-stationary spatial modelling.

problem Non-stationary spatial modelling with multiple secondary variables.
method Combines Geostatistics and Quantile Random Forests to estimate conditional distributions and simulate spatial data.
result Consistent results similar to geostatistical and Quantile Random Forests, allowing for embedding simpler interpolation techniques.

Random forests are a powerful method for non-parametric regression, but are limited in their ability to fit smooth signals, and can show poor predictive performance in the presence of strong, smooth effects. Taking the perspective of random forests as an adaptive kernel method, we pair the forest kernel with a local li…

2018-07-30abs ↗pdf ↗

Enhances random forest performance with exogenous randomness.

problem Improving random forest performance through exogenous randomness.
method Developed non-asymptotic MSE expansions for individual trees and forests, identified two types of randomness, and conducted simulations.
result Exogenous randomness, particularly feature subsampling, reduces both bias and variance of random forests.

The infinitesimal jackknife (IJ) has recently been applied to the random forest to estimate its prediction variance. These theorems were verified under a traditional random forest framework which uses classification and regression trees (CART) and bootstrap resampling. However, random forests using conditional inferenc…

2017-06-19abs ↗pdf ↗

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.

TQF models multivariate uncertainty by learning conditional quantiles.

problem Challenges in fully nonparametric estimation of multivariate conditional distributions.
method Tomographic Quantile Forests (TQF) learns conditional quantiles of directional projections.
result TQF reconstructs multivariate conditional distribution efficiently without convexity restrictions.

A new ensemble learning method called Residual Likelihood Forests improves performance and reduces model size.

problem Improving machine learning classification performance with compact models.
method Sequential optimization of conditional likelihoods in a boosting-like framework, combining multiplicatively.
result Significant performance improvements and reduced model size compared to other ensemble methods.

Paper proposes a new method for supervised manifold learning using random forest proximities.

problem Existing supervised manifold learning methods fail to uncover meaningful embeddings due to using class-conditional distances.
method Proposes a data-geometry-preserving variant of random forest proximities as an initialization for manifold learning methods.
result Local and global structure preservation is near universal across manifold learning approaches using diffusion-based algorithms.

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.

We propose the orthogonal random forest, an algorithm that combines Neyman-orthogonality to reduce sensitivity with respect to estimation error of nuisance parameters with generalized random forests (Athey et al., 2017)--a flexible non-parametric method for statistical estimation of conditional moment models using rand…

2018-06-09abs ↗pdf ↗

ACFS optimizes spectral risk under decision-dependent uncertainty using adaptive forest sampling.

problem Minimizing spectral risk with decision-dependent uncertainty.
method ACFS integrates Generalised Random Forests, CEM-guided exploration, rank-weighted augmentation, and multi-start refinement.
result ACFS achieves lowest median oracle spectral risk on both benchmarks.

A new method for measuring conditional feature importance using generative models.

problem Challenges in evaluating feature importance given other feature values.
method Adversarial Random Forest (ARF) for generating on-manifold data points.
result cARFi method yields robust importance scores adaptable for various feature importance notions.

We establish the consistency of an algorithm of Mondrian Forests, a randomized classification algorithm that can be implemented online. First, we amend the original Mondrian Forest algorithm, that considers a fixed lifetime parameter. Indeed, the fact that this parameter is fixed hinders the statistical consistency of …

2017-11-08abs ↗pdf ↗

Study uses satellite and lidar data to map forest height and biomass in France.

problem Mapping forest resources and carbon in large areas.
method Machine learning approach using Sentinel-1, Sentinel-2, ALOS-2, and GEDI Lidar data.
result High-resolution maps of forest height and biomass produced with good accuracy.

We describe Information Forests, an approach to classification that generalizes Random Forests by replacing the splitting criterion of non-leaf nodes from a discriminative one -- based on the entropy of the label distribution -- to a generative one -- based on maximizing the information divergence between the class-con…

2012-02-07abs ↗pdf ↗

Partition Tree estimates conditional densities for mixed continuous and categorical variables.

problem Estimating conditional densities for mixed data types.
method Tree-based framework modeling conditional distributions as piecewise-constant densities on adaptive partitions, minimizing conditional negative log-likelihood.
result Improved probabilistic prediction compared to CART-style trees and state-of-the-art methods.

Assume we are given a set of items from a general metric space, but we neither have access to the representation of the data nor to the distances between data points. Instead, suppose that we can actively choose a triplet of items (A,B,C) and ask an oracle whether item A is closer to item B or to item C. In this paper,…

2018-06-18abs ↗pdf ↗

Novel unsupervised random forests improve density estimation and data synthesis.

problem Density estimation and data synthesis for complex tabular data.
method Recursive unsupervised random forests with alternating generation and discrimination rounds.
result Provable consistency and smooth densities with fast execution.

Unified framework for structure learning via conditional independence testing.

problem Optimal structure learning and conditional independence testing.
method Established a fundamental connection and reduction between structure learning and conditional independence testing.
result Optimal rates for structure learning are determined by conditional independence testing rates.