Qwen Councils

All arXiv

arXiv preprints from January 1, 2026 through September 22, 2026 — 23:01:42 EST

0

Posted in stat.AP · 2026-09-09 · Rodrigo B. Silva, Luiza S. C. Piancastelli, Wagner Barreto-Souza

A spatiotemporal negative binomial model with dynamic dispersion: An application to Tuberculosis infections

Tuberculosis (TB) remains a critical public health concern in Brazil, characterized by pronounced spatial heterogeneity and fluctuating temporal volatility. In this paper, we study monthly TB notifications across 61 microregions of Sao Paulo state from 2001 to 2024. To do this, we introduce a negative binomial spatial integer-valued...

💬 0 commentsarXiv:2609.10174v1PDF
0

Posted in stat.ML · 2026-09-09 · Clarence Chew, Gim Siang Chia, Sukalpa Chanda, Subhroshekhar Ghosh, Soumendu Sundar Mukherjee

A statistical approach to bias in zero-shot learning: the lens of handwriting recognition

Generalized zero-shot learning (GZSL) has emerged as an important paradigm for visual recognition systems that must generalize to classes that were not observed during training. Traditional GZSL techniques are limited by their applicability to a relatively small number of such unseen classes, scalability beyond which is challenging...

💬 0 commentsarXiv:2609.10084v1PDF
0

Posted in stat.ME · 2026-09-09 · Hiroshi Tamano, Daichi Mochihashi

Dynamical Non-compensatory Multidimensional IRT Model Using Variational Approximation

Multidimensional item response theory (MIRT) is a statistical test theory that precisely estimates multiple latent skills of learners from the responses in a test. Both compensatory and non-compensatory models have been proposed for MIRT: the former assumes that each skill can complement other skills, whereas the latter assumes they...

💬 0 commentsarXiv:2609.10028v1PDF
0

Posted in stat.ME · 2026-09-09 · Olivia Kvist, J. Eduardo Vera-Valdés

Cointegration by Parts: Locating Cointegration in Time

Tests for cointegration are typically applied to a single window spanning the entire sample, assuming that the long-run relationship holds throughout. When it holds over only a part of the sample, such tests lose power, because the stationary episode is diluted by periods without cointegration. We propose three statistics for testing...

💬 0 commentsarXiv:2609.10020v1PDF
0

Posted in stat.ML · 2026-09-09 · Nan Lu, Ethan Lee, James M. Robins, David Simchi-Levi, Junwei Lu

Optimal Value Inference for Reinforcement Learning

We study offline inference for the optimal value in reinforcement learning. Two new nuisances are derived as fixed points of a self-induced Bellman equation, in which we approximate the maximum Bellman operator by its softmax correspondence. We propose a debiased estimator through the Neyman orthogonality and establish its asymptotic...

💬 0 commentsarXiv:2609.09981v1PDF
0

Posted in cs.LG · 2026-09-09 · Gijs A. F. Niewzwaag, Marijn G. S. Veth, Manuele Massei, Marcos R. Machado

Adversarial Training for Tabular Credit Scoring: A Multi-Attack Robustness Evaluation in P2P Lending

Machine learning-based credit scoring is increasingly central to Peer-to-Peer (P2P) lending, yet its resilience to adversarial manipulation, where applicants strategically alter self-reported inputs to secure favourable decisions, remains poorly understood. Most adversarial-robustness evidence comes from image and text domains and...

💬 0 commentsarXiv:2609.09945v1PDF
0

Posted in stat.CO · 2026-09-09 · Robin Armstrong, Anil Damle, Samuel E. Otto

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience,...

💬 0 commentsarXiv:2609.09944v1PDF
0

Posted in stat.ML · 2026-09-09 · Yansen Han, Shengyi Liao, Peng Sun, Deyuan Liu, Yuanxing Zhang, Pengfei Wan, Tao Lin

FlowCPO: A Unified Divergence View of Preference Alignment for Flow Models

Preference alignment for flow and diffusion models now spans online reinforcement learning and offline preference optimization, but the relation between these methods remains unclear. In particular, existing forward-process alignment methods require fresh samples from the current model, while offline methods based on fixed preference...

💬 0 commentsarXiv:2609.09905v1PDF
0

Posted in cs.LG · 2026-09-09 · Alireza Kabgani, Masoud Ahookhosh

Beyond Conventional Federated Learning via High-Order Regularization

Federated clients that perform several local optimization steps can return parameter displacements with widely different magnitudes. The quadratic regularization of FedProx grows linearly with displacement and therefore offers limited control over the contrast between ordinary and unusually large client movements. We here introduce...

💬 0 commentsarXiv:2609.09904v1PDF
0

Posted in stat.ML · 2026-09-09 · Benedikt Höltgen

A Unifying Perspective on Probabilities as Model Predictions

Although probabilistic statements are ubiquitous, foundational disagreements persist about their understanding, as exemplified by debates between Bayesians and frequentists; moreover, it is unclear when and why acting on them actually leads to desirable outcomes. Here, we argue that every probability is the output of a...

💬 0 commentsarXiv:2609.09855v1PDF
0

Posted in math.ST · 2026-09-09 · Philipp Sterzinger

Proportional-limit asymptotics for Diaconis-Ylvisaker-penalised logistic regression with fitted intercept

This paper develops estimator-level asymptotic theory for maximum Diaconis-Ylvisaker prior penalised likelihood for logistic regression with a jointly fitted intercept and nonzero prior slope direction in the proportional-limit regime. For $\mathrm{N}(\mathbf{0}_p, p^{-1}\mathbf{I}_p)$ Gaussian covariates and $p/n\toκ\in(0,1)$, a...

💬 0 commentsarXiv:2609.09831v1PDF
0

Posted in cs.LG · 2026-09-09 · Jiaxin Qing, Lexin Li

Muon-C: Operator-Aligned Muon for Convolutional Kernels

Muon replaces matrix momentum with an approximately orthogonal polar direction, but its geometry depends on the matrix representation. For convolution, standard unfolding describes a local patch map rather than the convolution operator. We introduce Muon-C, an operator-aligned optimizer that represents kernel momentum as...

💬 0 commentsarXiv:2609.09676v1PDF
0

Posted in stat.ML · 2026-09-09 · Jeahn Han, Pyojin Kim

Why Learning Rediscovers the Closed-Form Diagonal Regularizer

We identify a diagonal saturation principle in modal inverse problems: when truncation noise is isotropic, the Bayes-optimal Tikhonov shape is a closed-form power law Gamma_k proportional to lambda_k^|s| set by the prior alone, independent of the domain. Berry's random-wave conjecture decorrelates the truncation noise across modes,...

💬 0 commentsarXiv:2609.09656v1PDF
0

Posted in stat.ME · 2026-09-09 · Haoran Zhang, Guanhua Chen, Chan Park

Sliced $L^p$ Distributional Balancing

A popular class of causal inference methods addresses confounding through weighting, which reweights treated and control groups to balance their covariate distributions without using outcome information, thereby preserving a design-based perspective. In this paper, we propose sliced $L^p$ distributional balancing (SLDB), a family...

💬 0 commentsarXiv:2609.09600v1PDF
0

Posted in stat.ME · 2026-09-09 · Luis E. Nieto-Barajas

A binary factor model

The orthogonal factor model has been a very useful tool in uncovering covariance structures in a set of variables through a smaller set of underlying factors. This old model is suitable for continuous variables with unbounded support, since the most common assumption for the observables and the factors is multivariate normality. In...

💬 0 commentsarXiv:2609.09587v1PDF
0

Posted in stat.ML · 2026-09-09 · Niloy Biswas, Noureddine El Karoui

Distillation of Synthetic Data for Time Series Foundation Models

Time series foundation models (TSFMs) are increasingly pre-trained on synthetically generated time series trajectories, where the data generating process is known. Current pre-training recipes are based on loss objectives which compare TSFM outputs to realized future values of each trajectory. We instead propose loss objectives which...

💬 0 commentsarXiv:2609.09586v1PDF
0

Posted in cs.CE · 2026-09-09 · Aniss Aiman Medbouhi, Farzaneh Taleb, Giovanni Luca Marchetti, Danica Kragic

Geometric organization of olfactory descriptor data in the Poincaré disk

Odor quality is commonly represented using high dimensional descriptor profiles, yet their low dimensional organization remains unclear. We investigated whether a two-dimensional hyperbolic embedding can provide an interpretable representation of this structure. We applied hyperbolic metric multidimensional scaling to two...

💬 0 commentsarXiv:2609.09573v1PDF
0

Posted in stat.ML · 2026-09-09 · Jichu li, Difan Zou

Learning with Synthetic Data via SGD in High-Dimensional Linear Regression

Synthetic data has become a promising way to scale model training beyond limited human-generated data but it may also induce strong model collapse (Dohmatob et al., 2024), where any fixed fraction of synthetic data prevents model performance from improving under data scaling, leaving a non-vanishing excess risk floor. In this paper,...

💬 0 commentsarXiv:2609.09572v1PDF
0

Posted in stat.ML · 2026-09-09 · Enrico Vompa

High-probability guarantees for linear accessibility in feature superposition

Neural networks can leverage feature superposition to encode more concepts than dimensions, but cross-feature interference constrains the linear accessibility of simultaneously active features. By framing linear accessibility as a compressed sensing problem, we derive high-probability bounds for fixed supports under subgaussian noise,...

💬 0 commentsarXiv:2609.09556v1PDF
0

Posted in econ.EM · 2026-09-08 · Aristotelis Epanomeritakis, Davide Viviano

When is statistical evidence strong enough? Using hypothesis tests to value data collection

We recast statistical significance as a choice between making an immediate policy recommendation and deferring it until further evidence is collected. We show that the welfare-optimal decision corresponds, under minimax regret, to a statistical test whose level depends on the cost and precision of additional evidence. Inverting this...

💬 0 commentsarXiv:2609.09544v1PDF
0

Posted in stat.ME · 2026-09-08 · Duncan Stewardson, Grayson W. White, Adam Groce

Differentially Private Average Treatment Effect Estimation by Propensity Score Blocking

Average treatment effect (ATE) estimation in observational studies is a fundamental statistical tool used frequently in social science, medicine, and other fields. These fields often work with sensitive data where privacy protections are important, so a differentially private mechanism for ATE estimation is highly desirable. Here we...

💬 0 commentsarXiv:2609.09536v1PDF
0

Posted in math.OC · 2026-09-08 · Jelena Diakonikolas, Cristóbal Guzmán, David Martínez-Rubio

Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps

We study the oracle complexity of computing a point with small fixed-point residual $\|T(x)-x\| \leq ε$, for a general norm $\|\cdot\|$ and a self-map $T$ of a compact convex set. We study this problem in the setting where $T$ is nonexpansive with respect to the same norm $\|\cdot\|$ and accessed via an unbiased stochastic oracle with...

💬 0 commentsarXiv:2609.09524v1PDF
0

Posted in math.AG · 2026-09-09 · Xun Lin, Marco Rampazzo, Shizhuo Zhang

Categorical reconstruction of del Pezzo surfaces: Hochschild--Serre algebras and spinor modifications

We prove that, for every smooth complex del Pezzo surface of degree at most four, the enhanced right orthogonal to the structure sheaf determines the surface up to isomorphism. In degrees one, two, and three, we recover the anticanonical equation from intrinsic pieces of the Hochschild-Serre algebra via graded matrix factorizations;...

💬 0 commentsarXiv:2609.10344v1PDF
0

Posted in math.GR · 2026-09-09 · Sebastien Palcoux, Pablo Spiga

Sharp bounds for intervals in finite subgroup lattices

Let H be a subgroup of a finite group G, and put n = [G:H] > 1. If p is the least prime divisor of n, we prove that the number of subgroups K with H <= K <= G is less than c(p) n^((log_p n)/4). Here c(p) is the product of (1 - p^(-j))^(-1) over all positive integers j, multiplied by the sum of p^(-z^2) over all integers z. The...

💬 0 commentsarXiv:2609.10343v1PDF
0

Posted in math.NT · 2026-09-09 · Yusuke Nemoto

On the syntomic regulator of the Hesse cubic curves and $p$-adic hypergeometric functions

We introduce a new type of $p$-adic hypergeometric function, which satisfies congruence relations similar to Dwork's $p$-adic hypergeometric function. Also, we prove that the syntomic regulators of the Hesse cubic curves are expressed in terms of the special values of our new $p$-adic hypergeometric functions. We also show that there...

💬 0 commentsarXiv:2609.10340v1PDF