Related papers: The Limit of Recursion in State-based Systems

In this paper, we establish lower bounds for the oracle complexity of the first-order methods minimizing regularized convex functions. We consider the composite representation of the objective. The smooth part has H\"older continuous…

We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the…

We design an algorithm which finds an $\epsilon$-approximate stationary point (with $\|\nabla F(x)\|\le \epsilon$) using $O(\epsilon^{-3})$ stochastic gradient and Hessian-vector products, matching guarantees that were previously available…

We consider the $\Omega$-deformed $\mathcal{N}=2$ $SU(2)$ gauge theory in four dimensions with $N_{f}=4$ massive fundamental hypermultiplets. The low energy effective action depends on the deformation parameters $\varepsilon_{1},…

We provide a first-order oracle complexity lower bound for finding stationary points of min-max optimization problems where the objective function is smooth, nonconvex in the minimization variable, and strongly concave in the maximization…

The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as…

We prove the undecidability of MSO on $\omega$-words extended with the second-order predicate $U_1(X)$ which says that the distance between consecutive positions in a set $X \subseteq \mathbb{N}$ is unbounded. This is achieved by showing…

We introduce labelled sequent calculi for quantified modal logics with definite descriptions. We prove that these calculi have the good structural properties of G3-style calculi. In particular, all rules are height-preserving invertible,…

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

We give conditions for the existence of the Minkowski content of limit sets stemming from infinite conformal graph directed systems. As an application we obtain Minkowski measurability of Apollonian gaskets, provide explicit formulae of the…

We answer two questions posed by Castro and Cucker, giving the exact complexities of two decision problems about cardinalities of omega-languages of Turing machines. Firstly, it is $D_2(\Sigma_1^1)$-complete to determine whether the…

A number of papers deal with the problem of counting the number of retractions of a structure $S$ onto a substructure $T.$ In the particular case when $S$ is a free algebra, this number is $\geq 1$ iff $T$ is projective. In this paper we…

In the lecture notes it is shown that an ordinal $\psi_{\Omega}(\varepsilon_{\mathbb{S}^{+}+1})$ is an upper bound for the proof-theoretic ordinal of a set theory ${\sf KP}\omega+(M\prec_{\Sigma_{1}}V)$. In this note we show that ${\sf…

For general second order evolution equations, we prove an optimal condition on the degree of unboundedness of the damping, that rules out finite-time extinction. We show that control estimates give energy decay rates that explicitly depend…

Optimization seeks extremal points in a function. When there are superextensively many optima, optimization algorithms are liable to get stuck. Under these conditions, generic algorithms tend to find marginal optima, which have many nearly…

This note studies numerical methods for solving compositional optimization problems, where the inner function is smooth, and the outer function is Lipschitz continuous, non-smooth, and non-convex but exhibits one of two special structures…

The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic. In this…

Chaitin's number Omega is the halting probability of a universal prefix-free machine, and although it depends on the underlying enumeration of prefix-free machines, it is always Turing-complete. It can be observed, in fact, that for every…

We give a direct algebraic proof of the necessity direction in the single-point higher-order Szeg\H{o} sum rules on the unit circle for $m=1,2,3$. More precisely, for $H_m(e^{i\theta})=(1-\cos\theta)^m$, we show that…

This work proposes a universal and adaptive second-order method for minimizing second-order smooth, convex functions. Our algorithm achieves $O(\sigma / \sqrt{T})$ convergence when the oracle feedback is stochastic with variance $\sigma^2$,…