Related papers: Evitable iterates of the consistency operator
Some normal logic programs under the answer set (stable model) semantics lack the appealing property of "cautious monotonicity." That is, augmenting a program with one of its consequences may cause it to lose another of its consequences.…
One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…
Consistency is the theoretical property of a meta learning algorithm that ensures that, under certain assumptions, it can adapt to any task at test time. An open question is whether and how theoretical consistency translates into practice,…
Regression in supervised learning often requires the enforcement of constraints to ensure that the trained models are consistent with the underlying structures of the input and output data. This paper presents an iterative procedure to…
Let f_1,f_2,..., be functions chosen independently and uniformly from the set of all functions from a set of cardinality n into itself. Let g_t be the composition of the first t functions, and let T be the smallest t for which g_t is…
Let $C$ be a closed cone with nonempty interior $C^\circ$ in a Banach space. Let $f:C^\circ \rightarrow C^\circ$ be an order-preserving subhomogeneous function with a fixed point in $C^\circ$. We introduce a condition which guarantees that…
In this article, we study exponents which preserve complete monotonicity of functions on lattices. We prove that for any completely monotone function $f$ on a finite lattice, $f^\alpha$ is completely monotone for all $\alpha\geq c$, where…
We prove a robust converse barrier function theorem via the converse Lyapunov theory. While the use of a Lyapunov function as a barrier function is straightforward, the existence of a converse Lyapunov function as a barrier function for a…
We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…
We detail a simple procedure (easily convertible to an algorithm) for constructing from quasi-uniform samples of $f$ a sequence of linear spline functions converging to the monotone rearrangement of $f$, in the case where $f$ is an almost…
It is well-known that natural axiomatic theories are pre-well-ordered by logical strength, according to various characterizations of logical strength such as consistency strength and inclusion of $\Pi^0_1$ theorems. Though these notions of…
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…
Replacing operators with continuous operator-valued functions, we prove time-dependent versions of well-known results on compressions and diagonals of bounded operators. The setting of smooth functions is also addressed. Our results have no…
In this paper we provide a novel family of stochastic orders that generalizes second order stochastic dominance, which we call the $\alpha,[a,b]$-concave stochastic orders. These stochastic orders are generated by a novel set of "very"…
The Lebesgue property (order-continuity) of a monotone convex function on a solid vector space of measurable functions is characterized in terms of (1) the weak inf-compactness of the conjugate function on the order-continuous dual space,…
We consider the extent to which we can learn from a completely randomized experiment whether all individuals have treatment effects that are weakly of the same sign, a condition we call monotonicity. From a classical sampling perspective,…
We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…
In two recent papers we introduced some new techniques for constructing an extension of a probability-preserving system $T:\mathbb{Z}^d\curvearrowright (X,\mu)$ that enjoys certain desirable properties in connexion with the asymptotic…
In the article, a notion "logarithmically absolutely monotonic function" is introduced, an inclusion that a logarithmically absolutely monotonic function is also absolutely monotonic is revealed, the logarithmically complete monotonicity…
This is a conitunation of [1] and [2]. We prove that if function $f$ belongs to the class $\Lambda_{\omega} \overset{\text{def}}{=} \{f: \omega_{f}(\delta)\leq \text{const} \omega(\delta)\} $ for an arbitrary modulus of continuity $\omega$,…