Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.35118

Scenario Matching for Credit Dependence Stress Tests: Temporal correlation constraints and empirical risk bounds

Naoufal Nifa
View original source ↗Read source document ↗Export metadata ↓

Abstract

We couple two sets of simulated market and credit paths by minimizing absolute temporal-correlation error relative to a prescribed target. Each market path receives exactly one credit path, preserving both empirical distributions of complete scenarios. A perfect-matching test identifies whether a uniform correlation-error tolerance is feasible and determines its smallest attainable value. Further assignments give exact empirical mean-loss and exceedance-probability bounds; quantile bounds follow by binary search over eligible loss thresholds. A synthetic bond-forward credit stress test illustrates the method. The experiments report matching precision, empirical score tails and exposure-grid error, and measure matching and mean-loss computation. The method is independent of the scenario generator and provides a reproducible way to examine dependence assumptions in existing risk engines. Tail measures concern default-probability-weighted credit scores. Accompanying reproducibility package (Python code, synthetic scenario libraries, permutations, and benchmarks) is attached in the ZIP archive.

Explore related subjects

q-fin.CP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Naoufal Nifa. 2026-10-26. Scenario Matching for Credit Dependence Stress Tests: Temporal correlation constraints and empirical risk bounds. https://arxiv.org/abs/2610.35118

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Det-MASO: Diversity-Regularized Multi-Agent Sequential Optimization for Factor Generation

Quantitative investment requires alpha factors that are both predictive and diverse. However, existing factor generation methods, including formulaic mining and neural end-to-end models, are mostly based on a single-agent design, which limits exploration of the factor space and reduces adaptability to changing markets. Multi-agent approaches can broaden exploration, but agents trained under a shared objective often collapse to similar outputs, while existing diversity techniques either scale poorly with asset-universe size or address redundancy only after training. We propose a multi-agent sequential optimization (Det-MASO) framework for generating diversified, context-adaptive alpha factors. It introduces a differentiable log-determinant penalty on the inter-agent correlation matrix directly into the joint objective, discouraging correlated agent behavior during training with computational cost that scales linearly with the number of assets. We further show that this penalty prevents homogeneous equilibria and preserves factor diversity throughout optimization, while a context-conditioned scheduler dynamically adjusts agent emphasis across market regimes and Shapley interaction index analysis is used to characterize the cooperation structure that emerges among them. Experiments show that Det-MASO outperforms baselines, improving the information coefficient by 1.1\%, the annualized return by 6.4\%, and the Sharpe ratio by 0.33.

q-fin.CP↗
arXiv2026

Cross-Bond Panel Learning for Next-Day Price Forecasting of Chinese Convertible Bonds: A Reality Check

Recent advances in financial machine learning have prompted growing interest in applying deep neural networks to convertible bond valuation and forecasting. However, existing studies often focus on in-sample valuation fit or cross-sectional return rankings, leaving out-of-sample next-day price forecasting insufficiently benchmarked against persistence. This paper provides a comprehensive empirical reality check on cross-bond panel learning for Chinese convertible bonds. Using a daily panel of 73,806 observations across 100 A-share convertible bonds from 2022 to 2025, we evaluate whether cross-bond neural architectures reliably outperform the random walk under strict temporal splitting, boundary purging, fold-specific preprocessing, and dependence-aware inference. On the 29,514-observation holdout, the random walk achieves an RMSE of 2.3577 CNY. Five-seed ensembles of small and large price-change MLPs yield RMSEs of 2.3619 and 2.3645 CNY, with negative out-of-sample R^2 values (-0.0035 and -0.0057) and target-date clustered HAC p-values of 0.453 and 0.248. Ten-day circular block-bootstrap intervals span zero, while direct price-level training degrades performance substantially. Although cross-bond pooling provides a variance-stabilizing shrinkage effect over single-bond estimation (lowering test RMSE for 79 of 90 individual bonds), it fails to produce an aggregate forecast advantage over persistence. Error decomposition reveals that failure is not uniform: five highly volatile, clause-sensitive bonds account for 74.4% of the model's total excess squared error. Without contemporaneous equity market information or explicit contractual event conditioning, deep panel architectures do not deliver incremental next-day predictability over persistence.

q-fin.CP↗
arXiv2026

On the continuity of conditional distributions and stratification for derivative pricing

Stratification can reduce the estimator variance in Monte Carlo simulations by partitioning the sample space according to a low-dimensional factor and sampling separately within the resulting strata, making it well suited to the valuation of path-dependent claims in high-dimensional financial models. Its performance, however, depends critically on the choice of the stratification factor, and effective low-dimensional factors are generally difficult to identify in complex continuous-time models. Neural networks provide a flexible approximation class for this purpose and have proved useful in related variance-reduction problems in quantitative finance. In this paper, we study the construction of neural stratification factors for derivative pricing under proportional allocation in continuous-time models. Since the numerical construction of a stratification factor typically involves approximation, we establish continuity results for the associated conditional expectations and, more generally, conditional distributions, and provide several counterexamples showing the limits of this continuity theory. Combined with density results for neural networks, our findings yield a universal approximation theorem for admissible stratification factors. We conclude with numerical experiments involving a constant-maturity-swap range accrual in a two-factor Gaussian short-rate model and a worst-of autocallable in a Wishart stochastic covariance model, where the learned factors outperform all considered benchmarks.

q-fin.CP↗