Ge Chen

Orcid: 0009-0002-7502-8852

Affiliations:
  • University of Chinese Academy of Sciences, Kuaishou Technology, Beijing, China


According to our database1, Ge Chen authored at least 10 papers between 2023 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Diffusion Model with Selective Attention for Temporal Knowledge Graph Reasoning.
Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2025

Improving Graph Autoencoders by Hard Sample Refinement with Global Similarity.
Proceedings of the 34th ACM International Conference on Information and Knowledge Management, 2025

Towards Reward Fairness in RLHF: From a Resource Allocation Perspective.
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2025

2024
GUNDAM: Aligning Large Language Models with Graph Understanding.
CoRR, 2024

Preserving Node Distinctness in Graph Autoencoders via Similarity Distillation.
CoRR, 2024

Towards Comprehensive Preference Data Collection for Reward Modeling.
CoRR, 2024

Exploring Task Unification in Graph Representation Learning via Generative Approach.
CoRR, 2024

IdmGAE: Importance-Inspired Dynamic Masking for Graph Autoencoders.
Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2024

Advancing Latent Representation Ranking for Masked Graph Autoencoder.
Proceedings of the Database Systems for Advanced Applications, 2024

2023
Do We Really Need Contrastive Learning for Graph Representation?
CoRR, 2023


  Loading...