English
Related papers

Related papers: Minimum Description Length and Compositionality

200 papers

The Contextuality-by-Default approach to determining and measuring the (non)contextuality of a system of random variables requires that every random variable in the system be represented by an equivalent set of dichotomous random variables.…

Quantum Physics · Physics 2022-01-05 Janne V. Kujala , Ehtibar N. Dzhafarov

We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general.…

Formal Languages and Automata Theory · Computer Science 2009-07-30 Hermann Gruber , Markus Holzer , Martin Kutrib

We define a probabilistic programming language for Gaussian random variables with a first-class exact conditioning construct. We give operational, denotational and equational semantics for this language, establishing convenient properties…

Programming Languages · Computer Science 2021-01-28 Dario Stein , Sam Staton

In this paper we argue that (lexical) meaning in science can be represented in a 13 dimension Meaning Space. This space is constructed using principal component analysis (singular decomposition) on the matrix of word category relative…

Computation and Language · Computer Science 2020-09-21 Neslihan Suzen , Alexander Gorban , Jeremy Levesley , Evgeny Mirkes

Quantum logic aims to capture essential quantum mechanical structure in order-theoretic terms. The Achilles' heel of quantum logic is the absence of a canonical description of composite systems, given descriptions of their components. We…

Quantum Physics · Physics 2013-05-10 Bob Coecke , Chris Heunen , Aleks Kissinger

We propose an operational, quantitative definition of intelligence for arbitrary physical systems. The intelligence density of a system is the ratio of the logarithm of its independent outputs to its total description length. A system…

Artificial Intelligence · Computer Science 2026-04-29 Kang-Sin Choi

The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mechanism takes a scenario describing the constituent interacting…

Artificial Intelligence · Computer Science 2011-07-04 J. Keppens , Q. Shen

We propose a new type of representation learning method that models words, phrases and sentences seamlessly. Our method does not depend on word segmentation and any human-annotated resources (e.g., word dictionaries), yet it is very…

Computation and Language · Computer Science 2019-05-30 Geewook Kim , Kazuki Fukui , Hidetoshi Shimodaira

Traditional language models treat language as a finite state automaton on a probability space over words. This is a very strong assumption when modeling something inherently complex such as language. In this paper, we challenge this by…

Computation and Language · Computer Science 2016-04-04 Kushal Arora , Anand Rangarajan

Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…

Computational Complexity · Computer Science 2010-06-29 Nadia Creignou , Johannes Schmidt , Michael Thomas

We describe a procedure for explaining neurons in deep representations by identifying compositional logical concepts that closely approximate neuron behavior. Compared to prior work that uses atomic labels as explanations, analyzing neurons…

Machine Learning · Computer Science 2021-02-04 Jesse Mu , Jacob Andreas

Composition methodologies in the current literature are mainly to promote estimation efficiency via direct composition, either, of initial estimators or of objective functions. In this paper, composite estimation is investigated for both…

Methodology · Statistics 2013-12-31 Lu Lin , Feng Li , Kangning Wang , Lixing Zhu

In this paper we introduce a word embedding composition method based on the intuitive idea that a fair embedding representation for a given set of words should satisfy that the new vector will be at the same distance of the vector…

Computation and Language · Computer Science 2024-06-18 Roberto Santana , Mauricio Romero Sicre

Any system based on axioms is incomplete because the axioms cannot be proven from the system, just believed. But one system can be less-incomplete than other. Neutrosophy is less-incomplete than many other systems because it contains them.…

General Mathematics · Mathematics 2007-05-23 Carlos Gershenson

The monomial basis for polynomials in N variables is labeled by compositions. To each composition there is associated a hook-length product, which is a product of linear functions of a parameter. The zeroes of this product are related to…

Combinatorics · Mathematics 2007-05-23 Charles F. Dunkl

The use of non-deterministic functions is a distinctive feature of modern functional logic languages. The semantics commonly adopted is call-time choice, a notion that at the operational level is related to the sharing mechanism of lazy…

Programming Languages · Computer Science 2009-03-13 Francisco Javier Lopez-Fraguas , Juan Rodriguez-Hortala , Jaime Sanchez-Hernandez

Idioms are unlike most phrases in two important ways. First, the words in an idiom have non-canonical meanings. Second, the non-canonical meanings of words in an idiom are contingent on the presence of other words in the idiom. Linguistic…

Computation and Language · Computer Science 2022-09-16 Michaela Socolof , Jackie Chi Kit Cheung , Michael Wagner , Timothy J. O'Donnell

Measuring inconsistency is viewed as an important issue related to handling inconsistencies. Good measures are supposed to satisfy a set of rational properties. However, defining sound properties is sometimes problematic. In this paper, we…

Artificial Intelligence · Computer Science 2014-06-03 Said Jabbour , Yue Ma , Badran Raddaoui , Lakhdar Sais , Yakoub Salhi

This paper is a theoretical contribution to the debate on the learnability of syntax from a corpus without explicit syntax-specific guidance. Our approach originates in the observable structure of a corpus, which we use to define and…

Computation and Language · Computer Science 2020-05-05 Raphaël Bailly , Kata Gábor

We study which standard operators of probabilistic process calculi allow for compositional reasoning with respect to bisimulation metric semantics. We argue that uniform continuity (generalizing the earlier proposed property of…

Logic in Computer Science · Computer Science 2019-03-14 Daniel Gebler , Kim G. Larsen , Simone Tini
‹ Prev 1 8 9 10 Next ›