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

Trend · papers per month

481115 · Oct 201919922001200920172026
48 results for fingerprinting lemma

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.

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.

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 ↗

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 ↗

In Machine Learning as a Service, a provider trains a deep neural network and gives many users access. The hosted (source) model is susceptible to model stealing attacks, where an adversary derives a surrogate model from API access to the source model. For post hoc detection of such attacks, the provider needs a robust…

2019-12-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.

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.

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 ↗

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 ↗

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 ↗

Formulates Index III lemma and Rauch III theorem with applications.

problem Develops new mathematical theorems based on existing ones.
method Formulation of Index III lemma and Rauch III theorem based on Index I, II lemmas and Rauch I, II theorems.
result Presented Rauch's type theorem and volume comparison result as applications.

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 ↗

Tucker and Ky Fan's lemma are combinatorial analogs of the Borsuk-Ulam theorem (BUT). In 1996, Yu. A. Shashkin proved a version of Fan's lemma, which is a combinatorial analog of the odd mapping theorem (OMT). We consider generalizations of these lemmas for BUT-manifolds, i.e. for manifolds that satisfy BUT. Proofs rel…

2014-09-30abs ↗pdf ↗

Paper proves a discrete Schwarz-Pick lemma for generalized circle packings.

problem Comparing geometric quantities of circle packings with different boundary values.
method Combinatorial Calabi flows and maximum principle.
result Discrete Schwarz-Pick lemma proven for generalized circle packings.

The paper improves Zakalyukin's lemma for frontals and applies it to surface singularities.

problem Improving the conditions under which wave front germs imply map germs.
method Generalization of Zakalyukin's lemma for frontals and applications to surface singularities.
result The paper provides a more general version of Zakalyukin's lemma for map germs.

Meridian lemma extended to fully alternating links in thickened surfaces.

problem Extending Menasco's meridian lemma to fully alternating links in thickened surfaces.
method Developed a new meridian lemma for fully alternating links in thickened orientable surfaces of positive genus.
result The meridian lemma holds for fully alternating links in thickened surfaces.