AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Can Graph Neural Networks Learn to Solve the MaxSAT Problem? (Student Abstract)

AAAI 2023 · Graph learning › Graph algorithms and clustering · approach: Neural combinatorial optimization on graphs · 6 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
Train GMS-N on synthetic instances from the matching distributionGMS-N · UF(2,60,600), UF(3,60,600), PL(2,60,600), and PL(3,60,600) validation setsapproximation ratio: >0.99Helped
Train GMS-E on synthetic instances from the matching distributionGMS-E · UF(2,60,600), UF(3,60,600), PL(2,60,600), and PL(3,60,600) validation setsapproximation ratio: >0.99Helped
Train on smaller instances from the same distribution and apply to larger instancesGMS-N and GMS-E · UF and PL testing problems with n ∈ [100, 1600]% of satisfied clausesHelped
Use GMS-N or GMS-E instead of MaxHS, Loandra, or SATLikeGMS-N and GMS-E · UF and PL testing problems with up to 1,600 variables% of satisfied clausesMixed

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