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.
- 610Computer Vision
MonkeyOCRv2: A Visual-Text Foundation Model for Document AI
- It builds MonkeyDoc v2, the largest document image pretraining corpus, with 113 million images across 17 languages.
- It jointly learns image-to-text generation and pixel-level document reconstruction to achieve character-level visual recognition.
- It improves CRNN recognition accuracy from 58.7 percent to 67.3 percent, and the 110M UniMERNet-T outperforms the 325M UniMERNet-B.
- A 0.7B document parsing model achieves open-source SOTA on MDPBench, beating the previous best, the 3B dots.mocr, by 2.8 percent.
- With the vision encoder frozen, it achieves stronger document understanding than large VLMs such as Qwen3-VL-235B and GPT-5.2.
- It shows consistent gains over CLIP, DINO, and SAM across 8 benchmarks.
- 609Robotics
From World Action Models to Embodied Brains: A Roadmap for Open-World Physical Intelligence
- It defines WAMs as action-conditioned predictive models and classifies them as models that explicitly predict the results of interventions.
- It identifies three structural limitations: the model-representation gap, the objective-standardization gap, and the ecosystem-system gap.
- An embodied brain is the central model that integrates physical observations and compares interventions to output intended state transitions.
- A physical harness converts the brain's outputs into execution tools and controllers, validates them, and records traces.
- Shared contracts make heterogeneous data, tasks, and components mutually comparable.
- Closed-loop post-training turns verified interactions into reusable experience.
- 608Computer Vision
Read It Back: Pretrained MLLMs Are Zero-Shot Reward Models for Text-to-Image Generation
- We use image-conditioned prompt log-likelihood from an MLLM as the reward, which removes the need for preference labels and fine-tuning.
- Self-SpectraReward is a closed-loop self-improvement scheme in which the understanding branch of a unified model (UMM) evaluates its own generation branch.
- We validate it at scale with 9 MLLM backbones from 4B to 235B, 4 model families, 3 RL algorithms, and 2 diffusion models.
- A larger reward MLLM is not always better; reward-policy alignment matters more than reward-model size.
- Self-SpectraReward outperforms a 235B external model, demonstrating the importance of policy-reward alignment.
- It consistently outperforms prior MLLM-derived reward methods on five OOD text-to-image benchmarks.
- 607LLMs / NLP
Metacognition in LLMs: Foundations, Progress, and Opportunities
- It defines metacognition as a loop of monitoring, meaning state evaluation, and control, meaning strategy adjustment, and uses that lens to classify LLM research.
- It organizes a range of metacognitive measurement methods, including psychology-based, neurofeedback-based, confidence-based, and interpretability-based approaches.
- The literature shows that metacognition helps reduce hallucination, improve reliability, and improve human-AI collaboration.
- It analyzes metacognitive applications in reasoning models, agents, multi-agent systems, memory, retrieval, and tool use.
- It systematically studies the effects of model size, post-training, and sampling temperature on metacognitive ability.
- It identifies gaps in metacognitive evaluation and proposes future research directions, including domain generality and architecture design.
- 606Research
Qwen-Music Technical Report
- It compresses an entire song into a 25 Hz single-codebook Music Semantic Token so the LLM has room to predict the sequence.
- The Melody-CoT mechanism plans melody as an explicit intermediate representation before token generation, which improves musicality and structural consistency.
- Qwen-Music-Render combines a semantic-conditioned DiT, Spec-VAE, and Band-Mode Refiner to synthesize 48 kHz stereo audio.
- It is trained on more than 5 million hours of multilingual music data with a curriculum by quality level and multi-stage post-training from SFT to DPO to GSPO.
- In blind tests by expert evaluators, it achieves a 66.7% win rate against MiniMax 2.6 and a 58.3% win rate against Mureka V8.
- It reaches state of the art on 13 of 16 objective metrics, including SongBench, SongEval, and AudioBox-Aesthetic.
- 605Machine Learning
Proxy Exploration and Reusable Guidance: A Modular LLM Post-Training Paradigm via Proxy-Guided Update Signals
- By separating exploration, meaning proxy, and alignment, meaning primary, it restructures post-training into a modular, asynchronous, and reusable pipeline.
- It supports weak-to-strong improvement by transferring relative improvement signals rather than the absolute distribution of the proxy.
- Exploration signals from a small proxy such as Qwen3-1.7B improve the larger primary model in a controllable way.
- Compared with GRPO, OPD-based distribution alignment converges within 70 steps, which demonstrates exploration efficiency.
- The transfer strength can be controlled with a scaling factor, which gives robust performance across different settings.
- Caching, reuse, and cross-model transfer of exploration signals greatly improve cost efficiency.
- 604Computer Vision
ABot-3DWorld 0: A Universal World Model to Explore Any 3D Space
- SGP, a single representation combining panorama and point cloud, processes all input modalities in a unified way.
- We improve 3D consistency in a 14B VACE-based panorama video generator through 3DRL post-training.
- Rich inputs, including multi-view and video, are handled through a strict geometric pipeline to minimize hallucination.
- An iterative FLUX-based repair module resolves panorama resolution limits and view mismatches.
- The ABot-3DGS data engine generates fully aligned training data of RGB, point maps, and poses.
- It supports indoor, outdoor, and aerial domains in a single pipeline and can be linked with mapped POIs.
- 603Robotics
Xiaomi-Robotics-U0: Unified Embodied Synthesis with World Foundation Model
- It trains five generative tasks, image generation, editing, embodied scene generation, transfer, and video generation, in a single 38B-parameter autoregressive framework.
- A structured control format separates workspace, background, foreground, target, and lighting as independent control dimensions to preserve multi-view consistency.
- GPT-Image-2.0 ranks first in human evaluation for embodied scene generation and transfer, and first in World Arena embodied video generation.
- Synthetic data generated by the model improves the OOD success rate of the π0.5 robot policy from 36.9% to 63.2%, a 26.3-point gain.
- Sequential world modeling turns static scene generation into a scalable trajectory generation engine.
- It releases code and checkpoints so the model can serve as an embodied-intelligence data engine.
- 602Computer Vision
The Count Is There, but Misaligned: Understanding and Correcting Counting Failures in VLMs
- It trains three probes over VLM internal activations to predict ground-truth count, output count, and whether an error is present, and the probes reliably predict mistakes.
- SVCCA shows that the correct-count probe and the output-count probe share a partial subspace, but the readout is misaligned, which is a structural cause of error.
- Causal steering confirms the cause, because strengthening the count direction improves counting performance while random directions hurt it.
- Detector-guided self-correction applies selective reprompting only when an error is predicted, which improves accuracy by up to 15.6 absolute points.
- It improves performance through inference-time intervention alone, so the method requires no parameter update and is practical to deploy.
- There is a strong positive correlation, with rho equal to 0.803, between probe F1 and correction gains, which means that internal error-signal quality determines correction effectiveness.
- 601Robotics
B-spline Policy: Accelerating Manipulation Policies via B-spline Action Representations
- It replaces discrete action chunking with continuous B-spline curves to accelerate execution through temporal rescaling.
- Inference-time segment alignment ensures smooth transitions between adjacent B-spline segments, which is essential for high-speed execution.
- On Table Cleaning, 4x speed reduces completion time by 50%, from 23.57 seconds to 11.80 seconds, while maintaining success rate at 13 out of 20 versus 14 out of 20.
- It integrates as a drop-in replacement for both Diffusion Policy and ACT backbones, requiring minimal pipeline changes.
- On PushT simulation, 4x speed improves the score from 0.59 to 0.73 and reduces time from 7.19 seconds to 2.87 seconds.
- It automatically allocates control granularity to match task stages, from fast reaching to precise grasping.
- 600AI / General
Long-Horizon-Terminal-Bench: Testing the Limits of Agents on Long-Horizon Terminal Tasks with Dense Reward-Based Grading
- It covers 46 long-horizon terminal tasks across 9 categories, including experimental reproduction, software engineering, multimodal analysis, games, and scientific computation.
- It uses subtask-based dense rewards that provide partial scores instead of a binary pass or fail signal, making intermediate progress visible.
- The benchmark averages 9.9 million tokens, 231 episodes, and 85.3 minutes per task, making it far more demanding than Terminal-Bench or SWE-Bench.
- Even the strongest model, GPT-5.5, reaches only 15.2 percent pass@1 at R ≥ 0.95, while the average pass@1 is just 4.3 percent, leaving substantial room for improvement.
- The main failure mode is partial progress followed by timeouts and early false finishes, with weak self-verification emerging as the key bottleneck.
- Dense rewards are essential for exposing false-finish patterns, whereas binary evaluation misses them.
- 599Computer Vision
Glob3R: Global Structure-from-Motion with 3D Foundation Models
- It uses a frozen 3D foundation model, Pi3X, plus a lightweight dense matching head to turn feed-forward prediction into an optimizable geometric constraint.
- A keyframe-based sliding-window strategy propagates tracks and relative poses across windows, which overcomes chunk-level limits.
- On KITTI, it achieves a mean RMSE of 13.21 m, which is a 10 to 50 percent improvement over recent methods such as Scal3R at 14.55 and LoGeR at 18.65.
- On ETH3D, it achieves R@1 of 91.58 and T@1 of 73.27, which substantially improves rotation and translation accuracy over the latest learning-based SfM method, AMB3R.
- It improves PSNR by 2 to 3 dB in NeRF and neural rendering, which demonstrates the practical value of refined poses.
- Global motion averaging and bundle adjustment resolve scale mismatch and recover dense geometry.
- 598Machine Learning
TSRouter: Dynamic Modality-Model Selection for Time Series Reasoning
- It is the first modality plus model co-routing framework that uses the complementarity of LLMs for numerical accuracy and VLMs for global patterns.
- It models complex interactions with a heterogeneous graph over task, query, modality, and model and uses a GNN.
- On four time-series reasoning tasks, it achieves 16% to 46% relative improvements and builds a Pareto frontier with cost-aware optimization.
- It greatly outperforms the best baseline even when using only 10% of the training data, showing data efficiency.
- GPT-5 is used for node profiling and initialization from pretrained embeddings, enabling zero-shot generalization to new models and tasks.
- The user-defined alpha parameter allows real-time control of the performance-cost tradeoff.
- 597Research
A complete ultrametric on von Neumann's incomplete tensor products
- We define a convergence-index-based pseudo-ultrametric d on the equivalence classes Gamma of infinite tensor products, and prove the strong triangle inequality and completeness.
- We define a gauge-invariant variant d~, which is insensitive to topological changes and consistent with von Neumann weak equivalence.
- We prove that the product of any unitary U with 1 not in sigma(U) moves every equivalence class to the maximum distance 1.
- We interpret d~ as a decoherence exponent: when monitoring N environmental degrees of freedom, the branching rate decays as exp(-N d~).
- In the Everett many-worlds model, the universe is an infinite qubit tensor product, worlds are sectors, and time is a discrete unitary step.
- The hierarchical structure of the ultrametric space corresponds exactly to the leaf space of the branching tree.
- 596Computer Vision
PanoWorld: Real-World Panoramic Generation
- It uses the rotational equivariance of panoramic ERP to treat rotation as a geometric transform and model only translation explicitly.
- DPRC uses dense conditioning on panorama rays for accurate motion control, and GMA uses geometry-aware memory augmentation to maintain scene persistence.
- The World360 dataset contains 70K real UAV clips and 50K AirSim360 simulation clips, including multi-altitude flight trajectories.
- Compared with Matrix-3D, it improves FID from 27.64 to 16.93 at 720p, and it improves PSNR trajectory accuracy by 2 to 4 points.
- Real-time generation with causal forcing produces 161 frames in 8 seconds on a single H20 GPU, versus about 4 minutes and 48 seconds previously.
- A three-stage training pipeline progressively optimizes modeling, memory, and control.
- 595Computer Vision
Scalable Visual Pretraining for Language Intelligence
- The paper proposes a VP framework that pretrains directly from raw visual patches, without parsing documents into text, through next-latent prediction.
- It shows consistent gains over TP across four backbones, with up to +3.22 on GPQA Diamond and +2.1 on MMLU-Pro.
- It reaches equal or better performance with only 25 percent of the token budget, which shows that visual representations are more compression-efficient than text.
- The gains are largest on visually dense documents such as figures, equations, and tables, which indicates recovery of information that text conversion would lose.
- VP is effective not only for multimodal models but also for language-only models, which shows that it is architecture-agnostic.
- A frozen vision encoder plus a trainable projection layer are enough to integrate the visual stream into an autoregressive backbone.
- 594Machine Learning
Mach-Mind-4-Flash Technical Report
- A 35B MoE model with 3B active parameters reaches 100B-plus-level performance through post-training alone, without scaling pretraining compute.
- MOPD, or Multi-Teacher On-Policy Distillation, trains domain-specific RL experts independently and then merges them with routed reverse-KL to remove the seesaw effect of mixed-reward RL.
- HMPO is a single-stage token-efficient optimization method that compresses reasoning chains by 19 to 46 percent while keeping accuracy loss below 0.7 percentage points.
- It reports AIME'26 at 92.70, BFCL-v4 at 75.80, and ClawBench at 84.20, showing that 3B active parameters can compete with 1T-scale models.
- SonicMoE GEMM kernels and segmented shared-expert fusion speed training up by 17 percent end to end.
- It also reshapes the Pareto frontier for token efficiency by sharply reducing token usage at similar accuracy.
- 593Computer Vision
Video Generation Models are General-Purpose Vision Learners
- It proposes video diffusion models as a pretraining paradigm for general-purpose vision recognition, serving a catalytic role for vision analogous to next-token prediction in NLP.
- It converts iterative denoising into a single forward pass that can control depth, normal, segmentation, pose, keypoints, and more through text instructions.
- It matches or exceeds specialized models such as D4RT and VGGT-Ω while requiring 7x to 500x less training data.
- It experimentally shows that diffusion-based pretraining outperforms prior pretraining methods such as V-JEPA and VideoMAE V2.
- Training on synthetic human videos alone still yields zero-shot generalization to real videos and OOD objects, evidence that world models are internalized.
- Without dedicated heads or losses, the unified backbone, head, and loss structure lets tasks expand simply by changing the data format.
- 592AI Agents
Atomic Task Graph: A Unified Framework for Agentic Planning and Execution
- The core idea is to represent agent task solving as a DAG composed of atomic tool-use nodes and input-output dependency edges.
- Interface-preserving recursive graph compilation recursively decomposes coarse tasks down to atomic units while preserving the parent node's input-output interface, making graph evolution traceable.
- Dependency-aware execution runs independent branches in parallel, shortening the average number of steps versus ReAct from 31.42 to 18.36 on ALFWorld and from 47.35 to 29.72 on ScienceWorld.
- Minimal necessary subgraph repair preserves verified regions and repairs only the smallest affected subgraph when errors occur, and removing the repair step lowers Mistral-7B's ALFWorld score by 7.72 points.
- A pre-execution thought experiment uses lightweight verification before execution to detect risky plans in advance, finding 24.6% to 27.4% risky-plan detection with over 74% precision.
- The hallucinated action rate is 12.14%, a 71.7% relative reduction versus ReAct's 42.86%, and the average success rate across three benchmarks rises from 25.51 to 56.10 with Mistral-7B.
- 591Computer Vision
Understanding and Mitigating the Video-Action Generalization Gap via Temporal Ratio
- The VAG gap is the phenomenon in which the compositional prior of video foundation models is lost after robot behavior fine-tuning, and we define and analyze it systematically.
- Temporal Ratio (TR) measures how much the action head's attention focuses on future latent rollouts compared with the current frame, and it predicts compositional generalization ability.
- TR changes dynamically across task phases: it rises during planning and falls during precise manipulation, which is the natural attention pattern.
- TR-Adaptive Guidance is an inference-time method that adaptively amplifies compositional conditioning signals during planning phases.
- On the LIBERO benchmark, it improves average OOD success by more than 5x over the previous VAM baseline, from about 10% to 59.4% with guidance.
- It also achieves an average of 83.3% on real bimanual robot tasks in YAM, far above pi0 at 36.7% and pi0.5 at 55.0%.
- 590AI / General
Towards Mechanistically Understanding Why Memorized Knowledge Fails to Generalize in Large Language Model Finetuning
- It formalizes the Knowing-Using Gap, the phenomenon in which memorization is nearly perfect but generalization, especially multi-step reasoning, lags far behind.
- It introduces self-patching, a causal diagnostic tool that recovers generalization failures immediately by moving a representation from one layer to another.
- It proposes the knowledge-circuit misalignment hypothesis, where memorized representations exist in early and late layers but are not routed into the middle reasoning layers, causing failure.
- The paper validates this across six models, from Qwen-2.5 1.5B to 7B and LLaMA-3.2 1B to 8B, and across two domains, biomedical and academic.
- A fixed heuristic using only two layer-pair settings, 0.8L to 0.5L and 0.1L to 0.5L, recovers 58 to 75 percent of the oracle improvement.
- Self-patching is far better than CoT prompting or irrelevant patching, which supports the claim that the root cause is structural.
- 589AI / General
Remember When It Matters: Proactive Memory Agent for Long-Horizon Agents
- It defines the concept of behavioral state decay, a failure mode in which information is present in context but still fails to affect behavior.
- It uses a two-stage plug-and-play architecture in which a separate memory agent maintains a structured memory bank and decides whether to intervene selectively.
- On Terminal-Bench 2.0, it improves Sonnet 4.5 from 37.6% to 45.9%, a gain of 8.3 points, and on τ²-Bench from 55.0% to 61.8%, a gain of 6.8 points.
- The +2.4 to +2.5 point improvement also holds for the stronger Opus 4.6 model, so it remains effective even on strong models.
- Catenation experiments show that active intervention outperforms passive memory exposure, always-on injection, advisor models, and Mem0 retrieval.
- An open-weight memory agent trained from Qwen3.5-27B with SFT and GRPO also achieves a +3.5-point transfer gain on Terminal-Bench.
- 588LLMs / NLP
What LLM Forecasters Know but Don't Say: Probing Internal Representations for Calibration and Faithfulness
- Internal probes cut ECE in half, from 0.093 to 0.044, compared with verbalized confidence, greatly improving calibration.
- When CoT evidence is removed, predictions change while the reasoning trace stays the same in 23% of cases, revealing insincerity (rho = 0.22).
- The probe's accuracy at tracking behavioral changes (rho = 0.57) far exceeds CoT (rho = 0.22), and it can detect 84% of the hidden effects with the correct direction.
- Forced-answering experiments confirm that many predicted answers are already decided before reasoning even begins.
- Using the entropy of the pre-reasoning answer distribution, we classify questions into three levels and save 30% to 47% of tokens without accuracy loss.
- Probe-only calibration also works on GLM-4.7-Flash and GLM-4.5-Air, showing that calibration can improve without weight updates.
- 587Machine Learning
Sparse Delta Memory: Scaling the State of Linear RNNs through Sparsity
- Sparse addressing with product-key memory expands the state memory about 4,000 times beyond GDN at the 8B scale.
- With the same FLOPs and the same number of parameters, it achieves better training loss than both GDN and full attention.
- On long-context recall in RULER, it improves from 20.0 percent for GDN to 31.2 percent for SDM at 128k on the 1.4B model, which is an absolute gain of 11.2 percentage points.
- A learned initial state, or learned M0, stores pretrained knowledge and further improves common-knowledge and reasoning tasks.
- At the 8B scale, decoding is 1.49 times slower than GDN but 6 times faster than full attention.
- The read and write distributions change adaptively with capacity: writes become concentrated, while reads become more distributed.
- 586Computer Vision
AnchorPrune: Relevance-Anchored Contextual Expansion for Visual Token Pruning
- Its sequential design first anchors relevance and then expands context, which prioritizes non-redundant query evidence.
- It automatically chooses the anchor size from each token's novelty profile rather than using a fixed ratio.
- The architecture-aware design applies to both CLIP-aligned and unaligned models, as well as image and video VLMs.
- On LLaVA-NeXT-7B, it retains 97.6 percent of full performance with only 160 of 2,880 tokens, or 5.6 percent.
- At extreme compression with 32 tokens, it outperforms prior relevance-diversity integrated methods by 3.7 to 5.7 percentage points.
- It is a lightweight framework that requires no training and can be applied directly to existing VLMs without architectural changes.
- 585Robotics
Native Video-Action Pretraining for Generalizable Robot Control
- Semantic visual-action tokenizer SemVAE aligns visual representations and actions in a shared latent space.
- Causal pretraining avoids catastrophic forgetting that appears when applying a bidirectional architecture, and it trains from scratch.
- A Sparse MoE backbone expands model capacity while keeping the active compute per step unchanged.
- Foresight Reasoning asynchronous inference achieves 225 Hz real-time closed-loop control, a 6.5x speedup over the 35 Hz baseline.
- It achieves few-shot generalization with 10 to 15 demos and outperforms π0.5 and LingBot-VA on both simulation and real evaluation.
- Multi-chunk prediction, or MCP, encourages trajectory-level dynamics learning instead of short-term visual continuity.
- 584Robotics
EmbodiedGen V2: An Agentic, Simulation-Ready 3D World Engine for Embodied AI
- It proposes a unified sim-ready representation that combines metric geometry, collision geometry, physical parameters, and affordance annotations in a single asset.
- Its model-agnostic asset pipeline connects TRELLIS, SAM3D, and Hunyuan3D as plugins and automates mesh repair, convex decomposition, and texture baking.
- The task-driven scene graph decomposes a natural-language task into spatial constraints over the robot, background, objects to manipulate, and distractors, then generates physically stable 6-DoF placements.
- Vibe Coding implements a stateful agent-skill harness that turns natural-language commands into physically validated bounded edits and then exports them to the simulator.
- It supports cross-simulator export to MuJoCo, Isaac Sim, Genesis, SAPIEN, and Bullet in USD, MJCF, and URDF formats.
- Online RL validation shows that training VLA policies on the generated environments raises simulation success from 9.7 percent to 79.8 percent and real-robot success from 21.7 percent to 75.0 percent.
- 583Machine Learning
Single-Rollout Asynchronous Optimization for Agentic Reinforcement Learning
- We replace GRPO's group-wise sampling with single-rollout to remove waiting latency and reduce off-policy drift in asynchronous RL.
- Direct double-sided IS uses rollout log-probabilities directly to remove the cost of tracking the old policy.
- skip-observation GAE skips observation tokens and computes advantage between actions in multi-turn agent trajectories.
- We update the value model more frequently than the actor and fine-tune frozen attention to stabilize single-rollout training.
- Deployed in the GLM-5.2 (750B-A40B) RL pipeline, it achieves stable training for about 1,000 steps and consistent gains over GRPO.
- In a simulated online-learning environment, it adapts quickly when reward criteria change, demonstrating robustness to nonstationary environments.
- 582Computer Vision
Infinite Worlds with Versatile Interactions
- It applies an anti-drift training paradigm to causal video generation, enabling more than one hour of uninterrupted generation that is robust to accumulated error.
- A real-time distilled model renders infinite worlds at 60 fps and 720p resolution, including a 1.3B version that can be deployed on a single GPU.
- It offers rich interactions, including combat, archery, spell casting, shooting, and weather changes, with far more action variety than existing world models.
- It integrates an agent harness composed of a Pilot agent for action planning and execution and a Director agent for generating environment content.
- It uses a three-source data engine with an egocentric-video plus game plus Unreal Engine synthetic multi-granularity annotation pipeline.
- It is fully open source, including code and checkpoints, and it is the only system among the compared models, such as Matrix-Game-3.0 and Genie 3, to achieve hour-level infinite generation.
- 581Computer Vision
Scaling Mixture-of-Experts Video Pretraining for Embodied Intelligence
- The MoE, or sparse expert, architecture improves the trade-off between inference efficiency and model capacity relative to dense models.
- The data profiling engine jointly analyzes, filters, and rebalances internet video and robot manipulation, navigation, and egocentric data.
- A multidimensional reward system aligns not only aesthetic quality but also physical rationality and task-completion signals during training.
- A single-stream Diffusion Transformer with Multi-Modal 3D RoPE unifies T2I, T2V, and I2V within one framework.
- QK-Norm and AdaLN-Single modulation stabilize deep transformers, and a cascaded refiner improves quality.
- It is the first large-scale open-source MoE video model for embodied intelligence, and the code and checkpoints are released.
From research to product use
Operating capabilities, pilots, and technologies in development are identified separately.
View technology