Related papers: A Note on the Expressiveness of BIP
Complex systems, from the human brain to the global economy, are made of multiple elements that interact in such ways that the behaviour of the `whole' often seems to be more than what is readily explainable in terms of the `sum of the…
The weak axiom of revealed preference (WARP) ensures that the revealed preference (i) is a preference relation (i.e., it is complete and transitive) and (ii) rationalizes the choices. However, when WARP fails, either one of these two…
In the partially-observed outcome setting, a recent set of proposals known as "prediction-powered inference" (PPI) involve (i) applying a pre-trained machine learning model to predict the response, and then (ii) using these predictions to…
Formal explainability guarantees the rigor of computed explanations, and so it is paramount in domains where rigor is critical, including those deemed high-risk. Unfortunately, since its inception formal explainability has been hampered by…
Coordination languages simplify design and development of concurrent systems. Particularly, exogenous coordination languages, like BIP and Reo, enable system designers to express the interactions among components in a system explicitly. In…
Biological networks are customarily described as structurally robust. This means that they often function extremely well under large forms of perturbations affecting both the concentrations and the kinetic parameters. In order to explain…
We study a variant of the principal-agent problem in which the principal does not directly observe the agent's effort outcome; rather, she gets a signal about the agent's action according to a variable information structure designed by a…
This paper develops a new approach to computational argumentation that is informed by philosophical and linguistic views. Namely, it takes into account two ideas that have received little attention in the literature on computational…
Two types of explanations have been receiving increased attention in the literature when analyzing the decisions made by classifiers. The first type explains why a decision was made and is known as a sufficient reason for the decision, also…
We give several characterizations of when a complete first-order theory $T$ is monadically NIP, i.e. when expansions of $T$ by arbitrary unary predicates do not have the independence property. The central characterization is a condition on…
Recovering and distinguishing between the strict-preference, indifference and/or indecisiveness parts of a decision maker's preferences is a challenging task but also important for testing theory and conducting welfare analysis. This paper…
This paper is a contribution to "neo-stability" type of result for abstract elementary classes. Under certain set theoretic assumptions, we propose a definition and a characterization of NIP in AECs. The class of AECs with NIP properly…
Assumption-based Argumentation (ABA) is a well-known structured argumentation formalism, whereby arguments and attacks between them are drawn from rules, defeasible assumptions and their contraries. A common restriction imposed on ABA…
Recognizing emotions from speech is a daunting task due to the subtlety and ambiguity of expressions. Traditional speech emotion recognition (SER) systems, which typically rely on a singular, precise emotion label, struggle with this…
A relationship between nilpotency and primeness in a module is investigated. Reduced modules are expressed as sums of prime modules. It is shown that presence of nilpotent module elements inhibits a module from possessing good structural…
We show that if a universal theory is not monadically NIP, then this is witnessed by a canonical configuration defined by an existential formula. As a consequence, we show that a hereditary class of relational structures is NIP (resp.…
Person Re-identification (ReID) systems that match individuals across images or video frames are essential in many real-world applications. However, existing methods are often influenced by attributes such as gender, pose, and body mass…
Recent work in recommender systems has emphasized the importance of fairness, with a particular interest in bias and transparency, in addition to predictive accuracy. In this paper, we focus on the state of the art pairwise ranking model,…
Quite recently, a new property related to norm-attaining operators has been introduced: the weak maximizing property (WMP). In this note, we define a generalised version of it considering other topologies than the weak one (mainly the…
(Maher 2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the…