Working memory (WM) supports the temporary retention of task-relevant information. It is limited in capacity and inherently noisy. The ability to flexibly allocate WM resource is a hallmark of adaptive behavior. While it is well established that WM resource can be prioritized via selective attention, whether they can be allocated based on reward incentive alone remains under debate--raising open questions about whether humans can efficiently allocate WM resource based on utility. To address this, we conducted behavioral experiments using orientations as stimuli.

Welcome to our monthly digest, where you can catch up with any AIhub stories you may have missed, peruse the latest news, recap recent events, and more. This month, we found out how foundation models are being used for conservation efforts, how AI can help with scarce resource allocation, and how color metaphors and LLMs can teach us about human cognition. We also went to ICRA and captured some footage of cutting-edge robots. In this latest interview in our AAAI Fellow series, we found out about Tanya Berger-Wolf's research developing a foundation model for biology, the insights this model can provide for conservation and protecting ecosystems, interesting collaborations over the years, and what the future has in store. In this interview, we chat to Sanmay Das, who was elected as a Fellow "for development of multiagent interaction mechanisms and learning techniques in the public interest, and for leadership service to the profession".

Test-Time Scaling (TTS) improves the performance of Large Language Models (LLMs) by using additional inference-time computation to explore multiple reasoning paths through search. Yet how to allocate a fixed rollout budget most effectively during search remains underexplored, often resulting in inefficient use of compute at test time. To bridge this gap, we formulate test-time search as a resource allocation problem and derive the optimal allocation strategy that maximizes the probability of obtaining a correct solution under a fixed rollout budget. Within this formulation, we reveal a core limitation of existing search methods: solution-level allocation tends to favor reasoning directions with more candidates, leading to theoretically suboptimal and inefficient use of compute. To address this, we propose Direction-Oriented Resource Allocation (DORA), a provably optimal method that mitigates this bias by decoupling direction quality from candidate count and allocating resources at the direction level. To demonstrate DORA's effectiveness, we conduct extensive experiments on challenging mathematical reasoning benchmarks including MATH500, AIME2024, and AIME2025. The empirical results show that DORA consistently outperforms strong baselines with comparable computational cost, achieving state-of-the-art accuracy. We hope our findings contribute to a broader understanding of optimal TTS for LLMs.

Each year the AAAI recognizes a group of individuals who have made significant, sustained contributions to the field of artificial intelligence by appointing them as Fellows. We're talking to some of the 2026 AAAI Fellows to find out more about their work. In this interview, we chat to Sanmay Das, who was elected as a Fellow . Could you start with a quick introduction, where you work, and your general area of research? Broadly speaking, I work in multiagent systems. I've done a lot of work at the intersection of AI and economics, and over the last decade or so I've thought a lot about projects in the AI for social impact and social good space. In particular, my interest has been in the allocation of scarce societal resources, thinking about how AI can be integrated, and what it tells us about systems where we don't necessarily want full free market resource allocation.

Modern real-time systems require accurate characterization of task timing behavior to ensure predictable performance, particularly on complex hardware architectures. Existing methods, such as worst-case execution time analysis, often fail to capture the fine-grained timing behaviors of a task under varying resource contexts (e.g., an allocation of cache, memory bandwidth, and CPU frequency), which is necessary to achieve efficient resource utilization. In this paper, we introduce a novel generative profiling approach that synthesizes context-dependent, fine-grained timing profiles for real-time tasks, including those for unmeasured resource allocations. Our approach leverages a nonparametric, conditional multi-marginal Schrödinger Bridge (MSB) formulation to generate accurate execution profiles for unseen resource contexts, with maximum likelihood guarantees. We demonstrate the efficiency and effectiveness of our approach through real-world benchmarks, and showcase its practical utility in a representative case study of adaptive multicore resource allocation for real-time systems.

However, inmanyapplications including contractual hiringinonlinefreelancing platforms and server allocation in cloud computing systems, the outcome of each action is observed only after a random and action-dependent time.