Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Menghua Wu

dblp:140/1690 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
7since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 4 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
6 papers
3D vision · 36% Language models and text generation · 22% Efficient and distributed learning · 10%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Computer graphics and multimedia
2 papers
Geometric modeling and processing · 67% Visual content generation and editing · 33%

Topics — the 17 heaviest of 20, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
3d face reconstruction
1.322023
FaceScape: 3D Facial Dataset and Benchmark for Single-View 3D Face Reconstruction · IEEE Trans. Pattern Anal. Mach. Intell. 2023
RAFaRe: Learning Robust and Accurate Non-parametric 3D Face Reconstruction from Pseudo 2D&3D Pairs · AAAI 2023
Computer vision › 3D vision › 3d face reconstruction
single-image 3d face reconstruction
1.322023
FaceScape: 3D Facial Dataset and Benchmark for Single-View 3D Face Reconstruction · IEEE Trans. Pattern Anal. Mach. Intell. 2023
RAFaRe: Learning Robust and Accurate Non-parametric 3D Face Reconstruction from Pseudo 2D&3D Pairs · AAAI 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
causal reasoning
0.912025
Identifying biological perturbation targets through causal differential networks · ICML 2025
Machine learning › Efficient and distributed learning
inference efficiency
0.912025
Thought calibration: Efficient and confident test-time scaling · EMNLP 2025
Natural language and speech › Language models and text generation › large language model
reasoning model
0.912025
Thought calibration: Efficient and confident test-time scaling · EMNLP 2025
Natural language and speech › Language models and text generation
test-time scaling
0.912025
Thought calibration: Efficient and confident test-time scaling · EMNLP 2025
Bioinformatics and computational biology › functional genomics › functional enrichment analysis
gene set enrichment analysis
0.912025
Contextualizing biological perturbation experiments through language · ICLR 2025
Bioinformatics and computational biology › single-cell analysis
single-cell transcriptomics
0.912025
Identifying biological perturbation targets through causal differential networks · ICML 2025
Computer vision › 3D vision › 3d face modeling
3d morphable model
0.712023
FaceScape: 3D Facial Dataset and Benchmark for Single-View 3D Face Reconstruction · IEEE Trans. Pattern Anal. Mach. Intell. 2023
Visual content generation and editing › 3d content generation
3d face synthesis
0.712023
High-fidelity 3D Face Generation from Natural Language Descriptions · CVPR 2023
Geometric modeling and processing
shape representation
0.712023
RAFaRe: Learning Robust and Accurate Non-parametric 3D Face Reconstruction from Pseudo 2D&3D Pairs · AAAI 2023
Geometric modeling and processing › shape representation › implicit representation
signed distance function
0.712023
RAFaRe: Learning Robust and Accurate Non-parametric 3D Face Reconstruction from Pseudo 2D&3D Pairs · AAAI 2023
Machine learning › Transfer learning and domain adaptation
few-shot learning
0.412020
Few-shot Text Classification with Distributional Signatures · ICLR 2020
Natural language and speech › Information extraction and text analysis › text classification › low-resource text classification
few-shot text classification
0.412020
Few-shot Text Classification with Distributional Signatures · ICLR 2020
Natural language and speech › Information extraction and text analysis
text classification
0.412020
Few-shot Text Classification with Distributional Signatures · ICLR 2020
Natural language and speech › Language models and text generation
chain-of-thought reasoning
0.312025
Thought calibration: Efficient and confident test-time scaling · EMNLP 2025
Bioinformatics and computational biology
knowledge representation in biology
0.312025
Contextualizing biological perturbation experiments through language · ICLR 2025

Methods — techniques the papers use, named apart from their topics

graph neural network · 1.7causal discovery · 1.7two-stage optimization · 1.3pseudo 2d&3d pairs · 1.3nonparametric learning · 1.3hierarchical signed distance function · 1.33d morphable model · 1.3retrieval-augmented generation · 0.9probing · 0.9large language model · 0.9hidden representation analysis · 0.9deep neural network · 0.7
YearPublicationVenuePosition
2025 Thought calibration: Efficient and confident test-time scaling
abstract
Reasoning large language models achieve impressive test-time scaling by thinking for longer, but this performance gain comes at significant compute cost.Directly limiting test-time budget hurts overall performance, but not all problems are equally difficult.We propose thought calibration to decide dynamically when thinking can be terminated.To calibrate our decision rule, we view a language model's growing body of thoughts as a nested sequence of reasoning trees, where the goal is to identify the point at which novel reasoning plateaus.We realize this framework through lightweight probes that operate on top of the language model's hidden representations, which are informative of both the reasoning structure and overall consistency of response.Based on three reasoning language models and four datasets, thought calibration preserves model performance with up to a 60% reduction in thinking tokens on in-distribution data, and up to 20% in out-of-distribution data. 1
Menghua Wu, Cai Zhou, Stephen Bates, Tommi S. Jaakkola
EMNLP1
2025 Contextualizing biological perturbation experiments through language
abstract
High-content perturbation experiments allow scientists to probe biomolecular systems at unprecedented resolution, but experimental and analysis costs pose significant barriers to widespread adoption. Machine learning has the potential to guide efficient exploration of the perturbation space and extract novel insights from these data. However, current approaches neglect the semantic richness of the relevant biology, and their objectives are misaligned with downstream biological analyses. In this paper, we hypothesize that large language models (LLMs) present a natural medium for representing complex biological relationships and rationalizing experimental outcomes. We propose PerturbQA, a benchmark for structured reasoning over perturbation experiments. Unlike current benchmarks that primarily interrogate existing knowledge, PerturbQA is inspired by open problems in perturbation modeling: prediction of differential expression and change of direction for unseen perturbations, and gene set enrichment. We evaluate state-of-the-art machine learning and statistical approaches for modeling perturbations, as well as standard LLM reasoning strategies, and we find that current methods perform poorly on PerturbQA. As a proof of feasibility, we introduce Summer (SUMMarize, retrievE, and answeR, a simple, domain-informed LLM framework that matches or exceeds the current state-of-the-art. Our code and data are publicly available at https://github.com/genentech/PerturbQA.
Menghua Wu, Russell Littman, Jacob Levine, Tommaso Biancalani, David Richmond, Jan-Christian Hütter
ICLR1
2025 Identifying biological perturbation targets through causal differential networks
abstract
Identifying variables responsible for changes to a biological system enables applications in drug target discovery and cell engineering. Given a pair of observational and interventional datasets, the goal is to isolate the subset of observed variables that were the targets of the intervention. Directly applying causal discovery algorithms is challenging: the data may contain thousands of variables with as few as tens of samples per intervention, and biological systems do not adhere to classical causality assumptions. We propose a causality-inspired approach to address this practical setting. First, we infer noisy causal graphs from the observational and interventional data. Then, we learn to map the differences between these graphs, along with additional statistical features, to sets of variables that were intervened upon. Both modules are jointly trained in a supervised framework, on simulated and real data that reflect the nature of biological interventions. This approach consistently outperforms baselines for perturbation modeling on seven single-cell transcriptomics datasets. We also demonstrate significant improvements over current causal discovery methods for predicting soft and hard intervention targets across a variety of synthetic data.
Menghua Wu, Umesh Padia, Sean H. Murphy, Regina Barzilay, Tommi S. Jaakkola
ICML1
2023 RAFaRe: Learning Robust and Accurate Non-parametric 3D Face Reconstruction from Pseudo 2D&3D Pairs
abstract
We propose a robust and accurate non-parametric method for single-view 3D face reconstruction (SVFR). While tremendous efforts have been devoted to parametric SVFR, a visible gap still lies between the result 3D shape and the ground truth. We believe there are two major obstacles: 1) the representation of the parametric model is limited to a certain face database; 2) 2D images and 3D shapes in the fitted datasets are distinctly misaligned. To resolve these issues, a large-scale pseudo 2D&3D dataset is created by first rendering the detailed 3D faces, then swapping the face in the wild images with the rendered face. These pseudo 2D&3D pairs are created from publicly available datasets which eliminate the gaps between 2D and 3D data while covering diverse appearances, poses, scenes, and illumination. We further propose a non-parametric scheme to learn a well-generalized SVFR model from the created dataset, and the proposed hierarchical signed distance function turns out to be effective in predicting middle-scale and small-scale 3D facial geometry. Our model outperforms previous methods on FaceScape-wild/lab and MICC benchmarks and is well generalized to various appearances, poses, expressions, and in-the-wild environments. The code is released at https://github.com/zhuhao-nju/rafare.
Longwei Guo, Hao Zhu 0004, Yuanxun Lu, Menghua Wu, Xun Cao
AAAI4
2023 High-fidelity 3D Face Generation from Natural Language Descriptions
abstract
Synthesizing high-quality 3D face models from natural language descriptions is very valuable for many applications, including avatar creation, virtual reality, and telepresence. However, little research ever tapped into this task. We argue the major obstacle lies in 1) the lack of high-quality 3D face data with descriptive text annotation, and 2) the complex mapping relationship between descriptive language space and shape/appearance space. To solve these problems, we build Describe3D dataset, the first large-scale dataset with fine-grained text descriptions for text-to-3D face generation task. Then we propose a two-stage framework to first generate a 3D face that matches the concrete descriptions, then optimize the parameters in the 3D shape and texture space with abstract description to refine the 3D face model. Extensive experimental results show that our method can produce a faithful 3D face that conforms to the input descriptions with higher accuracy and quality than previous methods. The code and Describe3D dataset are released at https://github.com/zhuhao-nju/describe3D.
Menghua Wu, Hao Zhu 0004, Linjia Huang, Yiyu Zhuang, Yuanxun Lu, Xun Cao
CVPR1
2023 FaceScape: 3D Facial Dataset and Benchmark for Single-View 3D Face Reconstruction
abstract
In this article, we present a large-scale detailed 3D face dataset, FaceScape, and the corresponding benchmark to evaluate single-view facial 3D reconstruction. By training on FaceScape data, a novel algorithm is proposed to predict elaborate riggable 3D face models from a single image input. FaceScape dataset releases 16,940 textured 3D faces, captured from 847 subjects and each with 20 specific expressions. The 3D models contain the pore-level facial geometry that is also processed to be topologically uniform. These fine 3D facial models can be represented as a 3D morphable model for coarse shapes and displacement maps for detailed geometry. Taking advantage of the large-scale and high-accuracy dataset, a novel algorithm is further proposed to learn the expression-specific dynamic details using a deep neural network. The learned relationship serves as the foundation of our 3D face prediction system from a single image input. Different from most previous methods, our predicted 3D models are riggable with highly detailed geometry under different expressions. We also use FaceScape data to generate the in-the-wild and in-the-lab benchmark to evaluate recent methods of single-view face reconstruction. The accuracy is reported and analyzed on the dimensions of camera pose and focal length, which provides a faithful and comprehensive evaluation and reveals new challenges. The unprecedented dataset, benchmark, and code have been released to the public for research purpose.
Hao Zhu 0004, Longwei Guo, Mingkai Huang, Menghua Wu, Qiu Shen, Ruigang Yang, Xun Cao
IEEE Trans. Pattern Anal. Mach. Intell.7
2022 Joint feedback and recurrent deraining network with ensemble learning
Yu Luo 0004, Menghua Wu, Qingdong Huang, Jian Zhu 0001, Jie Ling 0002, Bin Sheng 0001
Vis. Comput.2
2020 Few-shot Text Classification with Distributional Signatures
Yujia Bao, Menghua Wu, Shiyu Chang, Regina Barzilay
ICLR2