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

Trend · papers per month

64128191255 · Jun 202019922001200920172026
48 results for adaptive RF

Paper explores how Rectified Flow adapts to low-dimensional data.

problem Improving sampling efficiency in low-dimensional data.
method Investigates Rectified Flow's adaptation to low-dimensional support and introduces a stochastic version.
result Shows improved sampling efficiency with O(k/ε)O(k/\varepsilon) complexity.

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.

Random forest (RF) missing data algorithms are an attractive approach for dealing with missing data. They have the desirable properties of being able to handle mixed types of missing data, they are adaptive to interactions and nonlinearity, and they have the potential to scale to big data settings. Currently there are …

2017-01-19abs ↗pdf ↗

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…

2016-05-30abs ↗pdf ↗

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.

This study improves UAV identification using RF signals with one-shot generative methods.

problem Limited RF environments and signal variability make traditional RF identification ineffective.
method Introduces one-shot generative methods to augment RF signals for UAV identification.
result One-shot generative methods outperform traditional methods in low-data regimes.

A scalable GP model for online uncertainty quantification over graphs.

problem Scalable uncertainty quantification over graphs with dynamic data.
method Graph-aware parametric Gaussian process model using random features and online conformal prediction.
result Improved coverage and efficient prediction sets over existing methods.

Random Feature (RF) models are used as efficient parametric approximations of kernel methods. We investigate, by means of random matrix theory, the connection between Gaussian RF models and Kernel Ridge Regression (KRR). For a Gaussian RF model with PP features, NN data points, and a ridge λλ, we show that the avera…

2020-02-19abs ↗pdf ↗

Ultrasound (US) imaging is based on the time-reversal principle, in which individual channel RF measurements are back-propagated and accumulated to form an image after applying specific delays. While this time reversal is usually implemented as a delay-and-sum (DAS) beamformer, the image quality quickly degrades as the…

2019-01-07abs ↗pdf ↗

This paper improves kernel quantile regression with random features for handling heavy-tailed noises.

problem Handling heavy-tailed noises in kernel quantile regression.
method Introduces a refined error decomposition and establishes a novel connection between KQR-RF and KRR-RF.
result Establishes capacity-dependent learning rates for KQR-RF under mild conditions on the number of random features, which are minimax optimal up to some logarithmic factors.

Simplifies RF predictions by focusing on a subset of nearest neighbors.

problem Improving interpretability and performance of RF-based forecast distributions.
method Sparsifying RF-based forecast distributions by focusing on a small subset of nearest neighbors.
result Simplified RF predictions can be similar to or exceed original ones in forecasting performance.

Despite the impressive performance of random forests (RF), its theoretical properties have not been thoroughly understood. In this paper, we propose a novel RF framework, dubbed multinomial random forest (MRF), to analyze the \emph{consistency} and \emph{privacy-preservation}. Instead of deterministic greedy split rule…

2019-03-10abs ↗pdf ↗

DiFF-RF detects point-wise and collective anomalies using random partitioning trees.

problem Detecting anomalies in data, especially collective anomalies.
method Random partitioning binary trees with distance-based leaves and semi-supervised learning.
result DiFF-RF significantly outperforms isolation forest and one-class SVM.

A new method uses RF's out-of-bag errors for multiple imputation.

problem Missing data in biomedical studies and lack of prediction uncertainty.
method Constructs conditional distributions from the empirical distribution of out-of-bag prediction errors.
result Valid multiple imputation results achieved without parametric assumptions.

Enhances FDA for robust, efficient federated learning.

problem Domain shift challenges in federated learning models.
method Introduces RF-TCA to accelerate computation and extends it to FDA setting with FedRF-TCA.
result Communication complexity independent of sample size, superior performance and robustness.

The paper proposes a method to improve random forest classification accuracy by weighting trees based on their decision path reliability.

problem Random forests' uniform voting fails to correct errors in regions where incorrect tree representations outnumber correct ones.
method The paper introduces using the structural pattern of each tree's decision path as an instance-adaptive reliability signal to identify and weight more reliable trees.
result Using the proposed method yields a statistically significant accuracy improvement over RF on 36 binary classification benchmarks.

Ultrasound elastography is used to estimate the mechanical properties of the tissue by monitoring its response to an internal or external force. Different levels of deformation are obtained from different tissue types depending on their mechanical properties, where stiffer tissues deform less. Given two radio frequency…

2020-02-17abs ↗pdf ↗

We examine a Type-1 neck pinch singularity in simplicial Ricci flow (SRF) for an axisymmetric piecewise flat 3-dimensional geometry with 3-sphere topology. SRF was recently introduced as an unstructured mesh formulation of Hamilton's Ricci flow (RF). It describes the RF of a piecewise-flat simplicial geometry. In this …

2013-08-19abs ↗pdf ↗

Random Forests don't overfit, challenging the double-descent theory.

problem The overfitting behavior of Random Forests.
method Challenged the double-descent curve theory by analyzing the performance of Random Forests and proposing a new approach to diversity in ensembles.
result Random Forests do not exhibit a double-descent curve but rather a single descent, indicating they do not overfit in the classic sense.

In this paper we analyze, evaluate, and improve the performance of training Random Forest (RF) models on modern CPU architectures. An exact, state-of-the-art binary decision tree building algorithm is used as the basis of this study. Firstly, we investigate the trade-offs between using different tree building algorithm…

2019-10-15abs ↗pdf ↗

TinyML models detect RF and cyber threats in spacecraft with low latency.

problem Detecting cyber-RF threats in autonomous spacecraft with low latency.
method Analysis of classical models (RF, LR, SVM, MLP) for latency-accuracy trade-offs.
result Logistic Regression achieves microsecond-level inference with minimal accuracy loss.

A new ML framework for RF fingerprinting across various applications.

problem Extracting unique RF fingerprints for specific emitter identification.
method Generic machine learning framework for automatic RF fingerprinting.
result Framework achieves superior performance compared to traditional methods.

We propose to prune a random forest (RF) for resource-constrained prediction. We first construct a RF and then prune it to optimize expected feature cost & accuracy. We pose pruning RFs as a novel 0-1 integer program with linear constraints that encourages feature re-use. We establish total unimodularity of the constra…

2016-06-16abs ↗pdf ↗

Combines RFs and GLMs for better accuracy and interpretable feature importance.

problem Inability to interpret random forests (RFs) due to black box nature and unstable feature importance methods.
method Reinterprets decision trees and MDI as linear regression and R² values, combining RFs and GLMs in RF+.
result MDI+ outperforms existing feature importance measures in identifying signal features and stability.

Paper analyzes error bounds for learning with vector-valued RF, improving existing analyses.

problem Learning with vector-valued random features in infinite-dimensional settings.
method Direct analysis of risk functional, avoiding random matrix theory.
result Strong consistency and minimax optimal convergence rates established.

This paper is devoted to obtain the one-dimensional group invariant solutions of the two-dimensional Ricci flow ((2D) Rf) equation. By classifying the orbits of the adjoint representation of the symmetry group on its Lie algebra, the optimal system of one-dimensional subalgebras of the ((2D) Rf) equation is obtained. F…

2014-07-31abs ↗pdf ↗

Random Forests (RFs) are strong machine learning tools for classification and regression. However, they remain supervised algorithms, and no extension of RFs to the one-class setting has been proposed, except for techniques based on second-class sampling. This work fills this gap by proposing a natural methodology to e…

2016-11-07abs ↗pdf ↗

S-SIRUS explains RF for spatial data, improving accuracy and interpretability.

problem Non-interpretable nature of Random Forest in spatially dependent data.
method Proposes S-SIRUS, a spatial extension of SIRUS for extracting interpretable rules.
result S-SIRUS outperforms SIRUS in spatially dependent data, offering higher predictive accuracy and shorter rule lists.

Tree ensembles like RF and GBT can be seen as kernels, improving regression and classification performance.

problem Improving kernel methods for tree ensemble based models.
method Investigation of RF and GBT kernels in simulation and real data.
result RF and GBT kernels are competitive to their respective ensembles in higher dimensions, particularly with noisy features.

Random forest (RF) methodology is one of the most popular machine learning techniques for prediction problems. In this article, we discuss some cases where random forests may suffer and propose a novel generalized RF method, namely regression-enhanced random forests (RERFs), that can improve on RFs by borrowing the str…

2019-04-23abs ↗pdf ↗