Sale!

HW #3 Modeling Influence in a Network

$30.00

Category:

Modeling Influence in a Network
This problem considers modeling the flow of influence within a social network using an undirected graphical
model. We assume there is a new piece of information currently gaining influence in the network. In
particular, for this example we consider a viral GIF that is being shared among the CS281 teaching staff.
For each person in the network, we will associate a binary random variable indicating whether they are aware
of the information, e.g. RS=1 indicates that Rachit Singh has seen the GIF.
We consider the small fixed network of (relatively unpopular) individuals with a set of connections that form
a forest.
RS
MG YD
ZH
HS
SR
NZ
YK
With each person in the network we associate a unary log-potential e.g. θRS(0) and θRS(1) indicating a
“score” for them seeing the GIF on their own.
s SR YD MG ZH HS RS NZ YK
θs(1) 2 -2 -2 -8 -2 3 -2 1
θs(0) 0 0 0 0 0 0 0 0
Additionally we assume a set of attractive binary log-potentials θs−t(1, 1) = 2 for all connected nodes
s, t ∈ E with all other values θs−t(1, 0) = 0, θs−t(0, 1) = 0, θs−t(0, 0) = 0 across the network.
1
Problem 1 (30pts)
(Note: for this problem you will be deriving several properties of undirected graphical models
and implementing these properties in Python/PyTorch. Before getting started it is worth getting
familiar with the itertools package in Python and also being sure you understand how PyTorch variables work. In particular try writing a simple scalar function with several vector-valued
Variables as inputs and making you understand what the function .backward does in practice.)
(a) Implement a function for computing the global score for an assignment of values to the random
variables, i.e. a function that takes in {0, 1} values for each person and returns the unnormalized
value without the A(θ) term. What is the score for an assignment where RS and SR are the only
people who have seen the GIF?
(b) Implement a function for computing the log-partition function A(θ) using brute-force, i.e. take in
a vector θ and return a scalar value calculated by enumeration. What is its value? Using this
value compute the probability of the assignment in (a)?
For the problems below we will be interested in computing the marginal probabilities for each
random variable, i.e. p(SR = 1), p(RS = 1), etc.
(c) First, implement a function to compute p(RS = 1) using brute-force marginalization. Use the
functions above to enumerate and sum all assignments with RS = 1 .
(d) Using what we know about exponential families, derive an expression for computing all marginals
directly from the log-partition function A(θ). Simplify the expression.
(e) Combine parts (b) and (d) to implement a method for computing the marginal probabilities of
this model using PyTorch and autograd. Ensure that this gives the same value as part (c).
(f) Finally compute all the marginals using exact belief propagation with the serial dynamic programming protocol, as described in class and in Murphy section 20.2.1. Use MG as the root of your
graph. Verify that your marginals are the same as in the previous two calculations.
(g) How do the relative values of the marginal probabilities at each node differ from the original
log-potentials? Explain which nodes values differ most and why this occurs.
(h) (Optional) Implement the parallel protocol for exact BP. How does its practical speed compare
to serial?

A Note on Sparse Lookups
For the next two problems it will be beneficial to utilize sparse matrices for computational speed. In particular
our input data will consist of sparse indicator vectors that act as lookups into a dense weight matrix. For
instance, if we say there are 500 users each associated with a vector R
100 it implies a matrix W ∈ R
500×100
.
If we want a fast sparse lookup of the 1st and 10th user we can run the following code:
W = nn.Embedding(500, 100)
x = Variable(torch.LongTensor([ [1], [10] ]))
print(W(x))
This same trick can be used to greatly speed up the calculation of bag-of-words features from the last
homework. Let’s use the same example:
• We like programming. We like food.
Assume that the vocabulary is
[“We”, “like”, “programming”, “food”, “CS281”]
In last homework, we converted the above word id sequence to a vector of length of vocab size:
• [2, 2, 1, 1, 0]
Instead we can convert it vector of sentence length (often much shorter):
• [0, 1, 2, 0, 1, 3]
In order to calculate the same dot product between x and a weight vector w = [0.5, 0.2, 0.3, 0.1, 0.5] we can
do sparse lookups and a sum: (verify yourself that it is correct):
vocab_size = 4
W = nn.Embedding(vocab_size, 1, padding_idx=text_field.stoi(’<pad>’))
W.weight.data = torch.Tensor([ [0.5], [0.2], [0.3], [0.1], [0.5] ])
x = Variable(torch.LongTensor([ [0, 1, 2, 0, 1, 3] ]))
result = torch.sum(W(x), dim=1)).squeeze()
This code computes the same dot-product as in HW2 but by doing 6 fast vector lookups into w and
summing them together. (The padding idx part ensures the embedding code works when there are sentences
of different length by setting a lookup of its argument to return 0. This lets you use a rectangular matrix
even with batches of different sentence lengths.) For more details, see the documentation for this module on
the PyTorch website.
4
Problem 2 (Modeling users and jokes with a latent linear model, 25pts)
In this problem, we’ll use a latent linear model to jointly model the ratings users assign to jokes.
The data set we’ll use is a modified and preprocessed variant of the Jester data set (version 2) from
http://eigentaste.berkeley.edu/dataset/. The data we provide you with are user ratings of 150
jokes. There are over 1.7M ratings with values 1, 2, 3, 4 and 5, from about seventy thousand users. The
data we give you is a modified version of the original Jester data set, see the README,
please use the files we provide and not the original ones. The texts of the jokes are also available.
Warning: most of the jokes are bad, tasteless, or both. At best, they were funny to late-night TV hosts
in 1999-2000. Note also that some of the jokes do not have any ratings and so can be ignored.
Update: If you are having memory issues with this problem. Please see the note in the
readme.
(a) Let ri,j ∈ {1, 2, 3, 4, 5} be the rating of user i on joke j. A latent linear model introduces a vector
ui ∈ R
K for each user and a vector vj ∈ R
K for each joke. Then, each rating is modeled as a noisy
version of the appropriate inner product. Specifically,
ri,j ∼ N (u
T
i
vj , σ2
).
Draw a directed graphical model with plate diagrams representing this model assuming ui and vj
are random vectors.
(b) Derive the log-likelihood for this model and the gradients of the log-likelihood with respect to ui
and vj .
(c) Implement the log-likelihood calculation using PyTorch. Compute the gradients using autograd
and confirm that is equal to the manual calculation above. (Hint: Read the documentation for
nn.Embedding to implement u and v.).
(d) Now set K = 2, σ
2 = 1.0 and run stochastic gradient descent (optim.SGD). We have provided
a file utils.py to load the data and split it into training, validation and test sets. Note that
the maximum likelihood estimate of σ
2
is just the mean squared error of your predictions on the
training set. Report your MLE of σ
2
.
(e) Evaluate different choices of K on the provided validation set. Evaluate K = 1, . . . , 10 and produce
a plot that shows the root-mean-squared error on both the training set and the validation set for
each trial and for each K. What seems like a good value for K?
(f) We might imagine that some jokes are just better or worse than others. We might also imagine
that some users tend to have higher or lower means in their ratings. In this case, we can introduce
biases into the model so that rij ≈ u
T
i
vj + ai + bj + g, where ai
, bj and g are user, joke and
global biases, respectively. Change the model to incorporate these biases and fit it again with
K = 2, learning these new biases as well. Write down the likelihood that you are optimizing. One
side-effect is that you should be able to rank the jokes from best to worst. What are the best and
worst jokes and their respective biases? What is the value of the global bias?
(g) Sometimes we have users or jokes that only have a few ratings. We don’t want to overfit with these
and so we might want to put priors on them. What are reasonable priors for the latent features and
the biases? Modify the above directed graphical model that shows all of these variables and their
relationships. Note that you are not required to code this new model up, just discuss resonable
priors and write the graphical model.

Ordinal Regression
Update: If you are running into memory issues with this problem. Please see the note in the
readme.
We now address the problem of predicting joke ratings given the text of the joke. The previous models
assumed that the ratings where continuous real numbers, while they are actually integers from 1 to 5. To
take this into account, we will use an ordinal regression model. Let the rating values be r = 1, . . . , R. In the
ordinal regression model the real line is partitioned into R contiguous intervals with boundaries
b1 < b2 < . . . < bR+1 = +∞, (1)
such that the interval [br, br+1) corresponds to the r-th rating value. We will assume that b1 = −4, b2 = −2,
b3 = 0, b4 = 2 and b5 = 4. Instead of directly modeling the ratings, we will be modeling them in terms of
a hidden variable f. We have that the rating y is observed if f falls in the interval for that rating. The
conditional probability of y given f is then
p(y = r | f) = 
1 if br ≤ f < br+1
0 if otherwise = Θ(f − br) − Θ(f − br+1), (2)
where Θ(x) is the Heaviside step function, that is, Θ(x) = 1 if x > 0 and Θ(x) = 0 otherwise.
Notably there are many possible values that of f that can lead to the same rating. This uncertainty
about the exact value of f can be modeled by adding additive Gaussian noise to a noise free prediction. Let
σ
2 be the variance of this noise. Then p(f | h) = N (f|h, σ2
), where h is a new latent variable that is the
noise free version of f.
Given some features x for a particular joke, we can then combine the previous likelihood with a linear
model to make predictions for the possible rating values for the joke. In particular, we can assume that the
noise-free rating value h is a linear function of x, that is h(x) = wTx, where w is a vector of regression
coefficients. We will assume that the prior for w is p(w) = N (0, I).
Computational Note for this Problem: You will need the following numerical trick, which is implemented as log difference in utils.
If a > b but a − b is close to 0, you can compute log(a − b) instead as:
log(1 − exp(log b − log a)) + log a
Because a is always larger than b we have that exp(log a − log b) is always smaller than 1 and larger than 0.
Therefore, log(1 − exp(b − a)) is always well defined.
8
Problem 3 (Ordinal linear regression 25pts)
1. Draw the directed graphical model for applying this model to one data point.
2. Compute the form of p(y | h) in the ordinal regression model. Explain how this would differ from
a model with no additive noise term.
3. Give the equation for the mean of the predictive distribution in the ordinal regression model. How
would is this term affected by σ
2
(include a diagram).
4. Implement a function to compute the log-posterior distribution of the ordinal regression model
up to a normalization constant. Use autograd to compute the gradients of the previous function
with respect to w and σ
2
. Finds the MAP solution for w and σ
2
in the ordinal regression model
given the available training data using SGD. Report the average RMSE on the provided test set.
We have provided some helper functions in utils.py.
5. Modify the previous model to have a Gaussian likelihood, that is, p(y = r | h) = N (r | h, σ2
).
Report the resulting average test RMSE of the new model. Does performance increase or decrease?
Why?
6. Consider a variant of this model with σ
2
(x) = wσ
>x. How would this model differ? (Optional)
Implement this model.
7. How does the performance of the models analyzed in this problem compare to the performance of
the model from Problem 2? Which model performs best? Why?

 

Reviews

There are no reviews yet.

Be the first to review “HW #3 Modeling Influence in a Network”

Your email address will not be published.