English
Related papers

Related papers: Exceptional Subclasses in Qualitative Probability

200 papers

Recent work has shown that state-of-the-art classifiers are quite brittle, in the sense that a small adversarial change of an originally with high confidence correctly classified input leads to a wrong classification again with high…

Machine Learning · Computer Science 2017-11-07 Matthias Hein , Maksym Andriushchenko

Abstaining classifiers have the option to abstain from making predictions on inputs that they are unsure about. These classifiers are becoming increasingly popular in high-stakes decision-making problems, as they can withhold uncertain…

Machine Learning · Statistics 2023-11-10 Yo Joong Choe , Aditya Gangrade , Aaditya Ramdas

In default reasoning, usually not all possible ways of resolving conflicts between default rules are acceptable. Criteria expressing acceptable ways of resolving the conflicts may be hardwired in the inference mechanism, for example…

Artificial Intelligence · Computer Science 2011-05-30 J. Rintanen

Increasing amounts of available data have led to a heightened need for representing large-scale probabilistic knowledge bases. One approach is to use a probabilistic database, a model with strong assumptions that allow for efficiently…

Artificial Intelligence · Computer Science 2019-04-04 Tal Friedman , Guy Van den Broeck

In this work we describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T allowing to extend a knowledge base with inclusions of the form T(C) v D,…

Artificial Intelligence · Computer Science 2020-04-24 Laura Giordano , Valentina Gliozzi , Antonio Lieto , Nicola Olivetti , Gian Luca Pozzato

We present a new methodology for handling AI errors by introducing weakly supervised AI error correctors with a priori performance guarantees. These AI correctors are auxiliary maps whose role is to moderate the decisions of some previously…

An approach to reasoning with default rules where the proportion of exceptions, or more generally the probability of encountering an exception, can be at least roughly assessed is presented. It is based on local uncertainty propagation…

Artificial Intelligence · Computer Science 2013-03-26 Stephane Amarger , Didier Dubois , Henri Prade

Many binary classification problems minimize misclassification above (or below) a threshold. We show that instances of ranking problems, accuracy at the top or hypothesis testing may be written in this form. We propose a general framework…

Machine Learning · Computer Science 2020-02-26 Lukáš Adam , Václav Mácha , Václav Šmídl , Tomáš Pevný

We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which are obtained from the classical notion of logical entailment…

Artificial Intelligence · Computer Science 2013-01-14 Thomas Lukasiewicz

We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

Logic · Mathematics 2012-06-12 Andreas Fackler

In many large-scale classification problems, classes are organized in a known hierarchy, typically represented as a tree expressing the inclusion of classes in superclasses. We introduce a loss for this type of supervised hierarchical…

Computer Vision and Pattern Recognition · Computer Science 2024-11-26 Nicolas Urbani , Sylvain Rousseau , Yves Grandvalet , Leonardo Tanzi

One of the main reasons to employ a description logic such as EL or EL++ is the fact that it has efficient, polynomial-time algorithmic properties such as deciding consistency and inferring subsumption. However, simply by adding negation of…

Logic in Computer Science · Computer Science 2019-08-29 Marcelo Finger

An expert classification system having statistical information about the prior probabilities of the different classes should be able to use this knowledge to reduce the amount of additional information that it must collect, e.g., through…

Artificial Intelligence · Computer Science 2013-03-25 Yuping Qiu , Louis Anthony Cox, , Lawrence Davis

Anomaly detection is not an easy problem since distribution of anomalous samples is unknown a priori. We explore a novel method that gives a trade-off possibility between one-class and two-class approaches, and leads to a better performance…

Machine Learning · Statistics 2020-05-26 Maxim Borisyak , Artem Ryzhikov , Andrey Ustyuzhanin , Denis Derkach , Fedor Ratnikov , Olga Mineeva

Experiences with the implementation of strong Gr\"obner bases respectively standard bases for polynomial rings over principal ideal rings are explained: different strategies for creating the pair set, methods to avoid coefficient growth and…

Commutative Algebra · Mathematics 2016-09-15 Christian Eder , Gerhard Pfister , Adrian Popescu

We establish the global existence of a class of strongly coupled parabolic systems. The necessary apriori estimates will be obtained via our new approach to the regularity theory of parabolic scalar equations with integrable data and new…

Analysis of PDEs · Mathematics 2021-05-19 Dung Le

Object counting models suffer when deployed across domains with differing density variety, since density shifts are inherently task-relevant and violate standard domain adaptation assumptions. To address this, we propose a theoretical…

Computer Vision and Pattern Recognition · Computer Science 2025-11-03 Zhuonan Liang , Dongnan Liu , Jianan Fan , Yaxuan Song , Qiang Qu , Runnan Chen , Yu Yao , Peng Fu , Weidong Cai

This paper contributes to the theory of large cardinals beyond the Kunen inconsistency, or choiceless large cardinal axioms, in the context where the Axiom of Choice is not assumed. The first part of the paper investigates a periodicity…

Logic · Mathematics 2021-02-19 Gabriel Goldberg

English words and the outputs of many other natural processes are well-known to follow a Zipf distribution. Yet this thoroughly-established property has never been shown to help compress or predict these important processes. We show that…

Information Theory · Computer Science 2015-05-04 Moein Falahatgar , Ashkan Jafarpour , Alon Orlitsky , Venkatadheeraj Pichapati , Ananda Theertha Suresh

Most successful information extraction systems operate with access to a large collection of documents. In this work, we explore the task of acquiring and incorporating external evidence to improve extraction accuracy in domains where the…

Computation and Language · Computer Science 2016-09-29 Karthik Narasimhan , Adam Yala , Regina Barzilay