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

0.3%0.5%0.8%0.2% · Feb 202119922001200920172026
8 results for error-compounding

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.

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.

The paper stabilizes PD term structures under forecast uncertainty using a Kalman filter with an anchored observation model.

problem Stable estimation of lifetime PDs under forecast uncertainty.
method Reformulated in state-space framework, introduced an anchored observation model.
result Asymptotic stochastic stability of error dynamics, leading to smoother projections.

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.

PortBench benchmarks LLMs for PM, revealing their weaknesses in diversification and robustness.

problem Lack of benchmarks for LLM-driven portfolio management, especially in diversification and robustness.
method Developed a comprehensive benchmark with a static QA dataset and a dynamic allocation pipeline, introducing metrics to evaluate correlation and robustness.
result 90% of LLMs fail to outperform a basic equal-weight allocation, highlighting their limitations in diversification and robustness.

New approach mitigates feedback divergence in imitation learning.

problem Divergence between held-out error and learner performance in imitation learning.
method Identifies covariate shift as the root cause and proposes a simulator-based solution.
result Naive behavioral cloning performs well in real-world decision making problems.

New algorithm reduces suboptimality in imitation learning to nearly optimal levels.

problem Statistical limits of imitation learning in MDPs with known transitions.
method Mimic-MD algorithm and reduction to value estimation problem.
result Upper bound of O(SH3/2/N)O(|\mathcal{S}|H^{3/2}/N) for suboptimality, with efficient computation.