atlas

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

Graphical Nonconvex Optimization via an Adaptive Convex Relaxation

ICML 2018 · Learning theory and algorithms › Matrix and tensor methods · approach: Nonconvex low-rank and sparse optimization · 5 citations (OpenAlex)

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 changedWhereMeasuredEffect
Replace one-step graphical lasso with sequential adaptive convex programs (nonconvex SCAD-weighted relaxation, T=4)Graphical nonconvex optimization estimator · Simulation random and band graphs, n=150/200, d=150Frobenius norm error of concentration matrixHelped
Sequential convex approximation (contraction property) versus one-step convex estimatorInverse correlation matrix estimator · Theory: spectral/Frobenius rateestimation rateHelped
Use sparsity-pattern-based spectral norm bound (Theorem 3.8) instead of sparsity-count boundInverse correlation matrix estimator · Theory: chain graphsratio of rate bounds ||M||_2^2/sHelped

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