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

    PHRBench: A Behavioral Evaluation of Post-Hallucination Reasoning in LLMs

    • Final-answer correctness alone cannot distinguish compliance, avoidance, and correction, so they built a framework that independently classifies each response trajectory into three behaviors (Hallucination Compliance / Avoidance / Heuristic Correction).
    • Hallucinated context reduced accuracy by 7.7 percentage points on average, and across several model families they found a scaling tension: larger models become more vulnerable while also correcting more often.
    • Successful recovery (correction plus reaching the correct answer) is rare, and recovered trajectories show a signature of more frequent belief updates.
    • Using only prompt-level structural and semantic features, a lightweight predictor anticipated successful recovery before generation, achieving AUROC 0.847 and accuracy 0.863.
  2. 1187LLMs / NLP

    Before They Can Solve: Predicting Post-Training Coding-Agent Performance from Base Models

    • They built a framework that replays successful trajectories to find the decisive step T* where tests first flip from failing to passing, and probes the base model directly at that point.
    • The three probes (Decisive-Action BPB, Patch MCQ, prefix-conditioned pass@K) showed strong rank agreement with post-trained SWE-bench Verified pass@1, at Spearman rho 0.964, 0.903, and 0.988 respectively.
    • Existing non-agentic coding benchmarks (HumanEval and others) were unstable, with correlations from -0.39 to 0.83, confirming they are ill-suited for base model selection.
    • These probes require only a benchmark's successful trajectories and its verifier, so future agentic benchmarks can be repurposed as base-model evaluations.
  3. 1184AI Agents

    BrickBench: Evaluating Agentic Brick Design

    • The best coding agent satisfied about 95% of prompt semantic requirements and produced physically valid assemblies for nearly every prompt.
    • Removing the BrickAgent tool environment crashed valid-assembly rates from 100% to 40% for GPT-6 Astra and to under 1% for GPT-5.6 Luna, showing that grounded validation tools are the key to success.
    • General coding agents outperformed specialized LEGO-generation models (BrickNet-14B, BrickGPT), though at 600 to 6800 times the cost.
    • Human raters chose the human design in 323 of 360 comparisons (about 90%), showing that meeting requirements and designing well are different problems.
    • They computed the design-quality ELO metric with a VLM judge and validated its ranking agreement with human preferences (Kendall tau = 0.89).
  4. 1183AI / General

    Recursive Self-Improvement through Multi-Agent Self-Supervision

    • By alternating workflow optimization with retraining on self-generated trajectories, the method achieves recursive bootstrapping where the improved model becomes a better optimizer and evaluator.
    • In just two cycles, performance per output token improved 1.2-1.6x across four research benchmarks.
    • Self-evaluation accuracy rose from 73% to 93%, showing that evaluation ability improves alongside task solving.
    • Training on multi-agent trajectories was more efficient than single-agent training that used 1.4x more tokens.
    • Optimized workflows showed more role-specific information handoffs and routing, supporting the information-flow optimization hypothesis.
  5. 1182Computer Vision

    AgentGarten: Code Worlds for Evolving Agents

    • A division of labor where the engine handles state and rules while a neural renderer handles only visuals lets new virtual worlds be built entirely in code without 3D assets.
    • The Adversarial Forcing technique distills a pretrained video model into a real-time renderer, keeping visual quality from collapsing over long rollouts.
    • Agents learned strategies like shelter building in just 4 rounds, millions of times fewer than conventional reinforcement learning.
    • Agents distilled their experience into written playbooks that subsequent agents inherited and refined, producing evolution across generations.
    • Coding agents can automatically generate and extend new worlds from a single image or text description, securing environment scalability.
  6. 1181LLMs / NLP

    MiMo-V2.6: Scaling Reinforcement Learning Towards Self-Improvement

    • Asynchronous training that consumes 1,568 samples and 2.7-3.7B tokens per step handled long tasks with context lengths up to 1M tokens.
    • Environments across coding, general workflows, visual tasks, and cybersecurity were mixed with diverse agent harnesses to improve generalization.
    • Instead of binary pass/fail grading, groupwise grading that compares answers within a group produced more precise reward signals.
    • Freezing the MoE router and building multi-layer defenses against reward hacking kept large-scale RL training stable.
    • Training dynamics, RL environments, and the RL framework were fully open-sourced, creating a reproducible baseline for large-scale agentic RL research.
  7. 1180Agents

    RECAST: Learning to Compute the Right Context through Adaptive Evidence Routing

    • They formalized the problem of deriving evidence through filtering, aggregation, and computation rather than mere retrieval as a sequential decision process.
    • RouterLM alternates between calling primitive operations and synthesizing custom code to build evidence, trained with SFT and GRPO.
    • It achieved a 75.6% mean success rate across six heterogeneous benchmarks, 15.9 percentage points above the strongest baseline.
    • The compact 9B trained model outperformed a training-free Gemini 3.5 Flash router by 5.0 percentage points.
    • On three unseen benchmarks it stayed 15.0 percentage points ahead on average, demonstrating zero-shot generalization.
  8. 1179Robotics

    EmbodiedRSI: Active Continual Robot Learning Through Hypothesis-Guided Co-Evolution

    • Value-of-Information-based experiment selection reduced the number of robot trials and improved exploration efficiency.
    • They built a co-evolution structure that evaluates code and skill hypotheses separately and then measures the gain of running them jointly.
    • It reached 77.0% overall and 71.3% on Composite-Unseen in RoboCasa365, far ahead of the best baseline at 40.1%.
    • It recorded 86.8% success on LIBERO-Pro and achieved 71.3% when transferring zero-shot from simulation to a real robot.
    • They proposed a three-level hierarchical memory of execution records, hypotheses, and distilled knowledge that is reused for selecting the next experiment.
  9. 1177Agents

    Decoupling Exploration from Optimization in RLVR

    • They confirmed that adding a novelty bonus directly to RLVR degrades general capabilities outside the supervised reward signal.
    • They proposed ExpDis, which separates an explorer model from a student model and distills only the correct solutions filtered from the explorer.
    • Across seven math benchmarks it beat DAPO in both average accuracy and pass@k under the same compute budget.
    • It showed continued gains as parallel explorers and repeated rounds were scaled independently.
  10. 1176Robotics

    SuperNav: An Agentic Navigation System for Any Task in Any Scene

    • It achieved generalization with no navigation-specific fine-tuning, simply by equipping a pretrained MLLM with a dedicated agent harness.
    • The model issues movement commands through a visual-point interface where it clicks the destination directly on an image, and revises decisions from execution feedback.
    • It reached 78.00% success on single-object navigation, 44 percentage points ahead of the strongest baseline UniNaVid at 34.00%.
    • Without any OVON training or adaptation it recorded a 73.33% success rate over 120 HM3D-OVON episodes.
    • It validated real-world applicability by deploying on an actual quadruped robot as well as in simulation.
  11. 1175Robotics

    Embodied Turing Machines: Stateful Code for Robot Recursive Self-Improvement

    • They proposed COAP, a new paradigm that controls robots with code alone, without any VLA or VLM.
    • Storing state directly in code variables made the basis for decisions transparent, and failure recovery by backtracking and retrying became flexible.
    • They designed a recursive self-improvement (RSI) loop where a coding agent (Opus 5.5 Max) repeatedly improves the code library without human intervention.
    • It achieved a 70.24% success rate on RoboDojo's 42 bimanual tasks with no model at test time, 38.9 percentage points above the previous best.
    • 83% of a new task's code was reused from the shared library, showing a structure where capabilities accumulate as tasks pile up.
  12. 1174Agents

    A Society of Researchers: Designing Institutions for Populations of Autonomous Research Agents

    • The authors argue that if thousands of agents are left unmanaged, they will form their own organization anyway (as shown by a real incident), so designers should provide the structure explicitly.
    • They transplanted the institutions of science directly into an agent society: principal investigator agents submit proposals to open calls, and independent review decides which ones receive compute budgets.
    • They proposed six design principles: give purposes not goals, govern through institutions, rule by allocation rather than assignment, keep diversity alive, make verification an institution, and let the society remember.
    • They actually ran a society of ten thousand agent researchers, and one lab found a way to reach the same quality with about 30% less compute.
    • Citing an existing analysis that only about 5% of 4,000 LLM-generated research ideas were not duplicates, they emphasized the need for diversity and verification institutions.
  13. 1173AI / General

    RoboJEPA: Scaling Robotic Latent World Models

    • They ran scaling experiments by training world models from 22M up to 8B parameters on data from 12 robot platforms (about 2.87M trajectories).
    • Prediction error decreased following a power-law as compute increased, and the law accurately extrapolated to larger scales than those measured.
    • Offline prediction error correlates strongly with real robot planning success rate, making it possible to gauge model quality without physical experiments.
    • Given only a single goal image, a real robot arm could zero-shot plan and carry out long-horizon tasks such as grasping and pick-and-place without any additional training.
    • The 8B-parameter model is the largest JEPA predictor built to date, and all checkpoints and code have been released.
  14. 1172Robotics

    Long-WAM: Scaling the Context of World-Action Models

    • Extending the visual history from 0 to 19.2 seconds raised manipulation success from 63.3% to 78.7%, but only for models pretrained autoregressively.
    • They used a two-stage approach: first pretrain a foundation model that predicts the future from the past on 10,000 hours of robot and egocentric video, then adapt it to robot actions.
    • Thanks to streaming encoding and low-precision quantization, an action chunk is generated in 107.4 ms even on a consumer GPU, enabling real-time control.
    • On the task of grasping and stacking cups on a moving conveyor, Long-WAM succeeded 95% of the time, while both comparison baselines failed all 20 trials.
    • Combined with an upstream planning model (GPT family), overall success rose from 31.4% to 54.4%, showing that good planning pays off only with a strong executor.
  15. 1171Machine Learning

    Optimal and Efficient Online Inverse Optimization

    • In a setting where the hidden linear criterion is learned only from the expert's observed choices, the algorithm achieves the optimal regret proportional to the square root of the dimension d.
    • The previous optimal algorithm required nearly exponential-time computation per round, and this paper presents the first polynomial-time version.
    • The key idea is a 'revocation' rule that undoes a metric update once the query point moves too far from where the update was made.
    • The algorithm is deterministic and guarantees optimal regret for every horizon T without any randomness.
  16. 1170Robotics

    QF3: Fast Flow RL with Filtered Q-Gradients

    • The critic's gradient is passed through a one-step prediction of the flow policy, directly improving the policy without costly differentiation through the sampler.
    • Learning is stabilized by a 'filter' that cuts off action dimensions where the gradient moves too far from the replay action.
    • A walking and 3-minute dance motion-tracking policy for the 29-DoF Unitree G1 humanoid was trained from scratch in simulation and transferred to real hardware without correction, a first for off-policy flow RL.
    • Training is 10x faster in wall-clock time than the recent on-policy method FPO++, and comparable to the classic TD3.
    • Fine-tuning a pretrained robot-arm policy made the bottle-gathering task finish episodes 22% faster while raising the success rate from 91% to 95%.
  17. 1169Machine Learning

    H-JEPA: End-to-End Learning of Hierarchical World Models for Visual Planning

    • The world model is stacked into three levels instead of one, with each level predicting the future at a different temporal stride (5/10/20 steps).
    • Higher levels discard fast-changing detail and keep only slowly varying, important state, learning representations that match abstract goals well.
    • On the visual maze-navigation task, the three-level structure raised the success rate from 18% to 73% over the flat single-level structure while using less planner compute.
    • The hierarchy emerged purely from prediction learning, with no human-provided reward and no pixel reconstruction.
    • With an inverse-dynamics auxiliary loss, hierarchy also improved planning fidelity on the real-robot video dataset DROID.
  18. 1168Machine Learning

    LiFT: Loop Flow Transformers

    • It draws a straight path from the model's initial estimate to the target, and trains each loop to hit a point-specific goal along that path.
    • The model keeps improving well beyond the number of loops it was trained with, so inference compute can be scaled freely at test time.
    • On ImageNet 256x256 it cut FID by 3.34 points while using about 60% fewer parameters and about 52% less inference compute.
    • It is a case of applying the test-time scaling idea to image generation at low cost.
  19. 1167Robotics

    Mulligan: Performance-Guided Data Collection for Efficient On-Robot Learning

    • They observed that 95% of failures concentrate in 25% of the initial states, so uniform collection wastes operator time.
    • By retrying failed states and filling in unexplored ones, the robot learned faster under the same collection budget.
    • Combining a value function that also learns from failures (HiL-IDQL+Mulligan) improved final real-task success by 10-34 percentage points.
    • They validated the results on 2,550 blinded held-out episodes for higher reliability.
  20. 1166Machine Learning

    Base Models Can Reason By Taking a Cue From Training Data

    • Fixing only the first two token cues raised Olmo-3-7B's MATH-500 accuracy from 42% to 78% (the RL version reaches 75%).
    • They showed that RL does not so much teach new abilities as increase the probability of existing reasoning cues appearing.
    • By causally editing the training data, they made 'chicken' work as a reasoning cue just like 'okay', proving the cue effect comes from the data.
    • In a safety case study, different cues elicited different refusal and compliance behaviors, with implications for safety evaluation.
  21. 1165Research

    Truly Subquadratic 3SUM and Truly Subcubic APSP via Triangles in Sparse Lopsided Graphs

    • For the first time in 50 years, 3SUM was solved polynomially faster, reducing O(n^2) to O(n^1.9992).
    • A single thin matrix multiplication algorithm speeds up many problems at once, including APSP and Exact Triangle.
    • The AI model Claude discovered the core algorithm, the human authors understood and extended it, and the proofs were verified in Lean 4.
    • Several hypotheses of fine-grained complexity theory are refuted, with major impact on lower-bound research.
  22. 1164safety

    Linguistic Loopholes in LLM Unlearning: From a 174-Language Benchmark to Coverage-Aware Unlearning

    • It built a cross-lingual unlearning benchmark spanning 174 language-script pairs and 25 paraphrase types to measure when forgetting spreads across languages.
    • It showed the surprising result that collecting individually strong languages does not reliably form a good source set, and proposed coverage-prediction-based COVER.
    • COVER needs only benign calibration data and access to the frozen model at deployment, reducing scarring without full multilingual retraining.
    • Across three model families and two forget sets it lowered residual access by 7.8-27.3% on average versus uniform selection, and the effect held on real low-resource news documents.
  23. 1163evaluation

    Cheap to Draw, Expensive to Trust: Certifying Test-Time Scaling Curves

    • It pointed out that only a confidence band covering all budget points at once protects the choice of how many samples to draw, and computed the cost of existing fixed designs (192,000 answers for 100 questions and 64 budgets).
    • Since about three quarters of the variance in selected-answer accuracy at budget 64 comes from differences between questions, an audit that revisits every question need not pay that cost.
    • It built a paired audit based on an exponential inequality for two independent draws, reaching the minimum cost up to a logarithmic factor with no pilot.
    • In a real MMLU-Pro study it certified the whole curve with 79,133 answers, within 0.6% of what a cost law fitted beforehand predicted.
  24. 1162efficiency

    Scaling Laws for Looped Mixture of Experts

    • Unlike prior work that studied recurrence (looping) and sparsity (MoE) separately, it combined both axes into a single law and predicted held-out loss more accurately.
    • It showed with data that the recurrence benefit saturates rather than growing indefinitely, and that having more experts sustains the benefit longer.
    • Sparsity delivers about 3x active-parameter efficiency, recurrence about 2x total-parameter efficiency on reasoning, and combining them pushes the performance frontier further.
    • At trillion-token scale with matched training compute, a looped MoE matched a non-looped MoE twice its size, giving a practical guide for memory and compute budgets.
  25. 1161memory

    MemLife: Curating and Reasoning over Long-Term Egocentric Video Memories

    • Instead of storing all video verbatim, it converted footage into first-person text episodes anchored on people and places, leaving memories in a form that is easy to find later.
    • It solved the problem of similar items competing in retrieval as memories pile up with a time-indexed agentic reader, improving performance without any training.
    • It beat the strongest training-free baseline by 4.6-12.0%, and optimizing the writer itself with reinforcement learning added another 2.7-5.0%.
    • The gains held across different writer and reader models, making it a general design not tied to a specific model.
  26. 1160robotics

    DynaHarness: A Dynamic Physical Harness for Self-Evolving Robot Agents

    • Instead of treating a failure as 'the robot was bad', it localized which part (planning, execution, or recovery) went wrong and fixed only that part.
    • It split the slow brain (planning) and the fast brain (monitoring) into two layers on different time scales, so ambiguous commands are refused and alternative actions are sought.
    • Before a fix is admitted, it must pass regression checks, preventing the risk of breaking previously working functions while repairing.
    • On 800 new LIBERO-Pro initial states it scored 75.2% versus 17.5% for the frozen policy, more than quadrupling performance with the harness alone and no retraining.
  27. 1159Machine Learning

    TACO: Ternary Absolute-max Column-wise One-sparse Optimizer for LLM Fine-Tuning

    • Nearly eliminated optimizer state by using a sparse geometry that updates only the sign of the largest-magnitude coordinate in each column.
    • Reduced optimizer state memory by 174x (27.7GB to 0.16GB) and peak training memory by 2.9x (80.6GB to 27.5GB) versus AdamW8bit (OPT-13B).
    • Achieved 94.22% accuracy on OPT-13B SST-2, close to Adam's 95.3%, while cutting memory from 254.8GB to 27.5GB.
    • Enabled full-parameter fine-tuning of 30-32B models on a single 80GB H100 GPU across multiple model families and tasks.
    • Unlike Muon, it shows little performance degradation when applied to AdamW-pretrained models.
  28. 1158AI Agents

    PivotOPD: Learning to Recover from Pivotal Mistakes in Multi-Turn Agents

    • Confirmed across three models (Qwen3 8B to 235B) that more than half of failed rollouts stem from a single early pivotal mistake.
    • Ran counterfactual experiments showing that correcting just the pivotal turn raises replayed success from 8% to 59%, and guiding only two turns after the mistake reaches 58%.
    • Combines preventive distillation (avoiding the mistake) and recovery distillation (recovering after it) with standard RL in a single PPO update.
    • Achieved +5.5% over the strongest baseline on ALFWorld with the Qwen3-1.7B student and ranked first on average among 13 baselines.
    • Transferred to another model family, raising the Nemotron-3.5 student's resolve rate on SWE-Bench Verified by +3.2%.
  29. 1157Research

    Cogentic: Multi-Agent Orchestration for Automated Proof Discovery

    • Solved open problems that single-shot generation cannot handle via an iterative prove-verify loop.
    • Accumulated confirmed intermediate results in a permanent ledger so long-horizon work keeps its progress.
    • Produced new results on five open problems in online learning, auction theory, and mechanism design, all independently verified by domain experts.
    • Used adversarial verifiers that start by assuming the proof is wrong, catching flaws in drafts.
    • Runs on a relatively low inference budget of roughly O(100) to O(1000) model calls per problem.
  30. 1156AI Agents

    Learning from Research: Toward Lifelong Agent Harness Evolution

    • Went beyond fixing failures from execution traces by having the agent directly draw improvement ideas from research papers.
    • Split the harness into tool, context, skill, memory, and workflow modules, and ran paper-guided exploration per module.
    • Raised task goal completion on AppWorld Challenge from 49.6% to 63.6% and scenario goal completion from 28.3% to 44.8%.
    • Raised GPT-5.4-mini pass1 on tau2-Bench Telecom from 72.7% to 81.9%.
    • Built a lifelong evolution structure that repeats improvement whenever new papers arrive, using a genetic algorithm.

From research to product use

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

View technology