{"total":19,"rows":[{"id":"2307.13565","title":"Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunities","created":"2023-07-25","cited_by_count":130,"area":null},{"id":"2307.08964","title":"Landscape Surrogate: Learning Decision Losses for Mathematical Optimization Under Partial Information","created":"2023-07-18","cited_by_count":18,"area":null},{"id":"2312.05250","title":"TaskMet: Task-Driven Metric Learning for Model Learning","created":"2023-12-08","cited_by_count":11,"area":null},{"id":"2411.19285","title":"BPQP: A Differentiable Convex Optimization Framework for Efficient End-to-End Learning","created":"2024-11-28","cited_by_count":10,"area":null},{"id":"2311.07633","title":"Benchmarking PtO and PnO Methods in the Predictive Combinatorial Optimization Regime","created":"2023-11-13","cited_by_count":8,"area":null},{"id":"2312.07718","title":"CaVE: A Cone-Aligned Approach for Fast Predict-then-optimize with Binary Linear Programs","created":"2023-12-12","cited_by_count":8,"area":null},{"id":"2410.11061","title":"Learning to Optimize for Mixed-Integer Non-linear Programming with Feasibility Guarantees","created":"2024-10-14","cited_by_count":8,"area":null},{"id":"2307.02671","title":"AI4OPT: AI Institute for Advances in Optimization","created":"2023-07-05","cited_by_count":6,"area":null},{"id":"2305.01868","title":"Pre-train and Search: Efficient Embedding Table Sharding with Pre-trained Neural Cost Models","created":"2023-05-03","cited_by_count":5,"area":null},{"id":"2405.14273","title":"Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods","created":"2024-05-23","cited_by_count":4,"area":null},{"id":"2312.14836","title":"Learning Lagrangian Multipliers for the Travelling Salesman Problem","created":"2023-12-22","cited_by_count":3,"area":null},{"id":"2407.17200","title":"Generalization Bounds of Surrogate Policies for Combinatorial Optimization Problems","created":"2024-07-24","cited_by_count":3,"area":null},{"id":"2607.22263","title":"Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programs","created":"2026-07-24","cited_by_count":2,"area":null},{"id":"2312.12485","title":"Learning Deterministic Surrogates for Robust Convex QCQPs","created":"2023-12-19","cited_by_count":1,"area":null},{"id":"2412.08287","title":"DistrictNet: Decision-aware learning for geographical districting","created":"2024-12-11","cited_by_count":1,"area":null},{"id":"2605.20222","title":"Quantum End-to-End Learning for Contextual Combinatorial Optimization","created":"2026-05-13","cited_by_count":1,"area":null},{"id":"2503.05175","title":"Self-Supervised Penalty-Based Learning for Robust Constrained Optimization","created":"2025-03-07","cited_by_count":0,"area":null},{"id":"2603.19318","title":"Towards Solving Polynomial-Objective Integer Programming with Hypergraph Neural Networks","created":"2026-03-16","cited_by_count":0,"area":null},{"id":"2608.29765","title":"PruneShift: A Framework for Evaluating Decision Reliability in Structured Pruning","created":"2026-08-30","cited_by_count":0,"area":null}],"next_cursor":null}