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

Trend · papers per month

136273409545 · Jun 202019922001200920172026
48 results for Information Sufficiency Ratio

Extends likelihood ratio exponential families to analyze various optimization methods.

problem Analyzing optimization methods like rate-distortion and information bottleneck.
method Linking geometric mixture paths to exponential families and using hypothesis testing.
result Provides a common mathematical framework for understanding these methods.

Improved regret bounds for bandit phase retrieval.

problem Minimizing cumulative and simple regret in a bandit phase retrieval problem.
method Proved minimax cumulative and simple regret bounds using adaptive algorithms.
result Minimax cumulative regret is ildeΘ(dn) ilde{\Theta}(d \sqrt{n}) and minimax simple regret is ildeΘ(d/n) ilde{\Theta}(d / \sqrt{n}).

Meta-learning improves relative density-ratio estimation from limited data.

problem Estimating relative density-ratios from few instances.
method Meta-learning using neural networks to extract and embed dataset information for relative DRE.
result Meta-learning enables efficient and effective adaptation to few instances for relative DRE.

We propose a general framework for solving the group synchronization problem, where we focus on the setting of adversarial or uniform corruption and sufficiently small noise. Specifically, we apply a novel message passing procedure that uses cycle consistency information in order to estimate the corruption levels of gr…

2019-12-24abs ↗pdf ↗

The paper proposes using density ratio estimation to evaluate synthetic data quality.

problem Improving the quality and utility of synthetic data for analysis.
method Density ratio estimation to measure synthetic data quality.
result Density ratio estimation yields more accurate global utility estimates than existing methods.

Transformers for binary decisions are sensitive to evidence order, leading to unreliable outcomes.

problem Order sensitivity in Transformers for binary decisions leads to unreliable outcomes.
method Formalized an expectation-realization gap and developed QMV and EDFL bounds.
result Uniform permutation mixtures reduce dispersion and improve reliability.

Forecastability measures predictive information across horizons.

problem How much predictive information is available at each prediction horizon?
method Develops the consequences of mutual information between future observations and information set.
result Forecastability is a profile reflecting process dependence structure, with properties like compression and truncation error.

We study the effect of the quality and quantity of side information on the recovery of a hidden community of size K=o(n)K=o(n) in a graph of size nn. Side information for each node in the graph is modeled by a random vector with the following features: either the dimension of the vector is allowed to vary with nn, while …

2018-09-05abs ↗pdf ↗

Paper connects contrastive learning to MI maximization and establishes robust methods for nonlinear ICA and subspace estimation.

problem Understanding and improving unsupervised representation learning and density ratio estimation.
method The paper connects contrastive learning to MI maximization, establishes new recovery conditions for nonlinear ICA, and proposes a practical outlier-robust method for nonlinear subspace estimation.
result The proposed methods can be seen as maximizing MI, performing nonlinear ICA, or estimating nonlinear subspaces, and are robust to outliers.

Mirror descent linked to information ratio via Bayesian regret bounds.

problem Understanding stability in mirror descent and its relation to information ratio.
method Developed a connection between mirror descent and information ratio using Bayesian regret bounds.
result Mirror descent with suitable estimators and distributions achieves bounds similar to information-directed sampling.

We develop, discuss, and compare several inference techniques to constrain theory parameters in collider experiments. By harnessing the latent-space structure of particle physics processes, we extract extra information from the simulator. This augmented data can be used to train neural networks that precisely estimate …

2018-04-30abs ↗pdf ↗

The paper describes a method to infer the signal-to-noise ratio in portfolio optimization.

problem Estimating the signal-to-noise ratio in portfolio optimization problems.
method A statistic similar to the Sharpe Ratio Information Criterion is used for inference.
result The method works well for reasonable sample and asset universe sizes.

Omega ratio, defined as the probability-weighted ratio of gains over losses at a given level of expected return, has been advocated as a better performance indicator compared to Sharpe and Sortino ratio as it depends on the full return distribution and hence encapsulates all information about risk and return. We comput…

2019-10-15abs ↗pdf ↗

We consider the Principal Component Analysis problem for large tensors of arbitrary order kk under a single-spike (or rank-one plus noise) model. On the one hand, we use information theory, and recent results in probability theory, to establish necessary and sufficient conditions under which the principal component ca…

2014-11-04abs ↗pdf ↗

Optimizes kernel density ratios for better predictions and information measures.

problem Improving accuracy of kernel density estimates for density ratios.
method Derives an optimal weight function using calculus of variations.
result Reduces bias in kernel density estimates, leading to improved prediction posteriors and information-theoretic measures.

The paper shows that causal identification is not essential for efficient portfolios, focusing on geometric sufficiency conditions.

problem The necessity of causal identification for efficient portfolios.
method Re-examination of predictive signals and their impact on portfolio efficiency under structural misspecification.
result Efficiency is governed by geometric sufficiency conditions (directional alignment, ranking preservation, and calibration) rather than causal identification.

An algorithmically hard phase was described in a range of inference problems: even if the signal can be reconstructed with a small error from an information theoretic point of view, known algorithms fail unless the noise-to-signal ratio is sufficiently small. This hard phase is typically understood as a metastable bran…

2018-05-15abs ↗pdf ↗

FF algorithm uses goodness as a likelihood-ratio test for scalar normalization.

problem Training each layer locally with scalar goodness.
method FF algorithm uses a likelihood-ratio test with squared goodness as the sufficient statistic.
result The FF algorithm generalizes to anisotropic and heavy-tailed populations.

Many classical objects on a surface S can be interpreted as cross-ratio functions on the circle at infinity of the universal covering. This includes closed curves considered up to homotopy, metrics of negative curvature considered up to isotopy and, in the case of interest here, tangent vectors to the Teichmüller space…

2010-09-19abs ↗pdf ↗

Alpha-based performance evaluation may fail to capture correlated residuals due to model errors. This paper proposes using the Generalized Information Ratio (GIR) to measure performance under misspecified benchmarks. Motivated by the theoretical link between abnormal returns and residual covariance matrix, GIR is deriv…

2018-03-04abs ↗pdf ↗

OMGD algorithm optimizes online convex optimization with switching costs and delayed gradients.

problem Optimizing online convex optimization with switching costs and delayed gradients.
method Proposed an online multiple gradient descent (OMGD) algorithm for quadratic and linear switching costs.
result OMGD achieves optimal dynamic regret in the limited information setting.

The study examines how formal index insurance compares to informal risk sharing in managing natural disasters.

problem The challenges of natural disasters and the effectiveness of index insurance in risk management.
method A three-strategy evolutionary game model to analyze the competitive relationship between formal index insurance, informal risk sharing, and non-insurance.
result Basis risk and loss ratio significantly impact the adoption rate of index insurance, with different strategies preferred under varying conditions.

Paper develops estimators for unbounded density ratios with applications in error control.

problem Estimating density ratios with unbounded domains and ranges.
method Least squares and logistic regression loss functions for density ratio estimation.
result Established upper bounds on estimation errors with optimal rates for unbounded density ratios.

Gaussian prior and likelihood improve bandit learning performance.

problem Improving bandit learning with misspecified Gaussian distributions.
method An agent with a bounded information ratio interacts with a Bernoulli bandit based on a Gaussian prior and likelihood.
result The regret increase is at most linear in the square-root of the time horizon for diffuse distributions.

We study online optimization in a setting where an online learner seeks to optimize a per-round hitting cost, which may be non-convex, while incurring a movement cost when changing actions between rounds. We ask: \textit{under what general conditions is it possible for an online learner to leverage predictions of futur…

2019-11-10abs ↗pdf ↗

When the in-sample Sharpe ratio is obtained by optimizing over a k-dimensional parameter space, it is a biased estimator for what can be expected on unseen data (out-of-sample). We derive (1) an unbiased estimator adjusting for both sources of bias: noise fit and estimation error. We then show (2) how to use the adjust…

2016-02-19abs ↗pdf ↗

Thompson Sampling bounds for contextual bandits with sub-Gaussian rewards.

problem Improving the performance of Thompson Sampling in contextual bandits with sub-Gaussian rewards.
method Proved comprehensive bounds on Thompson Sampling expected cumulative regret based on mutual information and lifted information ratio for sub-Gaussian rewards.
result Explicit regret bounds for various contextual bandit scenarios.

Double descent in portfolio optimization shows improved performance with complexity, then declines, due to overfitting.

problem Improving portfolio optimization performance with model complexity.
method Investigates the relationship between model complexity and out-of-sample performance in mean-variance portfolio optimization.
result Performance of low-dimensional models initially improves with complexity but declines due to overfitting. High-dimensional models show double ascent Sharpe ratio curve.

EviTrack improves sequential prediction in delayed disambiguation scenarios.

problem Challenges in sequential prediction with delayed disambiguation where early observations are ambiguous.
method EviTrack operates over latent trajectories, applying evidence- and likelihood-ratio-based selection to delay commitment until supported by data.
result EviTrack outperforms sampling-based baselines in a controlled synthetic benchmark, achieving faster post-disambiguation recovery.

We introduce a model-independent approximation for the branching ratio of Hawkes self-exciting point processes. Our estimator requires knowing only the mean and variance of the event count in a sufficiently large time window, statistics that are readily obtained from empirical data. The method we propose greatly simpli…

2014-03-20abs ↗pdf ↗

Study uses VC correlation to uncover directional financial relationships.

problem Understanding causal relationships between financial variables.
method Volatility constrained correlation (VC correlation) method.
result Operating income is most influential, while market capitalization and revenue are most susceptible.

Turnover-adjusted IR is always lower than classic IR, suggesting managers can improve performance by limiting turnover.

problem The classic relationship between IR and its determinants does not account for turnover costs.
method Mathematical derivations and simulations considering volatility of information coefficient and portfolio turnover.
result Turnover-adjusted IR is lower and managers can improve performance by limiting turnover.

Unified framework for robust, stable, and efficient density ratio estimation.

problem Density-chasm and support-chasm problems in density ratio estimation.
method Dequantified diffusion-Schrödinger bridge (D3RE) framework with DDBI and DSBI.
result Offers uniform approximation and bounded time scores in theory and empirical performance.

We introduce a new general framework for constructing the best trading strategy for a given historical indicator. We construct the unique trading strategy with the highest expected return. This optimal strategy may be implemented directly, or its expected return may be used as a benchmark to evaluate how far away from …

2011-08-03abs ↗pdf ↗