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

Trend · papers per month

70139209278 · Jun 202019922001200920172026
48 results for error compounding

The paper develops generalization bounds for deep compound Gaussian neural networks.

problem Developing theoretical guarantees for the performance of deep neural networks.
method Novel generalization error bounds using a compound Gaussian prior and Dudley's integral.
result Theoretical bounds show generalization error scales O(nln(n))\mathcal{O}(n\sqrt{\ln(n)}) in signal dimension and O((NetworkSize)3/2)\mathcal{O}((Network Size)^{3/2}) in network size.

A new method reduces compounding errors in model-based reinforcement learning.

problem Compounding errors in long horizon predictions from model-based reinforcement learning.
method Maximum Entropy Model Rollouts (MEMR) with non-uniform sampling and prioritized experience replay.
result Significantly reduces computation requirements compared to other model-based methods.

Clarifies model-based RL's theoretical issues and counterexamples for popular losses.

problem Model-based reinforcement learning's empirical performance vs. theoretical properties and popular loss functions.
method Analyzes empirical and theoretical aspects of model-based RL and constructs counterexamples for losses.
result MuZero loss fails in stochastic and deterministic environments, leading to exponential sample complexity.

Mack's estimator improves chain ladder prediction for large exposure insurance models.

problem Uncertainty quantification in compound Poisson loss models.
method Large exposure asymptotics applied to Mack's estimator.
result Chain ladder prediction uncertainty can be quantified without model assumptions.

Model-based reinforcement learning is an appealing framework for creating agents that learn, plan, and act in sequential environments. Model-based algorithms typically involve learning a transition model that takes a state and an action and outputs the next state---a one-step model. This model can be composed with itse…

2019-05-30abs ↗pdf ↗

New method offsets DML's error-compounding issue and provides more stable causal parameter estimates.

problem Estimating ATE from observational data with robustness and stability.
method Robust Causal Learning (RCL) method to offset DML's deficiencies.
result RCL estimators are more stable and perform better than DML and traditional estimators.

Action chunking and data exploration improve behavior cloning in robotics.

problem Exponential errors in learning from demonstrations for continuous control tasks.
method Action chunking and exploratory data collection.
result Control-theoretic stability is key to improving imitation learning.

The study improves compound selection in in silico screening by focusing on model's ability to predict desirable outcomes.

problem Improving compound selection in in silico screening to reduce errors and enhance generalization.
method Extending learning theory, the study analyzes the impact of selection policies on generalization and proposes a method to mitigate challenges.
result Generalization can be enhanced by considering a model's ability to predict the fraction of desired outcomes in a batch.

The task of multi-step ahead prediction in language models is challenging considering the discrepancy between training and testing. At test time, a language model is required to make predictions given past predictions as input, instead of the past targets that are provided during training. This difference, known as exp…

2018-09-16abs ↗pdf ↗

The paper shows robustness of Hilbert space-valued stochastic volatility models to perturbations.

problem Robustness of Hilbert space-valued stochastic volatility models to measurement or approximation errors.
method Quantifying the error induced by volatility perturbations and studying robustness of volatility process with finite dimensional approximations.
result Explicit bounds for the induced error in terms of approximation of the underlying parameter.

Study estimates Medallion's compounded return before fees at 31.8%.

problem Incorrectly using yearly returns for compounding leads to overestimation of fund performance.
method Used fund sizes and trading profits to estimate compounded return; used manager's wealth as proxy for Simons.
result Annualized compounded return of Medallion before fees is likely under 35%

Characterizes measures preserving compound mixed renewal process properties.

problem Preserving compound mixed renewal process properties under different probability measures.
method Characterization of progressively equivalent probability measures.
result Any compound mixed renewal process can be converted into a compound mixed Poisson process through a change of measures.

This chapter is an attempt to present a mathematical theory of compound fractional Poisson processes. The chapter begins with the characterization of a well-known Lévy process: The compound Poisson process. The semi-Markov extension of the compound Poisson process naturally leads to the compound fractional Poisson proc…

2011-03-03abs ↗pdf ↗

High throughput screening of compounds (chemicals) is an essential part of drug discovery [7], involving thousands to millions of compounds, with the purpose of identifying candidate hits. Most statistical tools, including the industry standard B-score method, work on individual compound plates and do not exploit cross…

2017-09-28abs ↗pdf ↗

In this paper, we introduce a new model for the risk process based on general compound Hawkes process (GCHP) for the arrival of claims. We call it risk model based on general compound Hawkes process (RMGCHP). The Law of Large Numbers (LLN) and the Functional Central Limit Theorem (FCLT) are proved. We also study the ma…

2017-06-27abs ↗pdf ↗

Normalized compound random measures are flexible nonparametric priors for related distributions. We consider building general nonparametric regression models using normalized compound random measure mixture models. Posterior inference is made using a novel pseudo-marginal Metropolis-Hastings sampler for normalized comp…

2016-08-02abs ↗pdf ↗

New Riemannian geometry for Compound Gaussian distributions applied to efficient change detection.

problem Change detection in multivariate image times series.
method Developed a recursive approach based on Riemannian optimization.
result Optimal performance achieved with computational efficiency.

Study develops advanced models to forecast complex LOB data.

problem Forecasting high-frequency data in a limit order book (LOB).
method Advanced multidimensional sequence-to-sequence models with compound multivariate embedding.
result Method outperforms other multivariate forecasting methods, achieving lowest forecasting error.

Abstract MDPs enable strategic exploration and fast reward transfer in complex environments.

problem Challenging to learn accurate MDPs for high-dimensional states.
method Learn an abstract MDP over low-dimensional coarse states, using an abstraction function.
result Achieves superhuman performance on Pitfall! and higher reward with fewer samples.

Recursive training of generative models can lead to model collapse, and the recursion converges to a unique limiting distribution.

problem Model collapse in recursive training of generative models
method Recursive training on their own outputs
result Recursive training converges to a unique limiting distribution

We present a novel view that unifies two frameworks that aim to solve sequential prediction problems: learning to search (L2S) and recurrent neural networks (RNN). We point out equivalences between elements of the two frameworks. By complementing what is missing from one framework comparing to the other, we introduce a…

2016-07-18abs ↗pdf ↗

We propose an analytical approach to the computation of tail probabilities of compound distributions whose individual components have heavy tails. Our approach is based on the contour integration method, and gives rise to a representation of the tail probability of a compound distribution in the form of a rapidly conve…

2017-10-03abs ↗pdf ↗

Study shows convergence rates for BSDEs approximated by compound Poisson processes.

problem Analyzing convergence rates of BSDEs driven by Lévy processes.
method Approximating Lévy processes by compound Poisson processes and studying BSDEs.
result Optimal convergence rates derived for BSDEs in L2\mathbb L^2-norm and Wasserstein distance.

Bayesian learning improves reliability of molecular predictions for hit compound discovery.

problem Improving reliability of machine learning predictions for virtual screening.
method Bayesian learning algorithms applied to graph neural networks.
result Bayesian learning leads to well-calibrated predictions and higher hit compound success.

The study addresses overlooked data-generating processes in time-series asset pricing.

problem The literature on time-series asset pricing overlooks the data-generating processes for factors expressed in return differences.
method The study proposes a new definition of returns and compound returns for factors, and uses OLS with net returns for single-index models.
result OLS with net returns for single-index models leads to inflated alphas, exaggerated t-values, and overestimated Sharpe ratios.

In this paper, we study various new Hawkes processes. Specifically, we construct general compound Hawkes processes and investigate their properties in limit order books. With regards to these general compound Hawkes processes, we prove a Law of Large Numbers (LLN) and a Functional Central Limit Theorems (FCLT) for seve…

2018-11-06abs ↗pdf ↗