Research map / Learning theory and algorithms / Matrix and tensor methods
Hybrid Restricted Master Problem for Boolean Matrix Factorisation
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
- Efficiently Factorizing Boolean Matrices using Proximal Gradient Descent (NeurIPS 2022 · similarity 0.91)
- Delegation-Relegation for Boolean Matrix Factorization (AAAI 2024 · similarity 0.86)
- Federated Binary Matrix Factorization Using Proximal Optimization (AAAI 2025 · similarity 0.86)
- Compress to Impress: Efficient LLM Adaptation Using a Single Gradient Step on 100 Samples (NeurIPS 2025 · similarity 0.83)
- RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees (NeurIPS 2025 · similarity 0.83)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (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.