2 papers
cs.DC2026
Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices
Hussam Al Daas, Grey Ballard, Laura Grigori +4
Sketching is widely used in randomized linear algebra for low-rank matrix approximation, column subset selection, and many other problems, and it has gained significant traction in…
cs.LG2025
Catastrophic Forgetting in Kolmogorov-Arnold Networks
Mohammad Marufur Rahman, Guanchu Wang, Kaixiong Zhou +2
Catastrophic forgetting is a longstanding challenge in continual learning, where models lose knowledge from earlier tasks when learning new ones. While various mitigation strategie…