Amirhossein Karimi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Amirhossein Karimi has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Adrienne Raglin
Army Research Laboratory
1 shared publication - Andrew M. Kahn
Division of Cardiovascular Medicine, University of California San Diego, La Jolla, CA, USA
1 shared publication D.G. Blanchard
University of California, San Diego, La Jolla, CA, USA
1 shared publication- Huan Liu
Arizona State University, Tempe, AZ, USA
1 shared publication J.R. Wilson
University of California, San Diego, La Jolla, CA, USA
1 shared publicationLuigia Ripani
University of Cergy-Pontoise, Cergy, France
1 shared publication
Latest Publications
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 5819-5820
Socially Responsible Machine Learning: A Causal Perspective
The evergrowing reliance of humans and society on machine learning methods has raised concerns about their trustworthiness and liability. As a response to these concerns, Socially Responsible Machine Learning (SRML) aims at developing fair, transparent, and robust machine learning algorithms. However, traditional approaches to SRML do not incorporate human perspectives, and therefore are not sufficient to build long-lasting trust between machines and human being. Causality as the key to human intelligence plays a vital role in achieving socially responsible machine learning algorithms which are compatible with human notions. Bridging the gap between traditional SRML and causality, in this tutorial, we aim at providing a holistic overview of SRML through the lens of causality. In particular, we will focus on state-of-the-art techniques on causal socially responsible ML in terms of fairness, interpretability, and robustness. The objectives of this tutorial are as follows: (1) we provide a taxonomy of existing literature on causal socially responsible ML from fairness, interpretability, and robustness perspective; (2) we review the state-of-the-art techniques for each task; and (3) we elucidate open questions and future research directions. We believe this tutorial is beneficial to researchers and practitioners from the areas of data mining, machine learning, and social sciences.
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 5819-5820
Open AccessSocially Responsible Machine Learning: A Causal Perspective
The evergrowing reliance of humans and society on machine learning methods has raised concerns about their trustworthiness and liability. As a response to these concerns, Socially Responsible Machine Learning (SRML) aims at developing fair, transparent, and robust machine learning algorithms. However, traditional approaches to SRML do not incorporate human perspectives, and therefore are not sufficient to build long-lasting trust between machines and human being. Causality as the key to human intelligence plays a vital role in achieving socially responsible machine learning algorithms which are compatible with human notions. Bridging the gap between traditional SRML and causality, in this tutorial, we aim at providing a holistic overview of SRML through the lens of causality. In particular, we will focus on state-of-the-art techniques on causal socially responsible ML in terms of fairness, interpretability, and robustness. The objectives of this tutorial are as follows: (1) we provide a taxonomy of existing literature on causal socially responsible ML from fairness, interpretability, and robustness perspective; (2) we review the state-of-the-art techniques for each task; and (3) we elucidate open questions and future research directions. We believe this tutorial is beneficial to researchers and practitioners from the areas of data mining, machine learning, and social sciences.
- 3 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 5 (3) , 899-904
Statistical Learning in Wasserstein Space
We seek a generalization of regression and principle component analysis (PCA) in a metric space where data points are distributions metrized by the Wasserstein metric. We recast these analyses as multimarginal optimal transport problems. The particular formulation allows efficient computation, ensures existence of optimal solutions, and admits a probabilistic interpretation over the space of paths (line segments). Application of the theory to the interpolation of empirical distributions, images, power spectra, as well as assessing uncertainty in experimental designs, is envisioned.
- 3 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 5 (3) , 899-904
Statistical Learning in Wasserstein Space
We seek a generalization of regression and principle component analysis (PCA) in a metric space where data points are distributions metrized by the Wasserstein metric. We recast these analyses as multimarginal optimal transport problems. The particular formulation allows efficient computation, ensures existence of optimal solutions, and admits a probabilistic interpretation over the space of paths (line segments). Application of the theory to the interpolation of empirical distributions, images, power spectra, as well as assessing uncertainty in experimental designs, is envisioned.
- 1 January 2018
- Published by Inderscience Publishers in International Journal of Services and Operations Management
- Vol. 30 (2) , 203
The bi-team orienteering problem with time window
In this paper three algorithms are designed to solve the bi-team orienteering problem with time window (BTOPTW) in which the aim is to minimise the total travel cost as well as maximising the score gained by the salesmen. In one of them, a greedy algorithm tries to select the best solution from the initial solutions by a greedy procedure. The other algorithm constructs a solution by the GRASP and searches its neighbour solutions. The last algorithm is an extended version of previous algorithm augmented by the NSGA-II. Evaluation of the algorithms performances is done by comparing the results of the algorithm with the result of the improved augmented epsilon constraint (AUGMECON2) approach by some measures such as non-dominated Pareto size (NPS), spacing metric (SM), generational distance (GD), inverse generational distance (IGD) and set coverage metric (CS). The results confirm that NSGA-II algorithm has got satisfactory efficiency in an acceptable computational time.
- 1 January 2018
- Published by Inderscience Publishers in International Journal of Services and Operations Management
- Vol. 30 (2) , 203
The bi-team orienteering problem with time window
In this paper three algorithms are designed to solve the bi-team orienteering problem with time window (BTOPTW) in which the aim is to minimise the total travel cost as well as maximising the score gained by the salesmen. In one of them, a greedy algorithm tries to select the best solution from the initial solutions by a greedy procedure. The other algorithm constructs a solution by the GRASP and searches its neighbour solutions. The last algorithm is an extended version of previous algorithm augmented by the NSGA-II. Evaluation of the algorithms performances is done by comparing the results of the algorithm with the result of the improved augmented epsilon constraint (AUGMECON2) approach by some measures such as non-dominated Pareto size (NPS), spacing metric (SM), generational distance (GD), inverse generational distance (IGD) and set coverage metric (CS). The results confirm that NSGA-II algorithm has got satisfactory efficiency in an acceptable computational time.
- 28 November 2014
- Published by Elsevier
Noninvasive Cardiac Imaging