Ingrid Chieh Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ingrid Chieh Yu has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Einar Broch Johnsen
University of Oslo
5 shared publications - Crystal Chang Din
University of Bergen
3 shared publications - Olaf Owe
University of Oslo
3 shared publications - Peyman Rasouli
Department of Informatics, University of Oslo, Oslo, Norway
2 shared publications - Violet Ka I. Pun
Western Norway University of Applied Sciences
2 shared publications - Volker Stolz
Western Norway University of Applied Sciences
2 shared publications
Latest Publications
- Open Access
- 15 July 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1054
Modular soundness checking of feature model evolution plans
- 15 July 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1054
Open AccessModular soundness checking of feature model evolution plans
- Open Access
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 825-828
Dataset for Industrial Question Answering with Explanation and Scalable Ensemble Generation
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 825-828
Open AccessDataset for Industrial Question Answering with Explanation and Scalable Ensemble Generation
- 10 July 2024
- Published by Springer Nature
- p. 374-394
Better Luck Next Time: About Robust Recourse in Binary Allocation Problems
- 10 July 2024
- Published by Springer Nature
- p. 374-394
Better Luck Next Time: About Robust Recourse in Binary Allocation Problems
- 23 November 2023
- Published by Springer Nature
- p. 417-437
Modular Soundness Checking of Feature Model Evolution Plans
- 23 November 2023
- Published by Springer Nature
- p. 417-437
Modular Soundness Checking of Feature Model Evolution Plans
- Open Access
- 30 September 2022
- Published by Springer Nature in International Journal of Data Science and Analytics
- Vol. 17 (1) , 13-38
CARE: coherent actionable recourse based on sound counterfactual explanations
Counterfactual explanation (CE) is a popular post hoc interpretability approach that explains how to obtain an alternative outcome from a machine learning model by specifying minimum changes in the input. In line with this context, when the model’s inputs represent actual individuals, actionable recourse (AR) refers to a personalized CE that prescribes feasible changes according to an individual’s preferences. Hence, the quality of ARs highly depends on the soundness of underlying CEs and the proper incorporation of user preferences. To generate sound CEs, several data-level properties, such as proximity and connectedness, should be taken into account. Meanwhile, personalizing explanations demands fulfilling important user-level requirements, like coherency and actionability. The main obstacles to inclusive consideration of the stated properties are their associated modeling and computational complexity as well as the lack of a systematic approach for making a rigorous trade-off between them based on their importance. This paper introduces CARE, an explanation framework that addresses these challenges by formulating the properties as intuitive and computationally efficient objective functions, organized in a modular hierarchy and optimized using a multi-objective optimization algorithm. The devised modular hierarchy enables the arbitration and aggregation of various properties as well as the generation of CEs and AR by choice. CARE involves individuals through a flexible language for defining preferences, facilitates their choice by recommending multiple ARs, and guides their action steps toward their desired outcome. CARE is a model-agnostic approach for explaining any multi-class classification and regression model in mixed-feature tabular settings. We demonstrate the efficacy of our framework through several validation and benchmark experiments on standard data sets and black box models.
- 30 September 2022
- Published by Springer Nature in International Journal of Data Science and Analytics
- Vol. 17 (1) , 13-38
Open AccessCARE: coherent actionable recourse based on sound counterfactual explanations
Counterfactual explanation (CE) is a popular post hoc interpretability approach that explains how to obtain an alternative outcome from a machine learning model by specifying minimum changes in the input. In line with this context, when the model’s inputs represent actual individuals, actionable recourse (AR) refers to a personalized CE that prescribes feasible changes according to an individual’s preferences. Hence, the quality of ARs highly depends on the soundness of underlying CEs and the proper incorporation of user preferences. To generate sound CEs, several data-level properties, such as proximity and connectedness, should be taken into account. Meanwhile, personalizing explanations demands fulfilling important user-level requirements, like coherency and actionability. The main obstacles to inclusive consideration of the stated properties are their associated modeling and computational complexity as well as the lack of a systematic approach for making a rigorous trade-off between them based on their importance. This paper introduces CARE, an explanation framework that addresses these challenges by formulating the properties as intuitive and computationally efficient objective functions, organized in a modular hierarchy and optimized using a multi-objective optimization algorithm. The devised modular hierarchy enables the arbitration and aggregation of various properties as well as the generation of CEs and AR by choice. CARE involves individuals through a flexible language for defining preferences, facilitates their choice by recommending multiple ARs, and guides their action steps toward their desired outcome. CARE is a model-agnostic approach for explaining any multi-class classification and regression model in mixed-feature tabular settings. We demonstrate the efficacy of our framework through several validation and benchmark experiments on standard data sets and black box models.
- 1 January 2021
- Published by Springer Nature
- p. 325-355
Subsurface Evaluation Through Multi-scenario Reasoning
- 1 January 2021
- Published by Springer Nature
- p. 325-355
Subsurface Evaluation Through Multi-scenario Reasoning
- 18 October 2019
- Published by Springer Nature
- p. 28-38
Meaningful Data Sampling for a Faithful Local Explanation Method
- 18 October 2019
- Published by Springer Nature
- p. 28-38
Meaningful Data Sampling for a Faithful Local Explanation Method
- 5 October 2018
- Published by Springer Nature
- p. 156-174
Using Coloured Petri Nets for Resource Analysis of Active Objects
- 5 October 2018
- Published by Springer Nature
- p. 156-174
Using Coloured Petri Nets for Resource Analysis of Active Objects
- Open Access
Modeling and Simulation of Spark Streaming
As more and more devices connect to Internet of Things, unbounded streams of data will be generated, which have to be processed "on the fly" in order to trigger automated actions and deliver real-time services. Spark Streaming is a popular realtime stream processing framework. To make efficient use of Spark Streaming and achieve stable stream processing, it requires a careful interplay between different parameter configurations. Mistakes may lead to significant resource overprovisioning and bad performance. To alleviate such issues, this paper develops an executable and configurable model named SSP (stands for Spark Streaming Processing) to model and simulate Spark Streaming. SSP is written in ABS, which is a formal, executable, and object-oriented language for modeling distributed systems by means of concurrent object groups. SSP allows users to rapidly evaluate and compare different parameter configurations without deploying their applications on a cluster/cloud. The simulation results show that SSP is able to mimic Spark Streaming in different scenarios.
Open AccessModeling and Simulation of Spark Streaming
As more and more devices connect to Internet of Things, unbounded streams of data will be generated, which have to be processed "on the fly" in order to trigger automated actions and deliver real-time services. Spark Streaming is a popular realtime stream processing framework. To make efficient use of Spark Streaming and achieve stable stream processing, it requires a careful interplay between different parameter configurations. Mistakes may lead to significant resource overprovisioning and bad performance. To alleviate such issues, this paper develops an executable and configurable model named SSP (stands for Spark Streaming Processing) to model and simulate Spark Streaming. SSP is written in ABS, which is a formal, executable, and object-oriented language for modeling distributed systems by means of concurrent object groups. SSP allows users to rapidly evaluate and compare different parameter configurations without deploying their applications on a cluster/cloud. The simulation results show that SSP is able to mimic Spark Streaming in different scenarios.
- 1 February 2018
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 95, 82-102
A modular reasoning system using uninterpreted predicates for code reuse
- 1 February 2018
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 95, 82-102
A modular reasoning system using uninterpreted predicates for code reuse