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

Sang T. Truong

dblp:294/1219 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2025
0000-0001-8069-9410ORCID · verified

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

Artificial intelligence and machine learning · 6 · 3 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 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
5 papers
Trustworthy machine learning · 44% Probabilistic and Bayesian machine learning · 11% Speech recognition and synthesis · 10%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 50% Empirical software engineering · 50%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computing education · 77% Medical and health informatics · 23%
Network and information security
1 paper
Security and privacy of machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › experimental design
adaptive testing
0.912025
Reliable and Efficient Amortized Model-based Evaluation · ICML 2025
Machine learning › Trustworthy machine learning
benchmark validity
0.912025
Fantastic Bugs and Where to Find Them in AI Benchmarks · NeurIPS 2025
Natural language and speech › Language models and text generation
large language model evaluation
0.912025
Reliable and Efficient Amortized Model-based Evaluation · ICML 2025
Computer vision › Vision and language › vision-language model › multimodal large language model
multimodal large language model evaluation
0.912025
The Sound of Syntax: Finetuning and Comprehensive Evaluation of Language Models for Speech Pathology · EMNLP 2025
Natural language and speech › Speech recognition and synthesis › speech evaluation
pathological speech assessment
0.912025
The Sound of Syntax: Finetuning and Comprehensive Evaluation of Language Models for Speech Pathology · EMNLP 2025
Natural language and speech › Question answering and dialogue systems
question generation
0.912025
Reliable and Efficient Amortized Model-based Evaluation · ICML 2025
Computing education
large language model evaluation
0.912025
ResearchCodeBench: Benchmarking LLMs on Implementing Novel Machine Learning Research Code · NeurIPS 2025
Compilers and program optimization
code generation
0.912025
ResearchCodeBench: Benchmarking LLMs on Implementing Novel Machine Learning Research Code · NeurIPS 2025
Machine learning › Trustworthy machine learning › robustness
adversarial robustness
0.712023
DecodingTrust: A Comprehensive Assessment of Trustworthiness in GPT Models · NeurIPS 2023
Machine learning › Trustworthy machine learning
robustness
0.712023
DecodingTrust: A Comprehensive Assessment of Trustworthiness in GPT Models · NeurIPS 2023
Security and privacy of machine learning › privacy attack
privacy leakage in language models
0.712023
DecodingTrust: A Comprehensive Assessment of Trustworthiness in GPT Models · NeurIPS 2023
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
game playing
0.512021
A Data-Driven Approach for Gin Rummy Hand Evaluation · AAAI 2021
Medical and health informatics
clinical decision support
0.312025
The Sound of Syntax: Finetuning and Comprehensive Evaluation of Language Models for Speech Pathology · EMNLP 2025
Machine learning › Trustworthy machine learning
fairness and bias
0.212023
DecodingTrust: A Comprehensive Assessment of Trustworthiness in GPT Models · NeurIPS 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.112021
A Data-Driven Approach for Gin Rummy Hand Evaluation · AAAI 2021

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

benchmark evaluation · 3.1large language model · 1.7fine-tuning · 1.7chain-of-thought prompting · 1.7jailbreaking · 1.3statistical analysis · 0.9item response theory · 0.9difficulty prediction · 0.9LLM judge · 0.9convolutional neural network · 0.5bayesian reasoning · 0.5
YearPublicationVenuePosition
2025 The Sound of Syntax: Finetuning and Comprehensive Evaluation of Language Models for Speech Pathology
abstract
According to the U.S. National Institutes of Health, more than 3.4 million children experience speech disorders that require clinical intervention.The number of speech-language pathologists (SLPs) is roughly 20 times fewer than the number of affected children, highlighting a significant gap in children's care and a pressing need for technological support that improves the productivity of SLPs.State-ofthe-art multimodal language models (MLMs) show promise for supporting SLPs, but their use remains underexplored largely due to a limited understanding of their performance in highstakes clinical settings.To address this gap, we collaborate with domain experts to develop a taxonomy of real-world use cases of MLMs in speech-language pathologies.Building on this taxonomy, we introduce the first comprehensive benchmark for evaluating MLM across five core use cases, each containing 1,000 manually annotated data points.This benchmark includes robustness and sensitivity tests under various settings, including background noise, speaker gender, and accent.Our evaluation of 15 state-of-the-art MLMs reveals that no single model consistently outperforms others across all tasks.Notably, we find systematic disparities, with models performing better on male speakers, and observe that chain-of-thought prompting can degrade performance on classification tasks with large label spaces and narrow decision boundaries.Furthermore, we study fine-tuning MLMs on domain-specific data, achieving improvements of over 30% compared to base models.These findings highlight both the potential and limitations of current MLMs for speech-language pathology applications, underscoring the need for further research and targeted development 1 .
Fagun Patel, Duc Q. Nguyen, Sang T. Truong, Jody Vaynshtok, Oluwasanmi Koyejo, Nick Haber
EMNLP3
2025 Reliable and Efficient Amortized Model-based Evaluation
abstract
Comprehensive evaluations of language models (LM) during both development and deployment phases are necessary because these models are thought to possess numerous capabilities as well as safety risks. The average score across a wide range of benchmarks provides a signal that helps guide the use of these LMs in practice. Currently, holistic evaluations are costly due to the large volume of benchmark questions, making frequent evaluations impractical. A popular attempt to lower the cost is to compute the average score on a subset of the benchmark. This approach, unfortunately, often renders an unreliable measure of LM performance because the average score is often confounded with the difficulty of the questions in the benchmark subset. Item response theory (IRT) was designed to address this challenge, providing a reliable measurement by careful controlling for question difficulty. Unfortunately, question difficulty is expensive to estimate. Facing this challenge, we train a model that predicts question difficulty from its content, enabling a reliable measurement at a fraction of the cost. In addition, we leverage this difficulty predictor to further improve the evaluation efficiency through training a question generator given a difficulty level. This question generator is essential in adaptive testing, where, instead of using a random subset of the benchmark questions, informative questions are adaptively chosen based on the current estimation of LLM performance. Experiments on 22 common natural language benchmarks and 183 LMs show that this approach is more reliable and efficient compared to the current common practice.
Sang T. Truong, Yuheng Tu 0001, Percy Liang, Bo Li 0026, Oluwasanmi Koyejo
ICML1
2025 ResearchCodeBench: Benchmarking LLMs on Implementing Novel Machine Learning Research Code
abstract
Large language models (LLMs) have shown promise in transforming machine learning research, yet their capability to faithfully implement genuinely novel ideas from recent research papers—ideas unseen during pretraining—remains unclear. We introduce ResearchCodeBench, a benchmark that evaluates LLMs’ ability to translate cutting-edge ML contributions from top 2024-2025 research papers into executable code. We assessed 30+ proprietary and open-source LLMs, finding that even the best models correctly implement less than 40% of the code. We present empirical findings on performance comparison, contamination, and error patterns. By providing a rigorous evaluation platform, ResearchCodeBench enables continuous understanding and advancement of LLM-driven innovation in research code generation.
Tianyu Hua, Harper Hua, Violet Xiang, Benjamin Klieger, Sang T. Truong, Weixin Liang, Fan-Yun Sun, Nick Haber
NeurIPS5
2025 Fantastic Bugs and Where to Find Them in AI Benchmarks
abstract
Benchmarks are pivotal in driving AI progress, and invalid benchmark questions frequently undermine their reliability. Manually identifying and correcting errors among thousands of benchmark questions is not only infeasible but also a critical bottleneck for reliable evaluation. In this work, we introduce a framework for systematic benchmark revision that leverages statistical analysis of response patterns to flag potentially invalid questions for further expert review. Our approach builds on a core assumption commonly used in AI evaluations that the mean score sufficiently summarizes model performance. This implies a unidimensional latent construct underlying the measurement experiment, yielding expected ranges for various statistics for each item. When empirically estimated values for these statistics fall outside the expected range for an item, the item is more likely to be problematic. Across nine widely used benchmarks, our method guides expert review to identify problematic questions with up to 84\% precision. In addition, we introduce an LLM‑judge first pass to review questions, further reducing human effort. Together, these components provide an efficient and scalable framework for systematic benchmark revision.
Sang T. Truong, Yuheng Tu 0001, Michael Hardy, Anka Reuel, Zeyu Tang 0002, Jirayu Burapacheep, Jonathan Perera, Chibuike Uwakwe, Benjamin W. Domingue, Nick Haber, Oluwasanmi Koyejo
NeurIPS1
2023 DecodingTrust: A Comprehensive Assessment of Trustworthiness in GPT Models
abstract
Generative Pre-trained Transformer (GPT) models have exhibited exciting progress in capabilities, capturing the interest of practitioners and the public alike. Yet, while the literature on the trustworthiness of GPT models remains limited, practitioners have proposed employing capable GPT models for sensitive applications to healthcare and finance – where mistakes can be costly. To this end, this work proposes a comprehensive trustworthiness evaluation for large language models with a focus on GPT-4 and GPT-3.5, considering diverse perspectives – including toxicity, stereotype bias, adversarial robustness, out-of-distribution robustness, robustness on adversarial demonstrations, privacy, machine ethics, and fairness. Based on our evaluations, we discover previously unpublished vulnerabilities to trustworthiness threats. For instance, we find that GPT models can be easily misled to generate toxic and biased outputs and leak private information in both training data and conversation history. We also find that although GPT-4 is usually more trustworthy than GPT-3.5 on standard benchmarks, GPT-4 is more vulnerable given jailbreaking system or user prompts, potentially due to the reason that GPT-4 follows the (misleading) instructions more precisely. Our work illustrates a comprehensive trustworthiness evaluation of GPT models and sheds light on the trustworthiness gaps. Our benchmark is publicly available at https://decodingtrust.github.io/.
Boxin Wang, Hengzhi Pei, Chulin Xie, Mintong Kang, Chejian Xu, Zidi Xiong, Ritik Dutta, Rylan Schaeffer, Sang T. Truong, Simran Arora, Mantas Mazeika, Dan Hendrycks, Zinan Lin 0001, Yu Cheng 0001, Oluwasanmi Koyejo, Dawn Song, Bo Li 0026
NeurIPS11
2021 A Data-Driven Approach for Gin Rummy Hand Evaluation
abstract
We develop a data-driven approach for hand strength evaluation in the game of Gin Rummy. Employing Convolutional Neural Networks, Monte Carlo simulation, and Bayesian reasoning, we compute both offensive and defensive scores of a game state. After only one training cycle, the model was able to make sophisticated and human-like decisions with a 55.4% +/- 0.8% win rate (90% confidence level) against a Simple player.
Sang T. Truong, Todd W. Neller
AAAI1