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

4896144192 · May 202619922001200920172026
48 results for log ratios

Study detects signals in spiked Wigner models using log likelihood ratio.

problem Detecting signals in rank-one spiked Wigner models with non-Gaussian noise.
method Proved asymptotic normality of log likelihood ratio and computed error thresholds.
result Optimal signal-to-noise ratio threshold for reliable detection.

A novel method for learning DAGs from positive-valued data.

problem Causal discovery from observational data of positive-valued variables.
method Hybrid Moment-Ratio Scoring (H-MRS) algorithm combining moment-based scoring and log-scale regression.
result H-MRS integrates log-scale Ridge regression for moment-ratio estimation with a greedy ordering procedure based on raw-scale moment ratios, followed by Elastic Net-based parent selection.

In this work, a deep learning-based method for log-likelihood ratio (LLR) lossy compression and quantization is proposed, with emphasis on a single-input single-output uncorrelated fading communication setting. A deep autoencoder network is trained to compress, quantize and reconstruct the bit log-likelihood ratios cor…

2019-03-11abs ↗pdf ↗

Smart Bayes integrates generative and discriminative features for improved classification.

problem Improving classification performance by combining generative and discriminative modeling.
method Integrates generative likelihood-ratio features into a logistic-regression-style classifier.
result Often outperforms logistic regression and Naive Bayes in simulations and real data.

Adapts Altman's model to compositional data for bankruptcy prediction.

problem Predicting business default using standard financial ratios has issues.
method Uses compositional data methodology with log-ratios and machine learning.
result Compositional methods improve predictive performance, especially random forests.

A3T-GCN model forecasts FTSE100 stock prices using technical indicators and financial ratios.

problem Forecasting closing stock prices of FTSE100 constituents.
method Hybrid A3T-GCN architecture using technical indicators, financial ratios, and sector correlations.
result A3T-GCN model improves prediction accuracy with annualized log-returns and shorter sequence lengths.

Estimates Gaussian location model with ridge regularization, comparing variational and spectral methods.

problem Estimating parameters in Gaussian location model with regularization.
method Ridge-regularized log-density-ratio estimation, variational and spectral approaches.
result Regularized variational estimator has lower risk with many observations, spectral estimator with fewer observations.

SPRT-TANDEM improves sequential classification accuracy with fewer samples.

problem Efficiently classifying sequential data with high accuracy and low sampling cost.
method Deep neural network-based SPRT algorithm that estimates log-likelihood ratio of two hypotheses.
result SPRT-TANDEM achieves statistically significantly better classification accuracy than other classifiers with fewer samples.

In this note, we study the relationship between the variational gap and the variance of the (log) likelihood ratio. We show that the gap can be upper bounded by some form of dispersion measure of the likelihood ratio, which suggests the bias of variational inference can be reduced by making the distribution of the like…

2019-06-09abs ↗pdf ↗

We discuss - in what is intended to be a pedagogical fashion - a criterion, which is a lower bound on a certain ratio, for when a stock (or a similar instrument) is not a good investment in the long term, which can happen even if the expected return is positive. The root cause is that prices are positive and have skewe…

2016-10-12abs ↗pdf ↗

Researchers have constantly asked whether stock returns can be predicted by some macroeconomic data. However, it is known that macroeconomic data may exhibit nonstationarity and/or heavy tails, which complicates existing testing procedures for predictability. In this paper we propose novel empirical likelihood methods …

2014-04-30abs ↗pdf ↗

This paper extends compositional data analysis using graph signal processing.

problem Traditional log-ratios between all variables are not suitable for specific variable relationships.
method Linking compositional data analysis with graph signal processing, it considers only selected log-ratios.
result The approach retains desirable properties of scale invariance and compositional coherence.

A new algorithm detects changes in data with constant cost per iteration.

problem Detecting changes in data with low computational cost.
method Adapting pruning and maximisation techniques from Gaussian data to exponential family models.
result The algorithm can detect changes in a wide range of models with a constant per-iteration cost.

Let (M,g)(M,g) be a closed, oriented, Riemannian manifold of dimension mm. We call a systole a shortest non-contractible loop in (M,g)(M,g) and denote by sys(M,g)sys(M,g) its length. Let SR(M,g)=sys(M,g)mvol(M,g)SR(M,g)=\frac{{sys(M,g)}^m}{vol(M,g)} be the systolic ratio of (M,g)(M,g). Denote by SR(k)SR(k) the supremum of SR(S,g)SR(S,g) among the surfaces of fixe…

2013-11-06abs ↗pdf ↗

Study optimal strategies for insurer's dividends, investments, and liabilities.

problem Maximize insurer's utility of dividend payments over an infinite horizon.
method Perturbation approach to obtain optimal strategy and value function in closed form.
result Obtained optimal strategy and value function for log and power utility.

Investment strategy using fractional Kelly portfolios for better growth expectations.

problem Understanding optimal growth strategies for investors with varying risk appetites.
method Developed a mathematical framework for fractional-Kelly portfolios, analyzing Sharpe ratios and log-returns.
result Fractional Kelly portfolios provide a simple distributional relationship between Sharpe ratio, fractional coefficient, and log-returns.

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 ↗

Fast algorithms developed for adaptive and fully adaptive submodular maximization problems.

problem Maximizing submodular functions subject to constraints in linear time.
method Developed linear-time algorithms for two submodular maximization problems: adaptive and fully adaptive.
result Achieved (11/eε)(1-1/e-ε) approximation ratio for adaptive submodular maximization and $ rac{1-1/e-ε}{4-2/e-2ε}$ for fully adaptive submodular maximization.

New algorithm maximizes non-monotone adaptive submodular functions in linear time.

problem Maximizing non-monotone adaptive submodular functions subject to a cardinality constraint.
method Developed a linear-time algorithm for non-monotone adaptive submodular maximization.
result Achieved a 1/eε1/e-ε approximation ratio with O(nε2logε1)O(nε^{-2}\log ε^{-1}) value oracle queries.

Paper optimizes change detection in unnormalized distributions.

problem Detecting changes in unnormalized pre- and post-change distributions.
method Log-Partition Approximation Cumulative Sum (LPA-CUSUM) algorithm based on thermodynamic integration.
result Asymptotically optimal performance achieved through unbiased estimation of CUSUM statistics.

wd1 improves reasoning in dLLMs by optimizing policies without policy ratios.

problem Improving reasoning in diffusion-based large language models through RL.
method wd1: ratio-free policy optimization using weighted log-likelihood.
result wd1 outperforms diffusion-based GRPO while requiring lower computational cost.

Proposes a deep neural network for multi-dimensional functional data classification.

problem Classifying multi-dimensional functional data with non-Gaussian distributions.
method Trains a deep neural network on the principle components of the training data.
result FDNN achieves minimax optimality when log density ratio has a locally connected modular structure.

We study the problem of learning sparse structure changes between two Markov networks PP and QQ. Rather than fitting two Markov networks separately to two sets of data and figuring out their differences, a recent work proposed to learn changes \emph{directly} via estimating the ratio between two Markov network models…

2014-07-02abs ↗pdf ↗

Q-Learner estimates ratio-based treatment effects without imposing parametric structures.

problem Estimating treatment effects as ratios in non-linear settings.
method Decomposes ratio-CATE into two classification tasks, using doubly robust augmentations.
result Q-Learner outperforms other methods in low-conversion and observational data settings.

ResNets approximate log-Gaussian at initialization, improving network performance.

problem Understanding the initialization behavior of deep neural networks like ResNets.
method Analyzing ReLU ResNets in the infinite-depth-and-width limit, showing log-Gaussian behavior.
result ResNets at initialization exhibit hypoactivation and interlayer correlations, which are not captured by Gaussian limits.

Paper refines InfoNCE for accurate mutual information estimation.

problem Indirect connection of InfoNCE to mutual information estimation.
method Introduces InfoNCE-anchor with an auxiliary anchor class for consistent density ratio estimation.
result InfoNCE-anchor yields a plug-in MI estimator with significantly reduced bias.

Given a quasisymmetric homeomorphism φ\varphi of the circle, Bonsante and Schlenker proved the existence and uniqueness of the minimal Lagrangian extension fφ:H2H2f_\varphi:\mathbb{H}^2\to\mathbb{H}^2 to the hyperbolic plane. By previous work of the author, its maximal dilatation satisfies $\log K(f_\varphi)\leq C||\varphi…

2017-11-03abs ↗pdf ↗

SIXO improves inference by learning smoothing distributions from all observations.

problem Inference limitations due to ignoring future observations in filtering distributions.
method Density ratio estimation to warp filtering distributions into smoothing distributions, then use SMC with learned targets.
result Proves tighter log marginal lower bounds and more accurate inferences and estimates.

New method estimates density ratio for well-separated distributions using multi-class logistic regression.

problem Challenges in estimating density ratio for well-separated distributions.
method Uses multi-class logistic regression with auxiliary densities to estimate log(p/q).
result Demonstrates superior performance on density ratio estimation, mutual information, and representation learning tasks.

The paper optimizes portfolios using clustering and Sharpe ratio-based optimization.

problem Optimizing portfolio performance in financial modeling.
method Combines K-Means clustering for asset segmentation and Sharpe ratio-based optimization.
result Optimized portfolios outperform traditional equal-weighted benchmarks.

Optimally tackles covariate shift in RKHS-based nonparametric regression.

problem Covariate shift in nonparametric regression over RKHS.
method Two families of covariate shift problems defined using likelihood ratios. Minimax rate-optimal estimators for KRR and reweighted KRR.
result KRR is minimax rate-optimal and strictly sub-optimal compared to naive estimator under covariate shift.

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.

In this paper we describe a new algorithm called Fast Adaptive Sequencing Technique (FAST) for maximizing a monotone submodular function under a cardinality constraint kk whose approximation ratio is arbitrarily close to 11/e1-1/e, is O(log(n)log2(logk))O(\log(n) \log^2(\log k)) adaptive, and uses a total of O(nloglog(k))O(n \log\log(k)) queries. …

2019-07-14abs ↗pdf ↗