activity
20202026
most citedUnsupervised Hashing with Contrastive Information Bottleneck

7 citations · 19 across the 21 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

cs.CL2021

Tell Me How to Survey: Literature Review Made Simple with Automatic Reading Path Generation

Jiayuan Ding, Tong Xiang, Zijing Ou +5

Recent years have witnessed the dramatic growth of paper volumes with plenty of new research papers published every day, especially in the area of computer science. How to glean pa…

cs.IR2021

Refining BERT Embeddings for Document Hashing via Mutual Information Maximization

Zijing Ou, Qinliang Su, Jianxing Yu +3

Existing unsupervised document hashing methods are mostly established on generative models. Due to the difficulties of capturing long dependency structures, these methods rarely mo…

cs.IR2021★ 3 cited

Integrating Semantics and Neighborhood Information with Graph-Driven Generative Models for Document Retrieval

Zijing Ou, Qinliang Su, Jianxing Yu +5

With the need of fast retrieval speed and small memory footprint, document hashing has been playing a crucial role in large-scale information retrieval. To generate high-quality ha…

cs.CV2021★ 7 cited

Unsupervised Hashing with Contrastive Information Bottleneck

Zexuan Qiu, Qinliang Su, Zijing Ou +2

Many unsupervised hashing methods are implicitly established on the idea of reconstructing the input data, which basically encourages the hashing codes to retain as much informatio…

cs.CL2021★ 2 cited

Imperfect also Deserves Reward: Multi-Level and Sequential Reward Modeling for Better Dialog Management

Zhengxu Hou, Bang Liu, Ruihui Zhao +4

For task-oriented dialog systems, training a Reinforcement Learning (RL) based Dialog Management module suffers from low sample efficiency and slow convergence speed due to the spa…