Zheng Wang
Zheng Wang has 3 papers in our library, in 2026; often with Dan Roth, Marianne Menglin Liu, Morteza Dehghani.
OpenAlex · ORCID · h-index 24 · 134 works · 1,963 citations OpenAlex, 2026-10-14
📄 3 works in our library · 🔗 Cited 3 times in our library · ⭐ Paper Stars ranking: #10518
Affiliations
🎓University of Science and Technology of ChinaHefei ·
China2000–2026 · 4 papers🎓Harbin Engineering UniversityHarbin ·
China2013–2026 · 2 papers🔬State Key Laboratory of Fire ScienceHefei2026 · 1 paper🎓University of Nottingham Ningbo ChinaNingbo ·
China2015–2025 · 21 papers🏛️Chinese Academy of SciencesBeijing ·
China2004–2020 · 6 papers🔬United States Naval Research LaboratoryWashington ·
United States2013–2018 · 6 papers🎓South China Normal UniversityGuangzhou ·
China2019–2020 · 5 papers🎓Shanghai Jiao Tong UniversityShanghai ·
China1997–2025 · 4 papers🎓Southwest Jiaotong UniversityChengdu ·
China2024–2025 · 4 papers🎓Zhejiang UniversityHangzhou ·
China2013–2025 · 4 papers
Fields, topics and concepts
📚 Shelves 6The field of science this work belongs to (OpenAlex fields).Arts and Humanities · 3 worksComputer Science · 3 worksArtificial Intelligence · 3 worksLanguage and Linguistics · 3 worksComputer Vision and Pattern Recognition · 2 worksInformation Systems · 1 work
Works by year
2020s
Papers
- LAD-RAG: Layout-aware Dynamic RAG for Visually-Rich Document Understanding (2026 · 4 citations)
Retrieval-augmented generation over long, visually rich documents (slides, reports, papers) often fails on questions whose answers are spread across several pages. - Chart-RL: Generalized Chart Comprehension via Reinforcement Learning with Verifiable Rewards (2026 · 1 citation)
Vision-language models (VLMs) often fail on charts they have not seen before. Chart questions call for symbolic and quantitative multi-step reasoning, and supervised fine-tuning (SFT) on domain data tends to overfit and cause forgetting. The authors propose Chart-RL, which extends the open-source VLM-R1 platform with… - Think Hard Only When Needed: A Hybrid Best-of-N and Beam Search for Efficient Test-Time Compute (2026)
Test-time compute lets small language models reason better by spending extra inference effort, but the two standard strategies have opposite costs.
Co-authors here
- Dan Roth ×2
- Marianne Menglin Liu
- Morteza Dehghani
- Sujith Ravi
- Tao Sheng
- Xin Zhang
- Xingyu Li
- Yingyan Celine Lin
- Yonggan Fu
- Zhivar Sourati
Venues
- Annual Meeting of the Association for Computational Linguistics (ACL): ACL 2026
- Findings of the Association for Computational Linguistics: Findings of the Association for Computational Linguistics 2026
- Workshop on Structured Understanding, Retrieval, and Generation in the LLM Era: Workshop on Structured Understanding, Retrieval, and Generation in the LLM Era 2026
Cited by
Updated
This page in Markdown → https://md.research.elamur.ai/free/en/authors/zheng-wang/