Papers by Yanbin Lu
Unified Contextual Query Rewriting (2023.acl-industry)
Copied to clipboard
Yingxue Zhou, Jie Hao, Mukund Rungta, Yang Liu, Eunah Cho, Xing Fan, Yanbin Lu, Vishal Vasudevan, Kellen Gillespie, Zeynab Raeesy
| Challenge: | Large-scale conversational AI agents such as Alexa, Siri, and Google Assistant are becoming increasingly popular in real-world applications to assist users in daily life. |
| Approach: | They propose a unified contextual query rewriting model that unifies QR for friction reduction and contextual carryover . they leverage the text-to-text unified framework which uses independent tasks with weighted loss to account for task importance . |
| Outcome: | The proposed model reduces friction and contextual carryover by using multiple auxiliary tasks. |
Unsupervised Dual Paraphrasing for Two-stage Semantic Parsing (2020.acl-main)
Copied to clipboard
| Challenge: | Existing semantic parsing frameworks rely on nontrivial human labor to generate canonical utterances. |
| Approach: | They propose a framework that uses an unsupervised paraphrase model to parse canonical utterances. |
| Outcome: | The proposed framework is effective and compatible with supervised training. |
LGESQL: Line Graph Enhanced Text-to-SQL Model with Mixed Local and Non-Local Relations (2021.acl-long)
Copied to clipboard
| Challenge: | Existing methods to encode text-to-SQL data are node-centric and ignore semantics embedded in the topological structure of edges. |
| Approach: | They propose a Line Graph Enhanced Text-to-SQL model to mine relational features without constructing meta-paths. |
| Outcome: | The proposed model achieves state-of-the-art on the cross-domain text-to-SQL benchmark Spider at the time of writing. |
ShadowGNN: Graph Projection Neural Network for Text-to-SQL Parser (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing semantic parsing models struggle to adapt to unseen database schemas . a new architecture, ShadowGNN, processes schemas at abstract and semantic levels . |
| Approach: | They propose a new architecture which processes schemas at abstract and semantic levels. |
| Outcome: | The proposed architecture outperforms state-of-the-art models on a text-to-sql benchmark . it uses domain-independent representations to extract logical linking between question and schema . |
Line Graph Enhanced AMR-to-Text Generation with Mix-Order Graph Attention Networks (2020.acl-main)
Copied to clipboard
| Challenge: | Existing graph-to-sequence approaches use graph neural networks as encoders, but they lack the structure information needed to translate AMR into the graph-based data. |
| Approach: | They propose a graph-to-sequence task which aims to recover natural language from Abstract Meaning Representations (AMR) they adopt graph attention networks with higher-order neighborhood information to explore the edge relations in AMR graphs. |
| Outcome: | The proposed framework achieves state-of-the-art performance on English AMR benchmark datasets and is able to translate the AMR semantics into the natural language. |
Neural Graph Matching Networks for Chinese Short Text Matching (2020.acl-main)
Copied to clipboard
| Challenge: | Chinese word segmentation can be erroneous, ambiguous or inconsistent, causing performance problems. |
| Approach: | They propose a sentence matching framework that uses paired word lattices as input instead of a character sequence. |
| Outcome: | The proposed framework outperforms the state-of-the-art short text matching models on two Chinese datasets. |
Harnessing LLMs for Temporal Data - A Study on Explainable Financial Time Series Forecasting (2023.emnlp-industry)
Copied to clipboard
| Challenge: | Recent advances in machine learning and artificial intelligence have opened up numerous opportunities and challenges in financial time series forecasting. |
| Approach: | They propose to use Large Language Models for explainable financial time series forecasting to leverage cross-sequence information and extract insights from text and price time series. |
| Outcome: | The proposed model outperforms ARMA-GARCH and gradient-boosting tree models while underperforming on other models. |
RecMind: Large Language Model Powered Agent For Recommendation (2024.findings-naacl)
Copied to clipboard
Yancheng Wang, Ziyan Jiang, Zheng Chen, Fan Yang, Yingxue Zhou, Eunah Cho, Xing Fan, Yanbin Lu, Xiaojiang Huang, Yingzhen Yang
| Challenge: | Existing recommendations systems are limited in generalizing to new tasks due to model scale and data size constraints. |
| Approach: | They propose an LLM-powered autonomous recommender agent, RecMind, which is capable of leveraging external knowledge to provide zero-shot personalized recommendations. |
| Outcome: | The proposed model outperforms existing zero/few-shot LLM-based recommendation baseline methods in various tasks and achieves comparable performance to a fully trained recommendation model P5. |
Graph Meets LLM: A Novel Approach to Collaborative Filtering for Robust Conversational Understanding (2023.emnlp-industry)
Copied to clipboard
| Challenge: | Defective queries impact the robustness of conversational AI systems such as Alexa, Siri or Google Assistant. |
| Approach: | They propose a Personalized Query Rewriting system that takes into account individual preferences or unique error patterns identified from a user's historical interactions with the conversational AI. |
| Outcome: | The proposed approach has been proven on a large-scale real-world dataset and online A/B experiments. |
Improving Contextual Query Rewrite for Conversational AI Agents through User-preference Feedback Learning (2023.emnlp-industry)
Copied to clipboard
| Challenge: | Contextual query rewriting (CQR) is a crucial component in Conversational AI agents, leveraging contextual information from previous user-agent conversations to improve comprehension of current user intent. |
| Approach: | They propose a framework to enhance the CQR model's capability in generating user preference-aligned rewrites. |
| Outcome: | The proposed framework improves the CQR model's ability to generate user preference-aligned rewrites. |