Bingchen Zhao

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 Qing Liu 0017

> Home > Persons > Bingchen Zhao

Publications

2025
[c28]
- view
- export record
  dblp key:
  - conf/icml/LiTH0ZXRM0ZZX25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/LiTH0ZXRM0ZZX25
Xianhang Li, Haoqin Tu, Mude Hui, Zeyu Wang, Bingchen Zhao, Junfei Xiao, Sucheng Ren, Jieru Mei, Qing Liu, Huangjie Zheng, Yuyin Zhou, Cihang Xie:
What If We Recaption Billions of Web Images with LLaMA-3? ICML 2025
[i39]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2507-21033
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2507-21033
Yuhan Wang, Siwei Yang, Bingchen Zhao, Letian Zhang, Qing Liu, Yuyin Zhou, Cihang Xie:
GPT-IMAGE-EDIT-1.5M: A Million-Scale, GPT-Generated Image Dataset. CoRR abs/2507.21033 (2025)
2024
[i31]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2406-08478
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2406-08478
Xianhang Li, Haoqin Tu, Mude Hui, Zeyu Wang, Bingchen Zhao, Junfei Xiao, Sucheng Ren, Jieru Mei, Qing Liu, Huangjie Zheng, Yuyin Zhou, Cihang Xie:
What If We Recaption Billions of Web Images with LLaMA-3? CoRR abs/2406.08478 (2024)

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.