paper-with-me

홈 › Papers

PuzzleBench: A Fully Dynamic Evaluation Framework for Large Multimodal Models on Puzzle Solving

2025-04-15 · Zeyu Zhang, Zijian Chen, ZiCheng Zhang, Yuze Sun, Yuan Tian, Ziheng Jia, Chunyi Li, Xiaohong Liu, Xiongkuo Min, Guangtao Zhai

Large Multimodal Models (LMMs) have demonstrated impressive capabilities across a wide range of multimodal tasks, achieving ever-increasing performance on various evaluation benchmarks. However, existing benchmarks are typically static and often overlap with pre-training datasets, leading to fixed complexity constraints and substantial data contamination issues. Meanwhile, manually annotated datasets are labor-intensive, time-consuming, and subject to human bias and inconsistency, leading to reliability and reproducibility issues. To address these problems, we propose a fully dynamic multimodal evaluation framework, named Open-ended Visual Puzzle Generation (OVPG), which aims to generate fresh, diverse, and verifiable evaluation data automatically in puzzle-solving tasks. Specifically, the OVPG pipeline consists of a raw material sampling module, a visual content generation module, and a puzzle rule design module, which ensures that each evaluation instance is primitive, highly randomized, and uniquely solvable, enabling continual adaptation to the evolving capabilities of LMMs. Built upon OVPG, we construct PuzzleBench, a dynamic and scalable benchmark comprising 11,840 VQA samples. It features six carefully designed puzzle tasks targeting three core LMM competencies, visual recognition, logical reasoning, and context understanding. PuzzleBench differs from static benchmarks that quickly become outdated. It enables ongoing dataset refreshing through OVPG and a rich set of open-ended puzzle designs, allowing seamless adaptation to the evolving capabilities of LMMs.

📄 PDF Abstract BibTeX arXiv:2504.10885

Code (0)

등록된 구현이 없습니다.

Tasks

Logical ReasoningVisual Question Answering (VQA)

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

PuzzleBench: Can LLMs Solve Challenging First-Order Combinatorial Reasoning Problems?

2024-02-04 · Chinmay Mittal, Krishna Kartik, Mausam, Parag Singla

Recent works show that the largest of the large language models (LLMs) can solve many simple reasoning tasks expressed in natural language, without any/much supervision. But, can they also solve challenging first-order c…

Question Answering

ROLAND: Graph Learning Framework for Dynamic Graphs

2022-08-15 · Jiaxuan You, Tianyu Du, Jure Leskovec

Graph Neural Networks (GNNs) have been successfully applied to many real-world static graphs. However, the success of static graphs has not fully translated to dynamic graphs due to the limitations in model design, evalu…

Graph LearningGraph Representation LearningLink PredictionMeta-Learning+1

Rubric-as-Experts: Case-Specific MQM Rubrics for Translation Quality Evaluation

2026-06-19 · Weilu Xu, Yunzhi Shen, Xinye Wang, Ranfei Dang 외 arxiv

Large language models (LLMs) have shown strong potential in fine-grained translation quality evaluation (QE), yet existing MQM-based approaches typically rely on fixed rubric configurations shared across all translation …

OKBench: Democratizing LLM Evaluation with Fully Automated, On-Demand, Open Knowledge Benchmarking

2025-10-31 · Yanhong Li, Tianyang Xu, Kenan Tang, Karen Livescu 외 arxiv

Knowledge-intensive question answering is central to large language models (LLMs) and is typically assessed using static benchmarks derived from sources like Wikipedia and textbooks. However, these benchmarks fail to cap…

Question Answering

RecourseBench: A Modular Framework for Reproducible Algorithmic Recourse Evaluation

2026-06-15 · Zahra Khotanlou, Hashir Ahmed, Chenghao Tan, Ahmed Abdelaal 외 arxiv

Algorithmic recourse methods provide counterfactual explanations that inform individuals of the actions required to overturn an unfavorable model decision. Despite rapid methodological progress, principled comparison rem…