-
Notifications
You must be signed in to change notification settings - Fork 87
/
bpr.py
257 lines (207 loc) · 9.29 KB
/
bpr.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
"""
Bayesian Personalized Ranking
Matrix Factorization model and a variety of classes
implementing different sampling strategies.
"""
import numpy as np
from math import exp
import random
class BPRArgs(object):
def __init__(self,learning_rate=0.05,
bias_regularization=1.0,
user_regularization=0.0025,
positive_item_regularization=0.0025,
negative_item_regularization=0.00025,
update_negative_item_factors=True):
self.learning_rate = learning_rate
self.bias_regularization = bias_regularization
self.user_regularization = user_regularization
self.positive_item_regularization = positive_item_regularization
self.negative_item_regularization = negative_item_regularization
self.update_negative_item_factors = update_negative_item_factors
class BPR(object):
def __init__(self,D,args):
"""initialise BPR matrix factorization model
D: number of factors
"""
self.D = D
self.learning_rate = args.learning_rate
self.bias_regularization = args.bias_regularization
self.user_regularization = args.user_regularization
self.positive_item_regularization = args.positive_item_regularization
self.negative_item_regularization = args.negative_item_regularization
self.update_negative_item_factors = args.update_negative_item_factors
def train(self,data,sampler,num_iters):
"""train model
data: user-item matrix as a scipy sparse matrix
users and items are zero-indexed
"""
self.init(data)
print 'initial loss = {0}'.format(self.loss())
for it in xrange(num_iters):
print 'starting iteration {0}'.format(it)
for u,i,j in sampler.generate_samples(self.data):
self.update_factors(u,i,j)
print 'iteration {0}: loss = {1}'.format(it,self.loss())
def init(self,data):
self.data = data
self.num_users,self.num_items = self.data.shape
self.item_bias = np.zeros(self.num_items)
self.user_factors = np.random.random_sample((self.num_users,self.D))
self.item_factors = np.random.random_sample((self.num_items,self.D))
self.create_loss_samples()
def create_loss_samples(self):
# apply rule of thumb to decide num samples over which to compute loss
num_loss_samples = int(100*self.num_users**0.5)
print 'sampling {0} <user,item i,item j> triples...'.format(num_loss_samples)
sampler = UniformUserUniformItem(True)
self.loss_samples = [t for t in sampler.generate_samples(data,num_loss_samples)]
def update_factors(self,u,i,j,update_u=True,update_i=True):
"""apply SGD update"""
update_j = self.update_negative_item_factors
x = self.item_bias[i] - self.item_bias[j] \
+ np.dot(self.user_factors[u,:],self.item_factors[i,:]-self.item_factors[j,:])
z = 1.0/(1.0+exp(x))
# update bias terms
if update_i:
d = z - self.bias_regularization * self.item_bias[i]
self.item_bias[i] += self.learning_rate * d
if update_j:
d = -z - self.bias_regularization * self.item_bias[j]
self.item_bias[j] += self.learning_rate * d
if update_u:
d = (self.item_factors[i,:]-self.item_factors[j,:])*z - self.user_regularization*self.user_factors[u,:]
self.user_factors[u,:] += self.learning_rate*d
if update_i:
d = self.user_factors[u,:]*z - self.positive_item_regularization*self.item_factors[i,:]
self.item_factors[i,:] += self.learning_rate*d
if update_j:
d = -self.user_factors[u,:]*z - self.negative_item_regularization*self.item_factors[j,:]
self.item_factors[j,:] += self.learning_rate*d
def loss(self):
ranking_loss = 0;
for u,i,j in self.loss_samples:
x = self.predict(u,i) - self.predict(u,j)
ranking_loss += 1.0/(1.0+exp(x))
complexity = 0;
for u,i,j in self.loss_samples:
complexity += self.user_regularization * np.dot(self.user_factors[u],self.user_factors[u])
complexity += self.positive_item_regularization * np.dot(self.item_factors[i],self.item_factors[i])
complexity += self.negative_item_regularization * np.dot(self.item_factors[j],self.item_factors[j])
complexity += self.bias_regularization * self.item_bias[i]**2
complexity += self.bias_regularization * self.item_bias[j]**2
return ranking_loss + 0.5*complexity
def predict(self,u,i):
return self.item_bias[i] + np.dot(self.user_factors[u],self.item_factors[i])
# sampling strategies
class Sampler(object):
def __init__(self,sample_negative_items_empirically):
self.sample_negative_items_empirically = sample_negative_items_empirically
def init(self,data,max_samples=None):
self.data = data
self.num_users,self.num_items = data.shape
self.max_samples = max_samples
def sample_user(self):
u = self.uniform_user()
num_items = self.data[u].getnnz()
assert(num_items > 0 and num_items != self.num_items)
return u
def sample_negative_item(self,user_items):
j = self.random_item()
while j in user_items:
j = self.random_item()
return j
def uniform_user(self):
return random.randint(0,self.num_users-1)
def random_item(self):
"""sample an item uniformly or from the empirical distribution
observed in the training data
"""
if self.sample_negative_items_empirically:
# just pick something someone rated!
u = self.uniform_user()
i = random.choice(self.data[u].indices)
else:
i = random.randint(0,self.num_items-1)
return i
def num_samples(self,n):
if self.max_samples is None:
return n
return min(n,self.max_samples)
class UniformUserUniformItem(Sampler):
def generate_samples(self,data,max_samples=None):
self.init(data,max_samples)
for _ in xrange(self.num_samples(self.data.nnz)):
u = self.uniform_user()
# sample positive item
i = random.choice(self.data[u].indices)
j = self.sample_negative_item(self.data[u].indices)
yield u,i,j
class UniformUserUniformItemWithoutReplacement(Sampler):
def generate_samples(self,data,max_samples=None):
self.init(self,data,max_samples)
# make a local copy of data as we're going to "forget" some entries
self.local_data = self.data.copy()
for _ in xrange(self.num_samples(self.data.nnz)):
u = self.uniform_user()
# sample positive item without replacement if we can
user_items = self.local_data[u].nonzero()[1]
if len(user_items) == 0:
# reset user data if it's all been sampled
for ix in self.local_data[u].indices:
self.local_data[u,ix] = self.data[u,ix]
user_items = self.local_data[u].nonzero()[1]
i = random.choice(user_items)
# forget this item so we don't sample it again for the same user
self.local_data[u,i] = 0
j = self.sample_negative_item(user_items)
yield u,i,j
class UniformPair(Sampler):
def generate_samples(self,data,max_samples=None):
self.init(data,max_samples)
for _ in xrange(self.num_samples(self.data.nnz)):
idx = random.randint(0,self.data.nnz-1)
u = self.users[self.idx]
i = self.items[self.idx]
j = self.sample_negative_item(self.data[u])
yield u,i,j
class UniformPairWithoutReplacement(Sampler):
def generate_samples(self,data,max_samples=None):
self.init(data,max_samples)
idxs = range(self.data.nnz)
random.shuffle(idxs)
self.users,self.items = self.data.nonzero()
self.users = self.users[idxs]
self.items = self.items[idxs]
self.idx = 0
for _ in xrange(self.num_samples(self.data.nnz)):
u = self.users[self.idx]
i = self.items[self.idx]
j = self.sample_negative_item(self.data[u])
self.idx += 1
yield u,i,j
class ExternalSchedule(Sampler):
def __init__(self,filepath,index_offset=0):
self.filepath = filepath
self.index_offset = index_offset
def generate_samples(self,data,max_samples=None):
self.init(data,max_samples)
f = open(self.filepath)
samples = [map(int,line.strip().split()) for line in f]
random.shuffle(samples) # important!
num_samples = self.num_samples(len(samples))
for u,i,j in samples[:num_samples]:
yield u-self.index_offset,i-self.index_offset,j-self.index_offset
if __name__ == '__main__':
# learn a matrix factorization with BPR like this:
import sys
from scipy.io import mmread
data = mmread(sys.argv[1]).tocsr()
args = BPRArgs()
args.learning_rate = 0.3
num_factors = 10
model = BPR(num_factors,args)
sample_negative_items_empirically = True
sampler = UniformPairWithoutReplacement(sample_negative_items_empirically)
num_iters = 10
model.train(data,sampler,num_iters)