arXiv subjects

Jiangtao Duan

Publications and source records attributed to Jiangtao Duan.

6 recordsLinked to original sources

arXiv2026

Taxonomy and Estimation of Multiple Breakpoints in High-Dimensional Factor Models

This paper proposes a quasi-maximum likelihood (QML) estimator for break points in high-dimensional factor models, specifically accounting for multiple structural breaks. We begin by establishing a necessary and sufficient condition to categorize two distinct types of breaks in factor loadings: singular changes and rotational changes. The analysis of the nearly singular subsample covariance matrices of the pseudo-factors plays a key role in our approach. It allows us to demonstrate that the QML estimator precisely identifies the true breakpoint with probability tending to one for singular changes. For rotational changes, we demonstrate that the estimator exhibits stochastically bounded estimation errors, implying break fraction consistency. Furthermore, we introduce an information criterion to estimate the number of breaks, proving that it can detect the true number with probability tending to one. Monte Carlo simulations confirm the strong finite sample performance of our proposed methods. Finally, we provide an empirical example to estimate structural breakpoints in the FRED-MD dataset spanning 1959 to 2024.

econ.EM↗

arXiv2023

Likelihood ratio test for structural changes in factor models

A factor model with a break in its factor loadings is observationally equivalent to a model without changes in the loadings but a change in the variance of its factors. This effectively transforms a structural change problem of high dimension into a problem of low dimension. This paper considers the likelihood ratio (LR) test for a variance change in the estimated factors. The LR test implicitly explores a special feature of the estimated factors: the pre-break and post-break variances can be a singular matrix under the alternative hypothesis, making the LR test diverging faster and thus more powerful than Wald-type tests. The better power property of the LR test is also confirmed by simulations. We also consider mean changes and multiple breaks. We apply the procedure to the factor modelling and structural change of the US employment using monthly industry-level-data.

econ.EM↗

arXiv2021

Quasi-maximum likelihood estimation of break point in high-dimensional factor models

This paper estimates the break point for large-dimensional factor models with a single structural break in factor loadings at a common unknown date. First, we propose a quasi-maximum likelihood (QML) estimator of the change point based on the second moments of factors, which are estimated by principal component analysis. We show that the QML estimator performs consistently when the covariance matrix of the pre- or post-break factor loading, or both, is singular. When the loading matrix undergoes a rotational type of change while the number of factors remains constant over time, the QML estimator incurs a stochastically bounded estimation error. In this case, we establish an asymptotic distribution of the QML estimator. The simulation results validate the feasibility of this estimator when used in finite samples. In addition, we demonstrate empirical applications of the proposed method by applying it to estimate the break points in a U.S. macroeconomic dataset and a stock return dataset.

econ.EM↗

arXiv2021

Subspace Clustering for Panel Data with Interactive Effects

In this paper, a statistical model for panel data with unobservable grouped factor structures which are correlated with the regressors and the group membership can be unknown. The factor loadings are assumed to be in different subspaces and the subspace clustering for factor loadings are considered. A method called least squares subspace clustering estimate (LSSC) is proposed to estimate the model parameters by minimizing the least-square criterion and to perform the subspace clustering simultaneously. The consistency of the proposed subspace clustering is proved and the asymptotic properties of the estimation procedure are studied under certain conditions. A Monte Carlo simulation study is used to illustrate the advantages of the proposed method. Further considerations for the situations that the number of subspaces for factors, the dimension of factors and the dimension of subspaces are unknown are also discussed. For illustrative purposes, the proposed method is applied to study the linkage between income and democracy across countries while subspace patterns of unobserved factors and factor loadings are allowed.

econ.EM↗

arXiv2021

Efficient computational algorithms for approximate optimal designs

In this paper, we propose two simple yet efficient computational algorithms to obtain approximate optimal designs for multi-dimensional linear regression on a large variety of design spaces. We focus on the two commonly used optimal criteria, $D$- and $A$-optimal criteria. For $D$-optimality, we provide an alternative proof for the monotonic convergence for $D$-optimal criterion and propose an efficient computational algorithm to obtain the approximate $D$-optimal design. We further show that the proposed algorithm converges to the $D$-optimal design, and then prove that the approximate $D$-optimal design converges to the continuous $D$-optimal design under certain conditions. For $A$-optimality, we provide an efficient algorithm to obtain approximate $A$-optimal design and conjecture the monotonicity of the proposed algorithm. Numerical comparisons suggest that the proposed algorithms perform well and they are comparable or superior to some existing algorithms.

math.ST↗

arXiv2018

Efficient Computational Algorithm for Optimal Continuous Experimental Designs

A simple yet efficient computational algorithm for computing the continuous optimal experimental design for linear models is proposed. An alternative proof the monotonic convergence for $D$-optimal criterion on continuous design spaces are provided. We further show that the proposed algorithm converges to the $D$-optimal design. We also provide an algorithm for the $A$-optimality and conjecture that the algorithm convergence monotonically on continuous design spaces. Different numerical examples are used to demonstrated the usefulness and performance of the proposed algorithms.

stat.CO↗