English
Related papers

Related papers: Integral Approximations for Coverage Probability

200 papers

We introduce a new copula-based correction for generalized linear mixed models (GLMMs) within the integrated nested Laplace approximation (INLA) approach for approximate Bayesian inference for latent Gaussian models. While INLA is usually…

Computation · Statistics 2015-12-16 Egil Ferkingstad , Håvard Rue

This paper surveys hyperinterpolation, a quadrature-based approximation scheme. We cover classical results, provide examples on several domains, review recent progress on relaxed quadrature exactness, introduce methodological variants, and…

Numerical Analysis · Mathematics 2025-10-07 Congpei An , Jiashu Ran , Hao-Ning Wu

Local projections (LPs) are widely used for impulse response analysis, but Bayesian methods face challenges due to the absence of a likelihood function. Existing approaches rely on pseudo-likelihoods, which often result in poorly calibrated…

Econometrics · Economics 2026-05-19 Masahiro Tanaka

Characterizing the risk of operations is a fundamental requirement in robotics, and a crucial ingredient of safe planning. The problem is multifaceted, with multiple definitions arising in the vast recent literature fitting different…

Robotics · Computer Science 2024-10-03 Lorenzo Paiola , Giorgio Grioli , Antonio Bicchi

The concept of Probability of Causation (PC) is critically important in legal contexts and can help in many other domains. While it has been around since 1986, current operationalizations can obtain only the minimum and maximum values of…

Methodology · Statistics 2018-08-14 Tapajit Dey , Audris Mockus

Spatial interference alignment among a finite number of users is proposed as a technique to increase the probability of successful transmission in an interference limited clustered wireless ad hoc network. Using techniques from stochastic…

Information Theory · Computer Science 2010-01-14 R. Tresch , M. Guillaud

We explore two aspects of geometric approximation via a coupling approach to Stein's method. Firstly, we refine precision and increase scope for applications by convoluting the approximating geometric distribution with a simple translation…

Probability · Mathematics 2024-12-11 Fraser Daly , Claude Lefèvre

We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…

Numerical Analysis · Mathematics 2014-07-01 Gil Shabat , Yaniv Shmueli , Amir Averbuch

We extend the theory of low-rank matrix recovery and completion to the case when Poisson observations for a linear combination or a subset of the entries of a matrix are available, which arises in various applications with count data. We…

Machine Learning · Computer Science 2016-04-20 Yang Cao , Yao Xie

A method to approximate continuous multi-dimensional probability density functions (PDFs) using their projections and correlations is described. The method is particularly useful for event classification when estimates of systematic…

Data Analysis, Statistics and Probability · Physics 2009-10-31 Dean Karlen

As an application of Stein's method for Poisson approximation, we prove rates of convergence for the tail probabilities of two scan statistics that have been suggested for detecting local signals in sequences of independent random variables…

Probability · Mathematics 2015-05-29 Xiao Fang , David Siegmund

We study constant-factor approximation algorithms for the Bin Packing Problem with Setups (BPPS). First, we show that adaptations of classical BPP heuristics can have arbitrarily poor worst-case performance on BPPS instances. Then, we…

Optimization and Control · Mathematics 2026-01-01 Roberto Baldacci , Fabio Ciccarelli , Stefano Coniglio , Valerio Dose , Fabio Furini

We present a brief review on the Impulse Approximation method to study processes of scattering off composite particles. We first construct the model in a non-relativistic fashion that enables us to extend the model to a covariant Impulse…

Nuclear Theory · Physics 2007-05-23 Maurizio De Sanctis , Mario A. Acero , Diego A. Milanes , Carlos E. Sandoval

Several numerical approximation strategies for the expectation-propagation algorithm are studied in the context of large-scale learning: the Laplace method, a faster variant of it, Gaussian quadrature, and a deterministic version of…

Computation · Statistics 2016-11-16 Alexis Roche

We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…

Probability · Mathematics 2016-07-06 Richard Arratia , Stephen DeSalvo

Inducing-point-based sparse variational Gaussian processes have become the standard workhorse for scaling up GP models. Recent advances show that these methods can be improved by introducing a diagonal scaling matrix to the conditional…

Machine Learning · Statistics 2025-07-04 Thang D. Bui , Michalis K. Titsias

We propose a method for estimating the posterior distribution of a standard geostatistical model. After choosing the model formulation and specifying a prior, we use normal mixture densities to approximate the posterior distribution. The…

Methodology · Statistics 2014-09-10 Zepu Zhang

In recent years, spatial and spatio-temporal modeling have become an important area of research in many fields (epidemiology, environmental studies, disease mapping). In this work we propose different spatial models to study hospital…

Applications · Statistics 2010-06-21 Erik A. Sauleau , Valentina Mameli , Monica Musio

We extend the theory of matrix completion to the case where we make Poisson observations for a subset of entries of a low-rank matrix. We consider the (now) usual matrix recovery formulation through maximum likelihood with proper…

Machine Learning · Statistics 2015-03-26 Yang Cao , Yao Xie

A fundamental tool in network information theory is the covering lemma, which lower bounds the probability that there exists a pair of random variables, among a give number of independently generated candidates, falling within a given set.…

Information Theory · Computer Science 2019-04-18 Jingbo Liu , Mohammad H. Yassaee , Sergio Verdú