ml-sparse-dictionary-learning-np-hard

IN premise — entries/2026/06/21/wiki-Machine_learning-chunk-3.md

Created 2026-06-21T09:55:50+00:00

Sparse dictionary learning (representing examples as sparse linear combinations of basis functions) is strongly NP-hard; k-SVD is the standard heuristic solver