Generative recommendation predicts items by autoregressively generating semantic identifiers (SIDs), whose tokens are shared across semantically related items. With this paradigm gaining adoption, the question of how to support unlearning in it has become pressing. If training interactions must later be removed, such as injected spam or interactions with items a user no longer wants, this sharing lets an unlearning update unintentionally affect the predictions for the interactions' neighbors. We show that this effect is locally structured and hidden by global metrics: unlearning can leave recommendation utility on the whole test set nearly unchanged while substantially degrading it on neighborhoods of the forgotten interactions' SIDs. We propose Neighborhood-Aware Unlearning (NAU), which augments interaction-level unlearning with explicit control over the probability mass assigned to the forgotten items' neighborhoods. Across three datasets and four SID tokenizers, NAU restores spam-induced exposure toward the retrained reference while retaining more than 95% of retrained utility, and recovers the neighborhood utility that forget-and-repair unlearning loses at no global cost. We identify local probability redistribution as an important failure mode of unlearning in SID-based generative recommenders and show that explicitly controlling this redistribution can mitigate its effects.
Figures & tables
Figure 1: Utility ↑ ( NDCG@10 as a percentage of the retrained model’s) versus spam exposure after spam removal, on the whole test set (left) and on the test cases whose next item shares the forgotten target’s first SID token (right). Only NAU removes spam exposure while preserving model utility on both the whole test set and the neighborhood of the forgotten interactions.
Beauty
Sports
Toys
Method
ΔSHretr↓
NDCG@10↑
τP↑
ΔSHretr↓
NDCG@10↑
τP↑
ΔSHretr↓
NDCG@10↑
τP↑
Retrained
(0.072)
3.766 ± 0.13
100.0
(0.139)
2.033 ± 0.07
100.0
(0.073)
3.465 ± 0.11
100.0
Poisoned
0.902 ± 0.59
3.589 ± 0.03
95.4 ± 3.32
0.168 ± 0.17
2.031 ± 0.06
100.0 ± 2.96
0.221 ± 0.14
3.387 ± 0.06
97.8 ± 3.29
Baselines
Finetune
0.767 ± 0.67
3.626 ± 0.04
96.4 ± 2.80
0.281 ± 0.23
2.082 ± 0.04
102.5 ± 3.52
0.823 ± 0.32
3.350 ± 0.06
96.8 ± 4.03
Forget only
0.072 ± 0.04
0.086 ± 0.14
2.2 ± 3.57
0.139 ± 0.21
0.014 ± 0.02
0.7 ± 1.20
0.073 ± 0.06
0.012 ± 0.01
0.3 ± 0.24
Table 1: Spam removal on Beauty, Sports, and Toys with TIGER + RQ-KMeans SID under a 1% bandwagon attack; mean ± s.d. over five data seeds × three targets per dataset. ΔSHretr=∣SHU@10−SHR@10∣ is the distance of the promoted item’s exposure from the retrained model’s, so leftover exposure and over-suppression both count. In the Retrain row, the italic value in parentheses is the retrained model’s own SH@10 , the reference for that column. For each baseline, we report the configuration with the smallest validation ΔSHretr among those keeping validation τP≥95% (ties broken by higher τP ), or, when no configuration reaches 95% , the smallest ΔSHretr overall. NAU is reported at one operating point for all datasets ( λf=0.1 , λs=0.01 , λn=0.01 ); the indented row below it uses a stronger separation weight ( λs=0.1 ) and is not ranked. All values are percentages. Bold and underline mark the best and second-best value per column among methods keeping τP≥95% . TRACER has no Beauty run under RQ-KMeans; cells marked † are its Beauty result under its own tokenizer, where τP is measured against that tokenizer’s retrained reference.
Objective
Whole test set
SID neighborhood
ΔSHretr(%)↓
NDCG@10↑
τP(%)↑
ΔSHretr(%)↓
NDCG@10↑
τP(%)↑
Retrained
0.000 ± 0.00
3.766 ± 0.13
100.0
0.000 ± 0.00
2.779 ± 1.63
100.0
Poisoned
0.753 ± 0.79
3.571 ± 0.09
0 94.8
4.780 ± 11.03
2.420 ± 1.23
0 87.1
Lret only
0.692 ± 0.77
3.659 ± 0.06
0 97.2
3.633 ± 4.84
2.954 ± 1.76
106.3
+Lfor
0.021 ± 0.04
3.654 ± 0.07
0 97.0
0.000 ± 0.00
2.419 ± 1.44
0 87.0
+Lsep ( λs=.01 )
0.001 ± 0.00
3.648 ± 0.05
0 96.9
0.000 ± 0.00
2.428 ± 1.42
0 87.4
Table 2: Ablation of NAU on Beauty with TIGER + RQ-KMeans over five seeds. Indented rows are alternative additions to Lret+Lfor (siblings, not a ladder). Since retrained exposure is 0% in both query sets, SH@10 also equals the absolute distance to retrained exposure. τP denotes NDCG@10 as a percentage of the retrained model’s utility within each query set.
Method
UHF@10(%)↓
UHR@10(%)
ΔUHRretr(%)↓
NDCG@10↑
τP (%) ↑
E(s)↓
Finetune
14.424 ± 13.461
2.948 ± 0.550
0.612 ± 0.299
3.510 ± 0.162
96.3 ± 5.0
0.3
Forget only
9.419 ± 6.109
1.990 ± 1.176
1.111 ± 0.684
3.516 ± 0.183
96.4 ± 5.8
0.3
Forget+Repair
12.606 ± 14.899
2.543 ± 0.840
0.734 ± 0.337
3.522 ± 0.168
96.6 ± 5.2
0.5
SCIF
15.981 ± 8.902
3.303 ± 0.424
0.481 ± 0.379
3.682 ± 0.139
101.0 ± 4.6
33.9
SEIF †
0.000 ± 0.000
0.000 ± 0.000
2.823 ± 0.474
0.030 ± 0.032
0.8 ± 0.9
0.3
Kookmin †
1.818 ± 4.066
1.230 ± 0.939
1.699 ± 1.180
2.788 ± 0.179
76.5 ± 5.6
0.3
Table 3: Unwanted item removal on Beauty (Hair Loss Products) with TIGER + RQ-KMeans, five data seeds. UHF@10 and UHR@10 are the unwanted item hit rates of the requesting and the remaining users; ΔUHRretr is the mean over seeds of ∣UHRU@10−UHRR@10∣ , the distance to the retrained model of the same seed. Each method uses the configuration selected on the validation split ( Table 8 ; † : τP<95% , never ranked); NAU uses λn=−1 , λs=0 . Retraining does not lower UHF@10 below the original model.
Dataset
SID
UHF@10(%)↓
UHR@10(%)
τP(%)↑
Retrained UHF / UHR
Beauty
RQ-KMeans
12.2 → 9.4 (1/5)
2.3 → 2.3 (2/5)
93.3 → 95.5 (5/5)
16.2 / 2.82
Beauty
LETTER
15.4 → 10.1 (3/5)
4.1 → 4.4 (3/5)
89.4 → 89.7 (4/5)
15.0 / 6.66
Sports
RQ-KMeans
27.6 → 11.1 (5/5)
1.4 → 0.5 (5/5)
91.1 → 92.4 (3/5)
29.3 / 1.42
Sports
LETTER
22.0 → 12.1 (5/5)
1.4 → 0.6 (5/5)
94.2 → 95.0 (3/5)
37.1 / 1.91
Toys
RQ-KMeans
0 5.0 → 9.7 (0/5)
2.3 → 2.4 (3/5)
92.1 → 95.1 (5/5)
18.1 / 3.51
Toys
LETTER
14.8 → 9.7 (3/5)
3.4 → 2.9 (5/5)
90.5 → 93.5 (5/5)
0 6.6 / 3.44
Table 4: Effect of the neighborhood term in unwanted item removal across datasets and tokenizers: NAU with λn=−1 against the same objective without the term ( λn=0 ; λf=0.1 , λs=0 ), paired over five data seeds. Each cell gives λn=0→−1 (mean over seeds) and, in parentheses, on how many of the five seeds the value decreases ( UHF , UHR ) or increases ( τP ). Retrained UHF@10 and UHR@10 are given for reference.
Figure 2: Effect of each objective term on the neighborhood (spam removal on Beauty, TIGER + RQ-KMeans, mid-popularity target, five seeds). (a) Utility as a percentage of the retrained model’s, on the whole test set and on the target’s SID neighborhood (523 test cases whose next item shares the target’s first SID token). (b) Neighborhood utility gained over fine-tuning on the retain and forget sets, in percentage points, with 95% paired bootstrap intervals ( Appendix G ); intervals excluding 0 mark reliable differences. The last row uses a stronger separation weight ( λs=0.1 ) and is not selected ( Table 6 ). Baselines are compared in Figure 1 and Table 1 .
Appendix figures & tables22 assets
Supplementary material from the paper’s appendix.
Appendix
Dataset
#Users
#Items
#Interactions
Avg. length
Beauty
22,363
12,101
198,502
8.88
Sports
35,598
18,357
296,337
8.32
Toys
19,412
11,924
167,597
8.63
Appendix
Table 5: Dataset statistics after preprocessing.
Whole set
SID neighborhood
Combined
λs
λn
ΔSHretr(%)↓
τP(%)↑
ΔSHretr(%)↓
τP(%)↑
τP(%)↑
Sel.
0.0
0.0
0.112
96.9
0.678
86.5
91.7
0.0
0.01
0.089
96.7
0.863
106.6
101.7
0.0
0.1
0.094
93.7
0.874
157.9
125.8
0.01
0.0
0.086
97.0
0.879
87.6
92.3
0.01
0.01
0.086
96.9
0.874
103.6
100.2
✓
Appendix
Table 6: Selection of NAU’s weights on the validation split (Beauty, TIGER + RQ-KMeans, λf=0.1 , three targets × five data seeds). Whole set: ΔSHretr and τP on all validation cases; neighborhood: the same on the validation cases whose next item shares the target’s first SID token (the target’s own cases excluded), with τP as a ratio of pooled NDCG@10 . Selection is among settings of the full objective ( λs,λn>0 ) that keep whole-set τP≥95% : settings whose whole-set ΔSHretr is not resolvably different from the lowest one (paired 95% interval over the five seeds includes 0) are treated as tied, and among them the highest combined utility, the mean of whole-set and neighborhood τP , is selected (✓); the choice is the same for any weighting of the two. Settings below 95% whole-set utility are shown in gray; – marks settings not scored on the neighborhood.
Validation
Test
Dataset
Method
Configuration
ΔSHretr↓
τP↑
ΔSHretr↓
τP↑
Sel.
Beauty
Fanchuan
fanchuan_t0.007
0.079
11.9
0.072
12.6
Beauty
Fanchuan
fanchuan_t0.07
0.079
32.0
0.072
32.4
✓
Beauty
Forget only
unified_abl_lf0.1_ls0.0_ln0.0_lr0.0
0.079
2.1
0.072
1.9
Beauty
Forget only
unified_abl_lf1.0_ls0.0_ln0.0_lr0.0
0.079
2.7
0.072
2.5
✓
Beauty
Forget+Repair
unified_abl_lf1.0_ls0.0_ln0.0
0.079
75.8
0.072
72.8
Appendix
Table 7: Hyperparameter selection on the validation split (TIGER + RQ-KMeans; TRACER on Beauty with its own tokenizer). For every candidate configuration, pooled over five data seeds and three targets: distance to the retrained model’s exposure ΔSHretr and τP , on the validation split (used for selection) and on the test split (reported in Table 1 ). The selected configuration (✓) has the smallest validation ΔSHretr among those with validation τP≥95% , ties broken by higher τP ; if none reaches 95% , the smallest validation ΔSHretr overall. Finetune and SCIF have a single configuration; NAU’s selection is shown in Table 6 .
Validation
Test
Dataset
Method
Configuration
UHF@10↓
τP↑
UHF@10↓
τP↑
Sel.
Beauty
SCIF
scif_d0.001
24.99
99.6
15.98
101.0
Beauty
SCIF
scif_d0.01
24.99
99.6
15.98
101.0
✓
Beauty
SCIF
scif_d0.1
26.53
99.6
15.98
100.9
Beauty
SEIF
seif_std0.006
15.50
60.4
10.06
63.9
Beauty
SEIF
seif_std0.06
17.04
59.2
8.25
62.0
Appendix
Table 8: Hyperparameter selection for unwanted-item removal on the validation split (TIGER + RQ-KMeans). For every candidate configuration, averaged over five data seeds: UHF@10 and τP on the validation split (used for selection) and on the test split (reported in Appendix F ). The selected configuration (✓) has the lowest validation UHF@10 among those with validation τP≥95% ; if none reaches 95% , the lowest validation UHF@10 overall. NAU ( λf=0.1 , λs=0 ) selects λn once on the Beauty validation split with the same rule and uses it on all datasets. Finetune, Forget only and Forget+Repair have a single configuration.
Method
E (s) ↓
τE↑
Finetune
0.5
0.99997
Forget only
0.3
0.99998
Forget + Repair
0.7
0.99995
SCIF
35.3
0.99774
SEIF
0.5
0.99997
Kookmin
0.4
0.99998
Appendix
Table 9: Efficiency of unlearning methods on Beauty (TIGER + RQ-KMeans), each at its configuration in Table 1 . E is the median wall-clock time per unlearning request on one H200 GPU over three targets × five data seeds, and τE=1−E/Eretrain the fraction of retraining cost saved. † TRACER under its own tokenizer, as in Table 1 .
Target
Variant
SH@10 (%)
NDCG@10 (%)
τP (%)
E (s)
Unpopular
NAU (gen. sep.)
0.000 ± 0.000
3.600 ± 0.119
95.8 ± 6.2
3.5
NAU (cos. sep.)
0.000 ± 0.000
3.504 ± 0.092
93.2 ± 5.4
2.9
NAU
0.000 ± 0.000
3.596 ± 0.115
95.6 ± 6.1
3.4
NAU (grid)
0.000 ± 0.000
3.612 ± 0.106
96.1 ± 5.8
3.7
Mid
NAU (gen. sep.)
0.000 ± 0.000
3.654 ± 0.041
97.1 ± 2.8
3.5
NAU (cos. sep.)
0.000 ± 0.000
3.545 ± 0.053
94.2 ± 2.3
2.9
Appendix
Table 10: Additional NAU variants on Beauty with TIGER and RQ-KMeans SID under the bandwagon attack. The variants differ in the separation score and the neighborhood/separation weight selection strategy. SH@10 , NDCG@10 , and τP are reported as percentages.
Target
Method
SH@10 (%)
ΔSHretr (%) ↓
NDCG@10 (%)
τP (%)
E (s)
Unpopular
Baselines
Finetune
0.365 ± 0.362
0.361 ± 0.362
3.206 ± 0.106
98.6 ± 2.4
0.9
Forget only
0.000 ± 0.000
0.004 ± 0.008
0.166 ± 0.288
5.2 ± 9.1
0.4
Forget + Repair
0.016 ± 0.036
0.020 ± 0.035
3.196 ± 0.104
98.3 ± 2.6
0.8
SCIF
0.729 ± 1.081
0.725 ± 1.082
3.203 ± 0.097
98.5 ± 1.2
35.2
SEIF
0.119 ± 0.190
0.115 ± 0.182
2.267 ± 0.192
69.8 ± 6.6
0.5
Appendix
Table 11: Spam-removal results on Beauty with TIGER + RQ-VAE SID under the bandwagon attack. Each baseline uses the configuration selected for TIGER + RQ-KMeans on the validation split of the same dataset ( Table 7 ). NAU is reported at its operating point ( λf=0.1 , λs=0.01 , λn=0.01 , generative separation score); the indented row below it uses a stronger separation weight ( λs=0.1 ) and is not ranked. SH@10 , ΔSHretr , NDCG@10 , and τP are reported as percentages. ΔSHretr is the mean over (seed, target) cells of ∣SH@10−SH@10retr∣ , so it measures closeness to retraining rather than raw suppression; it is the same quantity Table 1 reports. SH@10 measures target suppression; closeness to retraining also depends on retrained exposure. Higher NDCG@10 and τP indicate better utility preservation. E reports unlearning time per request in seconds.
Target
Method
SH@10 (%)
ΔSHretr (%) ↓
NDCG@10 (%)
τP (%)
E (s)
Unpopular
Baselines
Finetune
0.494 ± 0.690
0.494 ± 0.690
1.719 ± 0.095
106.0 ± 8.9
1.3
Forget only
0.000 ± 0.000
0.000 ± 0.000
0.085 ± 0.178
6.0 ± 12.7
0.4
Forget + Repair
0.178 ± 0.395
0.178 ± 0.395
1.710 ± 0.095
105.4 ± 9.0
1.0
SCIF
0.725 ± 1.004
0.725 ± 1.004
1.658 ± 0.091
102.3 ± 10.5
34.9
SEIF
0.011 ± 0.015
0.011 ± 0.015
1.001 ± 0.073
61.8 ± 6.8
0.7
Appendix
Table 12: Spam-removal results on Sports with TIGER + RQ-VAE SID under the bandwagon attack. Each baseline uses the configuration selected for TIGER + RQ-KMeans on the validation split of the same dataset ( Table 7 ). NAU is reported at its operating point ( λf=0.1 , λs=0.01 , λn=0.01 , generative separation score); the indented row below it uses a stronger separation weight ( λs=0.1 ) and is not ranked. SH@10 , ΔSHretr , NDCG@10 , and τP are reported as percentages. ΔSHretr is the mean over (seed, target) cells of ∣SH@10−SH@10retr∣ , so it measures closeness to retraining rather than raw suppression; it is the same quantity Table 1 reports. SH@10 measures target suppression; closeness to retraining also depends on retrained exposure. Higher NDCG@10 and τP indicate better utility preservation. E reports unlearning time per request in seconds.
Target
Method
SH@10 (%)
ΔSHretr (%) ↓
NDCG@10 (%)
τP (%)
E (s)
Unpopular
Baselines
Finetune
0.457 ± 0.295
0.453 ± 0.294
3.009 ± 0.048
98.1 ± 3.6
0.9
Forget only
0.000 ± 0.000
0.004 ± 0.009
0.048 ± 0.062
1.5 ± 1.9
0.4
Forget + Repair
0.031 ± 0.043
0.033 ± 0.042
3.005 ± 0.063
97.9 ± 3.7
1.3
SCIF
0.651 ± 0.577
0.647 ± 0.579
3.034 ± 0.058
98.8 ± 2.9
34.2
SEIF
0.104 ± 0.091
0.100 ± 0.088
1.984 ± 0.145
64.7 ± 5.9
0.5
Appendix
Table 13: Spam-removal results on Toys with TIGER + RQ-VAE SID under the bandwagon attack. Each baseline uses the configuration selected for TIGER + RQ-KMeans on the validation split of the same dataset ( Table 7 ). NAU is reported at its operating point ( λf=0.1 , λs=0.01 , λn=0.01 , generative separation score); the indented row below it uses a stronger separation weight ( λs=0.1 ) and is not ranked. SH@10 , ΔSHretr , NDCG@10 , and τP are reported as percentages. ΔSHretr is the mean over (seed, target) cells of ∣SH@10−SH@10retr∣ , so it measures closeness to retraining rather than raw suppression; it is the same quantity Table 1 reports. SH@10 measures target suppression; closeness to retraining also depends on retrained exposure. Higher NDCG@10 and τP indicate better utility preservation. E reports unlearning time per request in seconds.
Target
Method
SH@10 (%)
ΔSHretr (%) ↓
NDCG@10 (%)
τP (%)
E (s)
Unpopular
Baselines
Finetune
0.194 ± 0.142
0.193 ± 0.142
3.823 ± 0.062
101.0 ± 5.3
0.9
Forget only
0.000 ± 0.000
0.001 ± 0.002
0.011 ± 0.015
0.3 ± 0.4
0.4
Forget + Repair
0.000 ± 0.000
0.001 ± 0.002
3.778 ± 0.082
99.8 ± 5.8
1.3
SCIF
0.245 ± 0.183
0.244 ± 0.182
3.764 ± 0.062
99.4 ± 3.8
40.0
SEIF
0.123 ± 0.157
0.123 ± 0.156
2.684 ± 0.240
70.7 ± 3.3
0.6
Appendix
Table 14: Spam-removal results on Beauty with TIGER + LETTER SID under the bandwagon attack. Each baseline uses the configuration selected for TIGER + RQ-KMeans on the validation split of the same dataset ( Table 7 ). NAU is reported at its operating point ( λf=0.1 , λs=0.01 , λn=0.01 , generative separation score); the indented row below it uses a stronger separation weight ( λs=0.1 ) and is not ranked. SH@10 , ΔSHretr , NDCG@10 , and τP are reported as percentages. ΔSHretr is the mean over (seed, target) cells of ∣SH@10−SH@10retr∣ , so it measures closeness to retraining rather than raw suppression; it is the same quantity Table 1 reports. SH@10 measures target suppression; closeness to retraining also depends on retrained exposure. Higher NDCG@10 and τP indicate better utility preservation. E reports unlearning time per request in seconds.
Target
Method
SH@10 (%)
ΔSHretr (%) ↓
NDCG@10 (%)
τP (%)
E (s)
Unpopular
Baselines
Finetune
0.240 ± 0.231
0.167 ± 0.204
1.992 ± 0.053
105.8 ± 7.0
1.3
Forget only
0.000 ± 0.000
0.078 ± 0.105
0.011 ± 0.021
0.6 ± 1.1
0.3
Forget + Repair
0.030 ± 0.066
0.097 ± 0.100
1.976 ± 0.055
104.9 ± 7.2
1.0
SCIF
0.334 ± 0.352
0.256 ± 0.345
1.946 ± 0.060
103.3 ± 6.4
34.8
SEIF
0.157 ± 0.210
0.079 ± 0.106
1.206 ± 0.087
64.0 ± 6.3
0.8
Appendix
Table 15: Spam-removal results on Sports with TIGER + LETTER SID under the bandwagon attack. Each baseline uses the configuration selected for TIGER + RQ-KMeans on the validation split of the same dataset ( Table 7 ). NAU is reported at its operating point ( λf=0.1 , λs=0.01 , λn=0.01 , generative separation score); the indented row below it uses a stronger separation weight ( λs=0.1 ) and is not ranked. SH@10 , ΔSHretr , NDCG@10 , and τP are reported as percentages. ΔSHretr is the mean over (seed, target) cells of ∣SH@10−SH@10retr∣ , so it measures closeness to retraining rather than raw suppression; it is the same quantity Table 1 reports. SH@10 measures target suppression; closeness to retraining also depends on retrained exposure. Higher NDCG@10 and τP indicate better utility preservation. E reports unlearning time per request in seconds.
Target
Method
SH@10 (%)
ΔSHretr (%) ↓
NDCG@10 (%)
τP (%)
E (s)
Unpopular
Baselines
Finetune
0.518 ± 0.398
0.501 ± 0.415
3.374 ± 0.059
94.6 ± 3.3
0.5
Forget only
0.000 ± 0.000
0.018 ± 0.034
0.000 ± 0.000
0.0 ± 0.0
0.3
Forget + Repair
0.012 ± 0.013
0.026 ± 0.031
3.391 ± 0.048
95.0 ± 2.6
1.2
SCIF
0.874 ± 0.741
0.856 ± 0.759
3.411 ± 0.054
95.6 ± 2.8
39.1
SEIF
0.098 ± 0.087
0.109 ± 0.072
2.124 ± 0.117
59.6 ± 4.4
0.6
Appendix
Table 16: Spam-removal results on Toys with TIGER + LETTER SID under the bandwagon attack. Each baseline uses the configuration selected for TIGER + RQ-KMeans on the validation split of the same dataset ( Table 7 ). NAU is reported at its operating point ( λf=0.1 , λs=0.01 , λn=0.01 , generative separation score); the indented row below it uses a stronger separation weight ( λs=0.1 ) and is not ranked. SH@10 , ΔSHretr , NDCG@10 , and τP are reported as percentages. ΔSHretr is the mean over (seed, target) cells of ∣SH@10−SH@10retr∣ , so it measures closeness to retraining rather than raw suppression; it is the same quantity Table 1 reports. SH@10 measures target suppression; closeness to retraining also depends on retrained exposure. Higher NDCG@10 and τP indicate better utility preservation. E reports unlearning time per request in seconds.
Target
Method
SH@10 (%)
ΔSHretr (%) ↓
NDCG@10 (%)
τP (%)
E (s)
Unpopular
Baselines
Finetune
1.250 ± 0.936
1.250 ± 0.936
3.700 ± 0.072
102.8 ± 3.3
0.5
Forget only
0.000 ± 0.000
0.000 ± 0.000
0.020 ± 0.034
0.5 ± 0.9
0.4
Forget + Repair
0.097 ± 0.129
0.097 ± 0.129
3.701 ± 0.077
102.8 ± 3.2
0.7
SCIF
1.729 ± 1.660
1.729 ± 1.660
3.649 ± 0.056
101.4 ± 3.0
39.9
SEIF
0.535 ± 0.714
0.535 ± 0.714
2.607 ± 0.193
72.5 ± 5.6
0.5
Appendix
Table 17: Spam-removal results on Beauty with TIGER + TRACER SID under the bandwagon attack. Each baseline uses the configuration selected for TIGER + RQ-KMeans on the validation split of the same dataset ( Table 7 ). NAU is reported at its operating point ( λf=0.1 , λs=0.01 , λn=0.01 , generative separation score); the indented row below it uses a stronger separation weight ( λs=0.1 ) and is not ranked. SH@10 , ΔSHretr , NDCG@10 , and τP are reported as percentages. ΔSHretr is the mean over (seed, target) cells of ∣SH@10−SH@10retr∣ , so it measures closeness to retraining rather than raw suppression; it is the same quantity Table 1 reports. SH@10 measures target suppression; closeness to retraining also depends on retrained exposure. Higher NDCG@10 and τP indicate better utility preservation. E reports unlearning time per request in seconds.
Whole test set
Objective
SH@10(%)↓
ΔSHretr(%)↓
NDCG@10↑
τP(%)↑
Retrained
0.067 ± 0.12
0.000
3.461 ± 0.11
100.0
Poisoned
0.297 ± 0.23
0.230
3.377 ± 0.06
97.6
Lret only
0.656 ± 0.57
0.589
3.348 ± 0.03
96.7
+Lfor
0.159 ± 0.23
0.092
3.345 ± 0.03
96.6
+Lsep ( λs=.01 )
0.113 ± 0.18
0.046
3.352 ± 0.03
96.8
Appendix
Table 18: Ablation of NAU on Toys with TIGER + RQ-KMeans (mid-popularity target, five seeds). The SID neighborhood contains 563 test cases whose next item shares the target’s first SID token; the target’s own test cases are excluded. Indented rows are alternative additions to Lret+Lfor (siblings, not a ladder). ΔSHretr is the absolute distance to the retrained model’s exposure (0.067% on the whole test set and 2.664% in the neighborhood). τP denotes NDCG@10 as a percentage of the retrained model’s utility within each query set.
Objective
Removal and utility
Local effect (nats)
SH@10(%)
ΔSHretr(%)↓
NDCG@10↑
τP(%)↑
Δtgt
Δnbr−Δctrl
Lret only
0.986 ± 0.947
0.914
3.630 ± 0.109
96.5 ± 3.7
+5.07± 1.69
−0.14± 0.21
+Lfor
0.110 ± 0.211
0.108
3.622 ± 0.118
96.3 ± 4.0
+1.67± 4.17
+0.04± 0.31
+Lsep ( λs=0.1 )
0.000 ± 0.000
0.072
3.615 ± 0.105
96.1 ± 3.9
−19.04± 5.57
−0.11± 0.17
+Lnbr ( λn=0.01 )
0.038 ± 0.118
0.103
3.615 ± 0.111
96.1 ± 3.8
−1.74± 3.23 †
+0.36± 0.37 †
NAU ( λs=0.01 , λn=0.01 )
0.010 ± 0.034
0.081
3.621 ± 0.107
96.2 ± 3.8
−4.32± 3.39
+0.33± 0.34
Appendix
Table 19: Ablation of NAU on Beauty (TIGER + RQ-KMeans, five seeds × three targets). Indented rows each add one term to Lret+Lfor (siblings, not a ladder). Local effect: signed change in log probability mass relative to the retrained model of the same seed, on held-out test histories, for the forgotten target ( Δtgt ) and its SID -prefix neighbors beyond prefix-disjoint controls ( Δnbr−Δctrl ); mean ± s.d. across seeds. † Local effect measured on a matched configuration rather than the ablation’s own runs. Lfor does most of the removal, Lnbr moves mass into the neighborhood in proportion to λn , and a strong separation term ( λs=0.1 ) pushes the target far below its retrained mass.
Target
Loss terms
SH@10 (%)
NDCG@10 (%)
τP (%)
ΔτP (%)
Unpopular
Lretain only
0.184 ± 0.231
2.082 ± 0.024
102.5 ± 3.8
+0.85 ± 0.50
+Lforget
0.000 ± 0.000
2.065 ± 0.029
101.7 ± 4.0
–
+Lsep ( λs=0.1 )
0.000 ± 0.000
2.059 ± 0.026
101.4 ± 3.5
-0.29 ± 0.61
+Lneighborhood ( λn=0.01 )
0.000 ± 0.000
2.069 ± 0.041
101.9 ± 4.0
+0.18 ± 1.14
+Lsep+Lneighborhood= NAU ( λs=0.1 , λn=0.01 )
0.000 ± 0.000
2.063 ± 0.031
101.6 ± 3.3
-0.11 ± 0.83
NAU at λn=0.1 (over-strong dose, cosine sep)
0.000 ± 0.000
2.007 ± 0.049
98.8 ± 3.7
-2.88 ± 1.75
Appendix
Table 20: Per-term ablation of the NAU objective on Sports with TIGER + RQ-KMeans (bandwagon, 1% poison, ntarget=1 ), at λf=0.1 , λs=0.1 , λn=0.01 and wr=wf=1 , with the generative separation score ϕgen and embedding/mass neighbours in every row that activates the corresponding term, so only the WEIGHTS vary. The one exception is the over-strong dose row, which is only available with the cosine score and is marked accordingly. Each data seed is scored against its own clean and poisoned reference, with unlearning replicates averaged within a seed and the spread taken across seeds; ± is therefore absent wherever the column rests on a single data seed. SH@10 , NDCG@10 , τP and ΔτP are reported as percentages, matching the main results tables. ΔτP is paired against the +Lforget row on (stratum, seed), which removes the seed intercept.
Target
Loss terms
SH@10 (%)
NDCG@10 (%)
τP (%)
ΔτP (%)
Unpopular
Lretain only
1.092 ± 1.290
3.342 ± 0.058
96.5 ± 3.8
-0.35 ± 0.41
+Lforget
0.240 ± 0.255
3.354 ± 0.070
96.9 ± 4.0
–
+Lsep ( λs=0.1 )
0.000 ± 0.000
3.337 ± 0.056
96.4 ± 3.2
-0.50 ± 0.99
+Lneighborhood ( λn=0.01 )
0.013 ± 0.030
3.349 ± 0.065
96.7 ± 3.5
-0.16 ± 0.45
+Lsep+Lneighborhood= NAU ( λs=0.1 , λn=0.01 )
0.000 ± 0.000
3.347 ± 0.080
96.7 ± 4.6
-0.18 ± 1.02
NAU at λn=0.1 (over-strong dose, cosine sep)
0.000 ± 0.000
3.282 ± 0.053
94.8 ± 3.5
-2.10 ± 1.29
Appendix
Table 21: Per-term ablation of the NAU objective on Toys with TIGER + RQ-KMeans (bandwagon, 1% poison, ntarget=1 ), at λf=0.1 , λs=0.1 , λn=0.01 and wr=wf=1 , with the generative separation score ϕgen and embedding/mass neighbours in every row that activates the corresponding term, so only the WEIGHTS vary. The one exception is the over-strong dose row, which is only available with the cosine score and is marked accordingly. Each data seed is scored against its own clean and poisoned reference, with unlearning replicates averaged within a seed and the spread taken across seeds; ± is therefore absent wherever the column rests on a single data seed. SH@10 , NDCG@10 , τP and ΔτP are reported as percentages, matching the main results tables. ΔτP is paired against the +Lforget row on (stratum, seed), which removes the seed intercept.
Figure 3: Neighborhood utility gained on each dataset and target popularity (TIGER + RQ-KMeans, five seeds per setting), in points of the retrained model’s neighborhood utility: (a) NAU over fine-tuning on the retain and forget sets; (b) NAU with the stronger separation weight ( λs=0.1 ) over fine-tuning on the retain and forget sets with the separation term ( λs=0.1 ). Bars are 95% paired bootstrap intervals over the shared test cases ( Appendix G ); the neighborhood excludes the target’s own test cases.
Method
UHF@10(%)↓
UHR@10(%)
ΔUHRretr(%)↓
NDCG@10↑
τP (%)
E(s)↓
Finetune †
29.651 ± 14.035
1.602 ± 0.252
0.180 ± 0.126
1.894 ± 0.066
93.0 ± 6.4
0.3
Forget only †
16.606 ± 12.736
0.694 ± 0.327
0.727 ± 0.358
1.915 ± 0.094
94.1 ± 8.6
0.3
Forget+Repair †
30.718 ± 10.996
1.475 ± 0.338
0.221 ± 0.121
1.899 ± 0.071
93.2 ± 6.7
0.5
SCIF
32.870 ± 16.770
1.707 ± 0.385
0.334 ± 0.231
2.045 ± 0.086
100.5 ± 9.4
34.5
SEIF †
0.000 ± 0.000
0.000 ± 0.000
1.422 ± 0.197
0.003 ± 0.005
0.1 ± 0.2
0.3
Kookmin †
31.332 ± 14.574
1.408 ± 0.295
0.126 ± 0.089
1.374 ± 0.094
67.4 ± 5.4
0.3
Appendix
Table 22: Unwanted item removal on Sports (Guns & Rifles) with TIGER + RQ-KMeans, five data seeds. UHF@10 and UHR@10 are the unwanted item hit rates of the requesting and the remaining users; ΔUHRretr is the mean over seeds of ∣UHRU@10−UHRR@10∣ , the distance to the retrained model of the same seed. Each method uses the configuration selected on the validation split ( Table 8 ; † : τP<95% , never ranked); NAU uses λn=−1 , λs=0 .
Method
UHF@10(%)↓
UHR@10(%)
ΔUHRretr(%)↓
NDCG@10↑
τP (%)
E(s)↓
Finetune
6.538 ± 6.940
2.854 ± 0.387
0.767 ± 0.463
3.118 ± 0.077
95.1 ± 2.9
0.3
Forget only †
4.872 ± 4.455
1.879 ± 0.513
1.634 ± 0.404
2.945 ± 0.113
89.9 ± 5.3
0.3
Forget+Repair †
6.667 ± 9.129
2.363 ± 0.289
1.149 ± 0.374
3.067 ± 0.074
93.6 ± 3.4
0.5
SCIF
11.154 ± 7.045
2.911 ± 0.195
0.602 ± 0.340
3.392 ± 0.070
103.5 ± 3.7
32.9
SEIF †
0.000 ± 0.000
0.021 ± 0.046
3.492 ± 0.266
0.031 ± 0.029
1.0 ± 0.9
0.3
Kookmin †
8.205 ± 8.338
2.809 ± 0.612
0.774 ± 0.742
2.500 ± 0.161
76.3 ± 6.2
0.3
Appendix
Table 23: Unwanted item removal on Toys (toy weapons) with TIGER + RQ-KMeans, five data seeds. UHF@10 and UHR@10 are the unwanted item hit rates of the requesting and the remaining users; ΔUHRretr is the mean over seeds of ∣UHRU@10−UHRR@10∣ , the distance to the retrained model of the same seed. Each method uses the configuration selected on the validation split ( Table 8 ; † : τP<95% , never ranked); NAU uses λn=−1 , λs=0 . Retraining does not lower UHF@10 below the original model.
Dataset
Tokenizer
Level
Distinct prefixes
Unique (%)
Mean nbrs.
Median
P90
Singletons (%)
Beauty
RKMeans
0
256
2.1
82.90
74
141
0.2
1
6,150
50.8
3.16
1
8
30.6
2
10,483
86.6
0.50
0
2
78.3
3 (dedup)
12,101
100.0
0.00
0
0
100.0
RQVAE
0
103
0.9
171.90
151
297
0.0
1
6,370
52.6
3.94
1
10
32.7
Appendix
Table 24: Neighborhood statistics across SID levels. Early levels define broader prefix-sharing neighborhoods, while later levels become increasingly sparse or singleton-dominated. A high singleton share indicates that the corresponding level is less suitable for prefix-based neighborhood construction.
target
update restricted to
SH@10
NDCG@10
τP
unpopular : attack landed on all seeds
all parameters (unrestricted)
0.00000 ± 0.00000
0.03586 ± 0.00112
0.954 ± 0.059
levels 3, 4 frozen
0.00000
0.03666
0.974
levels 1, 2 + backbone
0.00155 ± 0.00326
0.03605 ± 0.00127
0.959 ± 0.065
levels 1, 2, 3 + backbone
0.00140 ± 0.00292
0.03604 ± 0.00130
0.959 ± 0.065
levels 1, 2, codes only
0.00934 ± 0.01058
0.03604 ± 0.00103
0.958 ± 0.055
Appendix
Table 25: Restricting the unlearning update to individual semantic ID levels, on beauty, TIGER + RQ-KMeans, at the full objective’s operating point. Levels are numbered 1 to L=4 , level 4 being the deduplication digit. “codes only” freezes the backbone, so the update reaches the identifier embeddings and nothing else; those are the discriminating arms, because with the backbone free every restriction removes the target and the levels cannot be told apart. Each data seed is scored against its own reference, unlearning replicates averaged within a seed and the spread taken across seeds.
Machine unlearning removes the influence of selected data or concepts from trained models while preserving useful behavior and avoiding full retraining.
Generative recommendation formulates next-item prediction as autoregressive generation over semantic ID (SID) sequences derived from users' historical interactions, making modern recommender systems structurally similar to large language models (LLMs). As privacy and safety concerns grow, these systems increasingly require concept unlearning to remove sensitive or harmful concepts associated with items. However, existing LLM unlearning methods cannot be directly applied to generative recommendation. Unlike word tokens with explicit semantics, SIDs are abstract identifiers that are often shared by both forget and retain items, leading to severe conflicts between concept removal and recommendation utility preservation. To address this challenge, we propose TRACER, an end-to-end concept unlearning framework based on token reassignment. Rather than directly suppressing shared SIDs, TRACER reassigns concept-related items to alternative tokens that better facilitate forgetting while minimizing side effects on retained items. We further introduce a coherence regularizer to preserve semantic consistency among retain items during unlearning. Experiments on real-world recommendation datasets demonstrate that TRACER effectively removes target concepts while substantially better preserving recommendation utility than existing unlearning baselines.
Ziheng Chen, Jiali Cheng, Zezhong Fan +4
Stony Brook University · University of Massachusetts Lowell · Columbia University +3
Semantic-ID-based generative recommendation represents items as sequences of shared semantic tokens, enabling token recombination beyond isolated item IDs. However, closed-world recombination does not necessarily imply temporal open-token cold-start induction, where new items enter the item catalog with unseen atomic tokens or weakly supported SID paths. In this work, we revisit SID-based generative recommendation under an absolute-time temporal protocol that separates seen and unseen targets and diagnoses the cold item reachability at the token level. Through seen/unseen-hit analysis, coldness taxonomy, and oracle-prefix probing, we show that current SID-based models can occasionally reach future items supported by observed tokens and prefixes, but struggle with unseen atomic tokens and unsupported SID paths. We further explain this boundary by interpreting SID generation as hierarchical semantic bucketing: early tokens select coarse semantic regions, while later tokens refine item-specific paths. These findings show that SID generation is compositional but not fully open-ended, and suggest future directions in more independent SID spaces, scoring-based interfaces, and dynamic textual context.
Jie Peng, Yanping Zheng, Zhewei Zhe +3
Renmin University of China · Beijing, China · Alibaba
Semantic IDs (SIDs) are now a central component of generative recommendation. Current SID-based systems assign three roles to the same token sequence. Shared prefixes are intended to organize related items, the complete SID identifies an individual item, and each generated token narrows the items that can still be returned. We systematically investigate SIDs from item encoding and SID construction to autoregressive generation and final recommendation. We examine how SID construction changes item representations and how those changes affect generation. Across three Amazon domains and eight SID constructions, SID neighborhoods recover only 32.2% of the encoder's ten nearest neighbors on average. Alternative item descriptions still retrieve the corresponding item first in 99.57% of controlled cases, yet change 38.4% of exact SIDs. These results show that SIDs retain broad organization but lose much of the encoder's fine local structure, while their exact tokens are not determined by item meaning alone. This loss becomes consequential during generation. After the final semantic token, TIGER retains only 29.9% of held-out targets that were plausible recommendations before SID filtering. Motivated by these findings, we propose Item-Supported Decoding (ISD), a lightweight inference-time method that allows a user-specific item ranking to support corresponding SID prefixes before beam search discards them. The same ranking then orders the generated items. ISD requires no additional parameters or retraining of the SID constructor or decoder. We empirically show that ISD improves NDCG@10 over the corresponding SID backbone in every evaluated setting, with relative gains of up to 31.2%. Our results show that SIDs provide useful coarse item organization, but their fine boundaries should not alone determine which items remain available during generation.
Junting Wang, Xinrui He, Yunzhe Li +1
University of Illinois Urbana-Champaign Urbana, Illinois, USA