Low Rank Multi-Dictionary Selection at Scale
Boya Ma, Maxwell McNeil, Abram Magner, Petko Bogdanov

TL;DR
This paper introduces LRMDS, a scalable multi-dictionary atom selection method for low-rank sparse coding, which improves efficiency and representation quality for large datasets and dictionaries.
Contribution
LRMDS is a novel scalable technique that progressively selects atom groups for low-rank sparse coding, with theoretical guarantees and practical efficiency improvements.
Findings
Achieves 3X to 10X speed-up over baselines.
Up to two orders of magnitude improvement in representation quality.
Effective on synthetic and real-world datasets.
Abstract
The sparse dictionary coding framework represents signals as a linear combination of a few predefined dictionary atoms. It has been employed for images, time series, graph signals and recently for 2-way (or 2D) spatio-temporal data employing jointly temporal and spatial dictionaries. Large and over-complete dictionaries enable high-quality models, but also pose scalability challenges which are exacerbated in multi-dictionary settings. Hence, an important problem that we address in this paper is: How to scale multi-dictionary coding for large dictionaries and datasets? We propose a multi-dictionary atom selection technique for low-rank sparse coding named LRMDS. To enable scalability to large dictionaries and datasets, it progressively selects groups of row-column atom pairs based on their alignment with the data and performs convex relaxation coding via the corresponding…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEducational Technology and Assessment
