Search Results for author: Junda Ye

Found 8 papers, 0 papers with code

AISFG: Abundant Information Slot Filling Generator

no code implementations NAACL 2022 Yang Yan, Junda Ye, Zhongbao Zhang, LiWen Wang

As an essential component of task-oriented dialogue systems, slot filling requires enormous labeled training data in a certain domain.

Few-Shot Learning slot-filling +2

DeepRicci: Self-supervised Graph Structure-Feature Co-Refinement for Alleviating Over-squashing

no code implementations23 Jan 2024 Li Sun, Zhenhao Huang, Hua Wu, Junda Ye, Hao Peng, Zhengtao Yu, Philip S. Yu

Graph Neural Networks (GNNs) have shown great power for learning and mining on graphs, and Graph Structure Learning (GSL) plays an important role in boosting GNNs with a refined graph.

Contrastive Learning Graph structure learning

Contrastive Sequential Interaction Network Learning on Co-Evolving Riemannian Spaces

no code implementations2 Jan 2024 Li Sun, Junda Ye, Jiawei Zhang, Yong Yang, Mingsheng Liu, Feiyang Wang, Philip S. Yu

To address the aforementioned issues, we propose a novel Contrastive model for Sequential Interaction Network learning on Co-Evolving RiEmannian spaces, CSINCERE.

Contrastive Learning Recommendation Systems

SINCERE: Sequential Interaction Networks representation learning on Co-Evolving RiEmannian manifolds

no code implementations6 May 2023 Junda Ye, Zhongbao Zhang, Li Sun, Yang Yan, Feiyang Wang, Fuxin Ren

To explore these issues for sequential interaction networks, we propose SINCERE, a novel method representing Sequential Interaction Networks on Co-Evolving RiEmannian manifolds.

Recommendation Systems Representation Learning

Contrastive Graph Clustering in Curvature Spaces

no code implementations5 May 2023 Li Sun, Feiyang Wang, Junda Ye, Hao Peng, Philip S. Yu

On the other hand, contrastive learning boosts the deep graph clustering but usually struggles in either graph augmentation or hard sample mining.

Clustering Contrastive Learning +1

Self-Supervised Continual Graph Learning in Adaptive Riemannian Spaces

no code implementations30 Nov 2022 Li Sun, Junda Ye, Hao Peng, Feiyang Wang, Philip S. Yu

On the one hand, existing methods work with the zero-curvature Euclidean space, and largely ignore the fact that curvature varies over the coming graph sequence.

Graph Learning

A Self-supervised Riemannian GNN with Time Varying Curvature for Temporal Graph Learning

no code implementations30 Aug 2022 Li Sun, Junda Ye, Hao Peng, Philip S. Yu

To bridge this gap, we make the first attempt to study the problem of self-supervised temporal graph representation learning in the general Riemannian space, supporting the time-varying curvature to shift among hyperspherical, Euclidean and hyperbolic spaces.

Graph Learning Graph Representation Learning +1

A Self-supervised Mixed-curvature Graph Neural Network

no code implementations10 Dec 2021 Li Sun, Zhongbao Zhang, Junda Ye, Hao Peng, Jiawei Zhang, Sen Su, Philip S. Yu

Instead of working on one single constant-curvature space, we construct a mixed-curvature space via the Cartesian product of multiple Riemannian component spaces and design hierarchical attention mechanisms for learning and fusing the representations across these component spaces.

Contrastive Learning Graph Representation Learning

Cannot find the paper you are looking for? You can Submit a new open access paper.