Fair low-rank approximation is NP-hard to approximate and requires exponential time under ETH; bicriteria algorithms achieve polynomial time with a rank and column count blow-up.
Woodruff, and Samson Zhou
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
On Socially Fair Low-Rank Approximation and Column Subset Selection
Fair low-rank approximation is NP-hard to approximate and requires exponential time under ETH; bicriteria algorithms achieve polynomial time with a rank and column count blow-up.