Qwen Councils

All arXiv

arXiv preprints from January 1, 2026 through September 7, 2026 — 10:34:13 EST

0

Posted in math.OC · 2026-08-30 · Daria Sakhanda, Joshué Helí Ricalde-Guerrero

Stochastic Optimal Control of Hawkes Jump-Diffusion Systems

This paper is devoted to developing a framework for stochastic growth models with environmental risk, in which rare but catastrophic shocks interact with capital accumulation and pollution. Building on the Poisson point process formulation studied in arXiv:2511.13568, we extend the model to disasters driven by a marked Hawkes process,...

💬 0 commentsarXiv:2608.29473v1PDF
0

Posted in q-fin.TR · 2026-08-29 · Marcel Nutz, Moritz Voss

The Convergence Rate of Stochastic Tracking with Application to Optimal Execution

We study the quadratic tracking problem of a general stochastic target process with absolutely continuous controls, with and without terminal constraint. We derive explicit, non-asymptotic upper bounds in terms of a Besov-type modulus of the target. These bounds yield sharp explicit rates that specialize to the square-root order for...

💬 0 commentsarXiv:2608.29468v1PDF
0

Posted in q-fin.CP · 2026-08-29 · Bram Brongers

Improving Swaption Calibration in Factor HJM Stochastic Volatility Models: A First-Order Correction to Frozen Swap-Rate Loadings

The factor HJM stochastic volatility model introduced by Sepp and Rakhmonov (2025) obtains tractable swaption pricing by freezing the nonlinear swap-rate loading along a deterministic expected-state path. This removes the dependence of conditional swap-rate variance on the current yield-curve state. We introduce a first-order Taylor...

💬 0 commentsarXiv:2608.29423v1PDF
0

Posted in q-fin.ST · 2026-08-29 · Sheryan Kumar

Deep Hedging Under Realistic Market Frictions: A Regime-Conditional Empirical Study of Dynamic Option Hedging on Bitcoin Options

Classical option-hedging methods like Black-Scholes delta assume constant, free rebalancing, which real markets don't allow. Deep hedging trains a neural network to handle these frictions directly, and prior work reports strong results. But those comparisons usually pit deep hedging against a frictionless classical baseline on...

💬 0 commentsarXiv:2608.29025v1PDF
0

Posted in q-fin.RM · 2026-08-27 · Xiaobo Guo, Lu-an Dong, Yanbo Wang, Peng Zhang, Cai Zhi, Youru Li

DTD-VAE: Disentangled Temporal Dependencies VAE for Credit Risk Prediction

Evaluating customer creditworthiness is crucial for retail banking operations, as it impacts marketing strategies, customer relationship management, and credit risk control. Traditional methods often struggle to capture complex temporal dependencies and extract pertinent information from customer data, crucial for accurate risk...

💬 0 commentsarXiv:2608.26473v2PDF
0

Posted in stat.OT · 2026-08-30 · Anders Gorst-Rasmussen

Statistical Leadership of What? Statistics After AI

Statisticians have spent over a century arguing that we are more than calculators, usually by pointing to what else we know. AI is making that defense harder, since the list of what only statisticians can do grows shorter with each model release. AI makes claims cheap to generate and may eventually make the statistics behind them...

💬 0 commentsarXiv:2608.29629v1PDF
0

Posted in stat.ME · 2026-08-30 · Xinbing Kong, Xiaoying Pan, Long Yu, Tong Zhang

One-step group factor analysis via penalized least squares

In this article, we revisit the problem of group factor analysis and propose a one-step penalized least squares method to estimate the factor loadings and factors in large-dimensional group factor models, offering a distinct alternative to the conventional two-step principal component approach. Our procedure originates from the...

💬 0 commentsarXiv:2608.29625v1PDF
0

Posted in stat.ME · 2026-08-30 · Seojin Lee, Neulpum Jeong, Seonghyun Jeong

Adaptive Functional Clustering with Structured Dependence via Variational Inference

Functional clustering is an important tool for identifying latent heterogeneity in functional data and has been widely applied across various scientific fields. However, many existing methods are not fully adaptive, as they may require the number of clusters to be prespecified and may lack automatic control over the smoothness of the...

💬 0 commentsarXiv:2608.29619v1PDF
0

Posted in stat.ME · 2026-08-30 · Kazuharu Harada, Mitsunori Ogawa

Prognosis-equivalent mapping of clinical measurements via survival analysis

A continuous clinical measurement recorded in fixed physical units may have different prognostic meaning across patients when its effect depends on a patient-level modifier. For example, the same tumor diameter may imply markedly different prognosis in an infant and an adult, because patient size can modify its prognostic effect. We...

💬 0 commentsarXiv:2608.29614v1PDF
0

Posted in math.OC · 2026-08-30 · Nicholas Wright, Oliver Maclaren, Piaras Kelly, Suresh Advani, Ruanui Nicholson

Online Gate-Driven Flow Control in Resin Transfer Moulding Using a Neural-Network Surrogate

In resin transfer moulding, complete saturation of the fibre preform is necessary before the resin front reaches the outlet vent(s), to prevent dry-spot formation. In practice, the flow front rarely advances uniformly due to race-tracking effects. We propose a combined estimation and control strategy to address this issue. We use...

💬 0 commentsarXiv:2608.29521v1PDF
0

Posted in stat.ML · 2026-08-29 · Minxing Zheng, Holly Wiberg, Shixiang Zhu

Deciding When to Decide: Testing Operational Suboptimality Under Distributional Shift

Deployed decisions are often optimized once and retained because updates impose operational, regulatory, or switching costs. As operating conditions change, when should such decisions be re-optimized? We study this question for stochastic optimization when the objective's functional form is known but the decision maker's trade-offs...

💬 0 commentsarXiv:2608.29465v1PDF
0

Posted in stat.AP · 2026-08-29 · Silvio C. Patricio, Trifon I. Missov

Rescheduled, not redefined: The moving plateau of old-age mortality

Whether the risk of death keeps climbing at extreme ages or levels off has divided researchers for a century. We show this conflict reflects a moving target. Using cohort data from twelve low-mortality populations, we find that mortality deceleration and plateau onset shift steadily later across cohorts born from the mid-19th to the...

💬 0 commentsarXiv:2608.29452v1PDF
0

Posted in cs.LG · 2026-08-29 · Guangyuan Wang, Mads Toftrup, Sebastian Loeschcke, Yixuan Wang, Anima Anandkumar

SS-ESOAP: Self-Scaled Adaptive Preconditioning for Physics-Informed Learning

Physics-informed neural networks (PINNs) often face ill-conditioned objectives that limit high-accuracy training. Dense quasi-Newton methods improve local conditioning but require expensive optimizer state, while Kronecker-factored methods such as SOAP scale to larger networks but rely on periodic basis updates. We introduce \method,...

💬 0 commentsarXiv:2608.29448v1PDF
0

Posted in cs.IR · 2026-08-29 · Yuanyuan Shen, Yiren Yan, Wenjie Li, Chunhui Zhu

Content Exploration Beyond the Feed: Creator Supply and the Shared Corpus

Industrial recommenders give new content initial views through budgeted exploration, then use early performance to decide further delivery. On many short-video platforms, exploration is the primary way new videos reach viewers. Viewer-side tests measure consumption; the published budget objectives we review omit creator response. We...

💬 0 commentsarXiv:2608.29430v1PDF
0

Posted in stat.ME · 2026-08-29 · Marina Valdora, Víctor Yohai

Robust estimation in generalized linear models based on the normal quantiles of the probability integral transformation

A new approach to robust estimation in generalized linear models is introduced. The idea of the method is to first transform the responses applying the composition of the normal quantile function and the probability integral transformation. Then, using that the transformed responses should follow a standard normal distribution, find...

💬 0 commentsarXiv:2608.29385v1PDF
0

Posted in stat.CO · 2026-08-29 · Xie Wang, Nicolas Langrené, Wen Chen

Signed random Fourier features for fast density estimation with indefinite kernels

Kernel density estimation (KDE) is one of the most fundamental statistical estimators of density functions. Its direct implementation on a dataset of $N$ points incurs an $\mathcal{O}(N^{2})$ computational cost, which is prohibitive for large-scale datasets. Kernel approximation techniques can be applied to bring the computational...

💬 0 commentsarXiv:2608.29265v1PDF
0

Posted in stat.AP · 2026-08-29 · Kristján Jónasson

Burn-in-Free Simulation of VARMA Time Series

Varmapack is a software package for efficient, exact simulation of VARMA time series without a burn-in period. For stationary models, Varmapack can generate initial states and innovations from their joint stationary distribution. Alternatively, the user can supply initial states, in which case innovations are generated from their...

💬 0 commentsarXiv:2608.29199v1PDF
0

Posted in stat.ME · 2026-08-29 · Leonardo Egidi, Ioannis Ntzoufras

Stochastic Bayes factors: why, when, and how

The Bayes factor (BF) is a central tool in Bayesian hypothesis testing and model selection, yet its practical use is often challenged. Classical BFs depend heavily on prior specification, cannot be applied with improper priors, and are typically interpreted through arbitrary evidence scales. Moreover, they fail to capture uncertainty...

💬 0 commentsarXiv:2608.29154v1PDF
0

Posted in stat.ML · 2026-08-29 · Denis Belomestny

Uniform Statistical Convergence of Empirical Sinkhorn Potentials with Exponential and Polynomial Dependence on the Regularization Parameter

We study the empirical Sinkhorn estimator of the entropic optimal transport potentials under the uniform loss. Since the potentials are only unique up to additive constants, we measure the error using the quotient supremum norm, defined as $d_\infty([u],[v]) = \inf_{a\in\mathbb{R}}\|u-v-a\|_\infty$. For a fixed regularization...

💬 0 commentsarXiv:2608.29152v1PDF
0

Posted in cs.LG · 2026-08-29 · Avishag Nevo, Tamir Hazan

PathGuide: Dynamic Classifier-Free Guidance via On-Policy Transport Alignment

While modern generative models excel at modeling complex data, precise inference-time control in conditional generation remains a critical challenge. Classifier-free guidance (CFG) is a primary mechanism for such control, yet it is typically treated as a static tuning parameter. In flow-based models, however, the guidance scale...

💬 0 commentsarXiv:2608.29107v1PDF
0

Posted in stat.ME · 2026-08-29 · Jack Freestone, Garth Tarr, Samuel Muller, Uri Keich

Response-guided knockoffs for directional FDR control in linear models

We consider the problem of feature selection in linear models with finite-sample control of the false discovery rate (FDR). While existing knockoff-based methods control the directional FDR, which penalises incorrect sign estimates, they do not target discoveries in a pre-specified direction, and their knockoff constructions are...

💬 0 commentsarXiv:2608.29083v1PDF
0

Posted in stat.ML · 2026-08-29 · Richard Y. Zhang

Sharp Restricted Isometry Thresholds for Global Minima of Rank-Restricted Matrix LASSO

We determine the sharp restricted isometry threshold for recovery at global minima of the rank-restricted matrix LASSO. For target rank $r_{\star}$, if the rank-$k$ RIP constant satisfies $δ<δ_{\mathrm{sharp}}(k/r_{\star})$, where $δ_{\mathrm{sharp}}(t)=t/(4-t)$ for $0<t<4/3$ and $δ_{\mathrm{sharp}}(t)=\sqrt{(t-1)/t}$ for $t\ge4/3$,...

💬 0 commentsarXiv:2608.29018v1PDF
0

Posted in stat.ML · 2026-08-29 · Haijie Xu, Chen Zhang

Jigsaw-CRL: Recovering Global Latent Causal Order from Fragmented Multi-Client Interventions

Causal representation learning (CRL) aims to recover latent causal variables and their structural relations from high-dimensional observations. Existing CRL methods typically assume that all environments are defined over the same latent variables, or at least share a common latent representation space. We study a fragmented...

💬 0 commentsarXiv:2608.28991v1PDF
0

Posted in stat.ML · 2026-08-28 · Martin J. Wainwright

The information geometry of product-reference discrete diffusion: Interaction growth complexity and optimal scheduling

We study a class of product-reference diffusion algorithms for sampling from a discrete distribution. We show that their sampling performance can be characterized using a path-based measure of data geometry that we call the interaction growth complexity (IGC). We show that a bivariate IGC kernel gives an exact representation of both...

💬 0 commentsarXiv:2608.28949v1PDF
0

Posted in stat.ME · 2026-08-28 · Kenneth M. Lee, Michael O. Harhay, Fan Li

Saturation in G: simple & robust causal inference in cluster randomized trials with informative cluster sizes

Cluster randomized trials (CRTs) can exhibit informative cluster sizes (ICS) where cluster size is associated with outcomes and/or treatment effects. Under ICS, the individual and cluster-average treatment effects (iATE, cATE) can diverge, and the conventional linear mixed-effects model (LMM) and generalized estimating equation (GEE)...

💬 0 commentsarXiv:2608.28943v1PDF