AesCode 8B Gains 31.1 Points in Its Own Benchmark

Today's Overview

  • AesCode Separates Verifiable Correctness From Aesthetics. Its 8B model improved visual quality by 31.1 percentage points over a same-size Qwen3-VL baseline using identical reference images. Results across products still need testing.
  • ReTerm Turns Failures Into Recovery Starting Points. It raised Qwen3.5-9B's Pass@1 on Terminal-Bench 2.0 from about 20.2% to 34.8%. Nearly two-thirds of tasks remain unsolved.
  • Jeva Replaces Text Generation With Dedicated Scoring. It treats null answers, permutation invariance, changing candidate sets, and cross-request caching as architectural constraints for low-latency classification and routing.

Featured

01 Code Intelligence: Why Correct Slides Still Look Bad

Code-generated slides and dashboards must satisfy competing goals. Their text and data must be correct, while their layouts and colors must look good. AesCode represents each canvas as a design graph instead of asking the model to copy a reference image directly.

The graph connects elements, attributes, and relationships to both code and rendered output. This makes each score traceable. Deterministic verifiers check properties that can be parsed from code or pages. A vision-language model judges harder visual qualities against sample-specific criteria. Each reward channel is normalized separately before reinforcement learning. Aesthetic scores cannot mask content errors, while strict checks do not reduce design to mechanical templates.

The abstract reports visual-quality gains of 31.1 and 22.4 percentage points for the 8B and 32B versions. Both comparisons use same-size Qwen3-VL baselines with identical reference images. These are internal results, so gains across products, styles, and real editing workflows still need testing.

Key takeaways:

  • Separate content correctness from visual quality so one combined score cannot hide failures.
  • Use a design graph as a shared interface between code, rendered output, and visual evaluation.
  • A 31.1-point gain supports the training approach, but does not establish real-product performance.

02 Agent: Finishing After Mistakes Is the Scarce Skill

Terminal agents often struggle to recover from command errors or faulty implementations during long-running execution. ReTerm makes those failure states the starting point for training. It begins with supervised fine-tuning on 10,000 recovery demonstrations.

The agent then branches from its own failed states and tries several independent recovery paths. Whether each path eventually completes the task supplies the reinforcement signal. Training Qwen3.5-9B this way raised Pass@1 on Terminal-Bench 2.0 from about 20.2% to 34.8%.

Recovery training clearly raises the capability floor, but nearly two-thirds of tasks still fail. More environments must show whether the skill generalizes. Coding-agent teams should retain failures as training assets containing the error, context, and subsequent correction.

Key takeaways:

  • Failed trajectories matter because they can teach agents to finish tasks from erroneous states.
  • Branching from failure points turns an agent's own execution history into reinforcement-learning signals.
  • A 34.8% Pass@1 is meaningful progress, but cannot support reliability claims.

03 Architecture: Four Constraints for Low-Latency Routing

Jeva replaces text generation with a dedicated scoring interface for structured, low-latency decisions. It separately predicts when no candidate fits, rather than confusing absence with uncertainty among available choices.

Symmetric aggregation keeps decisions unchanged when candidates are reordered. Shared scoring naturally supports candidate sets that grow or shrink. Jeva also stores candidate representations as reusable read-only memory. Each request updates only its own state, while recurring candidate representations and their layer projections can be reused across requests.

The abstract reports no decision flips across the tested candidate permutations. Jeva also scales to thousands of candidates and cuts latency through reuse. Exact throughput, cache costs, and task coverage still require confirmation from the full paper. Low latency may come from stopping text generation altogether, not merely generating faster.

Key takeaways:

  • For frequent candidate decisions, evaluate dedicated scoring interfaces instead of only compressing autoregressive decoding.
  • Test null answers, candidate reordering, and candidate-set expansion separately before release.
  • Systems with frequently reused candidates should measure latency gains from pre-encoding and cross-request caching.
AesCode 8B Gains 31.1 Points in Its Own Benchmark

Also Worth Noting

04
Cache Structured Scores for Video Questions and Temporal Localization MultimodalFollow-up queries over the same visual history can reuse cached visual computation. Performance across four video-question-answering benchmarks matches the backbone's Thinking mode, with measured acceleration above 100×. link
05
Align 100 Hours of Wearable Data for Humanoid Learning RoboticsThe dataset connects first-person video, full-body motion, finger joints, and touch during mobile manipulation in workplace settings. Against tracker-fitted references, body-point error falls 71.9% relative to the strongest baseline, alongside better hand stability and contact estimates. link
06
Turn Task Progress Into Dense, Verifiable Agent Rewards TrainingThe method first builds task worlds with complete hidden states, then derives stage-based progress rewards. Tev-Gym contains 1,170 verified task environments across seven domains. link
07
Separate Motion Shape From Physical Magnitude ArchitectureOne motion-residual prior transfers across cloth, animals, and soft robots without retraining. It also handles unseen geometry families without skeletons, registration, or cross-mesh correspondence. link
08
Scale Generative Reconstruction to Large Scenes Image GenA global point cloud provides the scaffold, while chunked generation passes context between neighboring regions. Synchronized structure, geometry, and material context preserve scene-level consistency across overlapping chunks. link
09
Infer the Right Similarity Criterion at Test Time RetrievalA small amount of feedback identifies which provided similarity standard fits the current task. BASIS requires no training and handles criteria that vary between instances, but it cannot discover new standards. link
10
Condition Schrödinger Bridges Without Retraining Image GenTime-adjusted twisted sequential Monte Carlo handles conditional generation and image inverse problems. A changing exponent downweights unreliable early guidance, while telescoping importance weights yield an asymptotically exact sampler for the posterior. link
11
Estimate Cyclic-Permutation MinHash Variance More Clearly RetrievalA more comparable approximate variance expression helps quantify estimator error for circulant-permutation MinHash. Numerical experiments align the expression with the estimator's empirical mean squared error. link
12
Guarantee Exact Persistent Homology in Generated Graphs AI for ScienceProvable local constructions and global constraint solving replace topology consistency as a soft penalty. Both approaches exactly reproduce target persistence diagrams across four graph-generation benchmarks. link

Today's Observation

All three featured papers move deployment failures into the learning problem. AesCode separates aesthetics from verifiable correctness. ReTerm trains recovery from actual failure states. Jeva encodes null answers, permutation invariance, and candidate expansion as architectural constraints.

Before scaling models or adding data, list the failure semantics your system must detect, recover from, or never violate. Then decide whether each belongs in the representation, reward, or training data. This week, build that list for one production task and label each item. Turn at least one into an automated pre-release test.