1 citations · 1 across the 12 of their papers we have counts for
12 papers
MagicSelector: Joint Optimization for Agent Tool Selection via Counterfactual Decomposition and Progressive Reranking
HONOR Agentic Search Team, Zhengzong Chen, Lei Tang +27
We present MagicSelector, a joint optimization framework integrating Counterfactual task decomposition, Progressive reranking, and Dynamic Top-K, designed to address the fundamenta…
PCTD: Preference-Guided Counterfactual Task Decomposition for Agent Tool Retrieval
Chu Zhao, Lei Tang, Minghang Li +5
Task decomposition aims to transform ambiguous instructions into executable atomic subtasks, thereby guiding high-precision tool retrieval. However, our analysis reveals that direc…
Enhancing Protein Representation Learning via Manifold Restore Mixing
Yizhou Dang, Chuang Zhao, Lianbo Ma +3
Data augmentation (DA) has been proven to be an effective means for improving protein representation learning (PRL) by generating additional training samples. Although mainstream p…
Pay Attention to Sequence Split: Uncovering the Impacts of Sub-Sequence Splitting on Sequential Recommendation Models
Yizhou Dang, Yifan Wu, Minhan Huang +5
Sub-sequence splitting (SSS) has been demonstrated as an effective approach to mitigate data sparsity in sequential recommendation (SR) by splitting a raw user interaction sequence…
Fusion and Alignment Enhancement with Large Language Models for Tail-item Sequential Recommendation
Zhifu Wei, Yizhou Dang, Guibing Guo +2
Sequential Recommendation (SR) learns user preferences from their historical interaction sequences and provides personalized suggestions. In real-world scenarios, most items exhibi…
Causal Direct Preference Optimization for Distributionally Robust Generative Recommendation
Chu Zhao, Enneng Yang, Jianzhe Zhao +1
Direct Preference Optimization (DPO) guides large language models (LLMs) to generate recommendations aligned with user historical behavior distributions by minimizing preference al…
ECHO: Entropy-Confidence Hybrid Optimization for Test-Time Reinforcement Learning
Chu Zhao, Enneng Yang, Yuting Liu +2
Test-time reinforcement learning generates multiple candidate answers via repeated rollouts and performs online updates using pseudo-labels constructed by majority voting. To reduc…
Causal Negative Sampling via Diffusion Model for Out-of-Distribution Recommendation
Chu Zhao, Eneng Yang, Yizhou Dang +3
Heuristic negative sampling enhances recommendation performance by selecting negative samples of varying hardness levels from predefined candidate pools to guide the model toward l…
Hard Negative Sampling via Large Language Models for Recommendation
Chu Zhao, Enneng Yang, Yuting Liu +2
Hard negative sampling improves recommendation performance by accelerating convergence and sharpening the decision boundary. However, most existing methods rely on heuristic strate…
Distributionally Robust Graph Out-of-Distribution Recommendation via Diffusion Model
Chu Zhao, Enneng Yang, Yuliang Liang +3
The distributionally robust optimization (DRO)-based graph neural network methods improve recommendation systems' out-of-distribution (OOD) generalization by optimizing the model's…
Symmetric Graph Contrastive Learning against Noisy Views for Recommendation
Chu Zhao, Enneng Yang, Yuliang Liang +3
Graph Contrastive Learning (GCL) leverages data augmentation techniques to produce contrasting views, enhancing the accuracy of recommendation systems through learning the consiste…
Graph Representation Learning via Causal Diffusion for Out-of-Distribution Recommendation
Chu Zhao, Enneng Yang, Yuliang Liang +5
Graph Neural Networks (GNNs)-based recommendation algorithms typically assume that training and testing data are drawn from independent and identically distributed (IID) spaces. Ho…