AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Conic Optimization for Quadratic Regression Under Sparse Noise

Igor Molybog, Ramtin Madani, Javad Lavaei

JMLR 2020 · Learning theory and algorithms › Matrix and tensor methods · approach: Nonconvex low-rank and sparse optimization · 0 citations (OpenAlex)

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
use previous-step estimated state as prior knowledge when building the objective matrix Mpenalized SOCP · Dynamic state estimation (IEEE 300-bus)estimation error (RMSE): errors smaller by an order of magnitudeImproved
use penalized SOCP instead of SOCP hard thresholding (Algorithm 1, 50 iterations)conic methods · Synthetic quadratic regressionRMSE: better uniformly in m, n, noise and outliersImproved
add prior knowledge via matrix M from physics (eigenvector of -Y)penalized conic problem · PEGASE 1354-bus power state estimationexact recovery: exact recovery with fewer than 150 bad measurementsImproved

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