English
Related papers

Related papers: Meaningfulness and Genericity in a Subsuming Frame…

200 papers

The desirable gambles framework provides a foundational approach to imprecise probability theory but relies heavily on linear utility assumptions. This paper introduces function-coherent gambles, a generalization that accommodates…

Theoretical Economics · Economics 2025-04-28 Gregory Wheeler

Ambiguity is ubiquitous in natural language. Resolving ambiguous meanings is especially important in information retrieval tasks. While word embeddings carry semantic information, they fail to handle ambiguity well. Transformer models have…

Computation and Language · Computer Science 2023-07-26 Matthias Thurnbauer , Johannes Reisinger , Christoph Goller , Andreas Fischer

The recent mass adoption of DNNs, even in safety-critical scenarios, has shifted the focus of the research community towards the creation of inherently intrepretable models. Concept Bottleneck Models (CBMs) constitute a popular approach…

Machine Learning · Computer Science 2023-08-22 Konstantinos P. Panousis , Dino Ienco , Diego Marcos

Concept Bottleneck Models (CBMs) provide explicit interpretations for deep neural networks through concepts and allow intervention with concepts to adjust final predictions. Existing CBMs assume concepts are conditionally independent given…

Machine Learning · Computer Science 2026-05-04 Haotian Xu , Tsui-Wei Weng , Lam M. Nguyen , Tengfei Ma

Deep learning models have achieved strong performance in medical image analysis, but their internal decision processes remain difficult to interpret. Concept Bottleneck Models (CBMs) partially address this limitation by structuring…

Computer Vision and Pattern Recognition · Computer Science 2026-03-24 Getamesay Dagnaw , Xuefei Yin , Muhammad Hassan Maqsood , Yanming Zhu , Alan Wee-Chung Liew

Several new network information dimension definitions have been proposed in recent decades, expanding the scope of applicability of this seminal tool. This paper proposes a new definition based on Deng entropy and d-summability (a concept…

Information Theory · Computer Science 2023-09-07 Aldo Ramirez-Arellano , Juan Bory--Reyes

The object of contextuality analysis is a set of random variables each of which is uniquely labeled by a content and a context. In the measurement terminology, the content is that which the random variable measures, whereas the context…

Quantum Physics · Physics 2018-09-05 Ehtibar N. Dzhafarov

The paper outlines a new development in the Contextuality-by-Default theory as applied to finite systems of binary random variables. The logic and principles of the original theory remain unchanged, but the definition of contextuality of a…

Quantum Physics · Physics 2016-10-26 Ehtibar N. Dzhafarov , Janne V. Kujala

Language is contextual as meanings of words are dependent on their contexts. Contextuality is, concomitantly, a well-defined concept in quantum mechanics where it is considered a major resource for quantum computations. We investigate…

Computation and Language · Computer Science 2021-08-02 Daphne Wang , Mehrnoosh Sadrzadeh , Samson Abramsky , Victor H. Cervantes

The history of complementary observables and mutual unbiased bases is reviewed. A characterization is given in terms of conditional entropy of subalgebras. The concept of complementarity is extended to non-commutative subalgebras.…

Mathematical Physics · Physics 2009-11-13 D. Petz , A. Szanto , M. Weiner

We develop the theory of frames and Parseval frames for finite-dimensional vector spaces over the binary numbers. This includes characterizations which are similar to frames and Parseval frames for real or complex Hilbert spaces, and the…

Functional Analysis · Mathematics 2009-06-19 Bernhard G. Bodmann , My Le , Letty Reza , Matthew Tobin , Mark Tomforde

Concept Bottleneck Models (CBMs) enhance interpretability by predicting human-understandable concepts as intermediate representations. However, existing CBMs often suffer from input-to-concept mapping bias and limited controllability, which…

Computer Vision and Pattern Recognition · Computer Science 2026-04-10 Gaoxiang Huang , Songning Lai , Yutao Yue

Due to the lack of structured knowledge applied in learning distributed representation of categories, existing work cannot incorporate category hierarchies into entity information.~We propose a framework that embeds entities and categories…

Computation and Language · Computer Science 2016-05-16 Yuezhang Li , Ronghuo Zheng , Tian Tian , Zhiting Hu , Rahul Iyer , Katia Sycara

We set up a parametrised monadic translation for a class of call-by-value functional languages, and prove a corresponding soundness theorem. We then present a series of concrete instantiations of our translation, demonstrating that a number…

Logic in Computer Science · Computer Science 2023-06-22 Thomas Powell

Quantum contextuality is the key concept which explains the fact that the result of a measurement is not independent of the context in which it is found. It is observed to be an intrinsic feature, i.e., neither entanglement nor spatial…

Quantum Physics · Physics 2023-02-23 Firat Diker , Zafer Gedik

Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…

Geometric Topology · Mathematics 2021-12-30 Christoph Dorn , Christopher L. Douglas

Due to the lack of structured knowledge applied in learning distributed representation of cate- gories, existing work cannot incorporate category hierarchies into entity information. We propose a framework that embeds entities and…

Computation and Language · Computer Science 2016-07-28 Yuezhang Li , Ronghuo Zheng , Tian Tian , Zhiting Hu , Rahul Iyer , Katia Sycara

The finite set of subsystems of a finite quantum system with variables in ${\mathbb Z}(n)$, is studied as a Heyting algebra. The physical meaning of the logical connectives is discussed. It is shown that disjunction of subsystems is more…

Quantum Physics · Physics 2015-06-17 A. Vourdas

As deep neural networks (DNNs) get adopted in an ever-increasing number of applications, explainability has emerged as a crucial desideratum for these models. In many real-world tasks, one of the principal reasons for requiring…

Artificial Intelligence · Computer Science 2020-07-03 Vedant Nanda , Till Speicher , John P. Dickerson , Krishna P. Gummadi , Muhammad Bilal Zafar

Textual Concept Bottleneck Models (TCBMs) are interpretable-by-design models for text classification that predict a set of salient concepts before making the final prediction. This paper proposes Complete Textual Concept Bottleneck Model…

Computation and Language · Computer Science 2025-05-29 Milan Bhan , Yann Choho , Pierre Moreau , Jean-Noel Vittaut , Nicolas Chesneau , Marie-Jeanne Lesot