Related papers: Algebraic Semantics of Generalized RIFs
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
Minimization of regularized losses is a principled approach to weak supervision well-established in deep learning, in general. However, it is largely overlooked in semantic segmentation currently dominated by methods mimicking full…
Taking an algebraic perspective on the basic structures of Rough Concept Analysis as the starting point, in this paper we introduce some varieties of lattices expanded with normal modal operators which can be regarded as the natural rough…
The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving…
Refined Algebraic Quantization and Group Averaging are powerful methods for quantizing constrained systems. They give constructive algorithms for generating observables and the physical inner product. This work outlines the current status…
Symbolic integration deals with the evaluation of integrals in closed form. We present an overview of Risch's algorithm including recent developments. The algorithms discussed are suited for both indefinite and definite integration. They…
The method of refined algebraic quantization of constrained systems which is based on modification of the inner product of the theory rather than on imposing constraints on the physical states is generalized to the case of constrained…
Intrinsic random functions (IRF) provide a versatile approach when the assumption of second-order stationarity is not met. Here, we develop the IRF theory on the circle with its universal kriging application. Unlike IRF in Euclidean spaces,…
The rapid development of artificial intelligence (AI) systems has created an urgent need for their scientific quantification. While their fluency across a variety of domains is impressive, AI systems fall short on tests requiring…
Statistics and Optimization are foundational to modern Machine Learning. Here, we propose an alternative foundation based on Abstract Algebra, with mathematics that facilitates the analysis of learning. In this approach, the goal of the…
A topological description of various generalized function algebras over corresponding basic locally convex algebras is given. The framework consists of algebras of sequences with appropriate ultra(pseudo)metrics defined by sequences of…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
Interpretability is the next pivotal frontier in machine learning research. In the pursuit of glass box models - as opposed to black box models, like random forests or neural networks - rule induction algorithms are a logical and promising…
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…
In real-world tasks, there is usually a large amount of unlabeled data and labeled data. The task of combining the two to learn is known as semi-supervised learning. Experts can use logical rules to label unlabeled data, but this operation…
If $X$ is a smooth manifold then the $\mathbb R$-algebra $C^\infty(X)$ of smooth functions $c:X\to\mathbb R$ is a $C^\infty$-$ring$. That is, for each smooth function $f:{\mathbb R}^n\to\mathbb R$ there is an $n$-fold operation…
We introduce a notion of integration defined from filters over families of finite sets. This procedure corresponds to determining the average value of functions whose range lies in any algebraic structure in which finite averages make…
We consider a generalization of polynomial programs: algebraic programs, which are optimization or feasibility problems with algebraic objectives or constraints. Algebraic functions are defined as zeros of multivariate polynomials. They are…
We aim to construct a class of learning algorithms that are of practical value to applied researchers in fields such as biostatistics, epidemiology and econometrics, where the need to learn from incompletely observed information is…
We have devoted an effort to study some nonlinear actions, characteristics of the ${\cal W}$-theories, in the framework of the soldering formalism. We have disclosed interesting new results concerning the embedding of the original chiral…