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. 520Computer Vision

    Orca: The World is in Your Mind

    • It proposes Next-State Prediction as a unified paradigm instead of Next-Token, Next-Frame, or Next-Action Prediction.
    • It designs two complementary paradigms, unconscious learning through dense state transitions in continuous video and conscious learning through language-conditioned sparse event transitions.
    • It builds a large-scale world-learning dataset with 125,000 hours of video and 160 million event annotations.
    • It freezes the encoder and trains only a lightweight decoder to produce text, image, and action readouts.
    • It validates scalability at the 4B and 0.8B scales, showing that larger world latents translate directly into stronger downstream performance.
    • It also openly states clear limitations, including the current restriction to vision and language modalities, short-horizon transitions, and limited model scale.
  2. 519Robotics

    World Action Models Enable Continual Imitation Learning with Recurrent Generative Replays

    • The first continual imitation learning approach to use WAM generative capability, reconstructed future frames, as pseudo-replay.
    • Compared with sequential fine-tuning, it reduces catastrophic forgetting by up to 50% and comes close to experience replay that uses real demonstrations.
    • Recursive generation feeds future observations predicted by the WAM back into the model to synthesize complete trajectories, which is recurrent generative replay.
    • It remains effective on real robots as well: NBT improves from 96.3 to 60.5, reducing forgetting by 40%, and FWT improves from 50 to 80.
    • It identifies two main bottlenecks: visual quality degradation during long-horizon recursive generation, reflected in lower PSNR, and mismatch between imagined and grounded actions, 83% versus 42%.
    • Action representation drift shows that REGEN, at 0.12, preserves representations much better than Seq-FT, at 0.30.
  3. 518Robotics

    Translation as a Bridging Action: Transferring Manipulation Skills from Humans to Robots

    • The paper argues that rotation information from human hands is noisy and that rotation-inclusive 6DoF learning is suboptimal because the human hand and parallel gripper have different contact patterns.
    • It adopts relative wrist translation in the head-camera frame as a bridging action and builds a shared action space between humans and robots.
    • An interleaved action token sequence, 3D-wrist to 6D-eef to gripper, together with attention masking, handles missing components in heterogeneous data.
    • The training strategy has three stages: large-scale human-data pretraining, joint human-robot training, and a small amount of real-robot fine-tuning.
    • Adding bridging-action supervision to robot data is essential, raising overall success from 12.5 percent to 38.3 percent.
    • The upper-bound analysis shows that removing the embodiment gap lets the bridging objective achieve even stronger transfer performance, with overall progress rising from 59.75 percent to 73.54 percent.
  4. 517Robotics

    SceneBot: Contact-Prompted General Humanoid Whole Body Tracking with Scene-Interaction

    • Using reference motion plus per-link contact labels as policy conditioning, we unify free-space and contact-rich behaviors in a single policy for the first time.
    • Hindsight scene reconstruction infers the scene-interaction graph from retargeted human motion and reconstructs terrain and object assets in reverse.
    • With 7.5 hours of contact-rich training data, combining AMASS, OMOMO, Bones, and Lafan, it generalizes to unseen motions and environments.
    • Global root tracking is essential: without it, terrain success drops from 100% to 45% and object-task success from 95% to 20%.
    • Removing contact labels makes object-grasp success converge to 0%, proving the decisive role of contact labels.
    • On the real Unitree G1, state-estimation performance is confirmed with an average root-position error of 0.032 m and a rotation error of 0.018 rad.
  5. 516AI / General

    AgentX: Towards Agent-Driven Self-Iteration of Industrial Recommender Systems

    • The four-stage closed loop is Brainstorm, which proposes evidence-based ideas; Developing, which generates repo-grounded code; Evaluation, which performs guardrail-vetoed A/B decisions; and Harness Evolution, which applies SGPO.
    • SGPO, or Semantic-Gradient-based Prompt Optimization, uses execution trajectories to update agent prompts and doubles weekly throughput.
    • Three AgentX workers turned 374 ideas into 10 launchable rollouts over 3 weeks, which is 8x the concurrency of human engineers and 3.7x the business value.
    • It uses online A/B feedback as a reward signal so that the work stays aligned with real business value, including a 0.561 percent increase in app dwell time and more than 100 million yuan in annual value.
    • It shows that the approach can extend beyond recommendation strategy to model-side research, such as paper replication, module pruning, and architecture combination.
    • It includes a negative-result assetization mechanism that turns failed experiments into structured knowledge assets.
  6. 515Computer Vision

    PhysisForcing: Physics Reinforced World Simulator for Robotic Manipulation

    • We experimentally identify two sources of physical errors: deformation of moving objects and unnatural spatiotemporal correlations between interacting entities.
    • We design complementary pixel-level trajectory alignment loss based on point tracking and semantic-level relation alignment loss based on a frozen video encoder.
    • We propose a physics region focus strategy that concentrates physical supervision on interaction-critical regions, outperforming uniform application by 1.5 points.
    • On R-Bench, we improve Wan2.2-I2V-A14B by 22.3% and Cosmos3-Nano by 9.2%, corresponding to gains of 7.1% and 3.7% over vanilla finetuning, respectively.
    • In the WorldArena action-planner protocol, closed-loop success rises from 16.0% to 24.0%, and average downstream policy success rises from 68.2% to 72.8%.
    • PF-Cosmos achieves the best overall score on R-Bench, PAI-Bench, and EZS-Bench.
  7. 514Computer Vision

    Qwen-Image-2.0-RL Technical Report

    • It fine-tunes a VLM with pointwise scoring and chain-of-thought reasoning to build task-specific composite reward models for T2I, including alignment, aesthetics, and portrait quality, and for editing, including instruction following and face ID.
    • It introduces a hybrid CFG strategy in the GRPO-based RL framework to preserve pretrained knowledge and training stability at the same time.
    • On-policy distillation, or OPD, integrates the T2I teacher and the editing teacher into a single student model through trajectory-level velocity matching.
    • OPD achieves better performance than mixed RL, which optimizes multiple rewards at once, because it avoids cross-task interference.
    • It reports consistent improvements on Qwen-Image-Bench with 57.84 points, up 2.61, on the T2I arena with an Elo gain of 78, and on the editing arena with an Elo gain of 93.
  8. 513Robotics

    In-Context World Modeling for Robotic Control

    • We formulate the problem of restoring missing system configuration psi, such as camera viewpoint and morphology, as context in the VLA setting.
    • We prepend N task-independent random-search clips, typically 3 to 5, as context to implicitly infer system dynamics without parameter updates.
    • Across six OOD viewpoints, the average success rate is 25.0%, a gain of 5.2 percentage points over Multi-View's 19.8%, and wrong context can reduce performance to 18.9%, proving that the model truly depends on context.
    • With 20 to 80 mm spacers attached to the robot gripper, a morphology change is preserved with a 60% margin, with ICWM at 14.4% versus 5.6% for Multi-View.
    • Reusing context hidden states with KV caching restores inference latency to the 0.112 s baseline.
    • This context adaptation ability does not emerge naturally in standard imitation learning and requires an explicit training incentive.
  9. 512Machine Learning

    The Red Queen Gödel Machine: Co-Evolving Agents and Their Evaluators

    • Controlled utility evolution, with a fixed criterion within each epoch and replacement only at epoch boundaries, preserves self-improvement guarantees even under nonstationary utility.
    • On coding tasks such as Polyglot, adding agent-as-a-judge code review signals improves pass rate by 1.8 percentage points over the previous SOTA while using 1.35x to 1.72x fewer tokens.
    • In the paper-writing setting, the co-evolved writer's acceptance rate rises from 21.8 percent to 40.5 percent, which is a 1.86x improvement.
    • In IMO-level proof grading, the co-evolved grader reaches higher accuracy with three times less search cost than the fixed baseline.
    • By injecting adversarial goals at epoch boundaries, it corrects reviewer self-preference bias toward AI-generated papers, where AI papers are accepted 1.91 times too often.
    • As the evaluator gets stronger, it also creates a curriculum effect for the task agent, which leads to archive reranking and gradual strengthening.
  10. 511AI / General

    The Verification Horizon: No Silver Bullet for Coding Agent Rewards

    • When quality judging and trajectory monitoring are added to unit-test rewards, the SWE-Bench hacking solve rate drops sharply from 28.57% to 0.56%, while the normal solve rate rises from 40.22% to 60.53%.
    • For frontend tasks, introducing a browser-based interaction evaluator defends against length attacks that are vulnerable to static code inspection.
    • User-feedback rewards achieve up to a 13.3-point improvement across five internal coding-agent benchmarks.
    • For autonomous-evaluator data filtered for long-horizon tasks, RFT gains +1.91 points over random sampling, from 21.61 to 23.52.
    • There is no single mechanism that satisfies all three dimensions of verification, scalability, fidelity, and robustness, so task-specific design is essential.
    • Verification is not auxiliary but core training infrastructure, and it must co-evolve continuously with policy capability growth.
  11. 510AI / General

    Ask, Don't Judge: Binary Questions for Interpretable LLM Evaluation and Self-Improvement

    • It uses a meta-prompt structure that breaks evaluation criteria into atomic binary questions, which greatly improves transparency and diagnostic value.
    • On QAGS for factual consistency, it improves Spearman rho by 0.195 over UniEval, which shows that the decomposition itself contributes most of the information gain.
    • BINEVAL catches subtle factual errors that G-Eval and UniEval give a perfect 5.0 to by asking 7 questions each, reaching 1.57 points and coming close to human judgment at 2.0.
    • It avoids the usual ceiling effect of LLM judges and distinguishes borderline outputs from clearly defective ones more effectively.
    • It improves both summarization and IFBench prompts through cross-model prompt updates that use question-level feedback.
    • Its task-agnostic and training-free design makes it immediately applicable to summarization, dialogue, instruction following, and other tasks.
  12. 509Machine Learning

    Training for the Model You Return: Improving Optimization for Iterate-Averaged Language Models

    • Formulate iterate-average optimization as a continuous-time stochastic quadratic optimal control problem.
    • PACE is a lightweight wrapper on top of AdamW, with extra memory equal to one copy of the model weights.
    • The standard SCO convergence rate is guaranteed in the convex setting, and arbitrarily large bounded errors can be improved in the quadratic setting.
    • It shows consistent gains in three fine-tuning settings on SmolLM2, Qwen3, and Gemma3, and also works for GPT-2 FineWeb pretraining.
    • It is competitive with Schedule-Free and removes the need for LR decay, outperforming WSD across all token budgets with constant LR.
    • Extensive ablations on pullback strength c, EMA power κ, and update frequency show its robustness.
  13. 508Robotics

    LA4VLA: Learning to Act without Seeing via Language-Action Pretraining

    • It provides a systematic analysis of vision-language asymmetry in VLA training at both the data level and the input level.
    • It automatically builds 33K LA episodes from existing demonstrations without collecting extra data, in LA4-33K.
    • LA-only pretraining consistently outperforms VLA-only pretraining at the same scale.
    • Mixed LA-VLA pretraining reaches 87.53% on MetaWorld, 96.28% on LIBERO, and 83.3% on real robots.
    • Under visual noise, the LA-pretrained policy achieves a success rate that is 25 percentage points higher than VLA-only.
    • t-SNE analysis of the LA-pretrained policy shows clearly separated representations by command direction.
  14. 507Machine Learning

    Hallucination in World Models is Predictable and Preventable

    • It defines three types of hallucination: perceptual hallucination from the tokenizer, action hallucination from marginalization in the dynamics, and scene hallucination from rollout divergence.
    • MMBench2 contains 65,600 trajectories spanning 427 hours, 210 tasks, and 10 domains, together with ground-truth actions, rewards, and the simulator.
    • Coverage-aware training improves both the tokenizer and dynamics, which raises rollout PSNR by 0.88 dB.
    • Collecting only 50 curiosity-driven trajectories yields 0.325 adaptation performance on unseen tasks, which is about 90 percent of the expert or human score of 0.362.
    • The hallucination predictors show a strong negative Spearman correlation of about 0.80 with rollout ΔPSNR.
    • The analysis also compares an off-the-shelf tokenizer, Wan 2.1 VAE, with an in-domain tokenizer.
  15. 506Machine Learning

    Fast LeWorldModel

    • Action-prefix prediction generates multi-horizon latents in parallel, removing the bottleneck of sequential rollouts.
    • The dynamics module time drops from 31.4 seconds to 8.0 seconds, a 3.9x speedup, and overall CEM solve time falls by 48%.
    • Both the initial open-loop latent loss and its growth slope are significantly lower than in LeWM.
    • Average planning success rate rises from 85.8% to 90.5%, including 98% on Two-Room, 96% on Push-T, and 80% on Cube.
    • An ablation confirms that dense prefix supervision is essential for performance, not just terminal-only prediction.
    • In physical-state probing, an MLP probe achieves the best accuracy on agent position, block position, and angle.
  16. 505LLMs / NLP

    OPID: On-Policy Skill Distillation for Agentic Reinforcement Learning

    • Because it directly extracts hindsight skills from completed on-policy trajectories, no external skill library or retrieval is needed.
    • It introduces a two-level hierarchy with episode-level skills for global workflows and failure-avoidance rules, and step-level skills for local decisions.
    • Critical-first routing uses step-level skills at important moments and falls back to episode-level skills otherwise.
    • It achieves 58.9 percent on ALFWorld, compared with 46.1 percent for GRPO, and 74.2 percent on WebShop, compared with 63.3 percent for GRPO.
    • It provides a qualitative analysis showing that skill injection fixes the hallucinated-target error in GRPO-trained agents, where the agent searches for objects that do not exist.
    • It is a training-time-only framework that needs no analyzer, external skill retrieval, or privileged context at inference time.
  17. 504AI / General

    The Hitchhiker's Guide to Agentic AI: From Foundations to Systems

    • It covers the foundations from LLM architecture, including tokenization, transformers, attention, and GPU systems, all the way to Flash Attention.
    • It covers alignment techniques such as RLHF, PPO, DPO, and GRPO, and reasoning techniques such as Chain-of-Thought and test-time scaling.
    • For agents, it covers trajectory RL, RAG and Agentic RAG, in-context, external, episodic, and semantic memory systems, and agent harness design.
    • It systematically organizes MCP, or Model Context Protocol, A2A, or Agent-to-Agent, protocols, along with tool use and agent skills.
    • It covers centralized, distributed, and hierarchical multi-agent architectures and communication patterns among agents.
    • It covers the full practical stack, from evaluation methods and agent UI design to production deployment, across more than 600 pages and 400 references.
  18. 503Computer Vision

    Qwen-Image-Agent: Bridging the Context Gap in Real-World Image Generation

    • It defines the root cause of real-world T2I failures as the Context Gap and proposes an agent paradigm to address it.
    • It structures Context-Aware Planning into three stages, information-level, content-level, and generation-level, for identifying missing context, collecting it, and allocating it.
    • Context Grounding collects context from four channels: reasoning, web and image search, memory, and feedback.
    • It builds IA-Bench with four capabilities, Plan, Reason, Search, and Memory, 17 tasks, 730 test instances, and 1,801 checklist items.
    • The intelligence of the MLLM backbone is decisive for the whole system, and swapping the backbone causes large drops on most metrics.
    • It finds that overusing image search can hurt generation quality, which shows that the search boundary must match the generator's ability.
  19. 502Machine Learning

    Improving Neural Network Training by Decoupling the Magnitude and Direction of Weight Vectors

    • It mathematically analyzes interference between weight magnitude and direction: direction updates are inversely proportional to the current magnitude, and magnitude grows as a byproduct of direction learning.
    • It decomposes weights inside the optimizer into fixed-norm directions plus learnable gains, so it can be applied without changing the model architecture.
    • Weight decay and warmup become unnecessary, greatly simplifying large-scale training recipes.
    • The optimal learning rate transfers across model widths, so no LR retuning is needed, similar to µP but obtained directly.
    • On large MoE models, MuonMD reaches the same loss as AdamW with about half the compute.
    • Fixing the direction on the sphere captures most of the improvement, and learnable gains provide additional accuracy gains.
  20. 501LLMs / NLP

    Improved Large Language Diffusion Models

    • It is the first case of scaling a masked diffusion language model to 12T tokens, trained from scratch with 8B parameters.
    • Grouped-query attention reduces KV-cache memory and tied embeddings slim the parameters down to 7.62B.
    • Confidence-based scoring improves PIQA by +1.3, ARC-C by +0.6, and HellaSwag by +2.3 over likelihood-based scoring on multiple-choice evaluation.
    • Extending SFT to 12 epochs yields continuous gains on GSM8K, MATH, and MMLU-Pro, confirming data reuse effects in diffusion LLMs.
    • The base model reaches MMLU 74.8, BBH 71.3, and GSM8K 81.9, surpassing Qwen2.5 7B across multiple benchmarks.
    • The instruct model is competitive without RL alignment, with MMLU-Redux 76.4 and GSM8K 89.0, but it still trails Qwen2.5 Instruct on code and math.
  21. 500Computer Vision

    DanceOPD: On-Policy Generative Field Distillation

    • The method formalizes the conflict between text-to-image, local editing, and global editing from a velocity-field perspective and resolves it with on-policy distillation.
    • It removes target-field ambiguity with hard routing that assigns exactly one capability field to each sample.
    • On GEditBench, it improves by 8.1 percent over the existing OPD baseline while preserving GenEval performance comparable to the T2I source.
    • For local-plus-global editing combinations, it improves by 16.1 percent over the best competing baseline and by 7.9 percent over the local-edit source.
    • When absorbing the realism field, it improves by 9.9 percent over off-policy distillation and reaches 85.3 percent of the student-teacher reward gap.
    • It also shows that classifier-free guidance can be absorbed under the same velocity-MSE objective.
  22. 499LLMs / NLP

    Are We Ready For An Agent-Native Memory System?

    • We propose an analytical framework that systematically decomposes agent memory into four modules: representation and storage, extraction, retrieval and routing, and maintenance.
    • We evaluate 12 memory systems plus two baselines on a unified testbed spanning five workloads and 11 datasets.
    • No single architecture is universally best. Hybrid systems are strong for conversational QA and graph-based systems are strong for factual recall, but they are weak at temporal reasoning.
    • Memory extraction should preserve context at write time. Broader retention, rather than overly selective extraction, is better for downstream reasoning.
    • Conservative merging outperforms delayed flushing or excessive summarization in long-term stability.
    • Highly structured systems pay tens to hundreds of times more in index-build time and query latency, but the accuracy gains do not scale proportionally.
  23. 497AI / General

    Autodata: An agentic data scientist to create high quality synthetic data

    • Autodata is a general method in which an AI agent acts as a data scientist to build high-quality training and evaluation data.
    • The agent automates tool use, data curation, and evaluation to generate synthetic data.
  24. 496Machine Learning

    AsyncOPD: How Stale Can On-Policy Distillation Be?

    • AsyncOPD systematically studies the stale-data problem in asynchronous On-Policy Distillation, or OPD.
    • It shows that the KL direction changes the stale-data problem, where teacher-weighted forward KL is robust and student-weighted reverse KL is fragile, and it shows that recomputing advantages at training time is the most effective fix for reverse-KL OPD.
  25. 495Computer Vision

    Sol Video Inference Engine: Agent-Native Full-Stack Acceleration Framework for Efficient Video Generation

    • Sol Video Inference Engine organizes five techniques, caching, sparse attention, token pruning, quantization, and kernel fusion, into an agent-acceleration stack.
    • Applied to three video models, Cosmos3-Super, LTX-2.3, and SANA-Video, it achieves more than 2x end-to-end acceleration with almost no loss in VBench quality.
  26. 494Computer Vision

    TuringViT: Making SOTA Vision Transformers Accessible to All

    • TuringViT introduces Turing linear attention (TLA) to efficiently process high-resolution and dynamically resized visual sequences.
    • Its VISTA-Curation pipeline curates image and video data to improve data efficiency and support native dynamic-resolution training.
  27. 493Machine Learning

    You Don't Need to Run Every Eval

    • The authors build a public score matrix over 84 frontier models and 133 benchmarks, with 2,604 cells and 23.3% coverage, and show that it is effectively rank-2.
    • They design BENCHPRESS, a rank-2 ALS matrix completion method in logit space, to recover hidden scores within 4.6 points.
  28. 492Computer Vision

    Wan-Streamer v0.1: End-to-end Real-time Interactive Foundation Models

    • Wan-Streamer models language, audio, and video as both inputs and outputs with a single transformer, and uses block-causal attention to support incremental streaming.
    • It jointly learns cognition, reasoning, generation, response timing, turn management, and cross-modal synchronization in one model instead of relying on separate VAD, ASR, language, TTS, avatar, and video generation modules.
  29. 491Computer Vision

    DDStereo: Efficient Dual Decoder Transformers for Stereo 3D Road Anomaly Detection

    • This is the first stereo 3D detector to achieve real-time inference at 23.5 ms, at the level of monocular methods.
    • The dual decoder separates foreground binary detection using disparity features from 3D attribute regression using left-view features.
    • Shared object queries align the two decoders and produce anomaly scores without NMS or anchor matching.
    • On the KITTI-AR-OoD open-set benchmark, it outperforms S3AD with 78.09% OoD AP3D on the R40 metric.
    • It achieves SOTA compared with all existing stereo methods on the pedestrian and cyclist classes.
    • Using only an additional 10% of synthetic data, it still reaches 54.65% OoD AP3D, far exceeding S3AD's 24.45% and showing strong generalization.
  30. 490LLMs / NLP

    NatureBench: Can Coding Agents Match the Published SOTA of Nature-Family Papers?

    • It covers 90 carefully selected tasks from 5,500 Nature-family papers across six scientific domains: cell omics, proteins, biological modeling, physical modeling, molecular design, and relational reasoning.
    • NatureGym is an automatic pipeline that builds a containerized task environment directly from a paper, which ensures reproducibility.
    • Even the strongest agent, Claude Opus 4.7, exceeds the published SOTA only 17.8 percent of the time at g greater than 0.1 and matches it 47.8 percent of the time, which shows that the benchmark relies more on translation than discovery.
    • In 45.5 percent of successful paths, the key step was methodological translation rather than scientific invention, meaning conversion into familiar supervised-learning form.
    • The main failure causes are wrong method selection at 45.1 percent and insufficient compute budget at 24.4 percent, not lack of task understanding.
    • An information firewall hides the original authors' methodology, which forces independent discovery instead of reproduction.

From research to product use

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

View technology