{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/maximum-optimality-margin-a-unified-approach","title":"Maximum Optimality Margin: A Unified Approach for Contextual Linear Programming and Inverse Linear Programming","arxiv_id":"2301.11260","date":"2023-01-26","proceeding":null,"authors":["Chunlin Sun","Shang Liu","Xiaocheng Li"],"abstract":"In this paper, we study the predict-then-optimize problem where the output of a machine learning prediction task is used as the input of some downstream optimization problem, say, the objective coefficient vector of a linear program. The problem is also known as predictive analytics or contextual linear programming. The existing approaches largely suffer from either (i) optimization intractability (a non-convex objective function)/statistical inefficiency (a suboptimal generalization bound) or (ii) requiring strong condition(s) such as no constraint or loss calibration. We develop a new approach to the problem called \\textit{maximum optimality margin} which designs the machine learning loss function by the optimality condition of the downstream optimization. The max-margin formulation enjoys both computational efficiency and good theoretical properties for the learning procedure. More importantly, our new approach only needs the observations of the optimal solution in the training data rather than the objective function, which makes it a new and natural approach to the inverse linear programming problem under both contextual and context-free settings; we also analyze the proposed method under both offline and online settings, and demonstrate its performance using numerical experiments.","url_abs":"https://arxiv.org/abs/2301.11260v2","url_pdf":"https://arxiv.org/pdf/2301.11260v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"maximum-optimality-margin-a-unified-approach","repo_url":"https://github.com/liushangnoname/maximum-optimality-margin","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2301.11260","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.11260"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/liushangnoname/Maximum-Optimality-Margin","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/liushangnoname/maximum-optimality-margin","reach":{"status":"ok"}}],"summary":{"ran_fixture":2,"unverified":1},"by_repo_kind":{"official":{"samples":3,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"115a6442f0c34e81","entry":"ExpKernel","repo":"liushangnoname/maximum-optimality-margin","repo_kind":"official","path":"Algorithm/LearningMethod.py","file_url":"https://github.com/liushangnoname/maximum-optimality-margin/blob/HEAD/Algorithm/LearningMethod.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"115a6442f0c34e81"}},{"code_sha256_prefix":"3539d6ce1d27137f","entry":"PolyKernel","repo":"liushangnoname/maximum-optimality-margin","repo_kind":"official","path":"Algorithm/LearningMethod.py","file_url":"https://github.com/liushangnoname/maximum-optimality-margin/blob/HEAD/Algorithm/LearningMethod.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"3539d6ce1d27137f"}},{"code_sha256_prefix":"994246ba6feceef2","entry":"MarginLearning","repo":"liushangnoname/maximum-optimality-margin","repo_kind":"official","path":"Algorithm/LearningMethod.py","file_url":"https://github.com/liushangnoname/maximum-optimality-margin/blob/HEAD/Algorithm/LearningMethod.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"994246ba6feceef2"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}