HIGH MOMENT PARTIAL SUM PROCESSES OF RESIDUALS IN GARCH MODELS AND THEIR APPLICATIONS 1
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper we construct high moment partial sum processes based on residuals of a GARCH model when the mean is known to be 0. We consider partial sums of kth powers of residuals, CUSUM processes and self-normalized partial sum processes. The kth power partial sum process converges to a Brownian process plus a correction term, where the correction term depends on the kth moment µk of the innovation sequence. If µk = 0, then the correction term is 0 and, thus, the kth power partial sum process converges weakly to the same Gaussian process as does the kth power partial sum of the i.i.d. innovations sequence. In particular, since µ1 = 0, this holds for the first moment partial sum process, but fails for the second moment partial sum process. We also consider the CUSUM and the self-normalized processes, that is, standardized by the residual sample variance. These behave as if the residuals were asymptotically i.i.d. We also study the joint distribution of the kth and (k + 1)st self-normalized partial sum processes. Applications to change-point problems and goodness-of-fit are considered, in particular, CUSUM statistics for testing GARCH model structure change and the Jarque– Bera omnibus statistic for testing normality of the unobservable innovation distribution of a GARCH model. The use of residuals for constructing a kernel density function estimation of the innovation distribution is discussed.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it