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

Trend · papers per month

265277103 · May 202619922001200920172026
48 results for Cross-Exchange Signals

We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group S2n+1S_{2n+1}. We define two classes of moves on such permutations, called trivial petal additions and crossing exchanges, which do not change the isotopy class of the underlying knot. We prove that a…

2018-12-21abs ↗pdf ↗

A plane graph HH is a {\em plane minor} of a plane graph GG if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes GG to HH. Motivated by knot theory problems, it has been asked if the plane minor relation is a well-quasi-order. We settle this in the affirmativ…

2019-05-06abs ↗pdf ↗

The paper investigates cyclic arbitrage opportunities in decentralized exchanges.

problem Price discrepancies in decentralized exchanges lead to arbitrage opportunities.
method Theoretical framework and analysis of transaction-level data.
result Traders have executed over 292,606 cyclic arbitrages over eleven months, exploiting more than 138 million USD in revenue.

Study compares market microstructure between two South African exchanges.

problem Understanding price response dynamics and market microstructure differences between two South African exchanges.
method Comparative analysis of returns distributions, auto-correlations, price impact, and trading costs on different time scales.
result Similar stylized facts emerge as measurement time scale increases, but price responses vary significantly.

A new geometry for comparing signals, overcoming traditional limitations.

problem Comparing and interpolating discontinuous and signed signals.
method Investigation of Riemannian geometry on signal space, introducing a metric that measures both horizontal and vertical deformations.
result Characterization of metric properties and establishment of geodesic regularity and stability.

Paper presents a unique method to recover signals from their bispectrum.

problem Retrieving signals accurately from their bispectrum.
method Two-step trust region algorithm that minimizes a non-convex objective function.
result Signals with finite spectral or temporal support can be recovered from at least 3B measurements of their bispectrum.

Paper proposes efficient methods for clustering and signal recovery in high-dimensional data with block structures.

problem High-dimensional clustering and signal recovery under block signal structures.
method CFA-PCA and MA-PCA methods for sparse and dense block signals.
result Proposed methods achieve computational minimax optimality for clustering and signal recovery.

New framework models graph signals as distribution-valued signals in Wasserstein space.

problem Limitations of classical vector-based GSP, including synchronous observations and uncertainty.
method Introduces graph distribution-valued signals (GDSs) in the Wasserstein space.
result GDSs naturally encode uncertainty and stochasticity, generalizing traditional graph signals.

New algorithms improve signal processing in federated learning.

problem Efficiently process distributed signal samples with privacy and communication constraints.
method Proposes overpredictive signal approximations using convex optimization.
result Quantifies tradeoffs between communication cost, sampling rate, and approximation error.

We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph. Graph signal recovery implies recovery of one or multiple smooth graph signals from noisy, corrupted, or incomplete measurements. We propose a graph signal model and formulate signal recovery as a cor…

2014-11-26abs ↗pdf ↗

This paper reconstructs complex graph signals using kernel methods on manifolds.

problem Reconstructing complex graph signals from samples on graph vertices.
method Kernel methods on complex manifolds, embedding vertices into higher-dimensional spaces.
result Effective reconstruction of complex graph signals, outperforming conventional methods.

Study on signal-plus-noise decomposition in nonlinear spiked random matrices.

problem Nonlinear spiked random matrix models with rank-one signal and noise.
method Signal-plus-noise decomposition and phase transition analysis.
result Identified precise phase transitions in signal components at critical thresholds.

We find ways to make physical signals misclassified by computer vision models.

problem Vulnerability of signal classifiers to adversarial perturbations in physical signals.
method Solving PDE-constrained optimization problems to construct imperceptible perturbations.
result Effective and physically realizable adversarial perturbations can be computed for machine learning models.

The presence of noise is common in signal processing regardless the signal type. Deep neural networks have shown good performance in noise removal, especially on the image domain. In this work, we consider deep neural networks as a denoising tool where our focus is on one dimensional signals. We introduce an encoder-de…

2018-12-20abs ↗pdf ↗

Optimizes signal detection in particle physics by decorrelating classifiers.

problem Systematic errors in background models can mislead signal detection.
method Use optimal transport to decorrelate classifiers from protected variables, then apply semiparametric mixture model.
result Decorrelation and signal enrichment improve the stability, robustness, and power of signal detection tests.

Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm optimization. Recent investigation shows that some signals are sparse in multiple domains.…

2012-06-04abs ↗pdf ↗

Paper improves signal proportion estimation by accounting for variable dependence.

problem Traditional estimators assume independence, limiting applicability in real-world scenarios.
method Integrates arbitrary covariance dependence information using principal factor approximation.
result Method outperforms state-of-the-art estimators in accuracy and detection of weaker signals.

A new model classifies lightning signals more accurately across different scales.

problem Classifying VLF lightning transients to reduce interference and improve navigation system reliability.
method Introduces a multi-scale residual transformer (MRTransformer) to classify lightning signals.
result Achieved 90% accuracy in lightning signal classification.

Generalizes PCA and ICA for continuous-time signals using neural networks.

problem Low-rank decomposition of continuous-time vector-valued signals.
method Implicit neural network framework to learn numerical approximations of PCA and ICA.
result Unified approach to PCA and ICA in continuous domain, enforcing decorrelation and independence.

Research compares ML and Time Series methods for generating trading signals.

problem Efficiency of on-line learning Algorithms in generating trading signals.
method Used technical indicators and ensemble of Random Forests, also Kalman Filter.
result Kalman Filter outperformed Random Forests in on-line learning predictions of stock prices.

We study the problem of corrupted sensing, a generalization of compressed sensing in which one aims to recover a signal from a collection of corrupted or unreliable measurements. While an arbitrary signal cannot be recovered in the face of arbitrary corruption, tractable recovery is possible when both signal and corrup…

2013-05-11abs ↗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 ↗

High throughput biomedical measurements normally capture multiple overlaid biologically relevant signals and often also signals representing different types of technical artefacts like e.g. batch effects. Signal identification and decomposition are accordingly main objectives in statistical biomedical modeling and data…

2017-10-23abs ↗pdf ↗

Many problems in image processing and computer vision (e.g. colorization, style transfer) can be posed as 'manipulating' an input image into a corresponding output image given a user-specified guiding signal. A holy-grail solution towards generic image manipulation should be able to efficiently alter an input image wit…

2017-03-21abs ↗pdf ↗

Paper learns hypergraph structures from signals with smoothness priors.

problem Learning hypergraph structures from signals with high-order relationships.
method Proposes HGSL framework with dual smoothness prior to map signals to hypergraph structure.
result HGSL efficiently infers meaningful hypergraph topologies from signals.

Study detects signal in financial stock correlations using phase-ordering kinetics.

problem Detecting meaningful signals in financial stock return correlations.
method Stochastic field theory model to establish a detection threshold.
result Detection of a signal in the largest eigenvalues of the stock return correlation matrix.

This paper presents a unified framework to tackle estimation problems in Digital Signal Processing (DSP) using Support Vector Machines (SVMs). The use of SVMs in estimation problems has been traditionally limited to its mere use as a black-box model. Noting such limitations in the literature, we take advantage of sever…

2013-11-21abs ↗pdf ↗

Response calibration is the process of inferring how much the measured data depend on the signal one is interested in. It is essential for any quantitative signal estimation on the basis of the data. Here, we investigate self-calibration methods for linear signal measurements and linear dependence of the response on th…

2013-12-04abs ↗pdf ↗

Paper reviews multi-way graph signal processing for tensor data.

problem Maximizing use of multi-way structure in irregular tensor data.
method Generalizes GSP to multi-way data, focusing on graph signals across tensor modes.
result Synthesizes common themes in combining GSP with tensor analysis.

Tutorials on signal processing on higher-order networks like simplicial complexes and hypergraphs.

problem Processing complex data structures with polyadic relationships.
method Introduction to simplicial complexes and hypergraphs, Fourier analysis, signal denoising, interpolation, embeddings, neural networks.
result Multi-relational operators like the Hodge Laplacian for simplicial complexes and tensor representations for hypergraphs.

This work optimizes signal estimation for sparse MRA with collision-free signals.

problem Recovering an unknown signal from repeated observations under cyclic isometries with high noise.
method Investigates minimax optimality for collision-free signals in the MRA model.
result The minimax optimal rate of estimation is \( \sigma^2/\sqrt{n} \) for sparse MRA.