研究园简易版 · 经典书籍 · 期刊文章 · 有原文 · 完整版(可多选筛选、搜索) · 首页
2023 年的期刊文章 · 第 20 页
共 1511 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2023-04-02 到 2023-03-27。
按期刊、按主题看 →
SiM Clinical Trials Testing & Uncertainty · 发表于 2023-04-02
David S. Robertson, James M. S. Wason, Franz König, Martin Posch, Thomas Jaki
摘要
Platform trials evaluate multiple experimental treatments under a single master protocol, where new treatment arms are added to the trial over time. Given the multiple treatment comparisons, there is the potential for inflation of the overall type I error rate, which is complicated by the fact that the hypotheses are tested at different times and are not necessarily pre‐specified. Online error rate control methodology provides a possible solution to the problem of multiplicity for platform trials where a relatively large number of hypotheses are expected to be tested over time. In the online multiple hypothesis testing framework, hypotheses are tested one‐by‐one over time, where at each time‐step an analyst decides whether to reject the current null hypothesis without knowledge of future tests but based solely on past decisions. Methodology has recently been developed for online control of the false discovery rate as well as the familywise error rate (FWER). In this article, we describe how to apply online error rate control to the platform trial setting, present extensive simulation results, and give some recommendations for the use of this new methodology in practice. We show that the algorithms for online error rate control can have a substantially lower FWER than uncorrected testing, while still achieving noticeable gains in power when compared with the use of a Bonferroni correction. We also illustrate how online error rate control would have impacted a currently ongoing platform trial.
AoS High-Dimensional Spatial & Time Series · 发表于 2023-04-01
Di Wang, Ruey S. Tsay
摘要
High-dimensional time series data appear in many scientific areas in the current data-rich environment. Analysis of such data poses new challenges to data analysts because of not only the complicated dynamic dependence between the series, but also the existence of aberrant observations, such as missing values, contaminated observations, and heavy-tailed distributions. For high-dimensional vector autoregressive (VAR) models, we introduce a unified estimation procedure that is robust to model misspecification, heavy-tailed noise contamination, and conditional heteroscedasticity. The proposed methodology enjoys both statistical optimality and computational efficiency, and can handle many popular high-dimensional models, such as sparse, reduced-rank, banded, and network-structured VAR models. With proper regularization and data truncation, the estimation convergence rates are shown to be almost optimal in the minimax sense under a bounded (2+2ϵ)th moment condition. When ϵ≥1, the rates of convergence match those obtained under the sub-Gaussian assumption. Consistency of the proposed estimators is also established for some ϵ∈(0,1), with minimax optimal convergence rates associated with ϵ. The efficacy of the proposed estimation methods is demonstrated by simulation and a U.S. macroeconomic example.
AoS Nonparametric & Semiparametric · 发表于 2023-04-01
Cong Ma, Reese Pathak, Martin J. Wainwright
摘要
We study the covariate shift problem in the context of nonparametric regression over a reproducing kernel Hilbert space (RKHS). We focus on two natural families of covariate shift problems defined using the likelihood ratios between the source and target distributions. When the likelihood ratios are uniformly bounded, we prove that the kernel ridge regression (KRR) estimator with a carefully chosen regularization parameter is minimax rate-optimal (up to a log factor) for a large family of RKHSs with regular kernel eigenvalues. Interestingly, KRR does not require full knowledge of the likelihood ratio apart from an upper bound on it. In striking contrast to the standard statistical setting without covariate shift, we also demonstrate that a naïve estimator, which minimizes the empirical risk over the function class, is strictly suboptimal under covariate shift as compared to KRR. We then address the larger class of covariate shift problems where likelihood ratio is possibly unbounded yet has a finite second moment. Here, we propose a reweighted KRR estimator that weights samples based on a careful truncation of the likelihood ratios. Again, we are able to show that this estimator is minimax optimal, up to logarithmic factors.
AoS Other · 发表于 2023-04-01
Zhongyuan Lyu, Dong Xia
摘要
Structural matrix-variate observations routinely arise in diverse fields such as multilayer network analysis and brain image clustering. While data of this type have been extensively investigated with fruitful outcomes being delivered, the fundamental questions like its statistical optimality and computational limit are largely under-explored. In this paper, we propose a low-rank Gaussian mixture model (LrMM) assuming each matrix-valued observation has a planted low-rank structure. Minimax lower bounds for estimating the underlying low-rank matrix are established allowing a whole range of sample sizes and signal strength. Under a minimal condition on signal strength, referred to as the information-theoretical limit or statistical limit, we prove the minimax optimality of a maximum likelihood estimator which, in general, is computationally infeasible. If the signal is stronger than a certain threshold, called the computational limit, we design a computationally fast estimator based on spectral aggregation and demonstrate its minimax optimality. Moreover, when the signal strength is smaller than the computational limit, we provide evidences based on the low-degree likelihood ratio framework to claim that no polynomial-time algorithm can consistently recover the underlying low-rank matrix. Our results reveal multiple phase transitions in the minimax error rates and the statistical-to-computational gap. Numerical experiments confirm our theoretical findings. We further showcase the merit of our spectral aggregation method on the worldwide food trading dataset.
AoS Spatial & Time Series · 发表于 2023-04-01
Axel Bücher, Leandra Zanger
摘要
Modeling univariate block maxima by the generalized extreme value distribution constitutes one of the most widely applied approaches in extreme value statistics. It has recently been found that, for an underlying stationary time series, respective estimators may be improved by calculating block maxima in an overlapping way. A proof of concept is provided that the latter finding also holds in situations that involve certain piecewise stationarities. A weak convergence result for an empirical process of central interest is provided, and further details are examplarily worked out for the probability weighted moment estimator. Irrespective of the serial dependence, the asymptotic estimation variance is shown to be smaller for the new estimator. In extensive simulation experiments, the finite-sample variance was typically found to be smaller as well, while the bias stays approximately the same. The results are illustrated by Monte Carlo simulation experiments and are applied to a common situation involving temperature extremes in a changing climate.
AoS Other · 发表于 2023-04-01
Tianxing Mei, Chen Wang, Jianfeng Yao
摘要
We analyze the singular values of a large p×n data matrix Xn=(xn1,…,xnn), where the columns {xnj} are independent p-dimensional vectors, possibly with different distributions. Assuming that the covariance matrices Σnj=Cov(xnj) of the column vectors can be asymptotically simultaneously diagonalized, with appropriately converging spectra, we establish a limiting spectral distribution (LSD) for the singular values of Xn when both dimensions p and n grow to infinity in comparable magnitudes. Our matrix model goes beyond and includes many different types of sample covariance matrices in existing work, such as weighted sample covariance matrices, Gram matrices, and sample covariance matrices of a linear time series model. Furthermore, three applications of our general approach are developed. First, we obtain the existence and uniqueness of the LSD for realized covariance matrices of a multi-dimensional diffusion process with anisotropic time-varying co-volatility. Second, we derive the LSD for singular values of data matrices from a recent matrix-valued auto-regressive model. Finally, we also obtain the LSD for singular values of data matrices from a generalized finite mixture model.
AoS Other · 发表于 2023-04-01
Mengchu Li, Thomas B. Berrett, Yi Yu
摘要
It is of soaring demand to develop statistical analysis tools that are robust against contamination as well as preserving individual data owners’ privacy. In spite of the fact that both topics host a rich body of literature, to the best of our knowledge, we are the first to systematically study the connections between the optimality under Huber’s contamination model and the local differential privacy (LDP) constraints. In this paper, we start with a general minimax lower bound result, which disentangles the costs of being robust against Huber contamination and preserving LDP. We further study four concrete examples: a two-point testing problem, a potentially diverging mean estimation problem, a nonparametric density estimation problem and a univariate median estimation problem. For each problem, we demonstrate procedures that are optimal in the presence of both contamination and LDP constraints, comment on the connections with the state-of-the-art methods that are only studied under either contamination or privacy constraints, and unveil the connections between robustness and LDP via partially answering whether LDP procedures are robust and whether robust procedures can be efficiently privatised. Overall, our work showcases a promising prospect of joint study for robustness and local differential privacy.
AoS Other · 发表于 2023-04-01
Alexander Schell, Harald Oberhauser
摘要
We study the classical problem of recovering a multidimensional source signal from observations of nonlinear mixtures of this signal. We show that this recovery is possible (up to a permutation and monotone scaling of the source’s original component signals) if the mixture is due to a sufficiently differentiable and invertible but otherwise arbitrarily nonlinear function and the component signals of the source are statistically independent with ‘nondegenerate’ second-order statistics. The latter assumption requires the source signal to meet one of three regularity conditions which essentially ensure that the source is sufficiently far away from the nonrecoverable extremes of being deterministic or constant in time. These assumptions, which cover many popular time series models and stochastic processes, allow us to reformulate the initial problem of nonlinear blind source separation as a simple-to-state problem of optimisation-based function approximation. We propose to solve this approximation problem by minimizing a novel type of objective function that efficiently quantifies the mutual statistical dependence between multiple stochastic processes via cumulant-like statistics. This yields a scalable and direct new method for nonlinear Independent Component Analysis with widely applicable theoretical guarantees and for which our experiments indicate good performance.
AoS Other · 发表于 2023-04-01
Blair Bilodeau, Dylan J. Foster, Daniel M. Roy
摘要
We consider the task of estimating a conditional density using i.i.d. samples from a joint distribution, which is a fundamental problem with applications in both classification and uncertainty quantification for regression. For joint density estimation, minimax rates have been characterized for general density classes in terms of uniform (metric) entropy, a well-studied notion of statistical capacity. When applying these results to conditional density estimation, the use of uniform entropy—which is infinite when the covariate space is unbounded and suffers from the curse of dimensionality—can lead to suboptimal rates. Consequently, minimax rates for conditional density estimation cannot be characterized using these classical results. We resolve this problem for well-specified models, obtaining matching (within logarithmic factors) upper and lower bounds on the minimax Kullback–Leibler risk in terms of the empirical Hellinger entropy for the conditional density class. The use of empirical entropy allows us to appeal to concentration arguments based on local Rademacher complexity, which—in contrast to uniform entropy—leads to matching rates for large, potentially nonparametric classes and captures the correct dependence on the complexity of the covariate space. Our results require only that the conditional densities are bounded above, and do not require that they are bounded below or otherwise satisfy any tail conditions.
AoS Bayesian Methods · 发表于 2023-04-01
Michael Celentano, Zhou Fan, Song Mei
摘要
We study mean-field variational Bayesian inference using the TAP approach, for Z2-synchronization as a prototypical example of a high-dimensional Bayesian model. We show that for any signal strength λ>1 (the weak-recovery threshold), there exists a unique local minimizer of the TAP free energy functional near the mean of the Bayes posterior law. Furthermore, the TAP free energy in a local neighborhood of this minimizer is strongly convex. Consequently, a natural-gradient/mirror-descent algorithm achieves linear convergence to this minimizer from a local initialization, which may be obtained by a constant number of iterations of Approximate Message Passing (AMP). This provides a rigorous foundation for variational inference in high dimensions via minimization of the TAP free energy. We also analyze the finite-sample convergence of AMP, showing that AMP is asymptotically stable at the TAP minimizer for any λ>1, and is linearly convergent to this minimizer from a spectral initialization for sufficiently large λ. Such a guarantee is stronger than results obtainable by state evolution analyses, which only describe a fixed number of AMP iterations in the infinite-sample limit. Our proofs combine the Kac–Rice formula and Sudakov–Fernique Gaussian comparison inequality to analyze the complexity of critical points that satisfy strong convexity and stability conditions within their local neighborhoods.
AoS Networks & Graphs High-Dimensional · 发表于 2023-04-01
Emmanuel Abbe, Shuangping Li, Allan Sly
摘要
The problem of learning graphons has attracted considerable attention across several scientific communities, with significant progress over the recent years in sparser regimes. Yet, the current techniques still require diverging degrees in order to succeed with efficient algorithms in the challenging cases where the local structure of the graph is homogeneous. This paper provides an efficient algorithm to learn graphons in the constant expected degree regime. The algorithm is shown to succeed in estimating the rank-k projection of a graphon in the L2 metric if the top k eigenvalues of the graphon satisfy a generalized Kesten–Stigum condition.
AoS Other · 发表于 2023-04-01
Cristina Butucea, Angelika Rohde, Lukas Steinberger
摘要
Local differential privacy has recently received increasing attention from the statistics community as a valuable tool to protect the privacy of individual data owners without the need of a trusted third party. Similar to the classical notion of randomized response, the idea is that data owners randomize their true information locally and only release the perturbed data. Many different protocols for such local perturbation procedures can be designed. In most estimation problems studied in the literature so far, however, no significant difference in terms of minimax risk between purely noninteractive protocols and protocols that allow for some amount of interaction between individual data providers could be observed. In this paper, we show that for estimating the integrated square of a density, sequentially interactive procedures improve substantially over the best possible noninteractive procedure in terms of minimax rate of estimation. In particular, in the noninteractive scenario we identify an elbow in the minimax rate at s=34, whereas in the sequentially interactive scenario the elbow is at s=12. This is markedly different from both, the case of direct observations, where the elbow is well known to be at s=14, as well as from the case where Laplace noise is added to the original data, where an elbow at s=94 is obtained. We also provide adaptive estimators that achieve the optimal rate up to log-factors, we draw connections to nonparametric goodness-of-fit testing and estimation of more general integral functionals and conduct a series of numerical experiments. The fact that a particular locally differentially private, but interactive, mechanism improves over the simple noninteractive one is also of great importance for practical implementations of local differential privacy.
AoS Other · 发表于 2023-04-01
Markus Reiss, Lars Winkelmann
摘要
We study the rank of the instantaneous or spot covariance matrix ΣX(t) of a multidimensional process X(t). Given high-frequency observations X(i/n), i=0,…,n, we test the null hypothesis rank(ΣX(t))≤r for all t against local alternatives where the average (r+1)st eigenvalue is larger than some signal detection rate vn. A major problem is that the inherent averaging in local covariance statistics produces a bias that distorts the rank statistics. We show that the bias depends on the regularity and spectral gap of ΣX(t). We establish explicit matrix perturbation and concentration results that provide nonasymptotic uniform critical values and optimal signal detection rates vn. This leads to a rank estimation method via sequential testing. For a class of stochastic volatility models, we determine data-driven critical values via normed p-variations of estimated local covariance matrices. The methods are illustrated by simulations and an application to high-frequency data of U.S. government bonds.
AoS Other · 发表于 2023-04-01
Thomas B. Berrett, Richard J. Samworth
摘要
We consider the estimation of two-sample integral functionals, of the type that occur naturally, for example, when the object of interest is a divergence between unknown probability densities. Our first main result is that, in wide generality, a weighted nearest neighbour estimator is efficient, in the sense of achieving the local asymptotic minimax lower bound. Moreover, we also prove a corresponding central limit theorem, which facilitates the construction of asymptotically valid confidence intervals for the functional, having asymptotically minimal width. One interesting consequence of our results is the discovery that, for certain functionals, the worst-case performance of our estimator may improve on that of the natural ‘oracle’ estimator, which itself can be optimal in the related problem where the data consist of the values of the unknown densities at the observations.
AoS Nonparametric & Semiparametric Machine Learning Networks & Graphs · 发表于 2023-04-01
Yuling Jiao, Guohao Shen, Yuanyuan Lin, Jian Huang
摘要
We study the properties of nonparametric least squares regression using deep neural networks. We derive nonasymptotic upper bounds for the excess risk of the empirical risk minimizer of feedforward deep neural regression. Our error bounds achieve minimax optimal rate and improve over the existing ones in the sense that they depend polynomially on the dimension of the predictor, instead of exponentially on dimension. We show that the neural regression estimator can circumvent the curse of dimensionality under the assumption that the predictor is supported on an approximate low-dimensional manifold or a set with low Minkowski dimension. We also establish the optimal convergence rate under the exact manifold support assumption. We investigate how the prediction error of the neural regression estimator depends on the structure of neural networks and propose a notion of network relative efficiency between two types of neural networks, which provides a quantitative measure for evaluating the relative merits of different network structures. To establish these results, we derive a novel approximation error bound for the Hölder smooth functions using ReLU activated neural networks, which may be of independent interest. Our results are derived under weaker assumptions on the data distribution and the neural network structure than those in the existing literature.
AoS Other · 发表于 2023-04-01
Pierre C. Bellec, Cun-Hui Zhang
摘要
New upper bounds are developed for the L2 distance between ξ/Var[ξ]1/2 and linear and quadratic functions of z∼N(0,In) for random variables of the form ξ=z⊤f(z)−divf(z). The linear approximation yields a central limit theorem when the squared norm of f(z) dominates the squared Frobenius norm of ∇f(z) in expectation. Applications of this normal approximation are given for the asymptotic normality of debiased estimators in linear regression with correlated design and convex penalty in the regime p/n≤γ for constant γ∈(0,∞). For the estimation of linear functions ⟨a0,β⟩ of the unknown coefficient vector β, this analysis leads to asymptotic normality of the debiased estimate for most normalized directions a0, where “most” is quantified in a precise sense. This asymptotic normality holds for any convex penalty if γn, asymptotic normality of the debiased estimate is obtained for the Lasso and the group Lasso under additional conditions. For general convex penalties, our analysis also provides prediction and estimation error bounds of independent interest.
AoS Testing & Uncertainty · 发表于 2023-04-01
Rina Foygel Barber, Emmanuel J. Candès, Aaditya Ramdas, Ryan J. Tibshirani
摘要
Conformal prediction is a popular, modern technique for providing valid predictive inference for arbitrary machine learning models. Its validity relies on the assumptions of exchangeability of the data, and symmetry of the given model fitting algorithm as a function of the data. However, exchangeability is often violated when predictive models are deployed in practice. For example, if the data distribution drifts over time, then the data points are no longer exchangeable; moreover, in such settings, we might want to use a nonsymmetric algorithm that treats recent observations as more relevant. This paper generalizes conformal prediction to deal with both aspects: we employ weighted quantiles to introduce robustness against distribution drift, and design a new randomization technique to allow for algorithms that do not treat data points symmetrically. Our new methods are provably robust, with substantially less loss of coverage when exchangeability is violated due to distribution drift or other challenging features of real data, while also achieving the same coverage guarantees as existing conformal prediction methods if the data points are in fact exchangeable. We demonstrate the practical utility of these new tools with simulations and real-data experiments on electricity and election forecasting.
AoS Bayesian Methods High-Dimensional · 发表于 2023-04-01
Axel Finke, Alexandre H. Thiery
摘要
The iterated conditional sequential Monte Carlo (i-CSMC) algorithm from Andrieu, Doucet and Holenstein (J. R. Stat. Soc. Ser. B Stat. Methodol. 72 (2010) 269–342) is an MCMC approach for efficiently sampling from the joint posterior distribution of the T latent states in challenging time-series models, for example, in nonlinear or non-Gaussian state-space models. It is also the main ingredient in particle Gibbs samplers which infer unknown model parameters alongside the latent states. In this work, we first prove that the i-CSMC algorithm suffers from a curse of dimension in the dimension of the states, D: it breaks down unless the number of samples (‘particles’), N, proposed by the algorithm grows exponentially with D. Then we present a novel ‘local’ version of the algorithm which proposes particles using Gaussian random-walk moves that are suitably scaled with D. We prove that this iterated random-walk conditional sequential Monte Carlo (i-RW-CSMC) algorithm avoids the curse of dimension: for arbitrary N, its acceptance rates and expected squared jumping distance converge to nontrivial limits as D→∞. If T=N=1, our proposed algorithm reduces to a Metropolis–Hastings or Barker’s algorithm with Gaussian random-walk moves and we recover the well-known scaling limits for such algorithms.
AoS Testing & Uncertainty · 发表于 2023-04-01
Jordan Awan, Salil Vadhan
摘要
f-DP has recently been proposed as a generalization of differential privacy allowing a lossless analysis of composition, post-processing, and privacy amplification via subsampling. In the setting of f-DP, we propose the concept of a canonical noise distribution (CND), the first mechanism designed for an arbitrary f-DP guarantee. The notion of CND captures whether an additive privacy mechanism perfectly matches the privacy guarantee of a given f. We prove that a CND always exists, and give a construction that produces a CND for any f. We show that private hypothesis tests are intimately related to CNDs, allowing for the release of private p-values at no additional privacy cost, as well as the construction of uniformly most powerful (UMP) tests for binary data, within the general f-DP framework. We apply our techniques to the problem of difference-of-proportions testing, and construct a UMP unbiased (UMPU) “semiprivate” test which upper bounds the performance of any f-DP test. Using this as a benchmark, we propose a private test based on the inversion of characteristic functions, which allows for optimal inference on the two population parameters and is nearly as powerful as the semiprivate UMPU. When specialized to the case of (ϵ,0)-DP, we show empirically that our proposed test is more powerful than any (ϵ/ 2)-DP test and has more accurate type I errors than the classic normal approximation test.
SiM Survival Analysis Nonparametric & Semiparametric · 发表于 2023-03-31
Fan Feng, Shuwei Li, Peijie Wang, Jianguo Sun, Chaofu Ke
摘要
Length‐biased data occur often in many scientific fields, including clinical trials, epidemiology surveys and genome‐wide association studies, and many methods have been proposed for their analysis under various situations. In this article, we consider the situation where one faces length‐biased and partly interval‐censored failure time data under the proportional hazards model, for which it does not seem to exist an established method. For the estimation, we propose an efficient nonparametric maximum likelihood method by incorporating the distribution information of the observed truncation times. For the implementation of the method, a flexible and stable EM algorithm via two‐stage data augmentation is developed. By employing the empirical process theory, we establish the asymptotic properties of the resulting estimators. A simulation study conducted to assess the finite‐sample performance of the proposed method suggests that it works well and is more efficient than the conditional likelihood approach. An application to an AIDS cohort study is also provided.
JASA Optimization & Learning Theory · 发表于 2023-03-31
Ying Yang, Fang Yao, Peng Zhao
摘要
We propose an online smoothing backfitting method for generalized additive models coupled with local linear estimation. The idea can be extended to general nonlinear optimization problems. The strategy is to use an appropriate-order expansion to approximate the nonlinear equations and store the coefficients as sufficient statistics which can be updated in an online manner by the dynamic candidate bandwidth method. We investigate the statistical and algorithmic convergences of the proposed method. By defining the relative statistical efficiency and computational cost, we further establish a framework to characterize the tradeoff between estimation performance and computation performance. Simulations and real data examples are provided to illustrate the proposed method and algorithm. Supplementary materials for this article are available online. *(abstract via OpenAlex)*
SiM Causal Inference Survival Analysis · 发表于 2023-03-31
Jean Marie Boher, Thomas Filleron, Pierre Bunouf, Richard J. Cook
摘要
Immunotherapy cancer clinical trials routinely feature an initial period during which the treatment is given without evident therapeutic benefit, which may be followed by a period during which an effective therapy reduces the hazard for event occurrence. The nature of this treatment effect is incompatible with the proportional hazards assumption, which has prompted much work on the development of alternative effect measures of frameworks for testing. We consider tests based on individual and combination of early‐ and late‐emphasis infimum and supremum logrank statistics, describe how they can be implemented, and evaluate their performance in simulation studies. Through this work and illustrative applications we conclude that this class of test statistics offers a new and powerful framework for assessing treatment effects in cancer clinical trials involving immunotherapies.
SiM Other · 发表于 2023-03-31
Dixon Vimalajeewa, Scott Alan Bruce, Brani Vidakovic
摘要
Accurate and efficient detection of ovarian cancer at early stages is critical to ensure proper treatments for patients. Among the first‐line modalities investigated in studies of early diagnosis are features distilled from protein mass spectra. This method, however, considers only a specific subset of spectral responses and ignores the interplay among protein expression levels, which can also contain diagnostic information. We propose a new modality that automatically searches protein mass spectra for discriminatory features by considering the self‐similar nature of the spectra. Self‐similarity is assessed by taking a wavelet decomposition of protein mass spectra and estimating the rate of level‐wise decay in the energies of the resulting wavelet coefficients. Level‐wise energies are estimated in a robust manner using distance variance, and rates are estimated locally via a rolling window approach. This results in a collection of rates that can be used to characterize the interplay among proteins, which can be indicative of cancer presence. Discriminatory descriptors are then selected from these evolutionary rates and used as classifying features. The proposed wavelet‐based features are used in conjunction with features proposed in the existing literature for early stage diagnosis of ovarian cancer using two datasets published by the American National Cancer Institute. Including the wavelet‐based features from the new modality results in improvements in diagnostic performance for early‐stage ovarian cancer detection. This demonstrates the ability of the proposed modality to characterize new ovarian cancer diagnostic information.
SiM Survival Analysis · 发表于 2023-03-31
Mitchell Paukner, Richard Chappell
摘要
Window mean survival time (WMST), a simple extension of restricted mean survival time (RMST), allows for clinicians to evaluate the mean survival difference between treatment groups in specific windows of time during the follow‐up period of a trial. The advantages of WMST are numerous. Not only does it produce estimates of treatment effect that can be meaningfully interpreted, but also has power advantages over competing methods when hazards are non‐proportional (NPH). WMST, like RMST, is currently underutilized due to clinicians' lack of familiarity with tests comparing mean survival times and the lack of tools to facilitate trial design with this endpoint. The aim of this article is to provide investigators with insights and software to design trials with WMST as the primary endpoint. Functions for performing power and sample size calculations are provided in the survWMST package in R available on GitHub.
JASA Bayesian Methods Machine Learning · 发表于 2023-03-31
David Rios Insua, Roi Naveiro, Víctor Gallego, Jason Poulos
摘要
Adversarial Machine Learning (AML) is emerging as a major field aimed at protecting Machine Learning (ML) systems against security threats: in certain scenarios there may be adversaries that actively manipulate input data to fool learning systems.This creates a new class of security vulnerabilities that ML systems may face, and a new desirable property called adversarial robustness essential to trust operations based on ML outputs.Most work in AML is built upon a game-theoretic modeling of the conflict between a learning system and an adversary, ready to manipulate input data.This assumes that each agent knows their opponent's interests and uncertainty judgments, facilitating inferences based on Nash equilibria.However, such common knowledge assumption is not realistic in the security scenarios typical of AML.After reviewing such game-theoretic approaches, we discuss the benefits that Bayesian perspectives provide when defending ML-based systems.We demonstrate how the Bayesian approach allows us to explicitly model our uncertainty about the opponent's beliefs and interests, relaxing unrealistic assumptions, and providing more robust inferences.We illustrate this approach in supervised learning settings, and identify relevant future research problems. *(abstract via OpenAlex)*
SMMR Clinical Trials · 发表于 2023-03-30
Guogen Shan
摘要
Adaptive designs are increasingly used in clinical trials to assess the effectiveness of new drugs. For a single-arm study with a binary outcome, several adaptive designs were developed by using numerical search algorithms and the conditional power approach. The design based on numerical search algorithms is able to identify the global optimal design, but the computational intensity limits the usage of these designs. The conditional power approach searches for the optimal design without expensive computing time. In addition, promising zone strategy was proposed to move on drug development to the follow-up stages when the interim results are promising. We propose to develop two adaptive designs: One based on the conditional power approach, and the other based on the promising zone strategy. These two designs preserve types I and II error rates. It is preferable to satisfy the monotonic property for adaptive designs: The second stage sample size decreases as the first stage responses go up. We theoretically prove this important property for the two proposed designs. The proposed designs can be easily applied to real trials with limited computing resources.
SiM Causal Inference Clinical Trials · 发表于 2023-03-30
Palash Ghosh, Xiaoxi Yan, Bibhas Chakraborty
摘要
Sequential multiple assignment randomized trials (SMARTs) are used to construct data‐driven optimal intervention strategies for subjects based on their intervention and covariate histories in different branches of health and behavioral sciences where a sequence of interventions is given to a participant. Sequential intervention strategies are often called dynamic treatment regimes (DTR). In the existing literature, the majority of the analysis methodologies for SMART data assume a continuous primary outcome. However, ordinal outcomes are also quite common in clinical practice. In this work, first, we introduce the notion of generalized odds ratio () to compare two DTRs embedded in a SMART with an ordinal outcome and discuss some combinatorial properties of this measure. Next, we propose a likelihood‐based approach to estimate from SMART data, and derive the asymptotic properties of its estimate. We discuss alternative ways to estimate using concordant‐discordant pairs and two‐sample ‐statistic. We derive the required sample size formula for designing SMARTs with ordinal outcomes based on . A simulation study shows the performance of the estimated in terms of the estimated power corresponding to the derived sample size. The methodology is applied to analyze data from the SMART+ study, conducted in the UK, to improve carbohydrate periodization behavior in athletes using a menu planner mobile application, Hexis Performance. A freely available Shiny web app using R is provided to make the proposed methodology accessible to other researchers and practitioners.
SiM Missing Data & Measurement Error · 发表于 2023-03-30
Chiu‐Hsieh Hsu, Yulei He, Chengcheng Hu, Wei Zhou
摘要
Missing covariate problems are common in biomedical and electrical medical record data studies while evaluating the relationship between a biomarker and certain clinical outcome, when biomarker data are not collected for all subjects. However, missingness mechanism is unverifiable based on observed data. If there is a suspicion of missing not at random (MNAR), researchers often perform sensitivity analysis to evaluate the impact of various missingness mechanisms. Under the selection modeling framework, we propose a sensitivity analysis approach with a standardized sensitivity parameter using a nonparametric multiple imputation strategy. The proposed approach requires fitting two working models to derive two predictive scores: one for predicting missing covariate values and the other for predicting missingness probabilities. For each missing covariate observation, the two predictive scores along with the pre‐specified sensitivity parameter are used to define an imputing set. The proposed approach is expected to be robust against mis‐specifications of the selection model and the sensitivity parameter since the selection model and the sensitivity parameter are not directly used to impute missing covariate values. A simulation study is conducted to study the performance of the proposed approach when MNAR is induced by Heckman's selection model. Simulation results show the proposed approach can produce plausible regression coefficient estimates. The proposed sensitivity analysis approach is also applied to evaluate the impact of MNAR on the relationship between post‐operative outcomes and incomplete pre‐operative Hemoglobin A1c level for patients who underwent carotid intervetion for advanced atherosclerotic disease.
SiM Causal Inference Bayesian Methods Genetics & Omics · 发表于 2023-03-30
Yangqing Deng, Dongsheng Tu, Chris J O'Callaghan, Derek J Jonker, Christos S Karapetis, Jeremy Shapiro, Geoffrey Liu, Wei Xu
摘要
Many research studies have investigated the relationship between baseline factors or exposures, such as patient demographic and disease characteristics, and study outcomes such as toxicities or quality of life, but results from most of these studies may be problematic because of potential confounding effects (eg, the imbalance in baseline factors or exposures). It is important to study whether the baseline factors or exposures have causal effects on the clinical outcomes, so that clinicians can have better understanding of the diseases and develop personalized medicine. Mendelian randomization (MR) provides an efficient way to estimate the causal effects using genetic instrumental variables to handle confounders, but most of the existing studies focus on a single outcome at a time and ignores the correlation structure of multiple outcomes. Given that clinical outcomes like toxicities and quality of life are usually a mixture of different types of variables, and multiple datasets may be available for such outcomes, it may be much more beneficial to analyze them jointly instead of separately. Some well‐established methods are available for building multivariate models on mixed outcomes, but they do not incorporate MR mechanism to deal with the confounders. To overcome these challenges, we propose a Bayesian‐based two‐stage multivariate MR method for mixed outcomes on multiple datasets, called BMRMO. Using simulation studies and clinical applications on the CO.17 and CO.20 studies, we demonstrate better performance of our approach compared to the commonly used univariate two‐stage method.
Biometrics Causal Inference · 发表于 2023-03-29
Audrey Renson, Michael G. Hudgens, Alexander P. Keil, Paul N. Zivich, Allison E. Aiello
摘要
Many research questions in public health and medicine concern sustained interventions in populations defined by substantive priorities. Existing methods to answer such questions typically require a measured covariate set sufficient to control confounding, which can be questionable in observational studies. Differences-in-differences rely instead on the parallel trends assumption, allowing for some types of time-invariant unmeasured confounding. However, most existing difference-in-differences implementations are limited to point treatments in restricted subpopulations. We derive identification results for population effects of sustained treatments under parallel trends assumptions. In particular, in settings where all individuals begin follow-up with exposure status consistent with the treatment plan of interest but may deviate at later times, a version of Robins' g-formula identifies the intervention-specific mean under stable unit treatment value assumption, positivity, and parallel trends. We develop consistent asymptotically normal estimators based on inverse-probability weighting, outcome regression, and a double robust estimator based on targeted maximum likelihood. Simulation studies confirm theoretical results and support the use of the proposed estimators at realistic sample sizes. As an example, the methods are used to estimate the effect of a hypothetical federal stay-at-home order on all-cause mortality during the COVID-19 pandemic in spring 2020 in the United States.
Biometrics Survival Analysis Nonparametric & Semiparametric Causal Inference · 发表于 2023-03-29
Helene C. W. Rytgaard, Frank Eriksson, Mark J. van der Laan
摘要
This work considers targeted maximum likelihood estimation (TMLE) of treatment effects on absolute risk and survival probabilities in classical time-to-event settings characterized by right-censoring and competing risks. TMLE is a general methodology combining flexible ensemble learning and semiparametric efficiency theory in a two-step procedure for substitution estimation of causal parameters. We specialize and extend the continuous-time TMLE methods for competing risks settings, proposing a targeting algorithm that iteratively updates cause-specific hazards to solve the efficient influence curve equation for the target parameter. As part of the work, we further detail and implement the recently proposed highly adaptive lasso estimator for continuous-time conditional hazards with L1-penalized Poisson regression. The resulting estimation procedure benefits from relying solely on very mild nonparametric restrictions on the statistical model, thus providing a novel tool for machine-learning-based semiparametric causal inference for continuous-time time-to-event data. We apply the methods to a publicly available dataset on follicular cell lymphoma where subjects are followed over time until disease relapse or death without relapse. The data display important time-varying effects that can be captured by the highly adaptive lasso. In our simulations that are designed to imitate the data, we compare our methods to a similar approach based on random survival forests and to the discrete-time TMLE.
SiM Survival Analysis · 发表于 2023-03-28
Nicholas Hartman, Sehee Kim, Kevin He, John D. Kalbfleisch
摘要
Prognostic models are useful tools for assessing a patient's risk of experiencing adverse health events. In practice, these models must be validated before implementation to ensure that they are clinically useful. The concordance index (C‐Index) is a popular statistic that is used for model validation, and it is often applied to models with binary or survival outcome variables. In this paper, we summarize existing criticism of the C‐Index and show that many limitations are accentuated when applied to survival outcomes, and to continuous outcomes more generally. We present several examples that show the challenges in achieving high concordance with survival outcomes, and we argue that the C‐Index is often not clinically meaningful in this setting. We derive a relationship between the concordance probability and the coefficient of determination under an ordinary least squares model with normally distributed predictors, which highlights the limitations of the C‐Index for continuous outcomes. Finally, we recommend existing alternatives that more closely align with common uses of survival models.
SMMR High-Dimensional · 发表于 2023-03-28
Xingyu Chen, Yuehan Yang
摘要
Highly correlated structures appear in various fields, such as biology, biochemistry, and finance, with challenges of dimensionality and sparse estimation. To solve this problem, we propose an algorithm called local linear approximation with the Laplacian smoothing penalty (LLA-LSP). This method produces an accurate and smooth estimate that incorporates the correlation structure among predictors. We compare and discuss the difference between the Laplacian smoothing penalty and the total variance penalty. We prove that this algorithm converges to the oracle solution in a few iterations with a large probability. Numerical results show that the LLA-LSP has good performance in both variable selection and estimation. We apply the proposed algorithm to two biological datasets, a gene expression dataset and a chemical protein dataset, and provide meaningful insights.
SMMR Survival Analysis · 发表于 2023-03-28
Ionut Bebu, Guoqing Diao, Toshimitsu Hamasaki
摘要
The standard modeling approach for time-to-event outcomes subject to censoring is based on the hazard function, with hazard ratios capturing the effect of exposures on the risk of outcome. The restricted mean survival time, defined as the expected time to event up to a pre-specified time horizon, provides an alternative useful summary of time-to-event outcomes. Restricted mean survival time can be estimated nonparametrically and can be used to compare groups or interventions when the proportional hazards (PHs) assumption does not hold. Moreover, even when the proportional hazards assumption holds, the restricted mean survival time, an additive measure of risk, provides additional information to the hazard ratio, which is a measure of relative risk that can be difficult to interpret in absence of an estimate of the reference risk. Herein, a generalized fiducial approach is proposed for restricted mean survival time, and its asymptotic properties are investigated. Numerical simulations show the proposed approach provides one- and two-sided confidence intervals with coverage probabilities close to nominal values and controls the type-I error for two-group comparisons even for small sample sizes with a low number of events. Data from a type 1 diabetes study is used for illustration.
SiM Bayesian Methods Longitudinal Data · 发表于 2023-03-28
Paloma Hauser, Xianming Tan, Fang Chen, Joseph G. Ibrahim
摘要
We propose a generalized linear low‐rank mixed model (GLLRM) for the analysis of both high‐dimensional and sparse responses and covariates where the responses may be binary, counts, or continuous. This development is motivated by the problem of identifying vaccine‐adverse event associations in post‐market drug safety databases, where an adverse event is any untoward medical occurrence or health problem that occurs during or following vaccination. The GLLRM is a generalization of a generalized linear mixed model in that it integrates a factor analysis model to describe the dependence among responses and a low‐rank matrix to approximate the high‐dimensional regression coefficient matrix. A sampling procedure combining the Gibbs sampler and Metropolis and Gamerman algorithms is employed to obtain posterior estimates of the regression coefficients and other model parameters. Testing of response‐covariate pair associations is based on the posterior distribution of the corresponding regression coefficients. Monte Carlo simulation studies are conducted to examine the finite‐sample performance of the proposed procedures on binary and count outcomes. We further illustrate the GLLRM via a real data example based on the Vaccine Adverse Event Reporting System.
SMMR Longitudinal Data Nonparametric & Semiparametric Survival Analysis · 发表于 2023-03-28
Wei Xiong, Dianliang Deng, Dehui Wang, Wanying Zhang
摘要
Most of the studies for longitudinal quantile regression are based on the correct specification. Nevertheless, one specific model can hardly perform precisely under different conditions and assessing which conditions are (approximately) satisfied to determine the optimal one is rather difficult. In the case of the mixed effect model, the misspecification of the fixed effect part will cause a lack of predicting accuracy of random effects, and affect the efficiency of the cumulative function estimator. On the other hand, limited research has focused on incorporating multiple candidate procedures in longitudinal data analysis, which is of current emergency. This paper proposes an exponential aggregation weighting algorithm for longitudinal quantile regression. Based on the secondary smoothing loss function, we establish oracle inequalities for aggregated estimator. The proposed method is applied to evaluate the cumulative τ th quantile function for additive mixed effect model with right-censored history process, and an aggregation-based best linear prediction for random effects is constructed as well. We show that the asymptotic properties are conveniently imposed owing to the smoothing scheme. Simulation studies are carried out to exhibit the rationality, and our method is illustrated to analyze the data set from a multicenter automatic defibrillator implantation trial.