2 papers
cs.LG2025
Structure-Aware Spectral Sparsification via Uniform Edge Sampling
Kaiwen He, Petros Drineas, Rajiv Khanna
Spectral clustering is a fundamental method for graph partitioning, but its reliance on eigenvector computation limits scalability to massive graphs. Classical sparsification metho…
cs.DS2024
The Space Complexity of Approximating Logistic Loss
Gregory Dexter, Petros Drineas, Rajiv Khanna
We provide space complexity lower bounds for data structures that approximate logistic loss up to -relative error on a logistic regression problem with data $\mathbf{X} \in \ma…