arXiv Machine Learning By Kai Uwe Barthel, Florian Barthel, Peter Eisert

Permutation Learning with Only N Parameters: From SoftSort to Self-Organizing Gaussians

Read the original on arXiv Machine Learning →

arXiv:2503. 13051v3 Announce Type: replace Abstract: Sorting and permutation learning are key concepts in optimization and machine learning, especially when organizing high-dimensional data into meaningful spatial layouts.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 27

Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms

The paper introduces Soft-OMP and Soft-IHT, permutation‑based variants of Orthogonal Matching Pursuit and Iterative Hard Thresholding that replace the non‑differentiable argsort with continuous soft‑sort operators. These differentiable algorithms enable the construction of fully trainable neural network architectures—OMP‑Net and IHT‑Net—while preserving the core greedy sparse recovery logic. The authors show both theoretically and numerically that the soft variants approximate their hard counterparts with controllable accuracy and can be extended to structured sparse recovery by learning structure‑aware weights.

By Sina Mohammad-Taheri, Matthew J. Colbrook, Simone Brugiapaglia