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,742 papers · 148 categories

Trend · papers per month

72145217289 · Jun 202019922001200920172026
48 results for oblique random survival forest

Efficient oblique RSF method improves prediction and interpretability.

problem Limited computational efficiency and difficulty in interpreting oblique RSF ensembles.
method Newton-Raphson scoring for computational efficiency and negation importance for variable importance estimation.
result The method reduces computational overhead by 450 times and improves prediction accuracy.

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…

2015-06-10abs ↗pdf ↗

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.

This paper optimizes high-dimensional oblique splits for decision trees, enhancing performance and computational efficiency.

problem Enhancing decision tree performance and computational efficiency in high-dimensional data.
method Established Sufficient Impurity Decrease (SID) convergence for s0s_0-sparse oblique splits, proposing progressive trees for iterative refinement.
result Demonstrated that SID function class expands with s0s_0-sparsity, enabling capture of complex data-generating processes.

A weighted random survival forest is presented in the paper. It can be regarded as a modification of the random forest improving its performance. The main idea underlying the proposed model is to replace the standard procedure of averaging used for estimation of the random survival forest hazard function by weighted av…

2019-01-01abs ↗pdf ↗

Paper proposes a novel SVM method for creating survival trees.

problem Creating non-linear survival trees for right-censored data.
method L2-regularized dipole splitting criteria with kernel methods.
result Non-linear splits using polynomial and Gaussian kernels show similar predictive power but often smaller tree sizes.

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.

FoLDTree improves oblique decision trees with ULDA, enhancing accuracy and feature selection.

problem Axis-orthogonal splits limit traditional decision trees' performance on oblique decision boundaries.
method Integrates ULDA into decision tree structure for efficient oblique splits, feature selection, and handling missing values.
result FoLDTree outperforms other methods in accuracy and feature selection, comparable to random forest.

We present a new way of constructing an ensemble classifier, named the Guided Random Forest (GRAF) in the sequel. GRAF extends the idea of building oblique decision trees with localized partitioning to obtain a global partitioning. We show that global partitioning bridges the gap between decision trees and boosting alg…

2019-09-02abs ↗pdf ↗

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) …

2016-12-28abs ↗pdf ↗

Optimal survival trees ensemble reduces tree count and improves predictive performance.

problem Improving predictive performance in survival analysis.
method Grows a forest of optimal survival trees by ranking and selecting the best trees based on out-of-bag error.
result Reduces the number of trees in the ensemble while improving predictive performance.

Enhances interpretability of functional survival models.

problem Lack of interpretability in functional survival models limits practical use.
method Introduces novel methods to enhance interpretability of FST and explainability of FRSF.
result Proposed methods yield efficient, easy-to-understand decision trees.

Single tree outperforms random forest in testing accuracy.

problem The challenge of improving single decision tree performance.
method Gradient-based entire tree optimization framework, scaled sigmoid approximation, numerical stability algorithm, subtree polish strategy.
result Optimized single tree outperforms classic random forest by 2.03% on average.

Paper proposes a method to estimate confidence bands for survival random forests.

problem No statistically valid and computationally feasible approach for estimating confidence bands for survival random forests.
method Extending recent developments in infinite-order incomplete U-statistics, the paper proposes an unbiased confidence band estimation.
result The proposed method accurately estimates the confidence band and achieves desired coverage rate.

Study benchmarks 19 survival models on 34 datasets, finding Cox model still best.

problem Quantitative comparison of survival models on low-dimensional data.
method Comprehensive benchmarking of 19 models on 34 datasets, tuning and evaluating using 6 metrics.
result Cox Proportional Hazards model remains best overall for low-dimensional, right-censored data.

Kernel Induced Random Survival Forests (KIRSF) is a statistical learning algorithm which aims to improve prediction accuracy for survival data. As in Random Survival Forests (RSF), Cumulative Hazard Function is predicted for each individual in the test set. Prediction error is estimated using Harrell's concordance inde…

2010-08-24abs ↗pdf ↗

This paper enhances the Random Survival Forest model for better predictive maintenance.

problem Improving time-to-failure estimation in predictive maintenance with Random Survival Forest.
method A three-level framework for quantifying hyperparameter tunability, including model-level and hyperparameter-level metrics.
result Hyperparameter tuning significantly improves Random Survival Forest model performance in predictive maintenance.

Random Forest kernels improve performance in various regression and survival tasks.

problem Improving performance of Random Forest in high-dimensional data with noisy features.
method Developed and evaluated data-driven RF kernels for regression, classification, and survival tasks.
result RF kernels are competitive or superior to RF in most scenarios, especially for survival tasks.

The paper estimates personalized treatment effects in medical settings with competing risks.

problem Estimating treatment effectiveness for specific events in the presence of alternative event types.
method Meta-learners combining Cox regression or random survival forests for risk modeling and elastic net regression or random forests for direct CATE modeling.
result Compared meta-learners in multiple simulation settings, providing practical guidance for model selection.

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.

We introduce a semi-parametric Bayesian model for survival analysis. The model is centred on a parametric baseline hazard, and uses a Gaussian process to model variations away from it nonparametrically, as well as dependence on covariates. As opposed to many other methods in survival analysis, our framework does not im…

2016-11-02abs ↗pdf ↗

Unified theory and debiasing framework for random oblique projections in high dimensions.

problem Systematic statistical bias in random oblique projections induced by sampling.
method Unified non-asymptotic theory and debiasing framework.
result Sharp bias--variance characterizations and improved approximation accuracy.

We introduce canonical correlation forests (CCFs), a new decision tree ensemble method for classification and regression. Individual canonical correlation trees are binary decision trees with hyperplane splits based on local canonical correlation coefficients calculated during training. Unlike axis-aligned alternatives…

2015-07-20abs ↗pdf ↗

DynForest R package predicts outcomes with time-dependent predictors.

problem Handling time-dependent predictors in random forest models.
method Random forests with time-dependent predictors summarized using flexible linear mixed models.
result DynForest can predict continuous, categorical, and survival outcomes.

Random forest models predict CLABSI risk in hospital admissions, with static models performing similarly to dynamic ones.

problem Predicting CLABSI risk in hospital admissions using EHR data with competing risks.
method Comparison of static and dynamic random forest models for binary, multinomial, survival, and competing risks outcomes.
result Static and dynamic random forest models perform similarly in predicting CLABSI risk, with multinomial models having the lowest computation times.

Automated brain tumor segmentation plays an important role in the diagnosis and prognosis of the patient. In addition, features from the tumorous brain help in predicting patients overall survival. The main focus of this paper is to segment tumor from BRATS 2018 benchmark dataset and use age, shape and volumetric featu…

2019-09-10abs ↗pdf ↗

Paper proposes a new combined regression strategy for conditional survival prediction.

problem Improving survival prediction accuracy using conditional survival function.
method Uses regression-based weak learners with area-norm proximity measure to create an ensemble technique.
result The proposed model outperforms Random Survival Forest and selects important variables effectively.

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…

2015-01-28abs ↗pdf ↗

SurvBESA predicts survival times using ensemble methods with self-attention.

problem Challenges in survival analysis due to censored data and unstable predictions.
method SurvBESA combines Beran estimators with a self-attention mechanism to predict survival times.
result SurvBESA outperforms state-of-the-art models in predicting survival times.