Skip to main content
archive Search
Submit Donate Log in

Press Enter to search · Advanced search

Methodology

  • New submissions
  • Cross-lists
  • Replacements

See recent articles

Showing new listings for Monday, 16 November 2026

Total of 46 entries
Showing up to 2000 entries per page: fewer | more | all

New submissions (showing 18 of 18 entries)

[1] arXiv:2611.17507 [pdf, html, other]
Title: Parametric Modal SARIMA Models with Skewed Distributions
Christian E. Galarza, Sergio Luis Mercado Londoño, Víctor H. Lachos
Comments: 21 pages, 5 figures, 11 tables. Supplementary tables and figures are provided as an ancillary file
Subjects: Methodology (stat.ME)

Seasonal autoregressive integrated moving-average (SARIMA) models typically target the conditional mean of a time series under a Gaussian error assumption. This approach may be inadequate when the innovations are asymmetric because the conditional mean no longer represents the most likely outcome. We propose the Modal SARIMA$(p,d,q)\times(P,D,Q)_s$ model, which links the conditional mode, rather than the conditional mean, to a multiplicative seasonal ARIMA structure. The innovations follow the Fernandez-Steel class of skewed distributions (SKD), whose location parameter is the mode, and the non-seasonal Modal ARIMA$(p,d,q)$ model is the special case without seasonal terms. We give the conditional log-likelihood for the Skew-Normal, Skewed Student-$t$, and Skewed Laplace members, establish the stationarity and invertibility conditions on the product polynomials, show that the recursive modal forecast is the joint mode of the future trajectory, and characterize the correction that yields the marginal $h$-step conditional mode. Monte Carlo experiments show that conditional maximum likelihood and its Wald inference are reliable when the seasonal factors are well separated, that the test of symmetry holds its level from about 200 observations, and that the modal estimator of the dynamic coefficients is as efficient as Gaussian least squares under symmetry and 1.2 to 2.6 times more efficient under asymmetry or heavy tails. We also show, analytically and by simulation, that nearly cancelling seasonal factors amplify the effect of the starting values, and that beyond one step the recursive forecast must be corrected to remain a forecast of the most probable value. In an application to the Canadian lynx trappings, a seasonal component for the ten-year cycle improves the non-seasonal fit for every member of the SKD family. The methods are implemented in the R package ModalForecast.

[2] arXiv:2611.17518 [pdf, html, other]
Title: Bayesian Semiparametric Regression for Count Data Using Zero Altered Moment Models
Sujit K. Ghosh, Timothy Boakye, Kimberly F. Sellers
Subjects: Methodology (stat.ME)

We develop a Bayesian semiparametric regression framework for count data that can accommodate both underdispersion and overdispersion without specifying a full parametric probability model. The model is built from the first two conditional factorial moments of a zero altered distribution. Covariates may enter the conditional mean and the conditional dispersion separately, thereby allowing the dispersion to vary across observations. We turn the moment restrictions into an adjusted exponentially tilted empirical likelihood (AETEL) criterion and combine this criterion with Gaussian priors to form a Bayesian empirical-likelihood pseudo-posterior. The adjustment improves numerical feasibility and a two-block Metropolis delayed acceptance sampler allows for faster runs of the MCMC chains. This reduces unnecessary exact evaluations without changing the AETEL target. Using existing Bayesian exponentially tilted empirical likelihood (ETEL) theory, we state a first-order posterior normal approximation and verify the moment, smoothness, and Jacobian rank conditions needed for the asymptotic inference. Simulations under zero inflated Poisson and Conway Maxwell Poisson data exhibit small bias, accurate uncertainty estimates, and near nominal interval coverage for both overdispersed and underdispersed counts. Applications to various datasets illustrate how the Bayesian analysis can identify covariate dependent dispersion using finite sample posterior inference.

[3] arXiv:2611.17528 [pdf, html, other]
Title: Regularized parametric modal regression for positive responses with high-dimensional covariates
Christian E. Galarza, Víctor H. Lachos, Dashun Liu
Comments: 15 pages, 7 tables. R package ModalNet: this https URL
Subjects: Methodology (stat.ME)

Modal regression models the conditional mode rather than the conditional mean, which is attractive for positive and right-skewed responses whose mean is distorted by the upper tail. We propose a regularized version of parametric modal regression for positive responses with high-dimensional covariates, in which the density parameters of the Gamma, Weibull and Lognormal distributions are written as functions of the conditional mode and the log-likelihood is penalized by the Lasso, adaptive Lasso or elastic-net penalties. The estimates are computed by a proximal Newton algorithm, equivalently an iteratively reweighted penalized least-squares scheme, whose inner problem is solved exactly by the coordinate-descent routines of glmnet, and the regularization parameter is selected by the extended Bayesian information criterion. We show that the Lognormal estimator coincides with the Gaussian Lasso applied to the log-transformed response, that under constant dispersion the conditional mean and the conditional mode have the same slopes, and that the estimation error attains the rate $O(\sqrt{s}\lambda_n)$ with no smoothing bias. Simulation studies with up to $p = 1000$ covariates show that the method improves on the Lasso applied to the log-transformed response for Gamma and Weibull responses, and two applications illustrate its use. The method is implemented in the R package ModalNet.

[4] arXiv:2611.17545 [pdf, html, other]
Title: Identifiability and Spectral Estimation of Mixed Memberships in Heterogeneous Multilayer Networks
Taeseok Park, Jesús Arroyo
Comments: 80 pages, 5 figures, 4 tables
Subjects: Methodology (stat.ME)

Multilayer network data, arising from multiple sources, repeated measurements, or multi-view interactions, are increasingly common, highlighting the need for statistical methods that jointly leverage information across layers while allowing for layer heterogeneity and computational scalability. Here, we study a multilayer degree-corrected mixed membership model (ML-DCMM), in which nodes share a common mixed membership across layers while degree effects and block connectivity patterns vary by layer. This model encompasses several existing models for multilayer data while preserving identifiability and interpretation. We develop a spectral estimation procedure that integrates layer-wise embeddings with corner estimation for membership recovery. A further refinement that connects the resulting representation to a ParaTuck-2 tensor decomposition is also introduced. We establish theoretical guarantees for the proposed spectral method, showing that the probability of near-corner recovery increases with the number of layers, and we provide the convergence rate for the resulting membership estimator. We establish a minimax lower bound for membership estimation, which does not improve with increasing number of layers. Simulation studies show that ML-DCMM can outperform other approaches under strong layer heterogeneity. In an analysis of London bike-sharing networks, the methodology recovers interpretable memberships and achieves lower held-out edge prediction error under edge-sampling cross-validation than competing models.

[5] arXiv:2611.17609 [pdf, html, other]
Title: Homogeneous pursuit in $β$ model
Ergan Shang, Si Chen, Canhong Wen
Subjects: Methodology (stat.ME); Statistics Theory (math.ST); Machine Learning (stat.ML)

Data in forms of networks has been encountered in various prevalent fields at the arrival of big data era. To unveil and recover the true model with core units with numerous links, the $\beta$-model under sparsity constraint is proposed to meet the expectation of statisticians and engineers. Not only does this network model inherit spectacular property from the Erdős-Rényi model, but also exhibits degree heterogeneity through tuning sparsity parameter $s$. In this paper, we propose Homogeneous Pursuit (HP), an $\ell_0$-constrained maximum likelihood estimation method implemented through a primal-dual algorithm. To ease the harshness of computation, we find the surrogate function of the corresponding objective function to derive Majorization Minimization algorithm through the primal-dual process. Moreover, after meticulous evaluation, the algorithm brought about captures the property of fine convergence rate in a contraction mapping way. Under some mild conditions, the proposed generalized information criterion (GIC$^*$) for selecting the sparsity level is consistent to find the truth. Combining HP with GIC$^*$ gives the adaptive procedure HP-GIC$^*$; HP-BIC denotes the same estimation method with sparsity selected by BIC. Finally, simulation studies show that GIC$^*$ improves support recovery relative to BIC in the reported comparisons, while HP achieves lower computational cost while maintaining estimation accuracy comparable to the sparse benchmark methods. A microfinance application illustrates the use of HP-GIC$^*$ for studying the association between network prominence and participation, with improved fit in the reported village-level regressions.

[6] arXiv:2611.17715 [pdf, html, other]
Title: GIC model selection for high-dimensional CCA
Hung Hung, Jia-Rou Liu
Comments: 1 figure
Subjects: Methodology (stat.ME)

Canonical correlation analysis (CCA) is a widely used statistical tool for exploring the dependence structure between two sets of variables. An important issue in CCA is determining the rank. Among information-based criteria for rank selection, the Akaike information criterion (AIC) and the Bayesian information criterion (BIC) are two commonly used approaches. Both rely on the number of free parameters to quantify model complexity, which may not adequately account for the underlying dependence structure when the assumed model is misspecified. As a result, AIC and BIC may exhibit unsatisfactory performance, particularly when the remaining canonical correlations do not follow the assumed low-dimensional structure. To alleviate this difficulty, we adopt the idea of the generalized information criterion (GIC) to develop a data-adaptive measure of model complexity for CCA rank selection. The proposed complexity measure incorporates the magnitudes of the sample canonical correlations, thereby accounting for the spectral structure of the data and improving robustness to model misspecification. We investigate the asymptotic properties of the proposed GIC under a high-dimensional setting in which the sample size and both variable dimensions grow proportionally. Our theoretical analysis aims to characterize the conditions under which GIC can distinguish signal canonical correlations from noise and achieve more reliable rank selection than conventional information criteria.

[7] arXiv:2611.17771 [pdf, html, other]
Title: Interpretable confidence regions for causal discovery
Jian Kang, Arnav Mazumder, Giovanni Carter Lembo, Armeen Taeb
Subjects: Methodology (stat.ME)

Most work in causal discovery focuses on point estimation of the underlying causal graph, while uncertainty in the learned structure has received substantially less attention. We develop confidence regions for the completed partially directed acyclic graph (CPDAG) identified from observational data. Our approach builds on perturbed PC (Chang et al., 2026), which generates plausible CPDAGs by perturbing the conditional independence tests underlying the widely used PC algorithm. The threshold used in these tests controls how perturbations translate into variation across the resulting CPDAGs. We propose a new thresholding strategy that suppresses spurious variation across runs while preserving asymptotic coverage, producing a substantially tighter collection of plausible CPDAGs. This collection is summarized through confidence balls and model confidence intervals constructed from the partially ordered set of CPDAGs under model inclusion. We also develop new theory and algorithms for the exact computation of these regions. Simulations show that our confidence regions attain good coverage while being substantially smaller and more interpretable than the original perturbed PC collections.

[8] arXiv:2611.17774 [pdf, html, other]
Title: Estimand-specific bootstrap confidence intervals after optimism correction for prediction models
Seiya Takano, Kazuki Nishida, Ryo Emoto, Shigeyuki Matsui
Comments: 38 pages, 7 figures, 3 tables. Supporting Information included after the main article
Subjects: Methodology (stat.ME)

Confidence intervals after bootstrap optimism correction are often reported for prediction models, but what they cover depends on the estimand. We distinguish two estimands: the target-population performance of the final model developed from the observed sample, $\theta_{\mathrm{FM},n}$, and the average performance over repeated model development, $\theta_{\mathrm{proc},n}$. Using first-order expansions of the estimation errors, we identify the bootstrap root that matches the error for $\theta_{\mathrm{FM},n}$. We use this root in the nested error bootstrap (NEB) as a new reference method, and we show that the optimism error bootstrap (OEB), which needs no inner bootstrap, approximates NEB. We also show that the conventional two-stage bootstrap (TSB) and location-shifted bootstrap (LSB) reproduce the first-order variation for $\theta_{\mathrm{proc},n}$. In simulations, NEB generally achieved coverage closer to the nominal level than TSB and LSB for the area under the receiver operating characteristic curve, Brier score, and log loss. OEB was close to NEB at moderate to high events per variable (EPV) but could give narrower intervals at low EPV. The distinction is particularly clear for calibration measures: first-order effects of perturbing the training and evaluation distributions cancel in the TSB root, yielding a degenerate first-order limit. In contrast, the NEB root has a nondegenerate first-order limit and yields asymptotically valid confidence intervals for $\theta_{\mathrm{FM},n}$ under regularity conditions. Consistent with theory, TSB showed substantial undercoverage for calibration even at larger sample sizes. Our findings emphasize the need to construct confidence intervals for a specified estimand and performance measure.

[9] arXiv:2611.17778 [pdf, html, other]
Title: A Consistent Bayesian Adaptive Quotient Graph Framework for Graph-Informed Random Partition Models
Kun Huang, Xiyu Peng, Huiyan Sang
Subjects: Methodology (stat.ME)

Bayesian graph-informed random partition models are widely used to model heterogeneity in structured data. A prominent approach assigns a prior directly on the space of contiguous partitions of a pre-determined graph G; however, such models are not data-adaptive and can be computationally infeasible for large graphs. To address these limitations, we propose a Bayesian adaptive quotient graph framework that induces partitions through a two-level hierarchical prior: a prior is first imposed on quotient graphs of G, followed by a conditional prior on a reduced contiguous partition space induced by each quotient graph. We develop high-level assumptions that guide the construction of the two-level prior such that the reduced space retains desirable partitions. We further establish high-level assumptions for posterior concentration on desirable quotient graphs and partitions. The framework can be readily embedded into many existing Bayesian hierarchical models with latent cluster structures as a contiguous random partition prior. As a specific example, we apply the proposed framework to the spatial random partition model proposed in Huang and Sang (2026). The resulting model adapts to the unknown number of clusters, achieves a faster clustering-consistency contraction rate, and yields substantially lower partition error and computation time in simulations. Finally, we apply the resulting model to a large spatial transcriptomics dataset to demonstrate its practical utility.

[10] arXiv:2611.17875 [pdf, html, other]
Title: Stratified Randomization Incorporating Historical Control Data
Masatoshi Shoji, Isao Yokota, Carolin Herrmann
Comments: 29 pages, 1 figure, 4 tables, 1 algorithm, Presented at ISCB-GMDS 2026, Freiburg, Germany
Subjects: Methodology (stat.ME)

Randomized controlled trials are often infeasible in rare diseases because of limited sample size, high costs, or lengthy durations. Hybrid control designs address this by combining a concurrent control arm with historical data. However, existing methods such as propensity score matching (PSM) borrow historical data only at the analysis stage, which limits power gains when covariate distributions differ between historical and concurrent data. We propose a stratified block randomization method for hybrid control trials. Within each stratum, more concurrent subjects are allocated to the treatment arm than to the concurrent control arm, and the difference is filled with historical controls so that the treatment and hybrid control arms are balanced 1:1; once the available historical controls in the stratum are used or a pre-specified overall cap is reached, allocation returns to 1:1. Historical controls are incorporated either by sampling or by weighting. We compared both methods with PSM in terms of type I error rate, power, and sample size via Monte Carlo simulations. The sampling method maintained the type I error rates when there was neither heterogeneity in the outcome model nor unmeasured covariates. It also had power comparable to or greater than that of PSM, particularly when historical controls were unevenly distributed across strata. The power of the weighting method increased with the pooled historical sample size, but its type I error rate was inflated when covariates beyond the stratification factors were present or when stratification factors were dichotomized from continuous covariates. The proposed method incorporates historical data at the allocation stage rather than only at the analysis stage, enabling more efficient use of historical data.

[11] arXiv:2611.18052 [pdf, html, other]
Title: evgmrf: An R Package For Gaussian Markov Random Field Extreme Value Models
Benjamin D. Youngman, Ayu Shabrina
Subjects: Methodology (stat.ME); Computation (stat.CO)

We introduce \textsf{evgmrf}, an \textsf{R} package for fitting spatially varying extreme value models using Gaussian Markov random fields (GMRFs). The package supports the generalized extreme value distribution for block maxima, the generalized Pareto distribution for threshold exceedances, the Poisson--GPD point-process model, and the $r$-largest order-statistics model. Distributional parameters may vary over regular spatial grids or arbitrary regions that can be represented by a valid adjacency matrix, with optional fixed effects and covariate dependence. Spatial structure is represented through intrinsic conditional autoregressive, proper conditional autoregressive, and Besag--York--Mollié 2 models, which are extended with non-Gaussian random-effect distributions. Estimation uses penalized likelihood with smoothing or dependence hyper-parameters estimated using a Laplace approximation, exploiting sparse precision matrices for computational efficiency. The package provides methods for model summaries, spatial visualization, prediction on link and response scales, estimation of extreme quantiles, and uncertainty quantification in the form of approximate standard error estimates, or via simulations from parameter sampling distributions. Examples based on gridded and county-level precipitation data illustrate the use of the package for spatial modelling of environmental extremes. \textsf{evgmrf} provides a unified, accessible framework for extreme value analyses in which distributional parameters exhibit structured spatial variation.

[12] arXiv:2611.18128 [pdf, html, other]
Title: Cross-Fitted Doubly Robust Estimation with Student-t Outcome Engines: ECM Algorithms, Monte Carlo Evidence and Schistosomiasis Programme Data from the Democratic Republic of the Congo
Cosmas Kambale Musambi, Ernest Fokoué
Comments: 37 pages, 27 figures, 11 tables. Python code (single file) reproducing all analyses and figures provided as an ancillary file
Subjects: Methodology (stat.ME)

Routine data on preventive chemotherapy for schistosomiasis are confounded, clustered, heavy-tailed and heaped. We study how cross-fitted augmented inverse probability weighted (AIPW) estimators behave, and how they should be computed, when least squares is replaced by Student-t outcome engines: Huber and t iteratively reweighted least squares, and a two-component t scale-mixture regression fitted by an ECM algorithm, alongside a residual-clipped augmentation. We give four short propositions (exact AIPW bias, the efficiency bound, the estimand of clipping, monotone ascent of a scale-constrained ECM), a single-file Python implementation with cluster-level cross-fitting, cluster-robust standard errors and a cluster bootstrap, and a Monte Carlo study with up to 1000 replications per cell. Robust outcome engines leave AIPW unchanged (RMSE differences at most 0.002), whereas clipping cuts RMSE by 26-45% under symmetric contamination, under-covers, and, as a plasmode experiment built on real covariates and residuals shows, shifts the estimand when residual laws differ between arms. One-sided artefacts that differ between arms bias every estimator. Heaped data also break naive code: the MAD scale collapses and the mixture likelihood is unbounded, and we give simple guards. Applied to 1485 rounds in 362 health zones of the Democratic Republic of the Congo (ESPEN, 2014-2025), integrated delivery appears to raise programme coverage by 17.4 percentage points, yet epidemiological coverage differs by only 0.9: the gap comes from targeting denominators, a real differential artefact that no outcome engine can remove.

[13] arXiv:2611.18291 [pdf, html, other]
Title: Identification and Inference of Bi-directional Causal Effects in Mendelian Randomization without Instrument Selection
Liyuan Mo, Qingyuan Zhao
Comments: 61 pages, including supplementary material
Subjects: Methodology (stat.ME)

Mendelian randomization (MR) uses genetic variants as instruments to estimate causal effects. Bidirectional MR usually uses two reversed unidirectional analyses, but feedback can invalidate instruments in at least one direction and induce correlated pleiotropy. We model both traits as a stable cyclic system and estimate both directional effects from GWAS summary data without instrument selection or a prespecified valid-instrument subset. After LD score normalisation, marginal associations form a heteroscedastic noisy independent component analysis model, assuming the variants' direct effects on the two traits are independent. If those effects are non-Gaussian, this identifies the total-effect matrix up to scaling and permutation; no-self-feedback and stability of the system further resolve these ambiguities. We develop an estimator based on noise-adjusted second- and fourth-order moments, avoiding inversion of the high-dimensional linkage disequilibrium matrix and having computational cost linear in the number of variants. Under weak local dependence, we establish consistency, asymptotic normality, and validity of a chromosome-respecting moving block bootstrap. Simulations show negligible bias, generally reliable interval coverage, and higher rejection rates for nonzero directional effects than focusing-based tests. Three real-data applications illustrate how joint analysis of feedback systems can yield causal decompositions differing from two separate unidirectional analyses.

[14] arXiv:2611.18404 [pdf, html, other]
Title: Comments on: `CliPS: How to identify cluster distributions in Bayesian mixture models'
Sara Wade
Comments: This is an invited discussion for the paper arXiv:2603.00277v2. The citation of the published version is Malsiner-Walli, G., Frühwirth-Schnatter, S. & Grün, B. CliPS: How to identify cluster distributions in Bayesian mixture models. TEST (2026). this https URL
Subjects: Methodology (stat.ME)

I congratulate the authors on their contribution, which addresses important challenges in understanding posterior distributions in Bayesian mixture models. As underlined by the authors, the Bayesian framework has several advantages, yet label-switching, identifiability issues, and the trans-dimensional nature of parameter spaces make exploiting the Bayesian approach and understanding the resulting posterior difficult in practice. The paper offers clear explanations and a simple, intuitive procedure to address this by clustering the Markov chain Monte Carlo (MCMC) draws of component-specific parameters. It is clearly illustrated on several examples.

[15] arXiv:2611.18416 [pdf, html, other]
Title: A fast and sound algorithm to simplify summations in interventional queries expressions
Ivano Lodato, Simran Hiranandani, Aditya Varna Iyer
Comments: 19 pages
Subjects: Methodology (stat.ME); Computation (stat.CO)

Identification formulas returned by the ID algorithm often contain summations that can be removed. The procedure proposed in arXiv:1806.07082 (TK) removes them by combining factors of the formula into joint distributions, through the chain rule and through the insertion of factors for missing variables. We make two changes to this procedure: only the factors that involve the summed variable are combined, and every factor is written with a minimal conditioning set. These two changes determine the rest of the procedure, in which each search over a power set is replaced by a single test and the variables to insert are fixed in advance, and they remove summations that the TK procedure leaves in place. The resulting procedure is sound and, for minimal input terms, complete for each individual elimination with respect to joins and insertions.

[16] arXiv:2611.18444 [pdf, html, other]
Title: Constrained Stochastic Policy Targeting under Heterogeneous Partial Interference
Elena Dal Torrione, Chan Park, Laura Forastiere
Subjects: Methodology (stat.ME); Econometrics (econ.EM)

Under heterogeneous interference, treating individuals with particular characteristics affects the population average outcome through their heterogeneous direct response to treatment and indirect effect on others, creating opportunities for efficient policy design. For instance, policymakers may minimize resource use by vaccinating individuals identified as superspreaders to achieve a target reduction in disease incidence. In such setting, we first study the problem of learning individualized stochastic treatment policies that minimize population average treatment probability subject to a prespecified outcome target. We propose an estimation approach based on a smooth surrogate for constraint violations and interference-aware inverse-probability-weighting or self-normalized estimators of the population average outcome, and establish finite-sample regret guarantees for both estimators. We also consider the complementary problem of maximizing the population average outcome subject to a constraint on average treatment probability. We apply the proposed methodology to a Colombian conditional cash transfer program aimed at improving school attendance. The application demonstrates that accounting for interference and individualizing treatment probabilities can reduce resource use relative to policies that ignore interference or impose homogeneous treatment probabilities.

[17] arXiv:2611.18445 [pdf, html, other]
Title: Hidden Markov Models for Dynamic Co-Clustering
Shuchismita Sarkar, Jing Li, Michael P.B. Gallaugher, Xuwen Zhu
Subjects: Methodology (stat.ME)

To jointly identify temporal regimes and row-column structure in matrix-valued time series, we propose a hidden Markov model (HMM) with Gaussian co-clustering distributions. A single latent regime governs each matrix. Conditional on the regime, row and column memberships define Gaussian blocks, each with its own mean and variance. Membership probabilities and block parameters are shared across occurrences of a regime, while individual memberships may vary between time points.

[18] arXiv:2611.18454 [pdf, html, other]
Title: Dynamic bigraphical Matérn--Whittle processes: learning dependence graphs among spatial-temporal fields
Alokesh Manna, Debangan Dey
Subjects: Methodology (stat.ME); Machine Learning (stat.ML)

Many studies record several variables at the same sites over a sequence of periods, such as pollutant concentrations at monitoring stations or case counts of infectious diseases by district. A central question concerns the dependence between the variables and its change over time. We develop dynamic bigraphical Matérn--Whittle (DBMW) processes for such data. Each variable has a spatial field that evolves by autoregression. A graph over the variables couples the temporal innovations of the fields. Its links appear and vanish over time, and a link may change sign. A graph Laplacian on the sites gives the spatial structure, and a canonical exponential family links the fields to Gaussian, count or binomial responses. The joint distribution of the latent fields over all sites, variables and periods factorizes over the eigenmodes of the graph Laplacian, and its normalizing constant is free of the graph and of the dynamics. Given the fields, the posterior of the time-varying signed graph is therefore exact, by forward--backward recursions. The estimator has three steps: a fit without a graph, which also gives the switching rates with an interval, the exact graph posterior, and a joint refit. In simulations, DBMW recovers the graph with higher average precision than graphical lasso, time-varying graphical lasso and Poisson log-normal networks, and it predicts withheld data better than a standard spatio-temporal model that fits each variable separately, with a Matérn field and autoregressive evolution, by integrated nested Laplace approximation. In weekly air-quality data from 288 U.S. sites, it recovers the seasonal change of sign between ozone and nitrogen dioxide. In German surveillance data on seven diseases, the district-level links stay positive and stable through the COVID-19 pandemic.

Cross submissions (showing 10 of 10 entries)

[19] arXiv:2611.17448 (cross-list from stat.AP) [pdf, html, other]
Title: Envelope Model for GTEx Data
Lisa Chang, Yijun Wang, Shanshan Ding
Subjects: Applications (stat.AP); Methodology (stat.ME)

This article studies the envelope model for enhanced gene expression analysis using GTEx data. The study compares this advanced statistical approach with standard multivariate linear regression, demonstrating improved capacity for identifying significant genes and enhanced estimation efficiency. By partitioning response variation into material and immaterial components, the envelope model reduces estimation noise, leading to stronger statistical signals and smaller standard errors. These findings, as demonstrated in our tissue-specific and gene-group anal- yses, show that the envelope model can pick up on important biological signals that traditional methods tend to miss. This makes it a useful tool for genomic studies and GTEx data analysis.

[20] arXiv:2611.17971 (cross-list from stat.ML) [pdf, html, other]
Title: Efficient and Practical Clustering of Variables in Causal Graphs
Otto Tabell, Jani Nykänen, Santtu Tikka, Juha Karvanen
Subjects: Machine Learning (stat.ML); Machine Learning (cs.LG); Methodology (stat.ME)

Clustering variables in a graph may improve visual clarity and simplify causal inference. Harnessing the full potential of clustering requires an automated method to detect useful clusters in a graph. We introduce a novel class of clusters called conduits, and present a sound, complete and efficient algorithm for detecting all conduits in the graph. In addition to algorithmic detectability, conduits appear naturally in causal graphs stemming from real-world applications, enabling substantial size reduction. Furthermore, the structure of conduits enables the application of known identifiability results regarding clustering. We demonstrate these properties in a simulation study with real-world graphs.

[21] arXiv:2611.18086 (cross-list from stat.AP) [pdf, html, other]
Title: Does Increasing Government Spending on Tertiary Education Provide a Return on Investment? A Bayesian Causal Inference Analysis
Andrew C. Parnell
Comments: 37 pages, 10 figures, 10 tables. Open-source R/C++ code, data, and interactive policy web application available at this https URL
Subjects: Applications (stat.AP); Computation (stat.CO); Methodology (stat.ME)

When a government increases public spending on tertiary (university) education, does it provide a positive fiscal return on investment once general economic growth is separated out? Cross-country data make this hard to answer because growing economies naturally collect more tax, international ratios divide per-student spending by GDP per person and student headcount, and cohorts take years to graduate. We assemble a five-year panel of 121 countries (1985-2024) and fit continuous-treatment Multivariate Bayesian Causal Forests that model four tax changes jointly whilst adjusting for starting conditions, predicted funding, and follow-up economic growth. A +10 percentage-point (pp) increase in per-student university spending (% of GDP per person) shifts the tax mix toward direct income and profit taxation by +0.36 pp after 5 years (93% probability of a positive effect) and +0.71 pp after 10 years (96% probability). Overall tax-to-GDP takes a decade to respond as cohorts graduate: 10-year total non-resource tax rises by +0.24 pp of GDP (89% probability) and direct income tax by +0.12 pp (90% probability) per +10 pp of per-student spending, by +0.37 pp (100% probability) after five-year within-country funding increases, and by +0.22 pp in total tax (95% probability) and +0.15 pp in direct income tax (98% probability) per +25% increase in real PPP dollars per student. Comparing one entering cohort's degree cost against its 40-year career tax payments shows a typical three- to five-fold total tax return in high-income economies (EUR 2.37 billion in Ireland returning EUR 9.66 billion in total tax with a 77% probability of net profit and EUR 2.87 billion in direct income tax, or EUR 11.55 billion in the UK returning EUR 58.33 billion), whereas expanding the university budget without protecting spending per student yields no return.

[22] arXiv:2611.18141 (cross-list from math.ST) [pdf, html, other]
Title: Characterizing M-estimators using canonical divergences from information geometry
Paul Navas
Comments: 30 pages, 1 figure. Supplementary material included
Subjects: Statistics Theory (math.ST); Methodology (stat.ME)

On Euclidean space, the losses that produce consistent M-estimators of a functional are its strictly consistent scoring functions (Dimitriadis, Fissler and Ziegel, 2024), and Osband's principle characterizes these through identification functions, which define method-of-moments estimators. We extend this characterization to the probability simplex. We define the residual, which on Euclidean space is a subtraction, as the inverse exponential map of an affine connection. It identifies the exponential barycenter of the connection: the arithmetic, normalized geometric and Fréchet means for the mixture, exponential and Levi-Civita connections. Its integral along geodesics is the canonical divergence of Ay and Amari (2015). A geometric form of Osband's principle decides which losses each connection admits. For the flat connections every strictly convex generator yields a consistent Bregman loss. For the curved $\alpha$-connections, half the squared Fisher-Rao distance is (up to scale) the only consistent loss for the Fréchet mean, and for $\alpha \notin \{-1, 0, 1\}$ no such loss exists and only the method of moments remains. The residual is integrable only at $\alpha = 0$, sharpening the integrability claim of Ay and Amari. The characterization yields the estimating equations of regression on the simplex and the calibration decomposition of compositional forecasts.

[23] arXiv:2611.18180 (cross-list from stat.ML) [pdf, html, other]
Title: LaMe: a Joint Latent Mediation Framework for High-Dimensional Systems
Gaël Poux-Médard, Kaniav Kamary, Yohann De Castro, Vivian Viallon
Subjects: Machine Learning (stat.ML); Machine Learning (cs.LG); Quantitative Methods (q-bio.QM); Methodology (stat.ME)

Mediation analysis seeks to understand how an exposure influences an outcome through intermediate variables. However, as increasingly rich datasets become available, hundreds to thousands of potential mediators make these systems difficult to model and hard to interpret. Latent-variable approaches offer a natural way to accommodate these high-dimensional settings. However, existing latent mediation methods face limitations, including overparameterization, biased inference, or limited scalability. We develop LaMe, a joint linear-Gaussian framework that summarizes a high-dimensional exposure-mediator-outcome system through a small number of latent variables. We identify natural direct and indirect effects under an explicit assumption that the manifest measurements fully capture the latent mediators, and characterize conditions under which the latent representation effectively restricts the observed cross-covariance structure. Simulations assess recovery of observed association parameters, natural effects, and manifest features associated with latent mediation pathways across a range of challenging settings. Four real-world applications demonstrate competitive predictive performance with compact latent representations, including single-dimensional representations of biomarker and proteomic measurements. Together, these results establish LaMe as a practical framework for estimating and summarizing multivariate mediation systems under explicit structural and measurement assumptions.

[24] arXiv:2611.18225 (cross-list from math.ST) [pdf, html, other]
Title: Causal and conditional tail coefficients: asymptotics, inference and graph recovery
Axel Bücher, Mario Krali
Subjects: Statistics Theory (math.ST); Methodology (stat.ME)

The causal tail coefficient (CTC) measures the influence of an extreme value of one variable on another variable and has been proposed as a tool for causal discovery in heavy-tailed models. Despite its popularity, the asymptotic behavior of its empirical counterpart has not been well understood. We develop an asymptotic theory for the rank-based CTC estimator with an intermediate threshold under nonparametric conditions that are satisfied by all standard copula models. A key observation is that the CTC is determined by the mean of a conditional tail limit distribution, which clarifies its interpretation and determines the asymptotic variance of the estimator. We establish joint asymptotic normality for the entire CTC matrix and prove consistency of a multiplier bootstrap for simultaneous inference. For heavy-tailed linear and recursive max-linear structural equation models, we show that the CTC equals one if and only if the first variable is an ancestor of the second, which leads to confidence graphs for the ancestral graph with asymptotic coverage guarantees. All results extend to general conditional tail coefficients, defined as further functionals of the conditional tail limit distribution. A simulation study and an application to dietary intake data illustrate the methods.

[25] arXiv:2611.18227 (cross-list from econ.EM) [pdf, html, other]
Title: Broken Adaptive Ridge in High-Dimensional Vector Autoregressions
Gianluca Cubadda, Luca Margaritella, Orest Prifti
Subjects: Econometrics (econ.EM); Methodology (stat.ME)

We study regularized estimation in high-dimensional vector autoregressions under physical dependence and row-wise approximate sparsity using the Broken Adaptive Ridge (BAR) estimator. BAR is an iteratively reweighted Ridge procedure whose fixed-point first-order conditions imply a coordinatewise thresholding rule that produces exact zeros. We show that the BAR estimation error can be analyzed on the union of the population support above the BAR threshold and the support selected in the sample. The size of this union can be controlled at the rate implied by approximate sparsity, allowing us to establish the required restricted-curvature condition and derive L1, L2, and prediction error rates when the number of regressors grows polynomially with the sample size and may exceed it. Under exact sparsity, the resulting rates recover the familiar rates for sparse high-dimensional estimation. Monte Carlo experiments across a range of high-dimensional VAR designs show that BAR delivers strong estimation and forecasting performance, and retains a high share of relevant coefficients relative to Lasso, adaptive Lasso, and SCAD. An application to U.S. inflation forecasting using FRED-MD shows particularly strong performance at the one-month horizon.

[26] arXiv:2611.18348 (cross-list from math.ST) [pdf, html, other]
Title: Quantifying Dependence Effects on $k$-out-of-$n$ Reliability Relative to the Independent Benchmark
Nuria Torrado
Subjects: Statistics Theory (math.ST); Probability (math.PR); Methodology (stat.ME)

Understanding how dependence among component lifetimes affects the reliability of redundant systems is a central problem in reliability engineering. In this paper, we develop a framework for quantifying the impact of multivariate dependence on $k$-out-of-$n$ system reliability relative to the independent benchmark. Using an orthogonal Legendre expansion of the copula density, we derive an exact decomposition that separates the dependence structure from the system architecture. This representation identifies how individual dependence contributions are transmitted to system reliability through explicit structural weights. An application to multivariate Farlie-Gumbel-Morgenstern copulas demonstrates that higher-order dependence can produce distinct reliability effects even when all bivariate copulas remain unchanged. Our findings provide a systematic approach to quantifying and interpreting the effects of multivariate dependence on the reliability of redundant systems.

[27] arXiv:2611.18362 (cross-list from stat.AP) [pdf, html, other]
Title: Asymptotic properties for weak Markov-switching AR(p) models
Yacouba Boubacar Mainassara (UPHF, INSA Hauts-De-France, CERAMATHS), Jean-Armel Bra (UMLP, LMB), Landy Rabehasaina (UMLP, LMB)
Subjects: Applications (stat.AP); Methodology (stat.ME)

In this paper we study the asymptotic properties of an autoregressive model of order p (AR for short), possibly non-centered, whose parameters switch according to an unobserved Markov chain. Departing from the conventional assumption of independent innovations, we merely require the errors to be uncorrelated but not necessarily independent, thereby widening substantially the range of potential applications of Markov-switching AR models. We establish sufficient conditions for the consistency and asymptotic normality of the proposed moment estimators. We also propose a consistent estimator of the asymptotic variance matrix of the moment estimators. The finite-sample performance of the proposed procedures is illustrated through Monte Carlo experiments and an empirical study based on hourly meteorological data, which together provide strong support for the theoretical findings.

[28] arXiv:2611.18479 (cross-list from econ.EM) [pdf, html, other]
Title: Estimating a Rational Inattention Discrete Choice Model: A Semiparametric Approach
Hanqi Wang
Comments: 102 pages. Job market paper. Latest version at this https URL
Subjects: Econometrics (econ.EM); Methodology (stat.ME)

People's choices depend on both the payoffs of the available options and what they learn about those payoffs before deciding. This paper shows how choice data identify both unobserved payoff heterogeneity and the cost of information acquisition in a rational inattention discrete-choice model. I establish conditions for semiparametric point identification using exogenous payoff and information-cost shifters, without imposing parametric forms on the taste-shock distribution or on how the unit cost of information varies with observed characteristics. In the model with binary choice, I construct an unobserved choice threshold whose cumulative distribution function is the choice probability as a function of the payoff shifter. Moments of this threshold identify the payoff coefficients and the unit cost of information at each value of the information-cost shifter. A deconvolution argument then identifies the taste-shock distribution. I then extend identification to the model with multinomial choice. To estimate the model, I propose a sieve minimum-distance estimator based on observed market shares and establish its consistency. For inference, I construct confidence regions by test inversion because binding parameter constraints can make the estimator's limiting distribution nonnormal. In an application to Amazon Mechanical Turk, model counterfactuals show that lower unit costs of information raise the average task-taking probability and reduce wage elasticity.

Replacement submissions (showing 18 of 18 entries)

[29] arXiv:2403.03228 (replaced) [pdf, html, other]
Title: The Spoiler Effect in Multiwinner Ranked-Choice Elections: Implications for Proportional Representation
Brian Brubach, Matthew I. Jones, David McCune, Jennifer Wilson
Subjects: Methodology (stat.ME)

In the popular debate over the use of ranked-choice voting, it is often claimed that the method of single transferable vote (STV) is immune or mostly immune to the so-called ``spoiler effect,'' where the removal of a losing candidate changes the set of winners. This claim has previously been studied only in the single-winner case. We investigate how susceptible STV is to the spoiler effect in multiwinner elections, where the output of the voting method is a committee of size at least two. To evaluate STV we compare it to numerous other voting methods including single non-transferable vote, $k$-Borda, and the Chamberlin-Courant rule. We provide simulation results under three different random models and empirical results using a large database of real-world multiwinner political elections from Scotland. Our results show that STV is not spoiler-proof in any meaningful sense in the multiwinner context, but it tends to perform well relative to other methods, especially when using real-world ballot data.

[30] arXiv:2501.06844 (replaced) [pdf, html, other]
Title: REML implementations of kernel-based genomic prediction models for genotype x environment x management interactions
Killian A.C. Melsen, Salvador Gezan, Daniel J. Tolhurst, Fred A. van Eeuwijk, Carel F.W. Peeters
Subjects: Methodology (stat.ME)

High-throughput pheno-, geno-, and envirotyping allows characterization of plant genotypes and the trials they are evaluated in, producing different types of data. These different data modalities can be integrated into statistical or machine learning models for genomic prediction in several ways. One common approach within the analysis of multi-environment trial data in plant breeding is to create linear or nonlinear kernels which are subsequently used in linear mixed models for genotype by environment interactions. Current implementations of these kernel-based mixed models present several opportunities in terms of methodological extensions. Here we show how these models can be easily implemented in standard software, allowing direct restricted maximum likelihood estimation of all parameters. We also extend the models by combining the kernels with unstructured covariance matrices for three-way interactions in genotype by environment by management datasets, while simultaneously allowing for environment-specific genetic variances and multiple bandwidth parameters. We show how the models incorporating Gaussian kernels, heterogeneous variances, and management-specific bandwidths maximize the amount of genetic variance captured by environmental covariables, following a biologically intuitive pattern. Furthermore, we show that these models perform best in sparse testing prediction settings using two real-word datasets on wheat and maize. We discuss opportunities regarding models with multiple kernels or kernels obtained after feature selection, as well as the similarities to models regressing phenotypes on latent and observed environmental covariables. Finally, we discuss the flexibility provided by our implementation in terms of modeling complex plant breeding datasets, allowing for straightforward integration of phenomics, enviromics, and genomics.

[31] arXiv:2507.22472 (replaced) [pdf, html, other]
Title: Inference in a generalized Bradley-Terry model for paired comparisons with covariates and a growing number of subjects
Ting Yan
Comments: Major revisions to theoretical results and numerical studies
Subjects: Methodology (stat.ME)

Motivated by the home-field advantage in sports, we propose a generalized Bradley--Terry model that incorporates covariate information for paired comparisons. It has an $n$-dimensional merit parameter $\bs{\beta}$ and a $p$-dimensional regression coefficient $\bs{\gamma}$ for covariates. When the number of subjects $n$ approaches infinity and the number of comparisons between any two subjects is fixed, we show the consistency of the maximum likelihood estimator (MLE) $(\widehat{\bs{\beta}}, \widehat{\bs{\gamma}})$ of $(\bs{\beta}, \bs{\gamma})$ in cases that $p$ is fixed or diverges with $n$. Furthermore, when $p$ is fixed, we derive the asymptotic normal distribution of the MLE by characterizing its asymptotic representation. The asymptotic distribution of $\widehat{\bs{\gamma}}$ is biased, while that of $\widehat{\bs{\beta}}$ is not. This phenomenon can be attributed to the different convergence rates of $\widehat{\bs{\gamma}}$ and $\widehat{\bs{\beta}}$. The consistency result is further extended to an Erdős--Rényi comparison graph. Numerical studies and a real data analysis demonstrate our theoretical findings.

[32] arXiv:2512.05024 (replaced) [pdf, html, other]
Title: Model-Free Assessment of Simulator Fidelity via Quantile Curves
Garud Iyengar, Yu-Shiou Willy Lin, Kaizheng Wang
Comments: Accepted to NeurIPS 2026
Subjects: Methodology (stat.ME); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)

As generative AI models are increasingly used to simulate real-world systems, quantifying the ``sim-to-real'' gap is critical. For each input setting of interest -- which we call a \emph{scenario}, such as a survey question or operating condition -- the real and simulated systems are associated with unobserved latent population parameters, and their discrepancy varies across scenarios. A fundamental challenge is that, for any given scenario, this discrepancy cannot be observed directly, since both systems are accessible only through finite samples, often of heterogeneous sizes across scenarios. Standard predictive inference methods are therefore ill-suited, as they quantify uncertainty in observable outputs rather than latent population parameters. To address this, we construct confidence sets for these latent parameters and use them to derive a robust proxy for the sim-to-real discrepancy. We then estimate the quantile function of this proxy to obtain a distribution-level risk profile of the simulator, which supports a broad range of statistical summaries, including statistical inference for the real output distribution in a new scenario, the calculation of risk measures like Conditional Value-at-Risk (CVaR), and principled comparisons across simulators. Our method is model-agnostic and handles general output spaces, such as categorical survey responses and continuous multi-dimensional data. We demonstrate the practical utility of this method by evaluating the alignment of four major LLMs with human populations on the WorldValueBench dataset.

[33] arXiv:2603.13662 (replaced) [pdf, html, other]
Title: Fast Uncertainty Quantification for Kernel-Based Estimators in Large-Scale Causal Inference
Matthew Kosko, Falco J. Bargagli-Stoffi, Lin Wang, Michele Santacatterina
Comments: 36 pages
Subjects: Methodology (stat.ME); Applications (stat.AP); Machine Learning (stat.ML)

Kernel methods are widely used in causal inference for tasks such as treatment effect estimation, policy evaluation, and policy learning. The bootstrap is a standard tool for uncertainty quantification because of its broad applicability. As increasingly large datasets become available, such as the 2023 U.S. Natality data from the National Vital Statistics System (NVSS), which includes 3,605,081 registered births (of which 2,980,739 form our analytic sample after cohort restrictions), the computational demands of these methods increase substantially. Kernel methods are known to scale poorly with sample size, and this limitation is further exacerbated by the repeated re-fitting required by the bootstrap. As a result, bootstrap-based inference for kernel-based estimators can become computationally infeasible in large-scale settings. In this paper, we address these challenges by extending the causal Bag of Little Bootstraps (cBLB) algorithm of Kosko et al. (2023) to kernel methods. Our approach achieves computational scalability by combining subsampling and resampling while preserving first-order uncertainty quantification and asymptotically correct coverage. We evaluate the method across three representative implementations: kernelized augmented outcome-weighted learning, kernel-based minimax weighting, and double machine learning with kernel support vector machines. We show in simulations that our method yields confidence intervals with nominal coverage at a fraction of the computational cost. We further demonstrate its utility in a real-world application by estimating the effect of any amount of smoking on birth weight, as well as the optimal treatment regime, using the NVSS dataset, where the standard bootstrap is prohibitively expensive computationally and effectively infeasible at this scale.

[34] arXiv:2604.24652 (replaced) [pdf, html, other]
Title: Benefits and Costs of Adaptive Sampling
Yu-Shiou Willy Lin, Dae Woong Ham, Iavor Bojinov
Comments: 60 pages, 9 figures
Subjects: Methodology (stat.ME); Econometrics (econ.EM)

Multi-armed bandits are widely used for sequential experimentation in clinical trials, public policy treatment, recommendation systems, and online platforms. While regret minimization and valid inference from adaptively collected data have each been studied individually, one question remains: when does adaptivity \emph{improve estimation precision} relative to uniform designs, and how should inference be balanced against the online cost of experimentation? We first study arm-level mean estimation under mean-squared-error (MSE) objectives. We characterize when an adaptive Neyman allocation, which allocates samples according to arm variance, yields strict MSE improvements over uniform sampling in finite samples. When there is variance heterogeneity across arms, these improvements arise at modest sample sizes, clarifying that adaptivity can be preferable for inference not only asymptotically, but also in finite-sample settings. We then study a joint inference--regret objective that accounts for the cost of assigning units to inferior arms during experimentation. We propose three policies: the Plug-in Oracle Rate Policy, Static-Allocation Rate Policy, and Neyman-Adaptive Rate Policy, all of which attain the oracle-optimal asymptotic rate. The latter two offer computationally efficient and easy-to-implement alternatives by combining existing regret-minimizing algorithms with inference-oriented sampling through closed-form mixing rules, avoiding repeated numerical optimization while being managerially interpretable. We compare their finite-sample statistical performance through simulations and empirically calibrated applications. The results highlight the relative strengths of our policies across instances and their tradeoffs between joint inference--regret performance and computational cost.

[35] arXiv:2606.13850 (replaced) [pdf, html, other]
Title: Exact Constrained Decoding for Sequence Models: Controller-Augmented Hidden Markov Models and Beyond
Lekha Patel, Luis Damiano
Subjects: Methodology (stat.ME); Machine Learning (stat.ML)

Hidden Markov models are foundational for sequential inference, yet conditioning on pathwise constraints such as precedence requirements, visitation cardinalities, or monotonic state progression can introduce long-range dependencies that require additional memory for dynamic programming. To deal with this, we present Controller-Augmented Hidden Markov Models (CHMMs), a framework that compiles each constraint into a finite-state controller tracking a sufficient finite history, after which standard forward--backward and Viterbi recursions on the augmented chain compute exact constrained posteriors and maximum a posteriori paths in discrete time and, through uniformization, maximum a posteriori augmented-state sequences at observation times in continuous time. While we establish several theoretical guarantees, a catalog of controller encodings for 11 constraint families operationalizes our framework. Empirically, we evaluate classical and neural decoders with and without controller augmentation on 3 real-world sequence-labeling tasks: gene-structure decoding in \emph{Drosophila melanogaster}, free-living activity recognition in CASAS smart homes, and protocol-defined activity recognition from wearable sensors. Together, theory and experiment characterize when exact controller augmentation is useful and when simpler approaches suffice.

[36] arXiv:2608.05434 (replaced) [pdf, html, other]
Title: Risk-Aware Quantile Learning for Personalized Dynamic Treatment Regimes
Chunyin Lei, Annie Qu
Comments: An earlier version of this work was accepted at STAI-X 2026
Subjects: Methodology (stat.ME); Statistics Theory (math.ST); Machine Learning (stat.ML)

Sequential clinical decision-making often involves more than maximizing average efficacy. Clinicians may need to simultaneously optimize clinically relevant tails of the outcome distribution, control treatment-related risk, and choose among multiple treatment options. Existing quantile dynamic treatment regime (DTR) methods capture distributional features of treatment outcomes but remain largely restricted to efficacy-only objectives and binary treatments. To address these limitations, we propose Risk-Aware Quantile Dynamic Treatment Regimes (RQDTR), a unified framework that optimizes a prespecified quantile of the cumulative potential outcome while explicitly incorporating treatment-related risk. We also develop an angle-based formulation for jointly learning decision rules across multiple treatment categories. Our framework includes three interpretable subclasses: efficacy-only quantile learning, constraint-based learning with population-level risk control, and utility-based learning through a composite benefit-risk utility. Theoretically, we establish identification and oracle equivalence, surrogate and estimator consistency under increasing quadratic penalties, asymptotic risk feasibility, and finite-sample performance error bounds. Extensive simulation studies and applications to All of Us major depressive disorder and MIMIC-III sepsis data demonstrate that RQDTR improves tail-oriented efficacy and achieves more favorable benefit-risk trade-offs than existing quantile DTR methods.

[37] arXiv:2610.04474 (replaced) [pdf, html, other]
Title: Personalized Federated Vector Autoregression with Personalization Diversity
Zhiyun Fan, Xiaoyu Zhang, Guodong Li, Di Wang
Subjects: Methodology (stat.ME)

Personalized federated estimation of high-dimensional time series faces two challenges: identifying shared dynamics and retaining the statistical gains from pooling. We address these challenges through personalization diversity in a vector autoregressive model with shared low-rank dynamics, shared sparse links, and personalized sparse departures. A cross-client support-frequency cap yields a sharp majority threshold for shared-personalized identification, while an additional cross-client $\ell_q$ condition captures approximate diversity and controls approximation under a smaller working personalization frequency cap. We develop PerFeCT-VAR, Personalized Federated Vector Autoregression via Frequency-Capped Thresholding, which jointly enforces clientwise sparsity and cross-client frequency constraints. Under suitable sampling and cross-component compatibility conditions, we establish initialization guarantees and joint local linear convergence for heterogeneous stationary client distributions. Our componentwise error bounds show that diversity attenuates both estimation and approximation errors transmitted from personalized to shared components, and quantify the tradeoff induced by the working cap. These bounds identify regimes in which the shared components attain pooled accuracy despite non-vanishing personalized effects, while personalized estimation achieves local-sample accuracy on average. Simulations and an application to multistore retail revenue data illustrate the estimation, forecasting, and interpretive benefits of the proposed framework.

[38] arXiv:2610.08157 (replaced) [pdf, other]
Title: TEASE: Targeted elastic spatial envelope
Mitchell L. Krock
Subjects: Methodology (stat.ME)

Envelope regression is a crucial part of multivariate linear modeling, leveraging separation into material and immaterial parts to provide parsimonious data reduction. Rekabdarkolaee et al. (2020) construct spatial envelope, a novel multivariate Gaussian process, extended by May et al. (2022) to linear coregionalization envelope. Our proposal (TEASE) combines spatial envelope and full-scale basis graphical lasso (LeDuc et al., 2025), leveraging targeted graphical elastic net (Kovács et al., 2021) for material precision matrices. Immaterial part is a multivariate multiresolution Gaussian Markov random field (Kleiber et al., 2019; Caringi and Secchi, 2026). Enhanced envelope penalty (Kwon and Zou, 2025) regularizes regression coefficients. Demonstrations are on climate data.

[39] arXiv:2611.14785 (replaced) [pdf, html, other]
Title: Semiparametric Inference for Marginal Win Odds with Censored Time-to-Event Outcomes
Zhiguo Li
Subjects: Methodology (stat.ME)

Win statistics provide clinically interpretable measures for comparing treatment groups with prioritized composite outcomes, but efficient covariate-adjustment methods for win statistics with right censored time-to-event outcomes remain limited. We develop a semiparametric framework for marginal win probability and win odds with prioritized time-to-event outcomes, including semi-competing risks, while also accommodating scalar survival outcomes as a special case. The estimand compares independent draws from the marginal distributions of the potential outcomes under treatment and control, which preserves a marginal causal interpretation. We derive the efficient influence function under conditional independent censoring, allowing censoring to depend on baseline covariates and predictable event history. The resulting cross-fitted one-step estimator incorporates covariate adjustment and censoring martingale augmentation, allows flexible estimation of nuisance parameters, and attains the semiparametric efficiency bound under suitable conditions on consistency and convergence rate of nuisance parameters. Simulation studies show that the estimator has small bias, accurate standard error estimation and confidence interval coverage, and substantial efficiency gain relative to the inverse-probability-of-censoring weighted (IPCW) estimator. An application to a randomized breast cancer trial comparing tamoxifen combined with radiotherapy against tamoxifen alone demonstrates improved precision, with an approximately 25\% reduction in estimated variance at five years.

[40] arXiv:2309.06305 (replaced) [pdf, html, other]
Title: Sensitivity Analysis for Linear Estimators
Jacob Dorn, Luther Yap
Comments: Previously circulated as Sensitivity Analysis for Linear Estimands
Subjects: Econometrics (econ.EM); Methodology (stat.ME)

We propose a framework for building sensitivity analyses for linear estimators. We measure the degree of identification failure by the change of measure between the observed distribution and a hypothetical target distribution under which a standard estimator would identify the parameter of interest. Under L_infinity bounds on that derivative, the identified set has closed-form sharp bounds that require no numerical optimization and that are computable and continuous when the derivative is unbounded, nesting Manski-type worst-case bounds and existing characterizations that require bounded changes of measure. The framework nests several selection models for average potential outcomes, yielding the established worst-case bounds of each design. The framework yields a new model family for regression discontinuity (RD) that delivers the first sensitivity analysis on the conditional average treatment effect under manipulation. We show that a bootstrap procedure yields valid confidence intervals. An empirical application shows that a modest restriction on manipulation delivers bounds far more informative than worst-case bounds.

[41] arXiv:2510.07559 (replaced) [pdf, html, other]
Title: General coupling-based f-divergence diagnostics for Markov chain Monte Carlo
Adrien Corenflos, Hai-Dang Dau
Comments: Significantly revised manuscript including new nonasymptotic bounds
Subjects: Computation (stat.CO); Probability (math.PR); Statistics Theory (math.ST); Methodology (stat.ME)

A long-standing gap exists between the theoretical analysis of Markov chain Monte Carlo convergence, which is often based on statistical divergences, and the diagnostics used in practice. We introduce the first general convergence diagnostics for Markov chain Monte Carlo based on a broad class of f-divergence, allowing users to directly monitor, among others, the Kullback-Leibler and the chi-squared divergences as well as the total variation distance. Our approach rests on a coupling-based 'weight harmonization' scheme that produces direct, computable, and consistent importance weights for interacting Markov chains with respect to their target distribution. Beyond their use as convergence diagnostics, these weights give unbiased estimates of the Radon-Nikodym derivative between the un-normalized target and the distribution of the current iterate, a richer object than the convergence bounds alone, with natural applications to importance-weighted inference. We show how such weightings can provide asymptotic upper bounds to any f-divergence, prove that these bounds converge to zero as the chains approach stationarity, and demonstrate that, while more conservative than existing coupling-based total variation estimators, our method remains a practical and broadly applicable diagnostic tool.

[42] arXiv:2511.12069 (replaced) [pdf, other]
Title: A GNN-Based Approach for Code Smell Detection and Refactoring Opportunity Identification
HanYu Zhang, Tomoji Kishi
Comments: We would like to withdraw our manuscript to make further revisions and improvements to its content and experimental analysis. We apologize for any inconvenience and appreciate your understanding
Subjects: Software Engineering (cs.SE); Methodology (stat.ME)

Code smells indicate latent design or implementation problems that may negatively affect software maintainability. Over the past decades, numerous approaches have been proposed for code smell refactoring, including those based on software metrics, predefined rules, machine learning/deep learning (ML/DL), and, more recently, large language models (LLMs). However, traditional metric- and rule-based approaches rely heavily on manually defined criteria, while ML/DL approaches are often constrained by the availability of training data and the design of model architectures. Although LLMs provide advanced code understanding capabilities, they typically incur substantial computational and time costs, particularly when applied to large-scale software systems. In this study, we propose a graph-based deep learning approach for code smell refactoring. Specifically, we construct code graphs at both the class and method levels and employ graph- and node-level classification to detect code smells and identify corresponding refactoring opportunities for three representative code smells: Long Method, Large Class, and Feature Envy. The proposed approach is trained and evaluated using SACS, a large-scale open-source dataset constructed through a semi-automated process. In the experiments, we implement the proposed approach using three representative GNN architectures: GCN, GraphSAGE, and GAT. We further compare its performance with traditional refactoring approaches, an existing deep learning-based approach, and four representative lightweight LLMs. Experimental results show that the proposed approach outperforms the compared approaches across all evaluated code smell refactoring tasks, demonstrating that it provides both superior performance and greater efficiency.

[43] arXiv:2606.10944 (replaced) [pdf, html, other]
Title: Express Language Modeling
Albert Gong, Annabelle Michael Carrell, Raaz Dwivedi, Lester Mackey
Subjects: Machine Learning (cs.LG); Data Structures and Algorithms (cs.DS); Statistics Theory (math.ST); Methodology (stat.ME); Machine Learning (stat.ML)

We introduce a new tool, Express, for converting a non-causal attention approximation into a causal approximation with matching approximation guarantees. When combined with the state-of-the-art Thinformer approximation, Express improves upon the best known causal attention guarantees, delivering $\log^{3/2}(n)/s$ approximation error with only $O(s)$ memory and $O(s^2 \log^2(n))$ compression overhead for a sequence of length $n$. We pair these developments with an efficient I/O-aware Triton implementation, demonstrate substantial speedups over FlashAttention 2, and use Express to overcome four resource bottlenecks in the language modeling pipeline: long-context prefill, KV cache compression, long-form memory-constrained decoding, and long-form compute-constrained decoding.

[44] arXiv:2609.38524 (replaced) [pdf, html, other]
Title: Generative sequence modeling for infinite memory processes via predictive states
Michael Wieck-Sosa, Cosma Rohilla Shalizi
Subjects: Machine Learning (stat.ML); Machine Learning (cs.LG); Methodology (stat.ME)

We consider estimating the one-step-ahead conditional distribution of a multivariate stochastic process. Many existing approaches rely on assumptions such as finite-range memory, sparsity, or additivity, which can be poorly suited to processes with long-range nonlinear interactions. However, without such structural assumptions, nonparametric estimation is challenging due to the curse of dimensionality. To address this challenge, we introduce a new estimator based on learning representations of the \emph{predictive states} of a stochastic process. We show that the statistical complexity of the estimation problem is determined by the dimension of this predictive state representation. Furthermore, we show that a $p$-dimensional predictive state space can be represented in a $2p+1$-dimensional feature space. Our results imply that faster convergence rates are achievable when the predictive state space is lower-dimensional, i.e., when the past history can be compressed into a lower-dimensional statistic that is sufficient for predicting the future. We establish theoretical convergence rate guarantees for an instantiation of our method based on deep neural network estimators. We implement our method in PyTorch and evaluate its performance on synthetic data and real \emph{C. elegans} data.

[45] arXiv:2610.30204 (replaced) [pdf, html, other]
Title: Triple Products of Correlated Multivariate Hermite Polynomials
Laura Lyman
Comments: 25 pages, 4 figures, 1 supplementary PDF with data tables
Subjects: Numerical Analysis (math.NA); Methodology (stat.ME)

Stochastic Galerkin schemes (SGS) are used to approximate solutions to differential equations with stochastic parameters. In particular, they express the solution with an infinite orthogonal functional basis of the parameter space and derive a deterministic surrogate system of PDEs whose solution approximates that of the original stochastic problem. When the parameters are correlated, the infinite series representation of the solution does not provably converge for all joint distributions; further, classic decorrelating transformations (e.g., Rosenblatt, Nataf) often introduce known numerical instabilities. Rahman (2017) established convergence in probability and distribution for correlated Gaussian parameters when the basis functionals are multivariate Hermite polynomials (MHPs), where these polynomials are only weakly orthogonal with respect to the underlying joint density. Due to weak orthogonality, the $N$th moments of MHPs that emerge during Galerkin projection do not trivially decompose into products of one-dimensional expectations via tensorization. Namely, an $N$th-order moment has no closed-form expression for $N > 2$ and consequently is estimated numerically. Because the number of such moments grows combinatorially with parameter dimension and polynomial degree, approximating each one individually via sampling or quadrature can quickly become cost-prohibitive. In this paper, we introduce and prove several foundational properties of MHPs. These results culminate in an explicit formula for evaluating the $N = 3$ moments (triple products) directly without numerical estimation.

[46] arXiv:2611.07219 (replaced) [pdf, html, other]
Title: Neyman Orthogonalized Specification Tests for Conditional Tail Index Models
Liuhua Peng, Shuo Li, Xiaojun Song
Subjects: Statistics Theory (math.ST); Methodology (stat.ME)

We develop specification tests for parametric conditional tail index models of heavy-tailed distributions. The tests are based on a projected empirical process that removes the first-order effect of estimating the null parameter. Within the conditional Hall class, we identify conditions under which projection also eliminates the leading Pareto approximation bias in the test process, permitting lower thresholds while preserving asymptotically correct size. We establish the validity of the tests via multiplier bootstrap and characterize power against fixed and local alternatives. For log-linear models, bootstrap validity extends to settings in which covariates of observations above a common threshold concentrate and the smallest eigenvalue of the information matrix tends to zero. We further propose a novel threshold selection rule based on an estimate of the Pareto approximation bias after projection. The rule uses the estimated bias to determine whether a reference threshold can be lowered to retain more observations, with potential gains in power. The finite sample performance of the tests is examined through simulations and a real data application.

Total of 46 entries
Showing up to 2000 entries per page: fewer | more | all
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)