{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GB4BDWAP7CZNICGULJPSY7OYD5","short_pith_number":"pith:GB4BDWAP","schema_version":"1.0","canonical_sha256":"307811d80ff8b2d408d45a5f2c7dd81f62348c005f46eb26c5de967438795009","source":{"kind":"arxiv","id":"1507.00438","version":1},"attestation_state":"computed","paper":{"title":"DC Proximal Newton for Non-Convex Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alain Rakotomamonjy (LITIS), Gilles Gasso (LITIS), Oca), Remi Flamary (LAGRANGE","submitted_at":"2015-07-02T06:41:32Z","abstract_excerpt":"We introduce a novel algorithm for solving learning problems where both the loss function and the regularizer are non-convex but belong to the class of difference of convex (DC) functions. Our contribution is a new general purpose proximal Newton algorithm that is able to deal with such a situation. The algorithm consists in obtaining a descent direction from an approximation of the loss function and then in performing a line search to ensure sufficient descent. A theoretical analysis is provided showing that the iterates of the proposed algorithm {admit} as limit points stationary points of t"},"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":"1507.00438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-02T06:41:32Z","cross_cats_sorted":["cs.NA","stat.ML"],"title_canon_sha256":"7a343630fb27073db66706c7aa6d54c751f9f5aece607fa4358ef69156592740","abstract_canon_sha256":"2ee5704d5fd8aecf058d8e5b03f207c3ae385c2f8c0099876f760f55580dced4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:24.733933Z","signature_b64":"b5VXTHq/8hrrklpE6qluQ0YDzRvExGcMcyth2enx4BEIeXXfQfFmuwN9bF212D3RKP8nWS93JxKRo09j7ai3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"307811d80ff8b2d408d45a5f2c7dd81f62348c005f46eb26c5de967438795009","last_reissued_at":"2026-05-18T01:37:24.733190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:24.733190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DC Proximal Newton for Non-Convex Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alain Rakotomamonjy (LITIS), Gilles Gasso (LITIS), Oca), Remi Flamary (LAGRANGE","submitted_at":"2015-07-02T06:41:32Z","abstract_excerpt":"We introduce a novel algorithm for solving learning problems where both the loss function and the regularizer are non-convex but belong to the class of difference of convex (DC) functions. Our contribution is a new general purpose proximal Newton algorithm that is able to deal with such a situation. The algorithm consists in obtaining a descent direction from an approximation of the loss function and then in performing a line search to ensure sufficient descent. A theoretical analysis is provided showing that the iterates of the proposed algorithm {admit} as limit points stationary points of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00438","kind":"arxiv","version":1},"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":"1507.00438","created_at":"2026-05-18T01:37:24.733330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00438v1","created_at":"2026-05-18T01:37:24.733330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00438","created_at":"2026-05-18T01:37:24.733330+00:00"},{"alias_kind":"pith_short_12","alias_value":"GB4BDWAP7CZN","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GB4BDWAP7CZNICGU","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GB4BDWAP","created_at":"2026-05-18T12:29:22.688609+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/GB4BDWAP7CZNICGULJPSY7OYD5","json":"https://pith.science/pith/GB4BDWAP7CZNICGULJPSY7OYD5.json","graph_json":"https://pith.science/api/pith-number/GB4BDWAP7CZNICGULJPSY7OYD5/graph.json","events_json":"https://pith.science/api/pith-number/GB4BDWAP7CZNICGULJPSY7OYD5/events.json","paper":"https://pith.science/paper/GB4BDWAP"},"agent_actions":{"view_html":"https://pith.science/pith/GB4BDWAP7CZNICGULJPSY7OYD5","download_json":"https://pith.science/pith/GB4BDWAP7CZNICGULJPSY7OYD5.json","view_paper":"https://pith.science/paper/GB4BDWAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00438&json=true","fetch_graph":"https://pith.science/api/pith-number/GB4BDWAP7CZNICGULJPSY7OYD5/graph.json","fetch_events":"https://pith.science/api/pith-number/GB4BDWAP7CZNICGULJPSY7OYD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GB4BDWAP7CZNICGULJPSY7OYD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GB4BDWAP7CZNICGULJPSY7OYD5/action/storage_attestation","attest_author":"https://pith.science/pith/GB4BDWAP7CZNICGULJPSY7OYD5/action/author_attestation","sign_citation":"https://pith.science/pith/GB4BDWAP7CZNICGULJPSY7OYD5/action/citation_signature","submit_replication":"https://pith.science/pith/GB4BDWAP7CZNICGULJPSY7OYD5/action/replication_record"}},"created_at":"2026-05-18T01:37:24.733330+00:00","updated_at":"2026-05-18T01:37:24.733330+00:00"}