{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2SVBSXY3MI3GGWQUPB2OSOV26F","short_pith_number":"pith:2SVBSXY3","schema_version":"1.0","canonical_sha256":"d4aa195f1b6236635a147874e93abaf167ba799d7a7b4a91a2f160eb7844df5f","source":{"kind":"arxiv","id":"1803.04300","version":2},"attestation_state":"computed","paper":{"title":"Neural Conditional Gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christian Bauckhage, Kristian Kersting, Patrick Schramowski","submitted_at":"2018-03-12T15:10:45Z","abstract_excerpt":"The move from hand-designed to learned optimizers in machine learning has been quite successful for gradient-based and -free optimizers. When facing a constrained problem, however, maintaining feasibility typically requires a projection step, which might be computationally expensive and not differentiable. We show how the design of projection-free convex optimization algorithms can be cast as a learning problem based on Frank-Wolfe Networks: recurrent networks implementing the Frank-Wolfe algorithm aka. conditional gradients. This allows them to learn to exploit structure when, e.g., optimizin"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1803.04300","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-03-12T15:10:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"77c73228e4ff6b4a6aa431ee6638b9da4227372bba17e032606d07fd2ae67a83","abstract_canon_sha256":"ce8cb4099cce589a4b315d7a87ad9ac443872e1ff3d1113c211a9bb38797c4fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:35.898419Z","signature_b64":"0fw5ndD9vzCnblWojFCYoZtd8fjDFlxA86tK7SKVCdk0G2K4NXsBUKPputhuLOYpWdsW8KCS4teEWVw2a9RPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4aa195f1b6236635a147874e93abaf167ba799d7a7b4a91a2f160eb7844df5f","last_reissued_at":"2026-05-18T00:09:35.897954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:35.897954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Conditional Gradients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Christian Bauckhage, Kristian Kersting, Patrick Schramowski","submitted_at":"2018-03-12T15:10:45Z","abstract_excerpt":"The move from hand-designed to learned optimizers in machine learning has been quite successful for gradient-based and -free optimizers. When facing a constrained problem, however, maintaining feasibility typically requires a projection step, which might be computationally expensive and not differentiable. We show how the design of projection-free convex optimization algorithms can be cast as a learning problem based on Frank-Wolfe Networks: recurrent networks implementing the Frank-Wolfe algorithm aka. conditional gradients. This allows them to learn to exploit structure when, e.g., optimizin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04300","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.04300","created_at":"2026-05-18T00:09:35.898028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04300v2","created_at":"2026-05-18T00:09:35.898028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04300","created_at":"2026-05-18T00:09:35.898028+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SVBSXY3MI3G","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SVBSXY3MI3GGWQU","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SVBSXY3","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2SVBSXY3MI3GGWQUPB2OSOV26F","json":"https://pith.science/pith/2SVBSXY3MI3GGWQUPB2OSOV26F.json","graph_json":"https://pith.science/api/pith-number/2SVBSXY3MI3GGWQUPB2OSOV26F/graph.json","events_json":"https://pith.science/api/pith-number/2SVBSXY3MI3GGWQUPB2OSOV26F/events.json","paper":"https://pith.science/paper/2SVBSXY3"},"agent_actions":{"view_html":"https://pith.science/pith/2SVBSXY3MI3GGWQUPB2OSOV26F","download_json":"https://pith.science/pith/2SVBSXY3MI3GGWQUPB2OSOV26F.json","view_paper":"https://pith.science/paper/2SVBSXY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04300&json=true","fetch_graph":"https://pith.science/api/pith-number/2SVBSXY3MI3GGWQUPB2OSOV26F/graph.json","fetch_events":"https://pith.science/api/pith-number/2SVBSXY3MI3GGWQUPB2OSOV26F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SVBSXY3MI3GGWQUPB2OSOV26F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SVBSXY3MI3GGWQUPB2OSOV26F/action/storage_attestation","attest_author":"https://pith.science/pith/2SVBSXY3MI3GGWQUPB2OSOV26F/action/author_attestation","sign_citation":"https://pith.science/pith/2SVBSXY3MI3GGWQUPB2OSOV26F/action/citation_signature","submit_replication":"https://pith.science/pith/2SVBSXY3MI3GGWQUPB2OSOV26F/action/replication_record"}},"created_at":"2026-05-18T00:09:35.898028+00:00","updated_at":"2026-05-18T00:09:35.898028+00:00"}