Related papers: Modular Localization and the Bootstrap-Formfactor …
A core aspect of human intelligence is the ability to learn new tasks quickly and switch between them flexibly. Here, we describe a modular continual reinforcement learning paradigm inspired by these abilities. We first introduce a visual…
Superconformal indices of four-dimensional $\mathcal{N}=1$ gauge theories factorize into holomorphic blocks. We interpret this as a modular property resulting from the combined action of an $SL(3,\mathbb{Z})$ and $SL(2,\mathbb{Z})\ltimes…
This paper studies a flocking model in which the interaction between agents is described by a general local nonlinear function depending on the distance between agents.
The theory of stationary spatially localized patterns in dissipative systems driven by time-independent forcing is well developed. With time-periodic forcing related but time-dependent structures may result. These may consist of breathing…
The interplay between process behaviour and spatial aspects of computation has become more and more relevant in Computer Science, especially in the field of collective adaptive systems, but also, more generally, when dealing with systems…
We extend intersection types to a computational $\lambda$-calculus with algebraic operations \`a la Plotkin and Power. We achieve this by considering monadic intersections, whereby computational effects appear not only in the operational…
The subject of this paper is the evolution of the concept of information processing in regular structures based on multi-level processing in nested cellular automata. The essence of the proposed model is a discrete space-time containing…
We show that a mobility edge exists in 1D random potentials provided specific long-range correlations. Our approach is based on the relation between binary correlator of a site potential and the localization length. We give the algorithm to…
We consider a class of quantum lattice models in $1+1$ dimensions represented as local quantum circuits that enjoy a particular "dual-unitarity" property. In essence, this property ensures that both the evolution "in time" and that "in…
This paper introduces the notion of co-modularity, to co-cluster observations of bipartite networks into co-communities. The task of co-clustering is to group together nodes of one type with nodes of another type, according to the…
In this short note, we give a localized version of the basic triangle theorem, first published in 2011 (see [4]) in order to prove the independence of hyperlogarithms over various function fields. This version provides direct access to…
We show that silting modules are closely related with localisations of rings. More precisely, every partial silting module gives rise to a localisation at a set of maps between countably generated projective modules and, conversely, every…
We introduce spaces of exponential constructible functions in the motivic setting for which we construct direct image functors in the absolute and relative cases. This allows us to define a motivic Fourier transformation for which we get…
We prove that, on bounded expansion classes, every first-order formula with modulo counting is equivalent, in a linear-time computable monadic expansion, to an existential first-order formula. As a consequence, we derive, on bounded…
We describe algorithms for computing various functors for algebraic D-modules, i.e. systems of linear partial differential equations with polynomial coefficients. We will give algorithms for restriction, tensor product, localization, and…
We consider long-range correlated disorder and mutual interacting particles according to a dipole-dipole coupling as modifications to the one-dimensional Anderson model. Technically we rely on the (numerical) exact diagonalization of the…
In this paper we present a general, flexible framework for learning mappings from images to actions by interacting with the environment. The basic idea is to introduce a feature-based image classifier in front of a reinforcement learning…
The first part of this dissertation defines "dependently typed algebraic theories", which are a strict subclass of the generalised algebraic theories (GATs) of Cartmell. We characterise dependently typed algebraic theories as finitary…
These notes provide an introduction to the theory of localization for triangulated categories. Localization is a machinery to formally invert morphisms in a category. We explain this formalism in some detail and we show how it is applied to…
Graded type theories are an emerging paradigm for augmenting the reasoning power of types with parameterizable, fine-grained analyses of program properties. There have been many such theories in recent years which equip a type theory with…