June 2023 Inference for low-rank models
Victor Chernozhukov, Christian Hansen, Yuan Liao, Yinchu Zhu
Author Affiliations +
Ann. Statist. 51(3): 1309-1330 (June 2023). DOI: 10.1214/23-AOS2293

Abstract

This paper studies inference in linear models with a high-dimensional parameter matrix that can be well approximated by a “spiked low-rank matrix.” A spiked low-rank matrix has rank that grows slowly compared to its dimensions and nonzero singular values that diverge to infinity. We show that this framework covers a broad class of models of latent variables, which can accommodate matrix completion problems, factor models, varying coefficient models and heterogeneous treatment effects. For inference, we apply a procedure that relies on an initial nuclear-norm penalized estimation step followed by two ordinary least squares regressions. We consider the framework of estimating incoherent eigenvectors and use a rotation argument to argue that the eigenspace estimation is asymptotically unbiased. Using this framework, we show that our procedure provides asymptotically normal inference and achieves the semiparametric efficiency bound. We illustrate our framework by providing low-level conditions for its application in a treatment effects context where treatment assignment might be strongly dependent.

Citation

Download Citation

Victor Chernozhukov. Christian Hansen. Yuan Liao. Yinchu Zhu. "Inference for low-rank models." Ann. Statist. 51 (3) 1309 - 1330, June 2023. https://doi.org/10.1214/23-AOS2293

Information

Received: 1 November 2021; Revised: 1 December 2022; Published: June 2023
First available in Project Euclid: 20 August 2023

MathSciNet: MR4630950
zbMATH: 07732749
Digital Object Identifier: 10.1214/23-AOS2293

Subjects:
Primary: 62H25
Secondary: 62F12

Keywords: incoherent eigenvectors , sample splitting , singular value thresholding

Rights: Copyright © 2023 Institute of Mathematical Statistics

JOURNAL ARTICLE
22 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.51 • No. 3 • June 2023
Back to Top