{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ENTASUZUV7C4CYLBDEPXQFDDJC","short_pith_number":"pith:ENTASUZU","schema_version":"1.0","canonical_sha256":"2366095334afc5c16161191f78146348a6a23885c19dd046285568e238ae21b2","source":{"kind":"arxiv","id":"1810.06833","version":2},"attestation_state":"computed","paper":{"title":"Maximizing Monotone DR-submodular Continuous Functions by Derivative-free Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chao Qian, Ke Tang, Yibo Zhang","submitted_at":"2018-10-16T06:32:34Z","abstract_excerpt":"In this paper, we study the problem of monotone (weakly) DR-submodular continuous maximization. While previous methods require the gradient information of the objective function, we propose a derivative-free algorithm LDGM for the first time. We define $\\beta$ and $\\alpha$ to characterize how close a function is to continuous DR-submodulr and submodular, respectively. Under a convex polytope constraint, we prove that LDGM can achieve a $(1-e^{-\\beta}-\\epsilon)$-approximation guarantee after $O(1/\\epsilon)$ iterations, which is the same as the best previous gradient-based algorithm. Moreover, i"},"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":"1810.06833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-10-16T06:32:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5c2d33d4872d7dfca2178e0f13952d63edca75767cda4444e2a85c4078f307d6","abstract_canon_sha256":"894c7fc5ffa06c38513aebb32ad8bf28a66cb990af56bc6f3a77ba0bd014bdb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:51.873193Z","signature_b64":"qNwro+wpRQg/nm+pTCwywq0J+o18hM8cmCwsfgx0gSlSXsyVzi25o+lXz8rvQG53PBM7ENNW3sugfqFyY1jiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2366095334afc5c16161191f78146348a6a23885c19dd046285568e238ae21b2","last_reissued_at":"2026-05-17T23:52:51.872376Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:51.872376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing Monotone DR-submodular Continuous Functions by Derivative-free Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chao Qian, Ke Tang, Yibo Zhang","submitted_at":"2018-10-16T06:32:34Z","abstract_excerpt":"In this paper, we study the problem of monotone (weakly) DR-submodular continuous maximization. While previous methods require the gradient information of the objective function, we propose a derivative-free algorithm LDGM for the first time. We define $\\beta$ and $\\alpha$ to characterize how close a function is to continuous DR-submodulr and submodular, respectively. Under a convex polytope constraint, we prove that LDGM can achieve a $(1-e^{-\\beta}-\\epsilon)$-approximation guarantee after $O(1/\\epsilon)$ iterations, which is the same as the best previous gradient-based algorithm. Moreover, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06833","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":"1810.06833","created_at":"2026-05-17T23:52:51.872506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06833v2","created_at":"2026-05-17T23:52:51.872506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06833","created_at":"2026-05-17T23:52:51.872506+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENTASUZUV7C4","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENTASUZUV7C4CYLB","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENTASUZU","created_at":"2026-05-18T12:32:22.470017+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/ENTASUZUV7C4CYLBDEPXQFDDJC","json":"https://pith.science/pith/ENTASUZUV7C4CYLBDEPXQFDDJC.json","graph_json":"https://pith.science/api/pith-number/ENTASUZUV7C4CYLBDEPXQFDDJC/graph.json","events_json":"https://pith.science/api/pith-number/ENTASUZUV7C4CYLBDEPXQFDDJC/events.json","paper":"https://pith.science/paper/ENTASUZU"},"agent_actions":{"view_html":"https://pith.science/pith/ENTASUZUV7C4CYLBDEPXQFDDJC","download_json":"https://pith.science/pith/ENTASUZUV7C4CYLBDEPXQFDDJC.json","view_paper":"https://pith.science/paper/ENTASUZU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06833&json=true","fetch_graph":"https://pith.science/api/pith-number/ENTASUZUV7C4CYLBDEPXQFDDJC/graph.json","fetch_events":"https://pith.science/api/pith-number/ENTASUZUV7C4CYLBDEPXQFDDJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENTASUZUV7C4CYLBDEPXQFDDJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENTASUZUV7C4CYLBDEPXQFDDJC/action/storage_attestation","attest_author":"https://pith.science/pith/ENTASUZUV7C4CYLBDEPXQFDDJC/action/author_attestation","sign_citation":"https://pith.science/pith/ENTASUZUV7C4CYLBDEPXQFDDJC/action/citation_signature","submit_replication":"https://pith.science/pith/ENTASUZUV7C4CYLBDEPXQFDDJC/action/replication_record"}},"created_at":"2026-05-17T23:52:51.872506+00:00","updated_at":"2026-05-17T23:52:51.872506+00:00"}