{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CWNZ3LEW3TTCO6A6RUQ4J4SJKS","short_pith_number":"pith:CWNZ3LEW","schema_version":"1.0","canonical_sha256":"159b9dac96dce627781e8d21c4f249548bbaa582a1be6dd40da99b472314b28e","source":{"kind":"arxiv","id":"2412.14431","version":1},"attestation_state":"computed","paper":{"title":"Randomized Subspace Derivative-Free Optimization with Quadratic Models and Second-Order Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Lindon Roberts","submitted_at":"2024-12-19T01:10:26Z","abstract_excerpt":"We consider model-based derivative-free optimization (DFO) for large-scale problems, based on iterative minimization in random subspaces. We provide the first worst-case complexity bound for such methods for convergence to approximate second-order critical points, and show that these bounds have significantly improved dimension dependence compared to standard full-space methods, provided low accuracy solutions are desired and/or the problem has low effective rank. We also introduce a practical subspace model-based method suitable for general objective minimization, based on iterative quadratic"},"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":"2412.14431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-19T01:10:26Z","cross_cats_sorted":[],"title_canon_sha256":"ce844433ea3016fae28a727a5c1fd1325dda8ac6e66bb5e7dd8acdc17a0f07a7","abstract_canon_sha256":"e61e951182895a5fd9dd91bce63bc0f4da8b697f87358621d08ea43a479647b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:51:47.034748Z","signature_b64":"TJMrhG4xZSWKhyWtUNvJ4eW1ldYnGmECIQaM9yqgV3lSkbSjMwaOr+yaqENNUCFR9zGC6tbyAhQGOC8pmqWfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"159b9dac96dce627781e8d21c4f249548bbaa582a1be6dd40da99b472314b28e","last_reissued_at":"2026-07-05T09:51:47.034170Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:51:47.034170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Subspace Derivative-Free Optimization with Quadratic Models and Second-Order Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Lindon Roberts","submitted_at":"2024-12-19T01:10:26Z","abstract_excerpt":"We consider model-based derivative-free optimization (DFO) for large-scale problems, based on iterative minimization in random subspaces. We provide the first worst-case complexity bound for such methods for convergence to approximate second-order critical points, and show that these bounds have significantly improved dimension dependence compared to standard full-space methods, provided low accuracy solutions are desired and/or the problem has low effective rank. We also introduce a practical subspace model-based method suitable for general objective minimization, based on iterative quadratic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.14431","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/2412.14431/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":"2412.14431","created_at":"2026-07-05T09:51:47.034239+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.14431v1","created_at":"2026-07-05T09:51:47.034239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.14431","created_at":"2026-07-05T09:51:47.034239+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWNZ3LEW3TTC","created_at":"2026-07-05T09:51:47.034239+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWNZ3LEW3TTCO6A6","created_at":"2026-07-05T09:51:47.034239+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWNZ3LEW","created_at":"2026-07-05T09:51:47.034239+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28124","citing_title":"Reservoir Zero-Coordinatewise Projected Subspace Search for Minimization Over Sparse Symmetric Sets in Machine Learning","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2506.20335","citing_title":"CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CWNZ3LEW3TTCO6A6RUQ4J4SJKS","json":"https://pith.science/pith/CWNZ3LEW3TTCO6A6RUQ4J4SJKS.json","graph_json":"https://pith.science/api/pith-number/CWNZ3LEW3TTCO6A6RUQ4J4SJKS/graph.json","events_json":"https://pith.science/api/pith-number/CWNZ3LEW3TTCO6A6RUQ4J4SJKS/events.json","paper":"https://pith.science/paper/CWNZ3LEW"},"agent_actions":{"view_html":"https://pith.science/pith/CWNZ3LEW3TTCO6A6RUQ4J4SJKS","download_json":"https://pith.science/pith/CWNZ3LEW3TTCO6A6RUQ4J4SJKS.json","view_paper":"https://pith.science/paper/CWNZ3LEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.14431&json=true","fetch_graph":"https://pith.science/api/pith-number/CWNZ3LEW3TTCO6A6RUQ4J4SJKS/graph.json","fetch_events":"https://pith.science/api/pith-number/CWNZ3LEW3TTCO6A6RUQ4J4SJKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWNZ3LEW3TTCO6A6RUQ4J4SJKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWNZ3LEW3TTCO6A6RUQ4J4SJKS/action/storage_attestation","attest_author":"https://pith.science/pith/CWNZ3LEW3TTCO6A6RUQ4J4SJKS/action/author_attestation","sign_citation":"https://pith.science/pith/CWNZ3LEW3TTCO6A6RUQ4J4SJKS/action/citation_signature","submit_replication":"https://pith.science/pith/CWNZ3LEW3TTCO6A6RUQ4J4SJKS/action/replication_record"}},"created_at":"2026-07-05T09:51:47.034239+00:00","updated_at":"2026-07-05T09:51:47.034239+00:00"}