AI Paper Atlas

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

A Scalable and Exact Relaxation for Densest k-Subgraph via Error Bounds

Ya Liu, Junbin Liu, Wing-Kin Ma, Aritra Konar

AAAI 2026 · 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 error-bound penalty on hypercube with proximal gradient (EP-Prox) instead of convex-hull penalty solversEXPP and Lovasz relaxation · DkS on HepTh, CondMat, DBLP, roadNet, Talk, LiveJournal1runtime: 2X fasterImproved
EP-Prox vs EXPP and Lovasz on solution qualityEP-Prox · DkS six graphsedge densityNo clear effect
EP-Prox vs GreedyEP-Prox · DkS six graphsedge densityImproved
EP-Prox vs Rank-1 PC on bipartite subgraphEP-Prox · Dk1k2BS (Actor movies, Digg votes, Flickr, Wikipedia edits)edge densityImproved
EP-Prox vs EXPP on bipartite subgraphEP-Prox · Dk1k2BSruntime: about an order of magnitude fasterImproved

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