- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work investigates statistical inference for Polyak–Ruppert averages of stochastic recursions based on estimating equations. These recursions incorporate fixed, stable, finite-dimensional score filters—such as scalar or coordinate-wise momentum terms, fixed preconditioners, and higher-order filters. Furthermore, the work develops a Wald-type online inference approach that employs an estimator for the Jacobian matrix based on residual kernels—specifically within the context of quantile regression.
Critical strengths
-
The transformation leads to the stated exact recursion, and $ (KA)^{-1}K=A^{-1} $ correctly accounts for "gain cancellation" without requiring and to commute. The proof of Theorem 3.4 incorporates the relevant boundary terms, terms accounting for variations in step size and scores, as well as the nonlinear residual terms.
-
The requirement that the "population score"—as opposed to the scores of individual samples—must be differentiable allows for the inclusion of quantile regression in a natural way. In this context, the computable evaluation of the kernel-Jacobian matrix is significant.
-
The paper correctly treats the endpoint as an independent coordinate, given that evaluation at is not continuous in space. The mapping onto the integrated self-normalizer is continuous within the proposed topology; furthermore, the proof addresses the positive-definite property of the limiting matrix, which is based on a Brownian bridge.
-
The paper distinguishes between covariance consistency and asymptotic normality, and provides a fully specified example of a projected quantile regression. Moreover, the paper critically examines the limitations of its simplified reference models, the use of a fixed numerical ridge regularization, and the illustration of the approach using real-world data.
Critical weaknesses
-
Assumption 3.3 presupposes long-term localization, a mean-square convergence rate with , a uniformly bounded second moment of the filter state, and a negligible accumulated nonlinear residual term. Demonstrating these properties is a fundamental aspect of the stochastic approximation problem. While Theorems C.5 and C.6 provide useful sufficient conditions for the scalar momentum approach, no such proof exists for coordinate-wise filters or two-pole filters.
-
The diagnostic procedure based on equal-sized blocks employs a growth rule for the block size—a rule that the article itself acknowledges may not dominate the correlation length of the trajectory. Similarly, the approach using smoothed quantiles utilizes an uncorrected interval and does not represent a calibrated implementation of the cited methods. Consequently, the resulting significant undercoverage (falling well below the nominal coverage probability) offers only limited evidence of an advantage over the aforementioned methods. Furthermore, Table 2 compares Wald-type intervals—based on the average of extreme values (“tail-average”)—with self-normalized intervals based on the average over the entire range (“full-average”); in this comparison, both the point estimator and the normalization method are varied. Although this is addressed in the text, it precludes a clear attribution of the observed differences in coverage probability. Providing data on interval lengths and bias, as well as comparisons based on identical averaging windows, would be more informative than focusing exclusively on coverage probability and RMSE. 3. The greatest improvement is observed in a scenario selected via preliminary tests (pilot experiments) based on the least-squares method; Appendix A.1 notes that the selection criterion also included a requirement for bias reduction. While independent replications confirm the result reported for this specific configuration, they do not demonstrate robustness against slightly altered settings or separately optimized SGD-based benchmarks (baselines).
-
The simulations employ a fixed ridge parameter, even though consistency would require the condition . In the general case, a fixed leads to the following limiting approximation of the inverse: $ R_\lambda = (A^\top A + \lambda I)^{-1} A^\top, $ which results in a covariance matrix that generally differs from .
-
Minor points:
-
Specify the matrices used in the experiments involving coordinate and two-pole filters; the specific coefficients for the coordinate filters are not provided in the manuscript. – Reformulate the requirement for a positive ridge parameter that approaches zero in Theorem 3.11 so that the statement regarding the consistency of the inverse is self-contained.
-
Include a concise table summarizing the assumptions, distinguishing between the requirements imposed on the estimator (central limit theorem, covariance consistency, limit for integrated paths, and limit for uniform paths). - Consolidate redundant definitions and move the verified example of a non-smooth case closer to the main results. – Correct the incomplete phrasing “supports both inference and self-normalized inference” in Section 5, line 477.
Questions for authors
-
Can you state the fundamental stability and convergence rate conditions for the coordinate and two-pole filters, and explain which non-projected simulation configurations are covered by a complete verification of Assumption 3.3?
-
Can you provide a specific model or a set of trajectories for which Theorem 3.7 holds, but the additional maximal condition (20) is not satisfied—or for which even stronger assumptions are required?
-
Does the advantage gained by the least-squares approach at persist when varying step sizes, momentum coefficients, dimensions, and time horizons—even if the SGD method is granted its own dedicated optimization budget?
-
How sensitive are the coverage results to a "vanishing ridge scheme" and to the kernel bandwidth? Can you quantify the numerical objective error in the experiments involving misspecified logistic models, and provide the exact filter matrices required to reproduce the comparisons?
8 comments
Part 2/6 of our response to Reviewer PyTh (continued): W2 continued: Tables R1–R3; W3, Table R4, and the W4 introduction.
Table R1. Quantile regression with data-only tuning and fresh paired evaluation. Coverage is for the nominal first-slope Wald interval; RMSE is and length is the mean interval length. Dimension is except in the last row. All methods use the nonsmooth score, the same inference construction and the same selection budget.
| SGD | Momentum | |||||
|---|---|---|---|---|---|---|
| Setting | Coverage | RMSE | Length | Coverage | RMSE | Length |
| Median , het. | 0.956 | 0.00478 | 0.02588 | 0.950 | 0.00487 | 0.02588 |
| Upper exponential, het. | 0.954 | 0.01889 | 0.09265 | 0.974 | 0.01806 | 0.09252 |
| Upper exponential, hom. | 0.952 | 0.01980 | 0.08342 | 0.960 | 0.01977 | 0.08348 |
| Lower exponential, hom. | 0.970 | 0.00227 | 0.00941 | 0.954 | 0.00228 | 0.00930 |
| Median , het., | 0.958 | 0.00463 | 0.02793 | 0.968 | 0.00461 | 0.02784 |
Table R2. Additional upper-quantile diagnostics for normalized momentum, . Wald and self-normalized (SN) full-window intervals share the same point estimator. These are fresh evaluations, distinct from the original quantile evaluations. The tail average uses the last of iterations, ; the Jacobian uses the full history.
| Diagnostic | Asymmetric, heteroscedastic | |
|---|---|---|
| Full-average Wald coverage | 0.842 | 0.768 |
| Full-average SN coverage | 0.790 | 0.848 |
| Wald minus SN coverage | 0.052 | |
| Full-average Wald mean length | 0.04909 | 0.03387 |
| Full-average SN mean length | 0.05421 | 0.05029 |
| Full-average intercept bias | 0.01005 | 0.00999 |
| Tail-average Wald coverage | 0.936 | 0.964 |
| Tail-average intercept bias | 0.00721 | 0.00405 |
Table R3. Paired comparisons in the high-dimensional least-squares setting. Differences use momentum minus SGD. RMSE differences use the unrounded estimates and can differ slightly from subtraction of displayed RMSEs. Both tuning rules used simulation truth.
| Quantity | Original common tuning | Separate equal-budget tuning |
|---|---|---|
| Coverage difference | 0.054 | 0.076 |
| RMSE difference | ||
| Mean length: momentum | 0.06559 | 0.06644 |
| Mean length: SGD | 0.06711 | 0.06522 |
W3. For the general inverse in equation (5), a fixed leads to
\qquad R_\lambda S R_\lambda^\mathsf T,$$ which generally differs from $A^{-1}SA^{-\mathsf T}$. For the direct quantile inverse, a fixed ridge similarly gives $(A_\tau+\lambda I)^{-1}$ rather than $A_\tau^{-1}$. The fixed $10^{-6}$ ridge in the submitted experiments is a numerical choice; the theoretical guarantee uses a positive vanishing ridge. We state the ridge condition explicitly: “Let $\lambda_n > 0$ be a deterministic sequence with $\lambda_n\to0$.” The additional paired check in Table R4 compares the fixed ridge with two sequences that satisfy this condition. Their empirical coverages agree in this design and their interval lengths are close. This addresses sensitivity at the reported horizon without changing the theorem's requirement. **Table R4.** Ridge sensitivity for the upper-tail asymmetric heteroscedastic quantile design (intercept, matching Table 2), using paired recursions and direct ridge of the online quantile Jacobian. | Ridge | Coverage | Mean interval length | | --- | --- | --- | | Fixed $10^{-6}$ | 0.948 | 0.05865 | | $\lambda_n=n^{-1}$ | 0.948 | 0.05864 | | $\lambda_n=n^{-3/4}$ | 0.948 | 0.05847 | **W4.** The filter realizations in Part 3/6 give explicit normalized coordinate and two pole realizations and their gains. The coordinate coefficients reported in the numerical response are $\beta_j=0.5+0.45(j-1)/(d-1)$ for the simulated $d > 1$, and the cascade poles are $(a,b)=(0.5,\beta)$. We specify the stage order directly in the equations in Part 3/6: the second stage uses the current first-stage state. **Ridge condition.** We state explicitly: “Let $\lambda_n > 0$ be a deterministic sequence with $\lambda_n\to0$.” *Continued in Part 3/6: W4 continued: assumption map, Table R5, filter realizations, and Q1 introduction.*Part 3/6 of our response to Reviewer PyTh (continued): W4 continued: assumption map, Table R5, filter realizations, and Q1 introduction.
Assumption map. Table R5 distinguishes the requirements for the estimator limit, covariance consistency, integrated-path inference, and a uniform-path upgrade. Wald coverage combines covariance consistency with the estimator CLT.
Table R5. Conditions for the four guarantees, under the standing i.i.d. and predictable-iterate setup. The theorem and assumption identifiers retain their original numbering.
| Guarantee | Requirements and result |
|---|---|
| ALR and estimator CLT | Assumptions 2.1 and 3.1–3.3, and retained-window condition (2); Theorem 3.4. |
| Covariance consistency | A root of the population score, nonsingular , finite target-score second moment, and Assumption 3.5, including score convergence, Jacobian consistency, and a positive vanishing ridge; deterministic windows with . Theorem 3.6. Quantile Jacobian consistency uses the additional conditions in Theorem 3.11. Wald coverage also requires the estimator CLT. |
| Integrated path and endpoint | Assumptions 2.1 and 3.1–3.3; Theorem 3.7. For the self-normalized pivots, the relevant contrast covariance is nondegenerate; Theorem 3.8. |
| Uniform-path upgrade | Theorem 3.7's conditions plus maximal condition (20); Proposition C.8. |
Organization and wording. We make the concrete nonsmooth example explicit and separate its conditions from the inferential conclusions. The concise explanation reads:
“For the bounded-regressor quantile model with shifted logistic errors, compact convex projection gives positive radial drift, a bounded score second moment, and a quadratic mean remainder. Proposition R1 therefore applies to fixed stable normalized coordinate-momentum and two pole filters with and . The bounded, Lipschitz density also verifies the feasible kernel-Jacobian conditions. This supplies a concrete projected nonsmooth model supporting both Wald and self-normalized inference.”
The full model and verification are given under Q1 in Parts 4/6–5/6. We complete the concluding statement as: “The framework supports both Wald and self-normalized inference.” The condition map above distinguishes the estimator CLT, covariance consistency, integrated-path limit, and uniform-path upgrade.
Coordinate momentum. Let , , and , with . Then
The numerical coefficients reported in the response are for .
two pole cascade with contemporaneous second-stage input. An explicit normalized realization is
m_t^{(2)}=b m_{t-1}^{(2)}+(1-b)m_t^{(1)},$$ with update direction $m_t^{(2)}$. For $v_t=((m_t^{(1)})^\mathsf T,(m_t^{(2)})^\mathsf T)^\mathsf T$, this gives $$B=\begin{pmatrix}aI_d&0\\\a(1-b)I_d&bI_d\end{pmatrix},\qquad C=\begin{pmatrix}(1-a)I_d\\\\(1-a)(1-b)I_d\end{pmatrix},\qquad P=\begin{pmatrix}0&I_d\end{pmatrix}.$$ For $a,b\in[0,1)$, $\rho(B)=\max\\{a,b\\} < 1$ and $K=I_d$. The reported poles are $a=0.5$ and $b=\beta$. These equations specify the realization used for the stability verification. If the second stage instead uses $m_{t-1}^{(1)}$, the lower-left block of $B$ is $(1-b)I_d$ and the lower block of $C$ is zero; the gain is still $I_d$, but the finite sample trajectory differs. Thus the stage order must accompany the poles when documenting the numerical implementation. **Q1.** For either normalized filter, $K=I_d$. Under compact convex projection, Proposition R1 requires positive radial drift of $g$ on that set, a linear bound on its magnitude, a quadratic second-moment bound on the centered score, and the stated local mean remainder. The conclusion is $\mathbb E\lVert e_t\rVert^2=O(t^{-\alpha})$ and a uniformly bounded filter-state second moment; $\alpha(1+\nu) > 1$ gives the negligible accumulated bias. The argument requires both stability of $B$ and the stated drift condition. Among the submitted unprojected configurations, the scalar theorem completely verifies SGD and normalized scalar momentum in the submitted least-squares designs. Primitive verification remains open for the submitted unprojected logistic, quantile, coordinate and two pole configurations. The least-squares moment check and the projected nonsmooth example are given in Part 5/6. *Continued in Part 4/6: Q1 continued: Proposition R1 and the first proof steps.*
Thank you for your time and valuable comments.
Note: Because of the 5000-character limit, we divided our response into six comments.
W1. The added Proposition R1 fills this gap for compactly projected fixed filters. It establishes the state second-moment bound, the mean-square rate, localization, and accumulated-bias control under explicit conditions on Kg and Kξ. It also proves that projection eventually becomes inactive, so the limiting inference uses the original estimating equation. The statement and proof for this projected class are given under Q1 in Parts 4/6–5/6.
Table R6 compares the assumptions with established averaging and online-inference results. In particular, high-level trajectory confinement and mean-square bounds also appear explicitly in An–Huo's dynamic-preconditioning analysis. Our claim is that the conditions have clear mathematical roles and are now verified for the specified projected class; the other unprojected nonlinear examples remain conditional.
The following comparisons explain why local regularity, trajectory control, and covariance regularity are separated. Each comparison identifies the relevant assumptions and the verification required for its own setting.
Table R6. Verified assumption comparisons with related averaging and online-inference results.
W2. A tail average means the last 70 of iterations, rather than extreme-valued observations. In the original quantile comparison, kernel and oracle intervals share the same tail-average estimator, but the self-normalized interval uses the full average.
Table R2 therefore holds the full-average point estimator fixed and reports both interval lengths and intercept bias. It shows that neither normalization uniformly resolves the upper-tail undercoverage. The tail-Wald results on the same paths give the additional window diagnostic. Separately, Table R3 retains the oracle-tuned least-squares comparison, while Table R1 gives the new nonsmooth comparison with data-only tuning. These comparisons isolate the estimator and averaging-window choices. The equal-block and smoothed procedures remain diagnostic; a calibrated external comparison on a common recursion and window remains open.
Continued in Part 2/6: W2 continued: Tables R1–R3; W3, Table R4, and the W4 introduction.