Revisiting the D-iteration method: runtime comparison
Dohy Hong, G\'erard Burnside, Philippe Raoult
TL;DR
This paper reevaluates the D-iteration algorithm's performance, comparing actual runtime with theoretical iteration counts to clarify discrepancies in eigenvector computation for PageRank.
Contribution
It provides a detailed analysis of the practical runtime versus theoretical iterations for the D-iteration method in PageRank eigenvector computation.
Findings
Practical runtime often differs from theoretical iteration counts.
The paper clarifies factors affecting D-iteration performance.
Insights into optimizing eigenvector computation efficiency.
Abstract
In this paper, we revisit the D-iteration algorithm in order to better explain different performance results that were observed for the numerical computation of the eigenvector associated to the PageRank score. We revisit here the practical computation cost based on the execution runtime compared to the theoretical number of iterations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Parallel Computing and Optimization Techniques · Advanced Optimization Algorithms Research