Related papers: Unguarded Recursion on Coinductive Resumptions
Aluthge transform is a well-known mapping defined on bounded linear operators. Especially, the convergence property of its iteration has been studied by many authors. In this paper, we discuss the problem for the induced Aluthge transforms…
Interviews run on people, programs run on operating systems, voting schemes run on voters, games run on players. Each of these is an example of the abstraction pattern runs on matter. Pattern determines the decision tree that governs how a…
Transformers have recently been shown to be capable of reliably performing logical reasoning over facts and rules expressed in natural language, but abductive reasoning - inference to the best explanation of an unexpected observation - has…
Practically all the full-fledged MOND theories propounded to date are of the modified-gravity (MG) type: they modify only the Newtonian, Poisson action of the gravitational potential, or the general-relativistic Einstein-Hilbert action,…
We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operads obtained from usual monoids such as the additive and multiplicative…
One can perform equational reasoning about computational effects with a purely functional programming language thanks to monads. Even though equational reasoning for effectful programs is desirable, it is not yet mainstream. This is partly…
Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…
We study the semantics of an untyped lambda-calculus equipped with operators representing read and write operations from and to a global store. We adopt the monadic approach to model side-effects and treat read and write as algebraic…
We prove that for a given partial functional attributed tree transducer with monadic output, it is decidable whether or not an equivalent top-down transducer (with or without look-ahead) exists. We present a procedure that constructs an…
An associative algebra with a generalized derivation is called an AsGDer triple. We introduce the operad that encodes AsGDer triples, and prove it is a Koszul operad. Using its Koszul dual cooperad, we introduce the homotopy version of…
Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…
In this paper we propose a robust Model Predictive Control where a Gated Recurrent Unit network model is used to learn the input-output dynamic of the system under control. Robust satisfaction of input and output constraints and recursive…
Wadler and Thiemann unified type-and-effect systems with monadic semantics via a syntactic correspondence and soundness results with respect to an operational semantics. They conjecture that a general, "coherent" denotational semantics can…
We discuss a version of \'Ecalle's definition of resurgence, based on the notion of endless continuability in the Borel plane. We relate this with the notion of \Omega-continuability, where \Omega\ is a discrete filtered set, and show how…
Grokking -- the abrupt transition from memorization to generalization long after near-zero training loss -- has been studied mainly in single-task settings. We extend geometric analysis to multi-task modular arithmetic, training…
Censoring occurs when an outcome is unobserved beyond some threshold value. Methods that do not account for censoring produce biased predictions of the unobserved outcome. This paper introduces Type I Tobit Bayesian Additive Regression Tree…
We present a unified approach to extensions of Bourgain's Double Recurrence Theorem and Bourgain's Return Times Theorem to integer parts of the Kronecker sequence, emphasizing stopping times and metric entropy. Specifically, we prove the…
Chain-of-Thought (CoT) reasoning is known to improve Large Language Models both empirically and in terms of theoretical approximation power. However, our understanding of the inner workings and conditions of apparition of CoT capabilities…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
We introduce three forms of generalized contraction (GC). Roughly speaking, these are motivated by allowing contraction to take place after small transients in time and/or amplitude. Indeed, contraction is usually used to prove asymptotic…