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

Trend · papers per month

1.4%2.8%4.2%5.6% · Apr 199619922001200920172026
48 results for fingerprint verification

A new method for cross-matching fingerprints from different sensors.

problem Inefficiency in cross-matching fingerprints from different sensors.
method Co-occurrence of ridge orientations and Gabor-HoG descriptor fusion with CCA.
result Significant enhancement over state-of-the-art methods.

Verification determines whether two samples belong to the same class or not, and has important applications such as face and fingerprint verification, where thousands or millions of categories are present but each category has scarce labeled examples, presenting two major challenges for existing deep learning models. W…

2017-06-12abs ↗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.

Complex-valued neural networks improve wireless fingerprinting robustness.

problem Distinguish between devices sending the same message, robust against spoofing.
method Used complex-valued neural networks for supervised learning of fingerprints from wireless signals.
result Noise augmentation by adding white Gaussian noise leads to significant performance gains.

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 ↗

SMILES Transformer learns molecular fingerprints for drug discovery.

problem Poor performance of rule-based molecular fingerprints in shallow prediction models or small datasets.
method Unsupervised pre-training of a sequence-to-sequence language model on a corpus of SMILES.
result SMILES Transformer outperformed existing methods in small-data settings.

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.

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 ↗

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.

CMDRNN predicts user location using WiFi fingerprints with deep learning.

problem Predicting user activity with WiFi fingerprints is challenging due to high dimensionality.
method Combines CNN, RNN, and MDN to model high-dimensional time-series data.
result CMDRNN effectively predicts user location using WiFi fingerprints.

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.

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.

Study optimizes Sigfox-based RSSI fingerprinting for outdoor localization.

problem Lack of publicly available datasets for Sigfox-based outdoor localization.
method Tuning hyperparameters and data transformations for kNN method.
result Mean localization error of 298 meters, median error of 109 meters.

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 ↗

Two deep learning models improve indoor location prediction from WiFi fingerprints.

problem Indoor location prediction from WiFi fingerprints.
method Convolutional mixture density recurrent neural network and VAE-based semi-supervised learning model.
result Proposed models outperform existing methods in real-world datasets.

Lower bounds on private estimation of Gaussian covariance matrices.

problem Private estimation of Gaussian covariance matrices under various parameter regimes.
method Stein-Haff identity and fingerprinting lemma extensions.
result Lower bounds match existing upper bounds in the widest known parameters.

Current popular methods for Magnetic Resonance Fingerprint (MRF) recovery are bottlenecked by the heavy storage and computation requirements of a dictionary-matching (DM) step due to the growing size and complexity of the fingerprint dictionaries in multi-parametric quantitative MRI applications. In this paper we study…

2018-09-05abs ↗pdf ↗

Policy gradient methods ignore the potential value of adjusting environment variables: unobservable state features that are randomly determined by the environment in a physical setting, but are controllable in a simulator. This can lead to slow learning, or convergence to suboptimal policies, if the environment variabl…

2018-05-27abs ↗pdf ↗

Formalizes weak and strong verification for LLMs, controlling errors without assumptions.

problem Balancing cost and reliability in reasoning with LLMs.
method Formalizes weak-strong verification policies, introduces metrics, develops online algorithm.
result Optimal policies admit a two-threshold structure, and calibration and sharpness govern value of weak verifiers.

Symmetry-electronic fingerprints reveal competing magnetic phases in two-dimensional materials.

problem Predicting magnetic ground states, moments, and anisotropy in two-dimensional magnets.
method Introduce the symmetry-electronic fingerprint (SEF), a physically interpretable representation that encodes crystallographic symmetry operations, Wyckoff-site geometry, and site-resolved electronic structure.
result SEF-trained models accurately classify magnetic ordering and regress moments alongside anisotropy energies.

In this paper, we propose hybrid building/floor classification and floor-level two-dimensional location coordinates regression using a single-input and multi-output (SIMO) deep neural network (DNN) for large-scale indoor localization based on Wi-Fi fingerprinting. The proposed scheme exploits the different nature of th…

2018-10-13abs ↗pdf ↗

New lower bounds for private covariance estimation of Gaussian distributions are proven.

problem Proving tight lower bounds for private estimation tasks under differential privacy.
method Generalized fingerprinting method for exponential families and private Assouad method.
result Tight lower bounds for private covariance estimation in Frobenius and spectral norms.

Hypothesis testing is an important problem with applications in target localization, clinical trials etc. Many active hypothesis testing strategies operate in two phases: an exploration phase and a verification phase. In the exploration phase, selection of experiments is such that a moderate level of confidence on the …

2018-12-04abs ↗pdf ↗

Accelerates DNN robustness verification with target labels.

problem Improving the robustness of deep neural networks against adversarial attacks.
method Guiding robustness verification with target labels, reducing search space and using symbolic interval propagation and linear relaxation.
result Significantly improves DNN verification speed by 36X, especially when perturbation distance is reasonable.

We adopt data structure in the form of cover trees and iteratively apply approximate nearest neighbour (ANN) searches for fast compressed sensing reconstruction of signals living on discrete smooth manifolds. Levering on the recent stability results for the inexact Iterative Projected Gradient (IPG) algorithm and by us…

2017-06-23abs ↗pdf ↗

New methods combat data poisoning attacks in bandit algorithms using limited verification.

problem Data poisoning attacks on bandit algorithms, especially in the UCB and ETC types.
method Verification-based mechanisms to restore optimal regret with limited verifications.
result A simple modified ETC type bandit algorithm can restore optimal regret with O(logT)O(\log T) verifications.

New algorithm speeds up robustness verification for tree-based models.

problem Formal robustness verification of tree-based models, especially ensembles.
method Reformulated as max-clique problem on a multi-partite graph with bounded boxicity; developed efficient multi-level verification algorithm.
result Tight lower bounds on robustness of decision tree ensembles, hundreds of times faster than previous approach.