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

22456789 · Jun 202019922001200920172026
48 results for Model-based Forests

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.

Forest-based methods estimate heterogeneous treatment effects, blending strengths for better performance.

problem Estimating heterogeneous treatment effects in randomized and observational studies.
method Causal forests and model-based forests, blending strengths for better performance.
result Local centering of treatment indicator and propensities is crucial for good performance in randomized trials.

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 ↗

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 ↗

A new tree-based model improves uncertainty estimation in sequential optimization.

problem Improving uncertainty estimation in sequential model-based optimization.
method Proposed a new ensemble of randomized trees (BwO forest) with bagging and oversampling.
result BwO forest outperforms existing tree-based models in various optimization scenarios.

In this paper, we investigate a new compressive sensing model for multi-channel sparse data where each channel can be represented as a hierarchical tree and different channels are highly correlated. Therefore, the full data could follow the forest structure and we call this property as \emph{forest sparsity}. It exploi…

2012-11-20abs ↗pdf ↗

Random forests and LASSO methods improve small area estimation using auxiliary data.

problem Estimating household consumption in small areas with limited sampled data.
method Model-based small area estimation using random forests and LASSO with auxiliary information.
result Bayesian shrinkage performed best in terms of bias, MSE, and prediction interval coverages.

BCF models estimate causal effects on multiple outcomes in TIMSS data.

problem Estimating causal effects on multiple outcomes in educational data.
method Bayesian Additive Regression Trees (BART) for multivariate causal inference.
result Positive and negative effects of home study conditions and school absence on student achievement.

Two machine learning models detect anomalies in ER claims, saving up to 40% in improper payments.

problem Improper health insurance payments from fraud and upcoding.
method Two machine learning models: an upcoding model based on severity code distributions and a random forest model for claim sorting.
result Random forest model saved 12% to 40% in improper payments compared to a baseline approach.

Current deep learning models are mostly build upon neural networks, i.e., multiple layers of parameterized differentiable nonlinear modules that can be trained by backpropagation. In this paper, we explore the possibility of building deep models based on non-differentiable modules. We conjecture that the mystery behind…

2017-02-28abs ↗pdf ↗

In the era of "big data", it is becoming more of a challenge to not only build state-of-the-art predictive models, but also gain an understanding of what's really going on in the data. For example, it is often of interest to know which, if any, of the predictors in a fitted model are relatively influential on the predi…

2018-05-12abs ↗pdf ↗

The paper evaluates various forecasting methods for inflation, finding ML models superior.

problem Forecasting inflation using disaggregated data and machine learning.
method Examines traditional and machine learning models, including random forest, for disaggregated and aggregated inflation forecasts.
result Aggregating disaggregated forecasts performs similarly to survey-based expectations and aggregate models.

This study analyzes and optimizes hyperparameters for machine learning models.

problem Optimizing hyperparameters for machine learning models to improve performance.
method Experimental analysis of 30 hyperparameters from six machine learning algorithms using R and SPOT.
result A new consensus ranking method for analyzing results from multiple algorithms.

The random forest algorithm (RF) has several hyperparameters that have to be set by the user, e.g., the number of observations drawn randomly for each tree and whether they are drawn with or without replacement, the number of variables drawn randomly for each split, the splitting rule, the minimum number of samples tha…

2018-04-10abs ↗pdf ↗

Model predicts S&P500 volatility more accurately than existing models.

problem Improving accuracy of volatility and market risk forecasts.
method Stacked model using Gradient Descent Boosting, Random Forest, SVM, and Artificial Neural Network.
result The model outperforms other models in forecasting S&P500 volatility.

Paper proposes a new reserving model using machine learning techniques.

problem Managing uncertainties in premium sufficiency and reserves for future claims.
method Stacked model combining Gradient Boosting, Random Forest, Artificial Neural Networks, and log-normal approach.
result The proposed model improves traditional reserving techniques, leading to more accurate reserving risk assessment.

The paper develops a neural network model for SPX option pricing.

problem Developing an empirical model for SPX option pricing.
method Formulated and rigorously evaluated several statistical models including neural network, random forest, and linear regression.
result The neural network model outperforms other models and Black-Scholes-Merton model for SPX option pricing.

Factor analysis or sometimes referred to as variable analysis has been extensively used in classification problems for identifying specific factors that are significant to particular classes. This type of analysis has been widely used in application such as customer segmentation, medical research, network traffic, imag…

2019-04-30abs ↗pdf ↗

Study compares Cox model and RSF for predicting patient survival, finding RSF superior in certain scenarios.

problem Comparing predictive accuracy of Cox proportional hazards model and Random Survival Forest for patient-specific survival probabilities.
method Conducted a comprehensive comparison study using simulation scenarios and real-world datasets.
result RSF outperforms Cox model in nonproportional hazards settings and with treatment-covariate interactions.

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…

2014-06-10abs ↗pdf ↗

New random forest method provides optimal rates and confidence bands.

problem Improving random forest regression rates and constructing confidence bands.
method Proposed Ehrenfest centered purely random forests achieve optimal rates; used Gaussian approximation for supremum of empirical processes.
result Explicit asymptotic uniform confidence bands constructed for both random forest types.

RFpredInterval package builds prediction intervals for random forests and boosted forests.

problem Quantifying uncertainty in random forest and boosted forest point predictions.
method 16 methods to build prediction intervals with random forests and boosted forests.
result The proposed method outperforms existing methods in building prediction intervals.

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…

2018-02-12abs ↗pdf ↗

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…

2016-04-06abs ↗pdf ↗

Hyperboost uses gradient boosting for hyperparameter optimization, outperforming state-of-the-art methods.

problem Hyperparameter tuning for machine learning algorithms
method Gradient boosting surrogate model with quantile regression and distance metric
result Hyperboost outperforms state-of-the-art techniques in empirical tests

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…

2019-05-24abs ↗pdf ↗

Improves time series classification with forest proximities.

problem Time series classification accuracy and efficiency.
method PF-GAP, an extension of RF-GAP proximities to proximity forests, combined with Multi-Dimensional Scaling and Local Outlier Factors.
result Forest proximities show stronger connection between misclassified points and outliers.

Proposes a continuous, differentiable model from local adaptive models.

problem Inadequate continuity and differentiability in over-parameterized models.
method A global continuous and differentiable model constructed from weighted averages of locally learned models.
result Achieves faster statistical convergence and improved performance in various settings.

Random forests reduce bias and variance, especially in low SNR settings.

problem Reducing bias and variance in machine learning models, particularly in low SNR scenarios.
method Empirical study of random forests and bagging ensembles, focusing on the importance of mtrymtry tuning.
result Random forests reduce both bias and variance, outperforming bagging ensembles in high SNR settings.