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

Kyle Montgomery

dblp:261/4798 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2025
0009-0004-0563-347XORCID · reported

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

Artificial intelligence and machine learning · 4 · 4 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
4 papers
Trustworthy machine learning · 58% Language models and text generation · 33% Vision and language · 10%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › fairness
fairness evaluation
0.912025
VMDT: Decoding the Trustworthiness of Video Foundation Models · NeurIPS 2025
Machine learning › Trustworthy machine learning › hallucination
hallucination evaluation
0.912025
VMDT: Decoding the Trustworthiness of Video Foundation Models · NeurIPS 2025
Natural language and speech › Language models and text generation
large language model evaluation
0.912025
JudgeBench: A Benchmark for Evaluating LLM-Based Judges · ICLR 2025
Machine learning › Trustworthy machine learning › privacy
privacy evaluation
0.912025
VMDT: Decoding the Trustworthiness of Video Foundation Models · NeurIPS 2025
Machine learning › Trustworthy machine learning
safety evaluation
0.912025
VMDT: Decoding the Trustworthiness of Video Foundation Models · NeurIPS 2025
Computer vision › Vision and language › multimodal reasoning
compositional reasoning
0.812024
Re-Tuning: Overcoming the Compositionality Limits of Large Language Models with Recursive Tuning · ACL (1) 2024
Natural language and speech › Language models and text generation
large language model fine-tuning
0.812024
Re-Tuning: Overcoming the Compositionality Limits of Large Language Models with Recursive Tuning · ACL (1) 2024
Natural language and speech › Language models and text generation › large language model reasoning
zero-shot reasoning
0.812024
Agent Instructs Large Language Models to be General Zero-Shot Reasoners · ICML 2024
Machine learning › Trustworthy machine learning › robustness › model robustness evaluation
adversarial robustness evaluation
0.312025
VMDT: Decoding the Trustworthiness of Video Foundation Models · NeurIPS 2025
Natural language and speech › Language models and text generation
large language model
0.212024
Agent Instructs Large Language Models to be General Zero-Shot Reasoners · ICML 2024

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

benchmark construction · 1.7large language model evaluation · 0.9recursive tuning · 0.8fine-tuning · 0.8chain-of-thought · 0.8autonomous agent · 0.8
YearPublicationVenuePosition
2025 JudgeBench: A Benchmark for Evaluating LLM-Based Judges
abstract
LLM-based judges have emerged as a scalable alternative to human evaluation and are increasingly used to assess, compare, and improve models. However, the reliability of LLM-based judges themselves is rarely scrutinized. As LLMs become more advanced, their responses grow more sophisticated, requiring stronger judges to evaluate them. Existing benchmarks primarily focus on a judge’s alignment with human preferences, but often fail to account for more challenging tasks where crowdsourced human preference is a poor indicator of factual and logical correctness. To address this, we propose a novel evaluation framework to objectively evaluate LLM-based judges. Based on this framework, we propose JudgeBench, a benchmark for evaluating LLM-based judges on challenging response pairs spanning knowledge, reasoning, math, and coding. JudgeBench leverages a novel pipeline for converting existing difficult datasets into challenging response pairs with preference labels reflecting objective correctness. Our comprehensive evaluation on a collection of prompted judges, fine-tuned judges, multi-agent judges, and reward models shows that JudgeBench poses a significantly greater challenge than previous benchmarks, with many strong models (e.g. GPT-4o) performing just slightly better than random guessing. Overall, JudgeBench offers a reliable platform for assessing increasingly advanced LLM-based judges. Data and code are available at \url{https://github.com/ScalerLab/JudgeBench}.
Sijun Tan, Siyuan Zhuang, Kyle Montgomery, William Yuan Tang, Alejandro Cuadron, Chenguang Wang 0001, Raluca A. Popa, Ion Stoica
ICLR3
2025 VMDT: Decoding the Trustworthiness of Video Foundation Models
abstract
As foundation models become more sophisticated, ensuring their trustworthiness becomes increasingly critical; yet, unlike text and image, the video modality still lacks comprehensive trustworthiness benchmarks. We introduce VMDT (Video-Modal DecodingTrust), the first unified platform for evaluating text-to-video (T2V) and video-to-text (V2T) models across five key trustworthiness dimensions: safety, hallucination, fairness, privacy, and adversarial robustness. Through our extensive evaluation of 7 T2V models and 19 V2T models using VMDT, we uncover several significant insights. For instance, all open-source T2V models evaluated fail to recognize harmful queries and often generate harmful videos, while exhibiting higher levels of unfairness compared to image modality models. In V2T models, unfairness and privacy risks rise with scale, whereas hallucination and adversarial robustness improve---though overall performance remains low. Uniquely, safety shows no correlation with model size, implying that factors other than scale govern current safety levels. Our findings highlight the urgent need for developing more robust and trustworthy video foundation models, and VMDT provides a systematic framework for measuring and tracking progress toward this goal. The code is available at https://sunblaze-ucb.github.io/VMDT-page/.
Yujin Potter, Zhun Wang, Nicholas Crispino, Kyle Montgomery, Alexander Xiong, Ethan Y. Chang, Francesco Pinto, Rahul Gupta 0001, Morteza Ziyadi, Christos Christodoulopoulos 0001, Bo Li 0026, Chenguang Wang 0001, Dawn Song
NeurIPS4
2024 Re-Tuning: Overcoming the Compositionality Limits of Large Language Models with Recursive Tuning
abstract
We present a new method for large language models to solve compositional tasks.Although they have shown strong performance on traditional language understanding tasks, large language models struggle to solve compositional tasks, where the solution depends on solving smaller instances of the same problem.We propose a natural approach to solve compositional tasks recursively.Our method, Re-Tuning, tunes models to break down a problem into subproblems, solve those subproblems, and combine the results.We show that our method significantly improves model performance on three representative compositional tasks: integer addition, dynamic programming, and parity.Compared to state-of-the-art methods that keep intermediate steps towards solving the problems, Re-Tuning achieves significantly higher accuracy and is more GPU memory efficient.
Eric Pasewark, Kyle Montgomery, Kefei Duan, Dawn Song, Chenguang Wang 0001
ACL (1)2
2024 Agent Instructs Large Language Models to be General Zero-Shot Reasoners
abstract
We introduce a method to improve the zero-shot reasoning abilities of large language models on general language understanding tasks. Specifically, we build an autonomous agent to instruct the reasoning process of large language models. To enable this, our agent only needs to generate a single set of instructions for each task. These instructions turn out to be extremely effective for improving the reasoning process of different large language models across all task instances. We show this approach further unleashes the zero-shot reasoning abilities of large language models to more tasks. We study the performance of our method on a wide set of datasets spanning generation, classification, and reasoning. We show that our method generalizes to most tasks and obtains state-of-the-art zero-shot performance on 20 of the 29 datasets that we evaluate. For instance, our method boosts the performance of state-of-the-art large language models by a large margin, including Vicuna-13b, Llama-2-70b-chat, and GPT-3.5 Turbo. Compared to zero-shot chain of thought, our improvement in reasoning is striking. With our method, Llama-2-70b-chat outperforms zero-shot GPT-3.5 Turbo significantly.
Nicholas Crispino, Kyle Montgomery, Fankun Zeng, Dawn Song, Chenguang Wang 0001
ICML2