scispace - formally typeset
S

Serena Ng

Researcher at Columbia University

Publications -  187
Citations -  28024

Serena Ng is an academic researcher from Columbia University. The author has contributed to research in topics: Estimator & Unit root. The author has an hindex of 58, co-authored 187 publications receiving 25829 citations. Previous affiliations of Serena Ng include National Bureau of Economic Research & University of Michigan.

Papers
More filters
Posted Content

Sketching for Two-Stage Least Squares Estimation.

Sokbae Lee, +1 more
TL;DR: The implications for two-stage least squares estimation when the sketches are obtained by a computationally efficient method known as CountSketch are investigated and the asymptotic variance can be consistently estimated using the sketched sample.
Posted Content

A Note on the Selection of Time Series Models

TL;DR: In this paper, the authors consider the sensitivity of the estimated order of an autoregression selected using information criteria to the effective number of observations, the estimate of the variance and the penalty for overfitting in relation to the total sample size.
Posted Content

An Econometric Perspective on Algorithmic Subsampling

TL;DR: In this article, a line of work that is grounded in theoretical computer science and numerical linear algebra is reviewed, and it is shown that an algorithmically desirable sketch, which is a randomly chosen subset of the data, must preserve the eigenstructure of data, a property known as a subspace embedding.
Posted Content

Shock Restricted Structural Vector-Autoregressions

TL;DR: In this article, two types of inequality constraints on the shocks are proposed to restrict the sign and possibly magnitude of the shocks during unusual episodes in history, and the correlation between the shocks and variables external to the SVAR.
Posted Content

An Econometric Perspective on Algorithmic Subsampling

TL;DR: In this article, a line of work that is grounded in theoretical computer science and numerical linear algebra is reviewed, and it is shown that an algorithmically desirable sketch, which is a randomly chosen subset of the data, must preserve the eigenstructure of data, a property known as a subspace embedding.