Related papers: A simplified ordinal analysis of first-order refle…
Classical supervised learning via empirical risk (or negative log-likelihood) minimization hinges upon the assumption that the testing distribution coincides with the training distribution. This assumption can be challenged in modern…
We study the reactive synthesis problem for distributed systems with an unbounded number of participants interacting with an uncontrollable environment. Executions of those systems are modeled by data words, and specifications are given as…
A set of Maple V R.3/4 computer algebra routines for the analytical solving of 1st. order ODEs, using Lie group symmetry methods, is presented. The set of commands includes a 1st. order ODE-solver and routines for, among other things: the…
Using relativized ordinal analysis, we give a proof-theoretic characterization of the provably total set-recursive-from-$\omega$ functions of KPl and related theories.
Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…
We provide explicit upper bounds of the order $\log t/\log\log t$ for $|\zeta'(s)/\zeta(s)|$ and $|1/\zeta(s)|$ when $\sigma$ is close to $1$. These improve existing bounds for $\zeta(s)$ on the $1$-line.
Strictly positive logics recently attracted attention both in the description logic and in the provability logic communities for their combination of efficiency and sufficient expressivity. The language of Reflection Calculus RC consists of…
This paper studies high-order evaluation complexity for partially separable convexly-constrained optimization involving non-Lipschitzian group sparsity terms in a nonconvex objective function. We propose a partially separable adaptive…
We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal $\alpha$ there exists an ordinal $\beta$ such that $1+\beta\cdot(\beta+\alpha)$ (ordinal arithmetic) admits an…
A new totally algebraic formalism based on general, abstract ladder operators has been proposed. This approach heavily grounds in the superoperator formalism of Primas. However it is necessary to introduce many improvements in his…
We consider a deformation of the prolongation operation, defined on sets of vector fields and involving a mutual interaction in the definition of prolonged ones. This maintains the "invariants by differentiation" property, and can hence be…
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and…
We introduce a class of first-order methods for smooth constrained optimization that are based on an analogy to non-smooth dynamical systems. Two distinctive features of our approach are that (i) projections or optimizations over the entire…
We show how to compute efficiently with nominal sets over the total order symmetry, by developing a direct representation of such nominal sets and basic constructions thereon. In contrast to previous approaches, we work directly at the…
We obtain an alternative approach to recent results by M. Lacey \cite{La} and T. Hyt\"onen {\it et al.} \cite{HRT} about a pointwise domination of $\omega$-Calder\'on-Zygmund operators by sparse operators. This approach is rather elementary…
We consider a modification of the OMM energy functional which contains an $\ell^1$ penalty term in order to find a sparse representation of the low-lying eigenspace of self-adjoint operators. We analyze the local minima of the modified…
We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…
We consider regression scenarios where it is natural to impose an order constraint on the coefficients. We propose an order-constrained version of L1-regularized regression for this problem, and show how to solve it efficiently using the…
We consider in this paper a class of single-ratio fractional minimization problems, in which the numerator part of the objective is the sum of a nonsmooth nonconvex function and a smooth nonconvex function while the denominator part is a…
This paper presents two types of results related to hyperarithmetic analysis. First, we introduce new variants of the dependent choice axiom, namely $\mathrm{unique}~\Pi^1_0(\mathrm{resp.}~\Sigma^1_1)\text{-}\mathsf{DC}_0$ and…