We explore aversion to the use of algorithms in moral decision-making. So far, this aversion has been explained mainly by the fear of opaque decisions that are potentially biased. Using incentivized experiments, we study which role the desire for human discretion in moral decision-making plays. This seems justified in light of evidence suggesting that people might not doubt the quality of algorithmic decisions, but still reject them. In our first study, we found that people prefer humans with decision-making discretion (...) to algorithms that rigidly apply exogenously given human-created fairness principles to specific cases. In the second study, we found that people do not prefer humans to algorithms because they appreciate flesh-and-blood decision-makers per se, but because they appreciate humans’ freedom to transcend fairness principles at will. Our results contribute to a deeper understanding of algorithm aversion. They indicate that emphasizing the transparency of algorithms that clearly follow fairness principles might not be the only element for fostering societal algorithm acceptance and suggest reconsidering certain features of the decision-making process. (shrink)

Over the years, companies have adopted hiring algorithms because they promise wider job candidate pools, lower recruitment costs and less human bias. Despite these promises, they also bring perils. Using them can inflict unintentional harms on individual human rights. These include the five human rights to work, equality and nondiscrimination, privacy, free expression and free association. Despite the human rights harms of hiring algorithms, the AI ethics literature has predominantly focused on abstract ethical principles. This is problematic for (...) two reasons. First, AI principles have been criticized for being vague and not actionable. Second, the use of vague ethical principles to discuss algorithmic risks does not provide any accountability. This lack of accountability creates an algorithmic accountability gap. Closing this gap is crucial because, without accountability, the use of hiring algorithms can lead to discrimination and unequal access to employment opportunities. This paper makes two contributions to the AI ethics literature. First, it frames the ethical risks of hiring algorithms using international human rights law as a universal standard for determining algorithmic accountability. Second, it evaluates four types of algorithmic impact assessments in terms of how effectively they address the five human rights of job applicants implicated in hiring algorithms. It determines which of the assessments can help companies audit their hiring algorithms and close the algorithmic accountability gap. (shrink)

Part of understanding the meaning and power of algorithms means asking what new demands they might make of ethical frameworks, and how they might be held accountable to ethical standards. I develop a definition of networked information algorithms as assemblages of institutionally situated code, practices, and norms with the power to create, sustain, and signify relationships among people and data through minimally observable, semiautonomous action. Starting from Merrill’s prompt to see ethics as the study of “what we ought (...) to do,” I examine ethical dimensions of contemporary NIAs. Specifically, in an effort to sketch an empirically grounded, pragmatic ethics of algorithms, I trace an algorithmic assemblage’s power to convene constituents, suggest actions based on perceived similarity and probability, and govern the timing and timeframes of ethical action. (shrink)

A common criticism of the use of algorithms in criminal justice is that algorithms and their determinations are in some sense ‘opaque’—that is, difficult or impossible to understand, whether because of their complexity or because of intellectual property protections. Scholars have noted some key problems with opacity, including that opacity can mask unfair treatment and threaten public accountability. In this paper, we explore a different but related concern with algorithmic opacity, which centers on the role of public trust (...) in grounding the legitimacy of criminal justice institutions. We argue that algorithmic opacity threatens the trustworthiness of criminal justice institutions, which in turn threatens their legitimacy. We first offer an account of institutional trustworthiness before showing how opacity threatens to undermine an institution’s trustworthiness. We then explore how threats to trustworthiness affect institutional legitimacy. Finally, we offer some policy recommendations to mitigate the threat to trustworthiness posed by the opacity problem. (shrink)

This article reads the uptake of facial-matching algorithms by fertility clinics in Spain through the lens of ‘the fertility fix’: a software fix to the social reconfiguration of kinship and a fixed capital investment made by competing fertility companies and firms. ‘The fertility fix’ is proposed as a critical, ethical lens through which to situate algorithmic facial-matching in assisted reproduction in the context of the racial politics of the face and phenotype and the spatial politics of market expansion. While (...) an ‘infertility crisis’ is often mentioned when explaining the growth of the assisted reproductive technologies (ARTs) industry, the use of donated reproductive cells is tied up in societal, ecological and economic shifts. Combining Software Studies analysis with Marxist Feminist and trans*feminist perspectives on shifting re/production dynamics, the article details the role of computational technologies in promoting certain ideas and beliefs about family and fixing certain territories of capital flow. (shrink)

Artificial intelligence is increasingly permeating many types of high-stake societal decision-making such as the work at the criminal courts. Various types of algorithmic tools have already been introduced into sentencing. This article concerns the use of algorithms designed to deliver sentence recommendations. More precisely, it is considered how one should determine whether one type of sentencing algorithm (e.g., a model based on machine learning) would be ethically preferable to another type of sentencing algorithm (e.g., a model based on old-fashioned (...) programming). Whether the implementation of sentencing algorithms is ethically desirable obviously depends upon various questions. For instance, some of the traditional issues that have received considerable attention are algorithmic biases and lack of transparency. However, the purpose of this article is to direct attention to a further challenge that has not yet been considered in the discussion of sentencing algorithms. That is, even if is assumed that the traditional challenges concerning biases, transparency, and cost-efficiency have all been solved or proven insubstantial, there will be a further serious challenge associated with the comparison of sentencing algorithms; namely, that we do not yet possess an ethically plausible and applicable criterion for assessing how well sentencing algorithms are performing. (shrink)

This article reads the uptake of facial-matching algorithms by fertility clinics in Spain through the lens of ‘the fertility fix’: a software fix to the social reconfiguration of kinship and a fixed capital investment made by competing fertility companies and firms. ‘The fertility fix’ is proposed as a critical, ethical lens through which to situate algorithmic facial-matching in assisted reproduction in the context of the racial politics of the face and phenotype and the spatial politics of market expansion. While (...) an ‘infertility crisis’ is often mentioned when explaining the growth of the assisted reproductive technologies (ARTs) industry, the use of donated reproductive cells is tied up in societal, ecological and economic shifts. Combining Software Studies analysis with Marxist Feminist and trans*feminist perspectives on shifting re/production dynamics, the article details the role of computational technologies in promoting certain ideas and beliefs about family and fixing certain territories of capital flow. (shrink)

The use of black box algorithms in medicine has raised scholarly concerns due to their opaqueness and lack of trustworthiness. Concerns about potential bias, accountability and responsibility, patient autonomy and compromised trust transpire with black box algorithms. These worries connect epistemic concerns with normative issues. In this paper, we outline that black box algorithms are less problematic for epistemic reasons than many scholars seem to believe. By outlining that more transparency in algorithms is not always necessary, (...) and by explaining that computational processes are indeed methodologically opaque to humans, we argue that the reliability of algorithms provides reasons for trusting the outcomes of medical artificial intelligence. To this end, we explain how computational reliabilism, which does not require transparency and supports the reliability of algorithms, justifies the belief that results of medical AI are to be trusted. We also argue that several ethical concerns remain with black box algorithms, even when the results are trustworthy. Having justified knowledge from reliable indicators is, therefore, necessary but not sufficient for normatively justifying physicians to act. This means that deliberation about the results of reliable algorithms is required to find out what is a desirable action. Thus understood, we argue that such challenges should not dismiss the use of black box algorithms altogether but should inform the way in which these algorithms are designed and implemented. When physicians are trained to acquire the necessary skills and expertise, and collaborate with medical informatics and data scientists, black box algorithms can contribute to improving medical care. (shrink)

Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description logics have turned out to be closely related to propositional modal logics and logics of programs (such as propositional dynamic logic), for (...) which tableau procedures have been quite successful.Nevertheless, due to different underlying institutions and applications, most description logics differ significantly from run-of-the-mill modal and program logics. Consequently, the research on tableau algorithms in description logics led to new techniques and results, which are, however, also of interest for modal logicians. In this article, we will focus on three features that play an important rôle in description logics (number restrictions, terminological axioms, and role constructors), and show how they can be taken into account by tableau algorithms. (shrink)

Spatial and diagrammatic reasoning is a significant part not only of logical abilities, but also of logical studies. The authors of this paper consider some novel trends in studying this type of reasoning. They show that there are the following two main trends in spatial logic: (i) logical studies of the distribution of various objects in space (logic of geometry, logic of colors, etc.); (ii) logical studies of the space algorithms applied by nature itself (logic of swarms, logic of (...) fungi colonies, etc.). (shrink)

This article considers the issue of opacity as a problem for socially consequential mechanisms of classification and ranking, such as spam filters, credit card fraud detection, search engines, news trends, market segmentation and advertising, insurance or loan qualification, and credit scoring. These mechanisms of classification all frequently rely on computational algorithms, and in many cases on machine learning algorithms to do this work. In this article, I draw a distinction between three forms of opacity: opacity as intentional corporate (...) or state secrecy, opacity as technical illiteracy, and an opacity that arises from the characteristics of machine learning algorithms and the scale required to apply them usefully. The analysis in this article gets inside the algorithms themselves. I cite existing literatures in computer science, known industry practices, and do some testing and manipulation of code as a form of lightweight code audit. I argue that recognizing the distinct forms of opacity that may be coming into play in a given application is a key to determining which of a variety of technical and non-technical solutions could help to prevent harm. (shrink)

Mind and environment evolve in tandem—almost a platitude. Much of judgment and decision making research, however, has compared cognition to standard statistical models, rather than to how well it is adapted to its environment. The author argues two points. First, cognitive algorithms are tuned to certain information formats, most likely to those that humans have encountered during their evolutionary history. In par ticular, Bayesian computations are simpler when the information is in a frequency format than when it is in (...) a probability format. The author investigates whether fre quency formats can make physicians reason more often the Bayesian way. Second, cognitive algorithms need to operate under constraints of limited time, knowledge, and computational power, and they need to exploit the structures of their environments. The author describes a fast and frugal algorithm, Take The Best, that violates standard principles of rational inference but can be as accurate as sophisticated "optimal" mod els for diagnostic inference. Key words: Bayes' theorem; bounded rationality; infor mation format; probabilistic reasoning; satisficing; training; medical education. (shrink)

In order to better improve the teaching quality of university teachers, an effective method should be adopted for evaluation and analysis. This work studied the machine learning algorithms and selected the support vector machine (SVM) algorithm to evaluate teaching quality. First, the principles of selecting evaluation indexes were briefly introduced, and 16 evaluation indexes were selected from different aspects. Then, the SVM algorithm was used for evaluation. A genetic algorithm (GA)-SVM algorithm was designed and experimentally analyzed. It was found (...) that the training time and testing time of the GA-SVM algorithm were 23.21 and 7.25 ms, both of which were shorter than the SVM algorithm. In the evaluation of teaching quality, the evaluation value of the GA-SVM algorithm was closer to the actual value, indicating that the evaluation result was more accurate. The average accuracy of the GA-SVM algorithm was 11.64% higher than that of the SVM algorithm (98.36 vs 86.72%). The experimental results verify that the GA-SVM algorithm can have a good application in evaluating and analyzing teaching quality in universities with its advantages in efficiency and accuracy. (shrink)

Episodic memory is memory for past events. It’s characteristically associated with an experience of ‘mentally replaying’ one’s experiences in the mind’s eye. This biological phenomenon has inspired the development of several ‘experience replay’ algorithms in AI. In this chapter, I ask whether experience replay algorithms might shed light on a puzzle about episodic memory’s function: what does episodic memory contribute to the cognitive systems in which it is found? I argue that experience replay algorithms can serve as (...) idealized models of episodic memory for the purposes of addressing this question. Taking the DQN algorithm as a case study, I suggest that these algorithms provide some support for mnemonic accounts, on which episodic memory’s function lies in the storage, encoding and retrieval of information. By extending and adapting experience replay algorithms, we might gain further insight into episodic memory’s operations and contributions to cognition. (shrink)

:Brain–computer interfaces are driven essentially by algorithms; however, the ethical role of such algorithms has so far been neglected in the ethical assessment of BCIs. The goal of this article is therefore twofold: First, it aims to offer insights into whether the problems related to the ethics of BCIs can be better grasped with the help of already existing work on the ethics of algorithms. As a second goal, the article explores what kinds of solutions are available (...) in that body of scholarship, and how these solutions relate to some of the ethical questions around BCIs. In short, the article asks what lessons can be learned about the ethics of BCIs from looking at the ethics of algorithms. To achieve these goals, the article proceeds as follows. First, a brief introduction into the algorithmic background of BCIs is given. Second, the debate about epistemic concerns and the ethics of algorithms is sketched. Finally, this debate is transferred to the ethics of BCIs. (shrink)

Fears of black-box algorithms are multiplying. Black-box algorithms are said to prevent accountability, make it harder to detect bias and so on. Some fears concern the epistemology of black-box algorithms in medicine and the ethical implications of that epistemology. Durán and Jongsma (2021) have recently sought to allay such fears. While some of their arguments are compelling, we still see reasons for fear.

This paper reconstructs the history of the introduction and use of iterative algorithms in conservation biology in the 1980s and early 1990s in order to prioritize areas for protection as nature reserves. The importance of these algorithms was that they led to greater economy in spatial extent (“efficiency”) in the selection of areas to represent biological features adequately (that is, to a specified level) compared to older methods of scoring and ranking areas using criteria such as biotic “richness” (...) (the number of features of interest). The development of these algorithms was critical to producing a research program for conservation biology that was distinct from ecology and eventually led to what came to be called systematic conservation planning. Very similar algorithmic approaches were introduced independently in the 1980–1990 period in Australia, South Africa, and (arguably) the United Kingdom. The key rules in these algorithms were the use of rarity and what came to be called complementarity (the number of new or under-represented features in an area relative to those that had already been selected). Because these algorithms were heuristic, they were not guaranteed to produce optimal (most “efficient”) solutions. However, complementarity came to be seen as a principle rather than a rule in an algorithm and its use was also advocated for the former reason. Optimal solutions could be produced by reformulating the reserve selection problem in a mathematical programming formalism and using exact algorithms developed in that context. A dispute over the relevance of full optimality arose and was never resolved. Moreover, exact algorithms could not easily incorporate criteria determining the spatial configuration of networks of selected areas, in contrast to heuristic algorithms. Meanwhile metaheuristic algorithms emerged in the 1990s and came to be seen as a credible more effective alternative to the heuristic algorithms. Ultimately what was important about these developments was that the reserve selection problem came to be viewed a complex optimal decision problem under uncertainty, resource, and other constraints. It was a type of problem that had no antecedent in traditional ecology. (shrink)

Volume 23, Issue 3-4, November - December 2024, Page 251-263.

erative clustering. First, we show formally that the common heuristic agglomerative clustering algorithms – Ward’s method, single-link, complete-link, and a variant of group-average – are each equivalent to a hierarchical model-based method. This interpretation gives a theoretical explanation of the empirical behavior of these algorithms, as well as a principled approach to resolving practical issues, such as number of clusters or the choice of method. Second, we show how a model-based viewpoint can suggest variations on these basic agglomerative (...) algorithms. We introduce adjusted complete-link, Mahalanobis-link, and line-link as variants, and demonstrate their utility. (shrink)

This paper begins with the thought that there is something out of place about offloading inquiry into one's own mind to AI. The paper's primary goal is to articulate the unease felt when considering cases of doing so. It draws a parallel between the use of algorithms in the criminal law: in both cases one feels entitled to be treated as an exception to a verdict made on the basis of a certain kind of evidence. Then it identifies an (...) account of first‐person authority that can make good on this: agentialism. Thus, the paper constitutes an argument in favor of an agentialist treatment of self‐knowledge and first‐person authority. (shrink)

A growing number of studies on fairness in artificial intelligence (AI) use the notion of intersectionality to measure AI fairness. Most of these studies take intersectional fairness to be a matter of statistical parity among intersectional subgroups: an AI algorithm is “intersectionally fair” if the probability of the outcome is roughly the same across all subgroups defined by different combinations of the protected attributes. This paper identifies and examines three fundamental problems with this dominant interpretation of intersectional fairness in AI. (...) First, the dominant approach is so preoccupied with the intersection of attributes/categories (e.g., race, gender) that it fails to address the intersection of oppression (e.g., racism, sexism), which is more central to intersectionality as a critical framework. Second, the dominant approach faces a dilemma between infinite regress and fairness gerrymandering: it either keeps splitting groups into smaller subgroups or arbitrarily selects protected groups. Lastly, the dominant view fails to capture what it really means for AI algorithms to be fair, in terms of both distributive and non-distributive fairness. I distinguish a strong sense of AI fairness from a weak sense that is prevalent in the literature, and conclude by envisioning paths towards strong intersectional fairness in AI. (shrink)

Abstract This chapter is interested in the epistemology of algorithms. As I intend to approach the topic, this is an issue about epistemic justification. Current approaches to justification emphasize the transparency of algorithms, which entails elucidating their internal mechanisms –such as functions and variables– and demonstrating how (or that) these produce outputs. Thus, the mode of justification through transparency is contingent on what can be shown about the algorithm and, in this sense, is internal to the algorithm. In (...) contrast, I advocate for an externalist epistemology of algorithms that I term computational reliabilism (CR). While I have previously introduced and examined CR in the field of computer simulations ([42, 53, 4]), this chapter extends this reliabilist epistemology to encompass a broader spectrum of algorithms utilized in various scientific disciplines, with a particular emphasis on machine learning applications. At its core, CR posits that an algorithm’s output is justified if it is produced by a reliable algorithm. A reliable algorithm is one that has been specified, coded, used, and maintained utilizing reliability indicators. These reliability indicators stem from formal methods, algorithmic metrics, expert competencies, cultures of research, and other scientific endeavors. The primary aim of this chapter is to delineate the foundations of CR, explicate its operational mechanisms, and outline its potential as an externalist epistemology of algorithms. (shrink)

We introduce a fairness criterion that we call Spanning. Spanning i) is implied by Calibration, ii) retains interesting properties of Calibration that some other ways of relaxing that criterion do not, and iii) unlike Calibration and other prominent ways of weakening it, is consistent with Equalized Odds outside of trivial cases.

In this article, I show why it is necessary to abolish the use of predictive algorithms in the US criminal justice system at sentencing. After presenting the functioning of these algorithms in their context of emergence, I offer three arguments to demonstrate why their abolition is imperative. First, I show that sentencing based on predictive algorithms induces a process of rewriting the temporality of the judged individual, flattening their life into a present inescapably doomed by its past. (...) Second, I demonstrate that recursive processes, comprising predictive algorithms and the decisions based on their predictions, systematically suppress outliers and progressively transform reality to match predictions. In my third and final argument, I show that decisions made on the basis of predictive algorithms actively perform a biopolitical understanding of justice as management and modulation of risks. In such a framework, justice becomes a means to maintain a perverse social homeostasis that systematically exposes disenfranchised Black and Brown populations to risk. (shrink)

A number of artificial intelligence systems have been proposed to assist users in identifying the issues of algorithmic fairness and transparency. These AI systems use diverse bias detection methods from various perspectives, including exploratory cues, interpretable tools, and revealing algorithms. This study explains the design of AI systems by probing how users make sense of fairness and transparency as they are hypothetical in nature, with no specific ways for evaluation. Focusing on individual perceptions of fairness and transparency, this study (...) examines the roles of normative values in over-the-top platforms by empirically testing their effects on sensemaking processes. A mixed-method design incorporating both qualitative and quantitative approaches was used to discover user heuristics and to test the effects of such normative values on user acceptance. Collectively, a composite concept of transparent fairness emerged around user sensemaking processes and its formative roles regarding their underlying relations to perceived quality and credibility. From a sensemaking perspective, this study discusses the implications of transparent fairness in algorithmic media platforms by clarifying how and what should be done to make algorithmic media more trustable and reliable platforms. Based on the findings, a theoretical model is developed to define transparent fairness as an essential algorithmic attribute in the context of OTT platforms. (shrink)

The original design of a software system is rarely prepared for every new requirement. Software systems should be updated frequently, which is usually accompanied by the decline in software modularity and quality. Although many approaches have been proposed to improve the quality of software, a majority of them are guided by metrics defined on the local properties of software. In this article, we propose to use a global metric borrowed from the network science to detect the moving method refactoring. First, (...) our approach uses a bipartite network to represent classes, features, and their dependencies. Second, a new metric is introduced to quantify the modularity of a software system as a whole. Finally, a crossover-only evolutionary algorithm that uses the metric as its fitness function is introduced to optimize the class structure of a software system and detect the methods that should be moved. Empirical results on the benchmark Java projects show that our approach can find meaningful methods that should be moved with a high stability. The advantages of our approach are illustrated in comparison with some other approaches, specifically one refactoring approach, namely search-based refactoring approach, and two community detection algorithms, namely a graph theoretic clustering algorithm and a fast algorithm for community detection. Our approach provides a new way to do refactoring from the perspective of software structure. (shrink)

This article draws on contributions from the Sociology of Science and Technology and Science and Technology Studies, the Sociology of Risk and Uncertainty, and the Sociology of Work, focusing on the transformations of employment regarding expanded automation, robotization and informatization. The new work patterns emerging due to the introduction of software and hardware technologies, which are based on artificial intelligence, algorithms, big data gathering and robotic systems are examined closely. This article attempts to “open the black boxes” of the (...) “black carpet” (robotic sorting system) and examine the reorganization of Greek postal services through the introduction of software and hardware technologies, highlighting a) the high risk of flexible, pluralistic, decentralized (under)employment and aspects of the sub-politics of automation, b) the new forms of work organization and c) aspects of labor precariousness as a result of de-specialization or “flexible expertise” interconnected with new forms of inequalities based on AI, algorithms, big data and robots as reflected in the lived experiences of workers. The above are investigated through primary empirical social research in postal service companies in Greece. (shrink)

In contrast to traditional research on base-rate neglect, an ecologically-oriented research program would analyze the correspondence between cognitive algorithms and the nature of information in the environment. Bayesian computations turn out to be simpler when information is represented in frequency formats as opposed to the probability formats used in previous research. Frequency formats often enable even uninstructed subjects to perform Bayesian reasoning.

Open Shop Scheduling Problem is one of the most important scheduling problems in the field of engineering and industry. This kind of problem includes m machines and n jobs, each job contains a certain number of operations, and each operation has a predetermined processing time on its corresponding machine. The order of processing of these operations affects the completion times of all jobs. Therefore, the purpose of OSSP is to achieve a proper order of processing of jobs using specified machines, (...) so that the completion time of all jobs is minimized. In this paper, the strengths and limitations of three methods are evaluated by comparing the results of solving the OSSP in large-scale and small-scale benchmarks. In this case, the minimized completion time and total tardiness are considered the objective functions of the adapted methods. To solve small-scale problems, we adapt a mathematical model called Multiobjective Mixed Linear Programming. To solve large-scale problems, two metaheuristic algorithms including Multiobjective Parallel Genetic Algorithm and Multiobjective Parallel Simulated Annealing are adapted. In experimental results, we randomly generated small-scale problems to compare MOMILP with the Genetic Algorithm and Simulate Annealing. To compare MOPSA and MOPGA with the state of the art and show their strengths and limitations, we use a standard large-scale benchmark. The simulation results of the proposed algorithms show that although the MOPSA algorithm is faster, the MOPGA algorithm is more efficient in achieving optimal solutions for large-scale problems compared with other methods. (shrink)

Link prediction is a key tool for studying the structure and evolution mechanism of complex networks. Recommending new friend relationships through accurate link prediction is one of the important factors in the evolution, development, and popularization of social networks. At present, scholars have proposed many link prediction algorithms based on the similarity of local information and random walks. These algorithms help identify actual missing and false links in various networks. However, the prediction results significantly differ in networks with (...) various structures, and the prediction accuracy is low. This study proposes a method for improving the accuracy of link prediction. Before link prediction, k-shell decomposition method is used to layer the network, and the nodes that are in 1-shell and the nodes that are not linked to the high-shell in the 2-shell are deleted. The experiments on four real network datasets verify the effectiveness of the proposed method. (shrink)

The increasing implementation of and reliance on machine-learning (ML) algorithms to perform tasks, deliver services and make decisions in health and healthcare have made the need for fairness in ML, and more specifically in healthcare ML algorithms (HMLA), a very important and urgent task. However, while the debate on fairness in the ethics of artificial intelligence (AI) and in HMLA has grown significantly over the last decade, the very concept of fairness as an ethical value has not yet (...) been sufficiently explored. Our paper aims to fill this gap and address the AI ethics principle of fairness from a conceptual standpoint, drawing insights from accounts of fairness elaborated in moral philosophy and using them to conceptualise fairness as an ethical value and to redefine fairness in HMLA accordingly. To achieve our goal, following a first section aimed at clarifying the background, methodology and structure of the paper, in the second section, we provide an overview of the discussion of the AI ethics principle of fairness in HMLA and show that the concept of fairness underlying this debate is framed in purely distributive terms and overlaps with non-discrimination, which is defined in turn as the absence of biases. After showing that this framing is inadequate, in the third section, we pursue an ethical inquiry into the concept of fairness and argue that fairness ought to be conceived of as an ethical value. Following a clarification of the relationship between fairness and non-discrimination, we show that the two do not overlap and that fairness requires much more than just non-discrimination. Moreover, we highlight that fairness not only has a distributive but also a socio-relational dimension. Finally, we pinpoint the constitutive components of fairness. In doing so, we base our arguments on a renewed reflection on the concept of respect, which goes beyond the idea of equal respect to include respect for individual persons. In the fourth section, we analyse the implications of our conceptual redefinition of fairness as an ethical value in the discussion of fairness in HMLA. Here, we claim that fairness requires more than non-discrimination and the absence of biases as well as more than just distribution; it needs to ensure that HMLA respects persons both as persons and as particular individuals. Finally, in the fifth section, we sketch some broader implications and show how our inquiry can contribute to making HMLA and, more generally, AI promote the social good and a fairer society. (shrink)

We examine the performance of some standard causal discovery algorithms, both constraint-based and score-based, from the perspective of how robust they are against failures of the Causal Faithfulness Assumption. For this purpose, we make only the so-called Triangle-Faithfulness assumption, which is a fairly weak consequence of the Faithfulness assumption, and otherwise allows unfaithful distributions. In particular, we allow violations of Adjacency-Faithfulness and Orientation-Faithfulness. We show that the PC algorithm, a representative constraint-based method, can be made more robust against unfaithfulness (...) by incorporating elements of the GES algorithm, a representative score-based method; similarly, the GES algorithm can be made less error-prone by incorporating elements of the conservative PC algorithm. As our simulations demonstrate, the increased robustness seems to matter even when faithfulness is not exactly violated, for with only finite sample, distributions that are not exactly unfaithful may be sufficiently close to being unfaithful to make trouble. (shrink)

There Are No Facts examines the uncommon ground we share in a post-truth world. It unpacks how attentive algorithms and extractive data practices are shaping space, influencing behavior and colonizing everyday life. Articulating post-truth territory as an architectural and infrastructural condition, it shows how these spatial architectures of attention and datamining are in turn situated within broader histories of empiricism, objectivity, science, colonialism and perception. These entanglements of people and data, code and space, knowledge and power are considered across (...) scales ranging from the trans-locality of the home to the planetary extent of the COVID-19 pandemic, with stops along the way at the corner bodega, a neighborhood for the proverbial 1%, a waterfront district in Toronto, and a national election. Through an introduction, nine chapters and a coda, the book addresses the erosion of a common ground on which truth claims were once negotiated and the epistemic fragmentation that results. It probes how these socio-technical systems bracket what we know about the world, how they construe our agency to act within it, and how they shape these spaces that, in turn, shape us. (shrink)

The recent terrorist attacks and ongoing state of emergency in France have brought questions of police surveillance into the public spotlight, making it increasingly important to understand how police attain data from citizens. Since 2005, the French police have been using IBM’s computer program, i2 Analyst’s Notebook, to aggregate information and craft criminal narratives. This technology serves to quickly connect suspects with crimes, looking for as many associations as possible, ranking and visualizing them based on level of importance. Recently, surveillance (...) and state power have been theorized as having shifted to a posthegemonic, order. Drawing from literature on power, surveillance, and identity, this paper considers the various ways that algorithms can impact policing under a state of emergency by comparing the technical protocol of i2 Analyst’s Notebook with the administrative protocol of the French state. Using i2 Analyst’s Notebook as an example, this paper argues that posthegemonic theories of power have their place in determining how algorithms can be used for surveillance, but that they cannot completely explain their use under the state of emergency. (shrink)

Bioethics, Volume 36, Issue 2, Page 134-142, February 2022.

Overview • Alloy peculiarity • Alloy utilities • Assignments and pre- and postconditions in Alloy • Alloy for automated logical reasoning • Alloy specifications of algorithms • On your to do list: – Look through the example code in these slides, – make sure you understand what is happening. Note: Alloy Peculiarity..

Despite widespread recognition of an emergent politics of data in our midst, we strikingly lack a political theory of data. We readily acknowledge the presence of data across our political lives, but we often do not know how to conceptualize the politics of all those data points—the forms of power they constitute and the kinds of political subjects they implicate. Recent work in numerous academic disciplines is evidence of the first steps toward a political theory of data. This article maps (...) some limits of this emergent literature with an eye to enriching its theoretical range. The literature on data politics, both within political theory and elsewhere, has thus far focused almost exclusively on the algorithm. This article locates a further dimension of data politics in the work of formatting technology or, more simply, formats. Formats are simultaneously conceptual and technical in the ways they define what can even count as data, and by extension who can count as data and how they can count. A focus on formats is of theoretical value because it provides a bridge between work on the conceptual contours of categories and the technology-centric literature on algorithms that tends to ignore the more conceptual dimensions of data technology. The political insight enabled by format theory is shown in the context of an extended interrogation of the politics of racialized redlining. (shrink)

Purpose Algorithms are in the mainstream media news on an almost daily basis. Their context is invariably artificial intelligence and machine learning decision-making. In media articles, algorithms are described as powerful, autonomous actors that have a capability of producing actions that have consequences. Despite a tendency for deification, the prevailing critique of algorithms focuses on ethical concerns raised by decisions resulting from algorithmic processing. However, the purpose of this paper is to propose that the ethical concerns discussed (...) are limited in scope and suggest that it is not clear what concerns dominate the debate. Design/methodology/approach The paper uses a systematic mapping study approach to review articles appearing in leading UK national papers from the perspective of the ethical concerns over a period of one year. The articles are categorised using a widely cited framework detailing a taxonomy of ethical concerns. The UK context is important because of UK public policy initiatives around AI. Findings The research presented in this paper contributes the first systematic mapping study of articles appearing in leading UK national papers from the perspective of widely accepted ethical concerns such as inscrutable evidence, misguided evidence, unfair outcomes and transformative effects. Originality/value The research presented in this paper contributes the first systematic mapping study of articles appearing in leading UK national papers from the perspective of the ethical concerns. The UK context is important because of UK public policy initiatives around AI. To review the media content from the perspective of ethical concerns, this paper uses the synthesised conceptual map of ethical concerns developed by Mittelstad et al. Given the dominance of that framework, this paper’s contribution is also an important instantiation and experimental validation of using that conceptual map. (shrink)

Search engines are important contemporary sources of information and contribute to shaping our beliefs about the world. Each time they are consulted, various algorithms filter and order content to show us relevant results for the inputted search query. Because these search engines are frequently and widely consulted, it is necessary to have a clear understanding of the distinctively epistemic role that these algorithms play in the background of our online experiences. To aid in such understanding, this paper argues (...) that search engine algorithms are providers of “bent testimony”—that, within certain contexts of interactions, users act as if these algorithms provide us with testimony—and acquire or alter beliefs on that basis. Specifically, we treat search engine algorithms as if they were asserting as true the content ordered at the top of a search results page—which has interesting parallels with how we might treat an ordinary testifier. As such, existing discussions in the philosophy of testimony can help us better understand and, in turn, improve our interactions with search engines. By explicating the mechanisms by which we come to accept this “bent testimony,” our paper discusses methods to help us control our epistemic reliance on search engine algorithms and clarifies the normative expectations one ought to place on the search engines that deploy these algorithms. (shrink)