← Search

Qifan Zhang

6 accepted papers

2026

Exposing Weaknesses of Large Reasoning Models through Graph Algorithm Problems

ICLR 2026poster

Large Reasoning Models (LRMs) have advanced rapidly, yet existing benchmarks on mathematics, code, and common-sense reasoning remain limited: they lack long-context evaluation, offer insufficient challenge, and provide answers that are difficult to verify programmatically. We introduce GrAlgoBench,…

Cited by 0SourceScholar
2026

From Local Matches to Global Masks: Template-Guided Instance Detection and Segmentation in Open-World Scenes

RSS 2026poster

Detecting and segmenting novel object instances in open-world environments is a fundamental problem in robotic perception. Given only a small set of template images, a robot must locate and segment a specific object instance in a cluttered, previously unseen scene. Existing proposal-based approaches…

Cited by 0SourceScholar
2025

GraphArena: Evaluating and Exploring Large Language Models on Graph Computation

ICLR 2025poster

The ``arms race'' of Large Language Models (LLMs) demands new benchmarks to examine their progresses. In this paper, we introduce GraphArena, a benchmarking tool designed to evaluate LLMs on real-world graph computational problems. It offers a suite of four polynomial-time tasks (e.g., Shortest Dist…

2025

HO-Cap: A Capture System and Dataset for 3D Reconstruction and Pose Tracking of Hand-Object Interaction

NeurIPS 2025poster

We introduce a data capture system and a new dataset, HO-Cap, for 3D reconstruction and pose tracking of hands and objects in videos. The system leverages multiple RGB-D cameras and a HoloLens headset for data collection, avoiding the use of expensive 3D scanners or motion capture systems. We propos…

Cited by 0SourcecodeScholar
2024

CaptainCook4D: A Dataset for Understanding Errors in Procedural Activities

NeurIPS 2024poster

Following step-by-step procedures is an essential component of various activities carried out by individuals in their daily lives. These procedures serve as a guiding framework that helps to achieve goals efficiently, whether it is assembling furniture or preparing a recipe. However, the complexity…

Cited by 9SourcePDFScholar
2021

Learning Nash Equilibria in Zero-Sum Stochastic Games via Entropy-Regularized Policy Approximation

IJCAI 2021poster

We explore the use of policy approximations to reduce the computational cost of learning Nash equilibria in zero-sum stochastic games. We propose a new Q-learning type algorithm that uses a sequence of entropy-regularized soft policies to approximate the Nash policy during the Q-function updates. We…

Cited by 8SourcePDFScholar