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.
- 670LLMs / NLP
SWE-Pruner Pro: The Coder LLM Already Knows What to Prune
- The core claim is that there is no need to recreate pruning signals outside the model, because the backbone already encodes that judgment in its representations when it reads tool outputs.
- As evidence, the authors froze Qwen3-Coder-Next and ran a logistic-regression probe over line-averaged hidden states, reaching an AUC of 0.83 and a best F1 of 0.63 on held-out data.
- The method uses the final-layer hidden states from the prefill stage, and a small head reads them to score tokens and aggregate them into line-level keep or delete decisions.
- Two design choices improve performance: a length-aware embedding that includes the number of output lines, and a balanced focal loss that keeps the keep and delete ratios aligned per sample.
- The result is 39% token savings on SWE-QA-Pro and 30% on Oolong across two open-weight backbones and four multi-turn benchmarks, and with MiMo-V2-Flash it also improves Oolong accuracy by 2.2 points and SWE-Bench Verified solve rate by 3.8 percentage points.
- The extra cost is limited. In a replay setup with the head attached inside the inference engine, it adds only 15.0% wall-clock time over total generation time and requires no separate model call.
- 669Computer Vision
TimeLens2: Generalist Video Temporal Grounding with Multimodal LLMs
- It defines video evidence finding as a problem over a variable-size set of temporal segments rather than a single interval, so it can handle long videos, repeated scenes, first-person video, and question-form requests in one model.
- It solves data quality by stepwise verification instead of labeling everything at once, using candidate proposal, independent re-search, agent agreement, semantic verification, and boundary refinement.
- Its key technique is the temporal Wasserstein reward, which treats the predicted and ground-truth intervals as uniform distributions and computes the exact 1D W1 distance to give dense feedback without explicit matching.
- Overlap-based rewards such as tIoU give zero signal when the predicted interval does not overlap the ground truth at all, while Wasserstein reward distinguishes near misses from far misses in that case.
- Empirically, the fraction of groups with all equal rewards and no learning signal drops from 13.8% to 3.6%, and 75.8% of the groups that were all zero regain a meaningful ranking.
- The practical takeaway is that a much smaller model beats much larger ones, which is strong evidence that making answers temporally grounded and human-checkable works.
- 668Machine Learning
LLM-as-a-Coach: Experiential Learning for Non-Verifiable Tasks
- A single score is an information bottleneck because it cannot distinguish answers that receive the same top score, especially at the upper end.
- The solution is to use the same feedback model as a coach rather than a judge. The coach turns answer evaluation into generalized, reusable advice, or experiential knowledge.
- That advice is given to the teacher model as context and internalized by the policy through on-policy context distillation, which minimizes token-level reverse KL divergence between the teacher and the policy output. At inference time, neither the coach nor the advice context is needed.
- The motivation is illustrated by feedback bandwidth. A 1 to 10 integer score carries 3.3 bits per sample, while a 1024-token piece of advice over a 150,000-word vocabulary theoretically carries 17,600 bits.
- Across two policy families, EL outperformed rubric-based reinforcement learning on held-out and novel benchmarks, whether the feedback model was the policy itself or a commercial API model.
- While RL is prone to reward hacking because it learns to chase reward on the training set, EL is a distribution-matching method that follows the teacher distribution and therefore reduces that failure mode.
- 667Robotics
FM-VLA: Force-based Memory for Vision-Language-Action Models in Contact-Rich Manipulation
- It identifies a problem with contact-rich repetitive tasks: because the screen changes little, visual memory alone cannot track progress.
- It first trains a variational autoencoder on force and torque time series with reconstruction as the objective, then freezes the encoder and uses the latent representation as memory tokens.
- Using force memory alone makes pre-contact motion unstable, so it supplements it with a short record of joint states.
- It achieves an average success rate of 83.3% over three tasks, outperforming pi-zero without memory at 27.8%, TA-VLA with a short force window at 22.2%, and visual-memory pi-MEM at 53.7%.
- Inference latency increases by only 3.3 ms, from 60.7 ms to 64.0 ms, whereas visual memory grows from 100 ms to 190 ms depending on the number of frames.
- Eight memory tokens were optimal, while increasing the count to 32 exceeded the token budget of the pretrained action module and hurt performance.
- 666Robotics
Patch Policy: Efficient Embodied Control via Dense Visual Representations
- The core claim is simple: dense visual features, not a giant generative model, are what visual motor policies really need.
- The method is a minimal extension. It concatenates all patch tokens from a frozen ViT and uses a block causal mask that lets tokens within a frame see each other while blocking information from the future across frames.
- The policy head can be swapped. It works with both VQ-BeT and Diffusion Policy, and the encoder is not fine-tuned.
- The results show a 40% relative improvement over global features on four simulation tasks, Push-T, LIBERO Goal, BlockPush, and Cube, and on three real Franka robot tasks.
- Efficiency is a major strength. The VQ-BeT-based system runs in 10.99 ms at inference even with DINOv2 patches, compared with 61.71 ms for OpenVLA-OFT, and training takes 6.5 GPU hours versus 16 GPU hours.
- Reducing the number of patches hurts performance. On Push-T, 256 patches score 0.69, while 64 patches score 0.52 and 1 patch scores 0.48, which shows that spatial resolution is the key to precise manipulation.
- 665Robotics
RynnBrain 1.1: Towards More Capable and Generalizable Embodied Foundation Model
- The core claim is that it is not enough to understand vision well; the representation and output must be immediately usable for robot manipulation.
- As a method, it adds contact-point prediction, meaning a grasp center and gripper-plane rotation angle, and native 3D localization as pretraining tasks, and 3D localization is included in the 2B and 9B models.
- The architecture is a decoder-only vision-language model based on Qwen3.5, and it uses DeepStack and Interleaved MRoPE to handle images, multi-view images, and video over long contexts.
- To unify multiple robots under one policy, it uses a shared action space aligned by body part and masks only the axes that each robot supports.
- As a result, the average success rate over three real-robot tasks is 86.67 percent for RynnBrain-VLA, 73.33 percent for GR00T N1.7, 65.00 percent for π0.5, and 60.00 percent for the Qwen-based model.
- The generalist version trained on multiple tasks and multiple robots performs better than task-specific training, with success rising from 86.67 percent to 91.67 percent, which supports the idea that heterogeneous robot data can complement one another.
- 664Computer Vision
Exploration Matters for Escaping the Blur Trap in 3D Gaussian Splatting
- The core argument is that blur in 3DGS comes not from insufficient data or model capacity, but from bias in the optimization dynamics themselves.
- Theoretically, it proves that 3D position updates derived from 2D gradients are orthogonal to the camera-to-Gaussian viewing ray, and reports that the 2D position component dominates the other two components by two to three orders of magnitude throughout training.
- It splits blur into two kinds: far-side blur caused by missing depth signals and near-side blur caused by alpha blending suppressing the signal to increase density.
- The remedy is simple: periodically seed candidate Gaussians at random positions, prune bad candidates by opacity pruning, and randomly split some Gaussians regardless of accumulated gradients.
- Across five datasets, Mip-NeRF 360, Tanks and Temples, Deep Blending, OMMO, and DL3DV, and in the 4DGS extension, image quality improves, with PSNR on Tanks and Temples rising from 23.73 to 24.37 and DL3DV from 27.16 to 28.43.
- Ablation studies show that forcing more splits by lowering the density threshold only inflates the number of points without materially improving quality, confirming that the gain comes from exploration itself rather than from simply increasing the count.
- 663AI / General
DSWorld: A Data Science World Model for Efficient Autonomous Agents
- It is the first to propose the concept of a data science world model that predicts state transitions in data science tasks.
- It introduces cost-aware routing, where lightweight tasks are executed directly and heavier tasks are predicted by an LLM simulator.
- It speeds up RL agent training by about 14 times and retrieval-based reasoning by 3 to 6 times.
- On the transition-prediction task, it achieves accuracy that is 35.6 percent higher than the strongest LLM baseline.
- 662Computer Vision
StructGen: Disambiguating Multi-Reference Image Generation via Structured Context Modeling
- It removes ambiguity in natural-language instructions by assigning an identifier to each reference image in a dictionary-style format.
- It builds a new structured training dataset from real, high-quality images.
- It proposes a dedicated benchmark for multi-reference evaluation.
- It consistently outperforms existing methods on complex multi-reference scenarios.
- 661Information Retrieval
RecGPT-V3 Technical Report
- The Memory Hub manages user behavior histories as memory units compressed by 94.5%, so the system does not have to reprocess the full history on every request.
- It solves the tag-item information bottleneck with a hybrid multimodal model in which the LLM directly infers Semantic IDs.
- It compresses 3,000-token reasoning into 15 tokens using latent CoT tokens, a 200x reduction, while keeping the content recoverable when needed.
- In live A/B tests, it improved IPV by 1.28%, CTR by 1.00%, and GMV by 3.97%, while cutting GPU cost by 52.4%.
- 660Robotics
Xiaomi-Robotics-1: Scaling Vision-Language-Action Models with over 100K Hours of Real-World Trajectories
- An automatic VLM-based labeling pipeline is applied to more than 100,000 hours of real UMI manipulation trajectories.
- The pretraining stage shows a clear scaling law, with performance improving consistently as both data and model size increase.
- On RoboCasa365, it reaches 57.6 percent, which beats the previous best of 46.6 percent.
- On a real robot, it learns new tasks from less than 10 hours of data and reaches an average success rate of 75 percent.
- 659Computer Vision
Audio-Visual Flamingo: Open Audio-Visual Intelligence for Long and Complex Videos
- It releases the AV-Skills dataset, consisting of about 7 million caption and QA instances.
- It designs a three-stage curriculum that progresses from short-video recognition to reasoning over long videos of up to 15 minutes.
- TAVIT precisely maps intermediate reasoning steps to video and audio timestamps.
- It achieves 60.2% on MMOU, the best performance among comparable open-source models.
- 658LLMs / NLP
Loop the Loopies!
- It introduces a layer-loop method and shows that it is more efficient for MoE than the existing model-loop approach.
- It outperforms a vanilla 30B-A3B model under the same compute budget.
- It records state-of-the-art math reasoning with 92.10% on AIME and 94.21% on AMC.
- It achieves gold-medal-level performance at IMO 2025 and IPhO 2025 without tools.
- 657Machine Learning
Understanding Reasoning from Pretraining to Post-Training
- It runs 36 pretraining-RL combinations with models from 5M to 1B parameters and discovers a scaling law in which pretraining loss predicts post-RL performance.
- RL increases the probability of existing correct answers on easy problems and surfaces answers that were almost absent during SFT on hard problems.
- The result shows that allocating a larger share of the total compute budget to RL becomes optimal as the overall budget grows.
- The same pattern appears not only in chess but also in math, across a 1B language model and 10B to 200B tokens, where longer pretraining improves RL efficiency.
- 656AI / General
Full-Pipeline Inference Optimization for MiMo-V2.5 Series: Pushing Hybrid SWA Efficiency to the Limit
- It separates the KV cache for full attention and sliding window attention, compressing SWA storage to the theoretical limit of O(W), which is about 7x more efficient than before.
- It builds GCache, an RDMA-based distributed cache infrastructure that shares KV caches efficiently across multiple nodes.
- It redesigns the prefix cache tree to be SWA-aware and fixes accuracy bugs that the old prefix matching approach caused under SWA.
- It also optimizes the multimodal pipeline end to end, including GPU image preprocessing, parallel video decoding from 156 seconds to 23 seconds for a 1-hour video, and cross-request batching for the encoder.
- It improves MTP, or multi-token prediction, so that it also works in prefill and speeds up the first 128 decoded tokens by 2.3x.
- It shows that resolving only the NUMA contention improves end-to-end performance by about 10%, which means system-level details matter a lot.
- 655Machine Learning
Concurrent Image Understanding and Generation: Self-Correcting Coupled Markov Jump Processes
- It generates text and images simultaneously in a single decoding process, with each side verifying the other's decisions.
- It proposes CO2Jump, a training-free sampler that outperforms prior methods on image editing and visual reasoning tasks.
- It adds a remasking mechanism so that tokens once fixed can be hidden again when evidence changes, allowing the model to correct contradictions on its own.
- It builds and plans to release three large multimodal datasets: JEdit-1M, JMaze-200K, and JNono-200K.
- Performance improves steadily as the number of denoising steps increases, showing that the benefits of cross-modal coupling accumulate.
- 654Machine Learning
BadWAM: When World-Action Models Dream Right but Act Wrong
- We are the first to uncover a new vulnerability in WAMs, showing that imagination and action can be separated.
- An attack that targets action only reduces robotic task success from 96.5% to 43.1%, cutting it by more than half.
- We design a stealth attack that preserves imagination while quietly corrupting only action, demonstrating that existing safety monitors can be bypassed.
- The attack transfers from one WAM variant to another, confirming that the vulnerability is not specific to a single implementation.
- Simple preprocessing defenses are not enough, which suggests a new safety approach that directly checks synchronization between action and imagination.
- 653Machine Learning
DeepLoop: Depth Scaling for Looped Transformers
- The authors mathematically prove that the gradient accumulation in looped transformers with shared layers makes the usual DeepNorm scaling insufficient.
- Simply increasing the exponent from one quarter to one half, with alpha equal to (2N) to the one-half power and beta equal to (8N) to the negative one-half power, stabilizes training as the number of loops grows.
- On GPT-2 small and medium scales, increasing the number of loops consistently improves performance over prior methods.
- When applied to the hierarchical reasoning model, or HRM, on the ARC-AGI reasoning benchmark, accuracy rises from 36.5 percent to 39.75 percent, which is a gain of 3.25 percentage points.
- Because it changes only the scaling formula and adds no extra parameters, the method is essentially free to apply.
- 652Computer Vision
Hierarchical Denoising For Multi-Step Visual Reasoning
- We solve the limitations of both fast but dumb streaming and smart but slow bidirectional video methods with a tree-structured approach.
- Across six multi-step reasoning tasks, including maze solving, Sokoban, and Hanoi towers, success rises from 34.22 to 60.29, a 76.2% improvement.
- The streaming version runs at 0.70 seconds per frame, 54x faster than bidirectional diffusion, while still achieving higher reasoning accuracy.
- Using only 2% of the training data preserves 82.9% of the performance of the full data, showing strong data efficiency.
- Real robotic arm maze experiments also show robust success, confirming applicability in the physical world.
- 651Machine Learning
On-Policy Delta Distillation
- It argues that using the difference between a teacher's pretraining and post-training states, rather than the teacher's final output, transfers reasoning ability more accurately.
- It consistently outperforms existing on-policy distillation methods across 14 benchmarks in math, science, and code.
- It is validated broadly on recent models such as Qwen3, from 1.7B to 8B, and Gemma4, which makes the result credible.
- The additional compute cost is only 8% to 28%, so the method can be added to existing distillation pipelines easily.
- Its analysis shows that the delta signal concentrates on reasoning tokens such as hence and however, while suppressing exploratory tokens such as try and verify.
- 650LLMs / NLP
T^2MLR: Transformer with Temporal Middle-Layer Recurrence
- It shows that if only the middle layers, the transformer’s thinking layers, are connected recurrently, reasoning improves more than when the entire stack is repeated.
- Recursing through only 20% of the full stack is enough, which maximizes reasoning capability while minimizing inference latency.
- Even just adding the recurrent path and fine-tuning an already trained 1.7B model greatly improves mathematical reasoning accuracy, with GSM8K up 4.1 points and MATH500 up 5.2 points.
- The inference overhead is only about 8%, so it can be used without much burden in production.
- Training cost increases by roughly 2x to 4x, but it is a meaningful tradeoff given the gains in inference efficiency and performance.
- 649AI / General
SearchOS-V1: Towards Robust Open-Domain Information-Seeking Agent Collaboration
- It formalizes information retrieval as relational schema completion plus citation evidence, so progress can be measured at the entity and attribute level.
- SOCM, with Frontier Task, Evidence Graph, Coverage Map, and Failure Memory, externalizes implicit progress into an explicit shared state.
- Pipeline parallel scheduling assigns the next task immediately when an agent slot becomes free, which maximizes utilization.
- The Search Tool Middleware Harness handles evidence extraction, budget enforcement, and loop detection outside the agent prompt.
- It reaches 76.5 F1 on GISA, which is 13.4 points better than the strongest baseline, and 80.3 F1 on WideSearch, where it takes first place on every metric.
- 648Machine Learning
xHC: Expanded Hyper-Connections
- It is the first method to extend Hyper-Connection beyond N=4 to N=16, because prior mHC methods suffered strong diminishing returns above N=4.
- Temporal feature augmentation enriches write-back with nearby token information, and sparse residual updates at k=4 or N=16 balance cost and efficiency.
- On an 18B MoE model, it delivers a +4.0 point gain over mHC while adding only 4.1% more FLOPs than vanilla.
- The scaling law shows that vanilla requires 1.50x compute and mHC requires 1.19x compute to reach the same loss, using xHC as the reference.
- xHC-Flash keeps sublayer memory traffic at 40C even with N=16, which is similar to mHC at N=4 with 34C.
- 647Computer Vision
WanSong v1.0 Technical Report
- It abandons the autoregressive pipeline and uses pure diffusion to generate a five-minute song with vocals and background music as dual stems in a single pass.
- Dual-stem tokens model vocals and accompaniment separately, so both can be generated at high quality without the usual quality drop from classifier-free guidance.
- A 1024-compression VAE, which is half the compression of the previous 2048 setting, preserves fine acoustic detail and improves SI-SDR by 2.86 dB.
- RLHF is used to optimize musicality, lyric accuracy, and prompt alignment, yielding a musicality score of 5.49 compared with 4.18 for Suno and 3.83 for Mureka.
- Stable long-song generation is achieved through 6 million hours of multilingual data and three-stage curriculum training from 90 seconds to 300 seconds to SFT.
- 646Computer Vision
MeanFlowNFT: Bringing Forward-Process RL to Average-Velocity Generators
- It is the first combination of forward-process RL with MeanFlow, which generates 1 to 4 steps by predicting interval-averaged velocity.
- It applies the DiffusionNFT objective through an instantaneous velocity predictor derived from MeanFlow identity, while sampling still uses average velocity.
- It theoretically inherits the policy improvement guarantee of DiffusionNFT.
- On SD3.5-M, it beats SOTA on 6 of 8 metrics, and on Wan2.1 video it uses 4 steps to beat LongCat-Video RL's 50-step score of 82.57 with 84.33 VBench.
- It shows consistent gains under test-time scaling as the number of steps increases.
- 645Robotics
DriftWorld: Fast World Modeling through Drifting
- It is the first application of a drifting generative model, which generates in a single forward pass, to a robotic world model and achieves 30-plus fps, 17 times faster than diffusion.
- It proposes three adaptations: an action-conditioned drifting field, a loss in the DINOv2 feature space, and frame-wise action conditioning.
- On Push-T, it raises IoU from 0.635 to 0.781, which greatly improves action-exploration quality, and it shows consistent gains across 5 environments.
- It is also valid as an offline policy-evaluation metric and achieves a Pearson correlation of 0.92 to 0.99 with actual performance.
- It proves that fast and accurate imagination directly helps both robot planning and policy evaluation.
- 644AI / General
Harness Handbook: Making Evolving Agent Harnesses Readable,Navigable, and Editable
- It defines the behavior localization problem as finding where in the code a behavior described by a change request is implemented.
- Harness Handbook reorganizes code by behavior rather than by file or function, and links each behavior directly to source code.
- Behavior-Guided Progressive Disclosure (BGPD) guides exploration step by step from high-level behavior descriptions to relevant implementation details.
- On two open-source harnesses, Codex and Terminus-2, it outperforms the baselines with win rates of 38.3% and 45.6%, compared with 28.3% and 26.7%.
- It delivers especially large gains on multi-file edits, rarely executed code paths, and interactions across modules.
- 643Robotics
Scaling Behavior Foundation Model for Humanoid Robots
- It adopts motion tracking as a unified training paradigm, combining diverse whole-body control problems under reference-motion imitation.
- Experiments show that the synergy between the quantity of on-policy rollouts and the diversity of reference motions is the key to scaling.
- It introduces the Humanoid Transformer, a scalable architecture in which structured action representations emerge naturally.
- Compared with existing humanoid controllers, it reduces MPKPE by 10% locally and 82% globally, and reaches an overall accuracy of 0.9836.
- It is validated in both simulation and on real robots, confirming its practicality.
- 642Computer Vision
Video = World + Event Stream
- It proposes a decomposition in which video equals world plus event stream, and uses it to define a general-purpose pretraining task.
- It adds free-form actions, expressed as natural-language instructions in parentheses, to the event stream so that the agent can perform open-vocabulary actions rather than a fixed action set.
- It maintains real-time duplex audio-visual dialogue with 200 ms model response latency and 550 ms end-to-end interaction latency.
- It demonstrates flexible transfer from pretraining to downstream tasks, suggesting that the same streaming logic can adapt to a range of real-time problems.
- 641Robotics
RoboTTT: Context Scaling for Robot Policies
- It integrates Test-Time Training, fast weights, into a VLA model to achieve an 8K time-step context without increasing inference latency.
- With just one human video demonstration, it gains one-shot imitation of a new behavior, succeeding in 6 out of 10 cases while all baselines fail.
- DAgger Distillation enables real-time performance improvement, reaching 83% success under disturbances, compared with a previous best of 53%.
- The overall task success rate improves by 87% over the single-step baseline, and it completes a 5-minute, 10-step assembly all the way through, which no previous model could do.
- Expanding context length from 1K to 8K yields 62% better performance, showing that context is a scaling axis for robots as well.
From research to product use
Operating capabilities, pilots, and technologies in development are identified separately.
View technology