Papers by Zijing Ou
Integrating Semantics and Neighborhood Information with Graph-Driven Generative Models for Document Retrieval (2021.acl-long)
Copied to clipboard
Zijing Ou, Qinliang Su, Jianxing Yu, Bang Liu, Jingwen Wang, Ruihui Zhao, Changyou Chen, Yefeng Zheng
| Challenge: | Existing methods for document hashing combine only one of semantics and neighborhood information, lacking a theoretical principle to guide the integration process. |
| Approach: | They propose to encode neighborhood information with a graph-induced Gaussian distribution and integrate it with generative models. |
| Outcome: | The proposed model can be trained as efficiently as state-of-the-art methods on benchmark datasets. |
Imperfect also Deserves Reward: Multi-Level and Sequential Reward Modeling for Better Dialog Management (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing research on taskoriented dialog systems mainly includes pipeline and end-to-end methods due to its non-differentiable nature. |
| Approach: | They propose a multi-level reward modeling approach that factorizes a reward into a three-level hierarchy: domain, act, and slot. |
| Outcome: | The proposed approach significantly improves performance and speed of training in a wide range of dialog systems. |
Refining BERT Embeddings for Document Hashing via Mutual Information Maximization (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing unsupervised document hashing methods are mostly established on generative models . due to the difficulties of capturing long dependency structures, these methods rarely model the raw documents directly . |
| Approach: | They propose to learn hash codes from BERT embeddings by modifying existing models . they use mutual information maximization principle to maximize mutual information . |
| Outcome: | The proposed method outperforms existing methods learned from BERT embeddings on three benchmark datasets. |
Embedding Dynamic Attributed Networks by Modeling the Evolution Processes (2020.coling-main)
Copied to clipboard
| Challenge: | Existing methods to embed nodes into low-dimensional vectors focus on static networks, but in practice, many networks are evolving over time and hence are dynamic, e.g., social networks. |
| Approach: | They propose to extract high-order neighborhood information at each given timestamp and then use an embedding prediction framework to capture the temporal correlations. |
| Outcome: | Extensive experiments on four real-world datasets show that the proposed method outperforms baseline methods for dynamic link prediction and node classification tasks. |
Entropy-Based Decoding for Retrieval-Augmented Large Language Models (2025.naacl-long)
Copied to clipboard
| Challenge: | Despite their success, retrieval-augmented LLMs still face the distractibility issue, where the generated responses are negatively influenced by noise from both external and intrinsic knowledge sources. |
| Approach: | They propose a entropy-based document-parallel ensemble decoding method that prioritizes low-entropies from retrieved documents and incorporates a contrastive decoding mechanism that contrasts the obtained low- and high-entropic ensemble distributions with the high-end internal knowledge across layers. |
| Outcome: | The proposed method improves on open-domain question answering datasets and shows that it is highly efficient. |