AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Faster Randomized Infeasible Interior Point Methods for Tall/Wide Linear Programs

Agniva Chowdhury, Palma London, Haim Avron, Petros Drineas

NeurIPS 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Predict-then-optimize learning

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 changedWhereMeasuredEffect
precondition the normal equations with sketching (Algorithm 2) instead of plain CGstandard IPM with CG · ARCENE l1-SVM LPinner CG iterations: 1,000 -> 15 to 35Improved
sketching improves conditioning of normal equations matrixstandard IPM with CG · ARCENEcondition number: 10^8 -> lowerImproved
decrease sketch dimension w from 1000 to 200 (ablation)Sketched IPM · ARCENEinner CG iterationsHurt
vary w and tolCG over grid (ablation)Sketched IPM · ARCENEinner iterations: 15 to 35No clear effect
increase both tolCG and w (ablation)Sketched IPM · ARCENEcondition numberImproved
use sketched preconditioning instead of standard solverSketched IPM · ARCENEouter iterationsNo clear effect
vary (w,tolCG) settings (ablation)Sketched IPM · ARCENErelative error: 0.04%No clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy