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. 279LLMs / NLP

    Mellum2 Technical Report

    • This report introduces Mellum 2, an open-weight 12B-parameter MoE language model with 2.5B active parameters per token.
    • Across code generation, math and reasoning, tool use, knowledge, and safety benchmarks, Mellum 2 is competitive with open-weight baselines in the 4B to 14B range while operating at the per-token compute cost of a 2.5B dense model.
    • The authors release the base, instruct, and thinking checkpoints under the Apache 2.0 license together with this report, which describes the underlying architectural choices, data pipelines, and training recipe.
  2. 278LLMs / NLP

    LongTraceRL: Learning Long-Context Reasoning from Search Agent Trajectories with Rubric Rewards

    • Experiments on five long-context benchmarks with three reasoning LLMs, ranging from 4B to 30B, show that LongTraceRL consistently outperforms strong baselines and encourages comprehensive, evidence-based reasoning.
    • Reinforcement learning with verifiable rewards, or RLVR, has shown promise for this task, but prior methods are limited to low-confusion distractors and sparse, outcome-only reward signals, so they fail to supervise intermediate reasoning steps.
    • This paper proposes LongTraceRL to address these issues.
  3. 277Computer Vision

    VLM3: Vision Language Models Are Native 3D Learners

    • The authors therefore propose VLM3, a simple and scalable extension method that enables standard VLMs to handle a wide range of 3D tasks effectively.
    • A deep large-scale study shows that unifying focal length, using text-based pixel references, and mixing and scaling data are sufficient for effective 3D learning.
    • Vision-language models let a single model solve diverse vision tasks through prompting.
  4. 276Computer Vision

    Representation Forcing for Bottleneck-Free Unified Multimodal Models

    • The paper proposes Representation Forcing (RF), a technique that closes this gap by making representation prediction an intrinsic capability of the model.
    • If this is simply removed, the model must learn both high-level structure and low-level details directly from raw pixels, which creates a quality gap.
    • Specifically, RF forces the decoder to autoregressively predict visual representations as intermediate tokens before pixels, and those tokens are then kept in context to guide pixel diffusion within the same backbone.
  5. 275LLMs / NLP

    MemTrace: Tracing and Attributing Errors in Large Language Model Memory Systems

    • Update errors occur when the existing memory state is modified or overwritten incorrectly.
    • Deletion errors occur when useful information is removed improperly.
    • Retrieval errors occur when the relevant memory unit cannot be found for a given query.
  6. 274Computer Vision

    GPIC: A Giant Permissive Image Corpus for Visual Generation

    • Long: A very detailed 5 to 7 sentence description of the foreground, the background, and specific OCR text.
    • GPIC-Nano: 1 million images, suitable for rapid prototyping.
    • GPIC-Lite: 10 million images, suitable for more serious development.
  7. 273LLMs / NLP

    Scaling Laws for Agent Harnesses via Effective Feedback Compute

    • Step complexity, L, is the minimum number of reasoning or action steps required.
    • A higher-quality router greatly increases eta by ensuring that the model calls the right tool at the right time.
    • Better state management ensures that useful information is preserved and used, which prevents redundant interactions.
  8. 272Computer Vision

    GenClaw: Code-Driven Agentic Image Generation

    • In the final rendering stage, the image model uses this physical draft as a visual guide to generate a realistic scene.
    • If the search result is wrong, it is a cognition error.
    • If the layout is illogical, it is a code error.
  9. 271Computer Vision

    Déjà View: Looping Transformers for Multi-View 3D Reconstruction

    • Register tokens are four tokens used as a global scratchpad for the transformer.
    • Camera tokens are special tokens that store information about the pose and intrinsics of the current view.
    • Frame attention is a subblock that operates independently on each image, allowing the model to infer local geometry within a single view.
  10. 270Computer Vision

    minWM: A Full-Stack Open-Source Framework for Real-Time Interactive Video World Models

    • Training stage: Camera controllability does not appear immediately. With the HY1.5 backbone, the model showed no responsiveness at 2,000 steps, began showing signs of control at 5,000 steps, and stabilized only after 8,000 steps.
    • Embodied AI: It gives robots a mental simulator that predicts the visual consequences of their actions.
    • Game development: It generates infinite, interactive environments that respond instantly to player movement.
  11. 269Machine Learning

    Learn from your own latents and not from tokens: A sample-complexity theory

    • Predictor: A network that takes a tuple of latent values as input and tries to predict the distribution of its sibling latent values.
    • Clusterer: A network that compresses the output of the predictor into a discrete code or cluster identity, and that code becomes the input to the next layer.
    • Teacher as a lifter: The EMA teacher gradually incorporates the learned latent values into its own targets, which shifts the prediction task from token level to latent level during training.
  12. 268AI / General

    SIA: Self Improving AI with Harness & Weight Updates

    • In SIA-H, which uses only the harness, the agent built a classification pipeline and reached 50.0% accuracy, but performance plateaued once the prompt and code hit their limits.
    • In SIA-W+H, which adds weight updates, the model learned to internalize legal nuance, and accuracy jumped to 70.1%, far above the previous best of 45.0%.
    • In SIA-W+H, the system achieved a 14.02x speedup over the initial baseline. Here, weight updates were decisive because the model learned specific H100 hardware patterns such as shared-memory tiling and register accumulation, which scaffold iteration alone could not discover.
  13. 267Machine Learning

    Parallax: Parameterized Local Linear Attention for Language Modeling

    • Perplexity: On datasets such as LAMBADA and WikiText, Parallax achieved consistently lower perplexity than Transformer baselines, a measure of how well the model predicts samples.
    • Downstream tasks: On zero-shot benchmarks such as HellaSwag and ARC, which cover question answering and commonsense reasoning, Parallax showed clear performance gains.
    • Control experiments: To confirm that the gains were not simply due to more parameters or more compute, the authors built parameter-matched and compute-matched versions of the standard Transformer. Parallax outperformed both, suggesting that the improvement comes from the parameterized local linear mechanism itself.
  14. 266Computer Vision

    How and What to Imagine? Visual Thinking in Unified Multimodal Models for Cross-View Spatial Reasoning

    • The key failure mode of visual thinking is identified as "generated but not used."
    • View Dropout, or VDrop, is a training method that masks part of the input view during the answer segment to force the model to pass through a thinking image.
    • The Learnability-Informativeness, or L-I, tradeoff framework compares three visual-thinking representations: panorama, top-down, and point matching.
    • The model is trained on 8K synthetic Infinigen Indoors samples and evaluated on five real OOD benchmarks.
    • Only panorama visual thinking combined with VDrop scores highly on both axes and achieves the best OOD performance.
    • It achieves a 6.7-point OOD improvement over prior methods that were trained with three times more data.
  15. 265LLMs / NLP

    Rethinking Memory as Continuously Evolving Connectivity

    • Success: Through these topological and unit-level edits, the agent successfully completed the task.
    • Self-correcting retrieval: Environmental feedback dynamically fixes over-connection and under-connection problems.
    • Granularity adjustment: The level of detail in stored memory is adapted to the current task requirements.
  16. 264Machine Learning

    Long Live The Balance: Information Bottleneck Driven Tree-based Policy Optimization

    • It improves efficiency by reusing prefixes and taking advantage of KV caching, which lets it generate more trajectories, or a higher G, within the same token budget than independent sampling.
    • By branching according to the IB-Score, the model focuses exploration on the 'critical' steps where both high diversity and a strong signal toward the correct answer are present.
  17. 263LLMs / NLP

    Self-Improving Language Models with Bidirectional Evolutionary Search

    • The merge operator takes two different reasoning paths that share the same starting point and merges their unique suffixes, allowing the model to synthesize successful components from multiple attempts.
    • Deletion removes a single internal step from a trajectory, which helps simplify reasoning or eliminate redundant filler steps that can send the model in the wrong direction.
    • Transposition replaces one step in a trajectory with a step from another trajectory, similar to swapping out a piece of logic to see whether a different approach fits the same context better.
  18. 262Robotics

    Qwen-VLA: Unifying Vision-Language-Action Modeling across Tasks, Environments, and Robot Embodiments

    • The auxiliary vision-language data, 8.5 percent of the training mix, is general-purpose VLM data that helps the model avoid forgetting how to describe scenes or reason about objects.
    • The unified architecture shows that a single model can control multiple embodiments, including arms, hands, and mobile bases, through a shared action expert and text conditioning.
    • The paper shows that vision-language training directly helps robot behavior by providing better object recognition and command parsing.
  19. 261AI / General

    ScientistOne: Towards Human-Level Autonomous Research via Chain-of-Evidence

    • Score verification, I1: the auditor reruns the agent's code on a gold evaluator to confirm that the reported score is reproducible.
    • Spec violation, I2: the system checks whether the agent bypassed the rules, for example by hard-coding answers or importing restricted data.
    • Reference verification, I3: every citation is cross-checked against global scholarly databases to detect hallucinations.
  20. 260AI / General

    AutoScientists: Self-Organizing Agent Teams for Long-Running Scientific Experimentation

    • The shared forum (F) is a space where agents post structured discussions, hypothesize why specific changes worked, and critique the proposals of other agents.
    • Removing the analyst led to a substantial drop in proposal quality because the experimental agents lacked strategic oversight to avoid redundant or weakly justified attempts.
    • Removing inter-agent feedback increased the rate of false starts, where the system pursued hypotheses that other agents could easily identify as flawed.
  21. 259Computer Vision

    SpatialBench: Is Your Spatial Foundation Model an All-Round Player?

    • DENSE focuses on long-time-series video sequences and feeds in nearly every frame up to the 500-frame limit.
    • For robotics, use models trained on DA-Next-5M or similar first-person datasets; standard indoor and outdoor foundation models are likely to fail on wrist-mounted manipulation tasks.
    • For AR and VR, streaming or chunk-based models are preferred because they must handle long sessions without exceeding the memory limits of mobile devices or headsets.
  22. 258Research

    The sum-product conjecture is false for real numbers

    • A counterexample to the sum-product conjecture over the reals (1.1), constructing sets A with both |A+A| and |AA| at most |A|^{2-c}.
    • A higher-dimensional Balog-Wooley-type structure using algebraic integers from totally real number fields.
    • A counterexample to the many sums and products conjecture as well: max(|kA|, |A^(k)|) ≤ |A|^{C log k / log log k}.
    • Variants over various rings, including p-adics, the finite field Fp, and the positive-characteristic function field Fq((t)).
    • New lower bounds for the number of solutions to the linear equation x1+...+xk=1 in multiplicative groups, along with applications to unit equations.
    • GPT-5.5 Pro was used for initial exploration, but the final proof was generated mostly by humans, inspired by the OpenAI counterexample to the unit-distance conjecture.
  23. 257Computer Vision

    R³: 3D Reconstruction via Relative Regression

    • Scale stability: The relative motion between two adjacent frames, the baseline, is usually small and predictable, whereas the distance from the starting point of a long trajectory is not.
    • Origin independence: Any frame in the sequence can serve as the reference for another frame. The system is no longer chained to the first observation.
    • Novelty: If the visual features of a new frame differ enough from those already stored, that frame is added to the bank.
  24. 256Machine Learning

    Recursive Flow Matching

    • Tradeoff removal: while most models force a choice between speed and accuracy, RecFM uses recursive training to improve both at once.
    • Explicit scale alignment: unlike consistency models that distill a student from a teacher, RecFM uses a single network and enforces multi-scale alignment internally, which provides a more robust gradient signal during training.
    • Physical fidelity: by straightening trajectories, RecFM preserves high-frequency details, such as waves and vortices, that are usually lost when generative models are accelerated.
  25. 255Machine Learning

    Scaling World-Model Reinforcement Learning Through Diffusion Policy Optimization

    • Identify the structural mismatch between exploration and value learning as the key bottleneck in world-model RL.
    • Recast policy optimization as a diffusion process on the latent world model to unify exploration and policy optimization.
    • Anchor the policy to the behavior distribution with a dataset-induced implicit energy function, namely a KL trust region.
    • Correct the score field with cumulative reward from imagined trajectories so it converges toward the optimal Gibbs policy.
    • Show consistent gains across multi-task offline pretraining, online, and offline-to-online settings.
    • Demonstrate scalability through monotonic performance improvements as model capacity increases.
  26. 254Computer Vision

    Gamma-World: Generative Multi-Agent World Modeling Beyond Two Players

    • The hub token attends to all agent tokens and to other hub tokens.
    • Bidirectional teacher training: the model is first trained as a standard diffusion model with access to the full temporal sequence. This teacher learns the full distribution of multi-agent interaction with high fidelity.
    • Causal student training: to enable real-time rollouts, the student model is trained with a causal structure. Unlike the teacher, the student sees only the past and the present, and it uses a Sparse Hub Attention mask plus noise levels sampled independently for each frame block.
  27. 253Computer Vision

    From Pixels to Words -- Towards Native One-Vision Models at Scale

    • For causal dependence, token ordering follows the standard sequential order when j is greater than or equal to i.
  28. 252AI / General

    MUSE-Autoskill: Self-Evolving Agents via Skill Creation, Memory, Management, and Evaluation

    • Testing is the unit test used to verify that a skill works correctly before it is allowed into the Skill Bank.
    • Memory is a dedicated file, .memory.md, that stores observations and lessons from previous runs.
    • At Level 1, single-node compression, when a particular tool output is extremely large, for example a 20,000-token log file, the method replaces it with a concise summary while leaving the surrounding conversation intact.
  29. 251Information Retrieval

    Your Embedding Model is SMARTer Than You Think

    • In efficiency terms, developers can upgrade existing retrieval systems to support multiple vectors without reindexing the entire database or performing expensive retraining.
    • In accuracy terms, SMART points toward a universal retrieval model that works well both for global tasks such as image classification and for local tasks such as finding a specific sentence in a 100-page manual.
  30. 250LLMs / NLP

    DVAO: Dynamic Variance-adaptive Advantage Optimization for Multi-reward Reinforcement Learning

    • In terms of usability, the algorithm adaptively finds the optimal balance from data, reducing the need for practitioners to manually tune reward weights.
    • In terms of stability, it preserves the efficiency of the GRPO framework while adding the theoretical stability needed to avoid size explosion.
    • In terms of synergy, cross-objective regularization ensures that the model does not optimize only the easiest reward while sacrificing harder and more important goals such as reasoning accuracy.

From research to product use

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

View technology