{"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/graph-learning/papers/10","list_of":"/task/graph-learning","task":"Graph Learning","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":10,"pages_in_order":16,"rows_per_page":100,"rows":[901,1000],"of":1570,"counts":{"archive_papers_tagged":1570,"with_a_code_link":686,"where_syntology_ran_a_sample":193,"not_listed_spam_title":0,"listed":1570,"listed_where_code_ran":193,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":162,"every_run_a_failure_of_syntologys_instrument":31,"listed_with_a_run_with_no_instrument_failure":162,"listed_every_run_a_failure_of_syntologys_instrument":31,"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/graph-learning","prev":"/task/graph-learning/papers/9","next":"/task/graph-learning/papers/11","papers":[{"url":null,"slug":"2408-02705","title":"PSNE: Efficient Spectral Sparsification Algorithms for Scaling Network Embedding","date":"2024-08-05","arxiv_id":"2408.02705","repositories_listed":0,"syntology":null},{"url":null,"slug":"co-neighbor-encoding-schema-a-light-cost","title":"Co-Neighbor Encoding Schema: A Light-cost Structure Encoding Method for Dynamic Link Prediction","date":"2024-07-30","arxiv_id":"2407.20871","repositories_listed":0,"syntology":null},{"url":null,"slug":"revgnn-negative-sampling-enhanced-contrastive","title":"RevGNN: Negative Sampling Enhanced Contrastive Graph Learning for Academic Reviewer Recommendation","date":"2024-07-30","arxiv_id":"2407.20684","repositories_listed":0,"syntology":null},{"url":null,"slug":"unveiling-the-potential-of-spiking-dynamics","title":"Unveiling the Potential of Spiking Dynamics in Graph Representation Learning through Spatial-Temporal Normalization and Coding Strategies","date":"2024-07-30","arxiv_id":"2407.20508","repositories_listed":0,"syntology":null},{"url":null,"slug":"gene-regulatory-network-inference-from-pre","title":"Gene Regulatory Network Inference from Pre-trained Single-Cell Transcriptomics Transformer with Joint Graph Learning","date":"2024-07-25","arxiv_id":"2407.18181","repositories_listed":0,"syntology":null},{"url":null,"slug":"sma-hyper-spatiotemporal-multi-view-fusion","title":"SMA-Hyper: Spatiotemporal Multi-View Fusion Hypergraph Learning for Traffic Accident Prediction","date":"2024-07-24","arxiv_id":"2407.17642","repositories_listed":0,"syntology":null},{"url":null,"slug":"masked-graph-learning-with-recurrent","title":"Masked Graph Learning with Recurrent Alignment for Multimodal Emotion Recognition in Conversation","date":"2024-07-23","arxiv_id":"2407.16714","repositories_listed":0,"syntology":null},{"url":null,"slug":"unifying-invariant-and-variant-features-for","title":"Unifying Invariant and Variant Features for Graph Out-of-Distribution via Probability of Necessity and Sufficiency","date":"2024-07-21","arxiv_id":"2407.15273","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-against-some-efficient-integration-of","title":"All Against Some: Efficient Integration of Large Language Models for Message Passing in Graph Neural Networks","date":"2024-07-20","arxiv_id":"2407.14996","repositories_listed":0,"syntology":null},{"url":null,"slug":"subgraph-clustering-and-atom-learning-for","title":"Subgraph Clustering and Atom Learning for Improved Image Classification","date":"2024-07-20","arxiv_id":"2407.14772","repositories_listed":0,"syntology":null},{"url":null,"slug":"torchgt-a-holistic-system-for-large-scale","title":"TorchGT: A Holistic System for Large-scale Graph Transformer Training","date":"2024-07-19","arxiv_id":"2407.14106","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-benchmark-for-fairness-aware-graph-learning","title":"A Benchmark for Fairness-Aware Graph Learning","date":"2024-07-16","arxiv_id":"2407.12112","repositories_listed":0,"syntology":null},{"url":null,"slug":"spreadfgl-edge-client-collaborative-federated","title":"SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation","date":"2024-07-14","arxiv_id":"2407.11085","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-transformers-a-survey","title":"Graph Transformers: A Survey","date":"2024-07-13","arxiv_id":"2407.09777","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-heterophilic-graph-learning-handbook","title":"The Heterophilic Graph Learning Handbook: Benchmarks, Models, Theoretical Analysis, Applications and Challenges","date":"2024-07-12","arxiv_id":"2407.09618","repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-conditional-diffusion-based-data","title":"Latent Conditional Diffusion-based Data Augmentation for Continuous-Time Dynamic Graph Model","date":"2024-07-11","arxiv_id":"2407.08500","repositories_listed":0,"syntology":null},{"url":null,"slug":"slrl-structured-latent-representation","title":"SLRL: Structured Latent Representation Learning for Multi-view Clustering","date":"2024-07-11","arxiv_id":"2407.08340","repositories_listed":0,"syntology":null},{"url":null,"slug":"gtp-4o-modality-prompted-heterogeneous-graph","title":"GTP-4o: Modality-prompted Heterogeneous Graph Learning for Omni-modal Biomedical Representation","date":"2024-07-08","arxiv_id":"2407.05540","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-graph-intelligence-reciprocally","title":"Edge Graph Intelligence: Reciprocally Empowering Edge Networks with Graph Intelligence","date":"2024-07-07","arxiv_id":"2407.15320","repositories_listed":0,"syntology":null},{"url":null,"slug":"foundations-and-frontiers-of-graph-learning","title":"Foundations and Frontiers of Graph Learning Theory","date":"2024-07-03","arxiv_id":"2407.03125","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-knowledge-graph-learning-in","title":"Automated Knowledge Graph Learning in Industrial Processes","date":"2024-07-02","arxiv_id":"2407.02106","repositories_listed":0,"syntology":null},{"url":null,"slug":"designing-machine-learning-tools-to","title":"Understanding Multistationarity of Fully Open Reaction Networks","date":"2024-07-01","arxiv_id":"2407.01760","repositories_listed":0,"syntology":null},{"url":null,"slug":"unrolling-plug-and-play-gradient-graph","title":"Unrolling Plug-and-Play Gradient Graph Laplacian Regularizer for Image Restoration","date":"2024-07-01","arxiv_id":"2407.01469","repositories_listed":0,"syntology":null},{"url":null,"slug":"amplify-graph-learning-for-recommendation-via","title":"Amplify Graph Learning for Recommendation via Sparsity Completion","date":"2024-06-27","arxiv_id":"2406.18984","repositories_listed":0,"syntology":null},{"url":null,"slug":"light-weight-end-to-end-graph-interest","title":"Light-weight End-to-End Graph Interest Network for CTR Prediction in E-commerce Search","date":"2024-06-25","arxiv_id":"2406.17745","repositories_listed":0,"syntology":null},{"url":null,"slug":"multimodal-graph-benchmark","title":"Mosaic of Modalities: A Comprehensive Benchmark for Multimodal Graph Learning","date":"2024-06-24","arxiv_id":"2406.16321","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-edge-representation-via-tensor-product","title":"Graph Edge Representation via Tensor Product Graph Convolutional Representation","date":"2024-06-21","arxiv_id":"2406.14846","repositories_listed":0,"syntology":null},{"url":null,"slug":"sketch-gnn-scalable-graph-neural-networks","title":"Sketch-GNN: Scalable Graph Neural Networks with Sublinear Training Complexity","date":"2024-06-21","arxiv_id":"2406.15575","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-scalable-and-effective-alternative-to-graph","title":"A Scalable and Effective Alternative to Graph Transformers","date":"2024-06-17","arxiv_id":"2406.12059","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comprehensive-survey-of-foundation-models","title":"A Comprehensive Survey of Foundation Models in Medicine","date":"2024-06-15","arxiv_id":"2406.10729","repositories_listed":0,"syntology":null},{"url":null,"slug":"dcdilp-a-distributed-learning-method-for","title":"DCILP: A Distributed Approach for Large-Scale Causal Structure Learning","date":"2024-06-15","arxiv_id":"2406.10481","repositories_listed":0,"syntology":null},{"url":null,"slug":"dataset-condensation-with-latent-quantile","title":"Dataset Condensation with Latent Quantile Matching","date":"2024-06-14","arxiv_id":"2406.09860","repositories_listed":0,"syntology":null},{"url":"/paper/a-flexible-equivariant-framework-for-subgraph","slug":"a-flexible-equivariant-framework-for-subgraph","title":"A Flexible, Equivariant Framework for Subgraph GNNs via Graph Products and Graph Coarsening","date":"2024-06-13","arxiv_id":"2406.09291","repositories_listed":0,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":12,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 1 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-flexible-equivariant-framework-for-subgraph#ran","syntology_url":"https://syntology.ai/paper/2406.09291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09291"}},"official":null}},{"url":null,"slug":"schur-s-positive-definite-network-deep","title":"Schur's Positive-Definite Network: Deep Learning in the SPD cone with structure","date":"2024-06-13","arxiv_id":"2406.09023","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-graph-neural-network-for-1","title":"Self-supervised Graph Neural Network for Mechanical CAD Retrieval","date":"2024-06-13","arxiv_id":"2406.08863","repositories_listed":0,"syntology":null},{"url":null,"slug":"gpt4rec-graph-prompt-tuning-for-streaming","title":"GPT4Rec: Graph Prompt Tuning for Streaming Recommendation","date":"2024-06-12","arxiv_id":"2406.08229","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-transductive-defense-a-two-stage","title":"Graph Transductive Defense: a Two-Stage Defense for Graph Membership Inference Attacks","date":"2024-06-12","arxiv_id":"2406.07917","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-holder-stability-of-multiset-and-graph","title":"On the Hölder Stability of Multiset and Graph Neural Networks","date":"2024-06-11","arxiv_id":"2406.06984","repositories_listed":0,"syntology":null},{"url":null,"slug":"gkan-graph-kolmogorov-arnold-networks","title":"GKAN: Graph Kolmogorov-Arnold Networks","date":"2024-06-10","arxiv_id":"2406.06470","repositories_listed":0,"syntology":null},{"url":null,"slug":"async-learned-user-embeddings-for-ads","title":"Async Learned User Embeddings for Ads Delivery Optimization","date":"2024-06-09","arxiv_id":"2406.05898","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-manifold-perspective-on-the-statistical","title":"A Manifold Perspective on the Statistical Generalization of Graph Neural Networks","date":"2024-06-07","arxiv_id":"2406.05225","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-link-prediction-to-forecasting","title":"From Link Prediction to Forecasting: Information Loss in Batch-based Temporal Graph Learning","date":"2024-06-07","arxiv_id":"2406.04897","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-mining-under-data-scarcity","title":"Graph Mining under Data scarcity","date":"2024-06-07","arxiv_id":"2406.04825","repositories_listed":0,"syntology":null},{"url":null,"slug":"higher-order-structure-based-anomaly","title":"Higher-order Structure Based Anomaly Detection on Attributed Networks","date":"2024-06-07","arxiv_id":"2406.04690","repositories_listed":0,"syntology":null},{"url":null,"slug":"pandora-deep-graph-learning-based-covid-19","title":"PANDORA: Deep graph learning based COVID-19 infection risk level forecasting","date":"2024-06-07","arxiv_id":"2406.06618","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-lightweight-transformer-via","title":"Interpretable Lightweight Transformer via Unrolling of Learned Graph Smoothness Priors","date":"2024-06-06","arxiv_id":"2406.04090","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-higher-order-structures-in-graph","title":"Higher Order Structures For Graph Explanations","date":"2024-06-05","arxiv_id":"2406.03253","repositories_listed":0,"syntology":null},{"url":null,"slug":"dfa-gnn-forward-learning-of-graph-neural","title":"DFA-GNN: Forward Learning of Graph Neural Networks by Direct Feedback Alignment","date":"2024-06-04","arxiv_id":"2406.02040","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-graph-learning-recurrent-neural","title":"Temporal Graph Learning Recurrent Neural Network for Traffic Forecasting","date":"2024-06-04","arxiv_id":"2406.02726","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-improves-the-generalization-of-graph","title":"What Improves the Generalization of Graph Transformers? A Theoretical Dive into the Self-attention and Positional Encoding","date":"2024-06-04","arxiv_id":"2406.01977","repositories_listed":0,"syntology":null},{"url":null,"slug":"llm-and-gnn-are-complementary-distilling-llm","title":"LLM and GNN are Complementary: Distilling LLM for Multimodal Graph Learning","date":"2024-06-03","arxiv_id":"2406.01032","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-for-brain-graph","title":"Graph Neural Networks for Brain Graph Learning: A Survey","date":"2024-06-01","arxiv_id":"2406.02594","repositories_listed":0,"syntology":null},{"url":null,"slug":"fugnn-harmonizing-fairness-and-utility-in","title":"FUGNN: Harmonizing Fairness and Utility in Graph Neural Networks","date":"2024-05-27","arxiv_id":"2405.17034","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-condensation-for-open-world-graph","title":"Graph Condensation for Open-World Graph Learning","date":"2024-05-27","arxiv_id":"2405.17003","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothgnn-smoothing-based-gnn-for","title":"SmoothGNN: Smoothing-aware GNN for Unsupervised Node Anomaly Detection","date":"2024-05-27","arxiv_id":"2405.17525","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-geospatial-region-embedding-with","title":"Learning Geospatial Region Embedding with Heterogeneous Graph","date":"2024-05-23","arxiv_id":"2405.14135","repositories_listed":0,"syntology":null},{"url":null,"slug":"hetegraph-mamba-heterogeneous-graph-learning","title":"HeteGraph-Mamba: Heterogeneous Graph Learning via Selective State Space Model","date":"2024-05-22","arxiv_id":"2405.13915","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-free-multi-domain-graph-pre-training","title":"Text-Free Multi-domain Graph Pre-training: Toward Graph Foundation Models","date":"2024-05-22","arxiv_id":"2405.13934","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-spatio-temporal-embedding-for","title":"Interpretable Spatio-Temporal Embedding for Brain Structural-Effective Network with Ordinary Differential Equation","date":"2024-05-21","arxiv_id":"2405.13190","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-graph-contrastive-learning-a-survey","title":"Towards Graph Contrastive Learning: A Survey and Beyond","date":"2024-05-20","arxiv_id":"2405.11868","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-graph-condensation-with-information","title":"Federated Graph Condensation with Information Bottleneck Principles","date":"2024-05-07","arxiv_id":"2405.03911","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-graph-learning-for-ev-charging","title":"Federated Graph Learning for EV Charging Demand Forecasting with Personalization Against Cyberattacks","date":"2024-04-30","arxiv_id":"2405.00742","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-the-fairness-divide-achieving-group","title":"Bridging the Fairness Divide: Achieving Group and Individual Fairness in Graph Neural Networks","date":"2024-04-26","arxiv_id":"2404.17511","repositories_listed":0,"syntology":null},{"url":null,"slug":"cosd-collaborative-stance-detection-with","title":"CoSD: Collaborative Stance Detection with Contrastive Heterogeneous Topic Graph Learning","date":"2024-04-26","arxiv_id":"2404.17609","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-large-language-models-on","title":"A Survey of Large Language Models on Generative Graph Analytics: Query, Learning, and Applications","date":"2024-04-23","arxiv_id":"2404.14809","repositories_listed":0,"syntology":null},{"url":null,"slug":"cnn2gnn-how-to-bridge-cnn-with-gnn","title":"CNN2GNN: How to Bridge CNN with GNN","date":"2024-04-23","arxiv_id":"2404.14822","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-aware-heterogeneous-graph-transformer","title":"Time-aware Heterogeneous Graph Transformer with Adaptive Attention Merging for Health Event Prediction","date":"2024-04-23","arxiv_id":"2404.14815","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-quantification-on-graph-learning","title":"Uncertainty Quantification on Graph Learning: A Survey","date":"2024-04-23","arxiv_id":"2404.14642","repositories_listed":0,"syntology":null},{"url":null,"slug":"spgnn-recognizing-salient-subgraph-patterns","title":"SPGNN: Recognizing Salient Subgraph Patterns via Enhanced Graph Convolution and Pooling","date":"2024-04-21","arxiv_id":"2404.13655","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-dual-graph-convolutional","title":"Graph Convolutional Network For Semi-supervised Node Classification With Subgraph Sketching","date":"2024-04-19","arxiv_id":"2404.12724","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-similarities-under-random-projections","title":"Node Similarities under Random Projections: Limits and Pathological Cases","date":"2024-04-15","arxiv_id":"2404.10148","repositories_listed":0,"syntology":null},{"url":null,"slug":"introducing-graph-learning-over-polytopic","title":"Introducing Graph Learning over Polytopic Uncertain Graph","date":"2024-04-12","arxiv_id":"2404.08176","repositories_listed":0,"syntology":null},{"url":null,"slug":"seismic-first-break-picking-in-a-higher","title":"Seismic First Break Picking in a Higher Dimension Using Deep Graph Learning","date":"2024-04-12","arxiv_id":"2404.08408","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterizing-the-influence-of-topology-on","title":"Characterizing the Influence of Topology on Graph Learning Tasks","date":"2024-04-11","arxiv_id":"2404.07493","repositories_listed":0,"syntology":null},{"url":null,"slug":"pathology-genomic-fusion-via-biologically","title":"Pathology-genomic fusion via biologically informed cross-modality graph learning for survival analysis","date":"2024-04-11","arxiv_id":"2404.08023","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-gnn-via-two-dimensional-2-d-graph","title":"Spectral GNN via Two-dimensional (2-D) Graph Convolution","date":"2024-04-06","arxiv_id":"2404.04559","repositories_listed":0,"syntology":null},{"url":null,"slug":"polynomial-graphical-lasso-learning-edges","title":"Polynomial Graphical Lasso: Learning Edges from Gaussian Graph-Stationary Signals","date":"2024-04-03","arxiv_id":"2404.02621","repositories_listed":0,"syntology":null},{"url":null,"slug":"cirp-cross-item-relational-pre-training-for","title":"CIRP: Cross-Item Relational Pre-training for Multimodal Product Bundling","date":"2024-04-02","arxiv_id":"2404.01735","repositories_listed":0,"syntology":null},{"url":null,"slug":"continual-learning-for-smart-city-a-survey","title":"Continual Learning for Smart City: A Survey","date":"2024-04-01","arxiv_id":"2404.00983","repositories_listed":0,"syntology":null},{"url":null,"slug":"tg-nas-generalizable-zero-cost-proxies-with","title":"TG-NAS: Generalizable Zero-Cost Proxies with Operator Description Embedding and Graph Learning for Efficient Neural Architecture Search","date":"2024-03-30","arxiv_id":"2404.00271","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-the-known-novel-class-discovery-for","title":"Beyond the Known: Novel Class Discovery for Open-world Graph Learning","date":"2024-03-29","arxiv_id":"2403.19907","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-individual-graph-structures-to","title":"Exploiting Individual Graph Structures to Enhance Ecological Momentary Assessment (EMA) Forecasting","date":"2024-03-28","arxiv_id":"2403.19442","repositories_listed":0,"syntology":null},{"url":null,"slug":"instruction-based-hypergraph-pretraining","title":"Instruction-based Hypergraph Pretraining","date":"2024-03-28","arxiv_id":"2403.19063","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-clustering-hierarchical-multi-agent","title":"Self-Clustering Hierarchical Multi-Agent Reinforcement Learning with Extensible Cooperation Graph","date":"2024-03-26","arxiv_id":"2403.18056","repositories_listed":0,"syntology":null},{"url":"/paper/cadgl-context-aware-deep-graph-learning-for","slug":"cadgl-context-aware-deep-graph-learning-for","title":"CADGL: Context-Aware Deep Graph Learning for Predicting Drug-Drug Interactions","date":"2024-03-25","arxiv_id":"2403.17210","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-graph-representation-learning-with","title":"Enhancing Graph Representation Learning with Attention-Driven Spiking Neural Networks","date":"2024-03-25","arxiv_id":"2403.17040","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphs-generalization-under-distribution","title":"Graphs Generalization under Distribution Shifts","date":"2024-03-25","arxiv_id":"2403.16334","repositories_listed":0,"syntology":null},{"url":null,"slug":"mitigating-subpopulation-bias-for-fair","title":"Mitigating Subpopulation Bias for Fair Network Topology Inference","date":"2024-03-22","arxiv_id":"2403.15591","repositories_listed":0,"syntology":null},{"url":"/paper/unifews-unified-entry-wise-sparsification-for","slug":"unifews-unified-entry-wise-sparsification-for","title":"Unifews: Unified Entry-Wise Sparsification for Efficient Graph Neural Network","date":"2024-03-20","arxiv_id":"2403.13268","repositories_listed":0,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":16,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unifews-unified-entry-wise-sparsification-for#ran","syntology_url":"https://syntology.ai/paper/2403.13268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.13268"}},"official":null}},{"url":null,"slug":"fairstg-countering-performance-heterogeneity","title":"FairSTG: Countering performance heterogeneity via collaborative sample-level optimization","date":"2024-03-19","arxiv_id":"2403.12391","repositories_listed":0,"syntology":null},{"url":null,"slug":"molecular-classification-using","title":"Molecular Classification Using Hyperdimensional Graph Classification","date":"2024-03-18","arxiv_id":"2403.12307","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-unitary-message-passing","title":"Graph Unitary Message Passing","date":"2024-03-17","arxiv_id":"2403.11199","repositories_listed":0,"syntology":null},{"url":null,"slug":"discovering-invariant-neighborhood-patterns","title":"Discovering Invariant Neighborhood Patterns for Heterophilic Graphs","date":"2024-03-15","arxiv_id":"2403.10572","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-subgraph-learning-by-monitoring-early","title":"Robust Subgraph Learning by Monitoring Early Training Representations","date":"2024-03-14","arxiv_id":"2403.09901","repositories_listed":0,"syntology":null},{"url":null,"slug":"causal-graph-neural-networks-for-wildfire","title":"Causal Graph Neural Networks for Wildfire Danger Prediction","date":"2024-03-13","arxiv_id":"2403.08414","repositories_listed":0,"syntology":null},{"url":null,"slug":"reduced-jeffries-matusita-distance-a-novel","title":"Reduced Jeffries-Matusita distance: A Novel Loss Function to Improve Generalization Performance of Deep Classification Models","date":"2024-03-13","arxiv_id":"2403.08408","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-graph-neural-network-enhancement","title":"Iterative Graph Neural Network Enhancement via Frequent Subgraph Mining of Explanations","date":"2024-03-12","arxiv_id":"2403.07849","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-methods-to-extract-empathy","title":"Graph learning methods to extract empathy supporting regions in a naturalistic stimuli fMRI","date":"2024-03-11","arxiv_id":"2403.07089","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-in-graph-neural-networks-a-survey","title":"Uncertainty in Graph Neural Networks: A Survey","date":"2024-03-11","arxiv_id":"2403.07185","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-total-variation-minimization-for","title":"Analysis of Total Variation Minimization for Clustered Federated Learning","date":"2024-03-10","arxiv_id":"2403.06298","repositories_listed":0,"syntology":null}],"record_sha256":"aae516ab9328a135e15c4f9de7e18af6ae46d3ec3246da98154524049654dc9e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}