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.
- 459Agents / World Models
Code World Models for General Game Playing
- The core method uses the LLM not as a policy that directly chooses moves, but as an inductive engine that translates rules and trajectory data into Python code. The generated Code World Model (CWM) is an executable simulation engine that includes state-transition, legal-move enumeration, and terminal-check functions.
- On top of the CWM, it places MCTS for perfect-information games or ISMCTS for imperfect-information games to perform deep search-based planning. In addition, the LLM is asked to generate a heuristic value function and a hidden-state inference function as code.
- For imperfect-information games, it proposes a code-based autoencoder paradigm. The inference function serves as the encoder from observation to hidden state, the CWM serves as the decoder from hidden state to observation, and the game rules act as a structural regularizer.
- It was evaluated on 10 games, five with perfect information and five with imperfect information, including four OOD games newly created for the paper. CWM-MCTS and CWM-ISMCTS performed nearly as well as players based on ground-truth models, and they beat Gemini 2.5 Pro in 9 of the 10 games or tied with it.
- In perfect-information games, CWM transition accuracy reached 1.0 in most cases, while in imperfect-information games hidden-state inference remained difficult and accuracy dropped to around 52% on the hard game Gin Rummy.
- The limitations are that learning remains difficult in imperfect-information games with complex rules such as Gin Rummy, and extending the approach to open-world or vision-based games remains future work.
- 458Machine Learning
How Transparent is DiffusionGemma?
- The paper decomposes transparency into variable transparency, which is how well intermediate states can be understood, and algorithmic transparency, which is how well the process can be reconstructed.
- Opaque serial depth drops from 28.6 times the initial Gemma 4 level to 1.1 times when mapped to a token bottleneck.
- Compressing self-conditioning between denoising steps into O(c) tokens causes only a small downstream performance drop.
- On monitoring evaluation, DiffusionGemma performs about the same as Gemma 4 in terms of CoT monitoring quality.
- The paper finds diffusion-specific phenomena such as non-sequential reasoning, token and sequence smearing, and intermediate-context reasoning.
- It provides a framework and benchmark for auditing the transparency of future latent reasoning models.
- 457Robotics
Playful Agentic Robot Learning
- During play time, the system autonomously proposes tasks, executes them, verifies the results, diagnoses failures, and accumulates a skill library.
- It uses a novelty-learnability rule to propose curiosity-driven tasks, with curiosity play improving from 24.7 percent under random play to 32.3 percent.
- On LIBERO-PRO, it improves by 20.6 points over CaP-Agent0, from 23.2 percent to 43.8 percent, and exceeds every VLA baseline, including pi0.5 at 12.8 percent.
- When the learned skills are plugged into CaP-Agent0, they improve RoboSuite by 8.9 points and real-robot performance by 8.8 points.
- Skills learned in a single-arm environment also transfer to two-arm tasks, such as two-arm lifting, with a 24.0-point gain.
- Curiosity play and execution-system improvements are complementary, and both together reach the best score of 44.3 percent.
- 456Robotics
MemoryWAM: Efficient World Action Modeling with Persistent Memory
- The memory design combines a short-term sliding window, long-term gist tokens, and anchor frames at event boundaries.
- It reduces time and space complexity from O(N) to O(N/d), where d is the compression ratio, making real-time control feasible.
- On RMBench, it reaches a 83.0 percent average across nine tasks, outperforming LingBot-VA by 4.8 points and FastWAM by a wide margin.
- On the real robot, it achieves 18 out of 20 on Shell Game and 15 out of 20 on Look and Press.
- Removing gist tokens causes the largest performance drop, from 92.5 percent to 40 percent, which shows their critical role in long-term memory.
- Even at 1,600 frames, it remains more efficient than full attention approaches such as RNN and TTT while maintaining 87 percent performance.
- 455Computer Vision
ImageWAM: Do World Action Models Really Need Video Generation, or Just Image Editing?
- It points out three limitations of video-generation WAMs, namely cost, irrelevant details, and error accumulation, and proposes image editing as an alternative.
- It passes the KV cache from the editing backbone to a flow-matching action expert, enabling action prediction without image decoding.
- It achieves a 98.4% success rate on LIBERO and an 84.5% success rate on real robots, outperforming π0 at 55.8% and FastWAM at 79.0%.
- It achieves FLOPs reduction from 63.65 to 9.72, a 6x reduction, and latency reduction from 1081 ms to 263 ms, about 4x faster.
- It can use a variety of editing backbones such as FLUX.2, OmniGen2, and Ovis-U1, so it is not tied to a specific model.
- Attention analysis confirms that the editing cache focuses on task-relevant changed regions.
- 454Computer Vision
S-Agent: Spatial Tool-Use Elicits Reasoning for Spatial Intelligence
- It reframes spatial reasoning as the accumulation of spatiotemporal evidence rather than frame-by-frame prediction.
- It uses a three-layer tool stack: 2D grounding, 3D geometric lifting, and spatial knowledge aggregation.
- Scene Memory, which stores object state, and Agent Memory, which stores reasoning history, support stateful reasoning.
- In a training-free setting, it improves MMSI-Bench by 4.5 percent over GPT-5.4.
- S-AGENT-8B trained on 300K trajectories improves by 10.5 percentage points over Qwen3-VL-8B, from 31.1 percent to 41.6 percent.
- The key idea is that a level-3 expert transforms raw 3D data into task-oriented measurements.
- 453Machine Learning
Reversal Q-Learning
- It applies an extended MDP framework to offline RL and generates virtual on-policy trajectories through a reverse flow.
- Multi-step returns reduce the effective horizon from T×F to T, solving the curse of horizon.
- It uses first-order gradients of the value function without BPTT, outperforming regression-based methods such as FAWAC and IFQL.
- It achieves the best average performance among 18 baselines on 50 robot tasks in OGBench.
- It is especially strong on long-horizon tasks such as antmaze-giant and humanoidmaze-large.
- 452Robotics
Guava: An Effective and Universal Harness for Embodied Manipulation
- ReAct-style closed-loop execution is decisively better than one-shot planning on long-horizon tasks.
- A semantic action space, such as grasp, align, and move, reduces the reasoning burden on the VLM compared with low-level joint control.
- Training on fewer than 2,000 simulation trajectories and then transferring zero-shot to the real world succeeds on three backbones, with 86 percent on in-distribution tasks and 92 percent on out-of-distribution tasks.
- RL post-training raises shell game success from 6.7 percent to 60 percent and place-all-red-objects success from 0 percent to 93.3 percent.
- The system exhibits error awareness and recovery behavior even in joint-limit or unreachable situations that were absent from training.
- It achieves a 75.6 percent overall success rate, outperforming GPT-5.4 at 70.2 percent and CaP-Agent0 at 62.7 percent.
- 451LLMs / NLP
Zone of Proximal Policy Optimization: Teacher in Prompts, Not Gradients
- It addresses both the mode-seeking bias of teacher-logit imitation and the drift problem caused by injecting teacher response gradients.
- BCQ places teacher-correct and student-wrong answers as anonymous candidates so the student has to discriminate them while staying on-policy.
- NCQ aggregates the student's failed rollouts and presents common failure patterns in the prompt.
- A prompt replay buffer recycles hard questions to amplify learning within the student's zone of proximal development.
- At 0.8B, it improves average performance by +4.9 points for VLMs, +4.4 points for LLMs, and +2.3 points for video models compared with GRPO, with a large +16.9-point gain on GPQA-D.
- It confirms that the gains from ZPPO grow with teacher size and shrink with 4B and 9B teachers.
- 450Robotics
SC3-Eval: Evaluating Robot Foundation Models via Self-Consistent Video Generation
- Joint training of forward and backward dynamics corrects autoregressive rollout drift using backward signals.
- Cross-view inpainting training preserves multi-camera consistency without explicit memory.
- The backward dynamics mode is reused as a per-chunk uncertainty signal for early stopping when drift appears.
- Across seven real VLA policies, it achieves a closed-loop Pearson correlation of 0.929 and MMRV of 0.119, outperforming Ctrl-World, IRASim, and Cosmos-Predict 2.5.
- It classifies the real failure modes of policies, including language understanding, grasping, and releasing, into four categories and achieves more than 70 percent recall.
- It is trained on 381 hours of real table-bussing data and shows generalization to out-of-distribution tasks.
- 449Robotics
Do as I Do: Dexterous Manipulation Data from Everyday Human Videos
- It proposes a guided diffusion method that repurposes the SAM 3D generation model as a video object tracker, achieving tracking performance 67% better than FoundationPose.
- It achieves state-of-the-art reconstruction accuracy on the DexYCB and HOI4D benchmarks, with F-5 of 0.71 and 0.72 and CD of 0.66 and 0.49.
- Three novel components, warmup, perturbation, and transition reward, improve retargeting success from 25% to 71%.
- It also shows effectiveness on clean data, improving OakInk2 MoCap performance from 72% to 81%.
- Analysis of the 100DOH dataset shows that only about 4% of online human videos can be directly used for dexterous manipulation learning.
- It validates real execution on a two-arm system with a 22-DoF Sharpa Wave hand and UR3e arm across 10 tasks, including stirring, pouring, and wiping.
- 448LLMs / NLP
Learning from the Self-future: On-policy Self-distillation for dLLMs
- It is the first on-policy self-distillation framework for dLLMs that overcomes the limitation of existing OPSD, which was designed only for autoregressive models.
- By exploiting the non-autoregressive nature of dLLMs, it uses self-generated answers as suffix-conditioned inputs to transfer more novel knowledge.
- It aligns dLLM's iterative denoising structure with token-level to step-level divergence supervision.
- It achieves better reasoning performance with only about 10% of the optimization steps used by RLVR, dramatically improving sample efficiency.
- It consistently outperforms RLVR and SFT baselines on four reasoning benchmarks.
- It proposes a self-future-experience learning paradigm inspired by the human idea of going back to the past.
- 447Robotics
Qwen-RobotNav Technical Report: A Scalable Navigation Model Designed for an Agentic Navigation System
- It uses a two-axis parameter interface, with task mode and observation parameters such as token budget and camera weight, to support diverse navigation tasks in a single model.
- Without changing the architecture, randomizing only the training-time parameters makes the Qwen3-VL backbone robust to arbitrary inference-time settings.
- Training on 15.6M samples and co-training with vision-language data prevents collapse into a reactive action-sequence mapper.
- It achieves new state-of-the-art results on VLN-CE RxR at 76.5%, EVT-Bench at 90.0%, and NAVSIM at 91.4 PDMS.
- In agentic system composition, it improves HM-EQA by 10.8% and EXPRESS-Bench by 15.4%, while reducing navigation steps by 77%.
- It scales favorably from 2B to 8B and shows strong zero-shot generalization in real robot environments.
- 446AI / General
Fixed-Point Reasoners: Stable and Adaptive Deep Looped Transformers
- It solves signal propagation problems that grow with loop depth by using pre-norm and residual scaling.
- It introduces fixed-point convergence through an end-to-end halting mechanism, so no external halting module is needed.
- It guarantees adaptive computation, with the number of iterations automatically adjusted to task difficulty.
- On Sudoku Extreme, it matches TRM performance with 10 percentage points higher accuracy and about 27 percent less compute.
- It shows consistent gains on combinatorial reasoning benchmarks such as Maze, state tracking, and ARC-AGI.
- It provides theoretical justification for the halting decision based on mathematical fixed-point theorems.
- 445LLMs / NLP
Variable-Width Transformers
- It systematically explores non-uniform width allocation by breaking the assumption that every transformer layer must have the same width.
- An X-shaped structure, wide at the ends and narrow in the middle, consistently outperforms equal-width baselines with matched parameter counts.
- Parameter-free residual resizing implements dimensional reduction and recovery without projection layers.
- With the same number of parameters, it improves perplexity by about 3 percent, reduces KV cache by about 10 percent, and reduces FLOPs by about 3 percent.
- Under a loss-matched scaling curve, it reduces FLOPs by 22 percent and extends to MoE transformers.
- It mitigates representation collapse in the middle layers and encourages qualitatively different representations at different depths.
- 444AI / General
Latent Thought Flow: Efficient Latent Reasoning in Large Language Models
- This is a new approach that solves the language-space bottleneck of Chain-of-Thought, meaning the token-decoding overhead, by reasoning in latent space.
- A continuous GFlowNet learns a distribution over latent reasoning trajectories proportional to reward, preserving diverse accurate and efficient paths.
- Entropy-Weighted Subtrajectory Balance propagates terminal rewards to intermediate steps, which addresses the sparse-supervision problem.
- Reference-prior regularization provides stable early exploration, and annealing then shifts the model toward reward-based trajectories.
- Compared with CoLaR and ReGuLaR, it improves fine-tuning accuracy by 12.9 percent and shortens reasoning length by 34.5 percent.
- In transfer-learning settings, it also improves accuracy by 6.0 percent and shortens reasoning length by 19.9 percent, which demonstrates generality.
- 443Computer Vision
EgoCS-400K: An Egocentric Gameplay Dataset for World Models
- The dataset contains more than 400K first-person videos and more than 10,000 hours of gameplay data built from professional CS and CS2 demos.
- It uses tick-level precise alignment so that keyboard and mouse input, camera motion, weapon and movement state, and game events are all synchronized.
- The hierarchy goes from player-view sequence to segment to action chain to atomic action to per-tick state trace.
- It covers more than 1,000 matches, more than 40,000 rounds, 13 maps, and up to 10 player viewpoints per round.
- Its replay-grounded structure makes parsing, replaying, rendering, and temporal alignment all possible, which distinguishes it from simple video capture.
- It supports action-conditioned future prediction, state-aware scene rollout, and egocentric action understanding.
- 442Research
A Semi-Analytical Loss Cone Theory for Tidal Disruption Event Rates Around Kerr Black Holes
- It is the first semi-analytical incorporation of the spin-dependent loss-cone boundary of Kerr black holes into TDE rate theory.
- Using tidal tensor formalism, it derives tidal disruption and direct capture thresholds as a function of orbital inclination.
- It derives a closed-form capture fraction for the one-dimensional loss-cone problem with nested disruption and capture boundaries.
- It formulates a two-dimensional Fokker-Planck equation that describes simultaneous diffusion in angular momentum magnitude and direction.
- Perturbation analysis proves a first-order bias favoring retrograde star disruption, but shows that the global TDE rate is nearly insensitive to spin.
- It provides an analytical foundation for population-level TDE studies that include spin and orbital inclination.
- 441Computer Vision
VisualClaw: A Real-Time, Personalized Agent for the Physical World
- A cascade gate made of perceptual hash, a 128-dimensional CPU encoder, and an adaptive change gate compresses one hour of streaming video into only 5 to 20 API calls.
- Hot and cold top-k skill injection prevents prompt cost from exploding as the skill bank grows.
- An offline evolver based on failures automatically updates memory and the skill bank, achieving self-evolution without weight updates.
- Across four video-QA benchmarks, it cuts API cost by an average of 98 percent and raises accuracy by an average of 3.85 percent, with EgoSchema peaking at +15.80 percent.
- It builds VisualClawArena with 200 scenarios, supporting workspace-style agent evaluation through a five-stage curation pipeline.
- With Codex, macro accuracy rises by 2.9 percent for GPT-5.5 and by 3.2 percent for Claude Code Sonnet 4.6, while cost falls by 9.5 percent.
- 440Computer Vision
Unified Multimodal Autoregressive Modeling with Shared Context-Visual Tokenizer is Key to Unification
- A single bitwise visual tokenizer truly unifies the representation space for understanding and generation for the first time.
- Multi-level feature fusion uses shallow layers for low-level detail and deep layers for high-level semantics at the same time.
- Lookup-free BSQ quantization has the effect of a 2^64 codebook, exponentially expanding the vocabulary without an explicit codebook.
- Parallel bitwise prediction achieves a 32x visual compression ratio and predicts only 256 tokens for 1024x1024 images.
- It reaches SOTA on image generation benchmarks such as GenEval and ImgEdit while staying competitive on multimodal understanding benchmarks.
- It trains efficiently with a total of about 33k GPU hours, using a lightweight design with a 400M visual tokenizer and a 2.5B decoder.
- 439Robotics
Qwen-RobotManip Technical Report: Alignment Unlocks Scale for Robotic Manipulation Foundation Models
- It proposes a three-dimensional alignment framework for representation, motion, and action, using canonical state, camera-frame delta pose, and in-context adaptation.
- It builds a human-to-robot synthesis pipeline that converts human egocentric video into trajectories for 15 robot platforms.
- It builds a pretraining corpus of about 38,100 hours of manipulation data using only open-source data, with no proprietary data collection.
- In out-of-distribution evaluation on LIBERO-Plus, RoboCasa365, and EBench, it outperforms π0.5 and GR00T-N1.7 across all axes.
- It ranks first on the RoboChallenge Table30-v1 generalist track and achieves a 20 percent relative improvement.
- It has been validated on four real robot platforms: AgileX ALOHA, Franka, UR, and ARX.
- 438LLMs / NLP
GameCraft-Bench: Can Agents Build Playable Games End-to-End in a Real Game Engine?
- It is the first work to define three requirements for engine-based game generation evaluation: Engine Grounding, Artifact Completeness, and Interactive Verification.
- It introduces a real engine benchmark with 140 Godot tasks across 15 game genres.
- It uses a three-stage interaction-grounded evaluation pipeline that goes from headless build to play video to rubric-based multimodal judging.
- The strongest agent, Opus 4.7 high, reaches 41.46%, while most agents remain below 40%, which shows that end-to-end game generation is still unsolved.
- Agents can implement mechanics, but they fall far short on content depth, visual feedback, and presentation polish.
- Mechanics, content, and visuals are moderately correlated at r=0.5 to 0.6, but art and presentation are weakly coupled at r=0.11, which shows that the capability splits only partially.
- 437Machine Learning
Looped World Models
- It is the first application of a looped transformer to a world model and proposes iterative latent depth as a new scaling axis.
- By repeating a shared transformer block, it achieves up to 100 times better parameter efficiency than prior designs.
- A spectrally constrained state-retention parameterization guarantees stability over arbitrary rollout lengths.
- Adaptive computation automatically assigns more loops to complex transitions such as collisions and contacts and fewer loops to simple dynamics.
- It achieves 66 to 88 percent EM and 72 to 98 percent F1 on scientific simulation tasks such as ScienceWorld.
- With only 1B parameters, it demonstrates better predictive performance on scientific simulation than Gemini and Qwen.
- 436Machine Learning
ExpRL: Exploratory RL for LLM Mid-Training
- It proposes two ExpRL variants, ExpRL-Outcome and ExpRL-Process, that use reference answers as scoring rubrics for an LLM judge rather than as imitation targets.
- On Qwen3-4B, ExpRL-Outcome reaches 34.2 percent pass@1 on AIME-25, far exceeding GRPO at 27.1 percent and SFT at 5.7 percent.
- The improvement in pass@k confirms that coverage, meaning the diversity of solution strategies, also improves.
- It observes more reasoning behaviors, such as verification, self-correction, and backtracking, than in the base model.
- For judges of 4B or larger, the matched reference for a problem shows the lowest misplacement rate, confirming that the judge validates based on the reference.
- Mixed-domain experiments across math, coding, and science suggest that ExpRL can scale beyond a single domain.
- 435AI / General
A First-Principles Derivation of LLM Policy Optimization: From Expected Reward to GRPO and Its Structural Extensions
- It unifies all policy gradient methods into two axes, trajectory side and reward side, for J(theta) = E[R(tau)].
- It explains the evolution from REINFORCE to PPO to GRPO to post-GRPO variants through the failure modes and interventions at each stage.
- It extends the same two-axis view to agentic RL and hybrid GRPO-OPD.
- It identifies coupled failures that cannot be solved by changing only one axis and points to directions for next-generation algorithm design.
- 434Computer Vision
UniDDT: Unifying Multimodal Understanding and Generation with Decoupled Diffusion Transformer
- A noisy ViT encoder serves as a unified semantic encoder for both understanding, with clean inputs, and generation, with noisy inputs.
- A separate diffusion decoder separates text decoding from visual generation, which minimizes modality interference.
- The model constructs a dual data structure from the same image-text pair so that it can exploit the duality between understanding and generation.
- It achieves 0.87 on GenEval, 86.9 on DPG, 1699.5 on MME, and 76.5 on SEEDbench, which shows competitive performance on both understanding and generation.
- 433Robotics
T-Rex: Tactile-Reactive Dexterous Manipulation
- The architecture uses variable-rate MoT control, separating a low-frequency action expert at about 5 Hz from a high-frequency tactile expert at about 20 Hz.
- A spatio-temporal VQ-VAE-based tactile encoder compresses raw tactile feedback into a compact representation.
- The authors release a 100-hour tactile-synchronized bimanual manipulation dataset, the T-Rex Dataset, covering more than 200 everyday objects and 22 motor primitives.
- On 12 tactile-reactive tasks, it achieves a 65 percent average success rate, which is 30 percent better than the strongest baseline.
- 432Computer Vision
You Don't Need Strong Assumptions: Visual Representation Learning via Temporal Differences
- It is the first approach to self-supervised learning that does so with only a causality assumption and without strong inductive biases such as augmentation, masking, or cropping.
- It trains the frame encoder and motion encoder jointly so that current frame plus motion delta equals the next frame representation.
- It experimentally verifies the hypothesis that weaker inductive bias is better as data scale increases.
- It achieves performance comparable to DINO and iBOT on ADE-20K semantic segmentation and MPI-Sintel optical flow.
- 431Robotics
ROVE: Unlocking Human Interventions for Humanoid Manipulation via Reinforcement Learning
- It decomposes the hesitation, adaptation, and recovery stages of human remote teleoperation intervention for humanoid robots, which supports mixed-quality data modeling.
- Optimistic Value Estimation combines TD bootstrapping and expectile regression to extract high-value actions first.
- It adds cross-embodiment human experience videos to critic training, which strengthens long-tail failure modes.
- Three real task intervention rounds improve success rates from 45 to 80 percent on the whiteboard task and from 56.7 to 86.7 percent on the toaster task.
- 430AI / General
From Chatbot to Digital Colleague: The Paradigm Shift Toward Persistent Autonomous AI
- It proposes a four-stage LLM evolution framework: Chatbot, Thinking LLM, Agent, and OpenClaw with Workspace and Skill.
- It summarizes the data paradigm shift from instruction-response pairs to State-Action-Observation trajectories.
- It describes the evaluation paradigm shift from static benchmarks to task closure rate, sandbox auditing, and self-evolving ecosystems.
- It defines workspace persistence, skill reuse, verification loops, and governance as the core elements of a digital colleague.
From research to product use
Operating capabilities, pilots, and technologies in development are identified separately.
View technology