English
Related papers

Related papers: A probabilistic model for the degree of the cancel…

200 papers

We study the problem of identifying a probability distribution for some given randomly sampled data in the limit, in the context of algorithmic learning theory as proposed recently by Vinanyi and Chater. We show that there exists a…

Machine Learning · Computer Science 2018-03-14 George Barmpalias , Frank Stephan

High-dimensional count data poses significant challenges for statistical analysis, necessitating effective methods that also preserve explainability. We focus on a low rank constrained variant of the Poisson log-normal model, which relates…

Optimization and Control · Mathematics 2025-06-17 Bastien Batardière , Julien Chiquet , Joon Kwon , Julien Stoehr

In this paper, we introduce elements of probabilistic model that is suitable for modeling of learning algorithms in biologically plausible artificial neural networks framework. Model is based on two of the main concepts in quantum physics -…

Neural and Evolutionary Computing · Computer Science 2010-01-26 Marko V. Jankovic

We study different fractional extensions of the Poisson process and generalized counting processes by introducing time-change represented by the inverse to the sums of stable and tempered stable subordinators. We state the governing…

Probability · Mathematics 2026-04-02 Lyudmyla Sakhno , Artem Storozhuk

We propose a generalisation of Gibbs' statistical mechanics into the domain of non-negligible phase space correlations. Derived are the probability distribution and entropy as a generalised ensemble average, replacing…

Statistical Mechanics · Physics 2014-09-10 R. A. Treumann , W. Baumjohann

We study the task of learning Generalized Linear models (GLMs) in the agnostic model under the Gaussian distribution. We give the first polynomial-time algorithm that achieves a constant-factor approximation for \textit{any} monotone…

Machine Learning · Computer Science 2025-08-05 Nikos Zarifis , Puqian Wang , Ilias Diakonikolas , Jelena Diakonikolas

A method for generating random $U(1)$ variables with Boltzmann distribution is presented. It is based on the rejection method with transformation of variables. High efficiency is achieved for all range of temparatures or coupling…

High Energy Physics - Lattice · Physics 2009-10-22 Tetsuya Hattori , Hideo Nakajima

The k-nearest-neighbour procedure is a well-known deterministic method used in supervised classification. This paper proposes a reassessment of this approach as a statistical technique derived from a proper probabilistic model; in…

Computation · Statistics 2008-02-12 Lionel Cucala , Jean-Michel Marin , Christian Robert , Mike Titterington

Latent Gaussian models have a rich history in statistics and machine learning, with applications ranging from factor analysis to compressed sensing to time series analysis. The classical method for maximizing the likelihood of these models…

Machine Learning · Computer Science 2023-06-07 Alexander Lin , Bahareh Tolooshams , Yves Atchadé , Demba Ba

In this paper, we study the bipolar Boltzmann-Poisson model, both for the deterministic system and the system with uncertainties, with asymptotic behavior leading to the drift diffusion-Poisson system as the Knudsen number goes to zero. The…

Numerical Analysis · Mathematics 2018-11-14 Liu Liu

The problem of computing posterior functionals in general high-dimensional statistical models with possibly non-log-concave likelihood functions is considered. Based on the proof strategy of Nickl and Wang (2022), but using only local…

Statistics Theory · Mathematics 2025-07-24 Randolf Altmeyer

Cosmological perturbation theory is a powerful tool to predict the statistics of large-scale structure in the weakly non-linear regime, but even at 1-loop order it results in computationally expensive mode-coupling integrals. Here we…

Cosmology and Nongalactic Astrophysics · Physics 2017-02-17 Xiao Fang , Jonathan A. Blazek , Joseph E. McEwen , Christopher M. Hirata

We here consider the subset simulation method which approaches a failure event using a decreasing sequence of nested intermediate failure events. The method resembles importance sampling, which actively explores a probability space by…

Computation · Statistics 2020-03-16 Kenan Šehić , Mirza Karamehmedović

Approximate Bayesian computation methods are useful for generative models with intractable likelihoods. These methods are however sensitive to the dimension of the parameter space, requiring exponentially increasing resources as this…

Computation · Statistics 2026-02-09 Grégoire Clarté , Christian P. Robert , Robin Ryder , Julien Stoehr

Computation of the marginal likelihood from a simulated posterior distribution is central to Bayesian model selection but is computationally difficult. I argue that the marginal likelihood can be reliably computed from a posterior sample by…

Instrumentation and Methods for Astrophysics · Physics 2010-06-24 Martin D. Weinberg

Based on deleting-item central limit theory, the classical Donsker's theorem of partial-sum process of independent and identically distributed (i.i.d.) random variables is extended to incomplete partial-sum process. The incomplete…

Probability · Mathematics 2019-12-17 Jingwei Liu

The Robbins-Monro algorithm is a recursive, simulation-based stochastic procedure to approximate the zeros of a function that can be written as an expectation. It is known that under some technical assumptions, Gaussian limit distributions…

Probability · Mathematics 2025-10-22 Valentin Konakov , Enno Mammen , Lorick Huang

We consider the problem of estimating rare event probabilities, focusing on systems whose evolution is governed by differential equations with uncertain input parameters. If the system dynamics is expensive to compute, standard sampling…

Computation · Statistics 2019-11-05 Siddhant Wahal , George Biros

A compound Poisson process whose parameters are all unknown is observed at finitely many equispaced times. Nonparametric estimators of the jump and L\'evy distributions are proposed and functional central limit theorems using the uniform…

Statistics Theory · Mathematics 2017-02-06 Alberto J. Coca

We show that for several variations of partially observable Markov decision processes, polynomial-time algorithms for finding control policies are unlikely to or simply don't have guarantees of finding policies within a constant factor or a…

Artificial Intelligence · Computer Science 2011-06-02 J. Goldsmith , C. Lusena , M. Mundhenk