Research library

Search papers on equipment connectivity, quality inspection, production analysis, and manufacturing work.

Search and filter

New paper summaries

Summaries are editorial notes, not statements by the original authors. Check the original paper. Updated 2026-11-20.

  1. 880AI / General

    Why Does CLAUDE.md Keep Growing? Catastrophic Remembering in Agentic Coding

    • It tracked 247,694 instructions across 1,867 GitHub repositories and showed that agent prompts grow by 226% over their lifetime while the deletion probability only keeps falling.
    • The cause is incomplete recall: once the reason for adding an instruction disappears, it cannot be safely deleted, so additions continue indefinitely, with O(2^|D|) complexity.
    • 76.8% of instruction deletions happen in a single commit that rewrites the entire file, so individual deletions are rare.
    • If you annotate the prompt with why each instruction is needed, you can remove 99.3% of unnecessary instructions, reducing growth from +211.3% to +1.4%.
    • On the real WildIFEval benchmark, prompt annotations improved instruction-following accuracy by up to 23.1%.
  2. 879AI / General

    ComBodied Agents: a New Paradigm of Human-Centric Agentic AI

    • It proposes the Combodied Agents paradigm, which goes beyond the digital-agent and robot-agent split by treating the human state trajectory itself as the primary modeling target.
    • It designs an integrated closed loop of multimodal perception, long-term memory, personal world models, adaptive intervention policies, and feedback.
    • It clearly distinguishes this from human digital twins: it uses uncertainty-aware representations tailored to the task and does not require full replication.
    • It organizes the full design space, including edge-native personal models, scenario-centered evaluation, autonomy-preserving metrics, and governance directions.
    • It argues that success should be defined not by replacement of human work, but by improvement of human capability and judgment.
  3. 878AI / General

    Full-bandwidth transformer

    • We introduce latent feedback decoding, which feeds the full top hidden state from the previous token directly into the next input.
    • It adds less than 1% extra inference cost while preserving the standard Transformer structure and KV cache.
    • At 1B parameters and 400B training tokens, it consistently improves validation loss, math and code generation, and instruction following.
    • It saves about 1.5x training tokens for the same performance and in some tasks approaches models trained with 5x more tokens.
    • When latent feedback is enabled, the reasoning trace becomes shorter while accuracy is maintained or improved.
  4. 877Computer Vision

    Beyond Pixels: From Video Priors to 4D Worlds

    • It proposes Latent-to-4D, a framework that connects the VAE latent space of video generation models directly to a 4D decoder.
    • It skips the step of generating RGB images, which avoids information loss and error accumulation.
    • It is trained on about 1,000 existing reconstruction clips and can be reused across multiple video generators with a single checkpoint.
    • On the Text4D-200 benchmark, it improves DINO-F1 by 2.88 to 3.45 points, and on I4D-200 it improves by 5.81 points.
    • Human evaluation shows that it outperforms prior methods in geometric validity, completeness, and temporal stability.
  5. 876Neural Networks

    BDH-CQ: In-Context Learning with Recurrent Latent Reasoning

    • It proposes a 'latent reasoning' approach that performs recurrent reasoning in hidden state space without outputting tokens.
    • With a very small 150M-parameter model, it reaches 29.5% accuracy on ARC-AGI-1 at a cost of $0.0007 per task.
    • It sets a new cost-accuracy standard while cutting cost to about one-thousandth of the previous best system.
    • It systematically analyzes the strengths and limits of in-context learning from demonstrations alone, using experiments with color mapping, boundary propagation, rotation, and other compositions.
    • It designed an architecture that can scale naturally to 1 trillion parameters, and early experiments confirm Transformer-like scaling laws.
  6. 875LLMs / NLP

    Evo-Bench: Can Language Models Improve Agent Harness?

    • It creates the first benchmark for evaluating whether an LLM can autonomously improve the agent harness, meaning the execution code.
    • It introduces a strict design that avoids overfitting through harness-sensitivity-based task selection and separate validation and evaluation splits.
    • Evaluation on nine frontier models shows gains of up to 16.6 points and comes close to the human-designed baseline.
    • In the general domain, autonomous evolution beats the human design, but it shows limits in office workflows.
    • It confirms that the evolved harness acts as a transferable reasoning structure for other policy models.
  7. 874AI / General

    Matryoshka Language Model Suites

    • We propose the Matryoshka framework, which trains submodels of different sizes end to end in a single nested structure.
    • It reduces total training compute by 36% while matching the performance and validation and out-of-domain perplexity of independently trained models.
    • Free distillation from the largest model to the smaller ones happens automatically at every step.
    • The nested draft models improve speculative decoding throughput by 14% to 26%.
    • Extensive ablations validate the importance of width and depth settings, the junction mechanism, and the distillation loss.
  8. 873Computer Vision

    Sci-VBench: Evaluating Knowledge- and Reasoning-Intensive Video Generation in Science Domains

    • We built 1,253 expert-annotated video-generation tasks across 60 courses in four fields: natural sciences, medicine, humanities and social sciences, and engineering.
    • We provide an expert-written evaluation rubric and step-by-step scoring criteria from 1 to 5 for every example.
    • Non-expert raters also achieve high agreement with experts when given the rubric, with Cohen's kappa = 0.842.
    • Evaluation of 16 frontier models reveals similar visual quality but large gaps in scientific accuracy.
    • Prompt improvements help somewhat, but the limits in spatial and temporal consistency come from the generator itself.
  9. 872AI / General

    Rethinking Self-Evolving Agents: Do We Still Need Prescribed Optimization Pipelines?

    • It is the first systematic attempt to question whether framework-defined improvement procedures, or optimization meta-policies, are still necessary.
    • Using GPT-5.5, OEO beats the SKILLOPT and GEPA pipelines in 12 of 14 comparisons, with 1 tie and 1 loss.
    • OEO uses only 34.3 percent of the median tokens used by SKILLOPT, which demonstrates its efficiency.
    • For mid-sized models, prescribed pipelines work better, which reveals a model-capacity boundary for adaptive division of labor.
    • The prescribed procedures make optimization paths more consistent, but the path differences are larger than the final action differences.
  10. 871Computer Vision

    Unveiling the Secret of AdaLN-Zero in Diffusion Transformer

    • It breaks down the performance gains of adaLN-Zero into three factors: SE structure, zero initialization, and progressive updates.
    • Zero initialization is the most important factor, and the paper finds that the conditional modulation weights follow a Gaussian distribution after training.
    • It proposes adaLN-Gaussian, which initializes with a Gaussian distribution, to validate the analysis and obtain practical gains.
    • It proposes SE-adaLN-Zero, inspired by the SE structure, and achieves additional performance gains.
    • It confirms consistent improvements and generalization on four datasets, including ImageNet1K.
  11. 870Machine Learning

    Privileged Solutions or Context-Induced Teacher Behavior? Dissecting On-Policy Self-Distillation

    • It designs a controlled experiment, OP2SD, to distinguish whether OPSD's gains come from answer transfer or context-induced behavior.
    • Even when the teacher is given solutions to other math problems instead of the correct answer, the improvement is similar to OPSD.
    • When the context comes from physics rather than math, the effect weakens, showing that domain alignment in the context is necessary.
    • It confirms the same pattern across three Qwen3 models, 1.7B, 4B, and 8B, and on the AIME and HMMT benchmarks.
    • It shows that OPSD should not be interpreted only as privileged-information transfer, because context-induced behavior is also an important factor.
  12. 869Computer Vision

    Perception Before Supervision: Self-Contained Visual Distillation from Counterfactual Blind Spots

    • It proposes a three-stage verification criterion that finds visual blind spots using only the model's own counterfactual responses, without external models, annotations, or tools.
    • It performs contrastive distillation with an expanded view of the blind spot as the positive teacher and a removed view as the negative teacher.
    • On Qwen3-VL-8B, it improves all 12 benchmarks with no regression.
    • It records gains of +3.60 on OCRBench, +3.38 on fine-grained perception in MMStar, and +3.08 on logical reasoning.
    • It outperforms all six self-evolution baselines that depend on external GPT-4o supervision.
  13. 868Computer Vision

    World Tokens: Enhancing Embodied Policies with Training-Time World Modeling

    • It proposes the World Tokens architecture, which uses a video world model only during training and removes it at deployment.
    • The World Adapter converts VLM features into 256 tokens and conditions both video prediction and action generation on them.
    • The action expert cannot see the full VLM sequence directly, which prevents it from bypassing the world-model supervision.
    • With a 2B model, it reaches 98.2 percent on LIBERO, 71.5 percent on SIMPLER-WidowX, and 82.1 percent on SIMPLER-GoogleRobot.
    • On the real R1 Pro robot, it improves success from 59.4 percent to 76.0 percent compared with the matching baseline.
  14. 867AI / General

    Mismatch Matters: On-Policy Distillation Beyond Token Agreement

    • We discovered a degenerate agreement phenomenon in which the student cheats by repeating tokens to achieve high token-level agreement with the teacher.
    • We distinguish between surplus tokens, which the teacher scores near zero, and missing tokens, which the teacher wants but the student does not produce.
    • We propose TIDE, which corrects surplus tokens with Hellinger-distance-based bounded suppression and missing tokens with analytical top-K injection.
    • It raises Avg@8 from 6.9% to 20.3% under strong teacher-student disagreement.
    • It also cuts average response length by 3.6x while greatly reducing format failures.
  15. 866Robotics

    XPolicyLab: A Unified Standard and Open Ecosystem for Robot Policy Evaluation and Deployment

    • It proposes a unified standard that reduces the cost of connecting robot policies to environments from O(NM) to O(N+M).
    • It integrates 42 robot policies, including VLA, WAM, and imitation learning, behind one interface.
    • It creates a structure that isolates policy servers and environment clients according to software dependencies.
    • It cuts adaptation time for a new policy from more than 5 hours to 30 minutes when packaged skills are used.
    • It supports RoboTwin and RoboDojo simulation, as well as real robot evaluation, through one adapter.
  16. 865Robotics

    RynnValue: Scaling Robotic Value Foundation Models with Temporal Distance

    • It changes the supervision target for reward models from progress to temporal distance, meaning cost-to-go to the goal, so scaling no longer requires preference labels.
    • It trains on heterogeneous robot data covering 7,000 hours and about 3 million clips.
    • Time-order shuffling and value-isolation attention keep the model from relying only on the learned values.
    • It surpasses the previous best preference-labeled model, 0.655, by reaching 0.675.
    • In real robot RL, it improves success rates from 52.5 percent to 72.5 percent online and from 63.8 percent to 82.5 percent offline.
  17. 864Computer Vision

    Learning How the World Evolves: Extrapolative Video World Models via Latent Dynamics Reasoning

    • We propose LDR, the first video world model to explicitly infer the laws of motion in latent space.
    • The architecture enforces learning of physical laws by numerically integrating the lower-order dynamics and having the model regress only the third- and higher-order residual that drives the rollout.
    • It operates with 26x fewer parameters and 143x faster speed than video diffusion models.
    • Its out-of-distribution error gap is more than 20x smaller, showing strong extrapolation ability.
    • It accurately generalizes learned dynamics even when color, shape, and orientation change.
  18. 863Computer Vision

    Sekai2: From World Exploration to Interactive World Modeling

    • It provides 2,826 hours of real-world video, 128,892 clips, and camera trajectories with hierarchical annotations across 113 countries.
    • It creates 649,597 time-level segments that separate subject motion, environmental change, static scenes, and camera behavior.
    • It offers 982 loop videos revisiting 360-degree panoramas, which provide supervision for long-range spatial consistency.
    • It cross-validates that the captions generated independently of camera annotations are aligned with actual camera motion.
    • It provides a scalable data foundation for video generation, camera control, and pretraining interactive world models.
  19. 862AI / General

    Motif 3: Technical Report

    • It uses an ultra-fine MoE architecture that selects only 8 experts per token out of 384, increasing capacity while reducing compute.
    • Grouped Differential Latent Attention, or GDLA, achieves both noise suppression and KV cache compression.
    • It is pretrained on 12.5 trillion tokens and then uses multi-teacher on-policy distillation, or MOPD, to unify diverse capabilities into one model.
    • It supports a 256K context length and stabilizes large-scale training with MXFP8 precision.
    • Among open-weight models, it shows competitive performance on agent tasks, math reasoning, and scientific knowledge.
  20. 861Machine Learning

    Macaron-V1: Towards Open Continual Learning with Self-Improvement and Mixture-of-LoRA

    • The system uses a Mixture-of-LoRA structure that keeps the base model frozen and selects expert adapters for chat, agent, coding, or GenUI on each turn.
    • It proposes a framework for continual learning after deployment through joint model and harness design plus a recursive self-improvement loop.
    • It releases Venti, a 744B model based on GLM-5.2, and Tall, a 50B model based on Qwen3.6.
    • It also develops UI4A, a component-native GenUI harness, and MindForge, an agent RL framework.
    • It shows competitive performance with frontier models on Personal Intelligence, GenUI, and general capability benchmarks.
  21. 860Robotics

    JEPA-WAM: Learning Vision-Language-Action Policies with Joint-Embedding World Modeling

    • It proposed a latent world-action model that predicts relationships between current and future spatial structure in a pretrained V-JEPA representation space, without generating video directly.
    • It combined transition prediction and continuous action generation in a single predictor so that future supervision directly refines the core structure that forms action representations.
    • On LIBERO-Plus, the setting without prior robot-policy training achieved 79.2%, and the setting combined with π0.5 achieved 86.3%, each yielding the highest result.
    • It also generalized to changes in visual and spatial conditions on RoboTwin 2.0 and a real dual-arm robot, showing potential for robot control without the cost of video generation.
    • Because the transition objective learns shared visual structure independent of language, it may lack expressive power for tasks where different instructions produce substantially different futures from the same scene.
  22. 859LLMs / NLP

    SWE-Bench ProMax: Benchmarking Agents on Large-Scale Multilingual Code Refactoring

    • It quantifies the problem that 60% of existing benchmarks contain bad tests that are either too narrow or too broad.
    • It builds a multilingual refactoring benchmark across seven programming languages: Python, Java, TypeScript, Go, C, C++, and Rust.
    • The tasks are large, with an average of 11.4 files and 261.6 lines of code to change, which makes them more than three times more complex than prior benchmarks.
    • GLM-5 shows strong value for money by matching Claude Sonnet 4.6 at about one twentieth of the cost.
    • Failure analysis shows that the main problem is not modifying enough of the files that actually need to change.
  23. 858AI / General

    Stealing Reasoning Traces from Proprietary LLM APIs

    • It discovers a fundamental design flaw in encrypted reasoning blocks that makes them interchangeable across sessions, users, and models.
    • It demonstrates a cross-model attack that turns the reasoning of a strong model into something that can be decoded by a weaker model against OpenAI, Anthropic, and Google.
    • It recovers real sensitive information from public developer logs, including 62 API keys, 33 passwords, and 30 emails.
    • It also confirms an invisible prompt-injection attack vector that passes through encrypted blocks.
    • It highlights the fundamental limits of encryption-based approaches and proposes concrete mitigation measures for both vendors and users.
  24. 857LLMs / NLP

    Benchmarking the Benchmarks: Evaluating Benchmarks for Conversational Agents

    • It proposes an LLM-judge-based framework for evaluating the consistency, complexity, and policy coverage of conversational-agent benchmarks without reference labels.
    • It validates the framework with benchmarks generated by LLMs of different strengths and consistently distinguishes quality differences across benchmarks made by models with different capabilities.
    • The metrics also detect the expected drop in quality on deliberately degraded benchmarks.
    • Correlation tests against human annotation show a medium-to-strong statistically significant correlation.
    • It also applies the framework to manually curated benchmarks, such as tau3-bench, to demonstrate practical usefulness.
  25. 856Computer Vision

    UniJEPA: A Unified Joint-Embedding Predictive Architecture for Task-Agnostic Visual World Modeling

    • It proposes a single objective that jointly learns image-level transformation prediction and video-level temporal prediction in one latent space.
    • End-to-end training is possible without EMA, stop-gradient, or a pretrained encoder, and Gaussian regularization prevents representation collapse in a mathematically grounded way.
    • Photometric prediction learns invariant structure, temporal prediction learns equivariant dynamics, and the balance between them controls the level of abstraction.
    • It achieves competitive or better performance than individual JEPA models on ImageNet, Something-Something-v2, Epic-Kitchens, and control benchmarks.
    • After action-conditioned post-training, it supports zero-shot planning and plans up to tens of times faster than generative world models.
  26. 855Software Engineering

    Self-Evolving Coding Agents

    • It clearly defines self-evolving coding agents as distinct from general coding agents and general self-evolving agents.
    • It classifies six evolution targets: framework, memory, skills and tools, model, workflow, and topology, which it calls an object-centered taxonomy.
    • It adds two auxiliary axes: when evolution happens, such as during a task, after a task, or step by step, and software-specific evidence, such as execution feedback, repository context, and coding traces.
    • It argues that executable feedback, repository-level context, and coding traces make software engineering a natural domain for agent self-evolution.
    • The paper's challenges are feedback reliability, benchmark overfitting, safety, maintainability, cost, and generalization, and the paper list is publicly available on GitHub.
  27. 854Machine Learning

    Modular TTT: Rethinking Test-Time Training as Composable Modules

    • It expresses the internal learner of TTT as a DAG and builds a modular framework where loss functions, learning rates, weight decay, and normalization can be adjusted independently.
    • Small learning-rate initialization, weight decay, and single-layer nonlinearity, specifically SiLU, consistently improve performance.
    • In contrast, deep fast-weight networks and normalization hurt performance because activation values become too large. Residual connections and gating have little effect.
    • The best variant trains 410M and 1.45B models on 100B tokens and reaches performance on par with Gated DeltaNet.
    • Developed at ByteDance, it releases an optimized implementation that improves training throughput several times over prior TTT systems.
  28. 853Computer Vision

    SimWAM: A Simple World Action Model for End-to-End Autonomous Driving

    • We propose SimWAM, a structure that uses video generation only as a training signal and removes it at inference time, so real-time video generation is unnecessary and inference is faster.
    • Because the video expert and action expert do not share parameters, it is easy to replace the video model with a better one or scale the action model.
    • On NAVSIM, it achieves 91.5 PDMS. It performs better than prior world-action-model-based planners while keeping inference latency much lower.
    • We additionally apply reinforcement learning (GRPO) to optimize complex driving rewards beyond trajectory imitation.
    • Zero-shot transfer to the nuScenes dataset also confirms generality.
  29. 852AI / General

    SkillProx: Self-Evolving Agent Skills via Proximal Textual Gradient Descent

    • It formulates skill modification as a forward-backward optimization problem. The forward pass verifies diagnosis, revision, and execution, while the backward pass estimates the usefulness of each knowledge unit for integration or removal.
    • It introduces a result-based verification loop that reruns the same task after revision and rolls back if performance drops.
    • In the backward pass, it measures the contribution of each knowledge unit with a leave-one-out scheme, and removing bad knowledge improves accuracy from 46 percent to 54 percent.
    • Across three backbone LLMs, it achieves an average accuracy gain of 3.0 percentage points over the previous best method.
    • Unlike prior methods that only keep adding skills, its key distinction is that it explicitly asks what should be removed.
  30. 851Computer Vision

    Addressable Memory for Video World Models

    • We precisely diagnose the cause of long-term memory failure in video world models as distribution shift in positional encoding (RoPE).
    • WorldTrace assigns each memory summary a virtual position within the training range, restoring memory accessibility without extra training.
    • WorldTrace-Field improves temporal consistency by 15.5%, and WorldTrace-Landmark improves recall of previous scenes by 19.5%.
    • We propose LoopBench, a new benchmark that measures whether a model can recover after a long detour back to the original scene.
    • It was developed at NVIDIA and can be applied directly to existing models without retraining.

From research to product use

Operating capabilities, pilots, and technologies in development are identified separately.

View technology