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. 489LLMs / NLP

    Self-Compacting Language Model Agents

    • Fixed token-threshold compression can trigger in the middle of reasoning or retrieval and accidentally delete verified facts.
    • The method combines a compression tool that the model can call directly with a lightweight rubric that says to compress when a subtask is solved and suppress compression during reasoning.
    • When the tool is provided without the rubric, usage varies widely across models and is often invoked at the wrong time, which shows that the rubric is essential.
    • On math benchmarks such as IMO-Answerbench and HMMT, it improves by up to 18.1 points over the no-compression baseline.
    • On agentic search tasks such as BrowseComp, it improves by 5 to 9 points while reducing token cost by 30 to 70 percent per question.
    • Adaptive compression is possible at inference time alone, without any fine-tuning or external supervision.
  2. 488Robotics

    World Value Models for Robotic Manipulation

    • This is the first approach to reuse the spatiotemporal prior knowledge of world models as the basis for robotic value estimation.
    • It combines a video-generation stream and a value DiT through a Mixture-of-Transformers, or MoT, to minimize representation interference.
    • It formulates the value function as a flow-matching-trained distributional chunk, which provides dense learning signals.
    • It releases Suboptimal-Value-Bench, which consists of 800 suboptimal trajectories plus human labels.
    • It achieves SOTA on both the expert VOC and Suboptimal-Value-Bench, and it also improves downstream policy learning consistently.
  3. 487Computer Vision

    DiffusionBench: On Holistic Evaluation of Diffusion Transformers

    • It builds NanoGen, a unified training and evaluation framework that can switch from ImageNet to text-to-image training with only 12 lines of configuration changes.
    • After training 21 latent diffusion models, it confirms almost no correlation between ImageNet rank and text-to-image rank, with Pearson coefficients from -0.377 to -0.580.
    • It provides empirical evidence that better ImageNet FID does not translate into better text-to-image quality.
    • It releases a unified codebase that supports RAE, VAE, pixel-space, and MeanFlow.
    • DiffusionBench is a holistic benchmark that combines ImageNet and text-to-image results and is recommended as the default reporting standard for future DiT research.
  4. 486AI / General

    OpenThoughts-Agent: Data Recipes for Agentic Models

    • The authors run more than 100 controlled ablation studies on a six-stage SFT data pipeline to quantify the effect of each stage.
    • Instruction selection is the most important factor in the pipeline, which shows that the strongest model is not necessarily the best teacher.
    • Fine-tuning Qwen3-32B on 100K examples yields 54.0 percent on SWE-Bench Verified and 26.2 percent on Terminal-Bench 2.0.
    • The average score is 44.8 percent, which is 3.9 points better than the previous best open-data agent model, Nemotron-Terminal-32B at 40.9 percent.
    • It shows scaling behavior that beats competing open datasets across all training-set sizes.
    • It confirms that an 8B model trained with SFT and RL in two stages outperforms both pure SFT and pure RL.
  5. 485AI / General

    SPIRAL: Learning to Search and Aggregate

    • It is the first framework to jointly optimize sequential, parallel, and aggregation compute within a single reinforcement learning pipeline.
    • Set reinforcement learning trains parallel traces so that they are collectively useful for aggregation.
    • It achieves up to 11x scaling efficiency in pass@k versus GRPO and 15 percent better performance when parallel and aggregation scale together.
    • It points out that existing training paradigms optimize only sequential reasoning, leaving a gap with test-time scaffolds.
    • Experiments with Qwen3-4B-Instruct validate the method, and the authors identify 8B-plus parameter scaling as future work.
  6. 484Computer Vision

    Lift4D: Harmonizing Single-View 3D Estimation for 4D Reconstruction In-the-Wild

    • We apply causal latent conditioning to a monocular 3D reconstruction model to ensure temporal consistency across frames.
    • We convert temporally consistent initialization into a deformable 3D Gaussian Splatting representation.
    • We use occlusion-aware rendering supervision, which localizes occluded regions with depth cues and handles visible and invisible regions separately.
    • We apply a view-conditioned diffusion prior to the unseen regions to complete plausible appearances.
    • On the Consistent4D synthetic benchmark, we achieve SOTA with LPIPS 0.116 and FVD 592.44.
    • On DAVIS in-the-wild videos, we demonstrate superior motion accuracy over prior methods, with CLIP 0.715 and EPE 0.161.
  7. 483Computer Vision

    MeshFlow: Mesh Generation with Equivariant Flow Matching

    • It directly represents meshes as triangle soup, avoiding the limitations of autoregressive serialization such as slow speed and error accumulation.
    • It designs an Equivariant DiT architecture that preserves both face permutation invariance and vertex cyclic invariance.
    • It introduces a coupling loss based on nested optimal transport that removes learning signals that violate symmetry.
    • It achieves the best 1-NNA on three of the four ShapeNet categories and matches the quality of state-of-the-art autoregressive models.
    • It speeds up inference by 18.55x, enabling sub-second mesh generation compared with autoregressive methods.
    • A post-processing denoiser reduces self-intersection rate, Ri, by about 56% with negligible additional latency.
  8. 482Robotics

    InSight: Self-Guided Skill Acquisition via Steerable VLAs

    • It automatically splits human demonstrations into VLM planning segments and end-effector trajectories, making the VLA controllable at the primitive-action level.
    • The VLM identifies missing primitive actions in a new task and builds a flywheel that tries them through low-level control, collects success data, and retrains.
    • It achieves 92% and 96% end-to-end success rates on twisting and following without human demonstrations, compared with 32% and 16% for CaP-X.
    • It reaches 80% success on long-horizon tasks chained from 14 primitive actions, such as twisting followed by following.
    • Adding new primitive actions does not reduce existing pick-and-place skill, confirming that forgetting is not a problem.
    • In a Mars-robot scenario, it learns a sweeping behavior autonomously from only mopping demonstrations and succeeds on all 5 evaluations.
  9. 481AI / General

    Agent-as-a-Router: Agentic Model Routing for Coding Tasks

    • Experiments show that the performance bottleneck in LLM routers is information deficit, not a lack of reasoning ability.
    • When performance statistics are provided, it outperforms heuristic routers by 15.3% relative improvement.
    • The Context-Action-Feedback loop continuously accumulates execution-based experience in streaming tasks.
    • ACRouter reaches 49.98% AvgPerf in distribution and 62.50% AvgPerf on out-of-distribution agentic programming.
    • Static routers such as classifiers and bandits collapse out of distribution, but ACRouter preserves generalization.
    • CodeRouterBench is a regret-based router evaluation environment with about 10K tasks, 8 LLMs, and execution-verified scores.
  10. 480World Models / Agents

    Qwen-AgentWorld: Language World Models for General Agents

    • It presents language world models, Qwen-AgentWorld-35B-A3B and Qwen-AgentWorld-397B-A17B, across seven simulated domains.
    • It uses a three-stage training process, CPT for world-model capability injection, SFT for activating next-state prediction, and RL for improving simulation accuracy.
    • It introduces AgentWorldBench and shows superior performance across five frontier models and nine benchmarks.
    • In Paradigm A, the separated approach, thousands of environment simulations for agent RL outperform training in the real environment.
    • In Paradigm B, the integrated approach, world-model training is used as warmup and improves performance on seven agent benchmarks.
    • It trains on more than 10M environment interaction trajectories and supports reasoning based on long chains of thought.
  11. 479Research

    Linear optical Bell state measurement for rotation-symmetric cat codes

    • It implements RS-cat code Bell state measurement with only a half beam splitter (HBS) and photon-number-resolving detectors (PNRDs).
    • It distinguishes the four Bell states using discrete rotational symmetry, photon-number remainder information, and phase information.
    • In the lossless and large-amplitude regime, it enables deterministic Bell state measurement for any symmetry order N.
    • Numerical evaluation of photon loss shows that higher-order RS-cat codes are advantageous in certain loss regimes.
    • Postselection can further increase success probability, and the required photon-number resolution is within practical reach.
  12. 478LLMs / NLP

    Tmax: A simple recipe for terminal agents

    • TMAX-15K includes 14,600 RL environment instances, more than 2.5 times the size of the largest existing terminal dataset.
    • A 9B model reaches 27% on Terminal-Bench 2.0, which is the best result among open models under 30B.
    • It uses difficulty control, personas, and validator diversity to synthesize high-quality environments.
    • DPPO, an FP32 LM head, and a large group size stabilize RL for long-horizon agents.
    • It confirms cross-task and cross-harness generalization, including a +5-point gain on SWE-Bench Verified, showing that RL is not just harness fitting.
  13. 477Computer Vision

    SeFi-Image: A Text-to-Image Foundation Model with Semantic-First Diffusion

    • Semantic-First Diffusion injects semantic encoder features asynchronously and reaches fast convergence even in high-fidelity VAE spaces.
    • Training the 5B model requires only 125K A800 hours of compute, which is 10 to 20 percent of the compute used by Z-Image.
    • It matches or exceeds Qwen-Image and Z-Image on many benchmarks, including GenEval, DPG, LongTextBench, OneIG, and CVTG-2K.
    • Three scales, 1B, 2B, and 5B, plus a DMD2-distilled turbo variant cover different hardware and latency requirements.
    • It is trained on 450M image-text pairs plus 28M synthetic text-rendering samples, and the code and weights are released.
  14. 476LLMs / NLP

    Deeper is Not Always Better: Mitigating the Alignment Tax via Confident Layer Decoding

    • The Guess-Refine-Perturb pattern shows that early layers guess, middle layers refine, and final layers are disturbed by alignment bias.
    • It uses entropy-based conservative backward search to dynamically select the best nearby final layer on a token-by-token basis.
    • It improves reasoning benchmarks such as GPQA-Diamond, Omni-MATH, and HLE consistently across both dense and MoE architectures.
    • It can be dropped into existing inference pipelines with no extra memory and less than 2 percent latency overhead.
    • The stronger the alignment, the larger the disturbance in the final layer, which means the effect grows with model size.
  15. 475Machine Learning

    MAS-PromptBench: When Does Prompt Optimization Improve Multi-Agent LLM Systems?

    • A benchmark dedicated to prompt optimization for MAS, covering five topologies, three communication protocols, and team sizes from 2 to 10 agents.
    • The gains range dramatically from as much as +24 points to as much as -16 points, proving that blind application is risky.
    • Optimization works better when communication protocols are more structured: Freeform < Semi-structured < Structured.
    • As team size grows, coordination complexity increases and optimization gains shrink, from +2.4 points for 2 agents to -2.1 points on average for 10 agents.
    • The natural extension of single-agent optimization tools to MAS is not sufficient, and MAS-specific algorithms are needed.
  16. 474Robotics

    World Action Models: A Survey

    • The survey defines WAM as a model that predicts actionable futures from observation and action history together with task context, and then uses those predictions to generate action.
    • It organizes WAMs along two classification axes: what should be generated, such as rendered, latent, or free, and how the system is decomposed into substrate, backbone, coupling, and deployment.
    • It identifies five core properties: interactability, causality, persistence, physical plausibility, and generalization.
    • It systematically categorizes more than 200 studies into five backbone families: diffusion, autoregressive, joint, optional-future, and related variants.
    • Its core insight is that WAMs are evolving toward a 'generate less, preserve only what is needed for control' design philosophy.
  17. 473Machine Learning

    Tapered Language Models

    • It applies a cosine decay to layerwise MLP width, such as 1.5x at the front and 0.5x at the back, to concentrate capacity early and improve perplexity by up to 1.84 points over uniform allocation.
    • It shows consistent gains across four architectures, Transformer, Gated Attention, Hope-attention, and Titans, and three model sizes, 440M, 760M, and 1.3B.
    • It improves downstream benchmark performance without increasing the parameter count or FLOPs.
    • The mechanism analysis shows that deeper MLP outputs align more strongly with the residual stream, which means they reinforce existing information more than they update it.
    • It is a general design lever that is not tied to one architecture and can also be applied to other foundation models such as vision transformers and diffusion models.
  18. 472Image Processing

    Unsupervised Susceptibility Distortion Correction of EPI without Calibration Scans via Image Translation-Based Registration

    • An invertible neural network, or INN, based image translation narrows the contrast gap between BOLD and T1w images.
    • The method applies structural preservation constraints through the MIND-SSC, a modality-independent neighborhood descriptor.
    • Test-time adaptation, or TTA, provides out-of-distribution robustness to scanner and population shifts.
    • The network is trained with a single contrast-similarity objective, so no distortion-correction ground truth is needed.
    • It consistently outperforms prior calibration-free methods on one in-distribution and two out-of-distribution datasets.
  19. 471AI / General

    CLI-Universe: Towards Verifiable Task Synthesis Engine for Terminal Agents

    • The inside-out approach defines tasks from a structured taxonomy first, then grounds them in evidence-based research rather than reusing existing artifacts.
    • It uses a three-stage verification process: rubric-gated testing, hint-conditional filtering to remove trivial tasks, and fail-to-pass checks.
    • It discards about two-thirds of all candidates, keeping only high-quality tasks to maximize training-signal density.
    • Training Qwen3-32B on CLI-Universe-6K, which contains 6,000 trajectories, raises TB 2.0 to 33.4 percent and makes it the best open-source model at or below 32B.
    • It improves generalization across benchmarks, with gains of +11.3 on BFCL v4 and +11.6 on VitaBench.
  20. 470Robotics

    AdaReP:Adaptive Re-Planning under Model Mismatch for Neural World-Model Predictive Control

    • It defines an adaptive replanning threshold based on dynamic regret theory, computed from prediction deviation and local dynamics sensitivity.
    • It requires no training and can be applied simply by wrapping existing world models and planners without modifying them.
    • On VP2 and RoboDesk, it reduces NFE by 59 percent, and on the DMC Suite with TD-MPC2, it reduces NFE by 54.5 percent.
    • On a real Franka robot, it cuts queries by more than 80 percent over 50 trials while keeping the success count at 36 out of 50, compared with 34 out of 50 for the baseline.
    • In sensitive hinge-like regions, replanning frequency increases automatically, while in smooth regions the system reuses cached plans for longer.
  21. 469Robotics

    HoloAgent-0: A Unified Embodied Agent Framework with 3D Spatial Memory

    • A three-layer structure: Embodied AgentOS for planning, scheduling, and monitoring; a memory layer with a 3D semantic map; and a skill layer for navigation, manipulation, and motion.
    • A ROS2-based command and state interface supports heterogeneous skill composition and real-time failure recovery.
    • It integrates HoloNavi for navigation, HoloBrain for VLA-based manipulation, and HoloMotion for whole-body motion.
    • Its 3D scene-graph-based spatial memory provides long-horizon task context through a room-object hierarchy.
    • It demonstrates object search, multi-robot collaboration, and closed-loop mobile manipulation on real robot hardware.
  22. 468Computer Vision

    Unlimited OCR Works

    • Reference Sliding Window Attention (R-SWA) keeps the KV cache constant by giving reference tokens full attention and output tokens a sliding window of 128.
    • On OmniDocBench v1.5, it improves by 6% over DeepSeek OCR, reaching 93%, with an MoE structure that uses only 0.5B active parameters.
    • It can process more than 40 pages at once and is 35% faster when generating 6,000 tokens.
    • Replacing full standard attention with R-SWA does not reduce single-page OCR accuracy.
    • It was developed by Baidu, and the code and weights are released on GitHub.
  23. 467Robotics

    World Engine: Towards the Era of Post-Training for Autonomous Driving

    • A four-stage pipeline: uncover long-tail safety events from real logs, turn them into high-quality 3DGS simulations, generate variations with an action world model, and use them for RL post-training.
    • World Engine post-training delivers larger safety gains than simply doubling the pretraining data, while remaining competitive even against about 10x more data.
    • When applied to Huawei's production autonomous-driving system with 80,000 hours of driving data, it reduced simulation collision rates by up to 45.5%.
    • It achieved zero disengagement in on-road tests over 65 km of Shanghai urban driving plus 70 km of nighttime driving.
    • On the 58.3M-parameter small model, repeated post-training caused policy instability, so whether large models can support regular iterative retraining remains unresolved.
    • Beyond autonomous driving, it proposes a safety-learning template for general physical AI such as robot manipulation, walking, and surgical robots.
  24. 466AI / General

    ENPIRE: Agentic Robot Policy Self-Improvement in the Real World

    • It is the first integrated framework that lets coding agents such as Codex, GPT-5.5, Claude Code, and Kimi K2.6 autonomously improve policies in real robot environments.
    • It has a four-stage structure: Environment with automatic reset and verification, Policy Improvement with heuristics, BC, and RL, Rollout on the real robot, and Evolution where the agent analyzes logs and improves code.
    • In Pin Insertion, it reaches 100% success faster than human-in-the-loop state-of-the-art methods, and 99% on tasks such as PushT and zip tie cutting.
    • When scaled to a multi-robot fleet from 1 to 8 agents, it shows shorter wall-clock time, but token cost grows superlinearly and spikes at MTU 8 agents.
    • It introduces Mean Robot Utilization (MRU) and Mean Token Utilization (MTU) as two physical resource efficiency metrics.
    • It automatically discovers the synergy between VLA, GR00T, and procedural tool calls, improving VLA accuracy in RoboCasa and successfully transferring to the real world.
  25. 465LLMs / NLP

    Large Language Models Do Not Always Need Readable Language

    • It first proposes the concept of BabelTele, a compressed representation that preserves meaning without human readability, retaining 99.5% of meaning at only 27.9% of the original length.
    • It is zero-shot compatible across heterogeneous models such as Gemini, GPT, Claude, Qwen, and DeepSeek, so one model can decode text compressed by another without fine-tuning.
    • In multi-agent communication, it saves 39% to 44% of tokens while preserving task scores between 96.6% and 99.7%.
    • On the LoCoMo agent memory benchmark, it achieves higher accuracy than Summary, 96.48% versus 94.20%, while using fewer tokens.
    • On LongBench v2 code repository QA, BabelTele compression outperforms simple truncation when the context window is exceeded, improving Qwen3.6-Max from 55.17% to 62.07%.
    • BabelTele interpretability is not monotonic with model size, so robustness to the compression format is the key variable.
  26. 464Software Engineering

    FAPO: Fully Autonomous Prompt Optimization of Multi-Step LLM Pipelines

    • The Claude Code-based optimization loop follows a pipeline of evaluation, intermediate-step analysis for failure attribution, scoped change proposal, safety review, and verification.
    • The prompt-first strategy prioritizes prompt edits and escalates to chain-structure or parameter changes only when attribution identifies a structural bottleneck.
    • It represents the pipeline as a stateful graph built with LangGraph, and it ensures reproducibility through tenant-isolated workspaces.
    • Across 6 benchmarks and 3 models, meaning 18 comparisons, GEPA wins 15 times with an average gain of 14.1 percentage points, and it wins all 6 structure-change comparisons on HoVer and IFBench with an average gain of 33.8 percentage points.
    • On the security task CTIBench-RCM, it improves GPT-5 by 4.0 points, Foundation-Sec-8B-Instruct by 7.1 points, and Foundation-Sec-8B-Reasoning by 2.0 points.
    • A step-attribution subagent separates prompt-editable issues from structural bottlenecks, which prevents unnecessary structural changes.
  27. 463Machine Learning

    VIMPO: Value-Implicit Policy Optimization for LLMs

    • It derives a closed-form expression under the optimality conditions of KL-regularized RL by expressing the value function as a policy-reference log-ratio, which removes the need for a critic.
    • It constructs a critic-free value-optimization objective with a terminal boundary condition V*(s_T) = 0 and a Monte Carlo group estimator.
    • From the same derivation, it obtains a PPO-style actor advantage, separating reward injection through the value loss from policy improvement through the actor update.
    • It shows consistent gains over GRPO on MATH-500, AIME 2024, AIME 2025, and OlympiadBench, with especially large improvements on contest-style problems.
    • It remains consistently better than GRPO even under 25 percent reward-flip noise, showing stronger robustness to reward noise.
    • It validates the method for math RLVR with a 4B base model, and shows that tuning the actor coefficient c_A and value coefficient β determines the tradeoff between learning speed and stability.
  28. 462Computer Vision

    Current World Models Lack a Persistent State Core

    • WRBench defines camera motion as an intervention on observability and evaluates it through a 6-dimensional hierarchical diagnostic chain, from requested-camera to visual integrity to re-observed consistency.
    • Natural-25 uses a design with 25 scene families and four event stages to separate spatial movement from state change orthogonally.
    • Across 23 models and four control paradigms, the common failure is to restore only the state from the time the object was left when the camera returns, without reflecting events that happened while it was unobserved.
    • Scaling Wan from 1.3B to 14B actually worsened re-observed state from 0.66 to 0.62, showing that scaling alone does not solve the problem.
    • LingBot-World has the strongest visible-state consistency, at 0.874 and 0.719, but the lowest requested-camera precision at 0.468, revealing a tradeoff between controllability and state consistency.
    • The key diagnosis is that all public models currently lack what-memory, meaning a record of hidden changes, and an endpoint-persistence training objective.
  29. 461Computer Vision

    HumanScale: Egocentric Human Video Can Outperform Real-Robot Data for Embodied Pretraining

    • Egocentric pretraining shows a clear scaling law, with validation loss decreasing monotonically as more data is added.
    • At the same 5,000-hour scale, egocentric data reduces validation loss by 24% versus robot data, improves in-distribution success from 40% to 92.5%, and improves OOD success from 0% to 90%.
    • The comparison is based on a World-Action Model with a MoT architecture, using a framework that combines video generation and action prediction.
    • Egocentric video has lower normalized jerk, meaning smoother motion, and a lower idle fraction, which makes the data more efficient.
    • In real-robot experiments on an AgiBot bi-manipulator, the egocentric pretraining model maintained a 90% success rate even on OOD objects, while the baseline collapsed to 0%.
    • Robot data shows almost no improvement in unseen-task generalization even when scaled up, demonstrating the fundamental limitations of real robot data.
  30. 460LLMs / NLP

    AtomMem: Building Simple and Effective Memory System for LLM Agents via Atomic Facts

    • Fact Executor: A lightweight SFT-tuned LLM extracts only the core information from raw conversations as atomic facts, using Qwen3-14B with LoRA rank 128.
    • Hierarchical memory structure: It organizes atomic facts into event memory for context and temporal profiles for tracking user state.
    • Association memory graph: Retrieval uses entity duplication, shared events, and conversation continuity to connect fragmented memories.
    • On the LoCoMo benchmark's Multi-Hop J-score, it improves by 31.1% over LightMem and reduces tokens by 61.4% versus Mem0.
    • Even the simple flat variant, AtomMem-Flat, improves Multi-Hop F1 from 20.97 to 37.03, a 76.6% gain over the baseline, showing that memory representation quality is the key.
    • The retrieval parameter k_f = 10 is the best balance of accuracy, cost, and latency, while k > 20 hurts performance because of noise.

From research to product use

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

View technology