Pith. sign in

Title resolution pending

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Accelerating Spectral Clustering under Fairness Constraints

cs.LG · 2025-06-09 · conditional · novelty 6.0

A new ADMM-based difference-of-convex algorithm solves fair spectral clustering without n×n eigendecomposition, reducing runtime 4-8x versus prior state-of-the-art at comparable fairness and clustering cost.

citing papers explorer

Showing 1 of 1 citing paper.

  • Accelerating Spectral Clustering under Fairness Constraints cs.LG · 2025-06-09 · conditional · none · ref 10

    A new ADMM-based difference-of-convex algorithm solves fair spectral clustering without n×n eigendecomposition, reducing runtime 4-8x versus prior state-of-the-art at comparable fairness and clustering cost.