-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmodel.cpp
More file actions
573 lines (494 loc) · 20.5 KB
/
Copy pathmodel.cpp
File metadata and controls
573 lines (494 loc) · 20.5 KB
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
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
#include <vector>
#include <iostream>
#include <chrono>
#include <random>
#include <algorithm>
#include "model.h"
#include "utils.h"
#include "dataset.h"
// Constructor
CollapsedGibbsSocLDA::CollapsedGibbsSocLDA(const TextNetwork& text_network, int n_topic, float alpha_sum_topics, float alpha_sum_vocab, float alpha_sum_edges)
: text_network(text_network), V(text_network.vocab_size), k(n_topic),
src_M(text_network.src_blobs.size()), tgt_M(text_network.tgt_blobs.size()),
src_L(text_network.num_src_subreddits), tgt_L(text_network.num_tgt_subreddits),
alpha_phi(alpha_sum_vocab / text_network.vocab_size), alpha_theta(alpha_sum_topics / n_topic), alpha_psi(alpha_sum_topics / n_topic), alpha_sum_edges(alpha_sum_edges),
lambda_theta(1.0), lambda_psi(1.0) {
// prepare rng
gen = std::mt19937(std::random_device{}());
// Initialize src_N and tgt_N
src_N.resize(src_M);
tgt_N.resize(tgt_M);
for (int i = 0; i < src_M; ++i) {
src_N[i] = text_network.src_blobs[i].size();
}
for (int i = 0; i < tgt_M; ++i) {
tgt_N[i] = text_network.tgt_blobs[i].size();
}
std::cout << "n_topic: " << n_topic << std::endl;
std::cout << "tgt_M: " << tgt_M << std::endl;
std::cout << "src_L: " << src_L << std::endl;
std::cout << "src_M: " << src_M << std::endl;
std::cout << "tgt_L: " << tgt_L << std::endl;
std::cout << "V: " << V << std::endl;
// Initialize count matrices
dc.resize(tgt_M, std::vector<int>(src_L + 1, 0));
ct.resize(src_L + 1, std::vector<int>(k, 0));
rts.resize(tgt_L, std::vector<std::vector<int>>(k, std::vector<int>(2, 0)));
c_t_.resize(src_M, std::vector<int>(k, 0));
wt.resize(V, std::vector<int>(k, 0));
forced_innovation_count.resize(tgt_L, 0);
// Initialize matrix row/column sum counts
c_sum.resize(src_L + 1, 0);
d_cited_sum.resize(tgt_M, 0);
r0_sum.resize(tgt_L, 0);
r1_sum.resize(tgt_L, 0);
t_sum.resize(k, 0);
}
// Gibbs sampling function
void CollapsedGibbsSocLDA::run_gibbs(int n_gibbs, bool verbose) {
// Initialize Gibbs sampler
init_gibbs(n_gibbs);
if (verbose) {
std::cout << "\n========== START SAMPLER ==========" << std::endl;
}
// Set up timer
using std::chrono::high_resolution_clock;
using std::chrono::duration_cast;
using std::chrono::duration;
using std::chrono::milliseconds;
auto t1 = high_resolution_clock::now();
// Run Gibbs sampler
for (int iter = 0; iter < n_gibbs; ++iter) {
// Update source subreddit documents
for (int c_ = 0; c_ < src_M; ++c_) {
for (int n = 0; n < src_N[c_]; ++n) {
update_t_(c_, n, iter);
}
}
// Update target subreddit documents
for (int d = 0; d < tgt_M; ++d) {
for (int n = 0; n < tgt_N[d]; ++n) {
int r = text_network.tgt_subreddits[d];
update_t(d, n, r, iter, iter);
update_cs(d, n, r, iter, iter + 1);
}
}
// Print progress every 200 iterations
if (verbose && (iter + 1) % 200 == 0) {
std::cout << "\n===== ITERATION " << iter << " =====" << std::endl;
auto t2 = high_resolution_clock::now();
duration<double, std::milli> ms_double = t2 - t1;
std::cout << ms_double.count() << "ms\n";
t1 = high_resolution_clock::now();
}
}
}
std::vector<std::vector<std::vector<double>>> CollapsedGibbsSocLDA::recover_gamma(int total_iter, int num_warmup) {
std::vector<std::vector<std::vector<double>>> gamma(
tgt_M, std::vector<std::vector<double>>(src_L, std::vector<double>(total_iter - num_warmup, 0.0)));
std::vector<std::vector<std::vector<double>>> tmp_counts(
tgt_M, std::vector<std::vector<double>>(src_L, std::vector<double>(total_iter - num_warmup, 0.0)));
// Collect counts from samples
for (int d = 0; d < tgt_M; ++d) {
for (int n = 0; n < tgt_N[d]; ++n) {
for (int iter = num_warmup; iter < total_iter; ++iter) {
if (assign_s[d][n][iter] == 0) {
tmp_counts[d][assign_c[d][n][iter]][iter - num_warmup] += 1.0;
}
}
}
}
// Compute gamma
for (int d = 0; d < tgt_M; ++d) {
int num_edges = text_network.edges[d].size();
for (size_t i = 0; i < num_edges; ++i) {
int edge = text_network.edges[d][i];
double sum_val = 0.0;
for (int iter = num_warmup; iter < total_iter; ++iter) {
double numerator = tmp_counts[d][edge][iter - num_warmup] + (alpha_sum_edges/num_edges);
/*double denominator = 0.0;
for (int j = 0; j < src_L; ++j) {
denominator += tmp_counts[d][j][iter - num_warmup];
}
denominator += num_edges * alpha_gamma;*/
gamma[d][edge][iter-num_warmup] = numerator;
/// denominator;
}
}
}
return gamma;
}
std::vector<std::vector<std::vector<double>>> CollapsedGibbsSocLDA::recover_psi(int total_iter, int num_warmup) {
std::vector<std::vector<std::vector<double>>> psi(
tgt_L, std::vector<std::vector<double>>(k, std::vector<double>(total_iter - num_warmup, 0.0)));
std::vector<std::vector<std::vector<double>>> tmp_counts(
tgt_L, std::vector<std::vector<double>>(k, std::vector<double>(total_iter - num_warmup, 0.0)));
// Collect counts from samples
for (int d = 0; d < tgt_M; ++d) {
int r = text_network.tgt_subreddits[d];
for (int n = 0; n < tgt_N[d]; ++n) {
for (int iter = num_warmup; iter < total_iter; ++iter) {
if (assign_s[d][n][iter] == 1) {
tmp_counts[r][assign_t[d][n][iter]][iter - num_warmup] += 1.0;
}
}
}
}
// Compute psi
for (int d = 0; d < tgt_M; ++d) {
int r = text_network.tgt_subreddits[d];
for (int topic = 0; topic < k; ++topic) {
double sum_val = 0.0;
for (int iter = num_warmup; iter < total_iter; ++iter) {
double numerator = tmp_counts[r][topic][iter - num_warmup] + alpha_psi;
/*double denominator = 0.0;
for (int j = 0; j < k; ++j) {
denominator += tmp_counts[d][j][iter - num_warmup];
}
denominator += k * alpha_psi;*/
psi[r][topic][iter - num_warmup]= numerator;
// / denominator;
}
}
}
return psi;
}
std::vector<std::vector<std::vector<double>>> CollapsedGibbsSocLDA::recover_phi(int total_iter, int num_warmup) {
std::vector<std::vector<std::vector<double>>> phi(
k, std::vector<std::vector<double>>(V, std::vector<double>(total_iter - num_warmup, 0.0)));
std::vector<std::vector<std::vector<double>>> tmp_counts(
k, std::vector<std::vector<double>>(V, std::vector<double>(total_iter - num_warmup, 0.0)));
// Collect counts from target network
for (int d = 0; d < tgt_M; ++d) {
for (int n = 0; n < tgt_N[d]; ++n) {
for (int iter = num_warmup; iter < total_iter; ++iter) {
int cur_topic = assign_t[d][n][iter];
int cur_word = text_network.tgt_blobs[d][n];
tmp_counts[cur_topic][cur_word][iter - num_warmup] += 1.0;
}
}
}
// Collect counts from source network
for (int d = 0; d < src_M; ++d) {
for (int n = 0; n < src_N[d]; ++n) {
for (int iter = num_warmup; iter < total_iter; ++iter) {
int cur_topic = assign_t_[d][n][iter];
int cur_word = text_network.src_blobs[d][n];
tmp_counts[cur_topic][cur_word][iter - num_warmup] += 1.0;
}
}
}
// Compute phi
for (int t = 0; t < k; ++t) {
for (int w = 0; w < V; ++w) {
double sum_val = 0.0;
for (int iter = num_warmup; iter < total_iter; ++iter) {
double numerator = tmp_counts[t][w][iter - num_warmup] + alpha_phi;
/*double denominator = 0.0;
for (int j = 0; j < V; ++j) {
denominator += tmp_counts[t][j][iter - num_warmup];
}
denominator += V * alpha_phi;*/
phi[t][w][iter-num_warmup] = numerator;
// / denominator;
}
}
}
return phi;
}
std::vector<std::vector<std::vector<double>>> CollapsedGibbsSocLDA::recover_theta(int total_iter, int num_warmup) {
std::vector<std::vector<std::vector<double>>> theta(
src_M, std::vector<std::vector<double>>(k, std::vector<double>(total_iter - num_warmup, 0.0)));
std::vector<std::vector<std::vector<double>>> tmp_counts(
src_M, std::vector<std::vector<double>>(k, std::vector<double>(total_iter - num_warmup, 0.0)));
// Collect counts from source network
for (int d = 0; d < src_M; ++d) {
for (int n = 0; n < src_N[d]; ++n) {
for (int iter = num_warmup; iter < total_iter; ++iter) {
int cur_topic = assign_t_[d][n][iter];
tmp_counts[d][cur_topic][iter - num_warmup] += 1.0;
}
}
}
// Collect counts from target network, considering connections
for (int d = 0; d < tgt_M; ++d) {
for (int n = 0; n < tgt_N[d]; ++n) {
for (int iter = num_warmup; iter < total_iter; ++iter) {
int cur_topic = assign_t[d][n][iter];
int cur_c = assign_c[d][n][iter];
if (cur_c != src_L) { // Ensure valid source index
tmp_counts[cur_c][cur_topic][iter - num_warmup] += 1.0;
}
}
}
}
// Compute theta
for (int d = 0; d < src_M; ++d) {
for (int t = 0; t < k; ++t) {
double sum_val = 0.0;
for (int iter = num_warmup; iter < total_iter; ++iter) {
double numerator = tmp_counts[d][t][iter - num_warmup] + alpha_theta;
/*double denominator = 0.0;
for (int j = 0; j < k; ++j) {
denominator += tmp_counts[d][j][iter - num_warmup];
}
denominator += alpha_theta * k;*/
theta[d][t][iter-num_warmup] = numerator;
// / denominator;
}
}
}
return theta;
}
std::vector<std::vector<std::vector<double>>> CollapsedGibbsSocLDA::recover_lambda(int total_iter, int num_warmup) {
std::vector<std::vector<std::vector<double>>> lambdas(
tgt_L, std::vector<std::vector<double>>(2, std::vector<double>(total_iter - num_warmup, 0.0)));
std::vector<std::vector<std::vector<double>>> tmp_counts(
tgt_L, std::vector<std::vector<double>>(2, std::vector<double>(total_iter - num_warmup, 0.0)));
// Collect counts from target network
for (int d = 0; d < tgt_M; ++d) {
int subreddit = text_network.tgt_subreddits[d]; // Get subreddit index
for (int n = 0; n < tgt_N[d]; ++n) {
for (int iter = num_warmup; iter < total_iter; ++iter) {
int cur_s = assign_s[d][n][iter];
tmp_counts[subreddit][cur_s][iter - num_warmup] += 1.0;
}
}
}
// Compute lambda values
for (int r = 0; r < tgt_L; ++r) {
double sum_cite = 0;
double sum_inno = 0;
for (int iter = num_warmup; iter < total_iter; ++iter) {
/*double denom = 0.0;
for (int j = 0; j < 2; ++j) {
denom += tmp_counts[r][j][iter - num_warmup];
}
denom -= forced_innovation_count[r];
denom += lambda_theta + lambda_psi;*/
lambdas[r][0][iter - num_warmup] += (tmp_counts[r][0][iter - num_warmup] + lambda_theta);
// / denom;
lambdas[r][1][iter - num_warmup] += (tmp_counts[r][1][iter - num_warmup] - forced_innovation_count[r] + lambda_psi);
// / denom;
}
}
return lambdas;
}
// Initialize the Gibbs sampler
void CollapsedGibbsSocLDA::init_gibbs(int n_gibbs) {
// Max lengths
int src_N_max = *max_element(src_N.begin(), src_N.end());
int tgt_N_max = *max_element(tgt_N.begin(), tgt_N.end());
// Resize assignment matrices
assign_c.resize(tgt_M, std::vector<std::vector<int>>(tgt_N_max, std::vector<int>(n_gibbs + 1, 0)));
assign_s.resize(tgt_M, std::vector<std::vector<int>>(tgt_N_max, std::vector<int>(n_gibbs + 1, 0)));
assign_t.resize(tgt_M, std::vector<std::vector<int>>(tgt_N_max, std::vector<int>(n_gibbs + 1, 0)));
assign_t_.resize(src_M, std::vector<std::vector<int>>(src_N_max, std::vector<int>(n_gibbs + 1, 0)));
// Reset count matrices
for (auto& row : c_t_) fill(row.begin(), row.end(), 0);
for (auto& row : dc) fill(row.begin(), row.end(), 0);
for (auto& row : ct) fill(row.begin(), row.end(), 0);
for (auto& row : wt) fill(row.begin(), row.end(), 0);
for (auto& matrix : rts)
for (auto& row : matrix)
fill(row.begin(), row.end(), 0);
fill(forced_innovation_count.begin(), forced_innovation_count.end(), 0);
fill(c_sum.begin(), c_sum.end(), 0);
fill(d_cited_sum.begin(), d_cited_sum.end(), 0);
fill(r0_sum.begin(), r0_sum.end(), 0);
fill(r1_sum.begin(), r1_sum.end(), 0);
fill(t_sum.begin(), t_sum.end(), 0);
// Random number generator
std::uniform_int_distribution<int> topic_dist(0, k - 1);
std::uniform_int_distribution<int> binary_dist(0, 1);
// Initialize values for each src comment
std::cout << "Init'ing src vals" << std::endl;
for (int d = 0; d < src_M; ++d) {
for (int n = 0; n < src_N[d]; ++n) {
int w_dn = text_network.src_blobs[d][n];
int cur_topic = topic_dist(gen);
assign_t_[d][n][0] = cur_topic;
// Increment counters
wt[w_dn][cur_topic]++;
c_t_[d][cur_topic]++;
t_sum[cur_topic]++;
}
}
std::cout << "Init'ing tgt vals" << std::endl;
// Initialize values for each tgt comment
for (int d = 0; d < tgt_M; ++d) {
int r = text_network.tgt_subreddits[d];
for (int n = 0; n < tgt_N[d]; ++n) {
int w_dn = text_network.tgt_blobs[d][n];
// Assign innovation flag (s)
if (text_network.edges[d].empty()) {
assign_s[d][n][0] = 1;
forced_innovation_count[r]++;
} else {
assign_s[d][n][0] = binary_dist(gen);
}
// Assign source subreddit (c)
if (assign_s[d][n][0] == 0) {
std::uniform_int_distribution<int> edge_dist(0, text_network.edges[d].size() - 1);
assign_c[d][n][0] = text_network.edges[d][edge_dist(gen)];
} else {
assign_c[d][n][0] = src_L;
}
// Assign topic (t)
assign_t[d][n][0] = topic_dist(gen);
// Increment counters
int cur_t = assign_t[d][n][0];
int cur_s = assign_s[d][n][0];
int cur_c = assign_c[d][n][0];
dc[d][cur_c]++;
ct[cur_c][cur_t]++;
rts[r][cur_t][cur_s]++;
wt[w_dn][cur_t]++;
c_sum[cur_c]++;
t_sum[cur_t]++;
if (cur_s == 0) {
d_cited_sum[d]++;
r0_sum[r]++;
} else {
r1_sum[r]++;
}
}
}
for (int r = 0; r < tgt_L; r++) {
std::cout << forced_innovation_count[r] << std::endl;
}
}
std::vector<double> CollapsedGibbsSocLDA::conditional_prob_cs(int w_dn, int d, int r, int t, bool print) {
size_t edge_count = text_network.edges[d].size();
std::vector<double> prob(edge_count + 1, 0.0);
for (size_t ind = 0; ind < edge_count; ind++) {
int i = text_network.edges[d][ind];
double _1 = (c_t_[i][t] + ct[i][t] + alpha_theta) / (src_N[i] + c_sum[i] + k * alpha_theta);
double _2 = (dc[d][i] + (alpha_sum_edges/edge_count)) / (d_cited_sum[d] + edge_count * (alpha_sum_edges/edge_count));
double _3 = (r0_sum[r] + lambda_theta)
/ (r0_sum[r] + r1_sum[r] - forced_innovation_count[r] + lambda_theta + lambda_psi);
prob[ind] = _1 * _2 * _3;
}
double _1 = (rts[r][t][1] + alpha_psi) / (r1_sum[r] + k * alpha_psi);
double _2 = (r1_sum[r] - forced_innovation_count[r] + lambda_psi)
/ (r0_sum[r] + r1_sum[r] - forced_innovation_count[r] + lambda_theta + lambda_psi);
prob[edge_count] = _1 * _2;
double prob_sum = std::accumulate(prob.begin(), prob.end(), 0.0);
for (double& p : prob) p /= prob_sum;
return prob;
}
std::vector<double> CollapsedGibbsSocLDA::conditional_prob_t(int w_dn, int d, int r, int c, int s) {
std::vector<double> prob(k, 0.0);
for (int i = 0; i < k; i++) {
double _1 = (wt[w_dn][i] + alpha_phi) / (t_sum[i] + V * alpha_phi);
double _2;
if (s == 0) {
_2 = (c_t_[c][i] + ct[c][i] + alpha_theta) / (src_N[c] + c_sum[c] + k * alpha_theta);
} else {
_2 = (rts[r][i][1] + alpha_psi) / (r1_sum[r] + k * alpha_psi);
}
prob[i] = _1 * _2;
}
double prob_sum = std::accumulate(prob.begin(), prob.end(), 0.0);
for (double& p : prob) p /= prob_sum;
return prob;
}
std::vector<double> CollapsedGibbsSocLDA::conditional_prob_t_(int w_c_n, int c_) {
std::vector<double> prob(k, 0.0);
for (int i = 0; i < k; i++) {
double _1 = (wt[w_c_n][i] + alpha_phi) /
(t_sum[i] + V * alpha_phi);
double _2 = (c_t_[c_][i] + ct[c_][i] + alpha_theta) /
(src_N[c_] + c_sum[c_] + k * alpha_theta);
prob[i] = _1 * _2;
}
double prob_sum = std::accumulate(prob.begin(), prob.end(), 0.0);
for (double& p : prob) p /= prob_sum;
return prob;
}
void CollapsedGibbsSocLDA::update_cs(int d, int n, int r, int cs_iter, int t_iter) {
if (text_network.edges[d].empty()) {
assign_c[d][n][cs_iter + 1] = assign_c[d][n][cs_iter];
assign_s[d][n][cs_iter + 1] = assign_s[d][n][cs_iter];
return;
}
int w_dn = text_network.tgt_blobs[d][n];
const std::vector<int>& edges = text_network.edges[d];
int i_t = assign_t[d][n][t_iter];
int i_c = assign_c[d][n][cs_iter];
int i_s = assign_s[d][n][cs_iter];
/*if (d == 0 && n == 0) {
std::cout << "Current c: " << i_c << " Current s: " << i_s << std::endl;
}*/
// Decrement counters
dc[d][i_c]--;
rts[r][i_t][i_s]--;
ct[i_c][i_t]--;
c_sum[i_c]--;
if (i_s == 0) {
d_cited_sum[d]--;
r0_sum[r]--;
} else {
r1_sum[r]--;
}
// Compute new assignment probabilities
std::vector<double> prob = conditional_prob_cs(w_dn, d, r, i_t, d==0 && n==0);
/*if (d == 0 && n == 0) {
for (int counter = 0; counter < edges.size()+1; counter++ ) {
std::cout << prob[counter] << " ";
}
std::cout << std::endl;
}*/
int result = weighted_sample(prob, gen);
int new_s = (result == edges.size()) ? 1 : 0;
int new_c = (new_s == 1) ? src_L : edges[result];
// Increment counters
dc[d][new_c]++;
rts[r][i_t][new_s]++;
ct[new_c][i_t]++;
c_sum[new_c]++;
if (new_s == 0) {
d_cited_sum[d]++;
r0_sum[r]++;
} else {
r1_sum[r]++;
}
assign_c[d][n][cs_iter + 1] = new_c;
assign_s[d][n][cs_iter + 1] = new_s;
}
void CollapsedGibbsSocLDA::update_t(int d, int n, int r, int cs_iter, int t_iter) {
int w_dn = text_network.tgt_blobs[d][n];
int i_t = assign_t[d][n][t_iter];
int i_c = assign_c[d][n][cs_iter];
int i_s = assign_s[d][n][cs_iter];
// Decrement counters
rts[r][i_t][i_s]--;
ct[i_c][i_t]--;
wt[w_dn][i_t]--;
t_sum[i_t]--;
// Compute new assignment probabilities
std::vector<double> prob = conditional_prob_t(w_dn, d, r, i_c, i_s);
int i_tp1 = weighted_sample(prob, gen);
// Increment counters
rts[r][i_tp1][i_s]++;
ct[i_c][i_tp1]++;
wt[w_dn][i_tp1]++;
t_sum[i_tp1]++;
assign_t[d][n][t_iter + 1] = i_tp1;
}
void CollapsedGibbsSocLDA::update_t_(int c_, int n, int t_iter) {
int w_dn = text_network.src_blobs[c_][n];
int i_t_ = assign_t_[c_][n][t_iter];
// Decrement counters
c_t_[c_][i_t_]--;
wt[w_dn][i_t_]--;
t_sum[i_t_]--;
// Compute new assignment probabilities
std::vector<double> prob = conditional_prob_t_(w_dn, c_);
int i_tp1 = weighted_sample(prob, gen);
// Increment counters
c_t_[c_][i_tp1]++;
wt[w_dn][i_tp1]++;
t_sum[i_tp1]++;
assign_t_[c_][n][t_iter + 1] = i_tp1;
}