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

36912 · Apr 201919922001200920172026
48 results for RF fingerprinting

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.

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.

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 ↗

AGML model improves indoor localization with sparse fingerprints using meta-learning and graph neural networks.

problem Maintaining high localization accuracy with extremely sparse fingerprints.
method Attentional Graph Neural Network (AGNN) and meta-learning framework with data augmentation strategies.
result AGML model consistently outperforms baseline methods across various metrics.

BrainSurfCNN predicts task contrasts from resting-state fingerprints, improving accuracy over baseline.

problem Predicting task-evoked activity from resting-state functional connectivity.
method Surface-based convolutional neural network (BrainSurfCNN) with reconstructive-contrastive loss.
result Significantly improved accuracy in predicting task contrasts over baseline.

The fingerprint classification problem is to sort fingerprints into pre-determined groups, such as arch, loop, and whorl. It was asserted in the literature that minutiae points, which are commonly used for fingerprint matching, are not useful for classification. We show that, to the contrary, near state-of-the-art clas…

2017-11-24abs ↗pdf ↗

A "wireless fingerprint" which exploits hardware imperfections unique to each device is a potentially powerful tool for wireless security. Such a fingerprint should be able to distinguish between devices sending the same message, and should be robust against standard spoofing techniques. Since the information in wirele…

2019-05-19abs ↗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.

Molecular "fingerprints" encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-d…

2016-03-02abs ↗pdf ↗

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.

Deep learning models can learn confounding factors instead of device fingerprints in wireless signals.

problem Learning device fingerprints from complex-valued deep neural networks in the presence of confounding factors.
method Investigating complex-valued deep neural networks (DNNs) to distinguish between wireless transmitters, focusing on clock drift and channel variations.
result DNNs learn confounding features rather than device-specific characteristics, requiring strategies to promote generalization.

This paper introduces a new method to evaluate multiple policies simultaneously.

problem Estimating the value of many policies for a single set of states.
method Developed a scalable, differentiable fingerprinting mechanism to represent complex policies.
result The method can produce policies that outperform those that generated the training data, in zero-shot manner.

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.

Paper presents a new method to detect process differences at the trace level using mutual fingerprints.

problem Low-level granularity in process variant analysis leads to many false differences.
method Develops a mutual fingerprint technique to encode entire process traces for comparison.
result Mutual fingerprint method reveals significant differences not detected by existing techniques.

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.

We introduce a convolutional neural network that operates directly on graphs. These networks allow end-to-end learning of prediction pipelines whose inputs are graphs of arbitrary size and shape. The architecture we present generalizes standard molecular feature extraction methods based on circular fingerprints. We sho…

2015-09-30abs ↗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.

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 ↗