Research map / Optimization / Optimizers
Efficiently Factorizing Boolean Matrices using Proximal Gradient Descent
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
- Federated Binary Matrix Factorization Using Proximal Optimization (AAAI 2025 · similarity 0.93)
- Hybrid Restricted Master Problem for Boolean Matrix Factorisation (AAAI 2026 · similarity 0.91)
- Fast and Efficient Boolean Matrix Factorization by Geometric Segmentation (AAAI 2020 · similarity 0.90)
- Binary Matrix Factorisation via Column Generation (AAAI 2021 · similarity 0.90)
- Delegation-Relegation for Boolean Matrix Factorization (AAAI 2024 · similarity 0.88)
- Provable Acceleration of Nesterov's Accelerated Gradient for Asymmetric Matrix Factorization and Linear Neural Networks (NeurIPS 2024 · similarity 0.86)
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.