Related papers: Combining Weak Distributive Laws: Application to U…

We present a general coalgebraic setting in which we define finite and infinite behaviour with B\"uchi acceptance condition for systems whose type is a monad. The first part of the paper is devoted to presenting a construction of a monad…

Functor coalgebras capture a wide range of transition systems that must however evolve in discrete steps. We introduce graded coalgebras of graded monads and propose them to model continuous-time transition systems. We develop the theory of…

The Gumbel-Softmax probability distribution allows learning discrete tokens in generative learning, while the Gumbel-Argmax probability distribution is useful in learning discrete structures in discriminative learning. Despite the efforts…

Variational Autoencoders for multimodal data hold promise for many tasks in data analysis, such as representation learning, conditional generation, and imputation. Current architectures either share the encoder output, decoder input, or…

We present examples of nearly integrable analytic Hamiltonian systems with several strong diffusion properties: topological weak mixing and diffusion at all times. These examples are obtained by AbC constructions with several frequencies.

We study charge fluctuations of a family of stochastic charged cellular automata away from the deterministic single-file limit and obtain the exact typical charge probability distributions, known to be anomalous, using hydrodynamics. The…

We prove a weak iterated invariance principle for a large class of non-uniformly expanding random dynamical systems. In addition, we give a quenched homogenization result for fast-slow systems in the case when the fast component corresponds…

Recent works have shown that defining a behavioural equivalence that matches the observational properties of a quantum-capable, concurrent, non-deterministic system is a surprisingly difficult task. We explore coalgebras over distributions…

This paper introduces a notion of equivalence for higher-dimensional automata, called weak equivalence. Weak equivalence focuses mainly on a traditional trace language and a new homology language, which captures the overall independence…

In previous work "Betweenness algebras" we introduced and examined the class of betweenness algebras. In the current paper we study a larger class of algebras with binary operators of possibility and sufficiency, the weak mixed algebras.…

We explore the probabilistic foundations of shared control in complex dynamic environments. In order to do this, we formulate shared control as a random process and describe the joint distribution that governs its behavior. For…

We construct a `weak' version EM^w(K) of Lack & Street's 2-category of monads in a 2-category K, by replacing their compatibility constraint of 1-cells with the units of monads by an additional condition on the 2-cells. A relation between…

A new weak bisimulation semantics is defined for Markov automata that, in addition to abstracting from internal actions, sums up the expected values of consecutive exponentially distributed delays possibly intertwined with internal actions.…

Batanin and Leinster's work on globular operads has provided one of many potential defnitions of a weak $\omega$-category. Through the language of globular operads they construct a monad whose algebras encode weak $\omega$-categories. The…

Over the last few decades power law distributions have been suggested as forming generative mechanisms in a variety of disparate fields, such as, astrophysics, criminology and database curation. However, fitting these heavy tailed…

By considering the situation in which the involved pseudomonads are presented in no-iteration form, we deduce a number of alternative presentations of pseudodistributive laws including a 'decagon' form, a pseudoalgebra form, a no-iteration…

This paper is concerned with relationships of weakly mixing, topologically weakly mixing, and sensitivity for non-autonomous discrete systems. It is shown that weakly mixing implies topologically weakly mixing and sensitivity for measurable…

Multi-modal data-sets are ubiquitous in modern applications, and multi-modal Variational Autoencoders are a popular family of models that aim to learn a joint representation of the different modalities. However, existing approaches suffer…

Generative modeling within constrained sets is essential for scientific and engineering applications involving physical, geometric, or safety requirements (e.g., molecular generation, robotics). We present a unified framework for…

We study the (so-called bilinear) factorization problem answered by a weak wreath product (of monads and, more specifically, of algebras over a commutative ring) in the works by Street and by Caenepeel and De Groot. A bilinear factorization…