English
Related papers

Related papers: A note on the relationship between action accessib…

200 papers

We generalize the notion of an exact category and introduce weakly exact categories. A proof of the snake lemma in this general setting is given. Some applications are given to illustrate how one can do homological algebra in a weakly exact…

Category Theory · Mathematics 2009-01-19 Amir Jafari

Recent work has unveiled a theory for reasoning about the decisions made by binary classifiers: a classifier describes a Boolean function, and the reasons behind an instance being classified as positive are the prime-implicants of the…

Artificial Intelligence · Computer Science 2021-05-14 Niku Gorji , Sasha Rubin

In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular…

Formal Languages and Automata Theory · Computer Science 2015-08-20 Robert Mercaş

We show that not every family of generalized microscopic sets forms an ideal. Moreover, we prove that some of these families have some weaker additivity properties and some of them do not have even that.

General Topology · Mathematics 2017-09-26 Klaudiusz Czudek , Adam Kwela , Nikodem Mrożek , Wojciech Wołoszyn

In this paper, I argue that counterfactual fairness does not constitute a necessary condition for an algorithm to be fair, and subsequently suggest how the constraint can be modified in order to remedy this shortcoming. To this end, I…

Machine Learning · Computer Science 2020-11-17 Fabian Beigang

We consider an homogeneous action of a finite group on a free linear category over a field in order to prove that the subcategory of invariants is still free. Moreover we show that the representation type is preserved when considering…

Representation Theory · Mathematics 2018-06-12 Claude Cibils , Eduardo N. Marcos

This paper studies the relation between agreement and strongly linearizable implementations of various objects. This leads to new results about implementations of concurrent objects from various primitives including window registers and…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-03 Hagit Attiya , Armando Castañeda , Constantin Enea

In this paper, we advocate for representation learning as the key to mitigating unfair prediction outcomes downstream. Motivated by a scenario where learned representations are used by third parties with unknown objectives, we propose and…

Machine Learning · Computer Science 2018-10-23 David Madras , Elliot Creager , Toniann Pitassi , Richard Zemel

The recently introduced weakly disentangled representations proposed to relax some constraints of the previous definitions of disentanglement, in exchange for more flexibility. However, at the moment, weak disentanglement can only be…

Machine Learning · Computer Science 2022-09-13 Andrea Valenti , Davide Bacciu

The paper adresses the problem of reasoning with ambiguities. Semantic representations are presented that leave scope relations between quantifiers and/or other operators unspecified. Truth conditions are provided for these representations…

cmp-lg · Computer Science 2008-02-03 Uwe Reyle

From every pair of adjoint functors it is possible to produce a (possibly trivial) equivalence of categories by restricting to the subcategories where the unit and counit are isomorphisms. If we do this for the adjunction between effect…

Logic in Computer Science · Computer Science 2019-01-30 Robert Furber

Homotopical localizations with respect to (possibly proper) classes of maps are known to exist assuming the validity of a large-cardinal axiom from set theory called Vop\v{e}nka's principle. In this article, we prove that each of the…

Algebraic Topology · Mathematics 2024-10-29 Carles Casacuberta , Javier J. Gutiérrez

Matrix properties are a type of property of categories which includes the ones of being Mal'tsev, arithmetical, majority, unital, strongly unital and subtractive. Recently, an algorithm has been developed to determine implications…

Category Theory · Mathematics 2024-04-23 Michael Hoefnagel , Pierre-Alain Jacqmin

Gopal Prasad and A. S. Rapinchuk defined a notion of weakly commensurable lattices in a semisimple group, and gave a classification of weakly commensurable Zariski dense subgroups. A motivation was to classify pairs of locally symmetric…

Number Theory · Mathematics 2012-12-07 Chandrasheel Bhagwat , Supriya Pisolkar , C. S. Rajan

We introduce the concept of equivalence among Wilson actions. Applying the concept to a real scalar theory on a euclidean space, we derive the exact renormalization group transformation of K. G. Wilson, and give a simple proof of…

High Energy Physics - Theory · Physics 2016-06-21 H. Sonoda

We set general conditions under which the general poverty index, which summarizes all the available indices, is asymptotically represented with some empirical processes. This representation theorem offers a general key, in most directions,…

Methodology · Statistics 2014-05-23 Gane Samb Lo , Serigne Touba Sall

We outline a definition of accessible and presentable objects in a 2-category $\mathcal K$ endowed with a "KZ context", that is to say a pair of lax-idempotent monads interacting in a prescribed way; this perspective suggests a unified…

Category Theory · Mathematics 2025-08-05 Ivan Di Liberti , Fosco Loregian

Weak-to-strong generalization is a phenomenon in post-training whereby a strong student model, when finetuned solely with feedback from a weaker teacher, can not only surpass the teacher, but can improve upon its own capabilities. Recent…

Machine Learning · Computer Science 2026-05-08 Scott Geng , Dutch Hansen , Jerry Li

We introduce relative homological and weakly homological categories, where ``relative'' refers to a distinguished class of normal epimorphisms. It is a generalization of homological categories, but also protomodular categories can be…

Category Theory · Mathematics 2007-05-23 Tamar Janelidze

Abstract argumentation frameworks (AFs) are one of the most studied formalisms in AI. In this work, we introduce a certain subclass of AFs which we call compact. Given an extension-based semantics, the corresponding compact AFs are…

Artificial Intelligence · Computer Science 2014-05-01 Ringo Baumann , Wolfgang Dvorák , Thomas Linsbichler , Hannes Strass , Stefan Woltran
‹ Prev 1 8 9 10 Next ›