Tie-Yan Liu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Paul N. Bennett

> Home > Persons > Tie-Yan Liu

Publications

2022
[i203]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2204-06644
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2204-06644
Payal Bajaj, Chenyan Xiong, Guolin Ke, Xiaodong Liu, Di He, Saurabh Tiwary, Tie-Yan Liu, Paul Bennett, Xia Song, Jianfeng Gao:
METRO: Efficient Denoising Pretraining of Large Scale Autoencoding Language Models with Model Generated Signals. CoRR abs/2204.06644 (2022)
2021
[c244]
- view
  authority control:
- export record
  dblp key:
  - conf/emnlp/LuHXKMDBLO21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/emnlp/LuHXKMDBLO21
Shuqi Lu, Di He, Chenyan Xiong, Guolin Ke, Waleed Malik, Zhicheng Dou, Paul Bennett, Tie-Yan Liu, Arnold Overwijk:
Less is More: Pretrain a Strong Siamese Encoder for Dense Text Retrieval Using a Weak Decoder. EMNLP (1) 2021: 2780-2791
[i171]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2102-09206
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2102-09206
Shuqi Lu, Chenyan Xiong, Di He, Guolin Ke, Waleed Malik, Zhicheng Dou, Paul Bennett, Tie-Yan Liu, Arnold Overwijk:
Less is More: Pre-training a Strong Siamese Encoder Using a Weak Decoder. CoRR abs/2102.09206 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.