Searcharxiv⌕ Search

arXiv subjects

Nazım Kemal Üre

Publications and source records attributed to Nazım Kemal Üre.

3 recordsLinked to original sources

Value-Aware Prediction for Robust Multi-Agent Coordination Under Communication Loss

Robust multi-agent coordination relies heavily on inter-agent communication, which is frequently disrupted by physical and environmental constraints in real-world deployments. To maintain operation during these intermittent communication failures, agents can employ internal prediction models to estimate missing shared state information. However, predictors trained with standard reconstruction objectives treat all transitions equally. In a Reinforcement Learning context, this forces the model to waste capacity learning stochastic exploration noise and the outdated dynamics of suboptimal policies. In this paper, we propose a value-aware extension of Multi-Agent Observation Sharing under Communication Dropout (MARO) to patch communication gaps; we refer to this method as Value-Aware MARO. By dynamically weighting the predictor's loss function using advantage estimates derived from the underlying actor-critic architecture, our objective explicitly couples the predictor's learning process to the policy's evolution. This formulation focuses the model's capacity on the intentional, high-return dynamics actively reinforced by the agents. We evaluate our framework on several tasks within the Multi-Agent Particle Environment under varying communication reliability levels. Experimental results demonstrate that our approach maintains performance under declining communication reliability, particularly below 40%. While our method performs comparably in tasks where the baseline already maintains high coordination, our value-aware weighting effectively prevents the performance collapse observed in the standard predictor during high-attrition scenarios. In these environments, our method achieves an average improvement in mean returns of more than 20% and reduces performance variance by a mean of 64.7% compared to the standard unweighted baseline.

cs.MA↗

Tokalator: A Context Engineering Toolkit for Artificial Intelligence Coding Assistants

Artificial Intelligence (AI)-assisted coding environments operate within finite context windows of 128,000-1,000,000 tokens (as of early 2026), yet existing tools offer limited support for monitoring and optimizing token consumption. As developers open multiple files, model attention becomes diluted and Application Programming Interface (API) costs increase in proportion to input and output as conversation length grows. Tokalator is an open-source context-engineering toolkit that includes a VS Code extension with real-time budget monitoring and 11 slash commands; nine web-based calculators for Cobb-Douglas quality modeling, caching break-even analysis, and $O(T^2)$ conversation cost proofs; a community catalog of agents, prompts, and instruction files; an MCP server and Command Line Interface (CLI); a Python econometrics API; and a PostgreSQL-backed usage tracker. The system supports 17 Large Language Models (LLMs) across three providers (Anthropic, OpenAI, Google) and is validated by 124 unit tests. An initial deployment on the Visual Studio Marketplace recorded 313 acquisitions with a 206.02\% conversion rate as of v3.1.3. A structured survey of 50 developers across three community sessions indicated that instruction-file injection and low-relevance open tabs are among the primary invisible budget consumers in typical AI-assisted development sessions.

cs.SE↗

GAN-based Intrinsic Exploration For Sample Efficient Reinforcement Learning

In this study, we address the problem of efficient exploration in reinforcement learning. Most common exploration approaches depend on random action selection, however these approaches do not work well in environments with sparse or no rewards. We propose Generative Adversarial Network-based Intrinsic Reward Module that learns the distribution of the observed states and sends an intrinsic reward that is computed as high for states that are out of distribution, in order to lead agent to unexplored states. We evaluate our approach in Super Mario Bros for a no reward setting and in Montezuma's Revenge for a sparse reward setting and show that our approach is indeed capable of exploring efficiently. We discuss a few weaknesses and conclude by discussing future works.

cs.LG↗