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. 550Machine Learning

    A Mathematical Introduction to Diffusion Models

    • The convergence guarantees of Langevin dynamics and ULA and MALA are proved through KL contraction under log-Sobolev inequalities.
    • The Tweedie identity and the reverse-time SDE form the theoretical backbone of diffusion models, while the same Gaussian channel is reinterpreted through Polchinski flow and probabilistic localization.
    • The discretization error of DDPM is decomposed into three terms, early stopping, KL telescoping, and score error, for analysis.
    • Discrete diffusion models replace the noising SDE with a continuous-time Markov chain and reframe the error analysis in finite state spaces.
    • It systematizes guidance, reward tilting, path-space control, and inference-time reinforcement learning as ways to steer trained models at inference time.
    • More than 50 references and appendices on Itô calculus and Gaussian tools make the work self-contained.
  2. 549Distributed Systems

    Next-Generation Agentic Reinforcement Learning Systems Enable Self-Evolving Agents

    • The core claim is that the bottleneck in self-evolving agents lies not in the RL algorithm, but in the system layer, including ATDP, data proxies, and the evolution control surface.
    • ATDP proposes a vendor-neutral protocol that includes step-level decision context, actions, outcomes, delayed rewards, and governance metadata.
    • The evolution control surface automatically chooses among memory, skills, harnesses, weights, and rollback based on trajectory statistics, evaluation scores, user correction rates, cost, and safety constraints.
    • AREAL2.0 is a prototype that reorganizes existing RL frameworks into an online agent-service-oriented RL loop, and it folds LLM calls from agent services into the RL training loop by swapping only the gateway.
    • It cites OpenClaw as an example of a personal self-evolving agent and analyzes the gap to enterprise-level governance.
    • It defines self-evolution not as a simple weight update, but as a multidimensional improvement of a composite policy made up of the LLM, harness, memory, and tools.
  3. 548Computer Vision

    WorldDirector: Building Controllable World Simulators with Persistent Dynamic Memory

    • It explicitly separates motion planning for dynamic objects from video synthesis, which lets it preserve both physical logic and appearance stability.
    • An LLM orchestrator generates 3D trajectories and then projects them into 2D to provide location conditioning for the video generation model.
    • Appearance Binding preserves visual consistency when an object reappears, regardless of how long it was off screen.
    • It achieves SOTA on every reconstruction metric, with PSNR 18.127, SSIM 0.502, and LPIPS 0.359.
    • It is far ahead on dynamic object consistency as well, with DSC_DINO at 0.769 and DSC_CLIP at 0.917.
    • Promptable World Events lets users freely design the timing, motion, and trajectories of new objects that do not appear in the initial frame.
  4. 547Computer Vision

    World from Motion: Generative Dynamic Gaussian Reconstruction from Monocular Video

    • It is the first method to condition a video generation model on a dynamic 3DGS representation, rendering geometry, appearance, and 3D motion according to reference and target views.
    • It achieves state-of-the-art results on the DyCheck benchmark with mPSNR 19.98, mSSIM 0.716, and mLPIPS 0.178.
    • In the optimization step that distills generated samples back into dynamic 3DGS, it also improves 3D tracking accuracy, with PCK@0.05 rising from 0.824 for MoSca to 0.862.
    • Reconstruction quality improves monotonically as the number of virtual cameras increases and converges after 8 cameras, with mPSNR rising from 18.69 to 19.78.
    • It outperforms both generation-based methods such as CAT4D and Vista4D and reconstruction-based methods such as WorldTree and ViDAR.
    • It can perform visual outpainting on in-the-wild video, dynamic correction, and out-of-view dynamics inference.
  5. 546AI / General

    Seed2.0 Model Card: Towards Intelligence Frontier for Real-World Complexity

    • Three sizes, Pro, Lite, and Mini, let users choose a performance-speed tradeoff, and Mini costs $0.03 per million for prefill and $0.31 per million for decode.
    • Compared with GPT-5.2 at $1.75/$14 and Claude Opus 4.5 at $5/$25, Seed2.0 Pro is far more cost-efficient at $0.47/$2.37.
    • In China MaaS traffic, the internet industry dominates, while manufacturing, automotive, and telecom each account for less than 1%, and unstructured information processing is the main scenario.
    • For agentic coding requests, frontend development and bug fixing dominate, with Vue.js used more than three times as often as React.
    • The goal is to achieve competitiveness on research-level reasoning tasks such as Erdős problems and scientific coding.
    • Seed2.0 acknowledges that there is still a gap to Claude and Gemini on coding tasks such as SWE-Evo and NL2Repo, as well as on long-tail knowledge such as SuperGPQA.
  6. 545AI / General

    AutoMem: Automated Learning of Memory as a Cognitive Skill

    • The file system, including read, write, search, append, and create, is promoted to a first-class memory action equivalent to task actions, so every memory decision is traceable.
    • In Outer-loop 1, a meta-LLM reviews trajectories of up to 100,000 steps and automatically improves the agent scaffold, including the code, prompts, and memory schema.
    • In Outer-loop 2, good memory decisions from the agent are extracted and used to LoRA fine-tune a dedicated memory specialist model, while the task model remains frozen.
    • Memory optimization alone yields a 2x to 4x performance gain without changing task-model weights, showing that memory has more leverage than model scale.
    • The optimized 32B agent surpasses 72B and reaches the level of Claude Opus 4.5 and Gemini 3.1 Pro Thinking.
    • This is the first case that turns the cognitive-science concept of metamemory into a concrete optimization target for LLM agents.
  7. 544Robotics

    ASPIRE: Agentic /Skills Discovery for Robotics

    • The closed-loop robot execution engine exposes multimodal traces for each primitive, including perception overlays, grasp candidates, trajectories, and collision feedback, enabling autonomous failure diagnosis and repair by the agent.
    • It accumulates validated repair patterns in a skill library and reuses them as in-context guidance on later tasks, improving adaptation speed as the task set grows.
    • Evolutionary search goes beyond single-trajectory repair by exploring multiple candidate programs in parallel, which further improves success rates.
    • It achieves a 31 percent zero-shot success rate on LIBERO-Pro Long, compared with 4 percent for the previous method, demonstrating the generalization effect of the growing skill library.
    • When sim skills are transferred to a real dual-arm robot, inference tokens are reduced by about 10x and success rates also improve.
    • Performance improves step by step from a macro average of 14 percent without the execution engine to 62 percent with the engine and 72 percent with evolutionary search.
  8. 543Computer Vision

    LeVLJEPA: End-to-End Vision-Language Pretraining Without Negatives

    • This is the first proof that stable large-scale vision-language pretraining is possible with only cross-modal prediction and SIGReg regularization, without negative pairs.
    • When used as a VLM backbone, it outperforms both CLIP and SigLIP, with GQA at 44.6%, VQAv2 at 54.2%, and POPE at 66.9% on the Llama-1N setup.
    • For semantic segmentation, it provides better dense semantic features than contrastive learning, preserving structured information at the patch-token level.
    • In zero-shot classification, contrastive learning still leads, but as a backbone the zero-shot score is actually inversely correlated with performance.
    • The entire training recipe removes the need for negatives, temperature, momentum, and teacher-student mechanisms, simplifying training and reducing cost.
    • It is well suited to object-centric representation learning and is more robust to backgrounds than contrastive methods.
  9. 542Machine Learning

    Is One Layer Enough? Training A Single Transformer Layer Can Match Full-Parameter RL Training

    • Training just a single transformer layer can recover up to 114% of the full RL gain, while the weakest layers contribute less than 30%.
    • High-contribution layers consistently concentrate in the middle 40% to 60% of the network depth, regardless of model scale, family, RL algorithm, or dataset.
    • The layer contribution ranking is stable, with Spearman rho equal to 0.76 across datasets and 0.59 across tasks.
    • Raising the learning rate or selectively training the high-contribution layers adds further gains over full RL, including +43% for Qwen3-1.7B, +27% for 4B, and +32% for 8B.
    • Models trained on different layers show complementary behaviors, and majority voting can improve performance further.
    • Although the weight change magnitude is relatively uniform across layers during full training, the contribution is extremely uneven, which shows that parameter subspace efficiency differs sharply.
  10. 541AI / General

    FARS: A Fully Automated Research System Deployed at Scale

    • The system uses a fully automated four-stage pipeline: Ideation, Planning, Experiment, and Writing, with a specialized agent at each stage and a shared workspace.
    • It generated 166 papers across 67 fine-grained AI and ML topics and preserved the full output, including successful, failed, and negative results, rather than only selected samples.
    • It collected 282 structured volunteer reviews covering 140 papers, including ratings, soundness, presentation, contribution, integrity checks, and disclosure of LLM use.
    • In a cross-comparison with the Stanford Agentic Reviewer, FARS scores 5.00 out of 10 across 165 papers, which surpasses existing systems such as DeepScientist at 4.13 and ScientistOne at 4.00.
    • Human reviews average 3.23 out of 10, so they are stricter than automated reviewers but still aligned in direction, and 11.4 percent of papers reach the accept threshold under automated review criteria.
    • Repeated failure modes include narrow experimental scope, methodological limitations, and integrity issues such as claim-artifact mismatch, which makes contribution quality, experimental sufficiency, and faithful reporting the true bottlenecks rather than polished presentation.
  11. 540Computer Vision

    CoLT: Teaching Multi-Modal Models to Think with Chain of Latent Thoughts

    • The problem is that text CoT must generate thousands of tokens autoregressively, which causes large inference latency, and the natural-language form can erase alternative reasoning paths.
    • It uses three forms of step-level supervision: forward decoding from latent to text, backward decoding from text to latent, and internal supervision for consistency between latent steps.
    • At inference time it removes the decoder and internal supervision, so reasoning is completed with only 3 latent vectors and no extra parameter overhead.
    • Across 8 benchmarks on Qwen3-VL-8B, including MMStar, MathVista, and SeedBench, it consistently outperforms both text CoT and previous latent reasoning methods.
    • For speed, text CoT takes 7.24 seconds and 142 tokens, whereas CoLT takes 0.32 seconds with 3 latent vectors, which is a 22.6x decoding speedup and a 10.1x end-to-end speedup.
    • It is also robust to noise: under visual and textual noise, Direct Answer drops by 7.2 to 19.0 percent, Text CoT drops by 5.0 to 13.8 percent, but CoLT drops only 2.8 to 9.0 percent.
  12. 539LLMs / NLP

    Parametric Skills

    • The core problem is that in-context skills are limited by the model's ability to understand and follow instructions, and performance drops sharply, especially for open-source models or long contexts.
    • The solution is to feed a text skill into a hypernetwork that generates a LoRA adapter in a single forward pass, applying the skill without consuming context window.
    • It builds a 45.8K-scale high-quality skill library from web crawling and summaries of real agent trajectories, covering 13 domains.
    • On six SWE tasks, ParametricSkills scores 64.09 versus 57.65 for in-context learning and 48.48 for SHINE, averaged over LLM judges. SHINE fails to faithfully compress both the skill content and how to use it.
    • Rank-concatenation merging gives multi-skill composition performance equal to or better than a single LoRA, and it outperforms factor-wise linear merging.
    • In HumanEval-based self-evolving experiments, five rounds of iteration improve accuracy from 75% to 84.76%, and online continual merging further improves it from 29% to 51.6%.
  13. 538Computer Vision

    ABot-M0.5: Unified Mobility-and-Manipulation World Action Model

    • It identifies three structural bottlenecks: temporal resolution mismatch between coarse video and fine-grained control, action-space mismatch between navigation and manipulation, and context mismatch between training and inference.
    • It introduces an intermediate latent action that bridges video latent representations and embodiment-specific control while capturing local visual state transitions.
    • A dual-level Mixture-of-Transformers separates modality representation from heterogeneous action subspaces, such as base movement and arm manipulation, so that each can be optimized separately.
    • Dream forcing trains dynamics on model-predicted dream video, which aligns autoregressive inference with training conditions and reduces long-horizon rollout error accumulation.
    • On RoboCasa365 mobile manipulation, it reaches 90.8 percent, 75.4 percent, and 58.4 percent across difficulty levels, and on real-robot peg insertion it achieves a 70 percent success rate and a 96 percent process score, compared with 50 percent and 90 percent for pi0.5 and 30 percent and 77 percent for Fast-WAM.
    • On real robot long-horizon tasks such as plate sorting, fruit sorting, and flower arrangement, it achieves 60 to 80 percent success, which is a large improvement over Fast-WAM at 20 to 40 percent.
  14. 537Machine Learning

    TRIAGE: Role-Typed Credit Assignment for Agentic Reinforcement Learning

    • A core problem in agent RL is that GRPO applies trajectory success or failure to every action equally, which punishes useful exploration in failed rollouts and rewards regression in successful rollouts.
    • It introduces a four-role taxonomy, Decisive, Exploration, No-progress, and Regression, and applies differentiated credit rules by role.
    • It proves that role labels alone can support MSE-optimal segment correction and always reduce advantage estimation error within the judge's trusted range.
    • On Qwen3-1.7B, it improves ALFWorld by 18.4 points and WebShop by 7.9 points, while reducing environment turns per completed rollout by 10.4% to 14.8%.
    • Regression suppression is the main driver of the gains, with exploration bonuses adding only 0.6 to 1.7 points as a stable auxiliary benefit.
    • It outperforms scalar process rewards and outcome-supervised value baselines, so the key benefit comes from role typing itself rather than simply adding dense rewards.
  15. 536Information Retrieval

    GR2 Technical Report

    • Semantic ID mid-training with at least 99% uniqueness lets the LLM directly reason about catalog items.
    • Trace distillation from a strong 32B teacher model installs reasoning priors in the 8B student model.
    • DAPO-based RL with multiple rewards, format, AUC/NDCG, and LLM-as-judge, optimizes re-ranking.
    • It improves industrial traffic by +18.7% in R@1, +7.1% in R@3, and +9.6% in N@3.
    • On-Policy Distillation (OPD) recovers about 82% of the 32B teacher gains with a 1.7B model that is only 5% of the size.
    • Conditional reward design to prevent reward hacking, such as preserving input order and exploiting position bias, is essential.
  16. 535Software Engineering

    SWE-Together: Evaluating Coding Agents in Interactive User Sessions

    • It extracts 109 verifiable tasks from 11,260 real sessions, for a conversion rate of 0.97 percent.
    • The state-conditioned LLM user simulator preserves the original intent while adapting feedback to the trajectory.
    • It evaluates along multiple dimensions using final accuracy, user correction, meaning the number of correction turns, and intent coverage.
    • Stronger agents achieve higher success rates with fewer interventions, suggesting an improved user experience.
    • It highlights the limits of static SWE-Bench style evaluation, which misses real interaction by scoring only single-turn commands and final code.
    • It uses four upstream data sources: DataClaw, Pi-staging, Hyperswitch, and SWE-chat.
  17. 534Computer Vision

    GPC: Large-Scale Generative Pretraining for Transferable Motor Control

    • It learns a discrete motion representation based on Finite Scalar Quantization (FSQ), which avoids the codebook problems of VQ-VAE.
    • It models motion tokens with a GPT-style autoregressive transformer using next-token prediction.
    • It is trained on a dataset with more than 600 hours of motion data and achieves a 99.98% tracking success rate.
    • It shows emergent behaviors such as disturbance recovery and fall recovery strategies.
    • It supports adaptation to new tasks through Parameter-Efficient Fine-Tuning (PEFT).
    • It is a SIGGRAPH 2026 paper from NVIDIA and Simon Fraser University.
  18. 533AI / General

    Self-Evolving World Models for LLM Agent Planning

    • We present a self-evolving world model that changes only deployment-time context without parameter updates.
    • Episodic memory uses retrieval-based simulation of real action transitions.
    • Semantic memory extracts persistent heuristic rules from prediction-observation mismatches.
    • Selective foresight filters low-confidence predictions before integrating them into the agent's reasoning context.
    • It achieves the best predictive accuracy across all three backbones on ALFWorld and ScienceWorld.
    • Oracle experiments show that noisy foresight harms action accuracy, proving the importance of confidence filtering.
  19. 532Information Retrieval

    ShopX: A Foundation Model for Intent-to-Item Fulfillment in Agentic Shopping

    • It unifies intent-to-item fulfillment in a single model: intent understanding, execution planning, and SID-native control.
    • Semantic ID (SID) design: semantically recoverable and editable by the LLM.
    • It specializes a general LLM into a shopping agent through continued pretraining and post-training recipes.
    • On single-turn and multi-turn evaluations based on Taobao production logs, it outperforms existing tool-mediated systems.
    • It achieves especially large gains on complex and ambiguous requests, reaching precision of 88% to 97%.
    • The model-native design reduces loss during handoff between orchestration and item execution.
  20. 531AI / General

    OSWorld2.0: Benchmarking Computer Use Agents on Long-Horizon Real-World Tasks

    • It contains 108 long-horizon workflows, with a human median of 1.6 hours and an average of 318 tool calls per agent.
    • Claude Opus 4.8 with max thinking completes 20.6 percent of tasks, while GPT-5.5 completes about 13 percent, although its token efficiency is better.
    • It defines 10 challenge phenomena, including dynamic environments, cross-source reasoning, hidden-state reasoning, and conflict resolution.
    • It builds a realistic environment from 31 self-hosted web services, including email, banking, and chat.
    • The main failure causes are forgetting constraints, missing intermediate information, guessing, and skipping verification, not basic GUI manipulation.
    • Agents spend less than 7 percent of their own budget on error detection and correction.
  21. 530Machine Learning

    AdaJEPA: An Adaptive Latent World Model

    • The first test-time adaptation framework for a JEPA world model, using a Plan-Execute-Adapt-Replan loop.
    • It performs self-supervised adaptation from observed transitions alone, without additional expert demonstrations.
    • It achieves large gains with only one gradient step per MPC replanning step.
    • It produces significant improvements over the fixed model on both in-distribution and out-of-distribution target-reaching tasks.
    • It shows especially large gains when training data is limited.
    • It compares online buffer management strategies using recent-N and hard-N approaches.
  22. 529AI / General

    Xiaomi-GUI-0 Technical Report

    • A hybrid, real-device-centered infrastructure uses physical devices as the main environment and a sandbox as a secondary one to match the real deployment distribution.
    • An error-driven data flywheel turns failed rollout trajectories into corrective actions, reflection explanations, and recovery demonstrations.
    • A three-stage progressive curriculum: SFT for basic operations, Step RL for long-term planning, and Agentic RL for error recovery.
    • It achieves a 72.0% success rate on RealMobile and 78.9% on AndroidWorld.
    • It strengthens the ability to handle abnormal states in real applications, including account states, permission dialogs, payment authentication, and risk controls.
    • It builds a closed-loop real-device environment to solve emulator-detection mechanisms.
  23. 528LLMs / NLP

    MOPD: Multi-Teacher On-Policy Distillation for Capability Integration in LLM Post-Training

    • It uses a three-stage pipeline: General SFT, Domain-specialised RL, and Multi-teacher On-Policy Distillation.
    • It aligns teacher and student on student rollouts with per-token reverse KL, which gives dense supervision and remains on-policy.
    • On Qwen3-30B-A3B, it improves by 5.5 points over the next best baseline and closes 91% to 95% of the teacher-student gap.
    • Domain teacher training can run in parallel, which increases development throughput and decouples the domains.
    • Teachers from the same origin are key to stable optimization, while using external teachers risks divergence.
    • It is deployed in the MiMo-V2-Flash industrial model, which validates its utility at frontier scale.
  24. 527AI / General

    Domain-Informed Multi-View Self-Distillation for Astronomical Light-Curve Representation Learning with JEPA

    • C-RoPE, or Continuous Rotary Positional Embedding, uses rotary position encoding to handle irregular observation intervals.
    • EANE, or Error-Aware Numeric Embedding, integrates measurement uncertainty or noise into the embedding.
    • It performs multi-view self-distillation across three domain views: raw light curves, GLS periodograms, and phase-folded curves.
    • On the StarEmbed benchmark, it beats hand-crafted features on 15 of 16 metrics, with macro-F1 ranging from 42.56 to 63.58.
    • It is validated on downstream applications such as similarity search, zero-point drift detection, and parameter estimation.
    • It reaches state of the art on 5 of the 12 non-astronomy datasets in PYRREGULAR, which highlights the importance of domain-specific design.
  25. 526AI / General

    DOPD: Dual On-policy Distillation

    • It defines the privilege illusion as a failure pattern in which information asymmetry from privileged information is mistaken for ability gaps.
    • Advantage-aware routing dynamically selects the supervision source, teacher or student, for each token.
    • It improves average performance by +7.5 points over Vanilla OPD on LLMs and +6.0 points on VLMs.
    • It applies strong-teacher distillation over the full vocabulary and weak-student self-supervision by token category.
    • It shows consistent gains in continual learning, OOD generalization, and training stability.
    • Token-level analysis shows that high-teacher, low-student tokens are responsible for transferring core abilities.
  26. 525Robotics

    SimFoundry: Modular and Automated Scene Generation for Policy Learning and Evaluation

    • It automatically generates a sim-ready digital twin from a single video, with F1 scores from 0.81 to 0.92 and 0.93 to 0.99 after 3 minutes of tuning.
    • It generates scene variations that preserve affordances while increasing diversity across object, scene, and task cousins.
    • Across 7 tasks and 5 policies, simulation evaluation correlates with real performance at Pearson 0.911, which is 0.59 higher than the previous SOTA.
    • Training policies on cousin data improves zero-shot sim-to-real transfer success by 17 to 40 percent.
    • It shows strong zero-shot transfer on YAM, with 99 percent Pot on Stove success, and on DROID, with 100 percent Stack Dishware success.
    • It handles more complex tasks than prior work, including multi-step manipulation, articulated-object interaction, and bimanual collaboration.
  27. 524Information Retrieval

    Diagnosing and Mitigating Context Rot in Long-horizon Search

    • Context rot is defined as the phenomenon in which accumulated context causes the model to give up or produce an uncertain answer.
    • It performs a systematic diagnosis using four open-source models, including Qwen3.5-397B and GLM-4.7, across three benchmarks.
    • It evaluates seven management methods, including context compaction, trimming, and isolation, in terms of performance, cost, and their effect on rot.
    • Rot-aware filtering, which removes uncertain or give-up trajectories, improves average performance by 2.6 to 4.9 percent.
    • The combination of compaction and trimming offers the best balance between cost and rot mitigation.
    • Context isolation through subagents is highly model dependent and only works well on stronger models.
  28. 523Machine Learning

    ScaleAware-JEPA: Latent Representation for Discovery in Multiscale Physical Fields

    • Constrained Diffusion Decomposition, or CDD, decomposes fields into pixel-level scale components.
    • The CDD scale determines the masking geometry, aligning the physical scale hierarchy with the prediction task.
    • It is applied to three heterogeneous domains: MHD turbulence, the NGC 3627 molecular gas field, and Chengdu night lights.
    • It can generate a dense latent atlas without labels, segmentation, or catalogs.
    • It quantitatively verifies the superiority of scale-aware masking over fixed patch masks.
    • It is an independent study performed on consumer hardware, specifically an Apple M3 Pro and an RTX 3090.
  29. 522Machine Learning

    Towards Automating Scientific Review with Google's Paper Assistant Tool

    • It uses a four-stage agent pipeline of Segmenter, Adaptive Budgeting, Deep Review, and Global Synthesis.
    • It improves recall by 34 percent over zero-shot on math error detection in the SPOT benchmark.
    • It was piloted as a pre-submission tool at two major conferences, STOC and ICML.
    • It proposes a four-level taxonomy for AI roles: Tool, Supporting Reviewer, and Fully Automated.
    • It addresses the precision drop and context limits of Pass@k through segment-level deep review.
    • A NeurIPS 2021 study found that even human reviewers had a 23 percent disagreement rate, which suggests practical value for AI review.
  30. 521LLMs / NLP

    Scaling the Horizon, Not the Parameters: Reaching Trillion-Parameter Performance with a 35B Agent

    • A 35B MoE shows a performance path based on expanding agent horizon rather than parameter count.
    • Knowledge-Action Graph (KAG): a long-horizon trajectory infrastructure that stores evidence, actions, observations, and verification results as connected objects.
    • A three-stage training pipeline: all-domain SFT, domain-specific teacher RL, and domain-routed multi-teacher on-policy distillation.
    • It generates agent trajectories averaging 45K tokens and integrates six heterogeneous domains.
    • It outperforms 1T models on SEAL-0 (56.4), IFBench (80.6), and FrontierScience-Olympiad (79.0).
    • Salient Vocabulary Alignment reduces conflicts between reasoning patterns across domains.

From research to product use

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

View technology