论文检索

多元线性回归中的高维方差分析AI 解读

Summary In this paper, we develop a systematic theory for high-dimensional analysis of variance in multivariate linear regression, where the dimension and the number of coefficients can both grow with the sample size. We propose a new U-type statistic to test linear hypotheses and establish a high-dimensional Gaussian approximation result under fairly mild moment assumptions. Our general framework and theory can be used to deal with the classical one-way multivariate…

选择后推断中的分割策略AI 解读

Summary We consider the problem of providing valid inference for a selected parameter in a sparse regression setting. It is well known that classical regression tools can be unreliable in this context because of the bias generated in the selection step. Many approaches have been proposed in recent years to ensure inferential validity. In this article we consider a simple alternative to data splitting based on randomizing the response vector, which allows for higher selection…

二元结果概率预测的诚实校准评估AI 解读

Summary Probability predictions from binary regressions or machine learning methods ought to be calibrated: if an event is predicted to occur with probability $x$, it should materialize with approximately that frequency, which means that the so-called calibration curve $p(\cdot)$ should equal the identity, i.e., $p(x) = x$ for all $x$ in the unit interval. We propose honest calibration assessment based on novel confidence bands for the calibration curve, which are valid…

高维矩阵数据的 Kronecker 积协方差检验AI 解读

Summary The Kronecker product covariance structure provides an efficient way to model the inter-correlations of matrix-variate data. In this paper, we propose test statistics for the Kronecker product covariance matrix based on linear spectral statistics of renormalized sample covariance matrices. A central limit theorem is proved for the linear spectral statistics, with explicit formulas for the mean and covariance functions, thereby filling a gap in the literature. We then…

利用阈值化 graphical lasso 处理潜变量AI 解读

Summary Structural learning of Gaussian graphical models in the presence of latent variables has long been a challenging problem. Chandrasekaran et al. (2012) proposed a convex program for estimating a sparse graph plus a low-rank term that adjusts for latent variables; however, this approach poses challenges from both computational and statistical perspectives. We propose an alternative, simple solution: apply a hard-thresholding operator to existing graph selection…

最大最小效应的统计推断：识别跨研究稳定关联AI 解读

Integrative analysis of data from multiple sources is critical to making generalizable discoveries. Associations consistently observed across multiple source populations are more likely to be generalized to target populations with possible distributional shifts. In this paper, we model the heterogeneous multi-source data with multiple high-dimensional regressions and make inferences for the maximin effect (Meinshausen, Bühlmann, AoS, 43(4), 1801–1830). The maximin effect…

因子增强逆回归及其微生物组数据分析应用AI 解读

We investigate the relationship between count data that inform the relative abundance of features of a composition, and factors that influence the composition. Our work is motivated from microbiome studies aiming to extract microbial signatures that are predictive of host phenotypes based on data collected from a group of individuals harboring radically different microbial communities. We introduce multinomial Factor Augmented Inverse Regression (FAIR) of the count vector…

高维正则化回归估计量的普适性AI 解读

The Convex Gaussian Min–Max Theorem (CGMT) has emerged as a prominent theoretical tool for analyzing the precise stochastic behavior of various statistical estimators in the so-called high-dimensional proportional regime, where the sample size and the signal dimension are of the same order. However, a well-recognized limitation of the existing CGMT machinery rests in its stringent requirement on the exact Gaussianity of the design matrix, therefore rendering the obtained…

从高维含噪数据学习低维非线性结构：积分算子方法AI 解读

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…

凸约束下含噪线性逆问题的高维精确风险渐近AI 解读

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…

信号去噪的交叉验证框架：趋势滤波、二分 CART 等应用AI 解读

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…

偏差与方差权衡的下界AI 解读

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…

放宽独立同分布假设：通过平方根熵正则化实现自适应极小极大遗憾AI 解读

We consider prediction with expert advice when data are generated from distributions varying arbitrarily within an unknown constraint set. This semi-adversarial setting includes (at the extremes) the classical i.i.d. setting, when the unknown constraint set is restricted to be a singleton, and the unconstrained adversarial setting, when the constraint set is the set of all distributions. The Hedge algorithm—long known to be minimax (rate) optimal in the adversarial…

单指标 Fréchet 回归AI 解读

Single index models provide an effective dimension reduction tool in regression, especially for high-dimensional data, by projecting a general multivariate predictor onto a direction vector. We propose a novel single-index model for regression models where metric space-valued random object responses are coupled with multivariate Euclidean predictors. The responses in this regression model include complex, non-Euclidean data, including covariance matrices, graph Laplacians of…

连接因子模型与稀疏模型AI 解读

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…

稀疏分位数回归AI 解读

We consider both ℓ0-penalized and ℓ0-constrained quantile regression estimators. For the ℓ0-penalized estimator, we derive an exponential inequality on the tail probability of excess quantile prediction risk and apply it to obtain non-asymptotic upper bounds on the mean-square parameter and regression function estimation errors. We also derive analogous results for the ℓ0-constrained estimator. The resulting rates of convergence are nearly minimax-optimal and the same as…

NPIV模型平均导数的有效估计：神经网络估计量的模拟比较AI 解读

Artificial Neural Networks (ANNs) can be viewed as nonlinear sieves that can approximate complex functions of high dimensional variables more effectively than linear sieves. We investigate the performance of various ANNs in nonparametric instrumental variables (NPIV) models of moderately high dimensional covariates that are relevant to empirical economics. We present two efficient procedures for estimation and inference on a weighted average derivative (WAD): an…

多重门限因子模型的收缩估计AI 解读

This paper proposes a multiple threshold factor model to enhance the flexibility in modeling the underlying regime switching mechanism for high dimensional time series. The factor loadings are assumed to switch between different regimes according to the value of a threshold variable. A novel estimation procedure is proposed to consistently estimate the multiple thresholds with the aid of sorting operation, principal component analysis and shrinkage estimation, which is…

第一价格拍卖模型的函数估计方法AI 解读

This paper introduces new methods of identification and estimation of the first-price sealed bid auction model and compares them with the previous existing ones. The first method of estimation allows us to estimate directly (through an iterative algorithm) the cumulative distribution function of the private values without estimating the private values beforehand. In the second method, we use a quantile approach. Although the first-price auction is a complex nonlinear inverse…

纵向数据惩罚分位数回归的野生 bootstrap 推断AI 解读

The existing theory of penalized quantile regression for longitudinal data has focused primarily on point estimation. In this work, we investigate statistical inference. We propose a wild residual bootstrap procedure and show that it is asymptotically valid for approximating the distribution of the penalized estimator. The model puts no restrictions on individual effects, and the estimator achieves consistency by letting the shrinkage decay in importance asymptotically. The…

集合识别线性模型的去偏机器学习AI 解读

This paper provides estimation and inference methods for an identified set’s boundary (i.e., support function) where the selection among a very large number of covariates is based on modern regularized tools. I characterize the boundary using a semiparametric moment equation. Combining Neyman-orthogonality and sample splitting ideas, I construct a root-N consistent, uniformly asymptotically Gaussian estimator of the boundary and propose a multiplier bootstrap procedure to…

面板数据潜在群组结构的估计与识别AI 解读

This paper provides a framework for joint estimation and identification of latent group structures in panel data models using a pairwise fusion penalized approach. The latent structure of the model allows individuals to be classified into different groups where the number of groups and the group membership are unknown. The individuals within a group have common slope parameters, while parameter heterogeneity is allowed across the groups. A penalized least squares (PLS)…

大型贝叶斯 VAR 的随机波动率设定比较AI 解读

Large Bayesian vector autoregressions with various forms of stochastic volatility have become increasingly popular in empirical macroeconomics. One main difficulty for practitioners is to choose the most suitable stochastic volatility specification for their particular application. We develop Bayesian model comparison methods–based on marginal likelihood estimators that combine conditional Monte Carlo and adaptive importance sampling–to choose among a variety of stochastic…

惩罚化时变模型平均AI 解读

This paper proposes a new penalized time-varying model averaging method to determine optimal time-varying combination weights for candidate models, which avoids over-fitting and yields sparseness from various potential predictive variables. The asymptotic optimality and convergence rate of the selected weights are derived even when all candidate models are misspecified, and the consistency and normality of the proposed time-varying model averaging estimator are obtained when…