Challenge: NLCO evaluates large language models for combinatorial optimization (CO) . existing evaluations emphasize relatively simple reasoning competencies .
Approach: They propose a combinatorial optimization benchmark that evaluates large language models on CO reasoning.
Outcome: The proposed model can handle combinatorial optimization without writing code or calling external solvers.

Similar Papers

Have LLMs Advanced Enough? A Challenging Problem Solving Benchmark For Large Language Models (2023.emnlp-main)

Copied to clipboard

Challenge: The performance of large language models (LLMs) on existing reasoning benchmarks has significantly improved over the past decade.
Approach: They propose a benchmark dataset for evaluating the problem solving abilities of large language models (LLMs) they curate 515 challenging problems from the highly competitive IIT JEE-Advanced exam.
Outcome: The proposed model performs better on open-source and proprietary models than the current model, but with techniques like self-consistency, self-refinement and chain-of-thought prompting.
AMO-Bench: Large Language Models Still Struggle in High School Math Competitions (2026.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks for mathematical reasoning are becoming less effective due to performance saturation.
Approach: They propose to use a mathematical reasoning benchmark with Olympiad difficulty to evaluate top-tier LLMs.
Outcome: The proposed benchmarks are cross-validated by experts to meet IMO difficulty standards and entirely original problems to prevent performance leakages from data memorization.
LLM-Powered Benchmark Factory: Reliable, Generic, and Efficient (2026.acl-long)

Copied to clipboard

Challenge: Using generic and efficient benchmark generators, human annotators are limited by inefficiency . current benchmark generator methods rely on seed signals, leading to long cycles and high costs .
Approach: They propose a framework to evaluate LLMs as generic benchmark generators and integrate them as BenchMaker.
Outcome: The proposed framework achieves comparable performance to human-annotated benchmarks on most metrics.
LogicBench: Towards Systematic Evaluation of Logical Reasoning Ability of Large Language Models (2024.acl-long)

Copied to clipboard

Challenge: Existing work investigating the logical reasoning ability of large language models has focused only on a couple of inference rules of propositional and first-order logics.
Approach: They propose to use a natural language question-answering dataset to evaluate the logical reasoning ability of large language models.
Outcome: The proposed model performs poorly on a range of natural language questions using chain-of-thought prompting.
GraphEval36K: Benchmarking Coding and Reasoning Capabilities of Large Language Models on Graph Datasets (2025.findings-naacl)

Copied to clipboard

Challenge: Large language models (LLMs) have demonstrated significant capabilities in processing and understanding text data.
Approach: They propose a structure-based instruction-based method to enhance LLM performance on complex graph tasks.
Outcome: The proposed framework outperforms open-source models on graph problem-solving, but the gap is narrowing.
CriticBench: Benchmarking LLMs for Critique-Correct Reasoning (2024.findings-acl)

Copied to clipboard

Challenge: CriticBench is a benchmark designed to assess LLMs’ abilities to critique and refine their reasoning across a variety of tasks.
Approach: They propose a benchmark to assess LLMs' ability to critique and correct reasoning across a variety of tasks.
Outcome: The proposed benchmark examines the performance of 17 large language models in generation, critique, and correction reasoning.
OptiVerse: A Comprehensive Benchmark towards Optimization Problem Solving (2026.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks focus on Mathematical Programming and Combinatorial Optimization, hindering comprehensive evaluation.
Approach: They propose a benchmarking tool that compares 1,000 curated optimization problems across three difficulty levels.
Outcome: The proposed model improves performance on hard problems while maintaining 27% accuracy.
Do You Get the Hint? Benchmarking LLMs on the Board Game Concept (2026.findings-acl)

Copied to clipboard

Challenge: Large language models have achieved impressive progress on many benchmarks, yet they still have fundamental weaknesses.
Approach: They introduce Concept, a word-guessing board game, as a benchmark for probing abductive reasoning.
Outcome: The proposed game is easily solved by humans, but is still very challenging for state-of-the-art LLMs (no model exceeds 40% success rate).
Can LLMs Reason About Program Semantics? A Comprehensive Evaluation of LLMs on Formal Specification Inference (2025.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) are increasingly being used to automate programming tasks.
Approach: They propose a benchmark to evaluate LLMs' reasoning abilities on program semantics.
Outcome: The proposed benchmark shows that LLMs perform well with simple control flows but struggle with more complex structures, especially loops, even with advanced prompting.
Efficient Inference for Large Language Models –Algorithm, Model, and System (2025.emnlp-tutorials)

Copied to clipboard

Challenge: Inference of LLMs incurs high computational costs, memory access overhead, and memory usage, leading to inefficiencies in terms of latency, throughput, power consumption, and storage.
Approach: This tutorial introduces the basics of efficient inference for LLMs and explains how to diagnose efficiency bottlenecks for a given workload on specific hardware.
Outcome: The tutorial introduces the basic concepts of modern LLMs, software and hardware.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations