NuMax: A Convex Approach for Learning Near-Isometric Linear Embeddings
From MaRDI portal
Publication:4580922
DOI10.1109/TSP.2015.2452228zbMath1395.94037MaRDI QIDQ4580922
Aswin C. Sankaranarayanan, Richard G. Baraniuk, Wotao Yin, Chinmay Hegde
Publication date: 22 August 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (5)
Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems: a new approach using secants ⋮ Representation and coding of signal geometry ⋮ Improved linear embeddings via Lagrange duality ⋮ On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems ⋮ What happens to a manifold under a bi-Lipschitz map?
This page was built for publication: NuMax: A Convex Approach for Learning Near-Isometric Linear Embeddings