{"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":"/method/lightgcn","slug":"lightgcn","name":"LightGCN","full_name":"LightGCN","full_name_withheld":false,"description_markdown":"**LightGCN** is a type of [graph convolutional neural network](https://paperswithcode.com/method/gcn) (GCN), including only the most essential component in GCN (neighborhood aggregation) for collaborative filtering. Specifically, LightGCN learns user and item embeddings by linearly propagating them on the user-item interaction graph, and uses the weighted sum of the embeddings learned at all layers as the final embedding.","description_state":"present","introduced_year":null,"introduced_by":{"title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","paper":"/paper/lightgcn-simplifying-and-powering-graph","first_author":"Xiangnan He","n_authors":6,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/lightgcn-simplifying-and-powering-graph"},"source":{"url":"https://arxiv.org/abs/2002.02126v4","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Models","url":"/methods/category/graph-models","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Recommendation Systems","url":"/methods/category/recommendation-systems","pwc_aliases":[]}],"n_papers_tagged":46,"archive_num_papers":46,"papers_newest_first":[{"paper":"/paper/improvement-graph-convolution-collaborative","slug":"improvement-graph-convolution-collaborative","title":"Improvement Graph Convolution Collaborative Filtering with Weighted addition input","date":"2025-03-27","arxiv_id":"2503.21468","n_code_links":1,"syntology":null},{"paper":null,"slug":"rolling-forward-enhancing-lightgcn-with","title":"Rolling Forward: Enhancing LightGCN with Causal Graph Convolution for Credit Bond Recommendation","date":"2025-03-18","arxiv_id":"2503.14213","n_code_links":0,"syntology":null},{"paper":null,"slug":"hypergraph-diffusion-for-high-order","title":"Hypergraph Diffusion for High-Order Recommender Systems","date":"2025-01-28","arxiv_id":"2501.16722","n_code_links":0,"syntology":null},{"paper":"/paper/graph-neural-controlled-differential-1","slug":"graph-neural-controlled-differential-1","title":"Graph Neural Controlled Differential Equations For Collaborative Filtering","date":"2025-01-23","arxiv_id":"2501.13908","n_code_links":1,"syntology":null},{"paper":null,"slug":"position-aware-graph-transformer-for","title":"Position-aware Graph Transformer for Recommendation","date":"2024-12-25","arxiv_id":"2412.18731","n_code_links":0,"syntology":null},{"paper":"/paper/a-novel-evaluation-perspective-on-gnns-based","slug":"a-novel-evaluation-perspective-on-gnns-based","title":"A Novel Evaluation Perspective on GNNs-based Recommender Systems through the Topology of the User-Item Graph","date":"2024-08-21","arxiv_id":"2408.11762","n_code_links":1,"syntology":null},{"paper":"/paper/bundle-recommendation-with-item-level","slug":"bundle-recommendation-with-item-level","title":"Bundle Recommendation with Item-level Causation-enhanced Multi-view Learning","date":"2024-08-13","arxiv_id":"2408.08906","n_code_links":1,"syntology":null},{"paper":"/paper/simce-simplifying-cross-entropy-loss-for","slug":"simce-simplifying-cross-entropy-loss-for","title":"SimCE: Simplifying Cross-Entropy Loss for Collaborative Filtering","date":"2024-06-23","arxiv_id":"2406.16170","n_code_links":1,"syntology":null},{"paper":"/paper/balancing-embedding-spectrum-for","slug":"balancing-embedding-spectrum-for","title":"Balancing Embedding Spectrum for Recommendation","date":"2024-06-17","arxiv_id":"2406.12032","n_code_links":1,"syntology":null},{"paper":null,"slug":"wasserstein-dependent-graph-attention-network","title":"Wasserstein Dependent Graph Attention Network for Collaborative Filtering with Uncertainty","date":"2024-04-09","arxiv_id":"2404.05962","n_code_links":0,"syntology":null},{"paper":"/paper/lightgcn-evaluated-and-enhanced","slug":"lightgcn-evaluated-and-enhanced","title":"LightGCN: Evaluated and Enhanced","date":"2023-12-17","arxiv_id":"2312.16183","n_code_links":1,"syntology":null},{"paper":"/paper/vm-rec-a-variational-mapping-approach-for","slug":"vm-rec-a-variational-mapping-approach-for","title":"VM-Rec: A Variational Mapping Approach for Cold-start User Recommendation","date":"2023-11-02","arxiv_id":"2311.01304","n_code_links":1,"syntology":null},{"paper":"/paper/a-topology-aware-analysis-of-graph","slug":"a-topology-aware-analysis-of-graph","title":"A Topology-aware Analysis of Graph Collaborative Filtering","date":"2023-08-21","arxiv_id":"2308.10778","n_code_links":1,"syntology":null},{"paper":"/paper/toward-a-better-understanding-of-loss","slug":"toward-a-better-understanding-of-loss","title":"Toward a Better Understanding of Loss Functions for Collaborative Filtering","date":"2023-08-11","arxiv_id":"2308.06091","n_code_links":1,"syntology":null},{"paper":"/paper/challenging-the-myth-of-graph-collaborative","slug":"challenging-the-myth-of-graph-collaborative","title":"Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis","date":"2023-08-01","arxiv_id":"2308.00404","n_code_links":1,"syntology":null},{"paper":null,"slug":"gnn4fr-a-lossless-gnn-based-federated","title":"GNN4FR: A Lossless GNN-based Federated Recommendation Framework","date":"2023-07-25","arxiv_id":"2308.01197","n_code_links":0,"syntology":null},{"paper":"/paper/how-graph-convolutions-amplify-popularity","slug":"how-graph-convolutions-amplify-popularity","title":"How Graph Convolutions Amplify Popularity Bias for Recommendation?","date":"2023-05-24","arxiv_id":"2305.14886","n_code_links":1,"syntology":null},{"paper":null,"slug":"retraining-a-graph-based-recommender-with","title":"Retraining A Graph-based Recommender with Interests Disentanglement","date":"2023-05-05","arxiv_id":"2305.03624","n_code_links":0,"syntology":null},{"paper":"/paper/towards-explainable-collaborative-filtering","slug":"towards-explainable-collaborative-filtering","title":"Towards Explainable Collaborative Filtering with Taste Clusters Learning","date":"2023-04-27","arxiv_id":"2304.13937","n_code_links":1,"syntology":null},{"paper":"/paper/dual-policy-learning-for-aggregation","slug":"dual-policy-learning-for-aggregation","title":"Dual Policy Learning for Aggregation Optimization in Graph Neural Network-based Recommender Systems","date":"2023-02-21","arxiv_id":"2302.10567","n_code_links":1,"syntology":null},{"paper":"/paper/bring-your-own-view-graph-neural-networks-for","slug":"bring-your-own-view-graph-neural-networks-for","title":"Bring Your Own View: Graph Neural Networks for Link Prediction with Personalized Subgraph Selection","date":"2022-12-23","arxiv_id":"2212.12488","n_code_links":1,"syntology":null},{"paper":"/paper/mdgcf-multi-dependency-graph-collaborative","slug":"mdgcf-multi-dependency-graph-collaborative","title":"MDGCF: Multi-Dependency Graph Collaborative Filtering with Neighborhood- and Homogeneous-level Dependencies","date":"2022-10-17","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"efficient-graph-based-recommender-system-with","title":"Efficient Graph based Recommender System with Weighted Averaging of Messages","date":"2022-09-30","arxiv_id":"2209.15238","n_code_links":0,"syntology":null},{"paper":"/paper/rethinking-missing-data-aleatoric-uncertainty","slug":"rethinking-missing-data-aleatoric-uncertainty","title":"Rethinking Missing Data: Aleatoric Uncertainty-Aware Recommendation","date":"2022-09-22","arxiv_id":"2209.11679","n_code_links":1,"syntology":null},{"paper":"/paper/svd-gcn-a-simplified-graph-convolution","slug":"svd-gcn-a-simplified-graph-convolution","title":"SVD-GCN: A Simplified Graph Convolution Paradigm for Recommendation","date":"2022-08-26","arxiv_id":"2208.12689","n_code_links":1,"syntology":null},{"paper":"/paper/collaboration-aware-graph-convolutional","slug":"collaboration-aware-graph-convolutional","title":"Collaboration-Aware Graph Convolutional Network for Recommender Systems","date":"2022-07-03","arxiv_id":"2207.06221","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"0 ran · 1 unverified","official":{"repos":["yuwvandy/cagcn"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":"/paper/hypergraph-contrastive-collaborative","slug":"hypergraph-contrastive-collaborative","title":"Hypergraph Contrastive Collaborative Filtering","date":"2022-04-26","arxiv_id":"2204.12200","n_code_links":1,"syntology":null},{"paper":"/paper/less-is-more-reweighting-important-spectral","slug":"less-is-more-reweighting-important-spectral","title":"Less is More: Reweighting Important Spectral Graph Features for Recommendation","date":"2022-04-24","arxiv_id":"2204.11346","n_code_links":1,"syntology":null},{"paper":"/paper/recommender-may-not-favor-loyal-users","slug":"recommender-may-not-favor-loyal-users","title":"Do Loyal Users Enjoy Better Recommendations? Understanding Recommender Accuracy from a Time Perspective","date":"2022-04-12","arxiv_id":"2204.05927","n_code_links":1,"syntology":null},{"paper":"/paper/ia-gcn-interactive-graph-convolutional","slug":"ia-gcn-interactive-graph-convolutional","title":"IA-GCN: Interactive Graph Convolutional Network for Recommendation","date":"2022-04-08","arxiv_id":"2204.03827","n_code_links":1,"syntology":null},{"paper":"/paper/mgdcf-distance-learning-via-markov-graph","slug":"mgdcf-distance-learning-via-markov-graph","title":"MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering","date":"2022-04-05","arxiv_id":"2204.02338","n_code_links":2,"syntology":null},{"paper":null,"slug":"revisiting-neighborhood-based-link-prediction","title":"Revisiting Neighborhood-based Link Prediction for Collaborative Filtering","date":"2022-03-29","arxiv_id":"2203.15789","n_code_links":0,"syntology":null},{"paper":"/paper/region-or-global-a-principle-for-negative","slug":"region-or-global-a-principle-for-negative","title":"Region or Global? A Principle for Negative Sampling in Graph-based Recommendation","date":"2022-03-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"supervised-contrastive-learning-for-2","title":"Supervised Contrastive Learning for Recommendation","date":"2022-01-10","arxiv_id":"2201.03144","n_code_links":0,"syntology":null},{"paper":"/paper/ultragcn-ultra-simplification-of-graph","slug":"ultragcn-ultra-simplification-of-graph","title":"UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation","date":"2021-10-28","arxiv_id":"2110.15114","n_code_links":2,"syntology":null},{"paper":"/paper/how-powerful-is-graph-convolution-for","slug":"how-powerful-is-graph-convolution-for","title":"How Powerful is Graph Convolution for Recommendation?","date":"2021-08-17","arxiv_id":"2108.07567","n_code_links":1,"syntology":null},{"paper":"/paper/lt-ocf-learnable-time-ode-based-collaborative","slug":"lt-ocf-learnable-time-ode-based-collaborative","title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","date":"2021-08-08","arxiv_id":"2108.06208","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"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) · 0 unverified","official":{"repos":["jeongwhanchoi/lt-ocf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/exploring-lottery-ticket-hypothesis-in-media","slug":"exploring-lottery-ticket-hypothesis-in-media","title":"Exploring Lottery Ticket Hypothesis in Media Recommender Systems","date":"2021-08-02","arxiv_id":"2108.00944","n_code_links":1,"syntology":null},{"paper":"/paper/inductive-representation-based-graph","slug":"inductive-representation-based-graph","title":"INMO: A Model-Agnostic and Scalable Module for Inductive Collaborative Filtering","date":"2021-07-12","arxiv_id":"2107.05247","n_code_links":1,"syntology":null},{"paper":null,"slug":"graph-neural-pre-training-for-enhancing","title":"Graph Neural Pre-training for Enhancing Recommendations using Side Information","date":"2021-07-08","arxiv_id":"2107.03936","n_code_links":0,"syntology":null},{"paper":null,"slug":"leveraging-two-types-of-global-graph-for","title":"Leveraging Two Types of Global Graph for Sequential Fashion Recommendation","date":"2021-05-17","arxiv_id":"2105.07585","n_code_links":0,"syntology":null},{"paper":"/paper/interest-aware-message-passing-gcn-for","slug":"interest-aware-message-passing-gcn-for","title":"Interest-aware Message-Passing GCN for Recommendation","date":"2021-02-19","arxiv_id":"2102.10044","n_code_links":1,"syntology":null},{"paper":null,"slug":"user-embedding-based-neighborhood-aggregation","title":"User Embedding based Neighborhood Aggregation Method for Inductive Recommendation","date":"2021-02-15","arxiv_id":"2102.07575","n_code_links":0,"syntology":null},{"paper":"/paper/model-agnostic-counterfactual-reasoning-for","slug":"model-agnostic-counterfactual-reasoning-for","title":"Model-Agnostic Counterfactual Reasoning for Eliminating Popularity Bias in Recommender System","date":"2020-10-29","arxiv_id":"2010.15363","n_code_links":1,"syntology":null},{"paper":"/paper/self-supervised-graph-learning-for","slug":"self-supervised-graph-learning-for","title":"Self-supervised Graph Learning for Recommendation","date":"2020-10-21","arxiv_id":"2010.10783","n_code_links":3,"syntology":null},{"paper":"/paper/lightgcn-simplifying-and-powering-graph","slug":"lightgcn-simplifying-and-powering-graph","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","date":"2020-02-06","arxiv_id":"2002.02126","n_code_links":18,"syntology":{"ran":6,"of":7,"n_ran_checked":4,"n_instrument":2,"unverified":1,"pointer_only":2,"phrase":"6 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; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["gusye1234/pytorch-light-gcn","kuandeng/LightGCN"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}}],"papers_shown":46,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":46,"with_a_code_link":34,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":46,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/method/lightgcn/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/lightgcn/papers/ran/1","json":"/method/lightgcn/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":36},{"task":"/task/collaborative-filtering","name":"Collaborative Filtering","papers":25},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":5},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":4},{"task":"/task/representation-learning","name":"Representation Learning","papers":4},{"task":"/task/self-supervised-learning","name":"Self-Supervised Learning","papers":3},{"task":"/task/graph-attention","name":"Graph Attention","papers":2},{"task":"/task/graph-classification","name":"Graph Classification","papers":2},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":2},{"task":"/task/link-prediction","name":"Link Prediction","papers":2},{"task":"/task/multi-modal-recommendation","name":"Multi-modal Recommendation","papers":2},{"task":"/task/counterfactual-inference","name":"Counterfactual Inference","papers":1},{"task":"/task/counterfactual-reasoning","name":"Counterfactual Reasoning","papers":1},{"task":"/task/decision-making","name":"Decision Making","papers":1},{"task":"/task/denoising","name":"Denoising","papers":1},{"task":"/task/disentanglement","name":"Disentanglement","papers":1},{"task":"/task/entity-embeddings","name":"Entity Embeddings","papers":1},{"task":"/task/graph-learning","name":"Graph Learning","papers":1},{"task":"/task/graph-sampling","name":"Graph Sampling","papers":1},{"task":"/task/incremental-learning","name":"Incremental Learning","papers":1}],"tasks_shown":20,"n_tasks":30,"usage_by_year":[{"year":"2020","papers":3},{"year":"2021","papers":9},{"year":"2022","papers":14},{"year":"2023","papers":10},{"year":"2024","papers":6},{"year":"2025","papers":4}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/lightgcn"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=LightGCN","read_at":"2026-10-05T00:58:32+00:00","query":"LightGCN","kind":"paper","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"2002.02126","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"unresolved_bearers","may_be_wrong_sense":true,"bearers_found":2,"served":null,"leading_other_bearer":{"arxiv_id":"2002.02126","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","citations":5614,"named_by":["title_prefix"],"bearer_name":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","ask_with":"have('2002.02126')"},"n_other_bearers_listed":2,"note":"Nothing resolved to 'LightGCN' by name, but 2 thing(s) here DECLARE that name -- most cited: the paper 'LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation' (arXiv:2002.02126, 5,614 citations). That is a RESOLUTION miss, not a coverage gap: the corpus holds the name under a spelling the lookup did not reach. Ask again with an entry of `also_named`."},"name_competition_text":"Nothing resolved to this name, but 2 entries in Syntology's graph carry it; the most cited is the paper “LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation” (arXiv:2002.02126, 5,614 citations). The lookup reads this as a miss of its own name matching, not a gap in coverage: the graph holds the name under a spelling the lookup did not reach.","near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). Other entries in Syntology's graph carry this name; the lookup's note below says what that means for this name.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"2fda2aab73e721dc4e49b938dd6b3f97d380421bb97b24e8c4e9c7b68f358a38","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}