This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related

Contents
14 found
Order:
  1. An Impossibility Theorem for Base Rate Tracking and Equalised Odds.Rush T. Stewart, Benjamin Eva, Shanna Slank & Reuben Stern - forthcoming - Analysis.
    There is a theorem that shows that it is impossible for an algorithm to jointly satisfy the statistical fairness criteria of Calibration and Equalised Odds non-trivially. But what about the recently advocated alternative to Calibration, Base Rate Tracking? Here, we show that Base Rate Tracking is strictly weaker than Calibration, and then take up the question of whether it is possible to jointly satisfy Base Rate Tracking and Equalised Odds in non-trivial scenarios. We show that it is not, thereby establishing (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  2. A Dilemma for Solomonoff Prediction.Sven Neth - 2023 - Philosophy of Science 90 (2):288-306.
    The framework of Solomonoff prediction assigns prior probability to hypotheses inversely proportional to their Kolmogorov complexity. There are two well-known problems. First, the Solomonoff prior is relative to a choice of Universal Turing machine. Second, the Solomonoff prior is not computable. However, there are responses to both problems. Different Solomonoff priors converge with more and more data. Further, there are computable approximations to the Solomonoff prior. I argue that there is a tension between these two responses. This is because computable (...)
    Remove from this list   Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3. Machine-Believers Learning Faiths & Knowledges: The Gospel According to GPT.Virgil W. Brower - 2021 - Internationales Jahrbuch Für Medienphilosophie 7 (1):97-121.
    One is occasionally reminded of Foucault's proclamation in a 1970 interview that "perhaps, one day this century will be known as Deleuzian." Less often is one compelled to update and restart with a supplementary counter-proclamation of the mathematician, David Lindley: "the twenty-first century would be a Bayesian era..." The verb tenses of both are conspicuous. // To critically attend to what is today often feared and demonized, but also revered, deployed, and commonly referred to as algorithm(s), one cannot avoid the (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4. On the Possibility of Testimonial Justice.Rush T. Stewart & Michael Nielsen - 2020 - Australasian Journal of Philosophy 98 (4):732-746.
    Recent impossibility theorems for fair risk assessment extend to the domain of epistemic justice. We translate the relevant model, demonstrating that the problems of fair risk assessment and just credibility assessment are structurally the same. We motivate the fairness criteria involved in the theorems as also being appropriate in the setting of testimonial justice. Any account of testimonial justice that implies the fairness/justice criteria must be abandoned, on pain of triviality.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5. An open database of productivity in Vietnam's social sciences and humanities for public use.Quan-Hoang Vuong, Viet-Phuong La, Thu-Trang Vuong, Manh-Toan Ho, Hong K. T. Nguyen, Viet-Ha T. Nguyen, Hiep-Hung Pham & Manh-Tung Ho - 2018 - Scientific Data (Nature) 5 (180188):1-15.
    This study presents a description of an open database on scientific output of Vietnamese researchers in social sciences and humanities, one that corrects for the shortcomings in current research publication databases such as data duplication, slow update, and a substantial cost of doing science. Here, using scientists’ self-reports, open online sources and cross-checking with Scopus database, we introduce a manual system and its semi-automated version of the database on the profiles of 657 Vietnamese researchers in social sciences and humanities who (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  6. Conceptual Spaces for Cognitive Architectures: A Lingua Franca for Different Levels of Representation.Antonio Lieto, Antonio Chella & Marcello Frixione - 2017 - Biologically Inspired Cognitive Architectures 19:1-9.
    During the last decades, many cognitive architectures (CAs) have been realized adopting different assumptions about the organization and the representation of their knowledge level. Some of them (e.g. SOAR [35]) adopt a classical symbolic approach, some (e.g. LEABRA[ 48]) are based on a purely connectionist model, while others (e.g. CLARION [59]) adopt a hybrid approach combining connectionist and symbolic representational levels. Additionally, some attempts (e.g. biSOAR) trying to extend the representational capacities of CAs by integrating diagrammatical representations and reasoning are (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  7. A General Structure for Legal Arguments About Evidence Using Bayesian Networks.Norman Fenton, Martin Neil & David A. Lagnado - 2013 - Cognitive Science 37 (1):61-102.
    A Bayesian network (BN) is a graphical model of uncertainty that is especially well suited to legal arguments. It enables us to visualize and model dependencies between different hypotheses and pieces of evidence and to calculate the revised probability beliefs about all uncertain factors when any piece of new evidence is presented. Although BNs have been widely discussed and recently used in the context of legal arguments, there is no systematic, repeatable method for modeling legal arguments as BNs. Hence, where (...)
    Remove from this list   Direct download (3 more)  
     
    Export citation  
     
    Bookmark   37 citations  
  8. The new psychology of reasoning: A mental probability logical perspective.Niki Pfeifer - 2013 - Thinking and Reasoning 19 (3-4):329-345.
  9. Probabilistic Belief Contraction.Raghav Ramachandran, Arthur Ramer & Abhaya C. Nayak - 2012 - Minds and Machines 22 (4):325-351.
    Probabilistic belief contraction has been a much neglected topic in the field of probabilistic reasoning. This is due to the difficulty in establishing a reasonable reversal of the effect of Bayesian conditionalization on a probabilistic distribution. We show that indifferent contraction, a solution proposed by Ramer to this problem through a judicious use of the principle of maximum entropy, is a probabilistic version of a full meet contraction. We then propose variations of indifferent contraction, using both the Shannon entropy measure (...)
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  10. Explanations in K: An Analysis of Explanation as a Belief Revision Operation.Andrés Páez - 2006 - Athena Verlag.
    Explanation and understanding are intimately connected notions, but the nature of that connection has generally not been considered a topic worthy of serious philosophical investigation. Most authors have avoided making reference to the notion of understanding in their accounts of explanation because they fear that any mention of the epistemic states of the individuals involved compromises the objectivity of explanation. Understanding is a pragmatic notion, they argue, and pragmatics should be kept at a safe distance from the universal features of (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   6 citations  
  11. Nonmonotonic probabilistic reasoning under variable-strength inheritance with overriding.Thomas Lukasiewicz - 2005 - Synthese 146 (1-2):153 - 169.
    We present new probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment, called Zλ- and lexλ-entailment, which are parameterized through a value λ ∈ [0,1] that describes the strength of the inheritance of purely probabilistic knowledge. In the special cases of λ = 0 and λ = 1, the notions of Zλ- and lexλ-entailment coincide with probabilistic generalizations of Pearl’s entailment in System Z and Lehmann’s lexicographic entailment that have been recently introduced by the author. We show (...)
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  12. Belief revision and uncertain reasoning.Guy Politzer & Laure Carles - 2001 - Thinking and Reasoning 7 (3):217 – 234.
    When a new piece of information contradicts a currently held belief, one has to modify the set of beliefs in order to restore its consistency. In the case where it is necessary to give up a belief, some of them are less likely to be abandoned than others. The concept of epistemic entrenchment is used by some AI approaches to explain this fact based on formal properties of the belief set (e.g., transitivity). Two experiments were designed to test the hypothesis (...)
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  13. A note on Pollock's system of direct inference.Stephen Leeds - 1994 - Theory and Decision 36 (3):247-256.
  14. Probabilistic Inference and Probabilistic Reasoning. Kyburg - 1990 - Philosophical Topics 18 (2):107-116.