NuMax: A Convex Approach for Learning Near-Isometric Linear Embeddings

DOI10.1109/TSP.2015.2452228zbMATH Open1395.94037MaRDI QIDQ4580922FDOQ4580922

Authors: Chinmay Hegde, Aswin C. Sankaranarayanan, Wotao Yin, Richard G. Baraniuk 

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cited In (5)

• On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems
• 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
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580922)