{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H3G7TBUEFQ5LNFVCO4CFNNIAP4","short_pith_number":"pith:H3G7TBUE","schema_version":"1.0","canonical_sha256":"3ecdf986842c3ab696a2770456b5007f3c4a8a25bb68c1faf6e01bfe4c1955ce","source":{"kind":"arxiv","id":"1802.02246","version":1},"attestation_state":"computed","paper":{"title":"Approximation Methods for Bilevel Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mengdi Wang, Saeed Ghadimi","submitted_at":"2018-02-06T22:10:14Z","abstract_excerpt":"In this paper, we study a class of bilevel programming problem where the inner objective function is strongly convex. More specifically, under some mile assumptions on the partial derivatives of both inner and outer objective functions, we present an approximation algorithm for solving this class of problem and provide its finite-time convergence analysis under different convexity assumption on the outer objective function. We also present an accelerated variant of this method which improves the rate of convergence under convexity assumption. Furthermore, we generalize our results under stocha"},"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":"1802.02246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-06T22:10:14Z","cross_cats_sorted":[],"title_canon_sha256":"901ea8e0d2ed828193e7eca98695352b8d4d7e69883ed583670ee1eaf442cd8e","abstract_canon_sha256":"fc20ecfbd631385c10aebb62b239d4f2516ce35766dea62aba77e0517b73c718"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:08.791685Z","signature_b64":"oc3McL6uc4NzDNdxlFg7bJC6sJtQGJ/noAuET/0XKRRoVq2JdI+/5uGjf1AVcmL9N1akX2IuSey9RrVWlIPEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ecdf986842c3ab696a2770456b5007f3c4a8a25bb68c1faf6e01bfe4c1955ce","last_reissued_at":"2026-05-18T00:24:08.791000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:08.791000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Methods for Bilevel Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mengdi Wang, Saeed Ghadimi","submitted_at":"2018-02-06T22:10:14Z","abstract_excerpt":"In this paper, we study a class of bilevel programming problem where the inner objective function is strongly convex. More specifically, under some mile assumptions on the partial derivatives of both inner and outer objective functions, we present an approximation algorithm for solving this class of problem and provide its finite-time convergence analysis under different convexity assumption on the outer objective function. We also present an accelerated variant of this method which improves the rate of convergence under convexity assumption. Furthermore, we generalize our results under stocha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02246","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":"1802.02246","created_at":"2026-05-18T00:24:08.791088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02246v1","created_at":"2026-05-18T00:24:08.791088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02246","created_at":"2026-05-18T00:24:08.791088+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3G7TBUEFQ5L","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3G7TBUEFQ5LNFVC","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3G7TBUE","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":19,"internal_anchor_count":8,"sample":[{"citing_arxiv_id":"2401.03893","citing_title":"Finite-Time Decoupled Convergence in Nonlinear Two-Time-Scale Stochastic Approximation","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2511.01126","citing_title":"Stochastic Regret Guarantees for Online Zeroth- and First-Order Bilevel Optimization","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20898","citing_title":"Continuous-Time Analysis for Minimax and Bilevel Problems","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21341","citing_title":"Semiparametric Efficient Bilevel Gradient Estimation","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2601.16399","citing_title":"A Hessian-Free Actor-Critic Algorithm for Bi-Level Reinforcement Learning with Applications to LLM Fine-Tuning","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2602.06457","citing_title":"Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12693","citing_title":"IGT-OMD: Implicit Gradient Transport for Decision-Focused Learning under Delayed Feedback","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12718","citing_title":"CHAL: Council of Hierarchical Agentic Language","ref_index":57,"is_internal_anchor":true},{"citing_arxiv_id":"2604.04090","citing_title":"Fine-grained Analysis of Stability and Generalization for Stochastic Bilevel Optimization","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10288","citing_title":"BROS: Bias-Corrected Randomized Subspaces for Memory-Efficient Single-Loop Bilevel Optimization","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11476","citing_title":"A Barrier-Metric First-Order Method for Linearly Constrained Bilevel Optimization","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10288","citing_title":"BROS: Bias-Corrected Randomized Subspaces for Memory-Efficient Single-Loop Bilevel Optimization","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08131","citing_title":"Interactive Inverse Reinforcement Learning of Interaction Scenarios via Bi-level Optimization","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06431","citing_title":"Second-Order Bilevel Optimization with Accelerated Convergence Rates","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20115","citing_title":"On the Stability and Generalization of First-order Bilevel Minimax Optimization","ref_index":104,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19072","citing_title":"S2MAM: Semi-supervised Meta Additive Model for Robust Estimation and Variable Selection","ref_index":278,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11712","citing_title":"A Distributed Bilevel Framework for the Macroscopic Optimization of Multi-Agent Systems","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08006","citing_title":"Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17396","citing_title":"Representation-Guided Parameter-Efficient LLM Unlearning","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H3G7TBUEFQ5LNFVCO4CFNNIAP4","json":"https://pith.science/pith/H3G7TBUEFQ5LNFVCO4CFNNIAP4.json","graph_json":"https://pith.science/api/pith-number/H3G7TBUEFQ5LNFVCO4CFNNIAP4/graph.json","events_json":"https://pith.science/api/pith-number/H3G7TBUEFQ5LNFVCO4CFNNIAP4/events.json","paper":"https://pith.science/paper/H3G7TBUE"},"agent_actions":{"view_html":"https://pith.science/pith/H3G7TBUEFQ5LNFVCO4CFNNIAP4","download_json":"https://pith.science/pith/H3G7TBUEFQ5LNFVCO4CFNNIAP4.json","view_paper":"https://pith.science/paper/H3G7TBUE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02246&json=true","fetch_graph":"https://pith.science/api/pith-number/H3G7TBUEFQ5LNFVCO4CFNNIAP4/graph.json","fetch_events":"https://pith.science/api/pith-number/H3G7TBUEFQ5LNFVCO4CFNNIAP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3G7TBUEFQ5LNFVCO4CFNNIAP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3G7TBUEFQ5LNFVCO4CFNNIAP4/action/storage_attestation","attest_author":"https://pith.science/pith/H3G7TBUEFQ5LNFVCO4CFNNIAP4/action/author_attestation","sign_citation":"https://pith.science/pith/H3G7TBUEFQ5LNFVCO4CFNNIAP4/action/citation_signature","submit_replication":"https://pith.science/pith/H3G7TBUEFQ5LNFVCO4CFNNIAP4/action/replication_record"}},"created_at":"2026-05-18T00:24:08.791088+00:00","updated_at":"2026-05-18T00:24:08.791088+00:00"}