Isometry pursuit is a convex algorithm for identifying orthonormal column-submatrices of wide matrices. It consists of a novel normalization method followed by multitask basis pursuit. Applied to Jacobians of putative coordinate functions, it helps identity isometric embeddings from within interpretable dictionaries. We provide theoretical and experimental results justifying this method. For problems involving coordinate selection and diversification, it offers a synergistic alternative to greedy and brute force search.

翻译：等距追踪是一种用于识别宽矩阵中标准正交列子矩阵的凸优化算法。该算法包含一种新颖的归一化方法，随后进行多任务基追踪。当应用于候选坐标函数的雅可比矩阵时，它有助于从可解释字典中识别等距嵌入。我们提供了支持该方法的理论与实验结果。对于涉及坐标选择与多样化的问题，该算法为贪心搜索和暴力搜索提供了一种协同替代方案。