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

Trend · papers per month

7142128 · Jun 202019922001200920172026
48 results for GPS spoofing

Study detects spoofing in high-frequency trading using micro-structural analysis.

problem Challenges in detecting spoofing due to complex electronic platforms and high-frequency trading.
method Micro-structural study in a simplified setting, optimization of spoofing strategy, monitoring with Wasserstein distance.
result Optimal spoofing strategy and its impact on market imbalance quantified.

Growing interest in automatic speaker verification (ASV)systems has lead to significant quality improvement of spoofing attackson them. Many research works confirm that despite the low equal er-ror rate (EER) ASV systems are still vulnerable to spoofing attacks. Inthis work we overview different acoustic feature spaces…

2017-05-24abs ↗pdf ↗

The paper presents a novel approach of spoofing wireless signals by using a general adversarial network (GAN) to generate and transmit synthetic signals that cannot be reliably distinguished from intended signals. It is of paramount importance to authenticate wireless signals at the PHY layer before they proceed throug…

2019-05-03abs ↗pdf ↗

Real-time detection of spoofing in cryptocurrency exchanges using neural networks.

problem Detecting and mitigating spoofing activity in limit order books.
method Novel order flow variables based on multi-scale Hawkes processes and a probabilistic market manipulation gain model.
result 31% of large orders could spoof the market, highlighting the importance of posting distance in price formation.

It is well known that speaker verification systems are subject to spoofing attacks. The Automatic Speaker Verification Spoofing and Countermeasures Challenge -- ASVSpoof2015 -- provides a standard spoofing database, containing attacks based on synthetic speech, along with a protocol for experiments. This paper describe…

2015-08-07abs ↗pdf ↗

Paper proposes D3M to improve anti-spoofing detection by balancing loss function and using complementary features.

problem Improving automatic speaker verification systems against high-quality playback attacks.
method D3M uses a balanced focal loss function to dynamically scale loss based on sample traits, and combines three feature types for robust detection.
result D3M systems outperform conventional methods significantly, achieving min-tDCF of 0.0124 and EER of 0.55%.

This paper presents the Speech Technology Center (STC) systems submitted to Automatic Speaker Verification Spoofing and Countermeasures (ASVspoof) Challenge 2015. In this work we investigate different acoustic feature spaces to determine reliable and robust countermeasures against spoofing attacks. In addition to the c…

2015-07-29abs ↗pdf ↗

Visual spoofing bypasses spam filters and plagiarism detection.

problem Vulnerability in spam filters that can be exploited by visually similar but differently encoded characters.
method Replaces characters with visually similar but differently encoded characters from a different alphabet.
result Spammers can create messages that bypass existing spam filters.

New spoofing strategies show PoL verification is more vulnerable than previously thought.

problem Vulnerability of Proof-of-Learning verification mechanisms.
method Developed new spoofing strategies that can be reproduced across different configurations and are more cost-effective.
result Current PoL verification is not robust to adversaries and requires further understanding of optimization in deep learning.

Enhances 2D face recognition with 3D features using active illumination.

problem Improving robustness of 2D face recognition to spoofing attacks and low-light conditions.
method Projecting a high spatial frequency pattern onto the face to recover 3D information and a 2D image simultaneously.
result Significantly boosts face recognition performance and dramatically improves robustness to spoofing attacks.

This paper describes the Speech Technology Center (STC) antispoofing systems submitted to the ASVspoof 2019 challenge. The ASVspoof2019 is the extended version of the previous challenges and includes 2 evaluation conditions: logical access use-case scenario with speech synthesis and voice conversion attack types and ph…

2019-04-11abs ↗pdf ↗

This paper presents the Speech Technology Center (STC) replay attack detection systems proposed for Automatic Speaker Verification Spoofing and Countermeasures Challenge 2017. In this study we focused on comparison of different spoofing detection approaches. These were GMM based methods, high level features extraction …

2017-05-24abs ↗pdf ↗

New method uses statistical physics to detect financial market manipulation.

problem Detecting financial market manipulation activities like spoofing and layering.
method Modeling order book dynamics as particle motion and using momentum measure.
result Method outperforms conventional Z-score-based anomaly detection.

An attacker may use a variety of techniques to fool an automatic speaker verification system into accepting them as a genuine user. Anti-spoofing methods meanwhile aim to make the system robust against such attacks. The ASVspoof 2017 Challenge focused specifically on replay attacks, with the intention of measuring the …

2018-10-31abs ↗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 ↗

Framework detects covert financial market manipulation using LOB representations.

problem Detecting covert financial market manipulation (spoofing) from complex anomaly patterns in multilevel prices.
method Cascaded contrastive representation learning of LOB data.
result Transformer-based architectures achieve state-of-the-art results in detection performance.

Study uses agent-based simulation to analyze impact of OBI strategy on financial markets.

problem Improving execution in markets with supply-demand imbalance.
method Built an execution algorithm that accounts for OBI, tested it in artificial markets.
result OBI strategy can improve execution, especially in volatile markets.

This study combines ASV and CM systems for better performance using reinforcement learning.

problem Improving the combined performance of ASV and CM systems for better t-DCF measure.
method Training ASV and CM components together using reinforcement learning.
result Training ASV and CM components together improves the performance of the combined system.

The paper analyzes algorithmic trading in cryptocurrency exchanges, finding a profitable strategy involving indirect conversions.

problem Lack of empirical analysis of algorithmic trading in cryptocurrency exchanges.
method Empirical analysis using historical trades data from Binance.
result A triangular arbitrage strategy yields a 14.4 basis point advantage over direct exchanges.

Framework detects and ranks suspicious market manipulation using temporal convolutions and expert assessment.

problem Detecting and deterring rogue agents in financial markets.
method Weakly supervised learning, expert assessment, similarity search.
result Promising preliminary results in detecting and ranking suspicious market manipulation.

We introduce a framework for analyzing transductive combination of Gaussian process (GP) experts, where independently trained GP experts are combined in a way that depends on test point location, in order to scale GPs to big data. The framework provides some theoretical justification for the generalized product of GP e…

2015-11-24abs ↗pdf ↗

Efficiently optimize GPs by reusing candidate solutions multiple times.

problem High computational cost of Gaussian process optimization due to unique historical points.
method Sticking to a candidate solution for multiple evaluation steps and limiting switches.
result Improved efficiency and practicality of Gaussian process optimization algorithms.

HIP-GP improves GP inference for inter-domain observations with millions of inducing points.

problem Inference for Gaussian Processes across different domains.
method Hierarchical inducing point Gaussian process with grid structure and stationary kernel assumption.
result Improved approximation accuracy through increased number of inducing points.

This paper improves GP for learning complex data distributions.

problem Vanilla Gaussian processes struggle with complex data distributions.
method Introduces scalable GP paradigms with latent variables and variational inference.
result Scalable modulated GPs, especially latent GPs, learn diverse data distributions better.

Develops SGP-VAE for efficient sparse GP inference in multi-dimensional datasets.

problem Sparse GP approximations and missing data in multi-dimensional spatio-temporal datasets.
method Leverages partial inference networks for sparse GP approximations and amortized variational inference.
result Outperforms multi-output GPs and structured VAEs in various experiments.

Framework for applying GPs to real-world data with scalability guidelines.

problem Deployment of Gaussian Processes (GPs) is hindered by computational costs and lack of guidelines.
method Proposed a framework for identifying GP suitability and setting up robust models, formalizing decisions of experienced practitioners.
result More accurate results at test time for glacier elevation change case study.

It has long been known that a single-layer fully-connected neural network with an i.i.d. prior over its parameters is equivalent to a Gaussian process (GP), in the limit of infinite network width. This correspondence enables exact Bayesian inference for infinite width neural networks on regression tasks by means of eva…

2017-11-01abs ↗pdf ↗

We propose a multiresolution Gaussian process to capture long-range, non-Markovian dependencies while allowing for abrupt changes. The multiresolution GP hierarchically couples a collection of smooth GPs, each defined over an element of a random nested partition. Long-range dependencies are captured by the top-level GP…

2012-09-05abs ↗pdf ↗