Related papers: Exceptionally Monadic Error Handling
Extrinsic faulting has been discussed previously within the so called difference method and random walk calculation. In this contribution is revisited under the framework of computational mechanics, which allows to derive expressions for…
We propose another interpretation of well-known derivatives computations from regular expressions, due to Brzozowski, Antimirov or Lombardy and Sakarovitch, in order to abstract the underlying data structures (e.g. sets or linear…
Notions of `operad' and `multicategory' abound. This work provides a single framework in which many of these various notions can be expressed. Explicitly: given a monad * on a category S, we define the term `(S,*)-multicategory', subject to…
Contextual bandit algorithms are essential for solving many real-world interactive machine learning problems. Despite multiple recent successes on statistically and computationally efficient methods, the practical behavior of these…
We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…
We consider a finite-armed structured bandit problem in which mean rewards of different arms are known functions of a common hidden parameter $\theta^*$. Since we do not place any restrictions of these functions, the problem setting…
Exploiting the rapid advances in probabilistic inference, in particular variational Bayes and variational autoencoders (VAEs), for anomaly detection (AD) tasks remains an open research question. Previous works argued that training VAE…
Hybrid computation combines discrete and continuous dynamics in the form of an entangled mixture inherently present both in various natural phenomena, and in applications ranging from control theory to microbiology. The emergent behaviours…
An algebraic method is used to study the semantics of exceptions in computer languages. The exceptions form a computational effect, in the sense that there is an apparent mismatch between the syntax of exceptions and their intended…
An elliptic theory is constructed for operators acting in subspaces defined via odd pseudodifferential projections. Subspaces of this type arise as Calderon subspaces for first order elliptic differential operators on manifolds with…
Recent advances in programming languages study and design have established a standard way of grounding computational systems representation in category theory. These formal results led to a better understanding of issues of control and…
A left ideal of any $C^*$-algebra is an example of an operator algebra with a right contractive approximate identity (r.c.a.i.). Indeed left ideals in $C^*$-algebras may be characterized as the class of such operator algebras, which happen…
Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's…
Recently a new approach to analyze and create algebraic multigrid methods (AMG) for nonsymmetric and indefinite matrices was established. Convergence is measured in general norms induced by a certain HPD matrix $B$ and $B$-orthogonal…
Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…
In this paper, we take a pervasively effectful (in the style of ML) typed lambda calculus, and show how to extend it to permit capturing pure expressions with types. Our key observation is that, just as the pure simply-typed lambda calculus…
A left ideal of any C*-algebra is an example of an operator algebra with a right contractive approximate identity (r.c.a.i.). Conversely, we show here and in a `pre-quel' to this paper [B], that operator algebras with r.c.a.i. should be…
By an odd structure we mean an algebraic structure in the category of graded vector spaces whose structure operations have odd degrees. Particularly important are odd modular operads which appear as Feynman transforms of modular operads…
Anomaly detection is a fundamental problem in data mining field with many real-world applications. A vast majority of existing anomaly detection methods predominately focused on data collected from a single source. In real-world…
The Composite Operator Method (COM) is formulated, its internals illustrated in detail and some of its most successful applications reported. COM endorses the emergence, in strongly correlated systems (SCS), of composite operators,…