Fast greedy algorithms for dictionary selection with generalized sparsity constraints

Nov-20-2025, 20:42:37 GMT–Neural Information Processing Systems

In dictionary selection, several atoms are selected from finite candidates that successfully approximate given data points in the sparse representation.

artificial intelligence, dictionary selection, machine learning, (14 more...)

Neural Information Processing Systems

Nov-20-2025, 20:42:37 GMT

Conferences PDF

Country:
- Asia > Japan
  - Honshū > Kantō > Tokyo Metropolis Prefecture > Tokyo (0.05)
- North America > Canada
  - Quebec > Montreal (0.04)

Technology:
- Information Technology > Artificial Intelligence
  - Machine Learning (1.00)
  - Representation & Reasoning > Search (0.50)

Duplicate Docs Excel Report

Title
e069ea4c9c233d36ff9c7f329bc08ff1-Paper.pdf
Fast greedy algorithms for dictionary selection with generalized sparsity constraints

Similar Docs Excel Report more

Title	Similarity	Source
None found