{"total":20,"rows":[{"id":"2301.11260","title":"Maximum Optimality Margin: A Unified Approach for Contextual Linear Programming and Inverse Linear Programming","created":"2023-01-26","cited_by_count":13,"area":null},{"id":"2305.07730","title":"Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithms","created":"2023-05-12","cited_by_count":10,"area":null},{"id":"2501.14349","title":"Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound","created":"2025-01-24","cited_by_count":9,"area":null},{"id":"2501.13648","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","created":"2025-01-23","cited_by_count":8,"area":null},{"id":"2602.01682","title":"Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets","created":"2026-02-02","cited_by_count":8,"area":null},{"id":"2603.20826","title":"Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustness","created":"2026-03-21","cited_by_count":6,"area":null},{"id":"2605.08866","title":"Tight Generalization Bounds for Noiseless Inverse Optimization","created":"2026-05-09","cited_by_count":6,"area":null},{"id":"2608.06825","title":"Multiscale Reward Hedging from Correct Demonstrations","created":"2026-08-07","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":"2402.17890","title":"From Inverse Optimization to Feasibility to ERM","created":"2024-02-27","cited_by_count":3,"area":null},{"id":"2505.13243","title":"Conformalized Decision Risk Assessment","created":"2025-05-19","cited_by_count":3,"area":null},{"id":"2609.13440","title":"Efficient Online Inverse Optimization with $O(d)$ Regret","created":"2026-09-11","cited_by_count":3,"area":null},{"id":"2510.04455","title":"Inverse Mixed-Integer Programming: Learning Constraints then Objective Functions","created":"2025-10-06","cited_by_count":2,"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":"2609.26978","title":"Tight Regret Bound for Online Inverse Linear Optimization via Multiscale Matrix Weights","created":"2026-09-22","cited_by_count":2,"area":null},{"id":"2402.14013","title":"Misalignment, Learning, and Ranking: Harnessing Users Limited Attention","created":"2024-02-21","cited_by_count":1,"area":null},{"id":"2109.09816","title":"Deviation-Based Learning: Training Recommender Systems Using Informed User Choice","created":"2021-09-20","cited_by_count":0,"area":null},{"id":"2603.17139","title":"Contextual Preference Distribution Learning","created":"2026-03-17","cited_by_count":0,"area":null},{"id":"2605.00193","title":"OTSS: Output-Targeted Soft Segmentation for Contextual Decision-Weight Learning","created":"2026-04-30","cited_by_count":0,"area":null},{"id":"2609.38434","title":"TACIT: Optimization Models that Learn from Their Mistakes","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}