CORTEXA
← Browse
arxivcs.AIcs.LG2026-07-10

Beyond Fixed Representations: The Vocabulary and Verifier Gaps in Open-Ended AI

Yuan Cao, Haiqian Yang

Modern AI systems are increasingly being evaluated for their ability to reason, code, prove theorems, use tools, and long-horizon research tasks. These are powerful capabilities, but they share a structural limitation: the representational frame within which the model operates, including its conceptual vocabulary, the space of admissible solutions it can search, and the criteria by which success is evaluated, is typically fixed and supplied in advance. This paper argues that building stronger intelligent systems capable of open-ended innovation requires additional classes of operations: the creation, stabilization, and reuse of new representational primitives, which alter the space being searched rather than simply searching within it. We characterize the distance between current AI systems and genuinely open-ended intelligence through two gaps. The first is the vocabulary gap, the difficulty of inventing and stabilizing new representational primitives rather than merely recombining existing ones. The second is the verifier gap, the difficulty of judging the value of a new primitive when its full payoff may be visible only after future reuse. We interpret both gaps through a unified framework of intelligence as cognitive discrepancy reduction. By viewing intelligent behaviors as a sequence of cognitive transformations, we distinguish intra-space transformations which operate within a fixed representational frame, from generative transformations which may modify the frame itself. On this basis, we propose a ladder of innovation autonomy and outline several directions for advancing open-ended AI, including objectives that reward useful representational change, persistent memory architectures for invented primitives, and adaptive verification mechanisms capable of evolving alongside the representations they evaluate.

View free PDFSource page

Related papers

arxivcs.CLcs.AIcs.LG2026-07-22

Reference-Free Evaluation of Reasoning in Open-Ended Question Answering

Guneet Singh Kohli, Yuxiang Zhou, Michael Sejr Schlichtkrull, Gregory E Dean, Maria Liakata

AI-generated answers in high-stakes domains are often fluent but difficult to verify, especially when they contain multi-step reasoning rather than a single final answer. We propose a reasoning-based, reference-free framework for auditing LLM-generated outputs. The method decompo…

View free PDFSource page
arxivcs.LGcs.AI2026-07-09

Open-ended Multi-agent Autocurricula via Visual Inspection of Policies with Multi-modal LLMs

Lorenzo Pantè, Andrea Fanti, Roberto Capobianco

Open-ended curricula in Reinforcement Learning (RL) aim to train generally-capable agents by identifying tasks that facilitate learning increasingly complex skills. A major challenge when designing such curricula is assessing task difficulty relative to the agent's current learni…

View free PDFSource page
arxivcs.LGcs.AIeess.SY2026-07-07

Open-Ended Scenario Reasoning for Specialist Model Adaptation

Youcheng Zong, Runda Jia, Ranmeng Lin, Mingxuan Ren, Dakuo He

Process industries have accumulated validated specialist models, yet sensor drift, feedstock variation, and regime switching cause these models to degrade systematically in new scenarios. Collecting new labeled data and retraining is costly, while continuing with the original mod…

View free PDFSource page
arxivcs.LGcs.AIcs.NI2026-07-09

JEPA for AI-Native 6G: Predictive Representations and Open Challenges

Sheikh Salman Hassan, Irshad A. Meer, Almoatssimbillah Saifaldawla, Yan Kyaw Tun, Mustafa Ozger, Madyan Alsenwi, et al.

Sixth-generation (6G) networks are moving toward AI-native operation, where learning modules are embedded across the radio access network (RAN), edge, and core. This transition requires learning from limited labels, heterogeneous wireless and network data, partial observations, n…

View free PDFSource page
arxivcs.LGcs.AI2026-07-20

RRPO: Reference-Relative Policy Optimization with Stratified Conditional Rollouts

Yuxin Xiong, Xunyi Jiang, Rohan Surana, Xintong Li, Sheldon Yu, Nikki Lijing Kuang, et al.

Group Relative Policy Optimization (GRPO) has shown strong effectiveness in reinforcement learning from verifiable feedback, where sampled rollouts can be compared within a group using task-provided correctness signals. However, extending group-relative optimization beyond verifi…

View free PDFSource page