English
Related papers

Related papers: Composite Likelihood Estimation for Restricted Bol…

200 papers

The restricted maximum likelihood (REML) estimator of the dispersion matrix for random coefficient models is rewritten in terms of the sufficient statistics of the individual regressions.

Methodology · Statistics 2019-11-14 Kurt S. Riedel

Filtering and parameter estimation under partial information for multiscale problems is studied in this paper. After proving mean square convergence of the nonlinear filter to a filter of reduced dimension, we establish that the conditional…

Probability · Mathematics 2014-09-09 Andrew Papanicolaou , Konstantinos Spiliopoulos

Graphical models are a rich language for describing high-dimensional distributions in terms of their dependence structure. While there are algorithms with provable guarantees for learning undirected graphical models in a variety of…

Machine Learning · Computer Science 2018-11-07 Guy Bresler , Frederic Koehler , Ankur Moitra , Elchanan Mossel

The purpose of the paper is to provide a characterization of the error of the best polynomial approximation of composite functions in weighted spaces. Such a characterization is essential for the convergence analysis of numerical methods…

Numerical Analysis · Mathematics 2023-08-14 Luisa Fermo , Concetta Laurita , Maria Grazia Russo

Likelihood inference for max-stable random fields is in general impossible because their finite-dimensional probability density functions are unknown or cannot be computed efficiently. The weighted composite likelihood approach that…

Statistics Theory · Mathematics 2025-03-11 Nicolas Chenavier , Christian Y. Robert

Boltzmann machines (BMs) are a class of binary neural networks for which there have been numerous proposed methods of estimation. Recently, it has been shown that in the fully visible case of the BM, the method of maximum pseudolikelihood…

Computation · Statistics 2014-09-30 Hien D. Nguyen , Ian A. Wood

Non-parametric methods avoid the problem of having to specify a particular data generating mechanism, but can be computationally intensive, reducing their accessibility for large data problems. Empirical likelihood, a non-parametric…

Computation · Statistics 2017-12-15 Adam Jaeger , Nicole Lazar

We consider stochastic approximations which arise from such applications as data communications and image processing. We demonstrate why constraints are needed in a stochastic approximation and how a constrained approximation can be…

Numerical Analysis · Mathematics 2015-09-01 Hong Jiang , Gang Huang , Paul Wilford , Liangkai Yu

Fitting mixed models to complex survey data is a challenging problem. Most methods in the literature, including the most widely used one, require a close relationship between the model structure and the survey design. In this paper we…

Methodology · Statistics 2023-11-23 Thomas Lumley , Xudong Huang

The additive hazards model specifies the effect of covariates on the hazard in an additive way, in contrast to the popular Cox model, in which it is multiplicative. As non-parametric model, it offers a very flexible way of modeling…

Methodology · Statistics 2022-01-24 Chengyuan Lu , Jelle Goeman , Hein Putter

Logistic regression is a fundamental and widely used statistical method for modeling binary outcomes based on covariates. However, the presence of missing data, particularly in settings involving hybrid covariates (a mix of discrete and…

Methodology · Statistics 2025-06-05 Mohamed Cherifi , Xujia Zhu , Mohammed Nabil El Korso , Ammar Mesloub

Variance parameter estimation in linear mixed models is a challenge for many classical nonlinear optimization algorithms due to the positive-definiteness constraint of the random effects covariance matrix. We take a completely novel view on…

Machine Learning · Statistics 2022-12-20 Lena Sembach , Jan Pablo Burgard , Volker H. Schulz

This paper extends the algorithm schemes proposed in \cite{Nesterov2007a} and \cite{Nesterov2007b} to the minimization of the sum of a composite objective function and a convex function. Two proximal point-type schemes are provided and…

Optimization and Control · Mathematics 2011-05-03 Quoc Tran Dinh , Moritz Diehl

We consider compound geometric approximation for a nonnegative, integer-valued random variable $W$. The bound we give is straightforward but relies on having a lower bound on the failure rate of $W$. Applications are presented to M/G/1…

Probability · Mathematics 2015-09-10 Fraser Daly

We explore the problems of classification of composite object (images, speech signals) with low number of models per class. We study the question of improving recognition performance for medium-sized database (thousands of classes). The key…

Computer Vision and Pattern Recognition · Computer Science 2017-09-19 Andrey Savchenko

Modern datasets are becoming heterogeneous. To this end, we present in this paper Mixed-Variate Restricted Boltzmann Machines for simultaneously modelling variables of multiple types and modalities, including binary and continuous…

Machine Learning · Statistics 2014-08-07 Truyen Tran , Dinh Phung , Svetha Venkatesh

Computing the marginal likelihood or evidence is one of the core challenges in Bayesian analysis. While there are many established methods for estimating this quantity, they predominantly rely on using a large number of posterior samples…

Computation · Statistics 2021-02-26 Eric Chuu , Debdeep Pati , Anirban Bhattacharya

This paper addresses two central problems for probabilistic processing models: parameter estimation from incomplete data and efficient retrieval of most probable analyses. These questions have been answered satisfactorily only for…

cmp-lg · Computer Science 2007-05-23 Stefan Riezler

We adapt the quasi-monotone method from [2] for composite convex minimization in the stochastic setting. For the proposed numerical scheme we derive the optimal convergence rate in terms of the last iterate, rather than on average as it is…

Optimization and Control · Mathematics 2021-07-09 Vyacheslav Kungurtsev , Vladimir Shikhman

The Boltzmann model for the random generation of "decomposable" combinatorial structures is a set of techniques that allows for efficient random sampling algorithms for a large class of families of discrete objects. The usual requirement of…

Data Structures and Algorithms · Computer Science 2011-12-23 Philippe Duchon