Related papers: Superdevelopments for Weak Reduction
We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…
This study delves into equilibrium problems, focusing on the identification of finite solutions for feasible solution sequences. We introduce an innovative extension of the weak sharp minimum concept from convex programming to equilibrium…
Standard techniques for aligning large language models (LLMs) utilize human-produced data, which could limit the capability of any aligned LLM to human level. Label refinement and weak training have emerged as promising strategies to…
We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…
We continue the study of robust reductions initiated by Gavalda and Balcazar. In particular, a 1991 paper of Gavalda and Balcazar claimed an optimal separation between the power of robust and nondeterministic strong reductions.…
For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on $\mathbb{N}^d$ (Dickson's lemma), yielding Ackermannian upper bounds via controlled bad-sequence…
While a mature body of work supports the study of rewriting systems, abstract tools for Probabilistic Rewriting are still limited. In this paper we study the question of uniqueness of the result (unique limit distribution), and develop a…
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…
The recently introduced weakly disentangled representations proposed to relax some constraints of the previous definitions of disentanglement, in exchange for more flexibility. However, at the moment, weak disentanglement can only be…
Many practical optimization problems lack strong convexity. Fortunately, recent studies have revealed that first-order algorithms also enjoy linear convergences under various weaker regularity conditions. While the relationship among…
Kedem's Comment [arXiv:1402.1352] on our Letter [PRL 112, 040406 (2014)] contains only the criticism that we did not consider complex weak values. We point out follow-up work which uses the same analysis as in our Letter, includes any type…
This Paper investigate sequent calculi for certain weak subintuitionistic logics. We establish that weakening and contraction are height-preserving admissible for each of these calculi, and we provide a syntactic proof for the admissibility…
Subgradient methods converge linearly on a convex function that grows sharply away from its solution set. In this work, we show that the same is true for sharp functions that are only weakly convex, provided that the subgradient methods are…
We consider relational semantics (R-models) for the Lambek calculus extended with intersection and explicit constants for zero and unit. For its variant without constants and a restriction which disallows empty antecedents, Andreka and…
We present a call-by-need $\lambda$-calculus that enables strong reduction (that is, reduction inside the body of abstractions) and guarantees that arguments are only evaluated if needed and at most once. This calculus uses explicit…
We present some contributions to the theory of infinitary rewriting for weakly orthogonal term rewrite systems, in which critical pairs may occur provided they are trivial. We show that the infinitary unique normal form property fails by an…
Machine learning algorithms generally suffer from a problem of explainability. Given a classification result from a model, it is typically hard to determine what caused the decision to be made, and to give an informative explanation. We…
The notion of super weak compactness for subsets of Banach spaces is a strengthening of the weak compactness that can be described as a local version of super-reflexivity. A recent result of K. Tu which establishes that the closed convex…
We investigate if an existing notion of weak sequential convergence in a Hadamard space can be induced by a topology. We provide an answer on what we call weakly proper Hadamard spaces. A notion of dual space is proposed and it is shown…
We construct maximal $\Lambda(p)$-subsets on a large class of curved manifolds, in an optimal range of Lebesgue exponents $p$. Our arguments combine restriction estimates and decoupling with old and new probabilistic estimates.