Related papers: Generalized Evolutionary Algorithm based on Tsalli…
We provide an information-theoretic analysis of the generalization ability of Gibbs-based transfer learning algorithms by focusing on two popular transfer learning approaches, $\alpha$-weighted-ERM and two-stage-ERM. Our key result is an…
Bayesian models that can handle both over and under dispersed counts are rare in the literature, perhaps because full probability distributions for dispersed counts are rather difficult to construct. This note takes a first look at Bayesian…
We show that starting with either the non-extensive Tsallis entropy in Wang's formalism or the extensive Renyi entropy, it is possible to construct the equilibrium statistical mechanics with non-Gibbs canonical distribution functions. The…
We introduce a generalized additive model for location, scale, and shape (GAMLSS) next of kin aiming at distribution-free and parsimonious regression modelling for arbitrary outcomes. We replace the strict parametric distribution…
In this work we present a rigorous application of the Expectation Maximization algorithm to determine the marginal distributions and the dependence structure in a Gaussian copula model with missing data. We further show how to circumvent a…
Zeroth-order local optimisation algorithms are essential for solving real-valued black-box optimisation problems. Among these, Natural Evolution Strategies (NES) represent a prominent class, particularly well-suited for scenarios where…
In this paper, we investigate the solutions for a generalized fractional diffusion equation that extends some known diffusion equations by taking a spatial time-dependent diffusion coefficient and an external force into account, which…
We develop a formulation for molecular dynamics, Langevin, and hybrid Monte Carlo algorithms in the recently proposed generalized ensemble that is based on a physically motivated realisation of Tsallis weights. The effectiveness of the…
Genetic algorithms (GAs) emulate the process of biological evolution, in a computational setting, in order to generate good solutions to difficult search and optimisation problems. GA-based optimisers tend to be extremely robust and…
Recently, Lee and Cha (2015, `On two generalized classes of discrete bivariate distributions', {\it American Statistician}, 221 - 230) proposed two general classes of discrete bivariate distributions. They have discussed some general…
Nonextensive quantum gas distributions are investigated on the basis of the factorization hypothesis of compound probability required by thermodynamic equilibrium. It is shown that the formalisms of Tsallis nonextensive statistical…
We consider a simple mathematical model of gradual Darwinian evolution in continuous time and continuous trait space, due to intraspecific competition for common resource in an asexually reproducing population in constant environment, while…
We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear and Multilinear Algebra 1(2), 1973, pp. 163-171]. Our algorithms are based on…
Optimal transport is a powerful framework for computing distances between probability distributions. We unify the two main approaches to optimal transport, namely Monge-Kantorovitch and Sinkhorn-Cuturi, into what we define as Tsallis…
Forecasting multivariate time series is a computationally intensive task challenged by extreme or redundant samples. Recent resampling methods aim to increase training efficiency by reweighting samples based on their running losses.…
Choosing the most adequate kernel is crucial in many Machine Learning applications. Gaussian Process is a state-of-the-art technique for regression and classification that heavily relies on a kernel function. However, in the Gaussian…
We propose a general algorithm for approximating nonstandard Bayesian posterior distributions. The algorithm minimizes the Kullback-Leibler divergence of an approximating distribution to the intractable posterior distribution. Our method…
In a convergence of machine learning and biology, we reveal that diffusion models are evolutionary algorithms. By considering evolution as a denoising process and reversed evolution as diffusion, we mathematically demonstrate that diffusion…
In this paper, we propose a stochastic search algorithm for solving general optimization problems with little structure. The algorithm iteratively finds high quality solutions by randomly sampling candidate solutions from a parameterized…
By resorting to sequential constructions of exchangeable random partitions (Pitman, 2006), and exploiting some known facts about generalized Stirling numbers, we derive a generalized Chinese restaurant process construction of exchangeable…