activity
20232026
collaborators
Showing cs.LGShow all

9 papers · 1 filter

cs.LG2026

Learning Explicit Behavioral Models with Adaptive Questions and World-Model Probes

Hikaru Shindo, Yu Deng, Teng Cao +5

Interactive agents trained only against task return can achieve high scores while failing to represent the mechanisms that make their actions succeed. This makes brittle behavior d…

cs.LG2026

Kintsugi: Learning Policies by Repairing Executable Knowledge Bases

Teng Cao, Yu Deng, Hikaru Shindo +6

Modern embodied agents achieve impressive performance, but their task knowledge is often stored in neural weights, latent state, or prompt-bound memory, making individual policy kn…

cs.LG2025

Adaptable Hindsight Experience Replay for Search-Based Learning

Alexandros Vazaios, Jannis Brugger, Cedric Derstroff +2

AlphaZero-like Monte Carlo Tree Search systems, originally introduced for two-player games, dynamically balance exploration and exploitation using neural network guidance. This com…

cs.LG2025

Deep Reinforcement Learning Agents are not even close to Human Intelligence

Quentin Delfosse, Jannis Blüml, Fabian Tatai +6

Deep reinforcement learning (RL) agents achieve impressive results in a wide variety of tasks, but they lack zero-shot adaptation capabilities. While most robustness evaluations fo…

cs.LG2025

Deep Reinforcement Learning via Object-Centric Attention

Jannis Blüml, Cedric Derstroff, Bjarne Gregori +3

Deep reinforcement learning agents, trained on raw pixel inputs, often fail to generalize beyond their training environments, relying on spurious correlations and irrelevant backgr…

cs.LG2025

Polynomial Regret Concentration of UCB for Non-Deterministic State Transitions

Can Cömer, Jannis Blüml, Cedric Derstroff +1

Monte Carlo Tree Search (MCTS) has proven effective in solving decision-making problems in perfect information settings. However, its application to stochastic and imperfect inform…