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

12.5%25.0%37.5%50.0% · Dec 199319922001200920172026
48 results for paired data

Increasingly many real world tasks involve data in multiple modalities or views. This has motivated the development of many effective algorithms for learning a common latent space to relate multiple domains. However, most existing cross-view learning algorithms assume access to paired data for training. Their applicabi…

2017-11-16abs ↗pdf ↗

GP-ND avoids obstacles in trajectory planning using Gaussian Process regression.

problem Avoiding obstacles in trajectory planning for real-world systems.
method GP-ND models negative data pairs using Gaussian distributions and maximizes their KL divergence from the GP to avoid them.
result GP-ND outperforms traditional GP learning in obstacle-aware trajectory planning.

Paired autoencoders solve inverse problems using latent space projections.

problem Solving inverse problems in scientific computing.
method Paired autoencoder framework that projects data and quantity of interest into a latent space.
result Paired autoencoders generate multiple reconstruction metrics and enable latent-space refinement for accurate data fitting.

PAIR-CI calibrates CI tests for causal discovery with incomplete data.

problem Miscalibration of CI tests when imputing incomplete data.
method Integrates multiple imputation directly into the inferential procedure via a paired permutation design.
result PAIR-CI reduces false positive rates to below 5% in simulations.

In string theory, the concept of T-duality between two principal T^n-bundles E_1 and E_2 over the same base space B, together with cohomology classes h_1\in H^3(E_1) and h_2\in H^3(E_2), has been introduced. One of the main virtues of T-duality is that h_1-twisted K-theory of E_1 is isomorphic to h_2-twisted K-theory o…

2005-01-27abs ↗pdf ↗

GROOVE learns representations for weakly paired multimodal data.

problem Learning representations for high-content perturbation data with weakly paired samples.
method GroupCLIP contrastive loss integrated with an autoencoder framework.
result GROOVE performs on par with or outperforms existing approaches for cross-modal tasks.

Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problem. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basic matrix and a nonnegative coefficient matrix, and the coefficient matrix is used as the new representation. …

2013-12-05abs ↗pdf ↗

A Triangle Generative Adversarial Network (ΔΔ-GAN) is developed for semi-supervised cross-domain joint distribution matching, where the training data consists of samples from each domain, and supervision of domain correspondence is provided by only a few paired samples. ΔΔ-GAN consists of four neural networks, two ge…

2017-09-19abs ↗pdf ↗

This paper tackles unpaired data in multi-view learning, proposing a new framework and models.

problem Handling unpaired data in multi-view learning, which is more common than paired data.
method Generalized uncorrelated multi-view subspace learning framework with successive alternating approximation (SAA) method.
result Proposed models perform competitively or better than baselines in multi-view feature extraction and multi-modality classification.

New MMD estimators detect differences in missing paired data.

problem Handling missing data in matched pairs with complex distributions.
method Maximum mean discrepancy (MMD) estimators for complex data with missing values.
result Valid and consistent estimators detect differences in data distributions.

A new framework for paired-sample testing in high-dimensional data.

problem Challenges in standard paired-sample testing for high-dimensional data.
method Develops a two-step testing procedure using scoring functions and Wilcoxon signed-rank test.
result Substantial performance gains in testing accuracy compared to traditional methods.

New method uses exponential family priors to handle shuffled data problems.

problem Handling mismatch errors in record linkage of two data files.
method Flexible exponential family prior on the permutation group for regularization.
result The proposed method outperforms competing methods in synthetic and real data.

MTRGL learns temporal correlations from multi-modal data for improved pair trading.

problem Discerning temporal correlations among financial entities.
method Combines time series data and discrete features into a temporal graph, using a memory-based temporal graph neural network.
result MTRGL outperforms traditional methods in temporal graph link prediction and pair trading.

In this study, we applied a stochastic spread pairs trading strategy on the Indian commodity market. The complete set of commodities were taken whose spot price was available for the period of January 1st 2010 to December 31st 2018 including energy, metals and the agricultural commodity sector. Spot data was taken from…

2019-07-19abs ↗pdf ↗

In the past decades, intensive efforts have been put to design various loss functions and metric forms for metric learning problem. These improvements have shown promising results when the test data is similar to the training data. However, the trained models often fail to produce reliable distances on the ambiguous te…

2018-02-09abs ↗pdf ↗

We present a novel, scalable and Bayesian approach to modelling the occurrence of pairs of symbols (i,j) drawn from a large vocabulary. Observed pairs are assumed to be generated by a simple popularity based selection process followed by censoring using a preference function. By basing inference on the well-founded pri…

2014-09-09abs ↗pdf ↗

Unified pair trading approach using hierarchical reinforcement learning.

problem Decoupling pair selection and trading leads to limited performance.
method Hierarchical reinforcement learning framework for joint pair selection and trading.
result Unified approach outperforms existing methods on real-world stock data.

New method learns functions without paired data using mediating variables.

problem Learning functions without paired input-output data.
method Mediated Uncoupled Learning: Predicting h(U)h(U) to approximate YY.
result Statistical consistency and error bounds of the proposed method.

A new method for conditional sampling using paired Wasserstein Autoencoders.

problem Conditional sampling from complex data distributions.
method Derive a novel loss function for Wasserstein Autoencoders to enable sampling from OT-type couplings.
result Learned cost-optimal transport maps and conditional sampling from an OT-type coupling.

A novel graphical matching approach improves pairs trading by reducing portfolio variance and risk-adjusted returns.

problem Common pairs trading methods lead to high portfolio variance and low risk-adjusted returns due to focusing on highly cointegrated assets.
method Model all assets and their cointegration levels with a weighted graph. Select pairs as a maximum weighted matching to ensure no shared assets and lower portfolio variance.
result The matching-based strategy shows a significant improvement in risk-adjusted performance, with a gross Sharpe ratio of 1.23.

A pairs trading model with time-varying volatility using stochastic control.

problem Optimizing pairs trading strategies with fluctuating asset volatilities.
method Stochastic control techniques, Finite Difference method, Generalized Method of Moments.
result Optimal trading strategies maximizing expected power utility from terminal wealth.

Paper develops a new unsupervised scoring function for cross-lingual document alignment.

problem Aligning documents across different languages for NLP tasks.
method Uses cross-lingual sentence embeddings to compute semantic distances and guides document alignment.
result The proposed scoring function outperforms current methods by 7-22% on various language pairs.

In ranking problems, the goal is to learn a ranking function from labeled pairs of input points. In this paper, we consider the related comparison problem, where the label indicates which element of the pair is better, or if there is no significant difference. We cast the learning problem as a margin maximization, and …

2014-01-30abs ↗pdf ↗

New method recovers diverse policies from expert data using state-action pair weighting.

problem Recovering diverse policies from expert trajectories.
method Pointwise mutual information weighted behavioral cloning.
result Effective in focusing on state-action pairs most representative of the style.

Cross-lingual document alignment aims to identify pairs of documents in two distinct languages that are of comparable content or translations of each other. In this paper, we exploit the signals embedded in URLs to label web documents at scale with an average precision of 94.5% across different language pairs. We mine …

2019-11-10abs ↗pdf ↗

Proves accuracy guarantees for self-supervised learning with correlated positive pairs.

problem Lack of theoretical guarantees for self-supervised learning with correlated positive pairs.
method Novel augmentation graph concept and spectral decomposition loss.
result Provably accurate features under linear probe evaluation.

Sparse neural networks visualize paired transcriptomic and electrophysiological data.

problem Efficiently analyzing and visualizing paired multivariate neuroscientific data.
method Sparse deep neural networks with a two-dimensional bottleneck and group lasso penalty.
result Biologically interpretable two-dimensional visualizations of paired data.

In the recent years, we have witnessed the development of multi-label classification methods which utilize the structure of the label space in a divide and conquer approach to improve classification performance and allow large data sets to be classified efficiently. Yet most of the available data sets have been provide…

2017-04-27abs ↗pdf ↗

In this paper we present a novel approach for firm default probability estimation. The methodology is based on multivariate contingent claim analysis and pair copula constructions. For each considered firm, balance sheet data are used to assess the asset value, and to compute its default probability. The asset pricing …

2014-05-06abs ↗pdf ↗

Study examines persistence diagrams in machine learning, proposing permutation tests.

problem Understanding the power and limitations of persistence diagrams in machine learning.
method Carried out experiments on graph and shape data, proposed permutation tests for persistence diagrams.
result Persistence pairing shows significant improvement in various tasks, but the most critical values are most discriminative.

A new method uses machine learning to optimize user pairing and association in multicell NOMA networks.

problem Optimizing user pairing and association in multicell non-orthogonal multiple access (NOMA) systems.
method Formulated as a combinatorial optimization problem, solved using a Pointer Network (PtrNet) trained with deep reinforcement learning.
result Achieves near-optimal performance in terms of aggregate data rate, outperforming random heuristics by up to 30%.

The goal of this study is to explain and examine the statistical underpinnings of the Bollinger Band methodology. We start off by elucidating the rolling regression time series model and deriving its explicit relationship to Bollinger Bands. Next we illustrate the use of Bollinger Bands in pairs trading and prove the e…

2012-12-20abs ↗pdf ↗

Study compares GARCH, EWMA, and IV models for GBP/USD and EUR/GBP currency pairs.

problem Predicting 20-day variation in GBP/USD and EUR/GBP currency pairs.
method Applied GARCH, EWMA, and IV models to GBP/USD and EUR/GBP pairs data.
result GARCH models outperform other models in predicting volatility for EUR/GBP, while GARCH with rolling window for GBP/USD.

A simple framework improves deep metric learning performance.

problem Imbalanced data pairs in pairwise deep metric learning.
method Formulated a robust loss for balanced pairs over mini-batches, using distributionally robust optimization.
result Empirically outperforms state-of-the-art methods.