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

1.1%2.1%3.2%4.2% · Feb 202519922001200920172026
48 results for uncorrelated rewards

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.

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.

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.

Study tests adequacy of FARIMA models with uncorrelated but non-independent errors.

problem Testing adequacy of FARIMA models with specific error characteristics.
method Derive asymptotic distributions of residual autocovariances and autocorrelations, propose self-normalization approach.
result Asymptotic distributions of modified portmanteau statistics for weak FARIMA models.

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.

State entropy regularization improves robustness in reinforcement learning, especially under structured perturbations.

problem Structured and spatially correlated perturbations in reinforcement learning.
method State entropy regularization, compared to policy entropy.
result State entropy regularization provides better robustness to structured and spatially correlated perturbations.

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 ↗

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.

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 ↗

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 ↗

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.

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.

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.

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 ↗

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.

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.

Reward hacking exploits misspecified rewards, affecting agent capabilities and true performance.

problem Reward hacking in RL models exploiting reward misspecifications.
method Constructed four RL environments with misspecified rewards; analyzed agent capabilities and behavior.
result More capable agents exploit reward misspecifications, achieving higher proxy reward but lower true reward.

Paper introduces PRMs to learn non-Markovian stochastic rewards for reinforcement learning.

problem Lack of structured representation for non-Markovian stochastic rewards in reinforcement learning.
method Introduces probabilistic reward machines (PRMs) and presents an algorithm to learn them from decision processes.
result Algorithm proves correct and convergent for learning PRMs from decision processes.

Paper addresses reward learning issues in RL, improving both under- and over-estimation.

problem Reward learning from data can lead to reward delusions or underestimation, causing unintended behaviors.
method Connects reward learning to positive-unlabeled (PU) learning and applies a large-scale PU learning algorithm.
result Improves both GAIL and supervised reward learning without additional assumptions.

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 ↗

Self-supervised reward prediction improves RL in sparse reward settings.

problem Data efficiency and sparse reward signals in reinforcement learning.
method Learning a state representation for reward prediction and using it to shape rewards.
result Self-supervised reward prediction enhances RL algorithms in single-goal environments.

The study categorizes reward errors in reinforcement learning, finding some can be beneficial.

problem Training language models with imperfect proxy rewards.
method Theoretical analysis of policy gradient optimization and categorization of reward errors.
result Reward errors can be benign or even beneficial, preventing policy from stalling.

Reward collapse occurs when ranking-based reward models yield uniform rewards for different prompts.

problem Reward collapse in aligning large language models with human preferences.
method Introduced a prompt-aware optimization scheme to derive closed-form expressions for reward distributions.
result Our prompt-aware utility functions significantly alleviate reward collapse during training.

Proposes a method to boost deep reinforcement learning with sparse rewards.

problem Challenges in learning complex behaviors with long horizons and sparse rewards.
method Predictive coding for reward shaping.
result Achieves better learning by providing reward signals that understand environment dynamics and emphasize useful features.

Action guidance helps agents learn true objectives in games with sparse rewards.

problem Training agents in games with sparse rewards requires significant exploration.
method Action guidance, a novel technique that combines exploration with reward shaping.
result Action guidance enables agents to optimize true objectives efficiently.

New RL method uses distance between states instead of rewards for sparse reward environments.

problem Sparse rewards or non-reward environments in reinforcement learning.
method Uses goal-distance gradient and bridge point planning for policy improvement.
result Significantly better performance on sparse reward and local optimal problems in complex environments.