Related papers: Superdevelopments for Weak Reduction
Calculi with control operators have been studied as extensions of simple type theory. Real programming languages contain datatypes, so to really understand control operators, one should also include these in the calculus. As a first step in…
Filinski constructed a symmetric lambda-calculus consisting of expressions and continuations which are symmetric, and functions which have duality. In his calculus, functions can be encoded to expressions and continuations using primitive…
In this paper, we study classes of discrete convex functions: submodular functions on modular semilattices and L-convex functions on oriented modular graphs. They were introduced by the author in complexity classification of minimum…
We obtain an improved lower bound for the restricted reverse weak-type estimate of the Hardy-Littlewood maximal operator $M$. This result is applied to the $\lambda$-median maximal operator $m_{\lambda}$ acting on a Banach function space…
In this study, Firstly, we will write two new convex functions for $-1<n-\alpha \leq 1\ $and two new lemmas. Then we will find the relevance of the two new lemmas to Caputo-left-sided derivatives under additional conditions and draw…
Many different systems with explicit substitutions have been proposed to implement a large class of higher-order languages. Motivations and challenges that guided the development of such calculi in functional frameworks are surveyed in the…
There are many examples of optimization problems whose associated polyhedra can be described much nicer, and with way less inequalities, by projections of higher dimensional polyhedra than this would be possible in the original space.…
The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prove the strong normalization of the reduction relation generated by the…
We establish risk bounds for Regularized Empirical Risk Minimizers (RERM) when the loss is Lipschitz and convex and the regularization function is a norm. In a first part, we obtain these results in the i.i.d. setup under subgaussian…
This article provides new lower bounds for both Schur and weak Schur numbers by exploiting a "template"-based approach. The concept of "template" is also generalized to weak Schur numbers. Finding new templates leads to explicit partitions…
We consider a sub-class of the $f$-divergences satisfying a stronger convexity property, which we refer to as strongly convex, or $\kappa$-convex divergences. We derive new and old relationships, based on convexity arguments, between…
Let $N$ be a submodule of a finitely generated module $M$ over a Noetherian ring. A method for the computation of the submodule generated by the envelope of $N$ is given. The relations between weakly prime submodules and their envelopes are…
In this note we give a precise statement and a detailed proof for reconstruction problem of weak bialgebra maps. As an application we characterize indecomposability of weak algebras in categorical setting.
New invariants for 2-dimensional cell complexes are defined, which can be interpreted as curvature bounds. These invariants are proved to be rational and computable in a companion article. This document is a survey that collects theorems…
The pursuit of robustness has recently been a popular topic in reinforcement learning (RL) research, yet the existing methods generally suffer from efficiency issues that obstruct their real-world implementation. In this paper, we introduce…
A new directional derivative and a new subdifferential for set-valued convex functions are constructed, and a set-valued version of the so-called 'max-formula' is proven. The new concepts are used to characterize solutions of convex…
A simple construction of Euclidean invariant and reflection positive measures on the cylindrical compactification is performed under a weaker hypothesis than has recently been obtained. Moreover, the results are extended to the case when…
The intrinsic treatment of binding in the lambda calculus makes it an ideal data structure for representing syntactic objects with binding such as formulas, proofs, types, and programs. Supporting such a data structure in an implementation…
The weak maximum principle of finite element methods for parabolic equations is proved for both semi-discretization in space and fully discrete methods with $k$-step backward differentiation formulae for $k = 1,... ,6$, on a two-dimensional…
In this paper, we consider conditional gradient methods. These are methods that use a linear minimization oracle, which, for a given vector $p \in \mathbb{R}^n$, computes the solution of the subproblem $$\arg \min_{x\in X}{\langle p,x…