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.

Timothy T. L. Yu

dblp:317/2196 · also Timothy Tin Long Yu · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0001-8758-0578ORCID · verified

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

Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
2 papers
Question answering and dialogue systems · 44% Efficient and distributed learning · 44% Language models and text generation · 13%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Question answering and dialogue systems
domain-specific question answering
0.912025
Evaluating LLM Reasoning in the Operations Research Domain with ORQA · AAAI 2025
Machine learning › Efficient and distributed learning
inference serving
0.912025
Efficiently Serving Large Multimodal Models Using EPD Disaggregation · ICML 2025
Cloud and datacenter computing
inference serving
0.912025
Efficiently Serving Large Multimodal Models Using EPD Disaggregation · ICML 2025
Mathematical optimization › optimization modeling
LLM-based optimization modeling
0.912025
Evaluating LLM Reasoning in the Operations Research Domain with ORQA · AAAI 2025
Mathematical optimization
optimization modeling
0.912025
Evaluating LLM Reasoning in the Operations Research Domain with ORQA · AAAI 2025
Natural language and speech › Language models and text generation
large language model evaluation
0.312025
Evaluating LLM Reasoning in the Operations Research Domain with ORQA · AAAI 2025
Cloud and datacenter computing
resource allocation
0.312025
Efficiently Serving Large Multimodal Models Using EPD Disaggregation · ICML 2025

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

role switching · 1.7expert annotation · 1.7encode-prefill-decode disaggregation · 1.7benchmark construction · 1.7KV cache management · 1.7
YearPublicationVenuePosition
2025 Evaluating LLM Reasoning in the Operations Research Domain with ORQA
abstract
In this paper, we introduce and apply Operations Research Question Answering (ORQA), a new benchmark, to assess the generalization capabilities of Large Language Models (LLMs) in the specialized technical domain of Operations Research (OR). This benchmark is designed to evaluate whether LLMs can emulate the knowledge and reasoning skills of OR experts when given diverse and complex optimization problems. The dataset, crafted by OR experts, presents real-world optimization problems that require multistep reasoning to build their mathematical models. Our evaluations of various open-source LLMs, such as LLaMA 3.1, DeepSeek, and Mixtral reveal their modest performance, indicating a gap in their aptitude to generalize to specialized technical domains. This work contributes to the ongoing discourse on LLMs’ generalization capabilities, providing insights for future research in this area. The dataset and evaluation code are publicly available.
Mahdi Mostajabdaveh, Timothy T. L. Yu, Samarendra Chandan Bindu Dash, Rindranirina Ramamonjison, Jabo Serge Byusa, Giuseppe Carenini, Zirui Zhou, Yong Zhang 0004
AAAI2
2025 Efficiently Serving Large Multimodal Models Using EPD Disaggregation
abstract
Large Multimodal Models (LMMs) extend Large Language Models (LLMs) by handling diverse inputs such as images, audio, and video, but at the cost of adding a multimodal encoding stage that increases both computational and memory overhead. This step negatively affects key Service Level Objectives (SLOs), such as time to first token (TTFT) and time per output token (TPOT). We introduce Encode-Prefill-Decode (EPD) Disaggregation, a novel framework that separates the encoding, prefill, and decode stages onto dedicated resources. Unlike current systems, which bundle encoding and prefill together, our approach decouples these steps, unlocking new opportunities and optimizations. These include a mechanism to cache multimedia tokens for efficient transfer, a novel way to parallelize the encoding load within a request, a module for optimal resource allocation for disaggregated serving, and a novel role-switching method to handle changing workload characteristics. Experimental evaluations with popular LMMs show substantial gains in memory efficiency (up to 15$\times$ lower peak memory utilization), batch sizes (up to 22$\times$ larger), 10$\times$ more images per request, and 2.2$\times$ larger KV caches. Furthermore, it leads to significant improvements in SLO attainment (up to 90–100% improvement) and TTFT (up to 71% reduction), compared to systems that do not disaggregate. The code is available at https://github.com/vbdi/epdserve.
Gursimran Singh, Xinglu Wang, Timothy T. L. Yu, Linzi Xing, Xiaolong Bai, Yong Zhang 0004, Zhenan Fan
ICML4