English
Related papers

Related papers: Approaching a Bristol model

200 papers

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…

Logic · Mathematics 2026-02-20 Asaf Karagila , Jonathan Schilhan

The Information Bottleneck (IB) principle has emerged as a promising approach for enhancing the generalization, robustness, and interpretability of deep neural networks, demonstrating efficacy across image segmentation, document clustering,…

Information Theory · Computer Science 2025-04-18 Hanzhe Yang , Youlong Wu , Dingzhu Wen , Yong Zhou , Yuanming Shi

We investigate how classifiers for Boolean networks (BNs) can be constructed and modified under constraints. A typical constraint is to observe only states in attractors or even more specifically steady states of BNs. Steady states of BNs…

Commutative Algebra · Mathematics 2021-08-20 Robert Schwieger , Matías R. Bender , Heike Siebert , Christian Haase

Model rotation is an efficient technique for improving MUS finding algorithms. In previous work we have studied model rotation as an algorithm that traverses a graph which is induced by the input formula. This document introduces the notion…

Logic in Computer Science · Computer Science 2014-01-30 Siert Wieringa

Abstract interior-boundary conditions (IBC's) allow for the direct description of the domain and the action of Hamiltonians for a certain class of ultraviolet-divergent models in Quantum Field Theory. The method was recently applied to…

Mathematical Physics · Physics 2020-01-08 Julian Schmidt

In problems such as variable selection and graph estimation, models are characterized by Boolean logical structure such as presence or absence of a variable or an edge. Consequently, false positive error or false negative error can be…

Methodology · Statistics 2025-04-15 Armeen Taeb , Peter Bühlmann , Venkat Chandrasekaran

We survey the use of club guessing and other pcf constructs in the context of showing that a given partially ordered class of objects does not have a largest, or a universal element. The article was published in 2006. On rereading we…

Logic · Mathematics 2026-02-04 Mirna Džamonja

We derive a $U(1)_{B-L}$-extension of the Standard Model from a generalized Connes-Lott model with algebra ${\mathbb C}\oplus{\mathbb C}\oplus {\mathbb H}\oplus M_3({\mathbb C})$. This generalization includes the Lorentzian signature, the…

High Energy Physics - Theory · Physics 2024-06-19 Fabien Besnard

In 1983 Kustin and Miller introduced a construction of Gorenstein ideals in local Gorenstein rings, starting from smaller such ideals. We review and modify their construction in the case of graded rings and discuss it within the framework…

Commutative Algebra · Mathematics 2014-04-02 Sema Gunturkun , Uwe Nagel

This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…

Logic · Mathematics 2018-04-26 Kameryn J Williams

This note discusses Watson and Holmes (2016) and their pro- posals towards more robust Bayesian decisions. While we acknowledge and commend the authors for setting new and all-encompassing prin- ciples of Bayesian robustness, and we…

Methodology · Statistics 2016-04-12 Christian P. Robert , Judith Rousseau

All known Moufang sets arise, in some way or another, from an algebraic structure which can be called `division' in some way. In this PhD dissertation, I made an attempt to develop a theory of local Moufang sets, which generalize Moufang…

Group Theory · Mathematics 2017-06-16 Erik Rijcken

The notion off-ideals is recent and has been studied in the papers[1] [2], [5], [10], [11], [12], [13], [14] and [15]. In this paper, we have generalized the idea off-ideals to quasi f-ideals. This extended class of ideals is much bigger…

Commutative Algebra · Mathematics 2020-09-09 Hasan Mahmood , Fazal Ur Rehman , Thai Thanh Nguyen , Muhammad Ahsan Binyamin

We develop a theory of bicrystalline ideals, synthesizing Gr\"obner basis techniques and Kashiwara's crystal theory. This provides a unified algebraic, combinatorial, and computational approach that applies to ideals of interest, old and…

Representation Theory · Mathematics 2025-10-10 Abigail Price , Ada Stelzer , Alexander Yong

This note discusses the paper "Penalising model component complexity" by Simpson et al. (2017). While we acknowledge the highly novel approach to prior construction and commend the authors for setting new-encompassing principles that will…

Methodology · Statistics 2016-09-23 Christian P. Robert , Judith Rousseau

We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without…

Logic · Mathematics 2023-09-27 Richard Matthews , Michael Rathjen

Rotational invariance of physical laws is a generally accepted principle. We show that it leads to an additional external constraint on local realistic models of physical phenomena involving measurements of multiparticle spin 1/2…

Quantum Physics · Physics 2009-11-10 Koji Nagata , Wieslaw Laskowski , Marcin Wiesniak , Marek Zukowski

The proliferation of agentic systems has thrust the reasoning capabilities of AI into the forefront of contemporary machine learning. While it is known that there \emph{exist} neural networks which can reason through any Boolean task…

Computational Complexity · Computer Science 2026-02-06 Wenhao Li , Anastasis Kratsios , Hrad Ghoukasian , Dennis Zvigelsky

This note shows how one can be led from considerations of quantum steering to Bell's theorem. The point is that steering remote systems by choosing between two measurements can be described in a local theory if we take quantum states to be…

Quantum Physics · Physics 2012-06-04 Terry Rudolph

Bayesian reinforcement learning (BRL) is a method that merges principles from Bayesian statistics and reinforcement learning to make optimal decisions in uncertain environments. As a model-based RL method, it has two key components: (1)…

Machine Learning · Statistics 2025-06-03 Shreya Sinha Roy , Richard G. Everitt , Christian P. Robert , Ritabrata Dutta