Related papers: A Note on Kaldi's PLDA Implementation

Using Singular Rescaling We Prove Some Bifurcation Results. This note Presents short proofs for some Bifurcation results which had been appeared with other authors.

We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.

Predictive modeling on tabular data is the cornerstone of many real-world applications. Although gradient boosting machines and some recent deep models achieve strong performance on tabular data, they often lack interpretability. On the…

In semidefinite programming the dual may fail to attain its optimal value and there could be a duality gap, i.e., the primal and dual optimal values may differ. In a striking paper, Ramana proposed a polynomial size extended dual that does…

We present a calculus, called the scheme-calculus, that permits to express natural deduction proofs in various theories. Unlike $\lambda$-calculus, the syntax of this calculus sticks closely to the syntax of proofs, in particular, no names…

In this paper, we present an extension of $\lambda\mu$-calculus called $\lambda\mu^{++}$-calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on…

The aim of this work is to show, based on concrete data observation, that the choice of the fractional derivative when modelling a problem is relevant for the accuracy of a method. Using the least squares fitting technique, we determine the…

The classical quadratic formula and some of its lesser known variants for solving the quadratic equation are reviewed. Then, a new formula for the roots of a quadratic polynomial is presented.

In the paper, a method of describing the outer derivations of the group algebra of a finitely presentable group is given. The description of derivations is given in terms of characters of the groupoid of the adjoint action of the group.

This paper is an enhanced version of a more than decade-older paper with a similar title. Many formulae involving both finite and infinite sums of digamma and polygamma functions up to quadratic order, few of which appear in standard…

The derivation of the quantum retrodictive probability formula involves an error, an ambiguity. The end result is correct because this error appears twice, in such a way as to cancel itself. In addition, however, the usual expression for…

In this note we show that any proof of Wallis's formula or of the probability integral formula proves both assertions.

We present a simple inductive proof of the Lagrange Inversion Formula.

We introduce a lazy approach to the explanation-based approximation of probabilistic logic programs. It uses only the most significant part of the program when searching for explanations. The result is a fast and anytime approximate…

Contract-based design is a method to facilitate modular system design. While there has been substantial progress on the theory of contracts, there has been less progress on scalable algorithms for the algebraic operations in this theory. In…

$\lambda$-Scale is an enrichment of lambda calculus which is adapted to emergent algebras. It can be used therefore in metric spaces with dilations.

Multiple scalar integral representations for traces of operator derivatives are obtained and applied in the proof of existence of the higher order spectral shift functions.

We present a method to simplify expressions in the context of an equational theory. The basic ideas and concepts of the method have been presented previously elsewhere but here we tackle the difficult task of making it efficient in…

In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…

French translation, by Henri Lombardi and Stefan Neuwirth, of the article "Did Euclid need the Euclidean algorithm to prove unique factorization?", American Mathematical Monthly 113 (2006), pages 196-205.