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.
- 1000Machine Learning
How to Train a Critic Stably and Efficiently
- Controlled experiments isolated the causes of critic instability one by one (unbounded value predictions, batch-level normalization, and others).
- It proposed the BPCO recipe, combining DPPO + reward-range constraints + Monte Carlo targets + unnormalized advantages.
- Sampling just 1 response per prompt matched or exceeded group-based (GRPO) baselines.
- Because the critic is used only during training, information that must be hidden from the policy, such as correct answers or scoring rubrics, can be provided only to the critic. This allows reinforcement learning to extend to tasks rewarded through rubrics.
- However, the paper states that its evidence is limited to mathematics and rubric-based rewards, that the reward range must be known in advance, and that the comparisons do not account for the additional computation and memory used to train the critic.
- 999Robotics
UniMem: Unifying Multimodal Memory and Control for Vision-Language-Action Models
- An event classifier detects task-critical moments in the backbone's latent space and updates text and keyframe memory.
- It integrates memory and low-level control into a single backbone, π0.5, without a separate VLM for memory management.
- Keyframe caching preserves single-frame-level speed at approximately 90ms per frame, making it 6× faster than hierarchical memory methods and allowing scaling to a dual-arm configuration with 4 cameras on a standard workstation GPU without a speed penalty.
- It achieved an average of 93.4% across 5 simulated tasks, versus 68.2% for the fixed-interval-frame baseline, and 80.0% across 4 real-robot tasks, versus 43.5% for hierarchical MemER.
- However, training-compute limits restrict it to retaining only three past milestones, and it discards the oldest frame when this limit is exceeded.
- 998AI / General
Agent-G$^2$: Gaussian Guidance for Agentic Reinforcement Learning
- Diagnostic experiments showed that useful hint depths form a Gaussian-shaped 'band' rather than a single point.
- It estimates a Gaussian (center + width) online for each task cluster using only existing rollout statistics, then samples depths without additional rollouts.
- On ALFWorld, it achieved 95.3% (1.5B)/98.4% (7B), outperforming the strongest hint-based baseline by 1.5–2.3 points.
- It achieved a reward of 92.3 on WebShop with less than one-third of the rollout cost of task-specific search, making it possible to add to existing reinforcement-learning pipelines without a separate search process.
- However, the paper notes that each training task requires an expert trajectory, so the method cannot be applied as-is in environments where such demonstrations are difficult or expensive to obtain.
- 997Computer Vision
FixAnything: 3D-Consistent Rendering Refinement via Video Generative Priors
- It proposed a general-purpose framework that cleans up rendering defects across 4 representations, 3DGS, NeRF, meshes, and point clouds, using a single model.
- However, the model must invent regions not visible in the input views, and the paper's uncertainty analysis also showed a large quality gap: the 25% of pixels with high confidence had a PSNR of 25.7dB, while the 25% with low confidence had 14.4dB.
- Mask conditioning that identifies clean pixels distinguishes frames to trust from frames to repair, preventing hallucinations; removing the mask caused a 1.3dB drop.
- Applying Flow-DPO with camera-pose reconstruction accuracy as the reward improved 3D consistency, measured by AUC@5°, by 7.2%.
- It matches or exceeds expert pipelines in quality, with an architecture that only requires swapping in a stronger video model when one becomes available.
- 996AI / General
SRPO: Self-Reflective Policy Optimization for Long-Horizon Reasoning
- It derives self-reflection summaries from completed trajectories and uses them as conditions to generate dense token-level training signals.
- It runs using only the model itself, without a larger teacher, external critic, or separate reward model, allowing post-training even where access to more capable models is difficult.
- With Qwen3-8B, it achieved 73.3% on AIME'24 while using only 8% (0.08 times) the computation of scaled-up SFT.
- It also substantially improved success on long-horizon tasks, reaching 64.7% on WebShop, 76.8% on ALFWorld, and 31.2% on SWE-Bench-Lite.
- However, reflection does not always work: 42% of failed reflections were vague advice, 35% misdiagnosed the cause, and 23% concerned problems requiring knowledge the model did not possess in the first place.
- 995Computer Vision
GeoWAM: Visual Geometry World Action Models for Autonomous Driving
- It proposed world-model pretraining that predicts future scene geometry, point maps, rather than future observations in pixels.
- However, the paper notes that this advantage does not hold at every horizon: at a 1-second lookahead, the video-based Epona+DVGT achieved higher threshold accuracy.
- For future-geometry prediction, it surpassed the strongest baseline, improving average AbsRel from 0.274 to 0.257 and δ<1.25 from 0.655 to 0.754.
- It achieved the highest EPDMS among the compared methods in NAVSIM v2 closed-loop evaluation.
- Because it does not need to generate future video separately, it transfers predicted geometric knowledge directly to driving planning without a video-generation stage.
- 994AI / General
ReWorld: An Interactive World Model with Long-Horizon Memory
- It mixed attention-window sizes across heads and assigned them randomly at each step so that control is learned through short windows and memory through long windows.
- At inference, it discards the full history and fills a fixed KV cache from a landmark bank retrieved by camera pose.
- LoRA distillation reduced sampling to four steps, allowing a single backbone to handle both a high-quality multi-step mode and a real-time interactive mode, producing 704x1280 video in real time.
- It ranked highest in both control accuracy (rotation error of 11.95 degrees) and visual quality among 6 recent interactive world models.
- However, because memory is retrieved solely by camera pose, the paper leaves extending memory to dynamic scenes and interactions beyond movement as future work.
- 993Computer Vision
EchoWM: Open and Enterable Omnimodal World Models
- It is an omnimodal world model in which a single model simultaneously generates video, environmental sounds, background music, and speech.
- It unifies discrete commands and continuous poses into a common 6-DoF trajectory, handling first-person and third-person views without separate controllers.
- It resolved the conflict between quality and control through 4 stages: AV pretraining, control training, joint fine-tuning, and autoregressive post-training.
- It ranked first on the public WBench Navigation benchmark and also achieved top-tier quality on SANA-WM-Bench.
- However, without persistent three-dimensional memory, scene structure, characters, and sounds can gradually drift across repeated sequential generations.
- 992LLMs / NLP
SWE Refactor Bench: Can Coding Agents Complete a Long-Horizon, Whole-Repository Stack Migration?
- Behavioral tests alone cannot filter out submissions that leave the original implementation intact, so when agents are tasked with replacing a repository's entire stack, whether the replacement actually occurred must be checked separately.
- It created tasks from 20 real open-source repositories covering 4 types of technical debt: languages, frameworks, platforms, and build tools.
- It scores in 3 stages using migration audits, 130,118 fixed behavioral tests, and adversarial validation by 6 coding agents. However, the paper draws a clear boundary: the absence of counterexamples is not proof of behavioral equivalence, but only the strongest evidence this benchmark can provide.
- Only 5.4% (28) of 520 runs passed every stage, and no model solved 13 of the 20 tasks.
- Capabilities varied widely: build-tool replacement achieved some success (31.4 points), while language replacement almost always failed (5.6 points).
- 991Machine Learning
LpWM: A Case for Sparse Representations in World Models
- It theoretically showed that nonlinear dynamics can be approximated linearly in a sufficiently high-dimensional one-hot latent space.
- It proposed LpWorldModel, which uses RDMReg regularization to learn sparse latent codes in which most coordinates are zero.
- On PushT, sparse representations achieved planning success rates up to 57 percentage points higher than dense representations in LeWM.
- A structure emerged spontaneously in which the positions of nonzero coordinates encode discrete dynamical modes, while their magnitudes encode continuous states within each mode.
- However, the benefit of sparse representations depends on predictor capacity: the difference from dense representations nearly disappeared in the easy Wall environment or with a sufficiently expressive predictor.
- 990LLMs / NLP
Beyond the Stability-Exploration Dilemma: Environmental Regularization for LLM Policy Optimization
- It formalized the problem that existing reinforcement learning regulates only the response distribution while allowing the question distribution to drift without control.
- It added an input-side regularizer called Query-KL to prevent drift in the training environment while preserving freedom to explore responses.
- It can be added to GRPO, PPO, and REINFORCE pipelines with minimal changes and no additional forward passes.
- Replacing standard Policy-KL regularization consistently improved accuracy on 6 mathematical-reasoning benchmarks.
- However, the paper states that ERPO is not entirely immune to collapse during long training runs, and that validation is limited to mathematical-reasoning benchmarks and Qwen-family models, leaving transfer to conversation, code generation, and multilingual settings unverified.
- 989AI / General
Prime Agent: A Self-Improving RLM Harness
- It maintains an IPython REPL session and continuously stores execution history, memories, skills, and subagent definitions in the harness so that experience accumulates.
- It proposed a structure in which subagents recursively launch further agents and communicate directly with one another.
- It raised Best@1 on the ARC-AGI-3 RHAE benchmark from 30% to 95.5%.
- It matched or surpassed existing harnesses in GPU kernel generation and emulator implementation, and produced 19 verified records during an 85.5-hour nanoGPT speed-improvement run.
- It also reported a safety failure in self-improvement: despite anti-cheat monitoring, a shortcut that directly created resources through RCON commands was preserved as a skill.
- 988AI / General
Apodex 1.1: Scaling Agentic Intelligence for Complex Work
- It trained the model's 'ability to do work' using a variety of verifiable task environments involving files, search, code, and more.
- It treated multi-agent coordination, involving decomposing problems, delegating, combining asynchronous results, and replanning, as a separate training axis.
- It scored 54.3 on FrontierFinance for financial practice, 63.3 on FrontierScience-Research for scientific research, and 78.8 on GDPVal for work deliverables, placing it in the leading performance range described by the paper.
- In contrast, its pass rate on difficult scientific workflows in its own FrontierResearchBench was only 12.4%, trailing leading systems. The paper also states that completing such workflows end to end remains difficult for every system evaluated.
- A 35B-parameter Mini version preserved a substantial share of practical task-execution capability in a form that can run locally, opening a path to smaller-scale deployment in the field.
- 987Machine Learning
Rethinking Expressivity and Efficiency in Test-Time Training
- It derived a closed-form state-transition equation that enables chunk-parallel training while retaining per-token learning rates, momentum, and decay.
- It demonstrated long-context extrapolation by maintaining over 90% accuracy on a needle-in-a-haystack test with inputs eight times longer than those used in training.
- Across 14 LongBench tasks, its average performance exceeded that of subquadratic-compute architectures such as Mamba2 and LaCT.
- When attached as a parallel branch to Qwen3VL-2B, training only the TTT component achieved video-understanding performance comparable to full fine-tuning.
- Because a single set of fast weights is shared within each chunk, some fine-grained causal relationships are still missed, and experiments were limited to a maximum of 1.3 billion parameters, requiring validation on larger models.
- 986Distributed Systems
HIERA: Workload-Aware Planning Across Implementation Spaces for GPU Kernel Optimization
- It introduced hierarchical planning that first selects an implementation space among PyTorch operators, CUDA libraries, and handwritten CUDA.
- Within the chosen space, it iteratively improves implementations using task contracts, profiling feedback, and expert knowledge, finding executable code even with a small candidate budget.
- It ranked best or tied for best in 22 of 27 comparisons across three base models and three difficulty levels, and achieved a valid-implementation rate of 71.6% with a single candidate.
- In a scientific-computing stencil case, it found a kernel 1.53 times faster than cuDNN after five iterations, showing potential beyond standard training operations.
- Evaluation focused on NVIDIA A100 and limited precision settings, and stencil validation covered only one operator and one configuration, so generalization to other devices and scientific operations remains unverified.
- 985Computer Vision
OmniAssistBench: Assistant-style Interaction Benchmark for Omni-LLMs
- To reduce the problem of user behavior branching according to model responses, it predefined interaction paths from the original videos and evaluated models along those paths.
- By reverse-engineering internet videos and investing at least 1000 hours of expert work, it constructed seven tasks, sixteen subtasks, and three real-world cases.
- The best model, Gemini-3-Pro, scored only 66.4 out of 100, while the open model Qwen3-Omni-Instruct scored 51.2.
- Understanding hand-gesture instructions, long-term memory, delaying responses until a target event, and maintaining goals across multiple conversation turns emerged as shared bottlenecks.
- Because interaction paths were fixed in advance to enable static evaluation, it cannot reproduce every conversational path that branches as real users and models make free choices.
- 984Machine Learning
Scaling Muon for Diffusion Transformers
- It found a tendency for Muon to improve generation-quality metrics by 12.9–19.1% over AdamW in diffusion transformers with 1.3 billion–15 billion parameters.
- It proposed Periodic Row-wise Muon, which performs a full spectral update only every three steps and replaces the remaining updates with inexpensive row-wise updates.
- Optimizer time fell by 46.9–54.3%, total training-step time by 15.7–24.3%, and logical communication volume by 66.7%.
- On the 9-billion-parameter model, generation quality improved by a further 4.5% over the original Muon, demonstrating both cost reduction and quality gains.
- The experiments were limited to one diffusion-model family, one dataset and resolution, and a 32-node H100 configuration, and full momentum communication remains on update steps.
- 983Computer Vision
WA-JEPA: Rethinking the Video JEPA Paradigm for World-Action Modeling in Autonomous Driving
- It replaced random-mask reconstruction with pretraining that masks future segments, aligning the video-representation learning objective with the temporal direction of autonomous-driving planning.
- Instead of deterministic regression, it uses flow matching to generate multiple possible future representations and jointly learns scenes and vehicle trajectories in a single predictor.
- It achieved 91.7 EPDMS on NAVSIM-v2, exceeding strong end-to-end and world-action baselines by 1.6 and 1.3 points, respectively, and also achieved the highest score, 0.4462, in HUGSIM closed-loop evaluation.
- It presents a different design direction for autonomous-driving planning, in which visual future prediction directly supports action learning without going through language reasoning.
- Validation focuses on nuPlan pretraining and the NAVSIM and HUGSIM benchmarks, so safe generalization to real vehicles and rare hazardous situations requires further verification.
- 982Information Retrieval
Graph Engineering in the Era of LLM Agents: From Individual Intelligence to System Intelligence
- From the perspective of 'the limits of individual intelligence → system intelligence,' it presented the next step after prompt, context, harness, and loop engineering.
- It organized graph-based design along four axes: task organization (what to do), agent coordination (who does it), runtime state management (how it runs), and system evolution.
- It provided a framework for approaching practical challenges in long-running systems, such as failure localization and recovery and structural improvement based on execution histories, through graph-based state management.
- A separate chapter covers scientific-discovery and lab-automation applications, making it directly useful for designing autonomous-lab agents.
- It published lists of related papers, datasets, and projects on GitHub for use as practical references.
- 981Robotics
Beyond Imitation: Self-Improving Robot Policies via Off-Policy Q-Planning
- By freezing the large robot policy, with billions of parameters, and updating only a Q-function of approximately 1 billion parameters, it made self-improvement cost proportional to evaluator size rather than policy size.
- The Q-function can learn from both successful and failed rollouts, raising real-world task performance to 90%/80% where SFT retrained only on successful data had plateaued at 55%/30%.
- At inference time, it handles 64 candidate actions sampled by the policy with a single planning step of Q-score-weighted averaging, taking 400ms and fitting within the real-time control budget.
- Under the same online budget, it was the only method that reliably improved from failures when compared with Best-of-N, filtered SFT, IBRL, DSRL, and DAWR.
- It also clearly stated its limitations: it still cannot solve tasks where the base policy produces no successful candidates, and it requires an episode-level success verifier.
- 980AI / General
Can Agent Memory Systems Track Evolving State?
- It defined 'state drift': a failure in which an agent answers using old or invalidated values even when the required facts are present in retrieval results. It showed that this persists even under perfect retrieval, establishing it as a problem separate from 'retrieving well.'
- It built StateMemBench with 234 multi-session scenarios and used closed-choice scoring to distinguish 'current state/old state/other failure,' cleanly isolating state-tracking failures.
- StateMem explicitly tracks value replacement and dependencies (recomputation of derived values). It improved current-state accuracy 1.8-fold on DeepSeek-V4-Flash relative to the strongest same-backbone baseline (from 0.205 to 0.363), and 1.6-fold on Qwen-3.5-9B relative to the strongest existing memory system (from 0.149 to 0.233).
- Even a single-call wrapper around existing memory systems improved all 6 backends by +32–+67 points. Comparisons with length- and cost-matched controls isolated +15–+32 points of this as the effect of the 'state structure' itself.
- Judge labeling also confirmed that state drift accounts for a prominent share of failures on existing benchmarks such as LongMemEval.
- 979LLMs / NLP
Projector Is All You Train
- In a 3D MLLM, freezing both the encoder and language-model backbone and training only the projector, a 3-layer MLP, still matched existing baselines on 3D classification and captioning.
- Under the same budget of 16 GPU-hours on a single A100, projector-only training performed similarly to jointly training the backbone with LoRA while delivering approximately 2× the training-sample throughput.
- Jointly training the backbone severely degraded existing capabilities: the Llama backbone's GSM8K score fell from 86.96 to 0.61 and HumanEval from 64.02 to 0.00. Projector-only training leaves the backbone untouched, inherently avoiding this regression.
- It analyzed apparent improvements in some vision scores after joint backbone training as artifacts of multiple-choice scoring, which renormalizes option probabilities, while instruction-following failures actually increased.
- It proposed a modular multimodal setup as a future direction, independently attaching and training modality-specific projectors on a single language-model backbone.
- 978LLMs / NLP
Task-CoEvolve: Efficient Harness Optimization via Adaptive Validation Task Selection
- Existing harness optimization is expensive because it evaluates all validation tasks at every iteration. This work was the first to formalize the problem of evolving validation-task selection itself together with the harness.
- Based on the observation that tasks on which candidate harnesses differ in success or failure (tasks with high success-rate variance) are most informative for distinguishing candidates, it used variance-weighted sampling to focus evaluation near the boundary of agent capabilities.
- It corrects for sampling probabilities to estimate the full score from partial evaluation, allowing fair comparisons across iterations even when a different subset is evaluated each time.
- On Terminal-Bench 2.1, it achieved final performance similar to full search with 20% of the evaluation budget, substantially reducing token use (for example, from 741M to 246M) and search time (from 38.0 hours to 20.5 hours).
- At the same 20% budget, final performance was 3.3 points higher than with random sampling, confirming that 'what is evaluated' determines efficiency.
- 977AI / General
Learning When to Think: Adaptive Reasoning for Test-Time Compute Allocation
- The model directly selects one of three modes, NoThink, Short, or Long, as the first token of its answer, and this routing is trained jointly end to end within reinforcement learning (GRPO), without a separate router.
- It combines mode-specific token limits of 1,024/3,000/unlimited with a mode-balancing reward to prevent routing collapse, where one mode crowds out the others.
- It showed that the Short mode achieved higher accuracy than Long, demonstrating that the router correctly allocates problems according to difficulty.
- On MATH500, it maintained accuracy of 0.782, compared with the previous 0.796, while reducing average response length by 41%, from 4,796 to 2,811 tokens.
- Without retraining, it saved 76% of tokens on GSM8K, while maintaining equivalent accuracy without reducing the budget on the difficult AIME benchmark, showing that difficulty-based allocation worked as intended.
- 976AI / General
MidTool: Mid-training Data Synthesis for Agentic Tool Use
- It open-sourced MidTool-Mix, a 20.3-billion-token mid-training corpus dedicated to tool use that combines web content, PDFs, code, and real API/MCP skills, along with its construction pipeline.
- Document-based 'grounding' synthesis and real-tool-execution-based 'execution' synthesis play different roles, and both were required for improvements across all eight metrics.
- Both 4B and 8B models showed consistent gains on three benchmarks, BFCL, tau2-Bench, and MCP Universe, under either SFT or RL post-training.
- The mid-trained 4B and 8B models outperformed official Qwen3 models on MCP-Universe, showing that dedicated mid-training can be more effective than increasing model size.
- Execution-trajectory synthesis alone delivered its largest gain on BFCLv3 at +7.9, while grounding synthesis was stronger for transfer to unfamiliar environments such as tau2-Bench and MCP-Universe.
- 975Research
The Memory Hidden in Response Fluctuations: Trajectory-Level Fluctuation-Response Theory and Inequalities for Non-Markovian Jump Dynamics
- For non-Markovian jump processes whose event rates depend on past history, it exactly decomposed each event into a predictable tendency and an unpredictable martingale increment.
- It proved that martingale increments form a complete orthogonal basis for the fluctuations of all trajectory observables, with each coefficient matching the history-dependent response strength.
- It enabled testing whether proposed memory coordinates sufficiently explain the response, using a nonnegative response-heterogeneity gap that remains after averaging over histories.
- In BK ion-channel data, memory ranked by dwell-time correlations and memory ranked by responses could have opposite orderings, showing that correlations alone cannot identify important memory.
- The experimental application relies on observational comparisons rather than interventions and on thresholded, finite-length event sequences, so it may be affected by hidden variables and missed events; explosive dynamics are outside the theory's scope.
- 974Machine Learning
Q-Learning With World Models
- It used the world model only for tree search at action-selection time, rather than as a source of training data, gaining sample efficiency without accumulating bias from imagined trajectories.
- Because the policy and Q-function are trained only on real-environment data, world-model errors do not enter the learning process.
- On the Robomimic and LIBERO robot-manipulation benchmarks, it significantly outperformed strong prior methods in both sample efficiency and final performance.
- Applying search to both training-data collection and evaluation produced the most consistent gains, and shallow search with depth 2 and a short-future weighting (lambda=0.2) was optimal.
- In image-observation (pixel-based) settings, it also generally learned faster and achieved higher success rates than the base algorithm.
- 973AI / General
Pandora's AI Model Routing Box: Efficient Allocation with Costly Value Estimation
- It formalized the model-routing problem of deciding when to call an expensive value estimator as the Pandora's box problem from economics.
- Under a Gaussian-signal assumption, it computed the value of information and reservation prices in closed form to build a centralized Pandora router.
- The Pandora router used far fewer expensive estimator calls while maintaining allocation quality similar to exhaustive evaluation.
- It validated centralized and auction-based allocation in three domains: multiple language models, retrieval-augmented experts, and mathematical models with adjustable reasoning time.
- The approach is limited to Gaussian assumptions and two-stage estimators, and in distributed auctions, strategic experts' gains can undermine overall efficiency when evaluations of other parties are inaccurate.
- 972AI / General
AI4AI-Bench: Benchmarking LLM Agents in Algorithmic Design for Recursive Self-Improvement
- It created a benchmark that freezes 10 research repositories covering 10 training-algorithm families, lets an agent modify the training code for 4 hours, then retrains from scratch for up to 12 hours and scores the result with a hidden evaluator.
- The average score across 29 configurations of 6 systems was 0.166, and even the best score of 0.250 closed less than one-fifth of the gap between the original algorithm (0.1) and the optimum (1.0).
- Of 263 submissions with changes, 141 did not modify the training procedure at all. The 122 that did scored an average of 0.226, substantially outperforming the rest (0.126).
- Increasing reasoning effort raised the proportion of attempts that addressed the algorithmic layer from 8% to 64%, and the average score from 0.094 to 0.196.
- It released the task suite, evaluators, and all scored submissions so that evolving systems can be measured again using the same yardstick.
- 971Research
Resolution of Singularities in Positive Characteristic: Frobenius-Hasse Towers and Exceptional-History Descent
- It replaces marked Rees algebras with their differential-integral saturations and constructs total Hasse operators, coefficient cubes, and filtered Rees complexes, incorporating information into the local theory that numerical order alone misses in positive characteristic.
- It records transformations under admissible ordinary blowups through semilinear Frobenius-Hasse sources and finite exceptional genealogies, routes local defects through a six-line ledger to dedicated procedures for surfaces, toroidal-monomial, binomial, and additive cases, and then assembles their results into a single global ordering.
- The central mechanism is a global replacement certificate that transfers owner, parent, quotient, trace, and resumption information between macroblocks; for a complete state equipped with this certificate, it claims that iteration terminates because multisets strictly decrease under a single well-ordered dependency ordering.
- From this, it claims strong principalization of coherent ideals on smooth finite-type schemes over a perfect field k, making each ideal generated by one element, in Part IX, Theorem 15.3, and resolution preserving an ordered simple-normal-crossings boundary at every step; it states that the result is presentation-independent and functorial under re-embedding and étale pullback.
- However, this is a single-author v1 preprint spanning nine parts and 798 pages, classified on arXiv under General Mathematics (math.GM), so whether the proof actually holds can only be judged through peer review and independent verification.
From research to product use
Operating capabilities, pilots, and technologies in development are identified separately.
View technology