Search Results for author:
Found 13 papers, 4 papers with code
GraphGPT: Graph Instruction Tuning for Large Language Models
In this work, we present the GraphGPT framework that aligns LLMs with graph structural knowledge with a graph instruction tuning paradigm.
LLMRec: Large Language Models with Graph Augmentation for Recommendation
By employing these strategies, we address the challenges posed by sparse implicit feedback and low-quality side information in recommenders.
Representation Learning with Large Language Models for Recommendation
RLMRec incorporates auxiliary textual signals, develops a user/item profiling paradigm empowered by LLMs, and aligns the semantic space of LLMs with the representation space of collaborative relational signals through a cross-view alignment framework.
Enhanced Doubly Robust Learning for Debiasing Post-click Conversion Rate Estimation
Based on it, a more robust doubly robust (MRDR) estimator has been proposed to further reduce its variance while retaining its double robustness.
StaticGreedy: solving the scalability-accuracy dilemma in influence maximization
We point out that the essential reason of the dilemma is the surprising fact that the submodularity, a key requirement of the objective function for a greedy algorithm to approximate the optimum, is not guaranteed in all conventional greedy algorithms in the literature of influence maximization.
Social and Information Networks Data Structures and Algorithms Physics and Society F.2.2; D.2.8
IMRank: Influence Maximization via Finding Self-Consistent Ranking
Early methods mainly fall into two paradigms with certain benefits and drawbacks: (1)Greedy algorithms, selecting seed nodes one by one, give a guaranteed accuracy relying on the accurate approximation of influence spread with high computational cost; (2)Heuristic algorithms, estimating influence spread using efficient heuristics, have low computational cost but unstable accuracy.
Social and Information Networks Data Structures and Algorithms F.2.2; D.2.8
Pre-trained Language Model based Ranking in Baidu Search
However, it is nontrivial to directly apply these PLM-based rankers to the large-scale web search system due to the following challenging issues:(1) the prohibitively expensive computations of massive neural PLMs, especially for long texts in the web-document, prohibit their deployments in an online ranking system that demands extremely low latency;(2) the discrepancy between existing ranking-agnostic pre-training objectives and the ad-hoc retrieval scenarios that demand comprehensive relevance modeling is another main barrier for improving the online ranking system;(3) a real-world search engine typically involves a committee of ranking components, and thus the compatibility of the individually fine-tuned ranking model is critical for a cooperative ranking system.
Pre-trained Language Model for Web-scale Retrieval in Baidu Search
More importantly, we present a practical system workflow for deploying the model in web-scale retrieval.
Graph Enhanced BERT for Query Understanding
In other words, GE-BERT can capture both the semantic information and the users' search behavioral information of queries.
Incorporating Explicit Knowledge in Pre-trained Language Models for Passage Re-ranking
To leverage a reliable knowledge, we propose a novel knowledge graph distillation method and obtain a knowledge meta graph as the bridge between query and passage.
Approximated Doubly Robust Search Relevance Estimation
We further instantiate the proposed unbiased relevance estimation framework in Baidu search, with comprehensive practical solutions designed regarding the data pipeline for click behavior tracking and online relevance estimation with an approximated deep neural network.
Agent4Ranking: Semantic Robust Ranking via Personalized Query Rewriting Using Multi-agent LLM
To be specific, we use Chain of Thought (CoT) technology to utilize Large Language Models (LLMs) as agents to emulate various demographic profiles, then use them for efficient query rewriting, and we innovate a robust Multi-gate Mixture of Experts (MMoE) architecture coupled with a hybrid loss function, collectively strengthening the ranking models' robustness.
Text-Video Retrieval via Variational Multi-Modal Hypergraph Networks
Compared to conventional textual retrieval, the main obstacle for text-video retrieval is the semantic gap between the textual nature of queries and the visual richness of video content.
