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

    InterleaveThinker: Reinforcing Agentic Interleaved Generation

    • A three-agent Planner-Gen-Critic structure addresses visual over-reliance and error accumulation across steps.
    • The Planner preserves the global goal by blocking intermediate feedback, and the Critic performs step-by-step evaluation and prompt refinement.
    • The authors build high-quality datasets for Interleave-Planner-SFT-80k, Critic-SFT-112k, and Critic-RL-13k.
    • A dual-reward strategy combining accuracy reward and step-level reward optimizes the whole trajectory through single-stage RL.
    • With FLUX.2-klein as the base model, it improves WISE from 0.47 to 0.73 and RISE from 13.3 to 28.9, which reaches the level of Nano Banana and GPT-5.
    • The image generator is replaceable, and the method works with both FLUX.2-klein and Qwen-Image-Edit.
  2. 398Computer Vision

    InternVideo3: Agentify Foundation Models with Multimodal Contextual Reasoning

    • MCR is a closed-loop multimodal reasoning formulation that integrates observation, reasoning, tool actions, feedback, and memory into a shared evolving context.
    • M2LA, or Multimodal Multi-head Latent Attention, compresses the KV cache to make long multimodal rollouts efficient.
    • The staged training pipeline includes M2LA conversion, continued pretraining, short-to-long video SFT, verifiable-task RL, and on-policy distillation.
    • It shows substantial gains over InternVideo2.5-7B on long-video benchmarks such as Video-MME, MLVU, and EgoSchema.
    • It instantiates a video agent with retrieval and verification tools to demonstrate the practicality of recursive multimodal reasoning.
    • Because the open-weight ecosystem is evolving rapidly, the paper emphasizes the principled value of context efficiency and closed-loop reasoning over state-of-the-art claims.
  3. 397Machine Learning

    RLCSD: Reinforcement Learning with Contrastive On-Policy Self-Distillation

    • It discovers privilege-induced style drift, where privileged conditioning concentrates the learning signal on style tokens such as Therefore and Wait.
    • Contrastive hints from correct and incorrect answers cancel style components and concentrate the signal on task tokens such as mathematical content.
    • On Qwen3-8B, it achieves 90.8 percent on AMC23, 77.5 percent on AIME24, and 69.7 percent on AIME25, outperforming GRPO and OPSD variants.
    • It addresses the training instability and response-length contraction problems of prior OPSD methods, including OPSD, SDPO, SRPO, and RLSD.
    • The contrastive principle is general, so it can be plugged into existing OPSD methods and extended to cross-model distillation.
    • K-marginalization and two-path loss aggregation are key contributors to preserving performance.
  4. 396Machine Learning

    Breaking Entropy Bounds: Accelerating RL Training via MTP with Rejection Sampling

    • We found a clear negative linear relationship between MTP acceptance rate and policy entropy: as entropy rises, acceptance rate falls linearly.
    • We mathematically and empirically show that probabilistic rejection sampling is far more robust to entropy variation than greedy target-only sampling.
    • Instead of conventional CE/KL losses, we propose an end-to-end TV loss that directly optimizes rejection-sampling acceptance rate, improving it by about 10 percentage points.
    • A light MTP pretraining phase before RL is sufficient to keep acceptance rates stable throughout RL, eliminating the need for online MTP co-training.
    • Across mathematical reasoning, code generation, and agentic tasks, it reaches up to 95% acceptance and an additional 25% increase in reasoning throughput.
    • In asynchronous RL pipelines for Qwen3.5/3.6/3.7, it achieves up to 1.8x end-to-end acceleration.
  5. 395Robotics

    Efficient-WAM: A 1B-Parameter World-Action Model with Low-Cost Future Imagination

    • From WAN-2.2-5B, the authors built a 0.8B compact video expert through structural pruning and knowledge distillation, then combined it with a 0.2B action expert and MoT.
    • By lowering the future prediction resolution, they reduced the token count from 240 to 60 and cut latency further from 430 ms to 377 ms.
    • Asymmetric denoising with 2 video steps and 10 action steps achieved 139 ms latency with less than 1 percentage point of performance loss.
    • It achieved an 86.7 percent average success rate in RoboTwin 2.0 simulation and 66.25 percent success on the real Astribot S1 robot.
    • On a consumer RTX 4090, it achieved 98 ms per chunk, which is 32x faster than Motus at 3215 ms and better than pi0.5 at 113 ms.
    • The design principle of action-centric future imagination is that the policy needs only structural dynamics cues, not photo-like images.
  6. 394Computer Vision

    ABot-Earth 0.5: Generative 3D Earth Model

    • It is the first large generative model to use 3D Gaussian Splatting (3DGS) directly and synthesize 3D scenes from satellite images alone.
    • It generates scenes in less than 10 minutes per km2, which is dramatically more efficient than photogrammetry pipelines that take months or years.
    • It combines satellite, aerial, and urban data sources, and it uses the ABot-3DGS reconstruction engine to build high-quality training data.
    • Its native multi-LOD hierarchy streams trillions of Gaussian primitives in real time, from globe level down to street level on web maps.
    • It covers 300 cities across 190 countries and scores better than Google Earth on aesthetics, although its precise geometry and texture are still weaker.
    • It offers an editable platform through a hybrid approach that combines high-quality landmark reconstruction with synthesized backgrounds.
  7. 393Machine Learning

    Rethinking the Divergence Regularization in LLM RL

    • It replaces DPPO's hard mask with an advantage-weighted l2_2 regularization term that guarantees smooth gradients.
    • It preserves the geometry of the binary-TV trust region, combining divergence-based stability with SPO-style smoothness.
    • Inside the boundary, it keeps the policy gradient, and beyond the boundary it provides corrective gradients that pull the policy toward the behavior policy.
    • The method was cross-validated on Qwen3-4B and Qwen3-30B-A3B, a MoE model, under BF16 and FP8 settings, and it consistently outperformed GRPO, DPPO, and SPO.
    • An ablation confirmed that absolute advantage weighting by |A_t| stabilizes the trust-region boundary independently of the reward scale.
    • Compared with other divergence regularizers such as KL, TV, and chi2, DRPO performs better, which suggests that gradient shape matters more than the exact form of the objective.
  8. 392LLMs / NLP

    Toward Generalist Autonomous Research via Hypothesis-Tree Refinement

    • Autonomous Optimization, or AO, is defined as a task in which an initial output is improved through repeated experiments without step-by-step human supervision.
    • The hypothesis tree implements cumulative research state by binding each node to a hypothesis, a version of the output, experimental evidence, and refined insight.
    • It separates the coordinator, which handles the global strategy, from the executor, which runs individual experiments in isolated worktrees.
    • Across six real research tasks, including model training, harness work, and data synthesis, it reports more than 2.5x average relative gains over Codex and Claude Code.
    • On MLE-Bench Lite, it achieves 86.36 percent Any Medal with GPT-5.5, and ablations confirm that HTR and insight propagation are key.
    • It demonstrates generalization by transferring the BrowseComp optimization harness to a previously unseen search-agent task.
  9. 391LLMs / NLP

    End-to-End Context Compression at Scale

    • It trains a 0.6B encoder and a 4B decoder based on Qwen3-4B on more than 350B tokens at compression ratios of 1:4, 1:8, and 1:16.
    • A large architecture search optimizes the encoder-decoder design, including pooling, adapter structure, and training stage design.
    • It achieves 8.8x faster TTFT on RULER 4K and 5.2x faster TTFT on LongBench 64K while keeping accuracy ahead.
    • It proposes an agentic harness in which the agent reads the full compressed context at once and uses the EXPAND tool to open only the chunks it needs.
    • It shows near-linear memory scaling up to 1M tokens and is compatible with standard inference engines such as vLLM and SGLang.
  10. 390Machine Learning

    ICA Lens: Interpreting Language Models Without Training Another Dictionary

    • With GPU-parallel FastICA, row normalization, and a p95-LIM convergence criterion, it increases accepted layers in GPT-2 Small by 400 percent and reduces iterations by 21.5 percent.
    • ICA directions have significantly higher non-Gaussianity than random projections, and deeper layers show increasing context dependence, confirming the expected pattern of effective receptive field growth.
    • It is competitive with open SAE models on SAEBench Sparse Probing, and it outperforms SAE under small to medium budgets on Targeted Probe Perturbation.
    • ICA components capture a wide range of linguistic structures, including lexical form, local syntax, discourse context, semantic ambiguity, and long-range repetition.
    • It proposes ICA as a complementary first lens rather than a replacement for SAE and positions it as a cost-effective exploratory tool.
  11. 389Agents

    SemaClaw: A Step Towards General-Purpose Personal AI Agents through Harness Engineering

    • The paper formalizes a paradigm shift in AI engineering from prompt and context engineering to harness engineering. As model capabilities converge, the harness layer becomes the main site of architectural differentiation.
    • DAG Teams proposes a two-phase hybrid orchestration approach in which the LLM dynamically generates a task graph (DAG) and a deterministic scheduler executes it, achieving both flexibility and execution traceability.
    • PermissionBridge is a behavioral safety system that performs runtime authorization checkpoints before high-risk actions such as file edits, external API calls, and code execution. It is a native runtime primitive, not a tool-level wrapper.
    • We introduce a hierarchical memory architecture for three-tier context management, consisting of compressed working memory, retrieval-based external memory, and SOUL.md anchor persona partitions.
    • Agentic Wiki externalizes task-derived knowledge into a Markdown-file-based user-owned knowledge base, creating a personal knowledge infrastructure that future agent sessions can retrieve and use.
    • In LangChain experiments, keeping the model fixed and improving only the harness increased task completion from 52.8% to 66.5%, a gain of 13.7 percentage points, showing that harness design is a major determinant of agent performance.
  12. 388Robotics

    MotionWAM: Towards Foundation World Action Models for Real-Time Humanoid Loco-Manipulation

    • It uses intermediate denoising features from a video DiT as policy conditioning, which makes real-time execution possible without generating full videos.
    • Instead of splitting the upper and lower body, it controls the whole body in a single latent space using a unified motion latent variable.
    • Its three-stage training pipeline consists of 2,136 hours of egocentric video pretraining, cross-embodiment action post-training, and whole-body fine-tuning.
    • On the Unitree G1, it achieves a 76.1 percent average success rate across 9 tasks, which is more than 32 percentage points above the strongest VLA baseline at 43.9 percent.
    • It enables task-driven foot interaction, such as kicking a ball or pressing a pedal, which split policies cannot perform.
    • It runs in real time at 4.9 Hz on an NVIDIA A100, about seven times faster than Cosmos Policy at 0.7 Hz.
  13. 387Machine Learning

    Test-Time Gradient Guidance of Flow Policies in Reinforcement Learning

    • It proposes QGF, or Q-Guided Flow, an algorithm that performs policy optimization only at test time.
    • A single Euler-step approximation uses the critic gradient of the clean action during denoising, so backpropagation through time is not needed.
    • It avoids the instability of training-time actor-critic methods and scales favorably as model size increases.
    • It achieves better performance than Best-of-N with far fewer FLOPs.
    • It shows consistent gains over existing methods on difficult goal-conditioned RL tasks.
    • When it uses a QAM critic, it extracts policies better than QAM itself.
  14. 386Robotics

    Dream-Tac: A Unified Tactile World Action Model for Contact-Rich Robot Manipulation

    • It is the first unified Tactile World Action Model that jointly predicts vision and touch.
    • Contact-gated fusion is a gate mechanism that emphasizes tactile signals only when the amount of touch change is large.
    • A contact-aware attention bias controls cross-modal interaction among vision, touch, and action.
    • FlashAttention-based gate optimization speeds training by 2.94x, and diffusion-step caching speeds inference by 1.8x.
    • It improves average accuracy by 31.7% across six contact-intensive tasks and exceeds Cosmos Policy by 31.6%.
    • It is robust under out-of-distribution changes in table height, space, object identity, and background.
  15. 385Robotics

    MemoryVLA++: Temporal Modeling via Memory and Imagination in Vision-Language-Action Models

    • We introduce a cognition-inspired full-temporal model that combines working memory, episodic memory, and future imagination through a world model.
    • The Perceptual-Cognitive Memory Bank stores low-level details and high-level semantics together, and updates memory when redundancy is detected.
    • A latent-space world model imagines future states through partial denoising only, without requiring pixel-level prediction.
    • We achieve 98.4% on Libero and 74.0% on SimplerEnv, with real-robot gains of +9% for general capability, +26% for memory, and +28% for imagination.
    • It is especially strong on long-horizon tasks, with 4.29 on Calvin and 44.4% on Mikasa-Robo.
    • It is ready for real-time deployment, with 66.4 Hz inference on an RTX 4090.
  16. 384Robotics

    OMG: Omni-Modal Motion Generation for Generalist Humanoid Control

    • A hierarchical structure with a motion-generation brain and a motion-tracking cerebellum generalizes whole-body humanoid control.
    • OMG-Data is a 1,174.66-hour omni-modal humanoid motion corpus containing language, audio, and human motion.
    • OMG-DiT is a diffusion transformer conditioned on language, audio, and human references, and it can be extended to new modalities.
    • It achieves an FID of 6.03 on text-to-motion with OMG-XL, which is a large improvement over prior methods.
    • It supports zero-shot compositionality, so unseen combinations of language and audio can be combined at inference time.
    • Performance improves consistently as the model scales from B to L to XL.
  17. 383Computer Vision

    Next Forcing: Causal World Modeling with Multi-Chunk Prediction

    • We solve the myopic supervision problem in autoregressive video generation with multi-chunk prediction (MCP).
    • A causal MCP chain lets near-future predictions inform far-future predictions and provides dense supervision to the main model.
    • We achieve SOTA on RoboTwin, with 94.1% on Clean and 93.5% on Random.
    • At 50 fps, it delivers a 93.1% relative improvement over LingBot-VA and a 2.3x training speedup.
    • General video pretraining also reduces FVD by more than 50%, demonstrating generality beyond robot-specific data.
    • Keeping the MCP module at inference time doubles inference speed while preserving accuracy.
  18. 382Computer Vision

    Kwai Keye-VL-2.0 Technical Report

    • It is a 30B MoE model with 3B active parameters, designed as an efficiently deployable multimodal foundation model.
    • It applies DeepSeek Sparse Attention to a GQA-based architecture for the first time, enabling 256K lossless context.
    • Cross-Modal MOPD integrates video, code, tools, and search into a single MoE backbone.
    • Context-RL and Video-RL reduce visual hallucination and stabilize long-horizon decision making.
    • It achieves state-of-the-art results on TimeLens, with 58.5 mIoU on ActivityNet, and on LongVideoBench, with 74.1.
    • It is also strong on agent benchmarks such as LiveCodeBench v6 at 64.2 and OJBench at 71.5.
  19. 381AI / General

    Trajectory-Refined Distillation

    • It is the first to formalize the prefix-failure problem in OPD, showing that token-level improvements cannot solve it at the root.
    • TRD performs distillation after refining trajectories within the on-policy support region through trajectory-level refinement.
    • It can be applied to both OPD and OPSD self-distillation and yields consistent gains across the Qwen3 model family.
    • On AMOBench, Qwen3-8B shows roughly 50 percent relative improvement in Pass@16, and the refined trajectories are compressed by about 9 times.
    • This trajectory-level approach outperforms prior token-level loss-improvement methods such as clipping, reweighting, and top-K selection.
  20. 380LLMs / NLP

    Self-Harness: Harnesses That Improve Themselves

    • It proposes Self-Harness, a paradigm in which the agent improves its own harness through weakness mining, harness proposal, and proposal validation.
    • Across three models, MiniMax M2.5, Qwen3.5-35B-A3B, and GLM-5, the held-out pass rates improve from 40.5% to 61.9%, from 23.8% to 38.1%, and from 42.9% to 57.1%, respectively.
    • Different harness changes are produced for different models, so the updates are model-specific rather than generic instruction additions.
    • A regression-test-based acceptance rule prevents overfitting, and the edits remain small and auditable.
    • The work is directly related to existing harness systems such as SemaClaw and OpenClaw.
    • It is a meaningful step forward in the self-improvement research line for agents.
  21. 379Computer Vision

    MilliVid: Hierarchical Latents for Long-Range Consistency in Video Generation

    • It uses a hierarchical autoencoder design with different token counts per frame at different levels.
    • The coarsest level, with 4 tokens per frame, captures scene structure and object permanence.
    • Coarse-to-fine rollout maximizes temporal coverage within a fixed sequence length.
    • Learned hierarchical tokenization provides better compression quality than simple downsampling.
    • It trains the model to predict far-future frames, encouraging long-range context dependence.
    • It shows a significant improvement in consistency over FramePack on long Minecraft videos.
  22. 378AI / General

    OpenSkill: Open-World Self-Evolution for LLM Agents

    • Open-world self-evolution is defined as the process of building skills and verification signals at the same time from task prompts alone.
    • In the open world, grounding knowledge and verification anchors are acquired independently.
    • Self-built virtual tasks are used for skill refinement, with no target supervision at all.
    • On SkillsBench, it improves by 8.9 percent over the previous strongest baseline.
    • The skills transfer across models, so the same effect applies even to weaker models.
    • The self-built verifier covers 88.9 percent of the intent represented in the ground truth.
  23. 377Software Engineering

    SWE-Explore: Benchmarking How Coding Agents Explore Repositories

    • A new benchmark that evaluates repository exploration independently from patch generation.
    • It derives trajectory-grounded, line-level ground truth from successful agent trajectories.
    • It covers diverse coding settings with 848 issues, 10 languages, and 203 repositories.
    • Agent exploration forms a clear top tier compared with classical retrieval.
    • File-level hit rates are strong, but core line recall remains only 0.14 to 0.19, making it the bottleneck.
    • Missing key context is more damaging to patch success than noisy context.
  24. 376AI / General

    ConMem: Structured Memory-Guided Adaptation in Training-Free Multi-Agent Systems

    • It distills past trajectories into typed signed memory cards to create reusable strategic units.
    • It organizes the cards as typed graphs with supports, satisfies, conflicts, and constrains relations.
    • It uses needs-aware retrieval to search for cards that match the current task.
    • It resolves conflicts and recovers dependencies through the relation graph to produce consistent guidance.
    • Context-budget control prunes more than 50% of candidate cards and reduces planning overhead by 80%.
    • It is training-free and does not require changes to the host model weights or orchestration.
  25. 375LLMs / NLP

    Your UnEmbedding Matrix is Secretly a Feature Lens for Text Embeddings

    • It discovers representation collapse in LLM embeddings, where they align with high-frequency meaningless tokens.
    • It identifies the edge-spectrum subspace of the unembedding matrix as the cause.
    • EmbedFilter removes that subspace with a simple linear transform and does not require additional training.
    • It improves MTEB performance by up to 14.1% and works across different LLM backbones.
    • It also saves storage and speeds up retrieval through distance-preserving dimensionality reduction.
    • It outperforms existing correction methods such as BERT-whitening in unsupervised settings.
  26. 374Robotics

    AHA-WAM:Asynchronous Horizon-Adaptive World-Action Modeling with Observation-Guided Context Routing

    • The design separates Video DiT as a low-frequency planner and Action DiT as a high-frequency executor through an asynchronous decomposition.
    • Rolling KV memory preserves the planner's temporal context over time.
    • OVCR dynamically routes and updates the planner context based on the latest observations.
    • Horizon-adaptive offset training learns arbitrary phase relationships between planner and executor.
    • The method reaches SOTA-level performance, with 92.80 percent on RoboTwin and 78.3 percent success in the real world.
    • It achieves control frequencies up to 56.9 Hz, which is a 10.82x speedup over Fast-WAM.
  27. 373Machine Learning

    FlashMemory-DeepSeek-V4: Lightning Index Ultra-Long Context via Lookahead Sparse Attention

    • LSA is a paradigm that predicts future context demand and loads only the necessary KV chunks onto the GPU.
    • It decouples the indexer from the backbone, making it possible to train on a single H20 GPU in one hour.
    • It replaces fixed Top-k with dynamic chunk recall based on a sigmoid threshold.
    • It improves accuracy by 0.6% while using only 13.5% KV cache on average.
    • At 500K length, it cuts memory use by 90% and still improves accuracy by 1.9%.
    • It has a clear limitation: performance drops sharply on the dense-search MRCR benchmark, from 76% to 48%.
  28. 372AI / General

    SpatialWorld: Benchmarking Interactive Spatial Reasoning of Multimodal Agents in Real-World Tasks

    • Design a simulator-agnostic evaluation protocol that integrates eight simulators.
    • Build a dataset of 760 tasks across six domains, including household chores, travel, social cooperation, and digital games.
    • Provide an MLLM-native interface with first-person vision-only observations and text-based actions.
    • Space reasoning remains a major challenge, with GPT-5 at 17.4% and Qwen-3.5 at 14.1%.
    • Domain-specific leaders differ: GPT-5 leads on household chores, while Gemini-3.1-Pro leads on games.
    • It finds a mismatch between task success rate and execution efficiency.
  29. 371Computer Vision

    Latent Spatial Memory for Video World Models

    • We build 3D spatial memory directly in latent space, eliminating the cost of round-tripping through pixel space.
    • Depth-guided back-projection loads latent tokens into 3D world space.
    • Occlusion-aware latent-resolution projection is used to obtain the target view.
    • We exclude dynamic objects and the sky from memory updates to improve long-term stability.
    • Compared with an RGB cache, the system runs 10.57 times faster end to end and uses 55 times less GPU memory.
    • Two-stage training enables stable convergence of the side branch and LoRA.
  30. 370Robotics

    Robots Need More than VLA and World Models

    • It redefines VLA models as one layer in the physical intelligence stack and argues that upstream and downstream grounding mechanisms are essential.
    • It advocates a shift to grounding-centered pipelines that convert unstructured physical experience into robot-usable supervision.
    • It proposes four essential interfaces: a physical data engine, embodiment retargeting, physics-based world models, and task-conditioned reward grounding.
    • It presents a vision for self-improving systems that use success, failure, and human correction as structured supervision in the deployment loop.
    • It revisits state-of-the-art research in robot-native data, video-based methods, simulation, and world models from the perspective of grounding bottlenecks.

From research to product use

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

View technology