Research map / Learning theory and algorithms / Matrix and tensor methods
Undercover Boolean Matrix Factorization with MaxSAT
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Initialize OptiBlock with FastUndercover instead of zero matrices (ablation) | OptiBlock · 25 UCI datasets, 75 cases | runtime: 544 -> 98 min | Helped |
| Initialize OptiBlock with FastUndercover instead of zero matrices (ablation) | OptiBlock · 25 UCI datasets, 75 cases | # TOP: 29 -> 45 | Helped |
| Use GenerateCardinalities to replace incompatible soft clauses with cardinality constraints (ablation) | optimal k-undercover MaxSAT encoding · Randomly generated matrices | computation time | Helped |
| Use OptiBlock* rather than the compared baselines | k-undercover factorization · 25 UCI datasets, 75 cases | # TOP: 45 vs. 19 | Helped |
| Use OptiBlock* rather than IterEss | k-undercover factorization · Mushroom, k=28 | uncovered entries: 33852 -> 31226 | Helped |
| Use OptiBlock* rather than IterEss | k-undercover factorization · Chess, k=30 | uncovered entries: 453 -> 453 | No clear effect |
| Use OptiBlock* rather than Tile | k-undercover factorization · Zoo, k=21 | uncovered entries: 18 -> 6 | Helped |
Closest papers by meaning
- Delegation-Relegation for Boolean Matrix Factorization (AAAI 2024 · similarity 0.87)
- Efficiently Factorizing Boolean Matrices using Proximal Gradient Descent (NeurIPS 2022 · similarity 0.86)
- The Structural Complexity of Matrix-Vector Multiplication (NeurIPS 2025 · similarity 0.83)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (NeurIPS 2025 · similarity 0.82)
- Understanding the Kronecker Matrix-Vector Complexity of Linear Algebra (ICML 2025 · similarity 0.82)
- Federated Binary Matrix Factorization Using Proximal Optimization (AAAI 2025 · similarity 0.82)
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.