An Inverse Optimization Approach to Measuring Clinical Pathway Concordance
Not on the map. Why?
Abstract (arXiv)
Clinical pathways outline standardized processes in the delivery of care for a specific disease. Patient journeys through the healthcare system, though, can deviate substantially from these pathways. Given the positive benefits of clinical pathways, it is important to measure the concordance of patient pathways so that variations in health system performance or bottlenecks in the delivery of care can be detected, monitored, and acted upon. This paper proposes the first data-driven inverse optimization approach to measuring pathway concordance in any problem context. Our specific application considers clinical pathway concordance for stage III colon cancer. We develop a novel concordance metric and demonstrate using real patient data from Ontario, Canada that it has a statistically significant association with survival. Our methodological approach considers a patient's journey as a walk in a directed graph, where the costs on the arcs are derived by solving an inverse shortest path problem. The inverse optimization model uses two sources of information to find the arc costs: reference pathways developed by a provincial cancer agency (primary) and data from real-world patient-related activity from patients with both positive and negative clinical outcomes (secondary). Thus, our inverse optimization framework extends existing models by including data points of both varying "primacy" and "alignment". Data primacy is addressed through a two-stage approach to imputing the cost vector, while data alignment is addressed by a hybrid objective function that aims to minimize and maximize suboptimality error for different subsets of input data.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Jun 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 2; 2025: 2; 2026: 1.
9 papers.
- 2023Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithmscited by 10
- 2023Repeated Principal-Agent Games with Unobserved Agent Rewards and Perfect-Knowledge Agentscited by 7
- 2025Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Boundcited by 7
- 2023Estimating and Incentivizing Imperfect-Knowledge Agents with Hidden Rewardscited by 5
- 2022Efficient Learning of Decision-Making Models: A Penalty Block Coordinate Descent Algorithm for Data-Driven Inverse Optimizationcited by 3
- 2024From Inverse Optimization to Feasibility to ERMcited by 3
- 2024Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methodscited by 3
- 2025Inverse Mixed-Integer Programming: Learning Constraints then Objective Functionscited by 2
- 2026Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programscited by 1
- 2026Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programs24 Jul 2026
- 2025Inverse Mixed-Integer Programming: Learning Constraints then Objective Functions6 Oct 2025
- 2025Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound24 Jan 2025
- 2024Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods23 May 2024
- 2024From Inverse Optimization to Feasibility to ERM27 Feb 2024
- 2023Estimating and Incentivizing Imperfect-Knowledge Agents with Hidden Rewards13 Aug 2023
- 2023Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithms12 May 2023
- 2023Repeated Principal-Agent Games with Unobserved Agent Rewards and Perfect-Knowledge Agents14 Apr 2023
- 2022Efficient Learning of Decision-Making Models: A Penalty Block Coordinate Descent Algorithm for Data-Driven Inverse Optimization27 Oct 2022