Evidence-ledger draft

Open Problems in Optimization: An Evidence-Ledger Investigation — Claim ledger

CSV-backed claim ledger tying paper claims to paper IDs and evidence status.

paper_idclaimclaim_statusevidence_statussource_depthsource_quotepage_or_sectiontaxonomy_fitaudit_status
2207.11719v4Bi-level optimization embeds one problem within another and the gradient-based category solves the outer-level task by computing the hypergradient, which is much more efficient than classical methods such as the evolutionary algorithm.supportedhas evidence rowfull-textBi-level optimization embeds one problem within another and the gradient-based category solves the outer-level task by computing the hypergradient, which is much more ef- ficientthanclassicalmethodssuchastheevolutionaryalgorithm.abstractin-scope: LLM extractor confirmed direction matchneeds work; full-text verified; report=audit_report.md
2006.11560v1We introduce Bion, a new exact method combining ML and traditional COP solving to estimate close boundaries of the objective variable and to exploit these boundaries for boosting the solving process.preliminary-linkedhas evidence rowfull-textan experimental evaluation over seven realistic COPs shows that an estimation model can be trained to prune the objective variables domain s by over 80%.2in-scope: LLM extractor confirmed direction matchneeds work; filled but source-depth unclear; report=audit_report.md
1910.08476v2We draw connections between DP and (constrained) convex optimization.supportedhas evidence rowfull-textW e also discuss briefly more connections between RL and optimization in Section 6. 2 Background 2.1 Markov Decision Processes We consider the problem of solving infinite horizon discount ed Markovian Decision Process (MDP).Section 3in-scope: LLM extractor confirmed direction matchneeds work; full-text verified; report=audit_report.md
2602.13513v2We propose the use of SINDy-based surrogates of the continuous-time dynamics of optimizationsupportedhas evidence rowfull-textAnecdotally, in Sec. 4.2, we present a high-dimensional problem and use K= 10 , as compared to the default history size for LBFGS K′= 100 [74].1in-scope: LLM extractor confirmed direction matchneeds work; full-text verified; report=audit_report.md
2410.21886v1The project’s purpose has been accomplished.supportedhas evidence rowfull-textthe results were promising, as we automatically increased the accuracy by approximately 8%.48in-scope: LLM extractor confirmed direction matchneeds work; full-text verified; report=audit_report.md