Code Generation & Program Synthesis - Weekly Roundup

Coding agents routinely fail to build agents that truly meet user requirements, with the gap between demonstration and delivery being the norm.

Human GUI interactions can be precisely captured and translated into reusable agent skills, dramatically boosting performance on unseen software and workflows.

Spatial coding agents can be distilled into standalone MLLMs, achieving superior spatial reasoning and generalization without external tools.

LEGO-building AI agents can assemble physically valid structures from text prompts, but their designs lag significantly behind human creativity and complexity.

Robots can achieve 70% success on complex bimanual tasks using only code for decision-making, bypassing runtime vision-language models entirely.

Coding agents routinely fail to build agents that truly meet user requirements, with the gap between demonstration and delivery being the norm.

Human GUI interactions can be precisely captured and translated into reusable agent skills, dramatically boosting performance on unseen software and workflows.

Spatial coding agents can be distilled into standalone MLLMs, achieving superior spatial reasoning and generalization without external tools.

LEGO-building AI agents can assemble physically valid structures from text prompts, but their designs lag significantly behind human creativity and complexity.

Robots can achieve 70% success on complex bimanual tasks using only code for decision-making, bypassing runtime vision-language models entirely.

Weisfeiler-Lehman graph kernels unlock superior structural features for algorithm selection, outperforming traditional methods on challenging constraint satisfaction problems.

LLMs can now generate executable feature programs from long text, enabling efficient structured data prediction without real-time LLM inference.

LLM test generation quality is overestimated by 30% when evaluated against single references, with a new metric revealing widespread missed behaviors and faulty assertions.

Most AI agent skills copied on GitHub originate from a few hidden hubs, rendering security patches ineffective for the vast majority of users.

Coding agent benchmarks can now dynamically scale difficulty and avoid data leakage by having agents evaluate each other, with the latest models generating tasks that defeat older solvers 10x more often.

Synthesized software environments unlock a 50% boost in CUA performance on unseen benchmarks, proving scalable supervision is key.

Automated kernel discovery now yields reusable inductive biases that generalize beyond training data, outperforming meta-learned deep kernels and even human-refined versions on unseen tasks.

Small Language Models can parse ML pipeline structures, but their insights into data science practices diverge significantly from other classifiers, highlighting the critical impact of taxonomy definition.

Current LLMs struggle to translate visual scenes into executable geometric functions, failing even basic trajectory generation tasks.

Key contribution not extracted.

Real-world coding agent usage reveals that task flow, not just task completion, dramatically impacts agent cost and effectiveness, suggesting current benchmarks are misaligned with user behavior.

Broader tokenizer alignment in on-policy distillation can actively harm performance by introducing noisy supervision signals.

Sparse MoE models match dense models' code repair correctness with drastically fewer active parameters, challenging the sole reliance on total parameter count for evaluating code generation efficiency.

Automated code generation from 3DGS papers not

Software engineering agents learn significantly more from failed attempts by conditioning recovery trajectories on explicit verifier feedback, boosting resolution rates by up to 10% on SWE-bench.

LLMs can now autonomously debug complex chip designs by translating natural language queries into SQL against massive simulation dumps.

Reasoning in base LLMs can be unlocked by simply prepending specific tokens, matching RL-tuned performance on math and coding.

GPU kernel optimization agents can regress by up to 19% when transferring distilled knowledge across DSLs, revealing that source attempt quality, not just success, dictates transfer efficacy.