相关论文: Holant clones and the approximability of conservat…

We study multivariate integration and approximation for functions belonging to a weighted reproducing kernel Hilbert space based on half-period cosine functions in the worst-case setting. The weights in the norm of the function space depend…

Representation theory is shown to be incomplete in terms of enumerating all integrable limits of quantum systems. As a consequence, one can find exactly solvable Hamiltonians which have apparently strongly broken symmetry. The number of…

The exact universal functional of integer charge leads to an extension to fractional charge asymptotically when it is applied to a system made of asymptotically separated densities. The extended functional is asymptotically local and is…

Mechanistic interpretability aims to explain neural model behaviour by reverse-engineering learned computational structure into human-understandable components. Without a formal framework, however, mechanistic explanations cannot be…

The increasing adoption of machine learning tools has led to calls for accountability via model interpretability. But what does it mean for a machine learning model to be interpretable by humans, and how can this be assessed? We focus on…

A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs). Cohen…

In this work, we present a simple, uniform, and elegant solution to the problem, with stunning practical effectiveness and application to virtually any Datalog-based analysis. The approach consists of leveraging the choice construct,…

The realizability problem is a well-known problem in the analysis of complex systems, which can be modeled as an infinite-dimensional moment problem. More precisely, as a truncated $K-$moment problem where $K$ is the space of all possible…

In this paper, we propose a general framework in continual learning for generative models: Feature-oriented Continual Learning (FoCL). Unlike previous works that aim to solve the catastrophic forgetting problem by introducing regularization…

We study clones on a four-element set related to the clone $\mathsf{DMA}$ of all term functions of the sub\-directly irreducible four-element De~Morgan algebra $\mathbf{DM_{4}}$. We find generating sets for the clones of all functions…

The Functional Machine Calculus (FMC), recently introduced by the authors, is a generalization of the lambda-calculus which may faithfully encode the effects of higher-order mutable store, I/O and probabilistic/non-deterministic input.…

One of the theoretical pillars that sustain certain machine learning models are universal approximation theorems, which prove that they can approximate all functions from a function class to arbitrary precision. Independently, classical…

Clocked Type Theory (CloTT) is a type theory for guarded recursion useful for programming with coinductive types, allowing productivity to be encoded in types, and for reasoning about advanced programming language features using an abstract…

We consider non-universal cloning maps, namely cloning transformations which are covariant under a proper subgroup G of the universal unitary group U(d), where d is the dimension of the Hilbert space H of the system to be cloned. We give a…

We develop a general theory of cluster categories, applying to a 2-Calabi-Yau extriangulated category $\mathcal{C}$ and cluster-tilting subcategory $\mathcal{T}$ satisfying only mild finiteness conditions. We show that the structure theory…

This paper focuses on the equivalent expression of fractional integrals/derivatives with an infinite series. A universal framework for fractional Taylor series is developed by expanding an analytic function at the initial instant or the…

Any refinement system (= functor) has a fully faithful representation in the refinement system of presheaves, by interpreting types as relative slice categories, and refinement types as presheaves over those categories. Motivated by an…

Mathematical optimization, although often leading to NP-hard models, is now capable of solving even large-scale instances within reasonable time. However, the primary focus is often placed solely on optimality. This implies that while…

We give a formal treatment of simple type theories, such as the simply-typed $\lambda$-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional…

We introduce and investigate different definitions of effective amenability, in terms of computability of F{\o}lner sets, Reiter functions, and F{\o}lner functions. As a consequence, we prove that recursively presented amenable groups have…