ImageNet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever et al.
0
Citations
0
Influential Citations
arXiv.org
Venue
2026
Year
We propose agentic automata learning to evaluate the extent to which tool-calling LLM agents can uncover hidden environments through interaction. In our setup, an agent should uncover a hidden deterministic finite automaton (DFA) by interacting with an oracle through (1) membership queries ("Does this string belong to the target language?") and (2) equivalence queries ("Is this the target DFA?"). This yields a scalable testbed with controlled task complexity, measurable interaction efficiency, and strong baselines (classic automata-learning algorithms). Evaluating state-of-the-art LLMs, we find that performance drops sharply as DFA size increases. Reasoning models are markedly stronger than non-reasoning models, yet trajectory analyses reveal recurring failures in query planning, evidence integration, and hypothesis construction. Overall, our results show that current LLM agents can sometimes perform non-trivial interactive discovery, but remain far less robust and efficient than classic algorithms for the task.
This paper addresses a fundamental question: can LLM agents, equipped with tool-calling capabilities, actively uncover hidden environments through interaction? While LLMs have shown impressive performance on static tasks, their ability to perform interactive discovery—where they must plan queries, integrate evidence, and form hypotheses—is less understood. The authors introduce a novel testbed based on automata learning, which offers a controlled and scalable way to measure this capability. This is significant because it bridges the gap between classic computational learning theory and modern LLM agent research, providing a rigorous benchmark that can guide future development.
The paper's findings are sobering: current LLM agents, despite their advanced reasoning abilities, struggle to match the efficiency and robustness of classic algorithms like L*. This highlights a critical gap in current AI systems: they are not yet reliable at interactive exploration and hypothesis refinement. The work also underscores the importance of reasoning models, which show marked improvements, but still fall short. This paper matters because it sets a clear benchmark for measuring progress in agentic learning and exposes specific weaknesses that need to be addressed.
The paper reports that LLM agents' performance drops sharply as DFA size increases. For instance, while agents may succeed on small DFAs, their accuracy plummets on larger ones. Reasoning models (e.g., those with extended thinking) markedly outperform non-reasoning models, but even they are far less efficient than classic algorithms. The trajectory analysis reveals that agents often make redundant queries, fail to update their hypotheses based on new evidence, and propose incorrect DFAs. These results quantify the gap between LLM agents and algorithmic approaches, showing that current agents are not yet capable of robust interactive discovery.
This work has significant implications for the AI community. It provides a rigorous, controlled environment for evaluating and improving LLM agents' interactive learning abilities, which are crucial for real-world applications like autonomous experimentation, scientific discovery, and tool use. The identified failure modes offer actionable insights for future research, such as improving memory and hypothesis management in agents. Moreover, the benchmark can serve as a standard for measuring progress in agentic learning, much like other benchmarks in NLP. Ultimately, this paper pushes the field toward more capable and reliable AI agents that can actively learn from their environment.
Alex Krizhevsky, Ilya Sutskever et al.
Ashish Vaswani, Noam Shazeer et al.
Douglas M. Bates, Martin Mächler et al.
Diederik P. Kingma, Jimmy Ba