2026 年的期刊文章 · 第 7 页

共 1756 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2026-09-11 到 2026-09-08。

按期刊、按主题看 →

第 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 页

Biometrika Causal Inference · 发表于 2026-09-11,收录于 2026-09-17

Geodesic difference-in-differences

Yidong Zhou, Daisuke Kurisu, Taisuke Otsu, Hans-Georg Müller

摘要

Summary: Difference-in-differences (DID) is a widely used quasi-experimental design for causal inference, traditionally applied to scalar or Euclidean outcomes, while extensions to outcomes residing in non-Euclidean spaces remain limited. Existing methods for such outcomes have primarily focused on univariate distributions, leveraging linear operations in the space of quantile functions, but these approaches cannot be directly extended to outcomes in general metric spaces. In this paper, we propose geodesic DID, a novel DID framework for outcomes in uniquely geodesic metric spaces that admit a geodesic transport structure, including distributions, networks, and manifold-valued data. To address the absence of algebraic operations in these spaces, we use geodesics as proxies for differences and introduce the geodesic average treatment effect on the treated (ATT) as the causal estimand. We establish the identification of the geodesic ATT and derive the convergence rate of its sample versions, employing tools from metric geometry and empirical process theory. This framework is further extended to the case of staggered DID settings, allowing for multiple time periods and varying treatment timings. To illustrate the practical utility of geodesic DID, we analyze health impacts of the Soviet Union’s collapse using age-at-death distributions and assess effects of U.S. electricity market liberalization on electricity generation compositions.

Biometrics Other · 发表于 2026-09-11

Estimating covariate effects on functional connectivity using voxel-level fMRI data

Wei Zhao, Brian J Reich, Emily C Hector

摘要

Functional connectivity (FC) analysis of resting-state fMRI data provides a framework for characterizing brain networks and their association with participant-level covariates. Due to the high dimensionality of neuroimaging data, standard approaches often average signals within regions of interest (ROIs), which ignores the underlying spatiotemporal dependence among voxels and can lead to biased or inefficient inference. We propose to use a summary statistic—the empirical voxel-wise correlations between ROIs—and, crucially, model the complex covariance structure among these correlations through a new positive definite covariance function. Building on this foundation, we develop a computationally efficient two-step estimation procedure that enables scalable statistical inference on covariate effects on region-level connectivity. Simulation studies show calibrated uncertainty quantification and substantial gains in validity of the statistical inference over the standard averaging method. With data from the Autism Brain Imaging Data Exchange, we show that autism spectrum disorder is associated with altered FC between attention-related ROIs after adjusting for age and gender. The proposed framework offers an interpretable and statistically rigorous approach to estimation of covariate effects on FC suitable for large-scale neuroimaging studies.

Econometrica Longitudinal Data Econometrics & Economics · 发表于 2026-09-10

Why Are the Wealthiest So Wealthy? New Longitudinal Empirical Evidence and Implications for Theories of Wealth Inequality

Joachim Hubmer, Elin Halvorsen, Sergio Salgado, Serdar Ozkan

摘要

We study the lifecycle dynamics of wealth inequality using 1993-2019 Norwegian administrative panel data on wealth and income. Employing a novel budget-constraint approach, we decompose the excess wealth of the top 0.1% households relative to the median between ages 45 and 64 into higher saving rates (36%), inheritances (31%), returns (28%), and labor income (5%). One-quarter of the wealthiest—the "New Money"—start with negative wealth on average but accumulate rapidly through high labor income and exceptionally high saving rates and returns. The "Old Money" inherit substantial wealth and grow it through above-average though more modest saving and returns. We use these dynamic facts to evaluate five standard wealth inequality models. Although these models match cross-sectional wealth concentration, they fail to reproduce the distinct dynamics of New and Old Money. A heterogeneous entrepreneurship model with decreasing returns to scale technology and nonhomothetic preferences is consistent with the observed dynamics." (Retrieved from the Econometric Society's Forthcoming Papers listing; Wiley Early View blocked.) *Publication/online date: date unknown*

JRSSB Spatial & Time Series · 发表于 2026-09-10,收录于 2026-09-24

The partial K function

Jake P Grainger, Tuomas A Rajala, David J Murrell, Sofia C Olhede

摘要

The K function and its related statistics have been an enduring tool in the analysis of spatial point processes, providing an easy to compute and interpret summary statistic for characterising the interactions between points of one type, or between two different types of points. In this paper, we introduce a partial K function, enabling us to account for some of the effects of the other point types when analysing point-point interactions. The partial K function we introduce reduces to the usual K function when the other points are independent of the points of interest and has a similar interpretation. Using examples, we demonstrate how the partial K function can unpick dependence between point types that would otherwise be hidden in the usual K function. We also discuss important bias correction steps and hyperparameter selection. In addition, we introduce an extension to account for other spatial covariates, and demonstrate the methodology on the Lansing Woods dataset.

Econometrica Other · 发表于 2026-09-10

The Wandering Scholars: Understanding the Heterogeneity of University Commercialization

Josh Lerner, Henry Manley, Carolyn Stein, Heidi Williams

Econometrica Clinical Trials Optimization & Learning Theory · 发表于 2026-09-10

The Efficient Deployment of Police Resources: Theory and New Evidence from a Randomized Drunk Driving Crackdown in India

Abhijit Banerjee, Esther Duflo, Louis-Mäel Jean, Daniel Keniston, Nina Singh

摘要

Should police activity be narrowly focused and high force, or widely dispersed but of moderate intensity? Critics of intense "hotspot" policing argue it primarily displaces, not reduces, crime. But if learning about enforcement takes time, the police may take advantage of that period to intervene intensively in the most productive location. We propose a multi-armed bandit model of criminal learning and structurally estimate its parameters using data from a randomized controlled experiment on an anti–drunken driving campaign in Rajasthan, India. In each police station, sobriety checkpoints were either rotated among three locations or fixed in the best one, and the intensity of the crackdown was cross-randomized. Rotating checkpoints reduced night accidents by 17%, and night deaths by 25%, while fixed checkpoints had no significant effects. In structural estimation, we show clear evidence of driver learning and strategic responses. We use these parameters to simulate environment-specific optimal enforcement policies." (Retrieved from the Econometric Society's Forthcoming Papers listing; Wiley Early View blocked.) *Publication/online date: date unknown*

Biometrics Machine Learning Missing Data & Measurement Error · 发表于 2026-09-10,收录于 2026-09-17

Reliable fairness auditing with semi-supervised inference

Jianhui Gao, Jessica Gronsbell

摘要

Machine learning (ML) models often exhibit bias that can exacerbate inequities in biomedical applications. Fairness auditing, the process of evaluating a model's performance across subpopulations, is critical for identifying and mitigating these biases. However, audits typically rely on large volumes of labeled data, which are costly and labor-intensive to obtain. To address this challenge, we introduce Infairness, a unified framework for auditing a wide range of fairness criteria using semi-supervised inference. Our approach combines a small labeled dataset with a large unlabeled dataset by imputing missing outcomes via regression with carefully selected nonlinear basis functions. Through extensive theoretical and empirical analyses, we show that our proposed estimator is (1) robust to specification of the ML or imputation model and (2) substantially more efficient than supervised estimation based solely on the labeled data. In two real-world fairness audits using electronic health record and medical imaging data, Infairness reduces variance by 40–60% compared to supervised estimation, underscoring its value for reliable fairness auditing with limited labeled data." *Publication/online date: 10 September 2026*

Econometrica Econometrics & Economics · 发表于 2026-09-10

Putting the 'Finance' into 'Public Finance': A Theory of Capital Gains Taxation

Mark Aguiar, Benjamin Moll, Florian Scheuer

JASA Meta-Analysis & Data Integration Networks & Graphs · 发表于 2026-09-10

Privacy-Preserving Transfer Learning for Community Detection using Locally Distributed Multiple Networks

Xiao Guo, Xuming He, Xiangyu Chang, Shujie Ma

摘要

Modern applications increasingly involve highly sensitive network data, where raw edges cannot be shared due to privacy constraints. We propose TransNet, a new spectral clustering-based transfer learning framework that improves community detection on a target network by leveraging heterogeneous, locally stored, and privacy-preserved auxiliary source networks. Our focus is the local differential privacy regime, in which each local data provider perturbs edges via randomized response before release, requiring no trusted third party. TransNet aggregates source eigenspaces through a novel adaptive weighting scheme that accounts for both privacy and heterogeneity, and then regularizes the weighted source eigenspace with the target eigenspace to optimally balance the two. Theoretically, we establish an error-bound-oracle property: the estimation error for the aggregated eigenspace depends only on informative sources, ensuring robustness when some sources are highly heterogeneous or heavily privatized. We further show that the error bound of TransNet is no greater than that of estimators using only the target network or only (weighted) sources. Empirically, TransNet delivers strong gains across a range of privacy levels and heterogeneity patterns. For completeness, we also present TransNetX, an extension based on Gaussian perturbation of projection matrices under the assumption that trusted local data curators are available. *(abstract via OpenAlex)*

Biometrika Machine Learning Diagnostics & Prediction · 发表于 2026-09-10,收录于 2026-09-17

Predictions as Surrogates: Revisiting Surrogate Outcomes in the Age of AI

Wenlong Ji, Lihua Lei, Tijana Zrnic

摘要

*(arXiv preprint abstract, arXiv:2501.09731, verbatim; the journal version may differ)* We establish a formal connection between the decades-old surrogate outcome model in biostatistics and economics and the emerging field of prediction-powered inference (PPI). The connection treats predictions from pre-trained models, prevalent in the age of AI, as cost-effective surrogates for expensive outcomes. Building on the surrogate outcomes literature, we develop recalibrated prediction-powered inference, a more efficient approach to statistical inference than existing PPI proposals. Our method departs from the existing proposals by using flexible machine learning techniques to learn the optimal ``imputed loss'' through a step we call recalibration. Importantly, the method always improves upon the estimator that relies solely on the data with available true outcomes, even when the optimal imputed loss is estimated imperfectly, and it achieves the smallest asymptotic variance among PPI estimators if the estimate is consistent. Computationally, our optimization objective is convex whenever the loss function that defines the target parameter is convex. We further analyze the benefits of recalibration, both theoretically and numerically, in several common scenarios where machine learning predictions systematically deviate from the outcome of interest. We demonstrate significant gains in effective sample size over existing PPI proposals via three applications leveraging state-of-the-art machine learning/AI models.

JMLR Other · 发表于 2026-09-10

Pointwise confidence estimation in the non-linear ℓ²-regularized least squares

Ilja Kuzborskij, Yasin Abbasi Yadkori

摘要

(verbatim, from arXiv preprint arxiv.org/abs/2506.07088 — the JMLR page itself could not be re-fetched to confirm word-for-word identity): "We consider a high-probability non-asymptotic confidence estimation in the ℓ²-regularized non-linear least-squares setting with fixed design. In particular, we study confidence estimation for local minimizers of the regularized training loss. We show a pointwise confidence bound, meaning that it holds for the prediction on any given fixed test input x. Importantly, the proposed confidence bound scales with similarity of the test input to the training data in the implicit feature space of the predictor (for instance, becoming very large when the test input lies far outside of the training data). This desirable last feature is captured by the weighted norm involving the inverse-Hessian matrix of the objective function, which is a generalized version of its counterpart in the linear setting, x⊤Cov⁻¹x. Our generalized result can be regarded as a non-asymptotic counterpart of the classical confidence interval based on asymptotic normality of the MLE estimator. We propose an efficient method for computing the weighted norm, which only mildly exceeds the cost of a gradient computation of the loss function. Finally, we complement our analysis with empirical evidence showing that the proposed confidence bound provides better coverage/width trade-off compared to a confidence estimation by bootstrapping, which is a gold-standard method in many applications involving non-linear predictors such as neural networks.

Econometrica Causal Inference Econometrics & Economics · 发表于 2026-09-10

Optimal Formula Instruments

Kirill Borusyak, Peter Hull

摘要

When estimating the effects of treatments defined by complex formulas, researchers often use simple functions of exogenous shocks as instruments. A leading example is "simulated instruments" for public policy eligibility, which capture variation in state-level policy generosity. We show how more powerful instruments can be constructed by incorporating heterogeneous shock exposure while using a recentering procedure to avoid bias. We characterize the asymptotically efficient instruments in this class and propose an algorithm for constructing feasible approximations to them. Compared to a simulated instrument approach, our approach yields a 44% smaller standard error on the private insurance crowd-out effect of Medicaid enrollment from the 2014 Affordable Care Act expansions." (Retrieved from the Econometric Society's Forthcoming Papers listing; Wiley Early View blocked.) *Publication/online date: date unknown*

AoS Other · 发表于 2026-09-10

On importance sampling and independent Metropolis–Hastings with an unbounded weight function

George Deligiannidis, Pierre E. Jacob, El Mahdi Khribch, Guanyang Wang **

摘要

(verbatim, from arXiv preprint 2411.09514): "Importance sampling and independent Metropolis—Hastings (IMH) are among the fundamental building blocks of Monte Carlo methods. Both require a proposal distribution that globally approximates the target distribution. The Radon—Nikodym derivative of the target distribution relative to the proposal is called the weight function. Under the assumption that the weight is unbounded but has finite moments under the proposal distribution, we study the approximation error of importance sampling and of the particle independent Metropolis—Hastings algorithm (PIMH), which includes IMH as a special case. For the chains generated by such algorithms, we show that the common random numbers coupling is maximal. Using that coupling we derive bounds on the total variation distance of a PIMH chain to its target distribution. Our results allow a formal comparison of the finite-time biases of importance sampling and IMH, and we find the latter to be have a smaller bias. We further consider bias removal techniques using couplings, and provide conditions under which the resulting unbiased estimators have finite moments. These unbiased estimators provide an alternative to self-normalized importance sampling, implementable in the same settings. We compare their asymptotic efficiency as the number of particles goes to infinity, and consider their use in robust mean estimation techniques.

JASA High-Dimensional Testing & Uncertainty Nonparametric & Semiparametric · 发表于 2026-09-10

Model-free Feature Screening and False Discovery Control for High-dimensional Quantile Regressions

Cong Cheng, Tianyi Zhang, Runze Li, Yuan Ke

摘要

High-dimensional quantile regressions are powerful tools for capturing the diverse relationships between predictors and response variables across different quantile levels. However, existing feature screening methods for quantile regressions often rely on restrictive model assumptions, limiting their applicability in complex data settings. In this paper, we propose a novel model-free feature screening framework for high-dimensional quantile regressions, leveraging a novel statistical measure called Copula Quantile Dependence. This measure quantifies the functional dependence between predictors and the response variable at a given quantile level without requiring a predefined model structure. Building on this concept, we develop the Quantile Copula-based Screening (QC-Screen) method, which ranks features based on their Copula Quantile Dependence values and selects the most informative ones. We also introduce a data-driven procedure named QC-FDR to control the False Discovery Rate (FDR) while ensuring the inclusion of significant predictors. We establish the theoretical properties of QC-Screen, proving its sure screening and rank consistency properties, and demonstrate that QC-FDR asymptotically controls FDR at the desired level. Extensive simulations and a real-world economic data analysis confirm the superior empirical performance of QC-Screen and QC-FDR, highlighting their effectiveness in high-dimensional quantile regressions. *(abstract via OpenAlex)*

Econometrica Econometrics & Economics · 发表于 2026-09-10

Information Based Inference in Models with Set-Valued Predictions and Misspecification

Hiroaki Kaido, Francesca Molinari

摘要

This paper proposes an information-based inference method for partially identified parameters in incomplete models that is valid both when the model is correctly specified and when it is misspecified. Key features of the method are: (i) it is based on minimizing a suitably defined Kullback-Leibler information criterion that accounts for incompleteness of the model and delivers a non-empty pseudo-true set; (ii) it is computationally tractable; (iii) its implementation is the same for both correctly and incorrectly specified models; (iv) it exploits all information provided by variation in discrete and continuous covariates; (v) it relies on Rao's score statistic, which is shown to be asymptotically pivotal." (Retrieved from the Econometric Society's Forthcoming Papers listing; Wiley Early View blocked. Note: no formal "Abstract" header was found in the retrievable text — this is the paper's opening feature-summary paragraph.) *Publication/online date: date unknown*

AoS High-Dimensional Functional Data · 发表于 2026-09-10

Functional linear regression from sparse to dense designs: a pooling-ridge method and minimax optimality

Shunxing Yan, Fang Yao

摘要

(verbatim, from arXiv preprint): "Functional data analysis is an important statistical field that treats data as random functions. In practice, the random functions are often not fully observed but instead measured at discrete times. While simpler problems, such as mean and covariance estimation, have been widely studied for discretely observed data, optimal estimation of linear regression for this data type has remained unsolved for over two decades. To tackle this fundamental challenge, we propose a novel approach, referred to as pooling ridge estimation, which combines the advantages of pooling strategy and RKHS-based method by incorporating the unbiased estimation of operators based on discretely observed measurements from all subjects. This unified estimation framework enables us to achieve minimax optimality in prediction risk in arbitrary sampling schemes ranging from sparse to dense designs, for both scalar-on-function and function-on-function regression models. Such methodological and theoretical advances are obtained for the first time and accurately reveal the influence of discrete sampling. For scalar-on-function regression, the phase transition occurs once, separating the convergence behavior into two distinct regimes. Remarkably, for function-on-function regression, up to three phase transitions may occur, determined by the sampling frequencies of the predictor/response functions. Finally, simulation experiments and two real data examples provide empirical support for the proposed methods." *(Classified as Longitudinal because discretely/irregularly-observed functional data measured per subject over time is the standard statistical framework for longitudinal/repeated-measures data, even though the paper frames itself generically as functional data analysis.)*

Econometrica Machine Learning · 发表于 2026-09-10

From Predictive Algorithms to the Automatic Generation of Anomalies

Sendhil Mullainathan, Ashesh Rambachan

摘要

*(arXiv preprint abstract, arXiv:2404.10111, verbatim; the journal version may differ; preprint title: "From Predictive Algorithms to Automatic Generation of Anomalies")* How can we extract theoretical insights from machine learning algorithms? We take a familiar lesson: researchers often turn their intuitions into theoretical insights by constructing "anomalies" -- specific examples highlighting hypothesized flaws in a theory, such as the Allais paradox and the Kahneman-Tversky choice experiments for expected utility. We develop procedures that replace researchers' intuitions with predictive algorithms: given a predictive algorithm and a theory, our procedures automatically generate anomalies for that theory. We illustrate our procedures with a concrete application: generating anomalies for expected utility theory. Based on a neural network that accurately predicts lottery choices, our procedures recover known anomalies for expected utility theory and discover new ones absent from existing work. In incentivized experiments, subjects violate expected utility theory on these algorithmically generated anomalies at rates similar to the Allais paradox and common ratio effect.

Econometrica Econometrics & Economics · 发表于 2026-09-10

Evaluating Policy Institutions — 150 Years of US Monetary Policy

Regis Barnichon, Geert Mesters

SMMR Clinical Trials · 发表于 2026-09-10

Covariate-adaptive randomization with dropouts

Meng-Hsuan Sung, Qian Xiao, Ye Shen

摘要

While clinical trials are often regarded as the gold standard by medical researchers and regulatory agencies, the statistical properties of typical randomized controlled trials heavily depend on large sample sizes, which may not always be achievable due to budget constraints or other practical limitations. To address this issue, adaptive designs have gained increasing attention since the 1970s. These designs incorporate modifications in trial procedures or statistical methodologies, aiming to fulfill study objectives more efficiently using smaller sample sizes and shorter durations compared to traditional clinical trials. Specifically, covariate-adaptive designs are developed to reduce the risk of significant covariate imbalances among treatment groups, particularly in studies with limited sample sizes. Additionally, patient dropout during trials significantly impacts statistical inference regarding treatment effects and diminishes statistical power. Ignoring dropout events can result in undesirable participant allocation and substantial treatment imbalances. In this article, we propose novel strategies that explicitly incorporate dropout information into covariate-adaptive randomization. We thoroughly investigate the statistical properties of covariate-adaptive designs adjusted for dropouts. Extensive simulation studies highlight the advantages of the proposed approaches. Our research lays a robust foundation for future developments in covariate-adaptive randomization, specifically addressing dropout challenges.

Econometrica Econometrics & Economics · 发表于 2026-09-10

Cash Transfers and the Local Economy: Evidence from Brazil

François Gerard, Joana Naritomi, Joana Silva

Biometrics Clinical Trials Bayesian Methods Optimization & Learning Theory · 发表于 2026-09-10

Bayesian optimization for identification of optimal biological dose combinations in personalized dose-finding trials

James Willard, Shirin Golchi, Erica E M Moodie

摘要

Early-phase, personalized dose-finding trials for combination therapies seek to identify patient-specific optimal biological dose (OBD) combinations, which are defined as safe dose combinations that maximize therapeutic benefit for a specific covariate pattern. Given the small sample sizes that are typical of these trials, it is challenging for traditional parametric approaches to identify OBD combinations across multiple dosing agents and covariate patterns. To address these challenges, we propose a Bayesian optimization approach to dose-finding that incorporates efficacy and toxicity information into the sequential search strategy. Independent Gaussian processes are used to model the efficacy and toxicity surfaces, and an acquisition function is utilized to define the dose-finding strategy. Furthermore, we define an adaptive stopping rule using the posterior entropy for the location of the OBD. This work is motivated by a personalized dose-finding trial which considers a dual-agent therapy for obstructive sleep apnea (OSA), where OBD combinations are tailored to OSA severity. Via a simulation study, the approach is first investigated across varying degrees of response heterogeneity for both efficacy and toxicity, and then a collection of final designs for the OSA trial are compared. We demonstrate that the proposed approach toward personalized dose-finding yields good performance under the considered scenarios.

JASA Testing & Uncertainty · 发表于 2026-09-10

Asymptotic FDR Control with Model-X Knockoffs: Is Moments Matching Sufficient?

Yingying Fan, Lan Gao, Jinchi Lv, Xiaocong Xu

摘要

We propose a unified theoretical framework for studying the robustness of the model-X knockoffs framework by investigating the asymptotic false discovery rate (FDR) control of the practically implemented approximate knockoffs procedure. This procedure deviates from the model-X knockoffs framework by substituting the true covariate distribution with a user-specified distribution that can be learned using in-sample observations. By replacing the distributional exchangeability condition of the model-X knockoff variables with three conditions on the approximate knockoff statistics, we establish that the approximate knockoffs procedure achieves the asymptotic FDR control. Using our unified framework, we further prove that an arguably most popularly used knockoff variable generation method—the Gaussian knockoffs generator based on the first two moments matching—achieves the asymptotic FDR control when the two-moment-based knockoff statistics are employed in the knockoffs inference procedure. For the first time in the literature, our theoretical results justify formally the effectiveness and robustness of the Gaussian knockoffs generator. Numerical examples are conducted to validate the theoretical findings. *(abstract via OpenAlex)*

SMMR Bayesian Methods Networks & Graphs Longitudinal Data · 发表于 2026-09-10

Advancing multilevel Bayesian networks with efficient Bayesian inference

Bezalem Eshetu Yirdaw, Legesse Kassa Debusho, Janet van Niekerk, Håvard Rue

摘要

Bayesian networks (BNs) are widely used tools for the modeling of complex dependencies among variables. However, their application to multilevel or clustered data remains constrained, especially in scenarios involving multiple random effects, due to a lack of methods and more pressing, efficient computational frameworks. In this article, we propose an innovative framework, INLA-MBN, that integrates multilevel BNs (MBNs) with the integrated nested Laplace approximation (INLA), thereby facilitating efficient structure and parameter learning in both longitudinal and cross-sectional multilevel data contexts. To the best of our knowledge, this is the first implementation of INLA for BNs that involves more than one correlated random effect. More precisely, we advance existing research by modeling longitudinal data with two correlated random effects and multilevel cross-sectional data with more than two correlated random effects. Our approach encompasses both Gaussian and hybrid MBNs that incorporate Gaussian and categorical nodes. Through an exhaustive simulation study, we demonstrate that INLA-MBN exhibit superior performance compared to networks based on maximum likelihood estimation, particularly, in scenarios characterized by small group sizes or limited repeated measurements per subject. INLA-MBN achieves a fully inferred MBN, while negating the cost associated with MBNs based on Markov Chain Monte Carlo. The proposed method was also applied to real-life longitudinal child morbidity data to demonstrate its practical applicability.

AoS High-Dimensional · 发表于 2026-09-10

Active Subsampling for Measurement-Constrained M-Estimation of Individualized Thresholds with High-Dimensional Data

Jingyi Duan, Lehao Fu, Yang Ning

摘要

Measurement-constrained problems frequently arise in modern applications such as electronic health record studies. In such problems, despite the availability of large datasets, collecting labeled data can be highly costly or time-consuming, allowing only a small portion of the data to be labeled within a given budget. This raises a critical question: which data points are most beneficial to label given the budget constraint? We study this question in the context of estimating an optimal individualized threshold under a measurement-constrained M-estimation framework. In particular, our goal is to estimate a high-dimensional parameter θ in a linear threshold θᵀZ for a continuous variable X such that the discrepancy between whether X exceeds the threshold θᵀZ and a binary outcome Y is minimized. In the measurement-constrained setting, we propose a novel K-step active subsampling algorithm to estimate θ, which iteratively samples the most informative observations in the dataset and solves a regularized M-estimator. Our theoretical analysis reveals a sharp phase transition phenomenon with respect to β, the smoothness of the conditional density of X given Y and Z." *Publication/online date: date unknown (IMS Future Papers list gives no per-item date)*

Biometrics High-Dimensional Causal Inference Nonparametric & Semiparametric · 发表于 2026-09-09

Multiply robust inference of average treatment effects by high-dimensional empirical likelihood

Xintao Xia, Yumou Qiu

摘要

In this paper, we develop a multiply robust inference procedure for the average treatment effect (ATE) for data with high-dimensional covariates. We consider the case where it is difficult to correctly specify a single parametric model for the propensity scores (PS). We propose a novel high-dimensional empirical likelihood weighting method under soft covariate balancing constraints to combine multiple working PS models. An extended set of calibration functions is used, and a regularized augmented outcome regression (OR) is developed to correct the bias due to non-exact covariate balancing. Those two approaches provide a new way to construct the Neyman orthogonal score of the ATE. The proposed confidence interval for the ATE achieves asymptotically valid nominal coverage under high-dimensional covariates if any of the PS models, their linear combination, or the OR model is correctly specified. The proposed method is extended to generalized linear models for the outcome variable and data with unknown clusters. Specifically, we consider estimating the ATE for data with unknown clusters, where multiple working PS models can be fitted based on the estimated clusters. We demonstrate the advantages of the proposed approach over existing doubly robust inference methods under high-dimensional covariates via simulation studies. We analyze the right heart catheterization dataset, collected in two study phases across five medical centers, to demonstrate the effectiveness of the proposed method.

SiM Bayesian Methods · 发表于 2026-09-09

Hybrid Non‐Informative and Informative Prior Model‐Assisted Designs for Mid‐Trial Dose Insertion

Masahiro Kojima, Kana Yamada, Hisato Sunami, Kentaro Takeda, Keisuke Hanada

摘要

In oncology phase I trials, model‐assisted designs have been increasingly adopted because they enable adaptive yet operationally simple dose adjustment based on accumulating safety data, leading to a paradigm shift in dose‐escalation methodology. In practice, a single mid‐trial dose insertion may be considered to examine safer doses and/or to collect more informative efficacy data. In this study, we investigate methods to improve dose assignment and the selection of the maximum tolerated dose (MTD) or the optimal biological dose (OBD) when a new dose level is added during an ongoing trial under a model‐assisted framework, by assigning informative prior information to the inserted dose. We propose a hybrid design that uses a non‐informative model‐assisted design at trial initiation and, upon dose insertion, applies an informative‐prior extension only to the newly added dose. In addition, to address potential skeleton misspecification, we propose two adaptive extensions: (i) an online‐weighting approach that updates the skeleton over time, and (ii) a Bayesian‐mixture approach that robustly combines multiple candidate skeletons. We evaluate the proposed methods through simulation studies.

JASA Other · 发表于 2026-09-09,收录于 2026-09-24

Bending the Learning Curve for EHR Research via Knowledge-Driven Online Multimodal Automated Phenotyping System

Not retrieved — tandfonline page blocked and no matching preprint located

摘要

Electronic health records (EHRs) hold great promise for translational research but remain difficult to use at scale because diagnostic codes are noisy, disease-relevant features are hard to identify, high-quality labels are limited and patient-level data sharing is often restricted. We introduce Knowledge-driven Online Multimodal Automated Phenotyping (KOMAP), a unified system for automated, privacy-preserving EHR phenotyping using summary statistics. The system is organized around three original and integrated layers. First, the Multi-source Representation Learning (MultiReL) embedding layer fuses EHR co-occurrence information from multiple health systems with biomedical language-model representations into a shared semantic space. Second, the Online Narrative and Codified feature Engine (ONCE) retrieves and ranks disease-relevant codified and narrative concepts using MultiReL and local EHR support. Third, the KOMAP phenotyping layer trains, validates, and transports disease-specific algorithms from simple summary statistics rather than individual-level patient records. Validation in four healthcare centers demonstrated the ability of KOMAP to support patient subtyping, generate highly accurate phenotyping algorithms, and improve statistical power in downstream phenome-wide association studies (PheWAS). In a PheWAS of a statin-related genetic variant, KOMAP identified significant protective associations for alopecia and seborrheic dermatitis that were not found by standard methods. By combining knowledge-guided feature retrieval with summary-statistics-based phenotyping, the proposed framework reduces privacy, computational, and technical barriers to high-throughput EHR research and supports scalable multi-institutional biomedical discovery. *(abstract via OpenAlex)*

Biometrics Bayesian Methods Optimization & Learning Theory Clinical Trials · 发表于 2026-09-09

A Bayesian model averaging method for dose ranging studies in oncology

Adetayo Kasim, Nathan W Bean, Elena Parkhomenko, Amelia Cottle, Andre Acusta, Helen Zhou, Tai-Tsang Chen, Antony Sabin, Matthew A Psioda

摘要

Dose finding and optimization studies are important in oncology drug development for making new drugs available to patients at pace and for reducing the risk of toxicity. The requirement by Project Optimus to conduct a randomized dose optimization study necessitates a change in the oncology drug development paradigm, and standard dose-response modeling approaches (e.g., Multiple Comparisons Procedure-Modeling, MCP-Mod) are not always applicable due to small sample sizes and a small number of doses that are typical of dose optimization studies. An innovative Bayesian model averaging method for dose ranging studies (BAMADOS) is proposed for the design and analysis of oncology trials with binary endpoints. The method assumes a monotonic relationship between response and doses of an investigational drug. It does not require pre-specification of candidate models but instead evaluates all possible models in a constrained model space. To minimize the potential impact of the Occam’s razor property, non-conjugate moderately informative priors from the family of generalized normal priors are implemented. We show via simulation studies that BAMADOS correctly identifies the optimal biological dose in a dose optimization setting. It further estimates response rates with little bias, even in the presence of discordance between the priors and observed data. Compared to MCP-Mod, BAMADOS exhibited higher power for small sample sizes (30 or fewer participants per dose) and comparable power for larger sample sizes in several scenarios considered.

JASA High-Dimensional Econometrics & Economics Latent Variables & Mixtures · 发表于 2026-09-08

Taxonomy and Estimation of Multiple Breakpoints in High-Dimensional Factor Models*

Jiangtao Duan, Jushan Bai, Xu Han

摘要

This paper proposes a quasi-maximum likelihood (QML) estimator for break points in high-dimensional factor models, specifically accounting for multiple structural breaks. We begin by establishing a necessary and sufficient condition to categorize two distinct types of breaks in factor loadings: singular changes and rotational changes. The analysis of the nearly singular subsample covariance matrices of the pseudo-factors plays a key role in our approach. It allows us to demonstrate that the QML estimator precisely identifies the true breakpoint with probability tending to one for singular changes. For rotational changes, we demonstrate that the estimator exhibits stochastically bounded estimation errors, implying break fraction consistency. Furthermore, we introduce an information criterion to estimate the number of breaks, proving that it can detect the true number with probability tending to one. Monte Carlo simulations confirm the strong finite sample performance of our proposed methods. Finally, we provide an empirical example to estimate structural breakpoints in the FRED-MD dataset spanning 1959 to 2024. *(abstract via OpenAlex)*

SMMR Diagnostics & Prediction Clinical Trials Latent Variables & Mixtures · 发表于 2026-09-08

Sample size determination for a prospective bridging study to harmonize retrospective data from multiple studies—Application to a biofluid biomarker study of Alzheimer’s disease

Chengjie Xiong, Yuzheng Nie, Jingqin Luo, Ruijin Lu, David Wolk, Leslie M Shaw, Carey E Gleason, Sterling C Johnson, Folasade Agboola, John C Morris, Suzanne E Schindler

摘要

Biomarkers measured from biofluid samples and imaging scans are important to aid diagnosis of diseases and track their progression over time, especially in neurodegenerative diseases such as Alzheimer's disease (AD). Combining retrospectively obtained biomarker data across multiple studies can increase statistical power, but existing biomarker data may be generated using different assay platforms, scanner types, or processing protocols by different studies, which may significantly affect the measurements of biomarkers and hence render it necessary to harmonize the data across the studies. An optimal way of biomarker data harmonization is to re-analyze all the biofluid samples or imaging scans together on a single platform in a central reference lab, but this is often not practical because of the substantial cost involved as well as the limited amount of biofluid samples available. A more practical solution is to prospectively design a bridging study by re-measuring a subset of biofluid samples or imaging scans from the studies in a reference lab to evaluate how biomarker values may be harmonized across studies. An important design question for such a bridging study is the size of the retrospectively collected biofluid samples or imaging scans that will be re-measured. We aim to address this question by conceptualizing a latent but true biomarker that underlies the observed versions of the biomarker measured across retrospective studies and proposing methods to determine the sample size of a bridging study for estimating the biological correlation of the true biomarker with a standard and validated clinical outcome. We also report bridging data of several analytes from cerebrospinal fluid (CSF) in a multi-center biomarker study of AD and demonstrate that a small proportion of the CSF samples may be sufficient to design a future bridging study for estimating the correlations of CSF biomarkers with a cognitive and functional outcome.

JASA Meta-Analysis & Data Integration Missing Data & Measurement Error · 发表于 2026-09-08

Representation Retrieval Learning for Heterogeneous Data Integration

Qi Xu, Annie Qu

摘要

In the era of big data, large-scale, multi-source, multi-modality datasets are increasingly ubiquitous, offering unprecedented opportunities for predictive modeling and scientific discovery. However, these datasets often exhibit complex heterogeneity, such as covariates shift, posterior drift, and blockwise missingness, which worsen predictive performance of existing supervised learning algorithms. To address these challenges simultaneously, we propose a novel Representation Retrieval ( R 2 ) framework, which integrates a dictionary of representation learning modules (representer dictionary) with data source-specific sparsityinduced machine learning model (learners). Under the R 2 framework, we introduce the notion of integrativeness for each representer, and propose a novel Selective Integration Penalty (SIP) to explicitly encourage more integrative representers to improve predictive performance. Theoretically, we show that the excess risk bound of the R 2 framework is characterized by the integrativeness of representers, and SIP effectively improves the excess risk. Extensive simulation studies validate the superior performance of R 2 framework and the effect of SIP. We further apply our method to two real-world datasets to confirm its empirical success. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work. *(abstract via PubMed)*

SiM Genetics & Omics Nonparametric & Semiparametric · 发表于 2026-09-08

Quantile Tensor Regression for Integrative Genomic Analysis of Oesophageal Carcinoma

Shuo Liu, Wolfgang Karl Härdle, Jianxin Pan, Jian Hou, Tan Meng, Maozai Tian

摘要

Recent integrative genomic studies have increasingly exploited the tensor structure of multi‐omics data to develop statistical methods that jointly model the relationship between clinical outcomes and multiple genomes. However, genomic measurements and clinical outcomes are frequently contaminated by outliers or heavy‐tailed noise, necessitating robust tensor‐based inference approaches. In this paper, we investigate the quantile tensor regression with an emphasis on the region selection problem. We introduce a novel estimator that integrates quantile regression for robustness with a nonconvex penalty to encourage sparsity in the tensor coefficient, thereby enabling the identification of localized genomic regions that significantly influence the clinical response. To solve the resulting optimization problem, we devise an effective algorithm tailored to the nonconvex objective and tensor architecture. We establish the asymptotic properties of the proposed nonconvex penalized estimator. Extensive simulations demonstrate the excellent finite‐sample performance of the proposed estimator. We further illustrate the practical utility of the proposed estimator through an application to esophageal carcinoma data, providing empirical validation.

JRSSB Meta-Analysis & Data Integration · 发表于 2026-09-08,收录于 2026-09-24

Optimal federated learning for functional mean estimation under heterogeneous privacy constraints

T Tony Cai, Abhinav Chakraborty, Lasse Vuursteen

摘要

Federated learning (FL) is a distributed machine learning technique designed to preserve data privacy and security, and it has gained significant importance due to its broad range of applications. This paper addresses the problem of optimal functional mean estimation from discretely sampled data in a federated setting. We consider a heterogeneous framework where the number of individuals, measurements per individual, and privacy parameters vary across one or more servers, under both common and independent design settings. In the common design setting, the same design points are measured for each individual, whereas in the independent design setting, each individual has their own random collection of design points. Within this framework, we establish minimax upper and lower bounds for the estimation error of the underlying mean function, highlighting the differences between common and independent designs under distributed privacy constraints. We propose algorithms that achieve the optimal tradeoff between privacy and accuracy and provide optimality results that quantify the fundamental limits of private functional mean estimation. We further support the theory with simulations and a real-data illustration using BMI trajectories from the Health and Retirement Study.

JASA Meta-Analysis & Data Integration Nonparametric & Semiparametric · 发表于 2026-09-08

Optimal Federated Learning for Nonparametric Regression with Heterogeneous Distributed Differential Privacy Constraints

T. Tony Cai, Abhinav Chakraborty, Lasse Vuursteen

摘要

This paper investigates federated learning for nonparametric regression under heterogeneous differential privacy (DP) constraints. Data is distributed across multiple servers with varying sample sizes and privacy budgets, with each server communicating privatized summaries to a central aggregator. Our work operates within the Federated Differential Privacy (FDP) framework, which generalizes both local and central DP frameworks.We establish the minimax optimal rates of convergence over Besov spaces and develop optimal distributed, wavelet-based estimators for both global and pointwise risk. Our estimators handle heterogeneous data distributions by addressing covariate shift through a two-stage procedure that includes private density estimation. We also derive minimax rates for density estimation under FDP and extend our regression estimators to unknown noise levels using adaptive procedures. Simulations and real data, including a heart disease dataset from four hospitals, illustrate these findings.Our results highlight the trade-offs between statistical accuracy and privacy, quantifying the compromise based on privacy budgets and the inherent loss from distributing data within this privacy framework. This analysis captures the common understanding that privacy is easier to retain in larger samples and explores the nuanced differences between pointwise and global estimation under distributed privacy constraints. *(abstract via OpenAlex)*

JASA Latent Variables & Mixtures · 发表于 2026-09-08,收录于 2026-07-24

Observable versus Latent Factors

Not available

摘要

We test for temporal stability in local linear projection coefficients of observable factors on latent ones embedded in a high-dimensional vector obeying a linear factor model. The proposed test explores the fact that, under the null hypothesis, residuals from global linear projections of observable factors on latent ones, computed over a fixed time interval via Principal Component Analysis (PCA), should also be locally uncorrelated with the PCA factors. The test is fully nonparametric. Its asymptotic behavior is derived under a joint infill and large cross-section asymptotic setup. The test can be used to decide whether and over what horizon observable factors can be linearly spanned by latent ones. In an empirical application, we show that a linear relation between the market volatility factor and the latent systematic risk factors embedded in the cross-section of stock returns exists only over short periods of length of one trading day. *(abstract via OpenAlex)*

JASA Nonparametric & Semiparametric · 发表于 2026-09-08

Nonparametric Statistics on Stratified Spaces and Their Applications in Object Data Analysis

Lingxuan Shao

摘要

Victor Patrangenaru and Daniel E. Osborne. Boca Raton, FL: Chapman & Hall/CRC Press, 2025, xv + 187 pp., $189.99(H), ISBN: 978-1-138-04313-8.Nowadays, more and more data we meet are not just simple... *(abstract via OpenAlex)*

SMMR Diagnostics & Prediction · 发表于 2026-09-08

Multiple-use prediction and calibration for all future values: Exact simultaneous tolerance bands for multiple and polynomial regressions

Lingjiao Wang, Yang Han, Wei Liu, Frank Bretz

摘要

Multiple-use prediction and calibration for all future values play an important role in many areas, including health and medical research. Simultaneous tolerance bands (STBs) can be employed for these purposes. This article studies the construction of exact STBs for multiple regression over any given rectangular covariate regions and for polynomial regression over any given covariate intervals. We first fill the gap in constructing the exact STBs for multiple regression over rectangular regions. We then propose a general form of STBs and develop a method for computing the critical constants for all STBs considered, including existing ones in the literature. A new STB is also proposed for both multiple and polynomial regressions. This new STB and several existing forms are then compared under the average shift (AS) criterion. Numerical results indicate that the new STB performs best under the AS criterion and is therefore recommended. In addition, a computationally efficient algorithm is presented. Real-life examples are provided for illustration.

SiM Diagnostics & Prediction Longitudinal Data Survival Analysis · 发表于 2026-09-08

Joint Models of Two Longitudinal Biomarkers and Clustered Survival Data for Cluster‐Informed Dynamic Prediction With Application to Periodontitis

Sean Xinyang Feng, Laurent Briollais, Aya A. Mitani

摘要

Joint modeling of longitudinal data and time‐to‐event data have been extended to accommodate multilevel data structures. In dental studies, data often exhibit a multilevel hierarchy: each patient has multiple teeth, and one or more biomarkers are measured repeatedly over time for each tooth. In addition to biomarker measurements, the time to tooth loss may vary differently between patients as some patients are more susceptible to tooth loss, conditional on other risk factors. In this paper, we account for intra‐patient and intra‐tooth correlations in the longitudinal measurement of a continuous biomarker, probing pocket depth (PPD), and a binary biomarker, mobility. We also account for the correlation in time to tooth loss between teeth within the same patient. We jointly model the two longitudinal measurements and the risk of tooth loss using Bayesian estimation. We develop a cluster‐informed dynamic prediction framework for the survival outcome, in which the prediction for a given unit is informed not only by its own observed history but also by the observed longitudinal trajectories and event outcomes of other units within the same cluster. We evaluate the predictive performance in terms of discrimination and calibration, accounting for censoring and the multilevel data structure. Our simulation study shows that the proposed joint model produced more accurate estimates and better predictive performance compared to the standard bivariate joint model that ignores the multilevel data structure. We applied our model to electronic periodontal data obtained from the Canadian Armed Forces (CAF).

JASA Meta-Analysis & Data Integration · 发表于 2026-09-08

Guided Adversarial Robust Transfer Learning with Source Mixing

Xin Xiong, Zijian Guo, Tianxi Cai

摘要

Transfer learning is a critical technique that enables the application of knowledge gained from existing tasks or domains to improve performance on a new one, reducing the need for extensive data and training in each new context. Many existing transfer learning methods rely on leveraging information from source populations closely resembling the target population. However, this approach often overlooks valuable knowledge that may be present in different yet potentially related auxiliary samples. When dealing with a limited amount of target data and multiple source data, we introduce a novel approach, Guided Adversarial Robust Transfer (GART) learning, that breaks free from strict similarity constraints. GART is designed to optimize the most adversarial loss with respect to a collection of source mixture distributions that guarantee excellent prediction performances for the target data. We establish the closed form of the population GART and show that the GART estimator achieves a faster convergence rate than the model fitted with the target data. Our simulation studies suggest that GART outperforms existing transfer learning methods, attaining higher robustness and accuracy. We highlight GART’s predictiveness and robustness by applying it to form genetic prediction models of high-density lipoprotein cholesterol using multi-institutional biobank-linked electronic health records data. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work. *(abstract via OpenAlex)*

Biometrika Networks & Graphs · 发表于 2026-09-08,收录于 2026-09-17

Bias correction for Chatterjee's graph-based correlation coefficient

Mona Azadkia, Leihao Chen, Fang Han

摘要

Summary: Azadkia & Chatterjee (2021) recently introduced a simple nearest-neighbour graph-based correlation coefficient that consistently detects both independence and functional dependence, in both unconditional and conditional settings. Specifically, it approximates a measure of dependence that equals 0 if and only if the variables are (conditionally) independent, and 1 if and only if they are (conditionally) functionally dependent. However, this nearest-neighbour estimator includes a bias term that may vanish at a rate slower than n1/2, preventing consistency at rate n1/2 in general. In this article, focusing on the unconditional version, we (i) analyse this bias term closely and show that it could become asymptotically negligible when the dimension is at most three and (ii) propose a bias-correction procedure for more general settings. In both regimes, we obtain estimators (either the original or the bias-corrected version) that are consistent at the parametric rate n1/2 and asymptotically normal.

第 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 页