论文检索

协作式多标签分类AI 解读

In multilabel classification, strong label dependence is present for exploiting, particularly for word-to-word dependence defined by semantic labels. In such a situation, we develop a collaborative-learning framework to predict class labels based on label-predictor pairs and label-only data. For example, in image categorization and recognition, language expressions describe the content of an image together with a large number of words and phrases without associated images.…

高维约束最大似然推断AI 解读

Inference in a high-dimensional situation may involve regularization of a certain form to treat overparameterization, imposing challenges to inference. The common practice of inference uses either a regularized model, as in inference after model selection, or bias-reduction known as “debias.” While the first ignores statistical uncertainty inherent in regularization, the second reduces the bias inbred in regularization at the expense of increased variance. In this article,…

多个矩阵高斯图的估计AI 解读

Summary Matrix-valued data, where the sampling unit is a matrix consisting of rows and columns of measurements, are emerging in numerous scientific and business applications. Matrix Gaussian graphical models are a useful tool to characterize the conditional dependence structure of rows and columns. We employ non-convex penalization to tackle the estimation of multiple graphs from matrix-valued data under a matrix normal distribution. We propose a highly efficient non-convex…

潜在因子模型中的个性化预测与稀疏性追求AI 解读

Yunzhang Zhu, Xiaotong Shen & Changqing YeYunzhang Zhu (E-mail: zhuxx351@umn.edu), Xiaotong Shen (E-mail: shenx002@umn.edu), and Changqing Ye (E-mail: cqye@stat.umn.edu), School of Statistics, University of Minnesota, Minneapolis, MN 55455. Research supported in part by NSF grants DMS-1207771 and DMS-1415500, NIH grants R02GM08153 and R01HL105397. The authors would like to thank Professor Hui Jiang for technical help in OpenMP coding, and thank the editor, the associate…

多个无向图的结构追寻AI 解读

Gaussian graphical models are useful to analyze and visualize conditional dependence relationships between interacting units. Motivated from network analysis under different experimental conditions, such as gene networks for disparate cancer subtypes, we model structural changes over multiple networks with possible heterogeneities. In particular, we estimate multiple precision matrices describing dependencies among interacting units through maximum penalized likelihood. Of…

无向图上的同步分组搜索与特征选择AI 解读

In high-dimensional regression, grouping pursuit and feature selection have their own merits while complementing each other in battling the curse of dimensionality. To seek a parsimonious model, we perform simultaneous grouping pursuit and feature selection over an arbitrary undirected graph with each node corresponding to one predictor. When the corresponding nodes are reachable from each other over the graph, regression coefficients can be grouped, whose absolute values…

基于似然的变量选择与精确参数估计AI 解读

In high-dimensional data analysis, feature selection becomes one means for dimension reduction, which proceeds with parameter estimation. Concerning accuracy of selection and estimation, we study nonconvex constrained and regularized likelihoods in the presence of nuisance parameters. Theoretically, we show that constrained L(0)-likelihood and its computational surrogate are optimal in that they achieve feature selection consistency and sharp parameter estimation, under one…