Related papers: On the Reduction and Evaluation of Generalized Pol…
Generalised polylogarithms naturally appear in higher-order calculations of quantum field theories. We present handyG, a Fortran 90 library for the evaluation of such functions, by implementing the algorithm proposed by Vollinga and…
This diploma thesis is concerned with functional decomposition $f = g \circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A…
The Polynomial-Time Hierarchy ($\mathsf{PH}$) is a staple of classical complexity theory, with applications spanning randomized computation to circuit lower bounds to ''quantum advantage'' analyses for near-term quantum computers.…
Reductions combine collections of inputs with an associative (and here, also commutative) operator to produce collections of outputs. When the same value contributes to multiple outputs, there is an opportunity to reuse partial results,…
Generalizations of some known results on the best, best linear and best one-sided approxima- tions by trigonometric polynomials of the classes of 2\pi - periodic functions presented in the form of convolutions to the case of set-valued…
This paper deals with generalized elliptic integrals and generalized modular functions. Several new inequalities are given for these and related functions.
The results summarized here are intended as rigorous mathematical statements on various physical models coming from condensed matter physics, statistical mechanics (classical and quantum), quantum field theory and cold atoms physics. The…
This monograph aims at providing an introduction to key concepts, algorithms, and theoretical results in machine learning. The treatment concentrates on probabilistic models for supervised and unsupervised learning problems. It introduces…
In this note, the correction to the proof of one theorem in some our previous paper [arXiv:1302.0589] will be given.
Generalized linear models (GLMs) arise in high-dimensional machine learning, statistics, communications and signal processing. In this paper we analyze GLMs when the data matrix is random, as relevant in problems such as compressed sensing,…
In this paper, the classical Lie symmetry analysis and the generalized form of Lie symmetry method are performed for a general short pulse equation. The point, contact and local symmetries for this equation are given. In this paper, we…
A Reduction -- an accumulation over a set of values, using an associative and commutative operator -- is a common computation in many numerical computations, including scientific computations, machine learning, computer vision, and…
We reply to the comment of Becker, Nelissen, Cleuren, Partoens, and Van den Broeck, Phys. Rev. E 93, 046101 (2016) on our article, Phys. Rev. E 90, 052108 (2014) about transport properties of a class of generalized exclusion processes.
The flow polytope $\mathcal{F}_{\widetilde{G}}$ is the set of nonnegative unit flows on the graph $\widetilde{G}$. The subdivision algebra of flow polytopes prescribes a way to dissect a flow polytope $\mathcal{F}_{\widetilde{G}}$ into…
We present a reinforcement learning (RL) based guidance system for automated theorem proving geared towards Finding Longer Proofs (FLoP). Unlike most learning based approaches, we focus on generalising from very little training data and…
From the integration of non-symmetrical hyperboles, a one-parameter generalization of the logarithmic function is obtained. Inverting this function, one obtains the generalized exponential function. We show that functions characterizing…
We review an approach for the computation of Feynman integrals by use of multiple polylogarithms, with an emphasis on the related criterion of linear reducibility of the graph. We show that the set of graphs which satisfies the linear…
The competition "Predicting Generalization in Deep Learning (PGDL)" aims to provide a platform for rigorous study of generalization of deep learning models and offer insight into the progress of understanding and explaining these models.…
This is a short exposition--mostly by way of the toy models ``double logarithm'' and ``triple logarithm''--which should serve as an introduction to a forthcoming article in which we establish a connection between multiple polylogarithms,…
We introduce a general framework for de Finetti reduction results, applicable to various notions of partially exchangeable probability distributions. Explicit statements are derived for the cases of exchangeability, Markov exchangeability,…