Research map / Learning theory and algorithms / Combinatorial and search optimization
Approximate Vanishing Ideal Computations at Scale
Elias Samuel Wirth, Hiroshi Kera, Sebastian Pokutta
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| replace PCG with BPCG (ablation) | OAVI · Bank, HTRU, Skin, Synthetic | training time | Mixed |
| add inverse Hessian boosting (ablation) | CGAVI · Bank, HTRU, Skin, Synthetic | training time | Improved |
| add weak inverse Hessian boosting (ablation) | BPCGAVI · Bank, HTRU, Skin, Synthetic | training time | Improved |
| use AGD instead of CG with inverse Hessian boosting (ablation) | OAVI · credit, htru, skin, spam | classification error: 18.08 -> 18.08; 2.09 -> 2.09; 0.23 -> 0.23; 6.69 -> 6.69 | No clear effect |
| use AGD instead of CG with inverse Hessian boosting (ablation) | OAVI · credit, htru, skin, spam | training time: 1.3 \times 10^{2} -> 1.9 \times 10^{2}; 2.3 \times 10^{1} -> 2.8 \times 10^{1}; 1.0 \times 10^{2} -> 1.1 \times 10^{2}; | Hurt |
| use BPCGAVI-WIHB instead of CGAVI-IHB (ablation) | OAVI · credit, htru, skin, spam | classification error: 18.08 -> 17.98; 2.09 -> 2.05; 0.23 -> 0.22; 6.69 -> 6.71 | Mixed |
| use BPCGAVI-WIHB instead of CGAVI-IHB (ablation) | OAVI · credit, htru, skin, spam | training time: 1.3 \times 10^{2} -> 3.7 \times 10^{3}; 2.3 \times 10^{1} -> 8.0 \times 10^{2}; 1.0 \times 10^{2} -> 5.6 \times 10^{2}; | Hurt |
| use sparse-generator BPCGAVI-WIHB instead of CGAVI-IHB (ablation) | OAVI feature transformation · credit, htru, skin, spam | classification error: 18.08 -> 17.98; 2.09 -> 2.05; 0.23 -> 0.22; 6.69 -> 6.71 | Mixed |
Closest papers by meaning
- Approximating Latent Manifolds in Neural Networks via Vanishing Ideals (ICML 2025 · similarity 0.83)
- Learning to compute Gröbner bases (NeurIPS 2024 · similarity 0.83)
- Fast exact recovery of noisy matrix from few entries: the infinity norm approach (NeurIPS 2025 · similarity 0.82)
- On The Complexity of First-Order Methods in Stochastic Bilevel Optimization (ICML 2024 · similarity 0.82)
- Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions (NeurIPS 2024 · similarity 0.82)
- The Computational Complexity of Finding Second-Order Stationary Points (ICML 2024 · 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.
