{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JJKUIVA2BLETYKJ3GAQDJMJ2R3","short_pith_number":"pith:JJKUIVA2","schema_version":"1.0","canonical_sha256":"4a5544541a0ac93c293b302034b13a8ef0f4a6276a7544644c16995b2b45b7f6","source":{"kind":"arxiv","id":"1311.3832","version":5},"attestation_state":"computed","paper":{"title":"Online and Stochastic Universal Gradient Methods for Minimizing Regularized H\\\"older Continuous Finite Sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Rujie Liu, Ziqiang Shi","submitted_at":"2013-11-15T12:48:17Z","abstract_excerpt":"Online and stochastic gradient methods have emerged as potent tools in large scale optimization with both smooth convex and nonsmooth convex problems from the classes $C^{1,1}(\\reals^p)$ and $C^{1,0}(\\reals^p)$ respectively. However to our best knowledge, there is few paper to use incremental gradient methods to optimization the intermediate classes of convex problems with H\\\"older continuous functions $C^{1,v}(\\reals^p)$. In order fill the difference and gap between methods for smooth and nonsmooth problems, in this work, we propose the several online and stochastic universal gradient methods"},"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":"1311.3832","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-11-15T12:48:17Z","cross_cats_sorted":[],"title_canon_sha256":"d1051e235e1a64dd64ab05e2e114cc83eee027ddf0405805da5c02056de58587","abstract_canon_sha256":"2404f35d107ed2fefd40ba11d12e2e52933d72ca1e8dab41d568c4f2dfcc4109"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:09.009664Z","signature_b64":"hjgavLjWMBjUIVA72zS8U0HhD0qbxzHaWZxVDOV8udyaIbZ19pW+mVHQhoJvw/RXqGKqjPYJzRTWBfWmIZo3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a5544541a0ac93c293b302034b13a8ef0f4a6276a7544644c16995b2b45b7f6","last_reissued_at":"2026-05-18T02:39:09.009054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:09.009054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online and Stochastic Universal Gradient Methods for Minimizing Regularized H\\\"older Continuous Finite Sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Rujie Liu, Ziqiang Shi","submitted_at":"2013-11-15T12:48:17Z","abstract_excerpt":"Online and stochastic gradient methods have emerged as potent tools in large scale optimization with both smooth convex and nonsmooth convex problems from the classes $C^{1,1}(\\reals^p)$ and $C^{1,0}(\\reals^p)$ respectively. However to our best knowledge, there is few paper to use incremental gradient methods to optimization the intermediate classes of convex problems with H\\\"older continuous functions $C^{1,v}(\\reals^p)$. In order fill the difference and gap between methods for smooth and nonsmooth problems, in this work, we propose the several online and stochastic universal gradient methods"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3832","kind":"arxiv","version":5},"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":"1311.3832","created_at":"2026-05-18T02:39:09.009135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3832v5","created_at":"2026-05-18T02:39:09.009135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3832","created_at":"2026-05-18T02:39:09.009135+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJKUIVA2BLET","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJKUIVA2BLETYKJ3","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJKUIVA2","created_at":"2026-05-18T12:27:49.015174+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/JJKUIVA2BLETYKJ3GAQDJMJ2R3","json":"https://pith.science/pith/JJKUIVA2BLETYKJ3GAQDJMJ2R3.json","graph_json":"https://pith.science/api/pith-number/JJKUIVA2BLETYKJ3GAQDJMJ2R3/graph.json","events_json":"https://pith.science/api/pith-number/JJKUIVA2BLETYKJ3GAQDJMJ2R3/events.json","paper":"https://pith.science/paper/JJKUIVA2"},"agent_actions":{"view_html":"https://pith.science/pith/JJKUIVA2BLETYKJ3GAQDJMJ2R3","download_json":"https://pith.science/pith/JJKUIVA2BLETYKJ3GAQDJMJ2R3.json","view_paper":"https://pith.science/paper/JJKUIVA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3832&json=true","fetch_graph":"https://pith.science/api/pith-number/JJKUIVA2BLETYKJ3GAQDJMJ2R3/graph.json","fetch_events":"https://pith.science/api/pith-number/JJKUIVA2BLETYKJ3GAQDJMJ2R3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJKUIVA2BLETYKJ3GAQDJMJ2R3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJKUIVA2BLETYKJ3GAQDJMJ2R3/action/storage_attestation","attest_author":"https://pith.science/pith/JJKUIVA2BLETYKJ3GAQDJMJ2R3/action/author_attestation","sign_citation":"https://pith.science/pith/JJKUIVA2BLETYKJ3GAQDJMJ2R3/action/citation_signature","submit_replication":"https://pith.science/pith/JJKUIVA2BLETYKJ3GAQDJMJ2R3/action/replication_record"}},"created_at":"2026-05-18T02:39:09.009135+00:00","updated_at":"2026-05-18T02:39:09.009135+00:00"}