English
Related papers

Related papers: An Extended Empirical Saddlepoint Approximation fo…

200 papers

In real-world regression tasks, datasets frequently exhibit imbalanced distributions, characterized by a scarcity of data in high-complexity regions and an abundance in low-complexity areas. This imbalance presents significant challenges…

Machine Learning · Computer Science 2025-02-05 Donghe Chen , Jiaxuan Yue , Tengjie Zheng , Lanxuan Wang , Lin Cheng

We consider an extension of $\epsilon$-entropy to a KL-divergence based complexity measure for randomized density estimation methods. Based on this extension, we develop a general information-theoretical inequality that measures the…

Statistics Theory · Mathematics 2007-06-13 Tong Zhang

Motivated by studying asymptotic properties of the maximum likelihood estimator (MLE) in stochastic volatility (SV) models, in this paper we investigate likelihood estimation in state space models. We first prove, under some regularity…

Statistics Theory · Mathematics 2010-11-15 Cheng-Der Fuh

Stochastic simulation algorithms such as likelihood weighting often give fast, accurate approximations to posterior probabilities in probabilistic networks, and are the methods of choice for very large networks. Unfortunately, the special…

Artificial Intelligence · Computer Science 2016-11-26 Keiji Kanazawa , Daphne Koller , Stuart Russell

With the increasing penetration of high-frequency sensors across a number of biological and physical systems, the abundance of the resulting observations offers opportunities for higher statistical accuracy of down-stream estimates, but…

Optimization and Control · Mathematics 2020-11-06 Shushu Zhang , Vivak Patel

Maximum Likelihood Estimators (MLE) has many good properties. For example, the asymptotic variance of MLE solution attains equality of the asymptotic Cram{\'e}r-Rao lower bound (efficiency bound), which is the minimum possible variance for…

Machine Learning · Statistics 2019-11-05 Song Liu , Takafumi Kanamori , Wittawat Jitkrittum , Yu Chen

Approximate inference in probability models is a fundamental task in machine learning. Approximate inference provides powerful tools to Bayesian reasoning, decision making, and Bayesian deep learning. The main goal is to estimate the…

Machine Learning · Computer Science 2020-03-10 Jun Han

We introduce Density sketches (DS): a succinct online summary of the data distribution. DS can accurately estimate point wise probability density. Interestingly, DS also provides a capability to sample unseen novel data from the underlying…

Data Structures and Algorithms · Computer Science 2021-02-25 Aditya Desai , Benjamin Coleman , Anshumali Shrivastava

Approximate Bayesian Computation (ABC) methods are applicable to statistical models specified by generative processes with analytically intractable likelihoods. These methods try to approximate the posterior density of a model parameter by…

Methodology · Statistics 2024-03-11 Sanjay Chaudhuri , Subhroshekhar Ghosh , Kim Cuc Pham

We propose a new, computationally efficient, sparsity adaptive changepoint estimator for detecting changes in unknown subsets of a high-dimensional data sequence. Assuming the data sequence is Gaussian, we prove that the new method…

Methodology · Statistics 2023-11-27 Per August Jarval Moen , Ingrid Kristine Glad , Martin Tveten

Bayesian inference for complex models with an intractable likelihood can be tackled using algorithms performing many calls to computer simulators. These approaches are collectively known as "simulation-based inference" (SBI). Recent SBI…

Stochastic differential equations (SDEs) are of utmost importance in various scientific and industrial areas. They are the natural description of dynamical processes whose precise equations of motion are either not known or too expensive to…

Methodology · Statistics 2017-11-08 Philipp Frank , Theo Steininger , Torsten A. Enßlin

Our paper deals with inferring simulator-based statistical models given some observed data. A simulator-based model is a parametrized mechanism which specifies how data are generated. It is thus also referred to as generative model. We…

Machine Learning · Statistics 2016-01-01 Michael U. Gutmann , Jukka Corander

Nonprobability (convenience) samples are increasingly sought to stabilize estimations for one or more population variables of interest that are performed using a randomized survey (reference) sample by increasing the effective sample size.…

Stochastic gradients have been widely integrated into Langevin-based methods to improve their scalability and efficiency in solving large-scale sampling problems. However, the proximal sampler, which exhibits much faster convergence than…

Machine Learning · Statistics 2024-05-28 Xunpeng Huang , Difan Zou , Yi-An Ma , Hanze Dong , Tong Zhang

The simulation of complex stochastic network dynamics arising, for instance, from models of coupled biomolecular processes remains computationally challenging. Often, the necessity to scan a models' dynamics over a large parameter space…

Quantitative Methods · Quantitative Biology 2013-03-14 Tiago Ramalho , Marco Selig , Ulrich Gerland , Torsten A. Enßlin

We investigate saddlepoint approximations applied to the score test statistic in genome-wide association studies with binary phenotypes. The inaccuracy in the normal approximation of the score test statistic increases with increasing sample…

Density regression characterizes the conditional density of the response variable given the covariates, and provides much more information than the commonly used conditional mean or quantile regression. However, it is often computationally…

Methodology · Statistics 2022-06-15 Yunlu Chen , Nan Zhang

Approximate Bayesian inference typically revolves around computing the posterior parameter distribution. In practice, however, the main object of interest is often a model's predictions rather than its parameters. In this work, we propose…

Machine Learning · Statistics 2026-05-29 Julian Rodemann , Alexander Marquard , Thomas Augustin , Michele Caprio

We consider saddle point problems which objective functions are the average of $n$ strongly convex-concave individual components. Recently, researchers exploit variance reduction methods to solve such problems and achieve linear-convergence…

Machine Learning · Computer Science 2019-09-17 Luo Luo , Cheng Chen , Yujun Li , Guangzeng Xie , Zhihua Zhang