{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/sequential-recommendation/papers/3","list_of":"/task/sequential-recommendation","task":"Sequential Recommendation","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":6,"rows_per_page":100,"rows":[201,300],"of":554,"counts":{"archive_papers_tagged":554,"with_a_code_link":300,"where_syntology_ran_a_sample":69,"not_listed_spam_title":0,"listed":554,"listed_where_code_ran":69,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":58,"every_run_a_failure_of_syntologys_instrument":11,"listed_with_a_run_with_no_instrument_failure":58,"listed_every_run_a_failure_of_syntologys_instrument":11,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/sequential-recommendation","prev":"/task/sequential-recommendation/papers/2","next":"/task/sequential-recommendation/papers/4","papers":[{"url":"/paper/frequency-enhanced-hybrid-attention-network","slug":"frequency-enhanced-hybrid-attention-network","title":"Frequency Enhanced Hybrid Attention Network for Sequential Recommendation","date":"2023-04-18","arxiv_id":"2304.09184","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/frequency-enhanced-hybrid-attention-network#ran","syntology_url":"https://syntology.ai/paper/2304.09184","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.09184"}},"official":{"repos":["sudaada/fearec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/attention-mixtures-for-time-aware-sequential","slug":"attention-mixtures-for-time-aware-sequential","title":"Attention Mixtures for Time-Aware Sequential Recommendation","date":"2023-04-17","arxiv_id":"2304.08158","repositories_listed":1,"syntology":null},{"url":"/paper/melt-mutual-enhancement-of-long-tailed-user","slug":"melt-mutual-enhancement-of-long-tailed-user","title":"MELT: Mutual Enhancement of Long-Tailed User and Item for Sequential Recommendation","date":"2023-04-17","arxiv_id":"2304.08382","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/melt-mutual-enhancement-of-long-tailed-user#ran","syntology_url":"https://syntology.ai/paper/2304.08382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.08382"}},"official":{"repos":["rlqja1107/melt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/meta-optimized-contrastive-learning-for","slug":"meta-optimized-contrastive-learning-for","title":"Meta-optimized Contrastive Learning for Sequential Recommendation","date":"2023-04-16","arxiv_id":"2304.07763","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-optimized-contrastive-learning-for#ran","syntology_url":"https://syntology.ai/paper/2304.07763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.07763"}},"official":{"repos":["qinhsiu/mclrec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-cross-domain-sequential","slug":"contrastive-cross-domain-sequential","title":"Contrastive Cross-Domain Sequential Recommendation","date":"2023-04-08","arxiv_id":"2304.03891","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-next-item-recommendation-using","slug":"zero-shot-next-item-recommendation-using","title":"Zero-Shot Next-Item Recommendation using Large Pretrained Language Models","date":"2023-04-06","arxiv_id":"2304.03153","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/zero-shot-next-item-recommendation-using#ran","syntology_url":"https://syntology.ai/paper/2304.03153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.03153"}},"official":null}},{"url":"/paper/diffurec-a-diffusion-model-for-sequential","slug":"diffurec-a-diffusion-model-for-sequential","title":"DiffuRec: A Diffusion Model for Sequential Recommendation","date":"2023-04-03","arxiv_id":"2304.00686","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/diffurec-a-diffusion-model-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2304.00686","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00686"}},"official":{"repos":["whuir/diffurec"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/easydgl-encode-train-and-interpret-for","slug":"easydgl-encode-train-and-interpret-for","title":"EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning","date":"2023-03-22","arxiv_id":"2303.12341","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/easydgl-encode-train-and-interpret-for#ran","syntology_url":"https://syntology.ai/paper/2303.12341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.12341"}},"official":{"repos":["cchao0116/EasyDGL"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/debiased-contrastive-learning-for-sequential","slug":"debiased-contrastive-learning-for-sequential","title":"Debiased Contrastive Learning for Sequential Recommendation","date":"2023-03-21","arxiv_id":"2303.11780","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/debiased-contrastive-learning-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2303.11780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.11780"}},"official":{"repos":["hkuds/dcrec"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dually-enhanced-propensity-score-estimation","slug":"dually-enhanced-propensity-score-estimation","title":"Dually Enhanced Propensity Score Estimation in Sequential Recommendation","date":"2023-03-15","arxiv_id":"2303.08722","repositories_listed":1,"syntology":null},{"url":"/paper/a-self-correcting-sequential-recommender","slug":"a-self-correcting-sequential-recommender","title":"A Self-Correcting Sequential Recommender","date":"2023-03-04","arxiv_id":"2303.02297","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-with-adaptive-weighted-loss-for","slug":"meta-learning-with-adaptive-weighted-loss-for","title":"Meta-Learning with Adaptive Weighted Loss for Imbalanced Cold-Start Recommendation","date":"2023-02-28","arxiv_id":"2302.14640","repositories_listed":1,"syntology":null},{"url":"/paper/dual-interest-factorization-heads-attention","slug":"dual-interest-factorization-heads-attention","title":"Dual-interest Factorization-heads Attention for Sequential Recommendation","date":"2023-02-08","arxiv_id":"2302.03965","repositories_listed":1,"syntology":null},{"url":"/paper/towards-lightweight-cross-domain-sequential","slug":"towards-lightweight-cross-domain-sequential","title":"Towards Lightweight Cross-domain Sequential Recommendation via External Attention-enhanced Graph Convolution Network","date":"2023-02-07","arxiv_id":"2302.03221","repositories_listed":1,"syntology":null},{"url":"/paper/mutual-wasserstein-discrepancy-minimization","slug":"mutual-wasserstein-discrepancy-minimization","title":"Mutual Wasserstein Discrepancy Minimization for Sequential Recommendation","date":"2023-01-28","arxiv_id":"2301.12197","repositories_listed":1,"syntology":null},{"url":"/paper/debiasing-the-cloze-task-in-sequential","slug":"debiasing-the-cloze-task-in-sequential","title":"Debiasing the Cloze Task in Sequential Recommendation with Bidirectional Transformers","date":"2023-01-22","arxiv_id":"2301.09210","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-sequential-recommendation-as-missing","slug":"modeling-sequential-recommendation-as-missing","title":"Modeling Sequential Recommendation as Missing Information Imputation","date":"2023-01-04","arxiv_id":"2301.01762","repositories_listed":1,"syntology":null},{"url":"/paper/effective-and-efficient-training-for-1","slug":"effective-and-efficient-training-for-1","title":"Improving Sequential Recommendation Models with an Enhanced Loss Function","date":"2023-01-03","arxiv_id":"2301.00979","repositories_listed":1,"syntology":null},{"url":"/paper/uniform-sequence-better-time-interval-aware","slug":"uniform-sequence-better-time-interval-aware","title":"Uniform Sequence Better: Time Interval Aware Data Augmentation for Sequential Recommendation","date":"2022-12-16","arxiv_id":"2212.08262","repositories_listed":1,"syntology":null},{"url":"/paper/equivariant-contrastive-learning-for","slug":"equivariant-contrastive-learning-for","title":"Equivariant Contrastive Learning for Sequential Recommendation","date":"2022-11-10","arxiv_id":"2211.05290","repositories_listed":1,"syntology":null},{"url":"/paper/one-person-one-model-learning-compound-router","slug":"one-person-one-model-learning-compound-router","title":"One Person, One Model--Learning Compound Router for Sequential Recommendation","date":"2022-11-05","arxiv_id":"2211.02824","repositories_listed":1,"syntology":null},{"url":"/paper/disentangling-past-future-modeling-in","slug":"disentangling-past-future-modeling-in","title":"Disentangling Past-Future Modeling in Sequential Recommendation via Dual Networks","date":"2022-10-26","arxiv_id":"2210.14577","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-recommendation-with-auxiliary-item","slug":"sequential-recommendation-with-auxiliary-item","title":"Sequential Recommendation with Auxiliary Item Relationships via Multi-Relational Transformer","date":"2022-10-24","arxiv_id":"2210.13572","repositories_listed":1,"syntology":null},{"url":"/paper/towards-out-of-distribution-sequential-event","slug":"towards-out-of-distribution-sequential-event","title":"Towards Out-of-Distribution Sequential Event Prediction: A Causal Treatment","date":"2022-10-24","arxiv_id":"2210.13005","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-out-of-distribution-sequential-event#ran","syntology_url":"https://syntology.ai/paper/2210.13005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13005"}},"official":{"repos":["chr26195/caseq"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dual-contrastive-network-for-sequential","slug":"dual-contrastive-network-for-sequential","title":"Mutual Harmony: Sequential Recommendation with Dual Contrastive Network","date":"2022-09-18","arxiv_id":"2209.08446","repositories_listed":1,"syntology":null},{"url":"/paper/parsrec-explainable-personalized-attention","slug":"parsrec-explainable-personalized-attention","title":"PARSRec: Explainable Personalized Attention-fused Recurrent Sequential Recommendation Using Session Partial Actions","date":"2022-09-16","arxiv_id":"2209.13015","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-learning-from-next-item-sequential","slug":"beyond-learning-from-next-item-sequential","title":"Beyond Learning from Next Item: Sequential Recommendation via Personalized Interest Sustainability","date":"2022-09-14","arxiv_id":"2209.06644","repositories_listed":1,"syntology":null},{"url":"/paper/metanetwork-a-task-agnostic-network","slug":"metanetwork-a-task-agnostic-network","title":"DUET: A Tuning-Free Device-Cloud Collaborative Parameters Generation Framework for Efficient Device Model Generalization","date":"2022-09-12","arxiv_id":"2209.05227","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-double-ascent-via-recurrent-neural","slug":"beyond-double-ascent-via-recurrent-neural","title":"Beyond Double Ascent via Recurrent Neural Tangent Kernel in Sequential Recommendation","date":"2022-09-08","arxiv_id":"2209.03735","repositories_listed":1,"syntology":null},{"url":"/paper/explanation-guided-contrastive-learning-for","slug":"explanation-guided-contrastive-learning-for","title":"Explanation Guided Contrastive Learning for Sequential Recommendation","date":"2022-09-03","arxiv_id":"2209.01347","repositories_listed":1,"syntology":null},{"url":"/paper/contrastvae-contrastive-variational","slug":"contrastvae-contrastive-variational","title":"ContrastVAE: Contrastive Variational AutoEncoder for Sequential Recommendation","date":"2022-08-27","arxiv_id":"2209.00456","repositories_listed":1,"syntology":null},{"url":"/paper/kuairand-an-unbiased-sequential","slug":"kuairand-an-unbiased-sequential","title":"KuaiRand: An Unbiased Sequential Recommendation Dataset with Randomly Exposed Videos","date":"2022-08-18","arxiv_id":"2208.08696","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-learning-with-bidirectional","slug":"contrastive-learning-with-bidirectional","title":"Contrastive Learning with Bidirectional Transformers for Sequential Recommendation","date":"2022-08-08","arxiv_id":"2208.03895","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-attentive-memory-network-for-click","slug":"sparse-attentive-memory-network-for-click","title":"Sparse Attentive Memory Network for Click-through Rate Prediction with Long Sequences","date":"2022-08-08","arxiv_id":"2208.04022","repositories_listed":1,"syntology":null},{"url":"/paper/ufnrec-utilizing-false-negative-samples-for","slug":"ufnrec-utilizing-false-negative-samples-for","title":"UFNRec: Utilizing False Negative Samples for Sequential Recommendation","date":"2022-08-08","arxiv_id":"2208.04116","repositories_listed":1,"syntology":null},{"url":"/paper/factorial-user-modeling-with-hierarchical","slug":"factorial-user-modeling-with-hierarchical","title":"Factorial User Modeling with Hierarchical Graph Neural Network for Enhanced Sequential Recommendation","date":"2022-07-27","arxiv_id":"2207.13262","repositories_listed":1,"syntology":null},{"url":"/paper/a-systematic-review-and-replicability-study","slug":"a-systematic-review-and-replicability-study","title":"A Systematic Review and Replicability Study of BERT4Rec for Sequential Recommendation","date":"2022-07-15","arxiv_id":"2207.07483","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-systematic-review-and-replicability-study#ran","syntology_url":"https://syntology.ai/paper/2207.07483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.07483"}},"official":{"repos":["asash/bert4rec_repro"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/multi-behavior-hypergraph-enhanced","slug":"multi-behavior-hypergraph-enhanced","title":"Multi-Behavior Hypergraph-Enhanced Transformer for Sequential Recommendation","date":"2022-07-12","arxiv_id":"2207.05584","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-behavior-hypergraph-enhanced#ran","syntology_url":"https://syntology.ai/paper/2207.05584","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.05584"}},"official":{"repos":["yuh-yang/mbht-kdd22"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/effective-and-efficient-training-for","slug":"effective-and-efficient-training-for","title":"Effective and Efficient Training for Sequential Recommendation using Recency Sampling","date":"2022-07-06","arxiv_id":"2207.02643","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-recommendation-model-for-next","slug":"sequential-recommendation-model-for-next","title":"Sequential Recommendation Model for Next Purchase Prediction","date":"2022-07-06","arxiv_id":"2207.06225","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-enhanced-shared","slug":"reinforcement-learning-enhanced-shared","title":"Reinforcement Learning-enhanced Shared-account Cross-domain Sequential Recommendation","date":"2022-06-16","arxiv_id":"2206.08088","repositories_listed":1,"syntology":null},{"url":"/paper/time-interval-enhanced-graph-neural-network","slug":"time-interval-enhanced-graph-neural-network","title":"Time Interval-enhanced Graph Neural Network for Shared-account Cross-domain Sequential Recommendation","date":"2022-06-16","arxiv_id":"2206.08050","repositories_listed":1,"syntology":null},{"url":"/paper/multi-behavior-sequential-recommendation-with","slug":"multi-behavior-sequential-recommendation-with","title":"Multi-Behavior Sequential Recommendation with Temporal Graph Transformer","date":"2022-06-06","arxiv_id":"2206.02687","repositories_listed":1,"syntology":null},{"url":"/paper/resact-reinforcing-long-term-engagement-in","slug":"resact-reinforcing-long-term-engagement-in","title":"ResAct: Reinforcing Long-term Engagement in Sequential Recommendation with Residual Actor","date":"2022-06-01","arxiv_id":"2206.02620","repositories_listed":1,"syntology":null},{"url":"/paper/ada-ranker-a-data-distribution-adaptive","slug":"ada-ranker-a-data-distribution-adaptive","title":"Ada-Ranker: A Data Distribution Adaptive Ranking Paradigm for Sequential Recommendation","date":"2022-05-22","arxiv_id":"2205.10775","repositories_listed":1,"syntology":null},{"url":"/paper/adamct-adaptive-mixture-of-cnn-transformer","slug":"adamct-adaptive-mixture-of-cnn-transformer","title":"AdaMCT: Adaptive Mixture of CNN-Transformer for Sequential Recommendation","date":"2022-05-18","arxiv_id":"2205.08776","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adamct-adaptive-mixture-of-cnn-transformer#ran","syntology_url":"https://syntology.ai/paper/2205.08776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.08776"}},"official":{"repos":["juyongjiang/adamct"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/selective-fairness-in-recommendation-via","slug":"selective-fairness-in-recommendation-via","title":"Selective Fairness in Recommendation via Prompts","date":"2022-05-10","arxiv_id":"2205.04682","repositories_listed":1,"syntology":null},{"url":"/paper/when-multi-level-meets-multi-interest-a-multi","slug":"when-multi-level-meets-multi-interest-a-multi","title":"When Multi-Level Meets Multi-Interest: A Multi-Grained Neural Model for Sequential Recommendation","date":"2022-05-03","arxiv_id":"2205.01286","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/when-multi-level-meets-multi-interest-a-multi#ran","syntology_url":"https://syntology.ai/paper/2205.01286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01286"}},"official":{"repos":["whuir/mgnm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/determinantal-point-process-likelihoods-for","slug":"determinantal-point-process-likelihoods-for","title":"Determinantal Point Process Likelihoods for Sequential Recommendation","date":"2022-04-25","arxiv_id":"2204.11562","repositories_listed":1,"syntology":null},{"url":"/paper/decoupled-side-information-fusion-for","slug":"decoupled-side-information-fusion-for","title":"Decoupled Side Information Fusion for Sequential Recommendation","date":"2022-04-23","arxiv_id":"2204.11046","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/decoupled-side-information-fusion-for#ran","syntology_url":"https://syntology.ai/paper/2204.11046","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.11046"}},"official":{"repos":["AIM-SE/DIF-SR"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/exploiting-session-information-in-bert-based","slug":"exploiting-session-information-in-bert-based","title":"Exploiting Session Information in BERT-based Session-aware Sequential Recommendation","date":"2022-04-22","arxiv_id":"2204.10851","repositories_listed":1,"syntology":null},{"url":"/paper/elecrec-training-sequential-recommenders-as","slug":"elecrec-training-sequential-recommenders-as","title":"ELECRec: Training Sequential Recommenders as Discriminators","date":"2022-04-05","arxiv_id":"2204.02011","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-dynamic-user-preference-via-1","slug":"modeling-dynamic-user-preference-via-1","title":"Modeling Dynamic User Preference via Dictionary Learning for Sequential Recommendation","date":"2022-04-02","arxiv_id":"2204.00752","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/modeling-dynamic-user-preference-via-1#ran","syntology_url":"https://syntology.ai/paper/2204.00752","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.00752"}},"official":{"repos":["cchao0116/S2PNM-TKDE2021"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-self-modulating-attention-in","slug":"learning-self-modulating-attention-in","title":"Learning Self-Modulating Attention in Continuous Time Space with Applications to Sequential Recommendation","date":"2022-03-30","arxiv_id":"2204.06517","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 2 unverified","sample_list":"/paper/learning-self-modulating-attention-in#ran","syntology_url":"https://syntology.ai/paper/2204.06517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.06517"}},"official":{"repos":["cchao0116/CTSMA-ICML21"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/improving-contrastive-learning-with-model","slug":"improving-contrastive-learning-with-model","title":"Improving Contrastive Learning with Model Augmentation","date":"2022-03-25","arxiv_id":"2203.15508","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-contrastive-learning-with-model#ran","syntology_url":"https://syntology.ai/paper/2203.15508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15508"}},"official":{"repos":["salesforce/srma"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/arerec-attentive-local-interaction-model-for","slug":"arerec-attentive-local-interaction-model-for","title":"ARERec: Attentive Local Interaction Model for Sequential Recommendation","date":"2022-03-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/intent-contrastive-learning-for-sequential","slug":"intent-contrastive-learning-for-sequential","title":"Intent Contrastive Learning for Sequential Recommendation","date":"2022-02-05","arxiv_id":"2202.02519","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/intent-contrastive-learning-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2202.02519","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.02519"}},"official":{"repos":["salesforce/iclrec"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficiently-maintaining-next-basket","slug":"efficiently-maintaining-next-basket","title":"Efficiently Maintaining Next Basket Recommendations under Additions and Deletions of Baskets and Items","date":"2022-01-27","arxiv_id":"2201.13313","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-recommendation-via-stochastic-self","slug":"sequential-recommendation-via-stochastic-self","title":"Sequential Recommendation via Stochastic Self-Attention","date":"2022-01-16","arxiv_id":"2201.06035","repositories_listed":1,"syntology":null},{"url":"/paper/cssr-a-context-aware-sequential-software","slug":"cssr-a-context-aware-sequential-software","title":"CSSR: A Context-Aware Sequential Software Service Recommendation Model","date":"2021-12-20","arxiv_id":"2112.10316","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-recommendation-with-bidirectional","slug":"sequential-recommendation-with-bidirectional","title":"Improving Sequential Recommendations via Bidirectional Temporal Data Augmentation with Pre-training","date":"2021-12-13","arxiv_id":"2112.06460","repositories_listed":1,"syntology":null},{"url":"/paper/recguru-adversarial-learning-of-generalized","slug":"recguru-adversarial-learning-of-generalized","title":"RecGURU: Adversarial Learning of Generalized User Representations for Cross-Domain Recommendation","date":"2021-11-19","arxiv_id":"2111.10093","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/recguru-adversarial-learning-of-generalized#ran","syntology_url":"https://syntology.ai/paper/2111.10093","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.10093"}},"official":{"repos":["chain123/recguru"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tea-a-sequential-recommendation-framework-via","slug":"tea-a-sequential-recommendation-framework-via","title":"TEA: A Sequential Recommendation Framework via Temporally Evolving Aggregations","date":"2021-11-14","arxiv_id":"2111.07378","repositories_listed":1,"syntology":null},{"url":"/paper/rl4rs-a-real-world-benchmark-for","slug":"rl4rs-a-real-world-benchmark-for","title":"RL4RS: A Real-World Dataset for Reinforcement Learning based Recommender System","date":"2021-10-18","arxiv_id":"2110.11073","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-modeling-with-multiple-attributes","slug":"sequential-modeling-with-multiple-attributes","title":"Sequential Modeling with Multiple Attributes for Watchlist Recommendation in E-Commerce","date":"2021-10-18","arxiv_id":"2110.11072","repositories_listed":1,"syntology":null},{"url":"/paper/learning-dual-dynamic-representations-on-time","slug":"learning-dual-dynamic-representations-on-time","title":"Learning Dual Dynamic Representations on Time-Sliced User-Item Interaction Graphs for Sequential Recommendation","date":"2021-09-24","arxiv_id":"2109.11790","repositories_listed":1,"syntology":null},{"url":"/paper/black-box-attacks-on-sequential-recommenders","slug":"black-box-attacks-on-sequential-recommenders","title":"Black-Box Attacks on Sequential Recommenders via Data-Free Model Extraction","date":"2021-09-01","arxiv_id":"2109.01165","repositories_listed":1,"syntology":null},{"url":"/paper/continuous-time-sequential-recommendation","slug":"continuous-time-sequential-recommendation","title":"Continuous-Time Sequential Recommendation with Temporal Graph Collaborative Transformer","date":"2021-08-14","arxiv_id":"2108.06625","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-self-supervised-sequential","slug":"contrastive-self-supervised-sequential","title":"Contrastive Self-supervised Sequential Recommendation with Robust Augmentation","date":"2021-08-14","arxiv_id":"2108.06479","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-recommendation-for-cold-start","slug":"sequential-recommendation-for-cold-start","title":"Sequential Recommendation for Cold-start Users with Meta Transitional Learning","date":"2021-07-13","arxiv_id":"2107.06427","repositories_listed":1,"syntology":null},{"url":"/paper/position-enhanced-and-time-aware-graph","slug":"position-enhanced-and-time-aware-graph","title":"Position-enhanced and Time-aware Graph Convolutional Network for Sequential Recommendations","date":"2021-07-12","arxiv_id":"2107.05235","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-recommendation-with-graph-neural","slug":"sequential-recommendation-with-graph-neural","title":"Sequential Recommendation with Graph Neural Networks","date":"2021-06-27","arxiv_id":"2106.14226","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-sequences-as-distributions-with","slug":"modeling-sequences-as-distributions-with","title":"Modeling Sequences as Distributions with Uncertainty for Sequential Recommendation","date":"2021-06-11","arxiv_id":"2106.06165","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-periodicity-and-interactivity-in","slug":"exploring-periodicity-and-interactivity-in","title":"Exploring Periodicity and Interactivity in Multi-Interest Framework for Sequential Recommendation","date":"2021-06-07","arxiv_id":"2106.04415","repositories_listed":1,"syntology":null},{"url":"/paper/dual-attentive-sequential-learning-for-cross","slug":"dual-attentive-sequential-learning-for-cross","title":"Dual Attentive Sequential Learning for Cross-Domain Click-Through Rate Prediction","date":"2021-06-05","arxiv_id":"2106.02768","repositories_listed":1,"syntology":null},{"url":"/paper/linear-time-self-attention-with-codeword","slug":"linear-time-self-attention-with-codeword","title":"Linear-Time Self Attention with Codeword Histogram for Efficient Recommendation","date":"2021-05-28","arxiv_id":"2105.14068","repositories_listed":1,"syntology":null},{"url":"/paper/augmenting-sequential-recommendation-with","slug":"augmenting-sequential-recommendation-with","title":"Augmenting Sequential Recommendation with Pseudo-Prior Items via Reversely Pre-training Transformer","date":"2021-05-02","arxiv_id":"2105.00522","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-neural-recommendation-from","slug":"a-survey-on-neural-recommendation-from","title":"A Survey on Accuracy-oriented Neural Recommendation: From Collaborative Filtering to Information-rich Recommendation","date":"2021-04-27","arxiv_id":"2104.13030","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-graph-neural-networks-for-sequential","slug":"dynamic-graph-neural-networks-for-sequential","title":"Dynamic Graph Neural Networks for Sequential Recommendation","date":"2021-04-15","arxiv_id":"2104.07368","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-and-contrastive-variational","slug":"adversarial-and-contrastive-variational","title":"Adversarial and Contrastive Variational Autoencoder for Sequential Recommendation","date":"2021-03-19","arxiv_id":"2103.10693","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-memory-based-attention-network-for","slug":"dynamic-memory-based-attention-network-for","title":"Dynamic Memory based Attention Network for Sequential Recommendation","date":"2021-02-18","arxiv_id":"2102.09269","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-interest-network-for-sequential","slug":"sparse-interest-network-for-sequential","title":"Sparse-Interest Network for Sequential Recommendation","date":"2021-02-18","arxiv_id":"2102.09267","repositories_listed":1,"syntology":null},{"url":"/paper/retagnn-relational-temporal-attentive-graph","slug":"retagnn-relational-temporal-attentive-graph","title":"RetaGNN: Relational Temporal Attentive Graph Neural Networks for Holistic Sequential Recommendation","date":"2021-01-29","arxiv_id":"2101.12457","repositories_listed":1,"syntology":null},{"url":"/paper/stackrec-efficient-training-of-very-deep","slug":"stackrec-efficient-training-of-very-deep","title":"StackRec: Efficient Training of Very Deep Sequential Recommender Models by Iterative Stacking","date":"2020-12-14","arxiv_id":"2012.07598","repositories_listed":1,"syntology":null},{"url":"/paper/katrec-knowledge-aware-attentive-sequential","slug":"katrec-knowledge-aware-attentive-sequential","title":"KATRec: Knowledge Aware aTtentive Sequential Recommendations","date":"2020-12-06","arxiv_id":"2012.03323","repositories_listed":1,"syntology":null},{"url":"/paper/mixed-information-flow-for-cross-domain","slug":"mixed-information-flow-for-cross-domain","title":"Mixed Information Flow for Cross-domain Sequential Recommendations","date":"2020-12-01","arxiv_id":"2012.00485","repositories_listed":1,"syntology":null},{"url":"/paper/recbole-towards-a-unified-comprehensive-and","slug":"recbole-towards-a-unified-comprehensive-and","title":"RecBole: Towards a Unified, Comprehensive and Efficient Framework for Recommendation Algorithms","date":"2020-11-03","arxiv_id":"2011.01731","repositories_listed":1,"syntology":null},{"url":"/paper/future-aware-diverse-trends-framework-for","slug":"future-aware-diverse-trends-framework-for","title":"Future-Aware Diverse Trends Framework for Recommendation","date":"2020-11-01","arxiv_id":"2011.00422","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-pre-training-for-sequential","slug":"contrastive-pre-training-for-sequential","title":"Contrastive Learning for Sequential Recommendation","date":"2020-10-27","arxiv_id":"2010.14395","repositories_listed":1,"syntology":null},{"url":"/paper/unclicked-user-behaviors-enhanced","slug":"unclicked-user-behaviors-enhanced","title":"XDM: Improving Sequential Deep Matching with Unclicked User Behaviors for Recommender System","date":"2020-10-24","arxiv_id":"2010.12837","repositories_listed":1,"syntology":null},{"url":"/paper/meantime-mixture-of-attention-mechanisms-with","slug":"meantime-mixture-of-attention-mechanisms-with","title":"MEANTIME: Mixture of Attention Mechanisms with Multi-temporal Embeddings for Sequential Recommendation","date":"2020-08-19","arxiv_id":"2008.08273","repositories_listed":1,"syntology":null},{"url":"/paper/a-generic-network-compression-framework-for","slug":"a-generic-network-compression-framework-for","title":"A Generic Network Compression Framework for Sequential Recommender Systems","date":"2020-04-21","arxiv_id":"2004.13139","repositories_listed":1,"syntology":null},{"url":"/paper/advances-in-collaborative-filtering-and","slug":"advances-in-collaborative-filtering-and","title":"Advances in Collaborative Filtering and Ranking","date":"2020-02-27","arxiv_id":"2002.12312","repositories_listed":1,"syntology":null},{"url":"/paper/memory-augmented-graph-neural-networks-for","slug":"memory-augmented-graph-neural-networks-for","title":"Memory Augmented Graph Neural Networks for Sequential Recommendation","date":"2019-12-26","arxiv_id":"1912.11730","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-recommendation-with-dual-side","slug":"sequential-recommendation-with-dual-side","title":"Sequential Recommendation with Dual Side Neighbor-based Collaborative Relation Modeling","date":"2019-11-10","arxiv_id":"1911.03883","repositories_listed":1,"syntology":null},{"url":"/paper/improving-end-to-end-sequential","slug":"improving-end-to-end-sequential","title":"Improving End-to-End Sequential Recommendations with Intent-aware Diversification","date":"2019-08-27","arxiv_id":"1908.10171","repositories_listed":1,"syntology":null},{"url":"/paper/190501997","slug":"190501997","title":"Deep Learning for Sequential Recommendation: Algorithms, Influential Factors, and Evaluations","date":"2019-04-30","arxiv_id":"1905.01997","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-context-enabled-recurrent-neural","slug":"hierarchical-context-enabled-recurrent-neural","title":"Hierarchical Context enabled Recurrent Neural Network for Recommendation","date":"2019-04-26","arxiv_id":"1904.12674","repositories_listed":1,"syntology":null},{"url":"/paper/mv-rnn-a-multi-view-recurrent-neural-network","slug":"mv-rnn-a-multi-view-recurrent-neural-network","title":"MV-RNN: A Multi-View Recurrent Neural Network for Sequential Recommendation","date":"2018-11-20","arxiv_id":"1611.06668","repositories_listed":1,"syntology":null},{"url":"/paper/a-hierarchical-contextual-attention-based-gru","slug":"a-hierarchical-contextual-attention-based-gru","title":"A Hierarchical Contextual Attention-based GRU Network for Sequential Recommendation","date":"2017-11-14","arxiv_id":"1711.05114","repositories_listed":1,"syntology":null}],"record_sha256":"19432ad54fd000ea6dfd81580e2666a6abdf62d867f4c599529f9c63efc7aecc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}