Unsupervised skill discovery has emerged as a promising approach for leveraging reward-free datasets to pretrain general-purpose policies. However, current skill discovery methods either require access to expert data or exhibit limited generalization, failing to transfer effectively to previously unseen layouts. A key...
Mohammad Amin Abbasfar, Farbod Azimmohseni, M. Rohban· 0 citations
Evolutionary approaches to LLM-driven discovery often generate new programs from a small set of selected ancestors. This keeps contexts manageable but can omit useful evidence from other experiments, whereas including the full experimental history produces long, redundant contexts. We introduce a simple, single-agent d...
Bo Yuan, Wenqian Ye, Ze-Lin Zhao et al.· 0 citations
Looped language models increase effective depth by repeatedly applying a shared block of layers, but existing large-scale recipes require multi-stage training over trillions of tokens, while the benefits of recurrence remain difficult to separate from differences in data and training. In this work, we establish practic...
Andrei Marchenko, Viacheslav Bezrukov, Oleg Kashurin et al.· 0 citations
VisionQ is introduced, the first benchmark built from peer-reviewed CV comparison figures that grounds every judgment in a named visual criterion: each question states the criterion, and a judge is credited only when it selects the output the authors identify as best on that criterion.
Xuân Định Vũ, Duc-Hai Nguyen, M. Dao et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Diffusion large language models (dLLMs) generate text by denoising a sequence or successive blocks, allowing several tokens to be revealed in parallel. Reinforcement learning with verifiable rewards (RLVR) reuses terminal feedback across these decisions, even as their conditioning context changes. We propose stepwise r...
Yue Yu, Bo-Wen Zuo, David J. Crandall et al.· 0 citations
The performance of AI coding agents is highly dependent on their underlying coding rules. However, existing coding rules are typically hand-crafted and fixed, making the process labor-intensive and often suboptimal. In this work, we propose RuleEvolve, a self-evolving framework for coding rules. RuleEvolve maintains a...
Zheng-Yuan Jiang, Reachal Wang, Yue-Peng Hu et al.· 0 citations
Grokking refers to the delayed emergence of validation-set generalization after a model has already overfit the training set. Although first observed in small algorithmic tasks trained with transformers, its underlying mechanism remains unsettled. In this work, we develop an analysis framework based on mode connectivit...
Yongding Tian, Zaid Al-Ars, Maksim Kitsak et al.· 0 citations
In this paper, we extend earlier findings of supra-competitive outcomes in optimal-execution games by identifying a learned punitive mechanism that deters deviations and provides behavioural evidence of collusion. We investigate this mechanism in a two-player, finite-horizon Almgren-Chriss liquidation game. Independent...
Christos-Spyridon Koulouris, Carlo Campajola· 0 citations
Large Language Models increasingly serve as interfaces for knowledge-intensive information seeking tasks across languages by synthesizing multilingual evidence. Prior work has shown that they often exhibit query-language preference -- the tendency to favor sources written in the language of the query -- but has largely...
Dayeon Ki, Ruochen Zhang, Silviu Cucerzan et al.· 0 citations
Vision-language-action policies often see only one or a few recent frames, which makes it difficult to evaluate how they use information that disappears during a task. We introduce MIKASA-Robo-VLA, a benchmark of 90 language-conditioned manipulation tasks. All but 10 hide the cue an action depends on. Those 10 are reac...
Egor Cherepanov, Nikita Kachaev, Aleksandr I. Panov et al.· 0 citations
Reasoning-enabled VLA policies expose chain-of-thought (CoT) traces that appear to explain and guide their actions, creating a potential interface for runtime safety through reasoning monitoring and correction. In this work, we define and operationalize two evaluation axes for assessing when this interface can improve...
Sathwik Karnik, J. Lee, Aryaman Gupta et al.· 0 citations
In partially observable reinforcement learning (RL), a later observation can make stored information obsolete or change what it implies for the next decision. Memory architectures and benchmarks for RL mostly test retention, the ability to keep information unchanged until it is needed. We formalize two further requirem...
Oleg Shchendrigin, E. Cherepanov, A. Panov et al.· 0 citations