Papers by Binxing Jiao
Effective and Efficient Query-aware Snippet Extraction for Web Search (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to extract webpage snippets ignore contextual information of webpages, which may be sub-optimal. |
| Approach: | They propose a query-aware webpage snippet extraction method called DeepQSE that captures contextual information of webpages. |
| Outcome: | The proposed method can significantly improve the performance of DeepQSE without affecting its performance. |
ADAM: Dense Retrieval Distillation with Adaptive Dark Examples (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to retrieve data from multiple encoders are too trivial for the teacher to distinguish, preventing the teacher from transferring abundant dark knowledge to the student. |
| Approach: | They propose a knowledge distillation framework that can better transfer the dark knowledge held in the teacher with adaptive dark examples. |
| Outcome: | The proposed framework can better transfer the dark knowledge held in the teacher with adaptive dark examples. |
Are You Copying My Model? Protecting the Copyright of Large Language Models for EaaS via Backdoor Watermark (2023.acl-long)
Copied to clipboard
Wenjun Peng, Jingwei Yi, Fangzhao Wu, Shangxi Wu, Bin Bin Zhu, Lingjuan Lyu, Binxing Jiao, Tong Xu, Guangzhong Sun, Xing Xie
| Challenge: | Large language models (LLMs) have demonstrated exceptional abilities in both text understanding and generation. |
| Approach: | They propose an Embedding Watermark method that implants backdoors on embeddings to protect copyright of large language models. |
| Outcome: | The proposed method protects the copyright of large language models without compromising service quality while minimizing the adverse impact on the original embeddings’ utility. |
xMoCo: Cross Momentum Contrastive Learning for Open-Domain Question Answering (2021.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to find relevant passages using sparse keywords are not effective for open domain question answering. |
| Approach: | They propose a new contrastive learning method for learning a dual-encoder model for question-passage matching using a large pool of negative samples. |
| Outcome: | The proposed method maintains large pool of negative samples and optimizes question-to-passage and passage-to question matching tasks. |
THE-X: Privacy-Preserving Transformer Inference with Homomorphic Encryption (2022.findings-acl)
Copied to clipboard
Tianyu Chen, Hangbo Bao, Shaohan Huang, Li Dong, Binxing Jiao, Daxin Jiang, Haoyi Zhou, Jianxin Li, Furu Wei
| Challenge: | enabling pre-trained models inference on ciphertext data is difficult due to the complex computations in transformer blocks. |
| Approach: | They propose an approximation approach for transformers which enables inference on ciphertext data. |
| Outcome: | The proposed approach can infer pre-trained models on encrypted data with negligible performance drop but enjoy theory-guaranteed privacy-preserving advantage. |
SimLM: Pre-training with Representation Bottleneck for Dense Passage Retrieval (2023.acl-long)
Copied to clipboard
Liang Wang, Nan Yang, Xiaolong Huang, Binxing Jiao, Linjun Yang, Daxin Jiang, Rangan Majumder, Furu Wei
| Challenge: | SimLM uses a simple bottleneck architecture that learns to compress the passage information into a dense vector through self-supervised pre-training. |
| Approach: | They propose a simple yet effective pre-training method for dense passage retrieval that learns to compress the passage information into a dense vector through self-supervised pre-tuning. |
| Outcome: | The proposed method outperforms multi-vector approaches on large-scale passage retrieval datasets and shows significant improvements over baselines. |
Towards Robust Ranker for Text Retrieval (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for text retrieval are based on a 'retrieval & rerank' pipeline, which uses a fast retriever to fetch a set of top document candidates, while a robust ranker is based upon a weak negative mining during contrastive learning. |
| Approach: | They propose a multi-adversarial training strategy that leverages multiple retrievers as generators to challenge a ranker. |
| Outcome: | The proposed model outperforms the existing de facto ranker training paradigms on the passage retrieval benchmarks using BM25-reranking, full-ranking and retriever distillation. |