IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v317y2024i2p286-302.html
   My bibliography  Save this article

A model-agnostic and data-independent tabu search algorithm to generate counterfactuals for tabular, image, and text data

Author

Listed:
  • de Oliveira, Raphael Mazzine Barbosa
  • Sörensen, Kenneth
  • Martens, David

Abstract

The growing prevalence of artificial decision systems has prompted a keen interest in their efficiency, yet this progress is accompanied by their inherent complexity. This poses a significant challenge for various domains, including operational research, where decisions hold crucial influence over outcomes and thus must not remain undisclosed. Counterfactual explanations are greatly remarked as a simple (to understand) yet efficient way to explain the decisions made by a machine learning model by finding a minimal set of changes required to change the prediction outcome for a specific instance. We, then, present a novel algorithmic approach, called CFNOW, which implements a modular, fast, two-step process using tabu search, a well-known metaheuristic framework, to find counterfactuals for multiple data types (tabular, image, and text) with high efficiency. We run an extensive benchmark study with more than 5000 factual points from 25 datasets to demonstrate that CFNOW can generate high-quality counterfactual results in terms of metrics such as speed, coverage, distance, and sparsity, surpassing the state-of-the-art. These characteristics, associated with the simple code implementation, may aid embedding explainability to complex models which are often necessary for compliance requirements.

Suggested Citation

  • de Oliveira, Raphael Mazzine Barbosa & Sörensen, Kenneth & Martens, David, 2024. "A model-agnostic and data-independent tabu search algorithm to generate counterfactuals for tabular, image, and text data," European Journal of Operational Research, Elsevier, vol. 317(2), pages 286-302.
  • Handle: RePEc:eee:ejores:v:317:y:2024:i:2:p:286-302
    DOI: 10.1016/j.ejor.2023.08.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221723006598
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2023.08.031?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    2. Carbonneau, Real & Laframboise, Kevin & Vahidov, Rustam, 2008. "Application of machine learning techniques for supply chain demand forecasting," European Journal of Operational Research, Elsevier, vol. 184(3), pages 1140-1154, February.
    3. López-Ibáñez, Manuel & Dubois-Lacoste, Jérémie & Pérez Cáceres, Leslie & Birattari, Mauro & Stützle, Thomas, 2016. "The irace package: Iterated racing for automatic algorithm configuration," Operations Research Perspectives, Elsevier, vol. 3(C), pages 43-58.
    4. Yanou Ramon & David Martens & Foster Provost & Theodoros Evgeniou, 2020. "A comparison of instance-level counterfactual explanation algorithms for behavioral and textual data: SEDC, LIME-C and SHAP-C," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 14(4), pages 801-819, December.
    5. Fred Glover, 1990. "Tabu Search—Part II," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 4-32, February.
    6. Stanly Jayaprakash & Manikanda Devarajan Nagarajan & Rocío Pérez de Prado & Sugumaran Subramanian & Parameshachari Bidare Divakarachari, 2021. "A Systematic Review of Energy Management Strategies for Resource Allocation in the Cloud: Clustering, Optimization and Machine Learning," Energies, MDPI, vol. 14(17), pages 1-18, August.
    7. Karimi-Mamaghan, Maryam & Mohammadi, Mehrdad & Meyer, Patrick & Karimi-Mamaghan, Amir Mohammad & Talbi, El-Ghazali, 2022. "Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art," European Journal of Operational Research, Elsevier, vol. 296(2), pages 393-422.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Haochen Zhang & Shaowei Cai & Chuan Luo & Minghao Yin, 2017. "An efficient local search algorithm for the winner determination problem," Journal of Heuristics, Springer, vol. 23(5), pages 367-396, October.
    2. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    3. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    4. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    5. Fiondella, Lance & Lin, Yi-Kuei & Pham, Hoang & Chang, Ping-Chen & Li, Chendong, 2017. "A confidence-based approach to reliability design considering correlated failures," Reliability Engineering and System Safety, Elsevier, vol. 165(C), pages 102-114.
    6. Johan Barthelemy & Philippe L. Toint, 2013. "Synthetic Population Generation Without a Sample," Transportation Science, INFORMS, vol. 47(2), pages 266-279, May.
    7. Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.
    8. B Dengiz & C Alabas-Uslu & O Dengiz, 2009. "Optimization of manufacturing systems using a neural network metamodel with a new training approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1191-1197, September.
    9. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    10. Shao, Saijun & Xu, Su Xiu & Huang, George Q., 2020. "Variable neighborhood search and tabu search for auction-based waste collection synchronization," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 1-20.
    11. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    12. Abdmouleh, Zeineb & Gastli, Adel & Ben-Brahim, Lazhar & Haouari, Mohamed & Al-Emadi, Nasser Ahmed, 2017. "Review of optimization techniques applied for the integration of distributed generation from renewable energy sources," Renewable Energy, Elsevier, vol. 113(C), pages 266-280.
    13. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    14. Fred W. Glover, 2022. "Unforeseen Consequences of “Tabu” Choices—A Retrospective," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1306-1308, May.
    15. Chris S. K. Leung & Henry Y. K. Lau, 2018. "Multiobjective Simulation-Based Optimization Based on Artificial Immune Systems for a Distribution Center," Journal of Optimization, Hindawi, vol. 2018, pages 1-15, May.
    16. Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, August.
    17. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    18. Servranckx, Tom & Vanhoucke, Mario, 2019. "A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs," European Journal of Operational Research, Elsevier, vol. 273(3), pages 841-860.
    19. Drexl, Andreas & Juretzka, Jan & Salewski, Frank, 1993. "Academic course scheduling under workload and changeover constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 337, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Christina Iliopoulou & Konstantinos Kepaptsoglou & Eleni Vlahogianni, 2019. "Metaheuristics for the transit route network design problem: a review and comparative analysis," Public Transport, Springer, vol. 11(3), pages 487-521, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:317:y:2024:i:2:p:286-302. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.