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

2795588371,116 · Jun 202019922001200920172026
48 results for uncorrelated data

Deep learning identifies space objects from uncorrelated observations.

problem Finding small groups of observations of the same space objects from a large set of uncorrelated data.
method Training a deep learning model on a large data set of uncorrelated observations to identify groups of observations likely of the same space objects.
result The model correctly identified 83.1% of observation pairs as belonging to the same space object.

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 model selects uncorrelated and discriminative features for unsupervised feature selection.

problem Selecting uncorrelated and discriminative features in high-dimensional data.
method Adaptive graph-based generalized regression model with uncorrelated constraint and 2,1\ell_{2,1}-norm regularization.
result The model effectively selects uncorrelated and discriminative features, improving clustering performance.

Improved option pricing for SABR model using Gauss-Hermite quadrature.

problem Improving accuracy of option pricing in the SABR model.
method Using Gauss-Hermite quadrature for numerical integration of the integrated variance.
result New method provides accurate option prices across all strike prices.

Efficiently selects predictors in sparse regression without approximations.

problem High computational cost in subset selection for sparse regression.
method Conditional uncorrelation formula and efficient non-approximate method.
result Significant reduction in computational complexity for subset selection.

Polynomial-time method solves complex combinatorial semi-bandits.

problem Optimal strategies for combinatorial semi-bandits with uncorrelated Gaussian rewards.
method Proposes a polynomial-time method to solve the Graves-Lai optimization problem for various combinatorial structures.
result First known approach to implement asymptotically optimal algorithms in polynomial time for combinatorial semi-bandits.

Graphical lasso models ASR utterance dependencies for consistent WER estimation.

problem Modeling dependent structure among ASR utterances for accurate significance analysis.
method Graphical lasso for dependency modeling, followed by blockwise bootstrap resampling.
result Statistically consistent variance estimator of WER under mild conditions.

Recently, the visibility graph has been introduced as a novel view for analyzing time series, which maps it to a complex network. In this paper, we introduce new algorithm of visibility, "cross-visibility", which reveals the conjugation of two coupled time series. The correspondence between the two time series is mappe…

2013-01-06abs ↗pdf ↗

In this work, we propose a subspace-based algorithm for DOA estimation which iteratively reduces the disturbance factors of the estimated data covariance matrix and incorporates prior knowledge which is gradually obtained on line. An analysis of the MSE of the reshaped data covariance matrix is carried out along with c…

2018-05-01abs ↗pdf ↗

Markowitz' celebrated optimal portfolio theory generally fails to deliver out-of-sample diversification. In this note, we propose a new portfolio construction strategy based on symmetry arguments only, leading to "Eigenrisk Parity" portfolios that achieve equal realized risk on all the principal components of the covar…

2016-10-27abs ↗pdf ↗

We discuss martingales, detrending data, and the efficient market hypothesis for stochastic processes x(t) with arbitrary diffusion coefficients D(x,t). Beginning with x-independent drift coefficients R(t) we show that Martingale stochastic processes generate uncorrelated, generally nonstationary increments. Generally,…

2007-01-23abs ↗pdf ↗

Researchers use quantum chaos and RMT to analyze turbulence, revealing unique scaling laws.

problem Understanding the statistical structure and scaling laws of turbulence.
method Applied tools from quantum chaos and Random Matrix Theory to analyze turbulence datasets.
result Turbulence Gram matrices exhibit power-law scalings distinct from classical chaos and random data.

We are often interested in explaining data through a set of hidden factors or features. When the number of hidden features is unknown, the Indian Buffet Process (IBP) is a nonparametric latent feature model that does not bound the number of active features in dataset. However, the IBP assumes that all latent features a…

2012-05-09abs ↗pdf ↗

Based on the Multifractal Detrended Fluctuation Analysis (MFDFA) and on the Wavelet Transform Modulus Maxima (WTMM) methods we investigate the origin of multifractality in the time series. Series fluctuating according to a qGaussian distribution, both uncorrelated and correlated in time, are used. For the uncorrelated …

2009-07-16abs ↗pdf ↗

We uncover scaling laws and statistical structure in complex datasets.

problem Understanding universal traits in complex datasets.
method Analogizing data to physical systems, using statistical physics and RMT.
result Real-world datasets and Gaussian data with long-range correlations share the same RMT universality class.

New method identifies structural parameters without assuming uncorrelated errors.

problem Identifying structural parameters in simultaneous equation models.
method Exploits higher-order cumulant restrictions, not requiring uncorrelated errors.
result Simple diagonality condition on hhth-order cumulants identifies structural parameter matrix.

Paper solves multi-dimensional passport option pricing problem using machine learning.

problem Pricing multi-dimensional passport options in correlated markets remains unsolved.
method Discrete-time solution for multi-dimensional BS markets with uncorrelated assets; machine learning approaches.
result Machine learning-powered approaches successfully price passport options in both 1D and multi-dimensional uncorrelated BS markets.

The paper maps time-series onto networks to reveal hidden joint information.

problem Extract hidden joint information from uncorrelated time-series.
method Discretize time-series amplitudes, map onto networks, measure coupling deviations, and compare with Gaussian distributions.
result Markets may possess joint patterns even if initially uncorrelated.

Paper presents a new framework for optimal asset and signal combination.

problem Optimal asset and signal combination problem.
method Two-stage approach: reformulate dynamic portfolio selection problem, then use Canonical Correlation Analysis.
result Improved performance of proposed method over natural benchmarks.

New algorithm reduces combinatorial semi-bandit regret efficiently.

problem Optimizing rewards from uncorrelated items in combinatorial semi-bandits.
method Developed an approximate version of ESCB with polynomial complexity.
result Achieved statistically efficient and polynomial time algorithm for combinatorial semi-bandits.

It is known that the impact of transactions on stock price (market impact) is a concave function of the size of the order, but there exists little quantitative theory that suggests why this is so. I develop a quantitative theory for the market impact of hidden orders (orders that reflect the true intention of buying an…

2008-04-24abs ↗pdf ↗

We perform the Bayesian inference of a GARCH model by the Metropolis-Hastings algorithm with an adaptive proposal density. The adaptive proposal density is assumed to be the Student's t-distribution and the distribution parameters are evaluated by using the data sampled during the simulation. We apply the method for th…

2009-08-20abs ↗pdf ↗

Many practical applications of reinforcement learning constrain agents to learn from a fixed batch of data which has already been gathered, without offering further possibility for data collection. In this paper, we demonstrate that due to errors introduced by extrapolation, standard off-policy deep reinforcement learn…

2018-12-07abs ↗pdf ↗

A measure called relative cluster entropy distinguishes between correlated and uncorrelated sequences.

problem Distinguishing between sequences with different correlation degrees.
method Minimum relative entropy principle applied to cluster partitions of power-law correlated sequences.
result Optimal Hurst exponents are selected for market price series, indicating non-markovianity.

The covariance matrix is formulated in the framework of a linear multivariate ARCH process with long memory, where the natural cross product structure of the covariance is generalized by adding two linear terms with their respective parameter. The residuals of the linear ARCH process are computed using historical data …

2009-03-09abs ↗pdf ↗

Two methods are proposed to filter correlations in DCC-GARCH residuals for foreign exchange rates.

problem Filtering correlations in DCC-GARCH residuals for accurate foreign exchange rate prediction.
method Two approaches: estimating correlation matrix as a parameter and using eigenvalue decomposition.
result The DCC-GARCH residual can be almost independent using these methods.

In training speech recognition systems, labeling audio clips can be expensive, and not all data is equally valuable. Active learning aims to label only the most informative samples to reduce cost. For speech recognition, confidence scores and other likelihood-based active learning methods have been shown to be effectiv…

2016-12-10abs ↗pdf ↗