相关论文: Enumerating Lambda Terms by Weighted Length of The…
A binary string of length $2^k$ induces the Boolean function of $k$ variables whose Shannon expansion is the given binary string. This Boolean function then is representable via a unique reduced ordered binary decision diagram (ROBDD). The…
We introduce some new classes of words and permutations characterized by the second difference condition $\pi(i-1) + \pi(i+1) - 2\pi(i) \leq k$, which we call the $k$-convexity condition. We demonstrate that for any sized alphabet and…
This note is mainly to point out, if needed, that uncertainty about models and their parameters has little to do with a `paradox'. The proposed `solution' is to formulate practical questions instead of seeking refuge into abstract…
The $\lambda$-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with the…
Two formalisms, both based on context-free grammars, have recently been proposed as a basis for a non-uniform random generation of combinatorial objects. The former, introduced by Denise et al, associates weights with letters, while the…
Instead of developing a customized typed lambda-calculus for each theory, we attempt to design a general parametric calculus that permits to express the proofs of any theory. This way, the problem of expressing proofs in the lambda-calculus…
We complete our theory of weighted $L^p(w_1) \times L^q(w_2) \to L^r(w_1^{r/p} w_2^{r/q})$ estimates for bilinear bi-parameter Calder\'on--Zygmund operators under the assumption that $w_1 \in A_p$ and $w_2 \in A_q$ are bi-parameter weights.…
The results of the study provide guidelines for the development and applications of algorithms. When the number of steps for calculating an assumption tends to infinity, probability theory can be applied to predict whether the assumption…
The article presents a new interpretation for Zipf-Mandelbrot's law in natural language which rests on two areas of information theory. Firstly, we construct a new class of grammar-based codes and, secondly, we investigate properties of…
We consider the fluctuation of linear eigenvalue statistics of random band $n\times n$ matrices whose entries have the form $\mathcal{M}_{ij}=b^{-1/2}u^{1/2}(|i-j|)\tilde w_{ij}$ with i.i.d. $w_{ij}$ possessing the $(4+\varepsilon)$th…
For arbitrary $n$ complex numbers $a_{\nu-1}$, $\nu=1,\dots,n$, where $n$ is sufficiently large, we get the representation in the form of power sums: $a_{\nu-1}=\lambda_1^\nu+\dots+\lambda_{2n+1}^\nu$, where $\lambda_k$ are distinct points,…
Linguistic insights may help make Large Language Model (LLM) training more efficient. We trained Meta's OPT model on the 100M word BabyLM dataset, and evaluated it on the BLiMP benchmark, which consists of 67 classes, each defined by…
We study binary classification in the setting where the learner is presented with multiple corrupted training samples, with possibly different sample sizes and degrees of corruption, and introduce an approach based on minimizing a weighted…
We investigate the possibility of a semantic account of the execution time (i.e. the number of beta-steps leading to the normal form, if any) for the shuffling calculus, an extension of Plotkin's call-by-value lambda-calculus. For this…
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…
Learning the value function of a given policy from data samples is an important problem in Reinforcement Learning. TD($\lambda$) is a popular class of algorithms to solve this problem. However, the weights assigned to different $n$-step…
Learning token embeddings based on token co-occurrence statistics has proven effective for both pre-training and fine-tuning in natural language processing. However, recent studies have pointed out that the distribution of learned…
Let $\nu_\lambda^p$ be the distribution of the random series $\sum_{n=1}^\infty i_n \lambda^n$, where $i_n$ is a sequence of i.i.d. random variables taking the values 0,1 with probabilities $p,1-p$. These measures are the well-known…
We obtain a central limit theorem for bulk counting statistics of free fermions in smooth domains of $\mathbb{R}^n$ with an explicit description of the covariance structure. This amounts to a study of the asymptotics of norms of commutators…
The Algebraic lambda-calculus and the Linear-Algebraic lambda-calculus extend the lambda-calculus with the possibility of making arbitrary linear combinations of terms. In this paper we provide a fine-grained, System F-like type system for…