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.
- 760Research
Qwen-Audio-3.0-Gen-Preview Technical Report
- It unifies speech, music, sound effects, and mixtures into a single generation path with a non-autoregressive structure.
- It designs a shared VAE that compresses 48 kHz stereo into a 25 Hz latent representation.
- It uses only about 10 percent of the music data used by specialized prior models, yet still leads in 3 of the 7 SongBench tasks.
- On Seed-TTS-Eval, it achieves the highest speaker similarity, and it also outperforms Seed-Audio-1.0 in multi-speaker consistency.
- 759Computer Vision
HumanCLAW: Can Vision-Language Models Act Through a Body?
- We built a framework that separates behavioral decision making in VLMs from motor control, so it evaluates reasoning ability alone.
- We built HumanCLAW-Bench, consisting of 1,218 egocentric exploration and interaction episodes across 41 indoor scenes.
- Even the best of nine state-of-the-art VLMs reaches only a 16.8% success rate.
- The core failure is not perception but a lack of self-awareness, meaning the model does not know where its body is, whether it has arrived, or whether it has collided.
- The conclusion is that current VLMs only describe the world; they do not feel the body they control.
- 758Research
Settling the Optimal Exponent Relating Sumsets and Difference Sets
- It is the first proof that the optimal universal exponent relating sumsets and difference sets is exactly 2.
- An AI agent, Hyra, discovered the key structure through 24 hours of autonomous search, and a human then verified it rigorously in mathematics.
- It also provides a Lean 4 formal proof, which makes the result machine-checkable.
- The core construction combines base-12 digit techniques, a three-state carry automaton, and the Chinese remainder theorem.
- 757Computer Vision
TurboVLA: Real-Time Vision-Language-Action Model at 32 Hz on an RTX 4090 with <1 GB VRAM
- It proposes a direct vision-plus-language-to-action approach by removing the LLM-centered architecture.
- With 0.2B parameters, the model is only 6% the size of π0.5, which has about 3.4B parameters, yet matches or exceeds its performance with a 97.7% success rate on LIBERO.
- It achieves 32 Hz inference, 31.2 ms, on a consumer RTX 4090 and uses less than 1 GB of VRAM, making edge deployment possible.
- It outperforms π0.5 consistently on four real-robot tasks with an AgileX Piper.
- Removing language drops the success rate to 70.8%, proving that language conditioning is still important even at the execution level.
- 756Robotics
DC-WAM: Dynamic-Centric Visual Supervision and Reasoning for World-Action Models
- We redistribute visual supervision from appearance reconstruction to interaction-centered dynamics in RGB video prediction, so PSNR drops but policy performance improves.
- A temporal difference flow-matching objective and tracker-guided weighting focus on robot-object contact motion rather than static background and texture.
- The DynaRoute attention bias predicts dynamic-relevant tokens and steers visual attention toward them.
- On LIBERO-Plus OOD, it reaches 60.9%, a 9.4-point gain over FastWAM, and reduces the ID-OOD gap from 46.1 to 37.2.
- On real robot bimanual tasks, it achieves up to a 30-point improvement under lighting changes.
- 755Computer Vision
Visual prompt engineering for video models
- It systematically proposes and validates visual prompt engineering, or VIPE, for video models.
- On Veo 3.1, converting sketches into photorealistic scenes raises physical reasoning accuracy from 41.3 percent to 59.3 percent, a gain of 18 points.
- It uncovers a realism bias, meaning video models reason much better on realistic scenes, so abstract benchmarks underestimate their ability.
- VIPE is often more effective than test-time scaling methods such as text-prompt optimization or self-consistency.
- Stepwise experiments confirm that scene consistency improves whenever realism is increased by one level.
- 754Computer Vision
HOME: Robust Hough-space Matching Method for Structured and Textureless Videos
- It uses the maxima in Hough space as keypoints to achieve stable feature-point detection on straight-line structures.
- A one-dimensional radial descriptor mathematically guarantees rotation and translation invariance, which removes the need for separate orientation estimation.
- It is training-free and outperforms line-segment matching methods based on LSD and LBD on every metric.
- It runs in real time at 16.5 ms total, and although the Hough transform takes most of the time, 7.7 ms, it can be improved with GPU acceleration.
- It remains robust even on nearly textureless images with alpha equal to 0.95, finding more than 400 inlier matches.
- 753Computer Vision
Parallel Decoding Distillation for Fast Image and Video Generation
- It trained a 'parallel decoder' that predicts multiple denoising steps in parallel from a single forward pass, speeding up generation.
- It solved the mode collapse problem by using only a simple regression objective, without VSD or GAN losses.
- On Wan2.1 14B text-to-video, it ranked first on VBench and outperformed the baseline on diversity metrics.
- On Qwen-Image 20B, it achieved SOTA scores with only 4 to 8 NFE.
- On the LTX-2.3 22B model, it can generate a 720p 10-second video with audio in only 8 NFE.
- 752Computer Vision
Mage-VL: An Efficient Codec-Native Streaming Multimodal Foundation Model
- The codec-native tokenizer, Mage-ViT, reduces visual tokens by more than 75% by encoding only dynamic patches.
- Trained from scratch on just 560M unlabeled images, it matches SigLIP2, which uses billions of image-text pairs, demonstrating pretraining data efficiency.
- A dual-system design, with a System 1 event gate for fast reaction and a System 2 causal decoder for deep reasoning, supports real-time streaming understanding.
- With 4B parameters, it matches Qwen3-VL-4B on static tasks and surpasses even the 15B Phi-4 model on video understanding and 2D/3D spatial reasoning.
- It achieves up to 3.5x inference speedup and reports seven key empirical findings.
- 751Robotics
INTACT: Isomorphic Intent-to-Action Learning for Search-Free World Models
- It integrates a JEPA prediction architecture with an intent-to-action interface so it can generate actions directly without retrieval.
- It processes physical next states and target intents with one shared predictor, while designing the endpoint gradient asymmetrically.
- In direct mode without retrieval, it reaches 85.78% to 100% success on four LeWM tasks, with 2.9 to 5.5 ms inference time.
- With selective CEM search, it achieves 96.86% macro success while using 23.44x fewer samples than pure CEM.
- Joint training with a single encoder over four tasks yields 89.39% direct macro success.
- 750LLMs / NLP
Pass the Baton: Trajectory-Relayed On-Policy Distillation
- It discovers a teacher-student asymmetry in direction switching: the teacher reflects and changes direction, but the student just keeps going straight.
- It experimentally confirms that even 0.35% teacher tokens can raise accuracy by +7.23 points.
- It limits the number and length of teacher interventions through a relay budget so the student policy does not drift too far away.
- It cuts the average training trajectory length by more than 50%, from 4,658 to 2,296 tokens, while still improving accuracy.
- A single regression objective makes stable training possible without VSD or GAN losses.
- 749Computer Vision
MODUS: Decoder-Only Any-to-Any Modeling of Diverse Modalities
- It is the first model to process 15 modalities with a single decoder, without modality-specific heads, losses, or task pipelines.
- Unlike prior any-to-any models, it uses a large pretrained decoder, BAGEL, to greatly reduce training cost.
- Uniform timestep sampling avoids modality confusion and enables stable training.
- It naturally supports chained generation, converting through intermediate modalities, and cross-modal self-verification, checking its own outputs through other modalities.
- It releases the 29-million-sample MODUS-DATASET and two checkpoints as open source.
- 748Robotics
HiFi-UMI: Learning Deployable Manipulation Policies from High-Fidelity UMI Data Alone
- It overcomes the fidelity limits of prior UMI data with 3 mm trajectory accuracy, microsecond synchronization, and a field of view of about 200 degrees.
- Zero-robot post-training means it is trained only on HiFi-UMI data and can then be deployed directly on real robots, which is validated on all three backbones.
- The strongest policy reaches an 85 percent success rate on precision insertion tasks, even though HiFi-UMI contains no trajectories for those tasks.
- With 4,000 hours of pretraining, action error decreases by 41 percent on 10 unsupported tasks, and one backbone gains an additional 18.1 percentage points in success rate.
- HiFi-UMI-2K, a high-quality dataset containing 2,000 hours of microsecond-synchronized data, was released as open source.
- 747Research
How to read Mathematics? A study guide
- Mathematics should be read in terms of time per page, not pages per time, so read slowly, very slowly.
- When reading a definition, you must create examples and counterexamples. A definition without examples, and an example without a definition, is not enough.
- When reading a proof, first skim it, then follow it line by line, and finally summarize the key idea.
- Practice problems should be looked at as early as possible, and the problem itself should be read like a mathematical text.
- It warns against overreliance on AI, citing EEG research that suggests heavy dependence on LLMs weakens brain connectivity.
- 746Software Engineering
RSIBench-Data: Benchmarking Data-Centric Research for Recursive Self-Improvement
- It is the first benchmark that fixes the training, evaluation, and serving infrastructure so that only pure data research ability is measured.
- Among four frontier agents, including Codex and Claude Code, none is consistently dominant. Codex wins on non-SWE tasks, while three SWE tasks are won by different agents.
- After feedback, 78% of runs still drop in score on the final attempt even after reaching a peak, which reveals a discovery-reliability gap.
- Increasing max effort helps find stronger candidates earlier, but it reduces the number of exploration attempts, which reveals a depth-width trade-off.
- A self-improvement experiment on the same model family, kimi-k2.6, improves from 8% to 21% but still falls short of the original 33%.
- 745Computer Vision
Wonder: Video World Model Done Better
- It converts camera motion into rendered visual cues rather than abstract data, which prevents control accuracy from collapsing after distillation.
- A sparse full-fidelity memory preserves every past frame while keeping attention cost constant.
- A mixture-of-students over time and camera-aware adversarial regularization preserve both visual quality and control accuracy during distillation.
- It achieves meaningful improvements over the strongest baseline on rotation position error, going from 0.0174 to 0.0132 for translation and from 0.1155 to 0.0784 for rotation.
- It also supports video input, so it can re-shoot existing videos by changing the camera path in real time.
- 744Machine Learning
Sparse Autoencoders Encode Both Concepts and Functions: The Downstream Geometry of Feature Effects
- It measures the geometry of how output logits change when a feature is removed.
- Most features do not provide one stable control direction.
- Value-like features more often show low-dimensional structure, but their effects are spread across multiple directions.
- Pointer-like features produce mostly scattered effects.
- The paper compares ReLU, TopK, and Matryoshka Batch TopK on Gemma-2-2B.
- Even when a feature is interpretable and causal, that does not guarantee stable control.
- 743AI / General
From Proprietary to Open-Source: Bridging the Distribution Gap via Multi-Agent Protocol Distillation in Agentic Search
- It uses commercial models only as offline teachers, so inference cost is zero.
- The structured JSON convention created by the multi-agent system links teacher and student.
- It strips away surface style to reduce stylistic contamination and hallucination.
- It achieves average success rates of 39.4% with Qwen3-1.7B and 44.4% with Qwen3-4B.
- Claude, GPT, and Gemini teachers are all within 2 points of each other, so API swapping is easy.
- Convention synthesis is a one-time cost of about $1,454.
- 742LLMs / NLP
A New Role for Relevance: Guiding Corpus Interaction in Agentic Search
- It redefines relevance as the order in which grep explores the corpus, rather than as a top-k document selection problem.
- Document ranking provides global relevance, while match reranking provides local relevance.
- It seeds the retrieval start points with question-matched passages so that decisive evidence is found earlier.
- On GPT-5.4-mini, it reaches 84 percent accuracy with only 23.9 tool calls, which is far fewer calls than competing methods.
- It retains 79 percent accuracy even when scaled to one million documents, showing only a mild performance drop.
- 741Information Retrieval
LaRec: Unleashing LLM-based Latent Reasoning for Generative Recommendation
- It greatly reduces response latency by reasoning in latent space instead of through long text reasoning.
- During latent pretraining, step-level alignment and process direction alignment provide rich supervisory signals to intermediate reasoning steps.
- A user-specific Gaussian mixture distribution is used to sample the starting point of reasoning within the relevant latent space.
- GRPO is combined with a sparse-hit reward and a dense semantic-similarity reward to align reasoning with the recommendation objective.
- The latency of latent reasoning is close to no-reasoning and much lower than chain-of-thought.
- An online A/B test on a real advertising platform records improvements such as a 2.93% conversion rate.
- 740Robotics
LeapBot-WA: World-Anchor Action Models via Predictive Latent Alignments
- It shifts from pixel-level video reconstruction to predicting abstract physical changes in latent space.
- It uses a co-embedding prediction structure as a world anchor, focusing on state changes rather than visual appearance.
- An isotropic semantic autoencoder bridges the mismatch between the predicted features and the diffusion prior.
- The heavy prediction branch is used only during training and is removed at inference, so it runs without extra cost.
- It achieves state-of-the-art results on RoboTwin 2.0 at 91.46 percent and on LIBERO at 97.3 percent without large-scale trajectory pretraining.
- Isotropic regularization raises latent rank from 38.1 to 92.3 and improves success rate to 71.3 percent.
- 739Robotics
DeVA: Decoupled Video-Action Model with physical guidance for robot policy learning
- The method separates video prediction and action prediction into different experts so that policy learning becomes more manageable.
- It passes representations from multiple layers of the video backbone to the action expert through cross-attention and bridge tokens.
- It injects auxiliary supervision for object-manipulation regions and relative depth, which strengthens physical information.
- With 50 demonstrations per RoboCasa task, it reaches a 72.0 percent success rate and improves by up to 22 points over the same budget.
- On three real-world dual-arm robot tasks, it averages 74 percent and outperforms GR00T-N1.6 at 48 percent and Cosmos Policy at 34 percent.
- It converges faster with up to 20 times fewer training examples than Cosmos-Policy.
- 738Research
On Feige's conjecture
- It constructed a short proof by connecting Vlassis and Thomas's distribution-free p-value result to the random-variable-sum problem in Feige's conjecture.
- It showed that the probability that the sum of n independent nonnegative random variables, each with expectation 1, is less than n+1 is at least (n/(n+1))^n.
- Because this lower bound is at least 1/e, it establishes Feige's conjecture, posed in 2004.
- It shows how resolving Gaffke's conjecture in statistics can lead to a proof of a probability inequality, and GPT-5.6 Sol assisted the proof search.
- However, the central theorem focuses on Feige's conjecture with threshold n+1, rather than resolving the full range of more general small-deviation parameters.
- 737Research
Sharp small-deviation inequalities for sums of independent nonnegative random variables
- It combined the exact Dirichlet calibration theorem of Vlassis and Thomas with results from convex geometry, including Grünbaum's centroid theorem.
- Treating 0<δ<1 and δ≥1 separately, it proved explicit lower bounds on small-deviation probabilities for sums of independent nonnegative random variables.
- For δ≥1, the lower bound is optimal for every n and is at least 1/e, settling Feige's conjecture.
- The result provides a sharp reference for analyzing the lower tails of sums of independent nonnegative random variables.
- However, optimality for every n is established only for δ≥1, and the lower bound in the range 0<δ<1 has not been proved equally sharp.
- 736Robotics
τ: Learning Touch-Augmented Vision-Language-Action Models from Future Visual Supervision
- It learns spatiotemporal tactile representations using a self-supervised objective that predicts future visual features from current touch and subsequent actions.
- It combines the learned tactile representations with pretrained visual and language features to generate robot actions, while using the prediction branch only during training.
- It outperformed vision-only VLAs and existing tactile policies on four contact-intensive manipulation tasks, including plug and USB insertion.
- Removing the additional branch at inference allows it to improve contact-critical robot manipulation without increasing deployment cost.
- Evaluation focuses on TacAura's four representative tasks and limited task-specific data, leaving validation across a wider variety of robots and contact situations outstanding.
- 735AI / General
From Execution to Capability: Scientific Experience Consolidation via Procedural Knowledge Synthesis
- It defines the problem of turning validated execution experience into reusable procedural knowledge and persistent model capability.
- It extracts procedures by contrasting successes and failures, then keeps only the ones that pass development validation gates.
- It increases training data by synthesizing new questions from failures even when no ground truth is available.
- It empirically shows the gap between abstraction and execution, where weaker models cannot use the abstract procedures directly.
- A stronger model concretizes the procedures into executable code and turns them into standard supervised training data.
- The 9B student improves by 5.62 points on substeps and 11.25 points on full problems even without the original procedures.
- 734Computer Vision
OmniVAE: An Audio-Video VAE with Cross-Modal Alignment for Joint Generation
- Training audio VAE and video VAE separately causes their latent spaces to diverge, making synchronization difficult.
- OmniVAE is an audio-video VAE that finely aligns the two spaces through joint training.
- It matches temporal semantics with segment-level contrastive learning.
- It distills semantic features from a pretrained encoder to improve the trainability of each latent space.
- Both objectives are used only during training, so inference cost does not increase.
- On Verse-Bench, both synchronization, DeSync dropping from 0.884 to 0.570, and audio quality improve.
- 733LLMs / NLP
The Physics of Multi-Turn Long-Horizon Planning: From Pre-training to Post-training via Single- and Multi-Teacher On-Policy Agentic Distillation
- Making the world model explicit as a chain of thought greatly improves long-horizon generalization, from 93.1 versus 0.3.
- Atomic skills alone do not generalize compositionally, but adding only 5% long-horizon data causes a sharp jump.
- Mixing in bad trajectories causes error accumulation and collapses long-horizon performance.
- On-policy distillation has a wider effective range than GRPO under long-horizon and low-quality conditions.
- Multi-teacher distillation converges on shared planning patterns, while conflicting patterns cause severe forgetting.
- The experiments use full-parameter supervised learning based on Qwen2.5-100M.
- 732Computer Vision
CameraAnything: Refilming Videos with Arbitrary Camera Control
- It jointly controls extrinsic camera parameters such as position and orientation, and intrinsic parameters such as focal length and resolution.
- The method combines per-pixel ray representations and resolution-aware 3D positional encodings with self-attention.
- It handles original-resolution editing in a single generation pass without cropping or outpainting.
- It creates paired training data with a synthesis pipeline based on synchronized multi-camera recordings.
- Its real-world rotation error is 2.76 degrees, which is lower than 5.12 degrees for ReCamMaster and 13.99 degrees for TrajectoryCrafter.
- It generalizes to real videos even when trained only on synthetic data.
- 731Computer Vision
Sol-Attn: Accelerating Video Generation Inference via On-the-Fly Attention Sparsification
- It speeds up a pretrained model without training by sparsifying only the attention.
- Block proxy scores are modeled as Gaussian, so blocks are selected using thresholds based on the mean and standard deviation.
- It does not build a proxy-score map in memory, which reduces routing cost.
- It reuses discarded block scores for approximate correction, so accuracy loss stays small even under aggressive sparsification.
- It achieves end-to-end speedups of 2.1x for video generation and 2.3x for editing, without degrading quality.
- When integrated with Sol-Engine, it reaches up to 5x acceleration for video generation.
From research to product use
Operating capabilities, pilots, and technologies in development are identified separately.
View technology