{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3XEBDANPSV6VVCFYFHPJKVOV3H","short_pith_number":"pith:3XEBDANP","schema_version":"1.0","canonical_sha256":"ddc81181af957d5a88b829de9555d5d9c978e2529cba001df65850f8290abc47","source":{"kind":"arxiv","id":"2303.04328","version":1},"attestation_state":"computed","paper":{"title":"The Novel Adaptive Fractional Order Gradient Decent Algorithms Design via Robust Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Chao Xu, Jiaxu Liu, Shengze Cai, Song Chen","submitted_at":"2023-03-08T02:03:30Z","abstract_excerpt":"The vanilla fractional order gradient descent may oscillatively converge to a region around the global minimum instead of converging to the exact minimum point, or even diverge, in the case where the objective function is strongly convex. To address this problem, a novel adaptive fractional order gradient descent (AFOGD) method and a novel adaptive fractional order accelerated gradient descent (AFOAGD) method are proposed in this paper. Inspired by the quadratic constraints and Lyapunov stability analysis from robust control theory, we establish a linear matrix inequality to analyse the conver"},"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":"2303.04328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-03-08T02:03:30Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f68c0bf0ad8f2ec690405b6e110b6bb89579649164ced55a6696960f54249350","abstract_canon_sha256":"6e53c4962019da23c6c729b2d0608f049a0d6951ba98852c918c65c975503a3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:49:19.962111Z","signature_b64":"Izgs2CjHrmNJozukn0viyBLmLnZ/zXCl353sTvMH2EW0AGteMDRXwaJIj7kqCNe5iJ56ney9KAcN2pviIOTqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddc81181af957d5a88b829de9555d5d9c978e2529cba001df65850f8290abc47","last_reissued_at":"2026-07-05T05:49:19.961558Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:49:19.961558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Novel Adaptive Fractional Order Gradient Decent Algorithms Design via Robust Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Chao Xu, Jiaxu Liu, Shengze Cai, Song Chen","submitted_at":"2023-03-08T02:03:30Z","abstract_excerpt":"The vanilla fractional order gradient descent may oscillatively converge to a region around the global minimum instead of converging to the exact minimum point, or even diverge, in the case where the objective function is strongly convex. To address this problem, a novel adaptive fractional order gradient descent (AFOGD) method and a novel adaptive fractional order accelerated gradient descent (AFOAGD) method are proposed in this paper. Inspired by the quadratic constraints and Lyapunov stability analysis from robust control theory, we establish a linear matrix inequality to analyse the conver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.04328","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.04328/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2303.04328","created_at":"2026-07-05T05:49:19.961622+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.04328v1","created_at":"2026-07-05T05:49:19.961622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.04328","created_at":"2026-07-05T05:49:19.961622+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XEBDANPSV6V","created_at":"2026-07-05T05:49:19.961622+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XEBDANPSV6VVCFY","created_at":"2026-07-05T05:49:19.961622+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XEBDANP","created_at":"2026-07-05T05:49:19.961622+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.14855","citing_title":"Applications of fractional calculus in learned optimization","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3XEBDANPSV6VVCFYFHPJKVOV3H","json":"https://pith.science/pith/3XEBDANPSV6VVCFYFHPJKVOV3H.json","graph_json":"https://pith.science/api/pith-number/3XEBDANPSV6VVCFYFHPJKVOV3H/graph.json","events_json":"https://pith.science/api/pith-number/3XEBDANPSV6VVCFYFHPJKVOV3H/events.json","paper":"https://pith.science/paper/3XEBDANP"},"agent_actions":{"view_html":"https://pith.science/pith/3XEBDANPSV6VVCFYFHPJKVOV3H","download_json":"https://pith.science/pith/3XEBDANPSV6VVCFYFHPJKVOV3H.json","view_paper":"https://pith.science/paper/3XEBDANP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.04328&json=true","fetch_graph":"https://pith.science/api/pith-number/3XEBDANPSV6VVCFYFHPJKVOV3H/graph.json","fetch_events":"https://pith.science/api/pith-number/3XEBDANPSV6VVCFYFHPJKVOV3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XEBDANPSV6VVCFYFHPJKVOV3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XEBDANPSV6VVCFYFHPJKVOV3H/action/storage_attestation","attest_author":"https://pith.science/pith/3XEBDANPSV6VVCFYFHPJKVOV3H/action/author_attestation","sign_citation":"https://pith.science/pith/3XEBDANPSV6VVCFYFHPJKVOV3H/action/citation_signature","submit_replication":"https://pith.science/pith/3XEBDANPSV6VVCFYFHPJKVOV3H/action/replication_record"}},"created_at":"2026-07-05T05:49:19.961622+00:00","updated_at":"2026-07-05T05:49:19.961622+00:00"}