Generalized Beta Mixtures of Gaussians
In recent years, a rich variety of shrinkage priors have been proposed that have great promise in addressing massive regression problems. In general, these new priors can be expressed as scale mixtures of normals, but have more complex forms and better properties than traditional Cauchy and double exponential priors. We first propose a new class of normal scale mixtures through a novel generalized beta distribution that encompasses many interesting priors as special cases. This encompassing framework should prove useful in comparing competing priors, considering properties and revealing close connections. We then develop a class of variational Bayes approximations through the new hierarchy presented that will scale more efficiently to the types of truly massive data sets that are now encountered routinely.
Code (0)
등록된 구현이 없습니다.
Tasks
regressionSimilar Papers 제목 키워드 기반
Near-optimal sample complexity bounds for learning Latent $k-$polytopes and applications to Ad-Mixtures
Recently near-optimal bounds on sample complexity of Mixture of Gaussians was shown in the seminal paper \cite{HSNCAY18}. No such results are known for Ad-mixtures. In this paper we show that $O^*(dk/m)$ samples are suff…
Modeling Stock Return Distributions and Pricing Options
This paper provides evidence that stock returns, after truncation, might be modeled by a special type of continuous mixtures or normals, so-called $q$-Gaussians. Negative binomial distributions might model the counts for…
Some results on a $χ$-divergence, an~extended~Fisher information and~generalized~Cramér-Rao inequalities
We propose a modified $\chi^{\beta}$-divergence, give some of its properties, and show that this leads to the definition of a generalized Fisher information. We give generalized Cram\'er-Rao inequalities, involving this …
Sample-Efficient Private Learning of Mixtures of Gaussians
We study the problem of learning mixtures of Gaussians with approximate differential privacy. We prove that roughly $kd^2 + k^{1.5} d^{1.75} + k^2 d$ samples suffice to learn a mixture of $k$ arbitrary $d$-dimensional Ga…
Privately Learning Mixtures of Axis-Aligned Gaussians
We consider the problem of learning mixtures of Gaussians under the constraint of approximate differential privacy. We prove that $\widetilde{O}(k^2 d \log^{3/2}(1/\delta) / \alpha^2 \varepsilon)$ samples are sufficient …