2 citations · 8 across the 25 of their papers we have counts for
7 papers · 1 filter
Latent Block-Diffusion Temporal Point Processes: A Semi-Autoregressive Framework for Asynchronous Event Sequence Generation
Shuai Zhang, Yancheng Chen, Chuan Zhou +5
Modeling and sampling from the underlying distribution of asynchronous event sequences are crucial in various real-world applications, including social networks, medical diagnosis,…
Reasoning through Exploration: A Reinforcement Learning Framework for Robust Function Calling
Bingguang Hao, Zengzhuang Xu, Maolin Wang +9
The effective training of Large Language Models (LLMs) for function calling faces a critical challenge: balancing exploration of complex reasoning paths with stable policy optimiza…
FunReason: Enhancing Large Language Models' Function Calling via Self-Refinement Multiscale Loss and Automated Data Refinement
Bingguang Hao, ZengZhuang Xu, Maolin Wang +9
The integration of large language models (LLMs) with function calling has emerged as a crucial capability for enhancing their practical utility in real-world applications. However,…
MetaLoRA: Tensor-Enhanced Adaptive Low-Rank Fine-tuning
Maolin Wang, Xiangyu Zhao
There has been a significant increase in the deployment of neural network models, presenting substantial challenges in model adaptation and fine-tuning. Efficient adaptation is cru…
Adversarial Curriculum Graph Contrastive Learning with Pair-wise Augmentation
Xinjian Zhao, Liang Zhang, Yang Liu +2
Graph contrastive learning (GCL) has emerged as a pivotal technique in the domain of graph representation learning. A crucial aspect of effective GCL is the caliber of generated po…
Cumulative Distribution Function based General Temporal Point Processes
Maolin Wang, Yu Pan, Zenglin Xu +6
Temporal Point Processes (TPPs) hold a pivotal role in modeling event sequences across diverse domains, including social networking and e-commerce, and have significantly contribut…
Federated Knowledge Graph Completion via Latent Embedding Sharing and Tensor Factorization
Maolin Wang, Dun Zeng, Zenglin Xu +2
Knowledge graphs (KGs), which consist of triples, are inherently incomplete and always require completion procedure to predict missing triples. In real-world scenarios, KGs are dis…