Related papers: A Note on Kaldi's PLDA Implementation
Inference algorithms in probabilistic programming languages (PPLs) can be thought of as interpreters, since an inference algorithm traverses a model given evidence to answer a query. As with interpreters, we can improve the efficiency of…
The idea of writing a table of probabilistic data for a quantum or classical system, and of decomposing this table in a compact way, leads to a shortcut for Hardy's formalism, and gives new perspectives on foundational issues.
We derive and prove a new formulation of the Lerch zeta function as a fractional derivative of an elementary function. We demonstrate how this formulation interacts very naturally with basic known properties of Lerch zeta, and use the…
Probabilistic Law Discovery (PLD) is a logic based Machine Learning method, which implements a variant of probabilistic rule learning. In several aspects, PLD is close to Decision Tree/Random Forest methods, but it differs significantly in…
We present a simplified integral of functions of several variables. Although less general than the Riemann integral, most functions of practical interest are still integrable. On the other hand, the basic integral theorems can be obtained…
How can complexity theory and algorithms benefit from practical advances in computing? We give a short overview of some prior work using practical computing to attack problems in computational complexity and algorithms, informally describe…
We prove a pointwise estimate for positive dyadic shifts of complexity $m$ which is linear in the complexity. This can be used to give a pointwise estimate for Calder\'on-Zygmund operators and to answer a question posed by A. Lerner.…
Differential lambda-calculus was first introduced by Thomas Ehrhard and Laurent Regnier in 2003. Despite more than 15 years of history, little work has been done on a differential calculus with integration. In this paper, we shall propose a…
We discuss an extension of the modified method of simplest equation for obtaining exact analytical solutions of nonlinear partial differential equations. The extension includes the possibility for use of: (i) more than one simplest…
This object of this paper to give several properties and applications of multiple p-adic q-L-function of two variables.
We present an extension of a previously developed method employing the formalism of the fractional derivatives to solve new classes of integral equations. This method uses different forms of integral operators that generalizes the…
In this work derivations of definite integrals listed in Prudnikov volume I, Gradshteyn and Ryzhik and a few other tables are produced. Special cases of these integrals in terms of fundamental constants are also evaluated. The method used…
Regularized discriminant analysis (RDA), proposed by Friedman (1989), is a widely popular classifier that lacks interpretability and is impractical for high-dimensional data sets. Here, we present an interpretable and computationally…
We address lower bounds on the time complexity of algorithms solving the propositional satisfiability problem. Namely, we consider two DPLL-type algorithms, enhanced with the unit clause and pure literal heuristics. Exponential lower bounds…
Linear typed $\lambda$-calculi are more delicate than their simply typed siblings when it comes to metatheoretic results like preservation of typing under renaming and substitution. Tracking the usage of variables in contexts places more…
The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing lambda…
In this note, we prove a quantization formula for singular reductions. The main result is obtained as a simple application of an extended quantization formula proved in [TZ2].
In paper describes the new logic programming language Delta, which have a many good properties. Delta-programs is p-computable, verifiable and can translation on other languages. Also we describe the Delta-methodology for constructing…
We discuss alternative iteration methods for differential equations. We provide a convergence proof for exactly solvable examples and show more convenient formulas for nontrivial problems.
Although the characterization of ring derivations has an extensive literature, up to now, all of the characterizations have had the following form: additivity and another property imply that the function in question is a derivation. The aim…