← Search

Kaiqu Liang

6 accepted papers

2026

ZeroBench: An Impossible Visual Benchmark for Contemporary Large Multimodal Models

ICML 2026poster

Large Multimodal Models (LMMs) exhibit shortfalls when interpreting images and, by some measures, have poorer spatial cognition than young children or animals. Despite this, they attain high scores on many popular visual benchmarks, with headroom rapidly eroded by surging model progress. To address …

Cited by 0SourceScholar
2024

CharXiv: Charting Gaps in Realistic Chart Understanding in Multimodal LLMs

NeurIPS 2024poster

Chart understanding plays a pivotal role when applying Multimodal Large Language Models (MLLMs) to real-world tasks such as analyzing scientific papers or financial reports. However, existing datasets often focus on oversimplified and homogeneous charts with template-based questions, leading to an o…

2024

Introspective Planning: Aligning Robots' Uncertainty with Inherent Task Ambiguity

NeurIPS 2024poster

Large language models (LLMs) exhibit advanced reasoning skills, enabling robots to comprehend natural language instructions and strategically plan high-level actions through proper grounding. However, LLM hallucination may result in robots confidently executing plans that are misaligned with user go…

2024

Who Plays First? Optimizing the Order of Play in Stackelberg Games with Many Robots

RSS 2024poster

We consider the multi-agent spatial navigation problem of computing the socially optimal order of play, i.e., the sequence in which the agents commit to their decisions, and its associated equilibrium in an N-player Stackelberg trajectory game. We model this problem as a mixed-integer optimization p…

2022

Path Independent Equilibrium Models Can Better Exploit Test-Time Computation

NeurIPS 2022accept

Designing networks capable of attaining better performance with an increased inference budget is important to facilitate generalization to harder problem instances. Recent efforts have shown promising results in this direction by making use of depth-wise recurrent networks. In this work, we reproduc…

Cited by 26SourcePDFScholar