AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Characterization of the Convex Łukasiewicz Fragment for Learning From Constraints

Francesco Giannini, Michelangelo Diligenti, Marco Gori, Marco Maggini

AAAI 2018 · Optimization › Nonconvex and smooth optimization · approach: Coordinate and Adam convergence analysis · 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
add collective classification over the knowledge base on top of neural network outputsFeedforward network (30 hidden units per predicate) · Winston animal image benchmark (3325 ImageNet images, 7 classes), 10-90% supervisionstest accuracyImproved
initialize grounded predicates with neural network outputs instead of only training supervisions (others set to 0.5) (ablation)Collective classification with convex Lukasiewicz constraints · Winston animal image benchmark, 10-90% supervisionstest accuracyImproved
increase fraction of available training supervisions toward 90% (ablation)Collective classification (supervisions vs neural network prior) · Winston animal image benchmarkgap in test accuracy between the two collective settingsNo 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