{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CR3XVVP73CE3PIMCNKB5EVHQWX","short_pith_number":"pith:CR3XVVP7","schema_version":"1.0","canonical_sha256":"14777ad5ffd889b7a1826a83d254f0b5f9a243f7db810bfc3128cc908a8ed483","source":{"kind":"arxiv","id":"1607.05447","version":2},"attestation_state":"computed","paper":{"title":"On Differentiating Parameterized Argmin and Argmax Problems with Application to Bi-level Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Anoop Cherian, Basura Fernando, Edison Guo, Peter Anderson, Rodrigo Santa Cruz, Stephen Gould","submitted_at":"2016-07-19T08:09:30Z","abstract_excerpt":"Some recent works in machine learning and computer vision involve the solution of a bi-level optimization problem. Here the solution of a parameterized lower-level problem binds variables that appear in the objective of an upper-level problem. The lower-level problem typically appears as an argmin or argmax optimization problem. Many techniques have been proposed to solve bi-level optimization problems, including gradient descent, which is popular with current end-to-end learning approaches. In this technical report we collect some results on differentiating argmin and argmax optimization prob"},"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":"1607.05447","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-19T08:09:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4ecc9cc25850e43a16e6fec35dcc13540a87441714128a53535568c3aab7c024","abstract_canon_sha256":"35ec46c91fae16f3405fc93eda6b68993407a33dc23bf939d29c1576f0057f44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:42.480860Z","signature_b64":"sPbxzCxXfeOfOhRJyGpPK6aaO6PLe1USagEwH+fTHldZZTvmLzJNLTaHMLlBXJNrnhrOWf0VvjxQ96rWmuUoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14777ad5ffd889b7a1826a83d254f0b5f9a243f7db810bfc3128cc908a8ed483","last_reissued_at":"2026-05-18T01:10:42.480477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:42.480477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Differentiating Parameterized Argmin and Argmax Problems with Application to Bi-level Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Anoop Cherian, Basura Fernando, Edison Guo, Peter Anderson, Rodrigo Santa Cruz, Stephen Gould","submitted_at":"2016-07-19T08:09:30Z","abstract_excerpt":"Some recent works in machine learning and computer vision involve the solution of a bi-level optimization problem. Here the solution of a parameterized lower-level problem binds variables that appear in the objective of an upper-level problem. The lower-level problem typically appears as an argmin or argmax optimization problem. Many techniques have been proposed to solve bi-level optimization problems, including gradient descent, which is popular with current end-to-end learning approaches. In this technical report we collect some results on differentiating argmin and argmax optimization prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05447","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":"1607.05447","created_at":"2026-05-18T01:10:42.480537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05447v2","created_at":"2026-05-18T01:10:42.480537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05447","created_at":"2026-05-18T01:10:42.480537+00:00"},{"alias_kind":"pith_short_12","alias_value":"CR3XVVP73CE3","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CR3XVVP73CE3PIMC","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CR3XVVP7","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"1906.09992","citing_title":"Learning Latent Trees with Stochastic Perturbations and Differentiable Dynamic Programming","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2310.12508","citing_title":"SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation","ref_index":219,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12754","citing_title":"Constraint-Aware Flow Matching: Decision Aligned End-to-End Training for Constrained Sampling","ref_index":37,"is_internal_anchor":true},{"citing_arxiv_id":"2605.01361","citing_title":"Decision-Focused Learning via Tangent-Space Projection of Prediction Error","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07099","citing_title":"InfoGeo: Information-Theoretic Object-Centric Learning for Cross-View Generalizable UAV Geo-Localization","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17396","citing_title":"Representation-Guided Parameter-Efficient LLM Unlearning","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX","json":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX.json","graph_json":"https://pith.science/api/pith-number/CR3XVVP73CE3PIMCNKB5EVHQWX/graph.json","events_json":"https://pith.science/api/pith-number/CR3XVVP73CE3PIMCNKB5EVHQWX/events.json","paper":"https://pith.science/paper/CR3XVVP7"},"agent_actions":{"view_html":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX","download_json":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX.json","view_paper":"https://pith.science/paper/CR3XVVP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05447&json=true","fetch_graph":"https://pith.science/api/pith-number/CR3XVVP73CE3PIMCNKB5EVHQWX/graph.json","fetch_events":"https://pith.science/api/pith-number/CR3XVVP73CE3PIMCNKB5EVHQWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX/action/storage_attestation","attest_author":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX/action/author_attestation","sign_citation":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX/action/citation_signature","submit_replication":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX/action/replication_record"}},"created_at":"2026-05-18T01:10:42.480537+00:00","updated_at":"2026-05-18T01:10:42.480537+00:00"}