English
Related papers

Related papers: On Context Bisimulation for Parameterized Higher-o…

200 papers

A potentialist system is a first-order Kripke model based on embeddings. I define the notion of bisimulation for these systems, and provide a number of examples. Given a first-order theory $T$, the system $\mathrm{Mod}(T)$ consists of all…

Logic · Mathematics 2022-06-23 Sam Adam-Day

We discuss conditionalisation for Accept-Desirability models in an abstract decision-making framework, where uncertain rewards live in a general linear space, and events are special projection operators on that linear space. This abstract…

Artificial Intelligence · Computer Science 2025-12-23 Kathelijne Coussement , Gert de Cooman , Keano De Vos

Representing a word by its co-occurrences with other words in context is an effective way to capture the meaning of the word. However, the theory behind remains a challenge. In this work, taking the example of a word classification task, we…

Computation and Language · Computer Science 2017-07-14 Yanpeng Li

In a previous paper [Adcock & Huybrechs, 2019] we described the numerical approximation of functions using redundant sets and frames. Redundancy in the function representation offers enormous flexibility compared to using a basis, but…

Numerical Analysis · Mathematics 2020-07-13 Ben Adcock , Daan Huybrechs

In this thesis we use quasiorders on words to offer a new perspective on two well-studied problems from Formal Language Theory: deciding language inclusion and manipulating the finite automata representations of regular languages. First, we…

Formal Languages and Automata Theory · Computer Science 2020-08-21 Pedro Valero

Factorization machines (FMs) are a supervised learning approach that can use second-order feature combinations even when the data is very high-dimensional. Unfortunately, despite increasing interest in FMs, there exists to date no efficient…

Machine Learning · Statistics 2016-10-17 Mathieu Blondel , Akinori Fujino , Naonori Ueda , Masakazu Ishihata

This paper considers binomial approximation of continuous time stochastic processes. It is shown that, under some mild integrability conditions, a process can be approximated in mean square sense and in other strong metrics by binomial…

Computational Finance · Quantitative Finance 2015-02-09 Nikolai Dokuchaev

We present a variant of the theory of compatible functions on relations, due to Sangiorgi and Pous. We show that the up-to context proof technique for bisimulation is compatible in this setting for two subsets of the pi-calculus: the…

Logic in Computer Science · Computer Science 2022-06-06 Enguerrand Prebet

This paper formulates and studies the concepts of approximate (alternating) bisimulation relations characterizing equivalence relations between interconnected systems and their abstractions. These equivalence relations guarantee that the…

Systems and Control · Electrical Eng. & Systems 2022-11-21 Belamfedel Alaoui Sadek , Saharsh , Pushpak Jagtap , Adnane Saoud

Normalization is a pre-processing step that converts the data into a more usable representation. As part of the deep neural networks (DNNs), the batch normalization (BN) technique uses normalization to address the problem of internal…

Computer Vision and Pattern Recognition · Computer Science 2024-09-10 Bilal Faye , Mohamed-Djallel Dilmi , Hanane Azzag , Mustapha Lebbah , Djamel Bouchaffra

We investigate a new structure for machine learning classifiers applied to problems in high-energy physics by expanding the inputs to include not only measured features but also physics parameters. The physics parameters represent a…

High Energy Physics - Experiment · Physics 2016-05-25 Pierre Baldi , Kyle Cranmer , Taylor Faucett , Peter Sadowski , Daniel Whiteson

Psi-calculi is a parametric framework for extensions of the pi-calculus with data terms and arbitrary logics. In this framework there is no direct way to represent action priorities, where an action can execute only if all other enabled…

Logic in Computer Science · Computer Science 2014-08-08 Johannes Åman Pohjola , Joachim Parrow

Generalized contextuality is a possible indicator of non-classical behaviour in quantum information theory. In finite-dimensional systems, this is justified by the fact that noncontextual theories can be embedded into some simplex, i.e.…

The importance of parameter selection in supervised learning is well known. However, due to the many parameter combinations, an incomplete or an insufficient procedure is often applied. This situation may cause misleading or confusing…

Machine Learning · Computer Science 2021-07-13 Jie-Jyun Liu , Tsung-Han Yang , Si-An Chen , Chih-Jen Lin

We propose a principle for exploring context in machine learning models. Starting with a simple assumption that each observation may or may not depend on its context, a conditional probability distribution is decomposed into two parts:…

Machine Learning · Computer Science 2019-01-23 Yun Zeng

The compactness lemma in programming language theory states that any recursive function can be simulated by a finite unrolling of the function. One important use case it has is in the logical relations proof technique for proving properties…

Programming Languages · Computer Science 2024-05-06 Matias Scharager

Contextuality provides a unifying paradigm for nonclassical aspects of quantum probabilities and resources of quantum information. Unfortunately, most forms of quantum contextuality remain experimentally unexplored due to the difficulty of…

Quantum Physics · Physics 2016-03-02 Adán Cabello

A PhD student is locked inside a box, imitating a quantum system by mimicking the measurement statistics of any viable observable nominated by external observers. Inside a second box lies a genuine quantum system. Either box can be used to…

Quantum Physics · Physics 2015-06-19 Jayne Thompson , Mile Gu , Pawel Kurzynski , Su-Yong Lee , Dagomir Kaszlikowski

We introduce a new category of higher-dimensional automata in which the morphisms are functional homotopy simulations, i.e. functional simulations up to concurrency of independent events. For this, we use unfoldings of higher-dimensional…

Logic in Computer Science · Computer Science 2014-09-23 Uli Fahrenberg , Axel Legay

Models for question answering, dialogue agents, and summarization often interpret the meaning of a sentence in a rich context and use that meaning in a new context. Taking excerpts of text can be problematic, as key pieces may not be…

Computation and Language · Computer Science 2021-02-11 Eunsol Choi , Jennimaria Palomaki , Matthew Lamm , Tom Kwiatkowski , Dipanjan Das , Michael Collins
‹ Prev 1 8 9 10 Next ›