2023 年的期刊文章 · 第 11 页

共 1511 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2023-08-01 到 2023-07-21。

按期刊、按主题看 →

第 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 页

AoS Causal Inference Machine Learning · 发表于 2023-08-01

Projected state-action balancing weights for offline reinforcement learning

Jiayi Wang, Zhengling Qi, Raymond K. W. Wong

摘要

Off-policy evaluation is considered a fundamental and challenging problem in reinforcement learning (RL). This paper focuses on value estimation of a target policy based on pre-collected data generated from a possibly different policy, under the framework of infinite-horizon Markov decision processes. Motivated by the recently developed marginal importance sampling method in RL and the covariate balancing idea in causal inference, we propose a novel estimator with approximately projected state-action balancing weights for the policy value estimation. We obtain the convergence rate of these weights, and show that the proposed value estimator is asymptotically normal under technical conditions. In terms of asymptotics, our results scale with both the number of trajectories and the number of decision points at each trajectory. As such, consistency can still be achieved with a limited number of subjects when the number of decision points diverges. In addition, we develop a necessary and sufficient condition for establishing the well-posedness of the operator that relates to the nonparametric Q-function estimation in the off-policy setting, which characterizes the difficulty of Q-function estimation and may be of independent interest. Numerical experiments demonstrate the promising performance of our proposed estimator.

AoS Other · 发表于 2023-08-01

Post-selection inference via algorithmic stability

Tijana Zrnic, Michael I. Jordan

摘要

When the target of statistical inference is chosen in a data-driven manner, the guarantees provided by classical theories vanish. We propose a solution to the problem of inference after selection by building on the framework of algorithmic stability, in particular its branch with origins in the field of differential privacy. Stability is achieved via randomization of selection and it serves as a quantitative measure that is sufficient to obtain nontrivial post-selection corrections for classical confidence intervals. Importantly, the underpinnings of algorithmic stability translate directly into computational efficiency—our method computes simple corrections for selective inference without recourse to Markov chain Monte Carlo sampling.

AoS Other · 发表于 2023-08-01

Order-of-addition orthogonal arrays to study the effect of treatment ordering

Eric D. Schoen, Robert W. Mee

摘要

The effect of the order in which a set of m treatments is applied can be modeled by relative-position factors that indicate whether treatment i is carried out before or after treatment j, or by the absolute position for treatment i in the sequence. A design with the same normalized information matrix as the design with all m! sequences is D- and G-optimal for the main-effects model involving the relative-position factors. We prove that such designs are also I-optimal for this model and D-optimal as well as G- and I-optimal for the first-order model in the absolute-position factors. We propose a methodology for a complete or partial enumeration of nonequivalent designs that are optimal for both models.

AoS Spatial & Time Series · 发表于 2023-08-01

Optimal change-point detection and localization

Nicolas Verzelen, Magalie Fromont, Matthieu Lerasle, Patricia Reynaud-Bouret

摘要

Given a times series Y in Rn, with a piecewise constant mean and independent components, the twin problems of change-point detection and change-point localization, respectively amount to detecting the existence of times where the mean varies and estimating the positions of those change-points. In this work, we tightly characterize optimal rates for both problems and uncover the phase transition phenomenon from a global testing problem to a local estimation problem. Introducing a suitable definition of the energy of a change-point, we first establish in the single change-point setting that the optimal detection threshold is 2loglog(n). When the energy is just above the detection threshold, then the problem of localizing the change-point becomes purely parametric: it only depends on the difference in means and not on the position of the change-point anymore. Interestingly, for most change-point positions, including all those away from the endpoints of the time series, it is possible to detect and localize them at a much smaller energy level. In the multiple change-point setting, we establish the energy detection threshold and show similarly that the optimal localization error of a specific change-point becomes purely parametric. Along the way, tight minimax rates for Hausdorff and l 1 estimation losses of the vector of all change-points positions are also established. Two procedures achieving these optimal rates are introduced. The first one is a least-squares estimator with a new multiscale penalty that favours well spread change-points. The second one is a two-step multiscale post-processing procedure whose computational complexity can be as low as O(nlog(n)). Notably, these two procedures accommodate with the presence of possibly many low-energy and therefore undetectable change-points and are still able to detect and localize high-energy change-points even with the presence of those nuisance parameters.

AoS Econometrics & Economics · 发表于 2023-08-01

On lower bounds for the bias-variance trade-off

Alexis Derumigny, Johannes Schmidt-Hieber

摘要

It is a common phenomenon that for high-dimensional and nonparametric statistical models, rate-optimal estimators balance squared bias and variance. Although this balancing is widely observed, little is known whether methods exist that could avoid the trade-off between bias and variance. We propose a general strategy to obtain lower bounds on the variance of any estimator with bias smaller than a prespecified bound. This shows to which extent the bias-variance trade-off is unavoidable and allows to quantify the loss of performance for methods that do not obey it. The approach is based on a number of abstract lower bounds for the variance involving the change of expectation with respect to different probability measures as well as information measures such as the Kullback–Leibler or χ2-divergence. Some of these inequalities rely on a new concept of information matrices. In a second part of the article, the abstract lower bounds are applied to several statistical models including the Gaussian white noise model, a boundary estimation problem, the Gaussian sequence model and the high-dimensional linear regression model. For these specific statistical applications, different types of bias-variance trade-offs occur that vary considerably in their strength. For the trade-off between integrated squared bias and integrated variance in the Gaussian white noise model, we propose to combine the general strategy for lower bounds with a reduction technique. This allows us to reduce the original problem to a lower bound on the bias-variance trade-off for estimators with additional symmetry properties in a simpler statistical model. In the Gaussian sequence model, different phase transitions of the bias-variance trade-off occur. Although there is a non-trivial interplay between bias and variance, the rate of the squared bias and the variance do not have to be balanced in order to achieve the minimax estimation rate.

AoS Causal Inference Optimization & Learning Theory · 发表于 2023-08-01

Off-policy evaluation in partially observed Markov decision processes under sequential ignorability

Yuchen Hu, Stefan Wager

摘要

We consider off-policy evaluation of dynamic treatment rules under sequential ignorability, given an assumption that the underlying system can be modeled as a partially observed Markov decision process (POMDP). We propose an estimator, partial history importance weighting, and show that it can consistently estimate the stationary mean rewards of a target policy, given long enough draws from the behavior policy. We provide an upper bound on its error that decays polynomially in the number of observations (i.e., the number of trajectories times their length) with an exponent that depends on the overlap of the target and behavior policies as well as the mixing time of the underlying system. Furthermore, we show that this rate of convergence is minimax, given only our assumptions on mixing and overlap. Our results establish that off-policy evaluation in POMDPs is strictly harder than off-policy evaluation in (fully observed) Markov decision processes but strictly easier than model-free off-policy evaluation.

AoS High-Dimensional · 发表于 2023-08-01

Noisy linear inverse problems under convex constraints: Exact risk asymptotics in high dimensions

Qiyang Han

摘要

In the standard Gaussian linear measurement model Y=Xμ0+ξ∈Rm with a fixed noise level σ>0, we consider the problem of estimating the unknown signal μ0 under a convex constraint μ0∈K, where K is a closed convex set in Rn. We show that the risk of the natural convex constrained least squares estimator (LSE) μˆ(σ) can be characterized exactly in high-dimensional limits, by that of the convex constrained LSE μˆKseq in the corresponding Gaussian sequence model at a different noise level. Formally, we show that ‖μˆ(σ)−μ0‖2/(nrn2)→1in probability, where rn 2>0 solves the fixed-point equation E‖μˆKseq( (rn2+σ2)/(m/n))−μ0‖2=nrn2. This characterization holds (uniformly) for risks rn2 in the maximal regime that ranges from constant order all the way down to essentially the parametric rate, as long as certain necessary nondegeneracy condition is satisfied for μˆ(σ). The precise risk characterization reveals a fundamental difference between noiseless (or low noise limit) and noisy linear inverse problems in terms of the sample complexity for signal recovery. A concrete example is given by the isotonic regression problem: While exact recovery of a general monotone signal requires m≫n1/3 samples in the noiseless setting, consistent signal recovery in the noisy setting requires as few as m≫logn samples. Such a discrepancy occurs when the low and high noise risk behavior of μˆKseq differ significantly. In statistical languages, this occurs when μˆKseq estimates 0 at a faster “adaptation rate” than the slower “worst-case rate” for general signals. Several other examples, including nonnegative least squares and generalized Lasso (in constrained forms), are also worked out to demonstrate the concrete applicability of the theory in problems of different types. The proof relies on a collection of new analytic and probabilistic results concerning estimation error, log likelihood ratio test statistics and degree-of-freedom associated with μˆKseq, regarded as stochastic processes indexed by the noise level. These results are of independent interest in and of themselves.

AoS Networks & Graphs · 发表于 2023-08-01

Matching recovery threshold for correlated random graphs

Jian Ding, Hang Du

摘要

For two correlated graphs which are independently sub-sampled from a common Erdős–Rényi graph G(n,p), we wish to recover their latent vertex matching from the observation of these two graphs without labels. When p=n−α+o(1) for α∈(0,1], we establish a sharp information-theoretic threshold for whether it is possible to correctly match a positive fraction of vertices. Our result sharpens a constant factor in a recent work by Wu, Xu and Yu.

AoS High-Dimensional Nonparametric & Semiparametric · 发表于 2023-08-01

Learning low-dimensional nonlinear structures from high-dimensional noisy data: An integral operator approach

Xiucai Ding, Rong Ma

摘要

We propose a kernel-spectral embedding algorithm for learning low-dimensional nonlinear structures from noisy and high-dimensional observations, where the data sets are assumed to be sampled from a nonlinear manifold model and corrupted by high-dimensional noise. The algorithm employs an adaptive bandwidth selection procedure which does not rely on prior knowledge of the underlying manifold. The obtained low-dimensional embeddings can be further utilized for downstream purposes such as data visualization, clustering and prediction. Our method is theoretically justified and practically interpretable. Specifically, for a general class of kernel functions, we establish the convergence of the final embeddings to their noiseless counterparts when the dimension grows polynomially with the size, and characterize the effect of the signal-to-noise ratio on the rate of convergence and phase transition. We also prove the convergence of the embeddings to the eigenfunctions of an integral operator defined by the kernel map of some reproducing kernel Hilbert space capturing the underlying nonlinear structures. Our results hold even when the dimension of the manifold grows with the sample size. Numerical simulations and analysis of real data sets show the superior empirical performance of the proposed method, compared to many existing methods, on learning various nonlinear manifolds in diverse applications.

AoS Spatial & Time Series Networks & Graphs · 发表于 2023-08-01

Graphical models for nonstationary time series

Sumanta Basu, Suhasini Subba Rao

摘要

We propose NonStGM, a general nonparametric graphical modeling framework, for studying dynamic associations among the components of a nonstationary multivariate time series. It builds on the framework of Gaussian graphical models (GGM) and stationary time series graphical models (StGM) and complements existing works on parametric graphical models based on change point vector autoregressions (VAR). Analogous to StGM, the proposed framework captures conditional noncorrelations (both intertemporal and contemporaneous) in the form of an undirected graph. In addition, to describe the more nuanced nonstationary relationships among the components of the time series, we introduce the new notion of conditional nonstationarity/stationarity and incorporate it within the graph. This can be used to search for small subnetworks that serve as the “source” of nonstationarity in a large system. We explicitly connect conditional noncorrelation and stationarity between and within components of the multivariate time series to zero and Toeplitz embeddings of an infinite-dimensional inverse covariance operator. In the Fourier domain, conditional stationarity and noncorrelation relationships in the inverse covariance operator are encoded with a specific sparsity structure of its integral kernel operator. We show that these sparsity patterns can be recovered from finite-length time series by nodewise regression of discrete Fourier transforms (DFT) across different Fourier frequencies. We demonstrate the feasibility of learning NonStGM structure from data using simulation studies.

AoS High-Dimensional · 发表于 2023-08-01

Bridging factor and sparse models

Jianqing Fan, Ricardo P. Masini, Marcelo C. Medeiros

摘要

Factor and sparse models are widely used to impose a low-dimensional structure in high-dimensions. However, they are seemingly mutually exclusive. We propose a lifting method that combines the merits of these two models in a supervised learning methodology that allows for efficiently exploring all the information in high-dimensional datasets. The method is based on a flexible model for high-dimensional panel data with observable and/or latent common factors and idiosyncratic components. The model is called the factor-augmented regression model. It includes principal components and sparse regression as specific models, significantly weakens the cross-sectional dependence, and facilitates model selection and interpretability. The method consists of several steps and a novel test for (partial) covariance structure in high dimensions to infer the remaining cross-section dependence at each step. We develop the theory for the model and demonstrate the validity of the multiplier bootstrap for testing a high-dimensional (partial) covariance structure. A simulation study and applications support the theory.

AoS Testing & Uncertainty · 发表于 2023-08-01

Bootstrapping persistent Betti numbers and other stabilizing statistics

Benjamin Roycraft, Johannes Krebs, Wolfgang Polonik

摘要

We investigate multivariate bootstrap procedures for general stabilizing statistics, with specific application to topological data analysis. The work relates to other general results in the area of stabilizing statistics, including central limit theorems for geometric and topological functionals of Poisson and binomial processes in the critical regime, where limit theorems prove difficult to use in practice, motivating the use of a bootstrap approach. A smoothed bootstrap procedure is shown to give consistent estimation in these settings. Specific statistics considered include the persistent Betti numbers of Čech and Vietoris–Rips complexes over point sets in Rd, along with Euler characteristics, and the total edge length of the k-nearest neighbor graph. Special emphasis is given to weakening the necessary conditions needed to establish bootstrap consistency. In particular, the assumption of a continuous underlying density is not required. Numerical studies illustrate the performance of the proposed method.

AoS Nonparametric & Semiparametric · 发表于 2023-08-01

A cross-validation framework for signal denoising with applications to trend filtering, dyadic CART and beyond

Anamitra Chaudhuri, Sabyasachi Chatterjee

摘要

This paper formulates a general cross-validation framework for signal denoising. The general framework is then applied to nonparametric regression methods such as trend filtering and dyadic CART. The resulting cross-validated versions are then shown to attain nearly the same rates of convergence as are known for the optimally tuned analogues. There did not exist any previous theoretical analyses of cross-validated versions of trend filtering or dyadic CART. To illustrate the generality of the framework, we also propose and study cross-validated versions of two fundamental estimators; lasso for high-dimensional linear regression and singular value thresholding for matrix estimation. Our general framework is inspired by the ideas in Chatterjee and Jafarov (2015) and is potentially applicable to a wide range of estimation methods which use tuning parameters.

SMMR Genetics & Omics Diagnostics & Prediction Meta-Analysis & Data Integration · 发表于 2023-07-31

Statistical assessment of biomarker replicability using MAJAR method

Yuhan Xie, Song Zhai, Wei Jiang, Hongyu Zhao, Devan V Mehrotra, Judong Shen

摘要

In the era of precision medicine, many biomarkers have been discovered to be associated with drug efficacy and safety responses, which can be used for patient stratification and drug response prediction. Due to the small sample size and limited power of randomized clinical studies, meta-analysis is usually conducted to aggregate all available studies to maximize the power for identifying prognostic and predictive biomarkers. However, it is often challenging to find an independent study to replicate the discoveries from the meta-analysis (e.g. meta-analysis of pharmacogenomics genome-wide association studies (PGx GWAS)), which seriously limits the potential impacts of the discovered biomarkers. To overcome this challenge, we develop a novel statistical framework, MAJAR (meta-analysis of joint effect associations for biomarker replicability assessment), to jointly test prognostic and predictive effects and assess the replicability of identified biomarkers by implementing an enhanced expectation–maximization algorithm and calculating their posterior-probability-of-replicabilities and Bayesian false discovery rates (Fdr). Extensive simulation studies were conducted to compare the performance of MAJAR and existing methods in terms of Fdr, power, and computational efficiency. The simulation results showed improved statistical power with well-controlled Fdr of MAJAR over existing methods and robustness to outliers under different data generation processes. We further demonstrated the advantages of MAJAR over existing methods by applying MAJAR to the PGx GWAS summary statistics data from a large cardiovascular randomized clinical trial. Compared to testing main effects only, MAJAR identified 12 novel variants associated with the treatment-related low-density lipoprotein cholesterol reduction from baseline.

SMMR Bayesian Methods Testing & Uncertainty · 发表于 2023-07-31

Reducing the false discovery rate of preclinical animal research with Bayesian statistical decision criteria

Riko Kelter

摘要

The success of preclinical research hinges on exploratory and confirmatory animal studies. Traditional null hypothesis significance testing is a common approach to eliminate the chaff from a collection of drugs, so that only the most promising treatments are funneled through to clinical research phases. Balancing the number of false discoveries and false omissions is an important aspect to consider during this process. In this paper, we compare several preclinical research pipelines, either based on null hypothesis significance testing or based on Bayesian statistical decision criteria. We build on a recently published large-scale meta-analysis of reported effect sizes in preclinical animal research and elicit a non-informative prior distribution under which both approaches are compared. After correcting for publication bias and shrinkage of effect sizes in replication studies, simulations show that (i) a shift towards statistical approaches which explicitly incorporate the minimum clinically important difference reduces the false discovery rate of frequentist approaches and (ii) a shift towards Bayesian statistical decision criteria can improve the reliability of preclinical animal research by reducing the number of false-positive findings. It is shown that these benefits hold while keeping the number of experimental units low which are required for a confirmatory follow-up study. Results show that Bayesian statistical decision criteria can help in improving the reliability of preclinical animal research and should be considered more frequently in practice.

SMMR Missing Data & Measurement Error · 发表于 2023-07-31

Multiple imputation approaches for epoch-level accelerometer data in trials

Mia S Tackney, Elizabeth Williamson, Derek G Cook, Elizabeth Limb, Tess Harris, James Carpenter

摘要

Clinical trials that investigate physical activity interventions often use accelerometers to measure step count at a very granular level, for example in 5-second epochs. Participants typically wear the accelerometer for a week-long period at baseline, and for one or more week-long follow-up periods after the intervention. The data is aggregated to provide daily or weekly step counts for the primary analysis. Missing data are common as participants may not wear the device as per protocol. Approaches to handling missing data in the literature have defined missingness on the day level using a threshold on daily weartime, which leads to loss of information on the time of day when data are missing. We propose an approach to identifying and classifying missingness at the finer epoch-level and present two approaches to handling missingness using multiple imputation. Firstly, we present a parametric approach which accounts for the number of missing epochs per day. Secondly, we describe a non-parametric approach where missing periods during the day are replaced by donor data from the same person where possible, or data from a different person who is matched on demographic and physical activity-related variables. Our simulation studies show that the non-parametric approach leads to estimates of the effect of treatment that are least biased while maintaining small standard errors. We illustrate the application of these different multiple imputation strategies to the analysis of the 2017 PACE-UP trial. The proposed framework is likely to be applicable to other digital health outcomes and to other wearable devices.

SiM Missing Data & Measurement Error · 发表于 2023-07-31

Accounting for nonmonotone missing data using inverse probability weighting

Rachael K. Ross, Stephen R. Cole, Jessie K. Edwards, Daniel Westreich, Julie L. Daniels, Jeffrey S.A. Stringer

摘要

Inverse probability weighting can be used to correct for missing data. New estimators for the weights in the nonmonotone setting were introduced in 2018. These estimators are the unconstrained maximum likelihood estimator (UMLE) and the constrained Bayesian estimator (CBE), an alternative if UMLE fails to converge. In this work we describe and illustrate these estimators, and examine performance in simulation and in an applied example estimating the effect of anemia on spontaneous preterm birth in the Zambia Preterm Birth Prevention Study. We compare performance with multiple imputation (MI) and focus on the setting of an observational study where inverse probability of treatment weights are used to address confounding. In simulation, weighting was less statistically efficient at the smallest sample size and lowest exposure prevalence examined (n = 1500, 15% respectively) but in other scenarios statistical performance of weighting and MI was similar. Weighting had improved computational efficiency taking, on average, 0.4 and 0.05 times the time for MI in R and SAS, respectively. UMLE was easy to implement in commonly used software and convergence failure occurred just twice in >200 000 simulated cohorts making implementation of CBE unnecessary. In conclusion, weighting is an alternative to MI for nonmonotone missingness, though MI performed as well as or better in terms of bias and statistical efficiency. Weighting's superior computational efficiency may be preferred with large sample sizes or when using resampling algorithms. As validity of weighting and MI rely on correct specification of different models, both approaches could be implemented to check agreement of results.

SMMR Clinical Trials Testing & Uncertainty · 发表于 2023-07-28

Simultaneous confidence intervals for an extended Koch-Röhmel design in three-arm non-inferiority trials

Martin Scharpenberg, Werner Brannath

摘要

Three-arm ‘gold-standard’ non-inferiority trials are recommended for indications where only unstable reference treatments are available and the use of a placebo group can be justified ethically. For such trials, several study designs have been suggested that use the placebo group for testing ’assay sensitivity’, that is, the ability of the trial to replicate efficacy. Should the reference fail in the given trial, then non-inferiority could also be shown with an ineffective experimental treatment and hence becomes useless. In this article, we extend the so-called Koch-Röhmel design where a proof of efficacy for the experimental treatment is required in order to qualify for the non-inferiority test. While the efficacy of the experimental treatment is an indication of assay sensitivity, it does not guarantee that the reference is sufficiently efficient to let the non-inferiority claim be meaningful. It has, therefore, been suggested to adaptively test the non-inferiority only if the reference demonstrates superiority to placebo and otherwise to test [Formula: see text]-superiority of the experimental treatment over placebo, where [Formula: see text] is chosen in such a way that it provides proof of non-inferiority with regard to the reference’s historical effect. In this article, we extend the previous work by complementing its adaptive test with compatible simultaneous confidence intervals. Confidence intervals are commonly used and suggested by regulatory guidelines for non-inferiority trials. We show how to adopt different approaches to simultaneous confidence intervals from the literature to the setting of three-arm non-inferiority trials and compare these methods in a simulation study. Finally, we apply these methods to a real clinical trial example.

SiM Survival Analysis · 发表于 2023-07-28

On the integration of decision trees with mixture cure model

Wisdom Aselisewine, Suvra Pal

摘要

The mixture cure model is widely used to analyze survival data in the presence of a cured subgroup. Standard logistic regression‐based approaches to model the incidence may lead to poor predictive accuracy of cure, specifically when the covariate effect is non‐linear. Supervised machine learning techniques can be used as a better classifier than the logistic regression due to their ability to capture non‐linear patterns in the data. However, the problem of interpret‐ability hangs in the balance due to the trade‐off between interpret‐ability and predictive accuracy. We propose a new mixture cure model where the incidence part is modeled using a decision tree‐based classifier and the proportional hazards structure for the latency part is preserved. The proposed model is very easy to interpret, closely mimics the human decision‐making process, and provides flexibility to gauge both linear and non‐linear covariate effects. For the estimation of model parameters, we develop an expectation maximization algorithm. A detailed simulation study shows that the proposed model outperforms the logistic regression‐based and spline regression‐based mixture cure models, both in terms of model fitting and evaluating predictive accuracy. An illustrative example with data from a leukemia study is presented to further support our conclusion.

JRSSB Bayesian Methods Spatial & Time Series High-Dimensional · 发表于 2023-07-28

Bayesian inference with thel1-ball prior: solving combinatorial problems with exact zeros

Maoran Xu, Leo L Duan

摘要

The l1-regularisation is very popular in high-dimensional statistics—it changes a combinatorial problem of choosing which subset of the parameter is zero, into a simple continuous optimisation. Using a continuous prior concentrated near zero, the Bayesian counterparts are successful in quantifying the uncertainty in the variable selection problems; nevertheless, the lack of exact zeros makes it difficult for broader problems such as change-point detection and rank selection. Inspired by the duality of the l1-regularisation as a constraint onto an l1-ball, we propose a new prior by projecting a continuous distribution onto the l1-ball. This creates a positive probability on the ball boundary, which contains both continuous elements and exact zeros. Unlike the spike-and-slab prior, this l1-ball projection is continuous and differentiable almost surely, making the posterior estimation amenable to the Hamiltonian Monte Carlo algorithm. We examine the properties, such as the volume change due to the projection, the connection to the combinatorial prior, the minimax concentration rate in the linear problem. We demonstrate the usefulness of exact zeros that simplify the combinatorial problems, such as the change-point detection in time series, the dimension selection of mixture models, and the low-rank plus-sparse change detection in medical images.

SiM Causal Inference · 发表于 2023-07-27

Sensitivity analysis of G‐estimators to invalid instrumental variables

Valentin Vancak, Arvid Sjölander

摘要

Instrumental variables regression is a tool that is commonly used in the analysis of observational data. The instrumental variables are used to make causal inference about the effect of a certain exposure in the presence of unmeasured confounders. A valid instrumental variable is a variable that is associated with the exposure, affects the outcome only through the exposure (exclusion), and is not confounded with the outcome (exogeneity). Unlike the first assumption, the other two are generally untestable and rely on subject‐matter knowledge. Therefore, a sensitivity analysis is desirable to assess the impact of assumptions' violation on the estimated parameters. In this paper, we propose and demonstrate a new method of sensitivity analysis for G‐estimators in causal linear and non‐linear models. We introduce two novel aspects of sensitivity analysis in instrumental variables studies. The first is a single sensitivity parameter that captures violations of exclusion and exogeneity assumptions. The second is an application of the method to non‐linear models. The introduced framework is theoretically justified and is illustrated via a simulation study. Finally, we illustrate the method by application to real‐world data and provide guidelines on conducting sensitivity analysis.

Biometrika Optimization & Learning Theory High-Dimensional · 发表于 2023-07-27

Online inference with debiased stochastic gradient descent

Ruijian Han, Lan Luo, Yuanyuan Lin, Jian Huang

摘要

Summary: We propose a debiased stochastic gradient descent algorithm for online statistical inference with high-dimensional data. Our approach combines the debiasing technique developed in high-dimensional statistics with the stochastic gradient descent algorithm. It can be used to construct confidence intervals efficiently in an online fashion. Our proposed algorithm has several appealing aspects: as a one-pass algorithm, it reduces the time complexity; in addition, each update step requires only the current data together with the previous estimate, which reduces the space complexity. We establish the asymptotic normality of the proposed estimator under mild conditions on the sparsity level of the parameter and the data distribution. Numerical experiments demonstrate that the proposed debiased stochastic gradient descent algorithm attains nominal coverage probability. Furthermore, we illustrate our method with analysis of a high-dimensional text dataset.

Biometrics Longitudinal Data Survival Analysis Bayesian Methods · 发表于 2023-07-27

Nonlinear Multilevel Joint Model for Individual Lesion Kinetics and Survival to Characterize Intra-Individual Heterogeneity in Patients with Advanced Cancer

Marion Kerioui, Maxime Beaulieu, Solène Desmée, Julie Bertrand, François Mercier, Jin Y. Jin, René Bruno, Jérémie Guedj

摘要

In advanced cancer patients, tumor burden is calculated using the sum of the longest diameters (SLD) of the target lesions, a measure that lumps all lesions together and ignores intra-patient heterogeneity. Here, we used a rich dataset of 342 metastatic bladder cancer patients treated with a novel immunotherapy agent to develop a Bayesian multilevel joint model that can quantify heterogeneity in lesion dynamics and measure their impact on survival. Using a nonlinear model of tumor growth inhibition, we estimated that dynamics differed greatly among lesions, and inter-lesion variability accounted for 21% and 28% of the total variance in tumor shrinkage and treatment effect duration, respectively. Next, we investigated the impact of individual lesion dynamics on survival. Lesions located in the liver and in the bladder had twice as much impact on the instantaneous risk of death compared to those located in the lung or the lymph nodes. Finally, we evaluated the utility of individual lesion follow-up for dynamic predictions. Consistent with results at the population level, the individual lesion model outperformed a model relying only on SLD, especially at early landmark times and in patients with liver or bladder target lesions. Our results show that an individual lesion model can characterize the heterogeneity in tumor dynamics and its impact on survival in advanced cancer patients.

SiM Missing Data & Measurement Error Causal Inference · 发表于 2023-07-27

Estimation and evaluation of individualized treatment rules following multiple imputation

Jenny Shen, Rebecca A. Hubbard, Kristin A. Linn

摘要

An individualized treatment rule (ITR) is a function that inputs patient‐level information and outputs a recommended treatment. An important focus of precision medicine is to develop optimal ITRs that maximize a population‐level distributional summary. However, guidance for estimating and evaluating optimal ITRs in the presence of missing data is limited. Our work is motivated by the Social Incentives to Encourage Physical Activity and Understand Predictors (STEP UP) study. Participants were randomized to a control or one of three interventions designed to increase physical activity and were given wearable devices to record daily steps as a measure of physical activity. Many participants were missing at least one daily step count during the study period. In the primary analysis of the STEP UP trial, multiple imputation (MI) was used to address missingness in daily step counts. Despite ubiquitous use of MI in practice, it has been given relatively little attention in the context of personalized medicine. We fill this gap by describing two frameworks for estimation and evaluation of an optimal ITR following MI and assessing their performance using simulated data. One framework relies on splitting the data into independent training and testing sets for estimation and evaluation, respectively. The other framework estimates an optimal ITR using the full data and constructs an ‐out‐of‐ bootstrap confidence interval to evaluate its performance. Finally, we provide an illustrative analysis to estimate and evaluate an optimal ITR from the STEP UP data with a focus on practical considerations such as choosing the number of imputations.

Biometrika Other · 发表于 2023-07-27

Covariate-adjusted log-rank test: guaranteed efficiency gain and universal applicability

Ting Ye, Jun Shao, Yanyao Yi

摘要

Summary: Nonparametric covariate adjustment is considered for log-rank-type tests of the treatment effect with right-censored time-to-event data from clinical trials applying covariate-adaptive randomization. Our proposed covariate-adjusted log-rank test has a simple explicit formula and a guaranteed efficiency gain over the unadjusted test. We also show that our proposed test achieves universal applicability in the sense that the same formula of test can be universally applied to simple randomization and all commonly used covariate-adaptive randomization schemes such as the stratified permuted block and the Pocock–Simon minimization, which is not a property enjoyed by the unadjusted log-rank test. Our method is supported by novel asymptotic theory and empirical results for Type-I error and power of tests.

Biometrika Bayesian Methods Meta-Analysis & Data Integration · 发表于 2023-07-27

A linear adjustment-based approach to posterior drift in transfer learning

Subha Maity, Diptavo Dutta, Jonathan Terhorst, Yuekai Sun, Moulinath Banerjee

摘要

Summary: We present new models and methods for the posterior drift problem where the regression function in the target domain is modelled as a linear adjustment, on an appropriate scale, of that in the source domain, and study the theoretical properties of our proposed estimators in the binary classification problem. The core idea of our model inherits the simplicity and the usefulness of generalized linear models and accelerated failure time models from the classical statistics literature. Our approach is shown to be flexible and applicable in a variety of statistical settings, and can be adopted for transfer learning problems in various domains including epidemiology, genetics and biomedicine. As concrete applications, we illustrate the power of our approach (i) through mortality prediction for British Asians by borrowing strength from similar data from the larger pool of British Caucasians, using the UK Biobank data, and (ii) in overcoming a spurious correlation present in the source domain of the Waterbirds dataset.

JASA Networks & Graphs · 发表于 2023-07-26

Spectral Embedding of Weighted Graphs

Ian Gallagher, Andrew Jones, Anna Bertiger, Carey E. Priebe, Patrick Rubin-Delanchy

摘要

When analyzing weighted networks using spectral embedding, a judicious transformation of the edge weights may produce better results. To formalize this idea, we consider the asymptotic behavior of spectral embedding for different edge-weight representations, under a generic low rank model. We measure the quality of different embeddings — which can be on entirely different scales — by how easy it is to distinguish communities, in an information-theoretic sense. For common types of weighted graphs, such as count networks or p-value networks, we find that transformations such as tempering or thresholding can be highly beneficial, both in theory and in practice. *(abstract via OpenAlex)*

JASA High-Dimensional Latent Variables & Mixtures · 发表于 2023-07-26

Multivariate Sparse Clustering for Extremes

Nicolas Meyer, Olivier Wintenberger

摘要

Identifying directions where extreme events occur is a significant challenge in multivariate extreme value analysis. In this article, we use the concept of sparse regular variation introduced by Meyer and Wintenberger to infer the tail dependence of a random vector X. This approach relies on the Euclidean projection onto the simplex which better exhibits the sparsity structure of the tail of X than the standard methods. Our procedure based on a rigorous methodology aims at capturing clusters of extremal coordinates of X. It also includes the identification of the threshold above which the values taken by X are considered extreme. We provide an efficient and scalable algorithm called MUSCLE and apply it to numerical examples to highlight the relevance of our findings. Finally, we illustrate our approach with financial return data. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

SiM Clinical Trials · 发表于 2023-07-26

Estimation of conditional power in the presence of auxiliary data

Xin Li, Godwin Yung, Jianchang Lin, Jian Zhu

摘要

Conditional power (CP) is a commonly used tool to inform interim decision‐making in clinical trials, but the conventional approach using only primary endpoint data to calculate CP may not perform well when the primary endpoint requires a long follow‐up period, or the treatment effect size changes during the trial. Several methods have been proposed to use additional short term auxiliary data observed at the interim analysis to improve the CP estimation in these situations, however, they may rely on strong assumptions, have limited applications, or use ad hoc choices of information fraction. In this paper we propose a general framework where the true CP formula is first derived in the presence of auxiliary data, and CP estimation is obtained by substituting the unknown parameters with consistent estimators. We conducted extensive simulations to examine the performance of both proposed and conventional approaches using the true CP as the benchmark. As the proposed approach is based on the true underlying CP, the simulations confirmed its superiority over the conventional approach in terms of efficiency and accuracy, especially if observed auxiliary data reflect the change of treatment effect size. The simulations also indicate that the magnitude of improvement in CP estimation is associated with the correlation between auxiliary and primary endpoints and/or the magnitude of the effect size change during the trial.

JASA High-Dimensional Meta-Analysis & Data Integration · 发表于 2023-07-26

DDAC-SpAM: A Distributed Algorithm for Fitting High-dimensional Sparse Additive Models with Feature Division and Decorrelation

Yifan He, Ruiyang Wu, Yong Zhou, Yang Feng

摘要

–Distributed statistical learning has become a popular technique for large-scale data analysis. Most existing work in this area focuses on dividing the observations, but we propose a new algorithm, DDAC-SpAM, which divides the features under a high-dimensional sparse additive model. Our approach involves three steps: divide, decorrelate, and conquer. The decorrelation operation enables each local estimator to recover the sparsity pattern for each additive component without imposing strict constraints on the correlation structure among variables. The effectiveness and efficiency of the proposed algorithm are demonstrated through theoretical analysis and empirical results on both synthetic and real data. The theoretical results include both the consistent sparsity pattern recovery as well as statistical inference for each additive functional component. Our approach provides a practical solution for fitting sparse additive models, with promising applications in a wide range of domains. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Causal Inference Bayesian Methods Nonparametric & Semiparametric · 发表于 2023-07-26

Bayesian Nonparametric Common Atoms Regression for Generating Synthetic Controls in Clinical Trials

Noirrit Kiran Chandra, Abhra Sarkar, John F. de Groot, Ying Yuan, Peter Müller

摘要

The availability of electronic health records (EHR) has opened opportunities to supplement increasingly expensive and difficult to carry out randomized controlled trials (RCT) with evidence from readily available real world data. In this article, we use EHR data to construct synthetic control arms for treatment-only single arm trials. We propose a novel nonparametric Bayesian common atoms mixture model that allows us to find equivalent population strata in the EHR and the treatment arm and then resample the EHR data to create equivalent patient populations under both the single arm trial and the resampled EHR. Resampling is implemented via a density-free importance sampling scheme. Using the synthetic control arm, inference for the treatment effect can then be carried out using any method available for RCTs. Alternatively the proposed nonparametric Bayesian model allows straightforward model-based inference. In simulation experiments, the proposed method exhibits higher power than alternative methods in detecting treatment effects, specifically for nonlinear response functions. We apply the method to supplement single arm treatment-only glioblastoma studies with a synthetic control arm based on historical trials. Supplementary materials for this article are available online. *(abstract via PubMed)*

SMMR Clinical Trials Bayesian Methods Survival Analysis · 发表于 2023-07-25

Using short-term endpoints to improve interim decision making and trial duration in two-stage phase II trials with nested binary endpoints

Dario Zocholl, Cornelia U. Kunz, Geraldine Rauch

摘要

In oncology, phase II clinical trials are often planned as single-arm two-stage designs with a binary endpoint, for example, progression-free survival after 12 months, and the option to stop for futility after the first stage. Simon’s two-stage design is a very popular approach but depending on the follow-up time required to measure the patients’ outcomes the trial may have to be paused undesirably long. To shorten this forced interruption, it was proposed to use a short-term endpoint for the interim decision, such as progression-free survival after 3 months. We show that if the assumptions for the short-term endpoint are misspecified, the decision-making in the interim can be misleading, resulting in a great loss of statistical power. For the setting of a binary endpoint with nested measurements, such as progression-free survival, we propose two approaches that utilize all available short-term and long-term assessments of the endpoint to guide the interim decision. One approach is based on conditional power and the other is based on Bayesian posterior predictive probability of success. In extensive simulations, we show that both methods perform similarly, when appropriately calibrated, and can greatly improve power compared to the existing approach in settings with slow patient recruitment. Software code to implement the methods is made publicly available.

SMMR Diagnostics & Prediction Survival Analysis · 发表于 2023-07-25

Predictive abilities comparison from multiple dynamic prediction models

Clémence Moreau, Jérémie Riou, Marine Roux

摘要

With the development of personalized medicine, the study of individual prognosis appears to be a major contemporary scientific issue. Dynamic models are particularly well adapted to such studies by allowing some potential changes in the follow-up to be taken into account. In particular, this leads to more accurate predictions by updating the available information throughout the patient monitoring. Some mathematical tools have been developed to quantify and compare the effectiveness of dynamic predictions using dynamic versions of the area under the receiver operating characteristic curve and the Brier score in the competing risks setting. Nevertheless, only two predictive abilities can be compared. This may be too restrictive in a clinical context where more and more information can be collected during patient follow-up thanks to recent technological advances. Here we propose a new procedure that allows multiple comparisons of the predictive abilities of different biomarkers, based on the dynamic area under the receiver operating characteristic curve or Brier score. Performances of our testing procedure were assessed by simulations. Moreover, a motivating application in hepatology will be presented. Finally, this work compares more than two dynamic predictive abilities of biomarkers and is available via R functions on GitHub.

SMMR Other · 发表于 2023-07-25

Cure rate models for heterogeneous competing causes

Márcia Brandão, Jeremias Leão, Diego Ignacio Gallardo, Marcelo Bourguignon

摘要

Cure rate models have been widely studied to analyze time-to-event data with a cured fraction of patients. In this type of model, the number of concurrent causes is assumed to be a random variable. However, in practice, it is natural to admit that the distribution of the number of competing causes is different from individual to individual. Our proposal is to assume that the number of competing causes belongs to a class of a finite mixture of competing causes distributions. We assume the number of malignant cells follow a mixture of two power series distributions and suppose that the time to the event of interest follows a Weibull distribution. We consider the proportion of the cured number of competing causes depending on covariates, allowing direct modeling of the cure rate. The proposed model includes several well-known models as special cases and defines many new special models. An expectation-maximization algorithm is proposed for parameter estimation, where the expectation step involves the computation of the expected number of concurrent causes for each individual. A Monte Carlo simulation is performed to assess the behavior of the estimation method. In order to show the potential for the practice of our model, we apply it to the real medical data set from a population-based study of incident cases of cutaneous melanoma diagnosed in the state of São Paulo, Brazil, illustrating that the model proposed can outperform traditional models in terms of model fitting.

SiM Spatial & Time Series Bayesian Methods · 发表于 2023-07-25

A time‐dependent Poisson‐Gamma model for recruitment forecasting in multicenter studies

Armando Turchetta, Nicolas Savy, David A. Stephens, Erica E.M. Moodie, Marina B. Klein

摘要

Forecasting recruitments is a key component of the monitoring phase of multicenter studies. One of the most popular techniques in this field is the Poisson‐Gamma recruitment model, a Bayesian technique built on a doubly stochastic Poisson process. This approach is based on the modeling of enrollments as a Poisson process where the recruitment rates are assumed to be constant over time and to follow a common Gamma prior distribution. However, the constant‐rate assumption is a restrictive limitation that is rarely appropriate for applications in real studies. In this paper, we illustrate a flexible generalization of this methodology which allows the enrollment rates to vary over time by modeling them through B‐splines. We show the suitability of this approach for a wide range of recruitment behaviors in a simulation study and by estimating the recruitment progression of the Canadian Co‐infection Cohort.

SMMR Clinical Trials Longitudinal Data · 发表于 2023-07-25

A flexible micro-randomized trial design and sample size considerations

Jing Xu, Xiaoxi Yan, Caroline Figueroa, Joseph Jay Williams, Bibhas Chakraborty

摘要

Technological advancements have made it possible to deliver mobile health interventions to individuals. A novel framework that has emerged from such advancements is the just-in-time adaptive intervention, which aims to suggest the right support to the individuals when their needs arise. The micro-randomized trial design has been proposed recently to test the proximal effects of the components of these just-in-time adaptive interventions. However, the extant micro-randomized trial framework only considers components with a fixed number of categories added at the beginning of the study. We propose a more flexible micro-randomized trial design which allows addition of more categories to the components during the study. Note that the number and timing of the categories added during the study need to be fixed initially. The proposed design is motivated by collaboration on the Diabetes and Mental Health Adaptive Notification Tracking and Evaluation study, which learns to deliver effective text messages to encourage physical activity among patients with diabetes and depression. We developed a new test statistic and the corresponding sample size calculator for the flexible micro-randomized trial using an approach similar to the generalized estimating equation for longitudinal data. Simulation studies were conducted to evaluate the sample size calculators and an R shiny application for the calculators was developed.

JRSSB Machine Learning Networks & Graphs Spatial & Time Series · 发表于 2023-07-24

Image response regression via deep neural networks

Daiwei Zhang, Lexin Li, Chandra Sripada, Jian Kang

摘要

Delineating associations between images and covariates is a central aim of imaging studies. To tackle this problem, we propose a novel non-parametric approach in the framework of spatially varying coefficient models, where the spatially varying functions are estimated through deep neural networks. Our method incorporates spatial smoothness, handles subject heterogeneity, and provides straightforward interpretations. It is also highly flexible and accurate, making it ideal for capturing complex association patterns. We establish estimation and selection consistency and derive asymptotic error bounds. We demonstrate the method’s advantages through intensive simulations and analyses of two functional magnetic resonance imaging data sets.

Biometrics Missing Data & Measurement Error Survival Analysis Causal Inference · 发表于 2023-07-24

A Self-Censoring Model for Multivariate Nonignorable Nonmonotone Missing Data

Yilin Li, Wang Miao, Ilya Shpitser, Eric J. Tchetgen Tchetgen

摘要

We introduce an itemwise modeling approach called “self-censoring” for multivariate nonignorable nonmonotone missing data, where the missingness process of each outcome can be affected by its own value and associated with missingness indicators of other outcomes, while conditionally independent of the other outcomes. The self-censoring model complements previous graphical approaches for the analysis of multivariate nonignorable missing data. It is identified under a completeness condition stating that any variability in one outcome can be captured by variability in the other outcomes among complete cases. For estimation, we propose a suite of semiparametric estimators including doubly robust estimators that deliver valid inferences under partial misspecification of the full-data distribution. We also provide a novel and flexible global sensitivity analysis procedure anchored at the self-censoring. We evaluate the performance of the proposed methods with simulations and apply them to analyze a study about the effect of highly active antiretroviral therapy on preterm delivery of HIV-positive mothers.

SiM Spatial & Time Series Bayesian Methods · 发表于 2023-07-23

Statistical modeling of diabetic neuropathy: Exploring the dynamics of nerve mortality

Konstantinos Konstantinou, Farnaz Ghorbanpour, Umberto Picchini, Adam Loavenbruck, Aila Särkkä

摘要

Diabetic neuropathy is a disorder characterized by impaired nerve function and reduction of the number of epidermal nerve fibers per epidermal surface. Additionally, as neuropathy related nerve fiber loss and regrowth progresses over time, the two‐dimensional spatial arrangement of the nerves becomes more clustered. These observations suggest that with development of neuropathy, the spatial pattern of diminished skin innervation is defined by a thinning process which remains incompletely characterized. We regard samples obtained from healthy controls and subjects suffering from diabetic neuropathy as realisations of planar point processes consisting of nerve entry points and nerve endings, and propose point process models based on spatial thinning to describe the change as neuropathy advances. Initially, the hypothesis that the nerve removal occurs completely at random is tested using independent random thinning of healthy patterns. Then, a dependent parametric thinning model that favors the removal of isolated nerve trees is proposed. Approximate Bayesian computation is used to infer the distribution of the model parameters, and the goodness‐of‐fit of the models is evaluated using both non‐spatial and spatial summary statistics. Our findings suggest that the nerve mortality process changes as neuropathy advances.

Biometrics Other · 发表于 2023-07-21

Constructing Time-Invariant Dynamic Surveillance Rules for Optimal Monitoring Schedules

Xinyuan Dong, Yingye Zheng, Daniel W. Lin, Lisa Newcomb, Ying-Qi Zhao

摘要

Dynamic surveillance rules (DSRs) are sequential surveillance decision rules informing monitoring schedules in clinical practice, which can adapt over time according to a patient's evolving characteristics. In many clinical applications, it is desirable to identify and implement optimal time-invariant DSRs, where the parameters indexing the decision rules are shared across different decision points. We propose a new criterion for DSRs that accounts for benefit-cost tradeoff during the course of disease surveillance. We develop two methods to estimate the time-invariant DSRs optimizing the proposed criterion, and establish asymptotic properties for the estimated parameters of biomarkers indexing the DSRs. The first approach estimates the optimal decision rules for each individual at every stage via regression modeling, and then estimates the time-invariant DSRs via a classification procedure with the estimated time-varying decision rules as the response. The second approach proceeds by optimizing a relaxation of the empirical objective, where a surrogate function is utilized to facilitate computation. Extensive simulation studies are conducted to demonstrate the superior performances of the proposed methods. The methods are further applied to the Canary Prostate Active Surveillance Study (PASS).

第 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 页