{"total":32,"rows":[{"id":"2108.08993","title":"Distributionally Robust Learning","created":"2021-08-20","cited_by_count":44,"area":null},{"id":"2106.14015","title":"Contextual Inverse Optimization: Offline and Online Learning","created":"2021-06-26","cited_by_count":20,"area":null},{"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":"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":"2304.07407","title":"Repeated Principal-Agent Games with Unobserved Agent Rewards and Perfect-Knowledge Agents","created":"2023-04-14","cited_by_count":7,"area":null},{"id":"2212.01314","title":"On Solution Functions of Optimization: Universal Approximation and Covering Number Bounds","created":"2022-12-02","cited_by_count":6,"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":"2308.06717","title":"Estimating and Incentivizing Imperfect-Knowledge Agents with Hidden Rewards","created":"2023-08-13","cited_by_count":5,"area":null},{"id":"2108.07472","title":"Is Nash Equilibrium Approximator Learnable?","created":"2021-08-17","cited_by_count":4,"area":null},{"id":"2203.17150","title":"Online Learning for Traffic Routing under Unknown Preferences","created":"2022-03-31","cited_by_count":4,"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":"2602.16990","title":"Conv-FinRe: A Conversational and Longitudinal Benchmark for Utility-Grounded Financial Recommendation","created":"2026-02-19","cited_by_count":4,"area":null},{"id":"2102.12415","title":"Using Inverse Optimization to Learn Cost Functions in Generalized Nash Games","created":"2021-02-24","cited_by_count":3,"area":null},{"id":"2210.15393","title":"Efficient Learning of Decision-Making Models: A Penalty Block Coordinate Descent Algorithm for Data-Driven Inverse Optimization","created":"2022-10-27","cited_by_count":3,"area":null},{"id":"2402.17890","title":"From Inverse Optimization to Feasibility to ERM","created":"2024-02-27","cited_by_count":3,"area":null},{"id":"2405.17875","title":"BO4IO: A Bayesian optimization approach to inverse optimization with uncertainty quantification","created":"2024-05-28","cited_by_count":3,"area":null},{"id":"2410.23952","title":"Scalable Kernel Inverse Optimization","created":"2024-10-31","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":"2303.11522","title":"Online Learning for Equilibrium Pricing in Markets under Incomplete Information","created":"2023-03-21","cited_by_count":1,"area":null},{"id":"2308.08017","title":"Active Inverse Learning in Stackelberg Trajectory Games","created":"2023-08-15","cited_by_count":1,"area":null},{"id":"2106.00906","title":"Operator Splitting for Learning to Predict Equilibria in Convex Games","created":"2021-06-02","cited_by_count":0,"area":null},{"id":"2307.00444","title":"An Adaptive Optimization Approach to Personalized Financial Incentives in Mobile Behavioral Weight Loss Interventions","created":"2023-07-01","cited_by_count":0,"area":null},{"id":"2502.16120","title":"A Fenchel-Young Loss Approach to Data-Driven Inverse Optimization","created":"2025-02-22","cited_by_count":0,"area":null},{"id":"2605.27270","title":"Inverse Control Constrained Optimization of Vessel Speed Decisions Under Environmental Risk: Evidence from Arctic Shipping","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2606.28764","title":"Hierarchical Decision Making with Structured Policies: A Principled Design via Inverse Optimization","created":"2026-06-27","cited_by_count":0,"area":null},{"id":"2608.29465","title":"Deciding When to Decide: Testing Operational Suboptimality Under Distributional Shift","created":"2026-08-29","cited_by_count":0,"area":null}],"next_cursor":null}