- Rating
- 2
- Confidence
- 1
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper studies computation of the pooled, unregularized Tyler shape estimator over a synchronous peer-to-peer network. Its motivating setting is that the pooled observations satisfy the strict subspace-occupancy condition, while individual nodes may have insufficient or rank-deficient data and therefore cannot compute local Tyler estimators. The proposed decentralized majorization–minimization algorithm, D-MM, alternates local weighted-scatter computation, finite-round neighbor averaging, and determinant normalization. The analysis uses relative Loewner-order bounds to preserve positive definiteness and Hilbert’s projective metric to control disagreement and heterogeneous local iterates. The paper claims convergence under summable consensus errors, deterministic instance-dependent linear convergence for centralized Tyler iteration, and linear convergence of D-MM under geometrically decaying consensus errors. Experiments examine communication schedules, data geometry, graph topology, and a rolling portfolio application.
Critical strengths
- A meaningful decentralized estimation setting.
- The geometric tools fit the problem well.
- Several empirical and interpretive choices are careful.
Critical weaknesses
- The experiments do not establish the algorithm’s advantage over alternative ways to compute the same pooled estimator
- Essential experimental settings—and the motivating locally singular regime—are not sufficiently documented in the main text
- The stopping criterion does not reliably certify estimator accuracy
- The portfolio study supports numerical agreement, but its reproducibility and practical interpretation are limited
Questions for authors
- How do you ensure that the iterate-difference stopping criterion does not terminate prematurely on nearly degenerate datasets? What are the final estimator errors, rather than only step sizes, in the reported runs?
- How does D-MM compare with an exact aggregation implementation or accelerated/adaptive consensus at matched pooled-Tyler accuracy? What is included in the round and byte accounting, and how is global termination detected?
2 comments
Dear Reviewer urBN,
Thank you again for your detailed comments. In our response above, we distinguished the stopping threshold from estimator accuracy, provided final errors for the one-sample-per-node experiment, and clarified the communication accounting and the scope of our experimental comparisons. We would appreciate your feedback on these points, particularly whether any concerns about the stopping criterion or accuracy assessment remain. We would welcome your perspective on the remaining limitations.
Thank you for the constructive comments.
Experimental settings and locally singular data. Appendix H.2 details the data allocation, network, and communication schedules. In the default feasibility experiment, d=10, N=50, and m=8. Under the balanced partition, each node receives 6 or 7 samples, fewer than the dimension. In the one-sample-per-node experiment, we instead use N=m=12, so each node receives exactly one sample. Consequently, every local weighted-scatter matrix is singular in both settings.
We will highlight these settings and their connection to the locally singular regime in the main text.
Stopping criterion and estimator accuracy. The threshold 10−7 applies to the maximum successive-iterate difference across nodes. It is a practical stopping criterion and is not claimed to be a 10−7 bound on the distance to the pooled Tyler estimator. This distinction also arises in centralized Tyler estimation: a small change between successive iterates does not generally imply an equally small distance to the exact solution. Stopping based on iterate changes is common in practice; for example, the centralized Tyler estimator in the R package fitHeavyTail uses a relative tolerance on parameter changes and a maximum iteration limit.
We will report final distances to the pooled Tyler reference separately from the stopping threshold, distinguishing runs that satisfy it from those reaching the iteration limit. For example, in the one-sample-per-node experiment, the maximum-node affine-invariant distance to the pooled reference has a median of 3.88×10−6 and a maximum of 6.37×10−6 across 100 runs.
Comparison with alternative communication methods. Our objective is to study whether and how the pooled Tyler estimator can be computed through finite-round neighbor consensus when individual nodes may not have enough data to form local Tyler estimators. The contribution is the D-MM construction and its convergence analysis under controlled consensus errors; we do not claim that D-MM is more communication-efficient than all alternative approaches.
Exact tree aggregation is a useful comparator for the same estimation task, but it follows a different communication architecture: it collects and broadcasts aggregated quantities over a designated spanning tree, whereas D-MM uses a prescribed neighbor-mixing matrix without an aggregation root. Tree aggregation requires the selection and construction of a spanning tree, which may also need to be maintained or repaired as the network changes. D-MM avoids maintaining such a tree. More broadly, gossip-based aggregation has been studied as a decentralized approach for dynamic distributed systems; see, for example, Kempe, Dobra, and Gehrke (2003).
The neighbor-consensus framework also provides a natural basis for extensions to randomized neighbor selection and asynchronous communication, as studied in the gossip literature. Accelerated or adaptive consensus is another direction for extending the consensus step. By establishing convergence for D-MM with standard consensus, our work provides a foundation for adapting the algorithm and analysis to such variants. We expect these to be natural follow-up extensions, with the precise conditions depending on the chosen protocol. A matched-accuracy comparison with these variants is beyond the current experiments.
Communication accounting and termination. The reported D-MM communication rounds count neighbor-averaging rounds. In each round, every directed edge transmits one symmetric d×d matrix, corresponding to d(d+1)/2 scalars. The global stopping condition is evaluated in the simulation by taking the maximum iterate change over all nodes.
Portfolio experiment. Appendix G documents the data and experiment setting. We use publicly available value-weighted monthly returns from the Fama–French 49-industry dataset, specifying the 202607 CRSP data vintage and download date. We select the first 30 industries with complete observations from January 1970, use a 120-month rolling training window, center each window by its training mean, and evaluate the resulting portfolios over the 559 months from January 1980 to July 2026. The appendix also specifies the network, communication schedule, stopping criteria, and no-short-sales portfolio construction.
The purpose of this experiment is to assess whether the numerical agreement between D-MM and pooled Tyler carries over to a downstream portfolio task. It is not intended to establish superior investment performance. We will make this purpose and the location of the reproducibility details clearer in the main text.