Related papers: The converse envelope theorem
We introduce a new form of Lagrangian and propose a simple first-order algorithm for nonconvex optimization with nonlinear equality constraints. We show the algorithm generates bounded dual iterates, and establish the convergence to KKT…
We introduce layer systems for proving generalizations of the modularity of confluence for first-order rewrite systems. Layer systems specify how terms can be divided into layers. We establish structural conditions on those systems that…
Consider the object allocation (one-sided matching) model of Shapley and Scarf (1974). When final allocations are observed but agents' preferences are unknown, when might the allocation be in the core? This is a one-sided analogue of the…
Gibbs' theorem, which is originally intended for canonical ensembles with complete statistics has been generalized to open systems with incomplete statistics. As a result of this generalization, it is shown that the stationary equilibrium…
We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…
Ne\v{s}et\v{r}il and Ossona de Mendez recently proposed a new definition of graph convergence called structural convergence. The structural convergence framework is based on the probability of satisfaction of logical formulas from a fixed…
Drawing on an analogy with the second law of thermodynamics for adiabatically isolated systems, Cover argued that data-processing inequalities may be seen as second laws for "computationally isolated systems," namely, systems evolving…
We apply the Inclusion-Exclusion Principle to a unique pair of prime number subsequences to determine whether these subsequences form a small set or a large set and thus whether the infinite sum of the inverse of their terms converges or…
We provide a Sandwich Theorem (K\"onig (1972)) for positively homogeneous functionals that satisfy additivity only on a restricted domain. Our relaxation of additivity is based on a binary relation called convex-conic symmetric preorder,…
In this article we demonstrate how algorithmic probability theory is applied to situations that involve uncertainty. When people are unsure of their model of reality, then the outcome they observe will cause them to update their beliefs. We…
$H$-theorem states that the entropy production is nonnegative and, therefore, the entropy of a closed system should monotonically change in time. In information processing, the entropy production is positive for random transformation of…
We generalize the reciprocity theorem of G.R.~Robinson, D. Benson and P. Webb between a finite group and its subgroup to the case of finite-dimensional {\it symmetric} algebras over a field which are connected by a bimodule for the two…
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
The Implicit and Inverse Function Theorems are special cases of a general Implicit/Inverse Function Theorem which can be easily derived from either theorem. The theorems can thus be easily deduced from each other via the generalized…
As machine learning is increasingly used to inform consequential decision-making (e.g., pre-trial bail and loan approval), it becomes important to explain how the system arrived at its decision, and also suggest actions to achieve a…
This article presents simple and easy proofs of the Implicit Function Theorem and the Inverse Function Theorem, in this order, both of them on a finite-dimensional Euclidean space, that employ only the Intermediate Value Theorem and the…
Some practical results are derived for population inference based on a sample, under the two qualitative conditions of 'ignorability' and exchangeability. These are the 'Histogram Theorem', for predicting the outcome of a non-sampled member…
We prove a weighted analogue of the Khintchine-Groshev Theorem, where the distance to the nearest integer is replaced by the absolute value. This is subsequently applied to proving the optimality of several linear independence criteria over…
We consider an {\em enforce operator} on impartial rulesets similar to the Muller Twist and the comply/constrain operator of Smith and St\u anic\u a, 2002. Applied to the rulesets A and B, on each turn the opponent enforces one of the…
The question whether indeterminism in quantum measurement outcomes is fundamental or is there a possibility of constructing a finer theory underlying quantum mechanics that allows no such indeterminism, has been debated for a long time. We…