论文检索

可微 Hilbert 空间值参数的一步估计AI 解读

rate estimators and corresponding confidence sets. These estimators correspond to generalizations of cross-fitted one-step estimators based on Hilbert-valued efficient influence functions. We give theoretical guarantees even when arbitrary estimators of nuisance functions are used, including those based on machine learning techniques. We show that these results naturally extend to Hilbert spaces that lack a reproducing kernel, as long as the parameter has an efficient…

多值处理效应的高维模型辅助推断AI 解读

Consider estimation of average treatment effects with multi-valued treatments using augmented inverse probability weighted (IPW) estimators, depending on outcome regression and propensity score models in high-dimensional settings. These regression models are often fitted by regularized likelihood-based estimation, while ignoring how the fitted functions are used in the subsequent inference about the treatment parameters. Such separate estimation can be associated with known…

电子健康记录中的树引导稀有特征选择与逻辑聚合AI 解读

Statistical learning with a large number of rare binary features is commonly encountered in analyzing electronic health records (EHR) data, especially in the modeling of disease onset with prior medical diagnoses and procedures. Dealing with the resulting highly sparse and large-scale binary feature matrix is notoriously challenging as conventional methods may suffer from a lack of power in testing and inconsistency in model fitting, while machine learning methods may suffer…

高维数据的渐近分布无关独立性检验AI 解读

Test of independence is of fundamental importance in modern data analysis, with broad applications in variable selection, graphical models, and causal inference. When the data is high dimensional and the potential dependence signal is sparse, independence testing becomes very challenging without distributional or structural assumptions. In this paper, we propose a general framework for independence testing by first fitting a classifier that distinguishes the joint and…

密度估计的平滑惩罚反卷积方法AI 解读

This article addresses the deconvolution problem of estimating a square-integrable probability density from observations contaminated with additive measurement errors having a known density. The estimator begins with a density estimate of the contaminated observations and minimizes a reconstruction error penalized by an integrated squared mth derivative. Theory for deconvolution has mainly focused on kernel- or wavelet-based techniques, but other methods including…

存在隐变量的高维多响应回归推断AI 解读

This article studies the inference of the regression coefficient matrix under multivariate response linear regressions in the presence of hidden variables. A novel procedure for constructing confidence intervals of entries of the coefficient matrix is proposed. Our method first uses the multivariate nature of the responses by estimating and adjusting the hidden effect to construct an initial estimator of the coefficient matrix. By further deploying a low-dimensional…

岭正则化的刀切 Anderson–Rubin 检验AI 解读

We consider hypothesis testing in instrumental variable regression models with few included exogenous covariates but many instruments-possibly more than the number of observations. We show that a ridge-regularized version of the jackknifed Anderson and Rubin (henceforth AR) test controls asymptotic size in the presence of heteroscedasticity, and when the instruments may be arbitrarily weak. Asymptotic size control is established under weaker assumptions than those imposed…

样本选择模型的双重机器学习AI 解读

This article considers the evaluation of discretely distributed treatments when outcomes are only observed for a subpopulation due to sample selection or outcome attrition. For identification, we combine a selection-on-observables assumption for treatment assignment with either selection-on-observables or instrumental variable assumptions concerning the outcome attrition/sample selection process. We also consider dynamic confounding, meaning that covariates that jointly…

FNETS：高维时间序列的因子调整网络估计与预测AI 解读

–We propose FNETS, a methodology for network estimation and forecasting of high-dimensional time series exhibiting strong serial- and cross-sectional correlations. We operate under a factor-adjusted vector autoregressive (VAR) model which, after accounting for pervasive co-movements of the variables by common factors, models the remaining idiosyncratic dynamic dependence between the variables as a sparse VAR process. Network estimation of FNETS consists of three steps: (i)…

谱正则化核两样本检验AI 解读

Over the last decade, an approach that has gained a lot of popularity to tackle nonparametric testing problems on general (i.e., non-Euclidean) domains is based on the notion of reproducing kernel Hilbert space (RKHS) embedding of probability distributions. The main goal of our work is to understand the optimality of two-sample tests constructed based on this approach. First, we show the popular MMD (maximum mean discrepancy) two-sample test to be not optimal in terms of the…

协调 model-X 与双重稳健条件独立检验AI 解读

Model-X approaches to testing conditional independence between a predictor and an outcome variable given a vector of covariates usually assume exact knowledge of the conditional distribution of the predictor given the covariates. Nevertheless, model-X methodologies are often deployed with this conditional distribution learned in sample. We investigate the consequences of this choice through the lens of the distilled conditional randomization test (dCRT). We find that Type-I…

高维预测回归中的 LASSOAI 解读

This paper examines LASSO, a widely-used L1-penalized regression method, in high dimensional linear predictive regressions, particularly when the number of potential predictors exceeds the sample size and numerous unit root regressors are present. The consistency of LASSO is contingent upon two key components: the deviation bound of the cross product of the regressors and the error term, and the restricted eigenvalue of the Gram matrix. We present new probabilistic bounds…

多重检验与选择性推断中的选择和条件化AI 解读

Summary We investigate a class of methods for selective inference that condition on a selection event. Such methods follow a two-stage process. First, a data-driven collection of hypotheses is chosen from some large universe of hypotheses. Subsequently, inference takes place within this data-driven collection, conditioned on the information that was used for the selection. Examples of such methods include basic data splitting as well as modern data-carving methods and…

因果函数的核方法：剂量、异质性与增量响应曲线AI 解读

Abstract We propose estimators based on kernel ridge regression for nonparametric causal functions such as dose, heterogeneous and incremental response curves. The treatment and covariates may be discrete or continuous in general spaces. Because of a decomposition property specific to the reproducing kernel Hilbert space, our estimators have simple closed-form solutions. We prove uniform consistency with finite sample rates via an original analysis of generalized kernel…

van Lieshout 与 Lu 对机器学习概率统计讨论会论文的讨论意见AI 解读

We congratulate Professors Li, Fearnhead, Fryzlewics, and Wang on their fine work that represents classic test statistics for change-point detection as a neural network-based classifier and develops improved offline detection algorithms for historical, labelled data. The paper focuses on real-valued observation vectors in a temporal regression model with training data being either labelled historical data or obtained by simulation from a model. In many applications, though,…

Hernando Ombao 对机器学习概率与统计讨论会论文的评论AI 解读

I congratulate the authors for their fundamental contribution that demonstrates how the existing tests for change-points can be represented by a neural network. The major consequence is that with sufficient data, the performance of these neural networks should be at par with these existing tests. This formulation is very insightful and inspired me to revisit the previous work on models for non-stationary time series that use time-localized representations such as wavelets,…

Gilbert MacKenzie 对机器学习概率与统计讨论会的评论AI 解读

I would like first to congratulate both authors on presenting their very stimulating work in the spirit of the conference’s theme of statisticians and machine learners working in alliance. There is no doubt in my mind that collaboration will lead to better, more parsimonious, models. My comments relate, mainly, to the second discussant’s points on over-parametrization. If a feed-forward neural net (Ripley, 1994) is denoted by Net(x,θ)⁠, where x is the input layer and ϕ is…

变换稀疏性中的错误发现率控制：Split KnockoffsAI 解读

Abstract Controlling the False Discovery Rate (FDR) in a variable selection procedure is critical for reproducible discoveries, and it has been extensively studied in sparse linear models. However, it remains largely open in scenarios where the sparsity constraint is not directly imposed on the parameters but on a linear transformation of the parameters to be estimated. Examples of such scenarios include total variations, wavelet transforms, fused LASSO, and trend filtering.…

稠密因子增强模型下的岭回归AI 解读

This article establishes a comprehensive theory of the optimality, robustness, and cross-validation selection consistency for the ridge regression under factor-augmented models with possibly dense idiosyncratic information.Using spectral analysis for random matrices, we show that the ridge regression is asymptotically efficient in capturing both factor and idiosyncratic information by minimizing the limiting predictive loss among the entire class of spectral regularized…

高维稀疏卷积秩回归AI 解读

Wang et al. studied the high-dimensional sparse penalized rank regression and established its nice theoretical properties. Compared with the least squares, rank regression can have a substantial gain in estimation efficiency while maintaining a minimal relative efficiency of 86.4%. However, the computation of penalized rank regression can be very challenging for high-dimensional data, due to the highly nonsmooth rank regression loss. In this work we view the rank regression…

高维非高斯空间场的可扩展贝叶斯输运映射AI 解读

A multivariate distribution can be described by a triangular transport map from the target distribution to a simple reference distribution.We propose Bayesian nonparametric inference on the transport map by modeling its components using Gaussian processes.This enables regularization and uncertainty quantification of the map estimation, while resulting in a closed-form and invertible posterior map.We then focus on inferring the distribution of a nonstationary spatial field…

度异质性社会网络中高维节点属性的变量选择AI 解读

We consider a class of network models, in which the connection probability depends on ultrahigh-dimensional nodal covariates (homophily) and node-specific popularity (degree heterogeneity). A Bayesian method is proposed to select nodal features in both dense and sparse networks under a mild assumption on popularity parameters. The proposed approach is implemented via Gibbs sampling. To alleviate the computational burden for large sparse networks, we further develop a working…

利用枢纽模型及其变体推断隐含网络AI 解读

Statistical network analysis primarily focuses on inferring the parameters of an observed network. In many applications, especially in the social sciences, the observed data is the groups formed by individual subjects. In these applications, the network is itself a parameter of a statistical model. Zhao and Weko propose a model-based approach, called the hub model, to infer implicit networks from grouping behavior. The hub model assumes that each member of the group is…

高维函数型数据的最优线性判别分析AI 解读

Most of existing methods of functional data classification deal with one or a few processes. In this work we tackle classification of high-dimensional functional data, in which each observation is potentially associated with a large number of functional processes, p, which is comparable to or even much larger than the sample size n. The challenge arises from the complex inter-correlation structures among multiple functional processes, instead of a diagonal correlation for a…