Research map / Learning theory and algorithms / Matrix and tensor methods
Information Maximization Perspective of Orthogonal Matching Pursuit with Applications to Explainable AI
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Beyond the Grid: Continuous Dictionary Pursuit for Interpretable Signal Decomposition (NeurIPS 2026 · similarity 0.87)
- Signal and Noise Statistics Oblivious Orthogonal Matching Pursuit (ICML 2018 · similarity 0.87)
- Support Recovery for Orthogonal Matching Pursuit: Upper and Lower bounds (NeurIPS 2018 · similarity 0.86)
- Variational Information Pursuit for Interpretable Predictions (ICLR 2023 · similarity 0.84)
- Conformal Information Pursuit for Interactively Guiding Large Language Models (NeurIPS 2025 · similarity 0.84)
- From Flat to Hierarchical: Extracting Sparse Representations with Matching Pursuit (NeurIPS 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.