Related papers: A Monoidal View on Fixpoint Checks
We formalise the self-referential definition of physical laws using monotone operators on a lattice of theories, resolving the pathologies of naive set-theoretic formulations. By invoking Tarski fixed point theorem, we identify physical…
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics with branching types beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the coalgebraic $\mu$-calculus…
Given its ability to analyse stochastic models ranging from discrete and continuous-time Markov chains to Markov decision processes and stochastic games, probabilistic model checking (PMC) is widely used to verify system dependability and…
The maximum (or minimum) generalized eigenvalue of symmetric positive semidefinite matrices that depend on optimization variables often appears as objective or constraint functions in structural topology optimization when we consider…
Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss…
Size-Change Termination is an increasingly-popular technique for verifying program termination. These termination proofs are deduced from an abstract representation of the program in the form of "size-change graphs". We present algorithms…
We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…
Geometric properties of the fixed point set $Fix(f)$ of a self-mapping $f$ on a metric or a generalized metric space is an attractive issue. The set $Fix(f)$ can contain a geometric figure (a circle, an ellipse, etc.) or it can be a…
This paper revisits the well-studied fixed point problem from a unified viewpoint of mathematical modeling and canonical duality theory, i.e. the original problem is first reformulated as a nonconvex optimization problem, its well-posedness…
Berge's maximum theorem gives conditions ensuring the continuity of an optimised function as a parameter changes. In this paper we state and prove the maximum theorem in terms of the theory of monoidal topology and the theory of double…
We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to…
Interpreting gradient methods as fixed-point iterations, we provide a detailed analysis of those methods for minimizing convex objective functions. Due to their conceptual and algorithmic simplicity, gradient methods are widely used in…
We present a conceptual framework that unifies a variety of evaluation metrics for different structured prediction tasks (e.g. event and relation extraction, syntactic and semantic parsing). Our framework requires representing the outputs…
This paper provides a unifying view of a wide range of problems of interest in machine learning by framing them as the minimization of functionals defined on the space of probability measures. In particular, we show that generative…
Slow mixing is the central hurdle when working with Markov chains, especially those used for Monte Carlo approximations (MCMC). In many applications, it is only of interest to estimate the stationary expectations of a small set of…
The concept of fixed point plays a crucial role in various fields of applied mathematics. The aim of this paper is to establish the existence of a unique fixed point of some type of functions which satisfy a new contraction principle,…
We consider fixed-point equations for probability distributions on isometry classes of measured metric spaces. The construction is required to be recursive and tree-like, but we allow loops for the geodesics between points in the support of…
Persistence diagrams are efficient descriptors of the topology of a point cloud. As they do not naturally belong to a Hilbert space, standard statistical methods cannot be directly applied to them. Instead, feature maps (or representations)…
Hyperuniformity is the study of stationary point processes with a sub-Poisson variance in a large window. In other words, counting the points of a hyperuniform point process that fall in a given large region yields a small-variance Monte…
In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.