We propose a generic Markov Chain Monte Carlo (MCMC) algorithm to speed up computations for datasets with many observations. A key feature of our approach is the use of the highly efficient difference estimator from the survey sampling literature to estimate the log-likelihood accurately using...

We propose a generic Markov Chain Monte Carlo (MCMC) algorithm to speed up computations for datasets with many observations. A key feature of our approach is the use of the highly efficient difference estimator from the survey sampling literature to estimate the log-likelihood accurately using...

This paper incorporates the variance of auxiliary variables to propose three improved ratio estimators of population mean. To enhance the efficiency of the proposed ratio estimators, a linear combination of the population coefficient of variation, kurtosis, skewness and the population variance...

More than 25 years after German reunification, key economic indicators for households living in eastern German regions are still below the western German levels. This particularly holds for private net wealth, which reaches only about 40% of the western German level. However, a more granular...

A dynamic panel data model is considered that contains possibly stochastic individual components and a common stochastic time trend that allows for stationary and nonstationary long memory and general parametric short memory. We propose four different ways of coping with the individual effects...

A dynamic panel data model is considered that contains possibly stochastic individual components and a common fractional stochastic time trend. We propose four different ways of coping with the individual effects so as to estimate the fractional parameter. Like models with autoregressive...

The classical binary classification problem is investigated when it is known in advance that the posterior probability function (or regression function) belongs to some class of functions. We introduce and analyze a method which effectively exploits this knowledge. The method is based on...

Minimax lower bounds for concept learning state, for example, that for each sample size $n$ and learning rule $g_n$, there exists a distribution of the observation $X$ and a concept $C$ to be learnt such that the expected error of $g_n$ is at least a constant times $V/n$, where $V$ is the VC...