AINeutralarXiv – CS AI · 3h ago5/10
🧠
Isometry pursuit
Researchers introduce 'isometry pursuit,' a convex algorithm that identifies orthonormal column-submatrices within wide matrices by combining novel normalization techniques with multitask basis pursuit. The method enables discovery of isometric embeddings from interpretable dictionaries and offers a computational alternative to greedy or brute force approaches for coordinate selection problems.