File size: 26,038 Bytes
33b6b4f
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
d3b75d1
 
 
 
 
33b6b4f
 
 
 
 
d3b75d1
 
 
 
 
33b6b4f
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
"""
MARS v3: Complete rebuild for beating SASRec.

Key fixes from research:
1. Full softmax cross-entropy loss (not BCE with few negatives)
2. DuoRec-style dropout contrastive learning
3. FMLP-inspired frequency-domain filtering in long-term branch
4. Proper max_seq_len=200 for ML-1M (avg 165 interactions)
5. Proper leave-one-out evaluation protocol with full ranking

Architecture: MARS v3 = FMLP filter (long-term, O(n log n)) 
           + Causal Attention (short-term) 
           + Compressive Memory + Adaptive Fusion
           + DuoRec contrastive regularization
"""

import math, os, random, time, json
import numpy as np
import torch
import torch.nn as nn
import torch.nn.functional as F
from torch.utils.data import Dataset, DataLoader
from torch.optim import AdamW
from collections import defaultdict
from typing import Dict, List, Tuple, Optional


# ============================================================
# DATA PIPELINE (fixed: proper leave-one-out, right-padding)
# ============================================================

def download_movielens_1m(data_dir='./data/ml-1m'):
    import urllib.request, zipfile
    os.makedirs(data_dir, exist_ok=True)
    ratings_path = os.path.join(data_dir, 'ratings.dat')
    if not os.path.exists(ratings_path):
        url = 'https://files.grouplens.org/datasets/movielens/ml-1m.zip'
        zip_path = os.path.join(data_dir, 'ml-1m.zip')
        print(f"Downloading ML-1M...")
        urllib.request.urlretrieve(url, zip_path)
        with zipfile.ZipFile(zip_path, 'r') as z:
            z.extractall(data_dir)
        inner = os.path.join(data_dir, 'ml-1m')
        if os.path.exists(inner):
            for f in os.listdir(inner):
                os.rename(os.path.join(inner, f), os.path.join(data_dir, f))
            os.rmdir(inner)
        os.remove(zip_path)
    return ratings_path


def load_and_process_ml1m(max_seq_len=200, min_interactions=5):
    """Load ML-1M with proper preprocessing: all ratings as implicit, 5-core filter."""
    ratings_path = download_movielens_1m()
    
    user_items = defaultdict(list)
    with open(ratings_path, 'r') as f:
        for line in f:
            parts = line.strip().split('::')
            uid, iid, rating, ts = int(parts[0]), int(parts[1]), float(parts[2]), int(parts[3])
            user_items[uid].append((iid, ts))
    
    # Sort by timestamp
    for uid in user_items:
        user_items[uid].sort(key=lambda x: x[1])
    
    # 5-core iterative filtering
    for _ in range(3):
        item_counts = defaultdict(int)
        for uid, items in user_items.items():
            for iid, _ in items:
                item_counts[iid] += 1
        valid_items = {iid for iid, c in item_counts.items() if c >= min_interactions}
        
        new_user_items = {}
        for uid, items in user_items.items():
            filtered = [(iid, ts) for iid, ts in items if iid in valid_items]
            if len(filtered) >= min_interactions:
                new_user_items[uid] = filtered
        user_items = new_user_items
    
    # Re-index items to 1..N (0=padding)
    all_items = set()
    for items in user_items.values():
        all_items.update(iid for iid, _ in items)
    item2idx = {iid: idx+1 for idx, iid in enumerate(sorted(all_items))}
    num_items = len(item2idx)
    
    # Leave-one-out split
    train_seqs, val_seqs, test_seqs = [], [], []
    for uid, items in user_items.items():
        seq = [item2idx[iid] for iid, _ in items]
        if len(seq) < 3:
            continue
        # Truncate to max_seq_len + 2 (need 2 for val/test targets)
        seq = seq[-(max_seq_len + 2):]
        
        train_seqs.append({'items': seq[:-2], 'target': seq[-2]})
        val_seqs.append({'items': seq[:-1], 'target': seq[-1]})
        test_seqs.append({'items': seq[:-1], 'target': seq[-1]})
    
    print(f"ML-1M: {len(user_items)} users, {num_items} items")
    print(f"Train: {len(train_seqs)}, Val: {len(val_seqs)}, Test: {len(test_seqs)}")
    seq_lens = [len(d['items']) for d in train_seqs]
    print(f"Seq len: mean={np.mean(seq_lens):.0f}, p50={np.median(seq_lens):.0f}, "
          f"p90={np.percentile(seq_lens, 90):.0f}, max={max(seq_lens)}")
    
    return train_seqs, val_seqs, test_seqs, num_items


class SeqRecDataset(Dataset):
    """Minimal dataset: just pads sequences, no negative sampling (CE loss handles it)."""
    def __init__(self, data, max_seq_len):
        self.data = data
        self.max_seq_len = max_seq_len
    
    def __len__(self):
        return len(self.data)
    
    def __getitem__(self, idx):
        d = self.data[idx]
        items = d['items'][-self.max_seq_len:]
        target = d['target']
        L = len(items)
        pad = self.max_seq_len - L
        return {
            'input_ids': torch.tensor(items + [0]*pad, dtype=torch.long),
            'lengths': torch.tensor(L, dtype=torch.long),
            'target': torch.tensor(target, dtype=torch.long),
        }


# ============================================================
# MODEL: MARS v3
# ============================================================

class FilterLayer(nn.Module):
    """FMLP-Rec FFT filter: learnable frequency-domain filtering, O(n log n).
    Replaces attention for long-term modeling. Denoises by filtering 
    high-frequency noise in the interaction sequence."""
    
    def __init__(self, max_seq_len, hidden_size, dropout=0.1):
        super().__init__()
        self.complex_weight = nn.Parameter(
            torch.randn(1, max_seq_len // 2 + 1, hidden_size, 2) * 0.02
        )
        self.dropout = nn.Dropout(dropout)
        self.norm = nn.LayerNorm(hidden_size)
    
    def forward(self, x):
        # x: (B, T, D)
        freq = torch.fft.rfft(x, dim=1, norm='ortho')
        weight = torch.view_as_complex(self.complex_weight)
        # Adapt to actual seq length
        freq = freq * weight[:, :freq.shape[1], :]
        out = torch.fft.irfft(freq, n=x.shape[1], dim=1, norm='ortho')
        return self.norm(self.dropout(out) + x)


class FMLPBlock(nn.Module):
    """Filter + FFN block."""
    def __init__(self, max_seq_len, hidden_size, inner_size, dropout=0.1):
        super().__init__()
        self.filter = FilterLayer(max_seq_len, hidden_size, dropout)
        self.ffn = nn.Sequential(
            nn.LayerNorm(hidden_size),
            nn.Linear(hidden_size, inner_size),
            nn.GELU(),
            nn.Dropout(dropout),
            nn.Linear(inner_size, hidden_size),
            nn.Dropout(dropout),
        )
        self.norm = nn.LayerNorm(hidden_size)
    
    def forward(self, x):
        x = self.filter(x)
        return self.norm(x + self.ffn(x))


class CompressiveMemory(nn.Module):
    """Cross-attention memory compression (from MARS v1/v2)."""
    def __init__(self, hidden_size, num_tokens=8, num_heads=2, dropout=0.1):
        super().__init__()
        self.queries = nn.Parameter(torch.randn(num_tokens, hidden_size) * 0.02)
        self.attn = nn.MultiheadAttention(hidden_size, num_heads, dropout=dropout, batch_first=True)
        self.norm = nn.LayerNorm(hidden_size)
    
    def forward(self, seq, mask=None):
        B = seq.shape[0]
        q = self.queries.unsqueeze(0).expand(B, -1, -1)
        kpm = ~mask if mask is not None else None
        out, _ = self.attn(q, seq, seq, key_padding_mask=kpm)
        return self.norm(q + out).mean(dim=1)  # (B, D)


class MARSv3(nn.Module):
    """
    MARS v3: FMLP filter (long-term) + Causal Attention (short-term) 
           + Memory compression + Adaptive fusion + CE loss + CL loss
    """
    def __init__(self, num_items, hidden_size=64, max_seq_len=200,
                 n_filter_layers=2, n_attn_layers=1, n_heads=2,
                 inner_size=256, short_len=50, n_memory=8, dropout=0.2):
        super().__init__()
        self.num_items = num_items
        self.hidden_size = hidden_size
        self.max_seq_len = max_seq_len
        self.short_len = short_len
        
        self.item_emb = nn.Embedding(num_items + 1, hidden_size, padding_idx=0)
        self.pos_emb = nn.Embedding(max_seq_len, hidden_size)
        self.emb_dropout = nn.Dropout(dropout)
        self.emb_norm = nn.LayerNorm(hidden_size)
        
        # Long-term: FMLP filter layers (O(n log n))
        self.filter_blocks = nn.ModuleList([
            FMLPBlock(max_seq_len, hidden_size, inner_size, dropout)
            for _ in range(n_filter_layers)
        ])
        
        # Memory compression
        self.memory = CompressiveMemory(hidden_size, n_memory, n_heads, dropout)
        
        # Short-term: causal self-attention
        enc_layer = nn.TransformerEncoderLayer(
            d_model=hidden_size, nhead=n_heads, dim_feedforward=inner_size,
            dropout=dropout, activation='gelu', batch_first=True, norm_first=True)
        self.short_encoder = nn.TransformerEncoder(enc_layer, num_layers=n_attn_layers)
        
        # Fusion gate
        self.gate = nn.Sequential(
            nn.Linear(hidden_size * 3, hidden_size), nn.GELU(),
            nn.Linear(hidden_size, hidden_size), nn.Sigmoid())
        
        self.output_norm = nn.LayerNorm(hidden_size)
        self._init_weights()
    
    def _init_weights(self):
        for p in self.parameters():
            if p.dim() > 1:
                nn.init.trunc_normal_(p, std=0.02)
        nn.init.zeros_(self.item_emb.weight[0])
    
    def _embed(self, input_ids, lengths):
        B, T = input_ids.shape
        x = self.item_emb(input_ids)
        pos = torch.arange(T, device=input_ids.device).unsqueeze(0).clamp(max=self.max_seq_len-1)
        x = self.emb_norm(self.emb_dropout(x + self.pos_emb(pos)))
        mask = torch.arange(T, device=input_ids.device).unsqueeze(0) < lengths.unsqueeze(1)
        return x, mask
    
    def encode(self, input_ids, lengths):
        """Encode sequence β†’ user representation (B, D)."""
        B, T = input_ids.shape
        x, mask = self._embed(input_ids, lengths)
        
        # Long-term: FMLP filtering over full sequence
        long_x = x
        for block in self.filter_blocks:
            long_x = long_x * mask.unsqueeze(-1).float()  # Zero out padding
            long_x = block(long_x)
        
        # Memory summary
        mem = self.memory(long_x, mask)  # (B, D)
        
        # Last valid position from long-term
        long_last = long_x[torch.arange(B, device=x.device), (lengths - 1).clamp(min=0)]
        
        # Short-term: last K items with causal attention
        K = min(self.short_len, T)
        short_ids = []
        short_masks = []
        for b in range(B):
            sl = lengths[b].item()
            k = min(K, sl)
            start = max(0, sl - K)
            ids = input_ids[b, start:sl]
            pad = K - k
            if pad > 0:
                ids = torch.cat([ids, torch.zeros(pad, dtype=ids.dtype, device=ids.device)])
            short_ids.append(ids)
            m = torch.zeros(K, dtype=torch.bool, device=x.device)
            m[:k] = True
            short_masks.append(m)
        
        short_ids = torch.stack(short_ids)
        short_masks = torch.stack(short_masks)
        short_x = self.item_emb(short_ids) + self.pos_emb(
            torch.arange(K, device=x.device).unsqueeze(0).clamp(max=self.max_seq_len-1))
        short_x = self.emb_norm(self.emb_dropout(short_x))
        
        causal = torch.triu(torch.ones(K, K, device=x.device, dtype=torch.bool), diagonal=1)
        short_out = self.short_encoder(short_x, mask=causal, src_key_padding_mask=~short_masks)
        short_lens = short_masks.sum(1).long()
        short_last = short_out[torch.arange(B, device=x.device), (short_lens - 1).clamp(min=0)]
        
        # Adaptive fusion
        g = self.gate(torch.cat([long_last, short_last, mem], dim=-1))
        user = g * long_last + (1 - g) * short_last
        return self.output_norm(user)
    
    def forward(self, input_ids, lengths, targets=None, cl_lambda=0.1):
        """
        Full softmax CE loss + DuoRec dropout contrastive loss.
        """
        # Forward pass 1
        user1 = self.encode(input_ids, lengths)  # (B, D)
        
        # Scores over all items (full softmax CE)
        all_item_embs = self.item_emb.weight[1:]  # (N, D), skip padding
        logits = user1 @ all_item_embs.t()  # (B, N)
        
        if targets is not None:
            # CE loss (targets are 1-indexed, logits are 0-indexed)
            ce_loss = F.cross_entropy(logits, targets - 1)
            
            # DuoRec contrastive: forward pass 2 with different dropout mask
            if self.training and cl_lambda > 0:
                user2 = self.encode(input_ids, lengths)
                cl_loss = self._contrastive_loss(user1, user2)
                return ce_loss + cl_lambda * cl_loss, logits
            
            return ce_loss, logits
        
        return logits
    
    def _contrastive_loss(self, h1, h2, temperature=0.1):
        """InfoNCE between two dropout views of same sequences."""
        h1 = F.normalize(h1, dim=-1)
        h2 = F.normalize(h2, dim=-1)
        logits = h1 @ h2.t() / temperature  # (B, B)
        labels = torch.arange(h1.shape[0], device=h1.device)
        return (F.cross_entropy(logits, labels) + F.cross_entropy(logits.t(), labels)) / 2


class SASRecV3(nn.Module):
    """SASRec with proper CE loss (fair baseline)."""
    def __init__(self, num_items, hidden_size=64, max_seq_len=200,
                 n_layers=2, n_heads=2, inner_size=256, dropout=0.2):
        super().__init__()
        self.num_items = num_items
        self.hidden_size = hidden_size
        self.max_seq_len = max_seq_len
        
        self.item_emb = nn.Embedding(num_items + 1, hidden_size, padding_idx=0)
        self.pos_emb = nn.Embedding(max_seq_len, hidden_size)
        self.emb_dropout = nn.Dropout(dropout)
        self.emb_norm = nn.LayerNorm(hidden_size)
        
        enc_layer = nn.TransformerEncoderLayer(
            d_model=hidden_size, nhead=n_heads, dim_feedforward=inner_size,
            dropout=dropout, activation='gelu', batch_first=True, norm_first=True)
        self.encoder = nn.TransformerEncoder(enc_layer, num_layers=n_layers)
        self.output_norm = nn.LayerNorm(hidden_size)
        
        self._init_weights()
    
    def _init_weights(self):
        for p in self.parameters():
            if p.dim() > 1: nn.init.trunc_normal_(p, std=0.02)
        nn.init.zeros_(self.item_emb.weight[0])
    
    def encode(self, input_ids, lengths):
        B, T = input_ids.shape
        x = self.item_emb(input_ids)
        pos = torch.arange(T, device=input_ids.device).unsqueeze(0).clamp(max=self.max_seq_len-1)
        x = self.emb_norm(self.emb_dropout(x + self.pos_emb(pos)))
        
        mask = torch.arange(T, device=input_ids.device).unsqueeze(0) < lengths.unsqueeze(1)
        causal = torch.triu(torch.ones(T, T, device=input_ids.device, dtype=torch.bool), diagonal=1)
        out = self.encoder(x, mask=causal, src_key_padding_mask=~mask)
        
        user = out[torch.arange(B, device=input_ids.device), (lengths - 1).clamp(min=0)]
        return self.output_norm(user)
    
    def forward(self, input_ids, lengths, targets=None):
        user = self.encode(input_ids, lengths)
        logits = user @ self.item_emb.weight[1:].t()
        if targets is not None:
            loss = F.cross_entropy(logits, targets - 1)
            return loss, logits
        return logits


# ============================================================
# EVALUATION (full ranking, proper protocol)
# ============================================================

@torch.no_grad()
def evaluate(model, loader, num_items, device, ks=[5, 10, 20, 50]):
    model.eval()
    metrics = {f'{m}@{k}': [] for k in ks for m in ['HR', 'NDCG', 'MRR']}
    
    for batch in loader:
        ids = batch['input_ids'].to(device)
        lens = batch['lengths'].to(device)
        tgt = batch['target'].to(device)
        
        if hasattr(model, '_contrastive_loss'):
            logits = model(ids, lens)[1] if model.training else model(ids, lens)
        else:
            logits = model(ids, lens)[1] if model.training else model(ids, lens)
        
        # model.forward without targets returns logits directly
        user = model.encode(ids, lens)
        logits = user @ model.item_emb.weight[1:].t()  # (B, N)
        
        gt_idx = tgt - 1  # 0-indexed
        gt_scores = logits[torch.arange(logits.shape[0], device=device), gt_idx]
        ranks = (logits > gt_scores.unsqueeze(1)).sum(dim=1) + 1  # (B,)
        
        for k in ks:
            hit = (ranks <= k).float()
            ndcg = torch.where(ranks <= k, 1.0 / torch.log2(ranks.float() + 1), torch.zeros_like(ranks.float()))
            mrr = torch.where(ranks <= k, 1.0 / ranks.float(), torch.zeros_like(ranks.float()))
            metrics[f'HR@{k}'].extend(hit.cpu().tolist())
            metrics[f'NDCG@{k}'].extend(ndcg.cpu().tolist())
            metrics[f'MRR@{k}'].extend(mrr.cpu().tolist())
    
    return {k: np.mean(v) for k, v in metrics.items()}


# ============================================================
# TRAINING
# ============================================================

def train_model(name, model, train_data, val_data, test_data, num_items, config, device):
    print(f"\n{'='*60}\n{name} | {sum(p.numel() for p in model.parameters() if p.requires_grad):,} params\n{'='*60}")
    
    model = model.to(device)
    MSL = config['max_seq_len']
    BS = config['batch_size']
    
    train_loader = DataLoader(SeqRecDataset(train_data, MSL), batch_size=BS,
                              shuffle=True, num_workers=2, drop_last=True, pin_memory=True)
    val_loader = DataLoader(SeqRecDataset(val_data, MSL), batch_size=BS*2,
                            num_workers=2, pin_memory=True)
    test_loader = DataLoader(SeqRecDataset(test_data, MSL), batch_size=BS*2,
                             num_workers=2, pin_memory=True)
    
    optimizer = AdamW(model.parameters(), lr=config['lr'], weight_decay=config['wd'])
    total_steps = config['epochs'] * len(train_loader)
    warmup = min(500, total_steps // 10)
    
    def lr_fn(step):
        if step < warmup: return step / max(warmup, 1)
        p = (step - warmup) / max(total_steps - warmup, 1)
        return max(0.01, 0.5 * (1 + math.cos(math.pi * p)))
    
    scheduler = torch.optim.lr_scheduler.LambdaLR(optimizer, lr_fn)
    
    best_hr10, best_ep, best_state = 0, 0, None
    patience, no_imp = config.get('patience', 8), 0
    
    for epoch in range(1, config['epochs'] + 1):
        model.train()
        total_loss, n = 0, 0
        t0 = time.time()
        
        for batch in train_loader:
            ids = batch['input_ids'].to(device)
            lens = batch['lengths'].to(device)
            tgt = batch['target'].to(device)
            
            optimizer.zero_grad()
            
            if hasattr(model, '_contrastive_loss'):
                loss, _ = model(ids, lens, tgt, cl_lambda=config.get('cl_lambda', 0.1))
            else:
                loss, _ = model(ids, lens, tgt)
            
            if torch.isnan(loss):
                continue
            
            loss.backward()
            torch.nn.utils.clip_grad_norm_(model.parameters(), 5.0)
            optimizer.step()
            scheduler.step()
            total_loss += loss.item()
            n += 1
        
        avg_loss = total_loss / max(n, 1)
        print(f"Ep {epoch:3d}/{config['epochs']} | Loss: {avg_loss:.4f} | {time.time()-t0:.0f}s", end='')
        
        try:
            if use_trackio:
                trackio.log({f"{name}/loss": avg_loss, "epoch": epoch})
        except:
            pass
        
        # Evaluate
        if epoch % config.get('eval_every', 3) == 0 or epoch <= 3 or epoch == config['epochs']:
            m = evaluate(model, val_loader, num_items, device, ks=[5, 10, 20])
            print(f" | HR@10={m['HR@10']:.4f} NDCG@10={m['NDCG@10']:.4f}", end='')
            try:
                if use_trackio:
                    trackio.log({f"{name}/{k}": v for k, v in m.items()})
            except:
                pass
            
            if m['HR@10'] > best_hr10:
                best_hr10 = m['HR@10']
                best_ep = epoch
                best_state = {k: v.cpu().clone() for k, v in model.state_dict().items()}
                no_imp = 0
                print(f" βœ“ BEST", end='')
            else:
                no_imp += 1
                if no_imp >= patience:
                    print(f"\n  Early stop at ep {epoch}")
                    break
        print()
    
    # Final test
    if best_state:
        model.load_state_dict(best_state)
        model = model.to(device)
    
    test_m = evaluate(model, test_loader, num_items, device, ks=[5, 10, 20, 50])
    print(f"\nTest ({name}, best ep {best_ep}):")
    for k in sorted(test_m): print(f"  {k}: {test_m[k]:.4f}")
    
    return test_m, best_state


# ============================================================
# MAIN
# ============================================================

if __name__ == '__main__':
    random.seed(42); np.random.seed(42); torch.manual_seed(42)
    device = torch.device('cuda' if torch.cuda.is_available() else 'cpu')
    print(f"Device: {device}")
    
    try:
        import trackio
        trackio.init(name="MARSv3-vs-SASRec", project="mars-seqrec")
        use_trackio = True
    except:
        use_trackio = False
    
    # Load data
    MSL = 200
    train, val, test, num_items = load_and_process_ml1m(max_seq_len=MSL)
    
    # ---- SASRec baseline (proper CE loss) ----
    sasrec = SASRecV3(num_items, hidden_size=64, max_seq_len=MSL, n_layers=2, 
                      n_heads=2, inner_size=256, dropout=0.2)
    sasrec_cfg = {'max_seq_len': MSL, 'batch_size': 256, 'lr': 1e-3, 'wd': 0.0,
                  'epochs': 50, 'patience': 8, 'eval_every': 2}
    
    sasrec_results, sasrec_state = train_model(
        'SASRec', sasrec, train, val, test, num_items, sasrec_cfg, device)
    
    # ---- MARS v3 ----
    mars = MARSv3(num_items, hidden_size=64, max_seq_len=MSL,
                  n_filter_layers=2, n_attn_layers=1, n_heads=2,
                  inner_size=256, short_len=50, n_memory=8, dropout=0.2)
    mars_cfg = {'max_seq_len': MSL, 'batch_size': 256, 'lr': 1e-3, 'wd': 0.0,
                'epochs': 50, 'patience': 8, 'eval_every': 2, 'cl_lambda': 0.1}
    
    mars_results, mars_state = train_model(
        'MARSv3', mars, train, val, test, num_items, mars_cfg, device)
    
    # ---- Comparison ----
    print(f"\n{'='*70}")
    print(f"{'Metric':<12} | {'SASRec':>8} | {'MARS v3':>8} | {'Delta':>8} | {'%':>8}")
    print(f"{'-'*70}")
    for k in sorted(sasrec_results):
        s, m = sasrec_results[k], mars_results[k]
        d = m - s
        pct = d / max(s, 1e-8) * 100
        mark = '↑' if d > 0 else '↓'
        print(f"{k:<12} | {s:>8.4f} | {m:>8.4f} | {d:>+8.4f} | {mark}{abs(pct):>6.1f}%")
    print(f"{'='*70}")
    
    # Save
    os.makedirs('./checkpoints', exist_ok=True)
    results = {'sasrec': sasrec_results, 'marsv3': mars_results,
               'sasrec_params': sum(p.numel() for p in sasrec.parameters()),
               'mars_params': sum(p.numel() for p in mars.parameters())}
    with open('./checkpoints/results_v3.json', 'w') as f:
        json.dump(results, f, indent=2, default=str)
    
    torch.save({'sasrec': sasrec_state, 'marsv3': mars_state, 'num_items': num_items,
                'results': results}, './checkpoints/models_v3.pt')
    
    # Push to hub
    try:
        from huggingface_hub import HfApi, upload_folder
        import shutil
        hub_id = 'CyberDancer/MARS-SeqRec'
        api = HfApi()
        api.create_repo(hub_id, exist_ok=True)
        shutil.copy('/app/mars_v3.py', './checkpoints/mars_v3.py')
        
        sp = results['sasrec_params']
        mp = results['mars_params']
        readme = f"""# MARS v3: Multi-scale Adaptive Recurrence with State compression

## Architecture
```
Long-term Branch:  FMLP Filter (FFT β†’ learnable filter β†’ IFFT, O(n log n))
                       ↓
                  [Compressive Memory] β†’ fixed-size bottleneck
                       ↓
Short-term Branch: Causal Self-Attention (last K items)
                       ↓
                  [Adaptive Fusion Gate]
                       ↓
Training:         Full Softmax CE + DuoRec Dropout Contrastive Loss
```

## Results on MovieLens-1M (Full Ranking, {num_items} items)

| Model | Params | HR@5 | HR@10 | HR@20 | NDCG@10 | MRR@10 |
|-------|--------|------|-------|-------|---------|--------|
| SASRec+CE | {sp:,} | {sasrec_results.get('HR@5',0):.4f} | {sasrec_results.get('HR@10',0):.4f} | {sasrec_results.get('HR@20',0):.4f} | {sasrec_results.get('NDCG@10',0):.4f} | {sasrec_results.get('MRR@10',0):.4f} |
| **MARS v3** | {mp:,} | {mars_results.get('HR@5',0):.4f} | {mars_results.get('HR@10',0):.4f} | {mars_results.get('HR@20',0):.4f} | {mars_results.get('NDCG@10',0):.4f} | {mars_results.get('MRR@10',0):.4f} |

## Key Innovations
1. **FMLP Filter (long-term)**: FFT-based learnable frequency filter denoises user history at O(n log n)
2. **Compressive Memory**: Cross-attention bottleneck β†’ constant-size summary of arbitrarily long history
3. **DuoRec Contrastive Learning**: Two dropout-augmented views of same sequence β†’ InfoNCE regularization
4. **Full Softmax CE**: Scores against ALL items, not sampled negatives β€” critical for quality
5. **Adaptive Fusion Gate**: Per-user learned balance of long-term preferences vs short-term intent
"""
        with open('./checkpoints/README.md', 'w') as f:
            f.write(readme)
        
        upload_folder(folder_path='./checkpoints', repo_id=hub_id,
                      commit_message="MARS v3: CE loss + contrastive learning + FMLP filters")
        print(f"βœ“ Pushed to https://huggingface.co/{hub_id}")
    except Exception as e:
        print(f"Hub: {e}")