Trustworthy Machine Learning through the Lens of Combinatorial Optimization: Survey and Research Perspectives
For ML practitioners and researchers, this survey synthesizes CO-based approaches to address trustworthiness issues, highlighting a promising but computationally demanding direction.
This survey reviews how combinatorial optimization (CO) can enhance trustworthiness in machine learning, covering interpretability, robustness, fairness, privacy, and certifiability. It argues that CO provides global guarantees and formal certificates beyond heuristic methods, despite scalability challenges.
Modern machine learning (ML) increasingly relies on complex models whose behavior is difficult to characterize beyond empirical performance metrics. Across a wide range of tasks, including prediction, generation, and decision-making, models with similar empirical performance can exhibit markedly different properties in terms of their transparency, interpretability, robustness, fairness, privacy, and certifiability. This survey highlights how optimization- and certification-oriented reasoning can provide a useful framework for reasoning about such differences, supporting tasks ranging from model training and selection to auditing and certification. We review and synthesize recent advances at the intersection of combinatorial optimization (CO) and trustworthy ML, covering both training and post-training tasks, including interpretable model learning, explanation generation, robustness analysis, fairness auditing, model compression, and privacy attacks and protections. Across these domains, CO formulations offer additional capabilities over purely heuristic approaches, e.g., gradient-based ones, notably global guarantees, formal certificates, and explicit treatment of trade-offs. While scalability remains an important challenge, continued progress in solvers and hybrid algorithms suggests a growing role for CO in the design and deployment of trustworthy ML systems.