Skip to content
ml-recall

#gibbs-sampling

2 questions from Probabilistic & Graphical Models, Autoencoders & VAEs

Timed test

2 questions · 2 min · score and explanations at the end

Take a test
Q 1 / 2Score 0 / 0

Question 1: Single choice

mediumAI-checkedProbabilistic & Graphical Models

A restricted Boltzmann machine over binary visibles v\mathbf{v} and hiddens h\mathbf{h} has p(v,h)∝exp⁡(v⊤Wh+a⊤v+b⊤h)p(\mathbf{v}, \mathbf{h}) \propto \exp(\mathbf{v}^\top W \mathbf{h} + \mathbf{a}^\top\mathbf{v} + \mathbf{b}^\top\mathbf{h}). Its conditionals factorise: p(hi=1∣v)=σ(∑jvjWji+bi)p(h_i = 1 \mid \mathbf{v}) = \sigma(\sum_j v_j W_{ji} + b_i) and p(vi=1∣h)=σ(∑jWijhj+ai)p(v_i = 1 \mid \mathbf{h}) = \sigma(\sum_j W_{ij} h_j + a_i). How do you generate (approximate) samples from p(v)p(\mathbf{v})?

Choose one option