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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for RF deep learning

DeepRF_SLR uses deep reinforcement learning to design shorter RF pulses.

problem Designing efficient RF pulses for MRI sequences.
method Optimizing the root pattern of SLR polynomial using deep reinforcement learning and greedy tree search.
result DeepRF_SLR generates shorter duration RF pulses in less time compared to conventional methods.

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.

In portable, 3-D, or ultra-fast ultrasound (US) imaging systems, there is an increasing demand to reconstruct high quality images from limited number of data. However, the existing solutions require either hardware changes or computationally expansive algorithms. To overcome these limitations, here we propose a novel d…

2017-10-27abs ↗pdf ↗

Deep reinforcement learning boosts throughput in RF-powered cognitive radio networks.

problem Maximizing throughput in large-scale, decentralized RF-powered cognitive radio networks.
method Proposes deep reinforcement learning to find optimal policies for network throughput maximization.
result Deep reinforcement learning outperforms existing techniques in large-scale RF-CRN environments.

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.

Deep random feature models are analyzed for their performance with exact asymptotic expressions.

problem Understanding the performance of deep random feature models.
method Established a novel universality result and used the convex Gaussian Min-Max theorem.
result Exact asymptotic expressions for the performance of deep random feature models are derived.

This paper demonstrates how to apply machine learning algorithms to distinguish good stocks from the bad stocks. To this end, we construct 244 technical and fundamental features to characterize each stock, and label stocks according to their ranking with respect to the return-to-volatility ratio. Algorithms ranging fro…

2018-06-05abs ↗pdf ↗

The paper models ATM cash withdrawal chaos and forecasts using deep learning.

problem Forecasting ATM cash withdrawals in an Indian bank.
method Chaos modeling of ATM cash withdrawal time series, deep learning methods (ARIMA, RF, SVR, MLP, GMDH, GRNN, LSTM, 1D CNN).
result Deep learning models show similar performance to random forest in forecasting ATM cash withdrawals.

Deep learning improves tree species classification accuracy in imbalanced contexts.

problem Inaccurate tree species maps for large areas, especially in imbalanced contexts.
method Used deep learning models (including convolutional and attention-based) on Sentinel-2 multispectral satellite time series data.
result Deep learning models achieve higher accuracy and F1-macro scores compared to Random Forest in imbalanced contexts.

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.

Batch normalization shifts models to rely more on non-robust features.

problem Understanding the impact of batch normalization on deep neural networks.
method Empirical analysis and a framework for disentangling robustness and usefulness.
result Batch normalization increases reliance on non-robust features, decreasing adversarial robustness.

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.

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.

Machine learning speeds up RIS design for efficient RF components.

problem Designing reconfigurable intelligent surfaces (RIS) for efficient RF components is time-consuming and resource-intensive.
method Machine/deep learning techniques are used to reduce the computational cost and time of RIS inverse design.
result Machine learning techniques significantly reduce the time and computational cost of RIS design.

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.

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.

With the development and widespread use of wireless devices in recent years (mobile phones, Internet of Things, Wi-Fi), the electromagnetic spectrum has become extremely crowded. In order to counter security threats posed by rogue or unknown transmitters, it is important to identify RF transmitters not by the data cont…

2017-11-05abs ↗pdf ↗

The paper optimizes RF training by improving tree building algorithms and CPU optimizations.

problem Improving the training performance of Random Forest models on CPU architectures.
method Investigated and improved tree building algorithms (BFS, DFS, hybrid BFS-DFS) and proposed optimizations.
result The hybrid BFS-DFS algorithm outperforms both BFS and DFS, and is more robust.

New algorithm reduces feature count and accelerates error convergence.

problem Exponential error convergence in data classification with optimized random features.
method Optimized random features accelerated by quantum machine learning.
result Achieves exponential error convergence under low-noise condition.

GAN-based spoofing attacks improve wireless signal authentication.

problem Improving wireless signal authentication against sophisticated spoofing attacks.
method Generative Adversarial Network (GAN) for generating synthetic signals.
result GAN-based spoofing attacks significantly increase the success probability of wireless signal spoofing.

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.

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.

The challenge of object categorization in images is largely due to arbitrary translations and scales of the foreground objects. To attack this difficulty, we propose a new approach called collaborative receptive field learning to extract specific receptive fields (RF's) or regions from multiple images, and the selected…

2014-02-02abs ↗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.

This research uses cooperative game theory to interpret deep learning models for ASD biomarker discovery.

problem Understanding image features used by deep learning models for ASD biomarker discovery.
method Shapley value explanation (SVE) from cooperative game theory applied to deep learning models with graph structure optimization.
result SVE provides more accurate biomarker importance than traditional methods.

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.

Radio frequency (RF) sensors are used alongside other sensing modalities to provide rich representations of the world. Given the high variability of complex-valued target responses, RF systems are susceptible to attacks masking true target characteristics from accurate identification. In this work, we evaluate differen…

2018-11-26abs ↗pdf ↗

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.