Related papers: Note on $\mathsf{TD} + \mathsf{DC}_\mathbb{R}$ imp…
In many axiomatic set theories, G\"odel's constructible universe $L$ is known as an inner model, that is, a definable class satisfying the same axioms (and containing the same ordinals). This gives a trivial proof that adding the axiom $V =…
We prove a conjecture of Sturmfels, Timme and Zwiernik on the ML-degrees of linear covariance models in algebraic statistics. As in our previous works on linear concentration models, the proof ultimately relies on the computation of certain…
Formal transformations somehow resembling the usual derivative are surprisingly common in computer science, with two notable examples being derivatives of regular expressions and derivatives of types. A newcomer to this list is the…
This paper presents simple, syntactic strong normalization proofs for the simply-typed lambda-calculus and the polymorphic lambda-calculus (system F) with the full set of logical connectives, and all the permutative reductions. The…
The aim of this review article is to assess the descriptive capabilities of the Hubbard-rooted LDA+U method and to clarify the conditions under which it can be expected to be most predictive. The paper illustrates the theoretical foundation…
In a 2019 paper, Barnard and Steinerberger show that for $f\in L^1(\mathbf{R})$, the following autocorrelation inequality holds: \begin{equation*} \min_{0 \leq t \leq 1} \int_\mathbf{R} f(x) f(x+t)\ \mathrm{d}x \ \leq\ 0.411 ||f||_{L^1}^2,…
The purpose of this short note is to present a simplified proof of Serre's modularity conjecture using the strong modularity lifting results currently available. This second version includes extra details on definitions and proofs than the…
A previous article shows that any linear height bounded normal proof of a tautology in the Natural Deduction for Minimal implicational logic $M_{\supset}$ is as huge as it is redundant. More precisely, any proof in a family of…
A recent interpretation of the caloric curve based on the expansion of the abraded spectator nucleus is re-analysed in the framework of the Time-Dependent Hartree-Fock (TDHF) evolution. It is shown that the TDHF dynamics is more complex…
Controlling small size trapping sets and short cycles can result in LDPC codes with large minimum distance $d_{\min}$. We prove that short cycles with a chord are the root of several trapping sets and eliminating these cycles increases…
In finite-dimensional simple Lie algebras and affine Kac-Moody Lie algebras, Chevalley involutions are crucial ingredients of the modular theory. Towards establishing the modular theory for extended affine Lie algebras, we investigate the…
We study the convergence behavior of the celebrated temporal-difference (TD) learning algorithm. By looking at the algorithm through the lens of optimization, we first argue that TD can be viewed as an iterative optimization algorithm where…
This paper revisits the temporal difference (TD) learning algorithm for the policy evaluation tasks in reinforcement learning. Typically, the performance of TD(0) and TD($\lambda$) is very sensitive to the choice of stepsizes. Oftentimes,…
The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. Such logic formally extends logic programming, abductive logic programming and datalog, and thus formalizes…
We propose a new type system for lambda-calculus ensuring that well-typed programs can be executed in polynomial time: Dual light affine logic (DLAL). DLAL has a simple type language with a linear and an intuitionistic type arrow, and one…
We study algebraic cycles in the moduli space of $\mathrm{PGL}_2$-shtukas, arising from the diagonal torus. Our main result shows that their intersection pairing with the Heegner-Drinfeld cycle is the product of the $r$-th central…
In this note we prove a result comparing rationality of algebraic cycles over the function field of a $SL_1(A)$-torsor for a central simple algebra $A$ and over the base field.
This paper considers the problem of designing maximum distance separable (MDS) codes over small fields with constraints on the support of their generator matrices. For any given $m\times n$ binary matrix $M$, the GM-MDS conjecture, due to…
Every submartingale S of class D has a unique Doob-Meyer decomposition S=M+A, where M is a martingale and A is a predictable increasing process starting at 0. We provide a short and elementary prove of the Doob-Meyer decomposition theorem.…
Using insight from numerical approximation of ODEs and the problem formulation and solution methodology of TD learning through a Galerkin relaxation, I propose a new class of TD learning algorithms. After applying the improved numerical…