--- title: "Hung Le — author profile and papers — Elamur Research" description: "Hung Le: 2 papers on Elamur Research (2022–2025), h-index 1 — affiliations, topics, co-authors and who cites them in our library." canonical: "https://research.elamur.ai/free/en/authors/hung-le/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/hung-le/) [home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Hung Le # Hung Le Hung Le has 2 papers in our library, in 2022–2025, most of them on [Code & programming languages](https://md.research.elamur.ai/free/en/topics/code-and-programming/); often with [Silvio Savarese](https://md.research.elamur.ai/free/en/authors/silvio-savarese/), [Akhilesh Deepak Gotmare](https://md.research.elamur.ai/free/en/authors/akhilesh-deepak-gotmare/), [Caiming Xiong](https://md.research.elamur.ai/free/en/authors/caiming-xiong/). 2 papers in our library · 2022–2025 [OpenAlex](https://openalex.org/A5127809935) · [**h-index 1**](https://openalex.org/authors/A5127809935) · [1 works](https://openalex.org/works?filter=author.id:A5127809935) · [121 citations](https://openalex.org/works?filter=author.id:A5127809935&sort=cited_by_count:desc) OpenAlex, 2026-10-14 [📄 2 works in our library](https://md.research.elamur.ai/free/en/authors/hung-le/#papers) · [🔗 Cited 191 times in our library](https://md.research.elamur.ai/free/en/authors/hung-le/cited-by/) · [⭐ Paper Stars ranking: #4837](https://md.research.elamur.ai/free/en/paper-stars/page/49/#star-4837) The profile is the library's match of the name; two people with one name are not always told apart. Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Hung+Le) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Hung+Le) · [dblp](https://dblp.org/search?q=Hung+Le) · [ACL Anthology](https://aclanthology.org/search/?q=Hung+Le) ## Fields, topics and concepts Of its works in our library, with the number of works on each. 📚 Shelves 6 The field of science this work belongs to (OpenAlex fields).[Arts and Humanities · 2 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · [Computer Science · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Artificial Intelligence · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · [Computer Science Applications · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/computer-science-applications/) · [Information Systems · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/information-systems/) · [Language and Linguistics · 2 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) 🧭 Topics 1 Research subjects and languages the work is about.[Code & programming languages · 2 works](https://md.research.elamur.ai/free/en/topics/code-and-programming/) ## Works by year ### 2020s [**2025** 1 paper](https://md.research.elamur.ai/free/en/authors/hung-le/year/2025/) · [**2022** 1 paper](https://md.research.elamur.ai/free/en/authors/hung-le/year/2022/) ## Papers The most cited first (OpenAlex and our library). 1. **[CodeRL: Mastering Code Generation through Pretrained Models and Deep Reinforcement Learning](https://md.research.elamur.ai/free/en/papers/le-2022-coderl-mastering-code-generation-through/)** *(2022 · 297 citations)* CodeRL tackles a weakness of code-generating language models. They are usually fine-tuned only to reproduce reference solutions token by token, so they never learn whether a program actually works. As a result they struggle with hard, competition-style problems. The authors treat program synthesis as a reinforcement… 2. **[CodeTree: Agent-guided Tree Search for Code Generation with Large Language Models](https://md.research.elamur.ai/free/en/papers/li-2025-codetree-agent-guided-tree-search/)** *(2025 · 21 citations)* Hard programming tasks have a huge space of possible solutions. Older methods either sample many independent candidates or repeatedly refine one early attempt, which can trap them in a local optimum. CodeTree addresses this by organizing code generation as a tree search run by cooperating LLM agents. A Thinker agent… ## Co-authors here 7 co-authors with a page, the most papers together first. - [Silvio Savarese](https://md.research.elamur.ai/free/en/authors/silvio-savarese/) ×2 - [Akhilesh Deepak Gotmare](https://md.research.elamur.ai/free/en/authors/akhilesh-deepak-gotmare/) - [Caiming Xiong](https://md.research.elamur.ai/free/en/authors/caiming-xiong/) - [Jierui Li](https://md.research.elamur.ai/free/en/authors/jierui-li/) - [Steven C. H. Hoi](https://md.research.elamur.ai/free/en/authors/steven-c-h-hoi/) - [Yingbo Zhou](https://md.research.elamur.ai/free/en/authors/yingbo-zhou/) - [Yue Wang](https://md.research.elamur.ai/free/en/authors/yue-wang/) ## Venues Where their works here were published, the most works first, with the editions of those that have a page. - [Conference of the North American Chapter of the Association for Computational Linguistics (NAACL)](https://md.research.elamur.ai/free/en/venues/naacl/): [NAACL 2025](https://md.research.elamur.ai/free/en/venues/naacl/2025/) - [Conference on Neural Information Processing Systems (NeurIPS)](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/): [NeurIPS 2022](https://md.research.elamur.ai/free/en/venues/neural-information-processing-systems/2022/) ## Cited by Papers of our library cite their works 191 times (of the 149,439 papers whose bibliographies we read); [38 citing papers with a page here →](https://md.research.elamur.ai/free/en/authors/hung-le/cited-by/). Updated 30 October 2026