<?xml-model href='http://www.tei-c.org/release/xml/tei/custom/schema/relaxng/tei_all.rng' schematypens='http://relaxng.org/ns/structure/1.0'?><TEI xmlns="http://www.tei-c.org/ns/1.0">
	<teiHeader>
		<fileDesc>
			<titleStmt><title level='a'>Realized regression with asynchronous and noisy high frequency and high dimensional data</title></titleStmt>
			<publicationStmt>
				<publisher>Elsevier</publisher>
				<date>02/01/2024</date>
			</publicationStmt>
			<sourceDesc>
				<bibl> 
					<idno type="par_id">10553584</idno>
					<idno type="doi">10.1016/j.jeconom.2023.02.015</idno>
					<title level='j'>Journal of Econometrics</title>
<idno>0304-4076</idno>
<biblScope unit="volume">239</biblScope>
<biblScope unit="issue">2</biblScope>					

					<author>Dachuan Chen</author><author>Per A Mykland</author><author>Lan Zhang</author>
				</bibl>
			</sourceDesc>
		</fileDesc>
		<profileDesc>
			<abstract><ab><![CDATA[We develop regression for high frequency data. This regression is novel in that it can be for both fixed and increasing dimension. Also, the data may have microstructure noise, and observations (trades, or quotes) can be asynchronous, (i.e., the observations do not need to be synchronized across dimensions). As is customary for high-frequency inference methods, we refer to our method as “realized” regression.In our methodology, spot beta becomes a key quantity in the nonparametric framework of high frequency econometrics. The central contribution of this paper is a feasible estimator of spot beta, which is robust to noise and asynchronicity. With the help of the spot-version of the Smoothed TSRV estimator, spot beta can be consistently estimated. There are two direct applications of the spot beta estimates in the current paper. In the first application, the integrated beta can be consistently estimated by aggregating the spot beta estimates. After a bias-correction procedure, a fixed dimension central limit theorem is established for the bias-corrected estimator, with convergence rate which may be arbitrarily close to Op(n^{1/4}). In the second application we assume time-varying factor structure and conditional sparsity. The spot beta matrix estimator enables the estimation of high dimensional spot covariance and precision matrices. The latter is obtained by thresholding the spot residual covariance estimates, and convergence rates derived. As an empirical application, this paper explores the hourly change in beta around earnings announcements of the S&P 100 constituents.]]></ab></abstract>
		</profileDesc>
	</teiHeader>
	<text><body xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink">
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Regression is a main technique in scientific research, which is widely used in exploring the linear relationship between observable quantities, and in analyzing the structure of variability.</p><p>The connection between regression and finance originated from the capital asset pricing model (CAPM, <ref type="bibr">Markowitz (1952</ref><ref type="bibr">Markowitz ( , 1959))</ref>, <ref type="bibr">Sharpe (1964)</ref>, <ref type="bibr">Lintner (1965)</ref>, <ref type="bibr">Black (1972)</ref>). Over time, the connection has expanded to multiple factors, such as in <ref type="bibr">Fama and MacBeth (1973)</ref>, and <ref type="bibr">Ross (1976)</ref>. The literature has gradually split into regression (observed factors) and principal component analysis (PCA, unobserved factors). We are here concerned with the former. For literature &#10025; Financial support from the United States National Science Foundation under grants DMS-2015530 <ref type="bibr">(Zhang)</ref>, and DMS-2015544 <ref type="bibr">(Mykland)</ref>, is gratefully acknowledged. reviews, see, e.g., <ref type="bibr">Campbell et al. (1997)</ref> and <ref type="bibr">Cochrane (2005)</ref>. Recent developments in high frequency PCA are reviewed in <ref type="bibr">Chen et al. (2020)</ref>.</p><p>The importance of time-varying betas (regression coefficients) has received increasing attention in the finance and econometrics literature. Such betas reflect time-varying conditional information. Research in this direction includes <ref type="bibr">Hansen and Richard (1987)</ref>, <ref type="bibr">Bollerslev et al. (1988)</ref>, <ref type="bibr">Jagannathan and Wang (1996)</ref>, <ref type="bibr">Boguth et al. (2011)</ref>, <ref type="bibr">Ang and Kristensen (2012)</ref>, <ref type="bibr">Engle (2016)</ref>, and <ref type="bibr">Gagliardini et al. (2016)</ref>.</p><p>WIth the advent of high-frequency data, a literature has started to develop where time-varying betas are estimated from intraday data. Important empirical contributions are <ref type="bibr">Andersen et al. (2006)</ref>, who investigated the persistence and predictability of time-varying beta estimates, and <ref type="bibr">Patton and Verardo (2012)</ref>, who explored the effect of information flows on stock returns.</p><p>The purpose of this paper is to develop the theory for how to estimate betas in fixed and increasing dimension, for high frequency data. If we let c X,X t and c X,Y t be the (unobserved) spot (instantaneous) covariance matrices of (latent) efficient prices (or other semi-martingales) X and Y, the spot and integrated beta are given by, 1</p><p>where [0, T ] is the fixed interval under observation. By considering data with microstructure noise, as well as letting observations (such as transactions and quotes) happen asyncronously across dimensions, we bring the theory to the point where it can accommodate real data.</p><p>In finite dimension (Section 3), our theory focuses on the integrated beta. The integrated beta &#8747; T 0 &#946; t dt is consistently estimated by aggregating estimates of spot beta. The aggregation is similar to the constructions in the papers cited at the beginning of Section 1.1 We show asymptotic normality in finite dimension (Theorem 2), preceded by a bias correction which is needed for this normality to hold.</p><p>In increasing dimension (Section 4), our theory estimates the spot (instantaneous) &#946; t , 2 and from there estimates the spot precision matrix, which has a role in determining asset allocation, cf. <ref type="bibr">(Fan et al., 2016a)</ref>. We derive the rate of convergence as the dimensions of X and Y tend to infinity. Both these developments take as their points of departure spot covariance matrices that are calculated by the S-TSRV procedure (pre-averaging followed by two-scales, Section 2 in this paper, and <ref type="bibr">Mykland et al. (2019)</ref>). The basic preaveraging is done over time blocks of length &#8710;&#964; n , and spot covariance matrices are calculated over time blocks of length &#8710;T n . To get a sense of the magnitudes we have in mind, in the simulation we have used &#8710;T n = 2340 seconds, and &#8710;&#964; n is 5, 15 or 60 seconds. In the empirical application, &#8710;&#964; n = 5 seconds, and &#8710;T n is (in most cases) hourly.</p><p>On the theoretical side, the rate of convergence in the CLT (Theorem 2) is a -1 n , which is allowed to be arbitrarily close to n -1/4 . The latter is previously known as the standard efficient rate for covariances in estimation problems with microstructure. 3 A precise explanation of the rate a n is given in Eq. (2.10) and Remark 1 in Section 2.2. As described there, a n is closely related to &#8710;&#964; n .</p><p>In the increasing dimension setting, the rates of convergence also depend crucially on a n , but we defer discussion of this to Section 4.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.1.">Sketch of finite dimensional regression</head><p>Closely related literature. The theory of estimation the two betas in (1.1) has previously been studied in the case of no microstructure noise and synchronous observations, in <ref type="bibr">Mykland and Zhang (2006</ref><ref type="bibr">, 2008</ref><ref type="bibr">), and Zhang (2012)</ref>, with a jump-robust version in <ref type="bibr">A&#239;t-Sahalia et al. (2020)</ref> and <ref type="bibr">A&#239;t-Sahalia et al. (2021)</ref>. In this setting, the estimator of integrated beta is simply a sum of ordinary least squares regression estimators <ref type="bibr">(Mykland and Zhang, 2009</ref><ref type="bibr">, Section 4.2, pp. 1424</ref><ref type="bibr">-1426)</ref>. More generally, all proposed estimators of (1.1) are local in time, so that covariance at time t is only compared with variance around t. This is also the case for the estimators developed in the current paper.</p><p>In the presence of asynchronous and noisy observations, the development of a feasible spot beta estimator has become increasingly necessary. As shown by Monte Carlo simulation (Table <ref type="table">5</ref>.1 in Section 5.2), integrated beta estimates become biased when the data is noisy. By applying the spot-version of the smoothed TSRV (S-TSRV), this paper proposes feasible estimators for spot beta under both fixed and increasing dimension.</p><p>Bias in the integrated beta. Expanding the Riemann sum of spot beta estimates to higher order, a bias term naturally arises, which is analogous to the aggregated second order expansion term of the non-linear functional of stochastic volatilities in <ref type="bibr">Jacod and Rosenbaum (2013)</ref> and <ref type="bibr">A&#239;t-Sahalia and Xiu (2017)</ref>. This bias term becomes the main barrier to the central limit theorem. By properly selecting the range of the smoothing window &#8710;T n over which the spot &#946; is calculated, and then applying the extended bias-correction technique based on <ref type="bibr">Chen et al. (2020)</ref>, the central limit theorem (CLT) for the bias-corrected estimator (Theorem 2) follows.</p><p>An earlier approach to the assessment of integrated beta is to estimate</p><p>The theory for the estimation (1.2) would seem to go back to <ref type="bibr">Barndorff-Nielsen and Shephard (2004)</ref>, and natural estimators were considered empirically by <ref type="bibr">Andersen et al. (2006)</ref> and <ref type="bibr">Patton and Verardo (2012)</ref>. The advantage of this formulation is that it permits results for covariance (co-volatility) matrices to be directly extended to the estimation of integrated &#946;. This reduces the problem to one that has been given substantial consideration in the literature, and for which there are now already results that cover noise and asynchronicity. (See Footnote 3.) A main disadvantage of estimating (1.2) is that natural estimators are not local in time: if the time interval is a day, then, for example, covariance at 10:45 am is compared with variance at 3:20 pm.</p><p>Notwithstanding the distinction between (1.1) and (1.2), the two quantities are similar if the time span T is comparatively short. They are also the same if &#946; t is constant in t. Constancy tests for betas have been proposed by <ref type="bibr">Todorov and Bollerslev (2010)</ref>, <ref type="bibr">Kalnina (2012)</ref>, <ref type="bibr">Rei&#223; et al. (2015)</ref> and <ref type="bibr">Kong and Liu (2018)</ref>.</p><p>We also point out that the estimators in the current paper are based on the assumption that the latent semi-martingales are continuous. This is substantially more complex for the case where there is microstructure noise and asynchronous observation, and we hope to approach this topic in a later paper.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.2.">Sketch of high (increasing) dimensional regression</head><p>When estimating a high dimensional spot (cross-sectional) covariance matrix, the rank of the estimated matrix is bounded by 2&#8710;T n /&#8710;&#964; n +b,<ref type="foot">foot_0</ref> by construction. This is a severe constraint, even more so than when estimating an integrated matrix. It is thus possible that the rank of the true spot covariance matrix may grow much faster than the given bound.</p><p>To resolve such a contradiction, the main approach in the literature is to rely on sparsity. Our high dimensional realized regression makes use of a time-varying (observed) factor model, where we threshold the residual based on sparsity. This goes back to <ref type="bibr">Bickel and Levina (2008)</ref>. Our development of the large spot precision matrix estimator may be regarded as the ''realized'' and spot (high-frequency) version of <ref type="bibr">Fan et al. (2011)</ref>.</p><p>An estimation theory for high dimensional high frequency integrated covariance matrices has been derived with blockwise-diagonal residual covariance structure in <ref type="bibr">Fan et al. (2016a)</ref>, which was further improved by considering the asynchronous and noisy observations in <ref type="bibr">Dai et al. (2019)</ref>. In both these papers, the factor loadings are assumed to be time-invariant, which is unlike in the current paper.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.3.">Empirical application</head><p>As an application in Section 6, we use high-frequency beta estimation to study the variation of stock betas on earnings announcement days. It is well known in the literature that stock betas tend to be higher around the event days. For example, <ref type="bibr">Ball and Kothari (1991)</ref> documented an increase in daily average beta during the three-day earnings announcement period. <ref type="bibr">Vijh (1994)</ref> found that after being added to S&amp;P 500 index between 1975 and 1989, those stocks displayed higher market beta at daily and weekly frequency. More recently, <ref type="bibr">Patton and Verardo (2012)</ref> estimated daily variations in betas around earnings announcements for all the S&amp;P 500 constituent stocks over the period 1996-2006. They found that the beta increase on announcement day was short-lived and it reverted to average levels two to five days later.</p><p>We investigate hourly beta variation within 5 days of the earnings announcement. Our study follows the spirit of <ref type="bibr">Patton and Verardo (2012)</ref>. While the earlier paper uses daily betas, our current technology permits us to find hourly betas, and thus to understand intra-day variation as well as overnight change in beta. Also, the construction of the beta estimate differs. <ref type="bibr">Patton and Verardo (2012)</ref> used 25-minute intra-day returns (plus the overnight return from the previous day) to construct daily beta estimates. As the authors mentioned, they used the 25-minute sampling interval to reduce the impact of microstructure noise but at the cost of the accuracy of the estimate.</p><p>In the current paper, we construct beta estimates from 5-second pre-averaged returns of S&amp;P 100 constituent stocks from 2007 to 2017, while taking account of the microstructure noise and the cross-sectional asynchronicity. Our hourly betas are unbiased and consistent, thus can more precisely capture the beta dynamics in a shorter time window around the announcements. With the definition of ''Day 0'' as the calendar day of each earnings announcement, we are able to separate the before-and post-market announcement impact on beta change. When the earnings are released in the morning prior to market open on ''Day 0'', we observe substantial beta jump in the first hour (i.e. 10am). On the other hand, when the earnings are announced after market close (4pm), we notice a significant beta jump the following day, again at the first hour. Within the 5-day window (from ''Day -2'' to ''Day +2''), most hourly beta stays at the non-earnings level.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.4.">Organization and notation</head><p>This paper is organized as follows: we first set up the general data structure and define the spot-version of the Smoothed TSRV (S-TSRV, <ref type="bibr">Mykland et al. (2019)</ref>) estimator in Section 2. For fixed dimension, consistency and asymptotic normality are shown theoretically in Section 3, and for high dimension, consistency is shown in Section 4. The results are corroborated by Monte Carlo simulation in Section 5.2. Section 6 conducts an empirical study that applies our methodology to the cross-sectional intraday returns of the components of S&amp;P 100 Index.</p><p>For a matrix A p&#215;q , (A) k,&#8226; denotes its kth row, (A) &#8226;,r denotes its rth column, A (r,k) denotes its (r, k)th element,</p><p>and A &#8890; denotes its transpose. We denote the largest and smallest eigenvalue of matrix A by &#955; max (A) and &#955; min (A), respectively. We denote by &#8741;A&#8741; , &#8741;A&#8741; 1 , &#8741;A&#8741; F , &#8741;A&#8741; max the spectral norm, L 1 -norm, Frobenius norm and elementwise max norm of matrix A, defined as &#8741;A&#8741; = &#955;</p><p>If A is a vector, then &#8741;A&#8741; and &#8741;A&#8741; F are equal to its Euclidean norm. For two sequences, we write</p><p>A number of processes, such as the martingale M, is fully indexed as M (r,s) n,t , where the superscript (r, s) refers to matrix element, and the subscript t refers to time, t &#8712; [0, T ], and n is an index referring to the number of observations. In order to not overburden the paper with super-and subscripts, we do on occasion omit one or several of these. (i) M n,t is a matrix martingale. Further notation in this direction is introduced in Section 3. (ii) Meanwhile, we introduce dependence on n when we gradually get close to asymptotics in Eqs. (2.11)-(2.12), and therefore also in (2.8). However, one should bear in mind that every ingredient in (2.8) depends on sample size n, with the single exception of the latent process (2.1)-(2.2). (iii) In certain equations, such as in Remark 3, the time variable t is omitted in the subscript of the martingale M (r,s) n,t , because the quadratic variation <ref type="bibr">[&#8226;, &#8226;]</ref> t is an operation on the entire path of the martingale, and t is conventionally moved to become a subscript of the quadratic variation instead. Note in particular that M &#8734; (with possibly further indices) always refers to a limit when n has gone to infinity. This is because time t is always finite (&#8804; T ). -Similar considerations apply to other stochastic variables and processes in the following.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Basic setup</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.1.">Data description</head><p>We here provide a description of the data generating process, as well as assumptions that we make on these processes.</p><p>The latent process. For two positive integers q, d &#8805; 1, we work with data discretely sampled from the continuous process</p><p>(2.1)</p><p>The separation of &#926; t into an X t and a Y t process is irrelevant in this section, which is concerned with the estimation of the covariance (volatility) matrix process for &#926; t , but it plays a r&#244;le when studying regression in subsequent sections. We assume that the (&#926; t ) process is a (q + d)-dimensional continuous It&#244; process, i.e., of the following form</p><p>where W is a (q + d)-dimensional standard (F t ) 0&#8804;t&#8804;T -Brownian motion, and X 0 is F 0 -measurable. The coefficients &#181; u and &#963; u are predictable and</p><p>where we use</p><p>(2.4)</p><p>Thus, the integrated covariance matrix of &#926; t may be expressed as:</p><p>(2.5)</p><p>The volatility matrix. We also suppose that c (r,s) t is itself an It&#244; process for any 1 &#8804; r, s &#8804; q + d. In other words, it has the same structure as described above, but is a matrix and not a vector.</p><p>The Observed Process. For 1 &#8804; r &#8804; q+d, the process</p><p>. This yields an observed process &#926; * = ( &#926; * ,(1) , . . . , &#926; * ,(q) , &#926; * ,(q+1) , . . . , &#926; * ,(q+d) )</p><p>, as follows:</p><p>Our assumptions on the data are summarized as follows:</p><p>Condition 1 (Structure of the Data). The data generating process and the observations are as laid out in Section 2.1. The processes &#926; t , &#181; t and &#963; t are adapted to a filtration (F t ). The observation times t n,j are (F t )-stopping times. For each (n, j), the noise &#1013; n,t n,j is F t n,j -measurable, and sup n,j E&#1013; 2 n,t n,j &lt; &#8734;, and E&#1013; n,t n,j = 0. The signal &#926; t may not depend on n.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.2.">Estimator for the integrated covariance matrix: The S-TSRV and its decomposition</head><p>In order to estimate the integrated covariance matrix &#10216;&#926;, &#926;&#10217; t , we construct the smoothed TSRV (S-TSRV) estimator &#10216;&#926;, &#926;&#10217; t on a synchronous grid, as follows.</p><p>where</p><p>and where, 1 &#8804; i &#8804; N and 1 &#8804; r &#8804; q + d, the pre-averaged price is defined as:</p><p>We similarly define J [</p><p>by switching J and K . The Smoothed-TSRV is defined as:</p><p>(2.8)</p><p>We assume the following about the block structure (imposed by the econometrician) and its interface with the data.</p><p>Condition 2 (Structure of Blocks). We assume that the block separation times &#964; n,i are (F t )-stopping times that are ''exogenous'' (independent of the &#926; -process), and that for each n, there are nonrandom &#8710;&#964;</p><p>, and that</p><p>(2.9)</p><p>See Remark 1 below for some clarification of Condition 2.</p><p>Condition 3 (Assumption on the Interface Between Noise and Blocks, and on Averaged Noise). We suppose that E</p><p>). Also let &#949;n,i = &#949;i be the averaged noise across the block from &#964; n,i-1 to &#964; n,i . Assume that the &#1013; n,t n,j process is stationary, exponentially &#945; mixing, and that there is a constant &#954; &gt; 0 so that E&#1013; 4+&#954; n,t n,j &lt; &#8734;. 5 Define the sequence {a n } n&#8805;1 by</p><p>(2.10)</p><p>5 Condition 3 is one of several ways to assure Cov For the relationship to the latter, observe that since</p><p>.</p><p>and note that a n &#8594; 0 as the number of observations n &#8594; &#8734; by Condition 2. Under Conditions 1-3, it follows from <ref type="bibr">Mykland et al. (2019, Section 5, pp. 110-111)</ref>  <ref type="foot">6</ref> that</p><p>where c (r,s) is the (r, s)th element of c from (2.4), and there the M n,t /a n converges stably in law to a continuous martingale limit.</p><p>Remark 1 (The Meaning and Size of K n , J n , and a n ). We here explain that the order of convergence a n can be up to n -1/4 , but that this rate cannot be attained within the development of this paper. To see this, return to Condition 2, and consider the simplified case where M n,i only depends on n, i.e., M n,i = M n . In this case, K n -</p><p>) is desirable since it assures an optimal tradeoff between statistical error due to signal and to noise <ref type="bibr">(Mykland et al., 2019, end of Section 5, p. 111)</ref>. The same discussion shows that if Eq. (2.9) were removed from Condition 2, one might choose N n and M n to be of exact order O(n 1/2 ), and K n and J n would be finite. In this case, a n is of exact order n -1/4 . However, (2.9) is necessary for the representations (2.13)-(2.15), cf. <ref type="bibr">Chen et al. (2020, Appendix A)</ref>. We believe that it is possible to create an asymptotic development that does not require (2.9), since the finite sample calculations in <ref type="bibr">Mykland et al. (2019)</ref> remain valid in this case, but this is beyond the scope of this paper. Meanwhile, the current paper should be read with the understanding that a n is almost n -1/4 , and that K n and J n are approximately finite (they grow arbitrarily slowly).</p><p>Remark 2. The selection of the tuning parameters (''scales'') K n and J n is an area which remains more art than science.</p><p>For low dimensional problems, one can proceed through signature plots on estimated volatilities, introduced by <ref type="bibr">Andersen et al. (2000)</ref> and their co-authors. Signature plot was used to determine K n and J n in multiple dimensions in <ref type="bibr">Zhang (2011, Fig. 2, p. 42)</ref>. For moderate dimension regression problems, one option is the signature plot of integrated beta, as in Fig. <ref type="figure">5</ref>.2 in Section 5. For truly high dimensional problems, an attractive approach is to use signature plots on eigenvalues <ref type="bibr">(Chen et al., 2020, Fig. 2, p. 13</ref>). We have not gone into this detail in this paper, but Fig. <ref type="figure">5</ref>.3 (also Section 5) plots the spectral norm (also an eigenvalue) of the error of the final precision matrix estimator (the red curve in the plot). Finally, note that for the S-TSRV, the scales are expected to be approximately finite (Remark 1 above), while for the original TSRV <ref type="bibr">( Zhang et al. (2005)</ref>), especially K n will grow with sample size n.</p><p>We shall need a slightly sharper representation under the same assumptions. For 1 &#8804; r &#8804; q+d, define &#8710;&#926; (r)</p><p>&#964; i-1 , the estimation error can be written as follows:</p><p>(2.12)</p><p>where the subscript n has been omitted on the right hand side, and below until Eq. (2.15), for notational convenience, and where the martingale term may be expressed as:</p><p>and the edge effect terms e</p><p>(r,s) 0 and &#7869;(r,s) t has the order of O p ( a 2 n )</p><p>, which may be further expressed as:</p><p>(2.14)</p><p>(2.15)</p><p>The representation and rates in (2.13)-(2.15) follow from <ref type="bibr">Chen et al. (2020, Appendix A)</ref>.</p><p>Remark 3 (Assumption on Asymptotic Covariance). Let M (r,s) n,t be as defined in (2.12) and (2.13). Since the above development guarantees that a -1 n M (r,s) n , 1 &#8804; r, s &#8804; q + d, converge jointly in law (as continuous martingales) to a limit M (r,s)</p><p>&#8734; . Following <ref type="bibr">Jacod and Shiryaev (2003, Corollary 6.30, p. 385)</ref>, it is then also the case that for the optional (''observed'') quadratic variations,</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.3.">The estimation of the spot volatility matrix</head><p>For the simplicity of discussion, we define the spot volatility estimator &#265;(r,s) &#8710;Tn,t for some &#8710;T n &gt; 0 as follows:</p><p>&#265;(r,s)</p><p>(2.16)</p><p>where {&#8710;T n } n&#8805;1 is a sequence of positive numbers satisfying</p><p>(2.17)</p><p>Moreover, to facilitate the theory development, we define c(r,s) &#8710;Tn,t = 1 &#8710;T n &#8747; t+&#8710;Tn t c (r,s) u du, &#960;(r,s) &#8710;Tn,t = c(r,s) &#8710;Tn,t -c (r,s) t and &#960; (r,s) &#8710;Tn,t = &#265;(r,s) &#8710;Tn,t -c(r,s) &#8710;Tn,t , (2.18) and &#960;(r,s) &#8710;Tn,t = 1 &#8710;T n ( M (r,s) t+&#8710;Tn -M (r,s) t ) and &#951; (r 1 ,s 1 ,r 2 ,s 2 ) &#8710;Tn,t = &#960; (r 1 ,s 1 ) &#8710;Tn,t &#960; (r 2 ,s 2 ) &#8710;Tn,t -&#960;(r 1 ,s 1 ) &#8710;Tn,t &#960;(r 2 ,s 2 ) &#8710;Tn,t .</p><p>(2.19)</p><p>We now list several useful results of spot volatility estimator.</p><p>Lemma 1. Assume Conditions 1-3, as well as Condition (2.17). Then we have: (i)</p><p>(2.20)</p><p>(2.21)</p><p>(2.22)</p><p>(2.23)</p><p>Proof. The proof of this lemma is collected in Appendix A. &#9633;</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Multiple regression</head><p>In multiple regression, it is possible that q, d &gt; 1 in the definition (2.1) of (&#926; t ) 0&#8804;t&#8804;T . Without loss of generality, we denote X = ( X (1) , . . . , X (q) ) = ( &#926; (1) , . . . , &#926; (q) ) and we let Y be a scalar process, so that Y = &#926; (q+l) for some 1 &#8804; l &#8804; d. It is natural to use the following notations: &#10216;X,</p><p>, and &#10216;X,</p><p>For the convenience of notation, we define</p><p>c X,X t = { c (r,s) t } 1&#8804;r,s&#8804;q &#60697; &#60696;&#60695; &#60698; q&#215;q matrix process and c X,Y t = { c (r,q+1) t } 1&#8804;r&#8804;q &#60697; &#60696;&#60695; &#60698; q&#215;1 column vector process . (3.1)</p><p>We analogously define the related matrix and vector quantities for M, c, &#265;, &#960; , &#960; , &#960; , &#966;, &#7869; an e.</p><p>Suppose that the processes are related by</p><p>for all t and k.</p><p>(3.2)</p><p>If we assume that &#946; = ( &#946; (1) , . . . , &#946; (q) ) is a q &#215; 1 column vector process, then the quadratic variation of the residual process may be expressed as:</p><p>To find min &#946; &#10216;Z, Z &#10217; T , and assuming c X,X s is positive definite almost surely for all 0 &#8804; t &#8804; T , we solve the identity -2c X,Y s + 2c X,X s &#946; s = 0, and finally obtain the unique solution as follows:</p><p>The spot beta estimator is naturally constructed as:</p><p>) -1 &#265;X,Y &#8710;Tn,T i-1 .</p><p>(3.5)</p><p>The quantity in which we are interested is:</p><p>and its estimator is given by,<ref type="foot">foot_3</ref> :</p><p>We first show the consistency of &#952;n . For the simplicity of discussion, we define an intermediate process:</p><p>With this smoothed beta, the estimation error of &#946;&#8710;Tn,T i-1 can also be decomposed into two parts, Moreover, the estimation error may be decomposed as follows:</p><p>Discretization error, R Discrete .</p><p>(3.7)</p><p>Then we can show the representations of these two types of estimation error. There representations matter both in the proofs, and also in Section 3.1.</p><p>We presently state the consistency of spot beta estimator &#946;&#8710;Tn,T i-1 . For this, we need an additional assumption about spot covariance matrix.</p><p>Condition 4. There are constants &#977; 1 , &#977; 2 &gt; 0 such that inf 0&#8804;t&#8804;T &#955; min ( c X,X t ) &gt; &#977; 1 and sup 0&#8804;t&#8804;T &#8741;c t &#8741; max &lt; &#977; 2 almost surely.</p><p>Condition 4 can, obviously, be localized just as in (2.3), cf. Jacod and Protter (2012, Chapter 4.4.1, pp. 114-121) and <ref type="bibr">Mykland and Zhang (2012, Chapter 2.4.5, pp. 160-161)</ref>.</p><p>Lemma 2 (Consistency of &#952;n ). Assume Conditions 1-4. Assume that the number of regressors q is finite, and &#8710;T n satisfies (2.17). Then, for any &#1013;, 0 &lt; &#1013; &lt; 1/2, we have:</p><p>and &#952;n&#952; = o p (1) .</p><p>Proof. The proof of this lemma is collected in the Appendix B. &#9633;</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">Asymptotic bias of the na&#239;ve regression estimator</head><p>When &#8710;T n &#8594; 0 and inf n a -1 n &#8710;T n &gt; 0, the discretization error R Discrete (Eq. (3.7)) becomes the dominating term in the estimation error of &#952;n . However, in this scenario, it cannot achieve the optimal convergence rate. Consequently, we consider the setting of a -1 n &#8710;T n &#8594; 0 and a -2 n &#8710;T n &#8594; &#8734;. In this scenario, the aggregated error of &#946;&#8710;Tn,T i-1 , R Spot becomes the dominating term. By further analyzing the aggregated error R Spot , it is easy to show that there is a bias term arises in R Spot , which has bigger size than the martingale term. In the following theorem, we provide the representation of the bias term so that we can design the bias-corrected estimator in the subsequent subsection. For ease of exposition, this result is stated in the simple regression case only.</p><p>Theorem 1 (Second Order Behavior of &#952;n in the Univariate Case).</p><p>Assume that q = d = 1, as well as Conditions 1-4. and also that a -1 n &#8710;T n &#8594; 0 and a -2 n &#8710;T n &#8594; &#8734;. Then we have:</p><p>where</p><p>) .</p><p>Proof. The proof of this theorem is collected in the Appendix C. &#9633;</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">Bias corrected estimator and CLT for multiple regression</head><p>Similar to the single regressor case, the size of bias term is bigger than the martingale term when a -1 n &#8710;T n &#8594; 0. Thus, in order to develop the CLT, we need to construct the bias corrected estimator. For 1 &#8804; r, s &#8804; q + d, we define</p><p>) .</p><p>(3.8)</p><p>The bias corrected estimator is defined as:</p><p>and &#966;X,X,X,X &#8710;Tn,T i-1 = &#966;X,X &#8710;Tn,T i-1</p><p>where &#966;X,Y &#8710;Tn,T i-1</p><p>and &#966;X,X &#8710;Tn,T i-1 is defined in (3.8) and with the notations "X,Y " and "X, X" that follow from the conventions of (3.1), respectively.</p><p>Before stating the Central Limit Theorem (CLT), we introduce the following notation. Recall the definition of</p><p>Finally, the CLT for &#952;n can be stated as follows.</p><p>Theorem 2 (Central Limit Theorem for &#952;n ). Assume all conditions in Lemma 2 and further assume that a -1 n &#8710;T n &#8594; 0 and a -3/2 n &#8710;T n &#8594; &#8734;. Then we know that there is a q &#215; q matrix process (&#931; t ) 0&#8804;t&#8804;T defined in (3.11), such that</p><p>where the convergence is stable in law, N q (0, &#931; T ) is a q-dimensional normal distribution with mean 0 and covariance matrix as &#931; T .</p><p>Proof. The proof of this theorem is collected in the Appendix E. &#9633; Moreover, following the idea of <ref type="bibr">Mykland and Zhang (2017)</ref>, it is straightforward to see that the asymptotic variance estimator could be constructed as follows:</p><p>) -1 ,</p><p>where</p><p>and &#966;X,X &#8710;Tn,T i-1</p><p>being defined in (3.8) and the notations "X,Y " and "X, X" following from the conventions of (3.1), respectively.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">High dimensional factor model</head><p>We again start by adjusting the notation. In the case of high dimensional factor model, we assume that q, d &gt; 1, with d typically much larger than q. Specifically, q is asymptotically ''almost'' finite (see Condition 5 below), while d &#8594; &#8734; as n &#8594; &#8734;. As foreshadowed in (2.1), denote</p><p>) .</p><p>It is then also natural to use the following notations:</p><p>&#10216;X, X&#10217; t = {&#10216; &#926; (r) , &#926; (s) &#10217; t } 1&#8804;r,s&#8804;q , &#10216;X, Y&#10217; t = {&#10216; &#926; (r) , &#926; (q+l) &#10217; t } 1&#8804;r&#8804;q,1&#8804;l&#8804;d , &#10216;X, X&#10217; t = { &#10216;&#926; (r) , &#926; (s) &#10217; t } 1&#8804;r,s&#8804;q , and &#10216;X, Y&#10217; t = { &#10216;&#926; (r) , &#926; (q+l) &#10217; t } 1&#8804;r&#8804;q,1&#8804;l&#8804;d . For the spot quantities, we define c X,X t as in (3.1), and define c X,Y t = { c (r,q+l) t } 1&#8804;r&#8804;q,1&#8804;l&#8804;d</p><p>, which is a q &#215; d matrix process, and</p><p>, which is a d &#215; d matrix process.</p><p>(4.2)</p><p>Following the similar convention, we define the related matrix and vector quantities for M, c, &#265;, &#960; , &#960; , &#960; , &#966;, &#7869; an e. Then it is easy to see that in matrix form,</p><p>which is defined in (2.16).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">Specification of the factor model</head><p>The log-price process</p><p>of d stocks is generated from a multiple regression, also known as a ''supervised'' factor model:</p><p>where</p><p>is a q &#215; 1 vector process, denoting a set of time-varying common regressors or factors, B t is a d &#215; q matrix process of time-varying factor loadings and</p><p>&#10216;X, Z&#10217; t = 0 for all t , (4.5) cf. <ref type="bibr">Mykland and Zhang (2006)</ref>. The difference from an unsupervised factor model, is that in our current case, the factors X t are observed, though with noise, and at asynchronous discrete times, as in Section 2.1. It is straightforward to see that</p><p>where s t = &#10216;Z, Z&#10217; &#8242; t , in view of (3.1), and (4.2). In this paper, we adopt the sparsity structure for s t , which is measured by</p><p>for some &#957; &#8712; (0, 1) ,</p><p>)</p><p>. This measure is widely used in existing literature, i.e., <ref type="bibr">Bickel and Levina (2008)</ref> and <ref type="bibr">Cai and Liu (2011)</ref> and as pointed out by <ref type="bibr">Fan et al. (2013)</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Least quadratic variation (LQV) optimization</head><p>In this case, the factors are observable. Thus, in order to get the estimates of factor loadings B t , we use the least quadratic variation (LQV) method:</p><p>tr &#10216;Z, Z&#10217; t .</p><p>Based on the similar derivation of (3.4), the LQV solution of factor loading can be expressed as:</p><p>). Therefore, by the formula (4.7), the LQV solution for the spot idiosyncratic covariance matrix is:</p><p>where</p><p>(4.9)</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.3.">Estimators and convergence rates</head><p>We define the related estimators as follows:</p><p>where &#265;X,X t , &#265;X,Y t and &#265;Y,Y t are defined in (4.3). In the case of high dimensional factor models, we allow the number of common factors to diverge slowly, as the cross-sectional dimension d goes to infinity. The detailed technical assumption is stated as follows.</p><p>Condition 5. For the number of common factors q, we assume that q = o (d) and q 4 &#8710;T n log d = o (1).</p><p>We now show the result for convergence rate of &#265;B&#8226;X t under elementwise max norm. Define:</p><p>with &#8710;T n &#8781; a n . Assume Conditions 1-5. The following is then valid:</p><p>where &#969; n is defined in (4.11). Consequently by the triangular inequality and formulas (4.8) and (4.10), we obtain:</p><p>Proof. The proof of this theorem is collected in the Appendix G. Specifically, (4.12) is a consequence of Lemma 3, while (4.13) follows from (G.6). &#9633; Now we apply the adaptive thresholding on &#349;t . Denote the thresholding estimator by &#349; * t , defined as follows:</p><p>where &#966; ij is the adaptive thresholding rule, for z &#8712; R,</p><p>, soft thresholding, SCAD and the adaptive lasso, i.e., see <ref type="bibr">Rothman et al. (2009)</ref> and <ref type="bibr">Fan et al. (2016b)</ref>. Because of the absence of residuals, the standard error estimator of &#349;(i,j) t cannot be easily obtained. Thus, in contrast to the settings of &#967; ij in <ref type="bibr">Fan et al. (2013)</ref>, the thresholding parameter are set to be elementwise constant, i.e., defined as:</p><p>with a sufficiently large C &gt; 0. Before stating the results of the thresholding estimator, we first make one assumption about the spot residual covariance matrix. Condition 6. For the spot residual covariance matrix s t , there exist constants &#977;</p><p>Based on the result in Theorem 3, we obtain the following proposition.</p><p>Proposition 1. Assume Conditions 1-6. Then, for a sufficiently large C &gt; 0 in the thresholding parameter (4.14), the estimator for the sparse residual covariance matrix satisfies:</p><p>) .</p><p>If &#969; 1-&#957; n m d = o p (1) is assured, then the eigenvalues of &#349; * qt ,t are all bounded away from 0 with probability approaching 1, and</p><p>) .</p><p>Proof. The proof of this proposition directly follows from the similar discussions in the proof of Theorem 5 of <ref type="bibr">Fan et al. (2013)</ref>. &#9633;</p><p>Next, let us define the spot covariance matrix estimator based on the thresholding estimator as follows:</p><p>&#265;Y,Y, *</p><p>Then we consider the estimation performance of precision matrix based on</p><p>. The theoretical development is based on the Sherman-Morrison-Woodbury formula, i.e., recall the formulas (4.8) and (4.9), we obtain:</p><p>We first assume the pervasiveness of the common factors by the following technical assumption, which is parallel to the Assumption 3.5 in <ref type="bibr">Fan et al. (2011)</ref>.</p><p>(1) for some q &#215; q symmetric positive definite matrix &#8486; t and some constants &#977; &#8242; 3 , &#977; &#8242; 4 &gt; 0 such that (i) inf 0&#8804;t&#8804;T &#955; min (&#8486; t ) &gt; &#977; &#8242; 3 almost surely;</p><p>(ii) if q &#8594; &#8734; as n, d &#8594; &#8734;, we further assume sup 0&#8804;t&#8804;T &#955; max (&#8486; t ) &lt; &#977; &#8242; 4 almost surely.</p><p>Then we show the convergence rate for the estimator of the precision matrix as follows.</p><p>Theorem 4. Assume Conditions 1-7. Also suppose that &#969; 1-&#957; n m d = o p (1).</p><p>Then, for a sufficiently large C &gt; 0 in thresholding parameter (4.14), ( &#265;Y,Y, * t ) -1 is non-singular with probability approaching 1, and</p><p>) .</p><p>&#8710;Tn,t with simple CV: &#265;t = 1 kn&#8710;&#964;n &#8721; N * (t)+kn j=N * (t)+1 &#8710;&#926; &#964; j &#8710;&#926; &#8890; &#964; j (without noise) and &#265;t = 1 kn&#8710;&#964;n &#8721; N * (t)+kn j=N * (t)+1 &#8710;&#926; * &#964; j ( &#8710;&#926; * &#964; j ) &#8890;</p><p>(with noise). The number of simulation trials is 10000. The examination is conducted under different settings of sampling frequency. The sampling frequency is set in two scenarios:</p><p>1. &#8710;&#964; n = 5 seconds and &#8710;T n = 468&#8710;&#964; n , with K = 20, J = 3. 2. &#8710;&#964; n = 15 seconds and &#8710;T n = 156&#8710;&#964; n , with K = 10, J = 3.</p><p>Table <ref type="table">5</ref>.1 shows that in the presence of microstructure noise, the estimator based on Simple CV becomes inconsistent: it tends to under-estimate the market beta</p><p>t dt, and over-estimate the other non-market betas</p><p>t dt and &#8747; T 0 &#946; (3) t dt. When &#8710;&#964; n = 5 seconds, the magnitude of the estimation bias for &#8747; T 0 &#946; (1)   t dt is 26.8% of the averaged true value and the bias magnitude for &#8747; T 0 &#946; (2)   t dt and &#8747; T 0 &#946; (3)   t dt are 81.6% and 230.2% comparing to their averaged true values. It also appears that the estimation bias (under the market microstructure noise) becomes more severe as the length of the sampling interval &#8710;&#964; n decreases from 15 to 5 seconds. On the other hand, our proposed estimator (based Smoothed TSRV) is well behaved, regardless of the sampling interval.  To validate the asymptotic behavior of the bias corrected estimator, the finite sample distribution of the standardized statistics are reported in Fig. <ref type="figure">5</ref>.1, where &#8710;&#964; n = 5 seconds. Note that the standardized statistics are calculated by the This figure presents the signature plot for the estimates of integrated market beta</p><p>t dt in the presence of market microstructure noise. ''Estimator 1'' denotes the integrated beta estimate based on the Simple CV estimator with subsampled data. ''Estimator 2'' denotes integrated beta estimate proposed in this paper which is based on Smoothed TSRV. following formulas</p><p>where &#952;(k) n is defined in (3.9) and &#931;(k,k)</p><p>T is defined in (3.13). In Fig. <ref type="figure">5</ref>.1, the finite sample distributions are approximately normal, with slight fat-tailed. It is worth to emphasize that the edge effects can greatly affect the validity of the asymptotic normality in this scenario (i.e., in practice, T /&#8710;T n should be a positive integer exactly).</p><p>As sampling interval increases, say, to 5 minutes or 10 minutes, one could expect the bias of the integrated beta estimate using simple CV goes down. However, its variance increases at the same time. This phenomenon is demonstrated in the signature plot Fig. <ref type="figure">5</ref>.2. So, even when one samples very 10 minutes, we still recommend our proposed estimator because of its precision.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.3.">Simulation results for high dimension</head><p>For d large, we next show the performance of the estimator of the precision matrix</p><p>, as d gets large. The simulation setting remains the same as in Section 5.1. For ease of demonstration, we fix &#8710;&#964; n = 5 seconds.</p><p>Consider the spectral norm of the estimation error of the precision matrix, as defined in Theorem 4, as the error measure, i.e.</p><p>(5.3) As in Fig. <ref type="figure">5</ref>.3, we see that in the presence of microstructure noise, the precision matrix using Smoothed TSRV performs satisfactorily, with contained error (red line) even at high dimensionality situation. However, the precision matrix using simple CV gets worse as d increases from 5 to 200, with error increasing in logarithmic shape.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Empirical study</head><p>In this section, we apply high frequency beta estimation to study the variation of stock betas on earnings announcement days. We implement the high frequency regression of the intraday returns of the S&amp;P 100 constituent stocks on the returns of exchange-traded fund OEF. The latter serves as a proxy for the large-cap market returns. The trade prices are extracted from the Trade and Quote (TAQ) database of the New York Stock Exchange (NYSE). In particular, we collect the intraday trade prices of OEF as well as those of the S&amp;P 100 Index constituents, between 9:35 a.m. EST and 3:55 p.m. EST of each This figure compares the estimation performance of the large precision matrix in the presence of microstructure noise. The precision matrix using Smooth TSRV is indicated by red solid line, while the one using simple CV is in blue dashed line. The error measure on y-xis is as defined in (5.3). trading day, from January 2007 to December 2017 (2769 trading days in total). Our spot beta estimate is then applied to explore the change in betas around the earning announcements.</p><p>For the earning data, the dates and times of quarterly earnings announcements are downloaded from the Thomson Reuters I/B/E/S database for the components of S&amp;P 100 Index ranging from January 2007 to December 2017. The earnings announced at non-trading days are deleted. At the end, 3845 earnings announcements are collected during this sampling period. We can see from Fig. <ref type="figure">6</ref>.1 that for the stocks in our sample, most earnings announcements arrived right before the market open (6-8 AM) or right after market close (4-5 PM).</p><p>To investigate the beta changes on earnings announcement days, we extended the model in Patton and Verardo (2012) 9   by adding the hourly effects. Specifically, we regress the market beta estimates &#946; OEF i,t on event time dummies using the following model:</p><p>2 16 &#8721; k=10 &#948; j,k I i,j,k,t + &#947; i,1 D 1,t + &#947; i,2 D 2,t + &#8226; &#8226; &#8226; &#947; i,10 D 10,t + &#949; i,t , (6.1) where &#946; OEF i,t is the spot beta estimates of stock i on time t by using the following formula, with &#265;OEF, stock i and &#265;OEF,OEF being the Smoothed TSCV and Smoothed TSRV estimates, &#946; OEF i,t = &#265;OEF, stock i &#8710;Tn,t &#265;OEF,OEF &#8710;Tn,t , 9</p><p>We should note that we deviate from <ref type="bibr">Patton and Verado (2012)</ref> in how to define event day. The former paper relabeled the announcement at or after 4:00 p.m. on a given date to have the following trading day's date. In contrast, we follow the exact calendar day when labeling the announcement day. In other words, ''Day 0'' in our paper is the day when the earnings are announced, no matter the announcement time is pre-market, during market open, or post-4 pm.  of market open time. The news in the final hour of trading period may also contribute to the beta increase in the next morning.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.">Conclusion</head><p>The central contribution of this paper is a feasible estimator of spot beta, which is robust to noise and asynchronicity. With the help of the spot-version of the Smoothed TSRV estimator, spot beta can be consistently estimated. There are two direct applications of the spot beta estimates in the current paper. In the first application, the integrated beta can be consistently estimated by aggregating the spot beta estimates. After a bias-correction procedure, a fixed dimension central limit theorem is established for the bias-corrected estimator, with convergence rate which may be arbitrarily close to O p (n -1/4 ). In the second application we assume time-varying factor structure and conditional sparsity. The spot beta matrix estimator enables the estimation of high dimensional spot covariance and precision matrices. Simulation results show that our proposed estimators perform well.</p><p>As an empirical application, this paper explores the hourly change in beta around earnings announcements of the S&amp;P 100 constituents. The hourly beta was constructed with the help of Smooth TSRV using 5-second pre-averaged returns from 2007 to 2017. We separate the impact of pre-and post-market announcement on beta change, and find that significant beta change takes place in the first hour of market open. </p></div><note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="4" xml:id="foot_0"><p>Here &#8710;T n and &#8710;&#964; n are as described above, and b is a very slowly growing number, cf. Eq. (2.7) and Remark 1 in Section 2.2.</p></note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" xml:id="foot_1"><p>Journal of Econometrics 239 (2024) 105446</p></note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="6" xml:id="foot_2"><p>Here and below, the effect of the drift term is negligible, cf. Mykland and Zhang (2009, Section 2.2, pp. 1407-1409).</p></note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="7" xml:id="foot_3"><p>Cf.Mykland  and Zhang (2009, Section 4.2, pp. 1424-1428) Zhang (2012, Section 4).</p></note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="8" xml:id="foot_4"><p>this is similar to A&#239;t-Sahalia and Xiu (2019) with &#952; &#957; = 0.06 and &#951; &#957; = 0.3</p></note>
		</body>
		</text>
</TEI>
