HDATF
简体中文
开始交流
菜单

论文档案库

按编号从大到小列出全部收录论文及摘要。

收录论文 1,430资料更新日期 Research Monitoring基准测试
  1. 1135Computer VisionarXiv:2609.35767

    Learning Native Reflection in Unified Models with Interleaved Reinforcement Learning

    • Trained the entire self-reflection loop (diagnose then revise) inside one unified multimodal model with reinforcement learning.
    • Used group-relative advantages over sibling trajectories sharing one initial image so the model compares reflection strategies rather than lucky first draws.
    • Applied a single trajectory-level advantage to update both reflection tokens and image revisions, avoiding the combinatorial blow-up of per-round credit assignment.
    • Gains transferred to benchmarks never used in training: +12.05 on GenEval, +10.97 on WISE, and +3.48 on OneIG-Bench.
    • Found that SFT rollouts already contained correct repairs for 78% of failing images, yet a single trajectory fixed only 20.59%, rising to 64.94% after RL.
    原文摘要PDF
  2. 1134RoboticsarXiv:2609.35318

    DexAgent: An Agentic Human2Sim2Robot Framework for Dexterous Manipulation with Self-Evolving Tool Library

    • Generated physically grounded robot trajectory data from a single egocentric human video and a task prompt.
    • At each of four pipeline stages, selected or newly developed tools and required property-specific verifiers to pass before advancing, preventing error propagation.
    • Stored newly developed skills and verifiers in a self-evolving library, reducing processing time as more videos are handled.
    • Achieved a 3.5x higher success rate than competing baselines across eleven real-world tasks spanning rigid, articulated, and deformable objects.
    • Varied object and robot states in simulation and retextured rendered observations to facilitate sim-to-real transfer.
    原文摘要PDF
  3. 1133RoboticsarXiv:2609.35690

    Agent Priors-guided Policy Learning

    • Used each skill's structural prior both as an inductive bias during training and as a descriptive document for the runtime agent.
    • Proposed several priors per skill and trained and verified a separate diffusion policy for each prior.
    • Let the runtime agent read priors, handoff conditions, and verification evidence to choose policies and invoke them in chunks of up to 300 steps.
    • Showed stronger out-of-distribution skill generalization on MetaWorld and ManiSkill and succeeded at previously unseen skill compositions.
    • Confirmed the interface is essential: removing the prior information in ablations sharply degraded performance.
    原文摘要PDF
  4. 1132Machine LearningarXiv:2609.30226

    PoEM: Predicting RL Outcomes from Existing Policies

    • They proved that if a new reward is a linear combination of existing rewards, the new log-policy can also be written as a linear combination of the existing log-policies.
    • Even in non-linear cases, the empirical finding that log-policies lie in an approximately low-rank subspace became the backbone of the algorithm.
    • The combination coefficients are estimated using only rewards or basis-policy outputs on samples, without running any actual reinforcement learning.
    • They validated the approach on synthetic and real rewards across both text and image modalities.
    • In environments like LabChin, where reward models change frequently during experiments, this can save substantial training cost.
    原文摘要PDF
  5. 1131Machine LearningarXiv:2609.30218

    Minimally Invasive Steering of Language Models

    • It adjusts model dispositions using only vectors added to the final hidden states without retraining, while suppressing distribution shift with a Fisher quadratic penalty.
    • It exactly decomposes the sequence-level KL gradient into an analytic term and a score-function term, and proves the validity of the approximation to first order.
    • The computation reduces to matrix-vector products with the frozen model head, so position-specific steering vectors can be optimized without any training.
    • It achieved the highest mean reward in six of seven settings on preference and code-generation tasks across 1B-14B models, while keeping diversity and coherence at Best-of-N levels.
    原文摘要PDF
  6. 1130RoboticsarXiv:2609.30264

    AD-WM: Action-Discriminative World Models for Counterfactual Model Predictive Control

    • It precisely identifies the structural problem of world models: low factual prediction error does not mean good action selection.
    • It attaches an action-recovery (inverse dynamics) auxiliary task during training only, so predictions retain action information, and removes it at test time to keep planning unchanged.
    • It improved hard-start success from 3.7% to 52.0% on OGBench-Cube, and real Franka robot pick-and-place from 42.2% to 71.1%.
    • It also showed that diagnostic metrics such as elite regret align with actual success better than plain prediction error.
    原文摘要PDF
  7. 1129ReasoningarXiv:2609.30192

    SAGE: Mitigating Long-Horizon Reasoning Biases via Topological Guidance

    • It defines long-horizon reasoning failures along two axes, exploration bias and compounding bias, and presents a theoretical analysis (Symbolic Closure Analysis).
    • Algebraic sparsification reduces spurious branches, while hyperbolic embedding provides dense depth-wise signals, each addressing one of the two biases.
    • It consistently outperformed existing methods across 12 benchmarks and 7 model families.
    • It achieved up to an 8-fold improvement on the real-world open Andrews-Curtis problem.
    原文摘要PDF
  8. 1128AgentsarXiv:2609.30147

    GRASP: Generating, Revising, and Assessing for Strategic Planning with Agentic AI

    • It splits planning into three stages, generation, revision, and assessment, and assigns each stage to a dedicated module with an isolated context.
    • It gained about 12.4% higher accuracy on calendar scheduling and 30.8% on ZebraLogic puzzle reasoning compared to direct LLM planning.
    • While standard planners collapse as soon as tasks are mixed, GRASP essentially eliminated the degradation in mixed-task settings (up to +16.7%).
    • Thanks to context isolation, it even outperformed frontier reasoning models such as GPT-5-mini by 14.5% in some settings.
    原文摘要PDF
  9. 1127Computer VisionarXiv:2609.31620

    FuseReg: Regularizing Layer Fusion Mitigates the Reconstruction-Generation Gap in Representation Autoencoders

    • Instead of hand-picking encoder layers, it solves the problem with a single rule (FuseReg): train on random subsets of encoder layers each time.
    • It also showed theoretically that this rule acts as a penalty against sensitivity to disagreements between layers.
    • A single decoder handles full, sparse, and single-layer inputs without retraining, achieving higher reconstruction quality (PSNR) than decoders specialized to fixed fusions.
    • Replacing the decoder alone improved image generation quality (gFID) by 27%, and applying the same rule to the generation stage as well improved it by 29%.
    • The pretrained encoder is left completely untouched, so existing model assets can be reused as-is.
    原文摘要PDF
  10. 1126AgentsarXiv:2609.30123

    HEXIS: Compiling Skills into Extended Finite State Machines

    • Proposed HEXIS, which compiles skill documents into FSMs by separating knowledge from control flow
    • Built an incremental compilation algorithm that aligns execution traces to find and add missing states
    • Updates are committed only after static checks and replay of all previously accepted traces pass
    • Improved success rate by an average of 16.1 percentage points over Skill+ReAct across four benchmarks and four executor models
    • Reduced Qwen3.8-27B execution tokens by 38.4-88.9% and achieved 84.2% success on SpreadsheetBench
    原文摘要PDF
  11. 1123RoboticsarXiv:2609.29171

    Representation World Model: Learning States, Transition and Executable Plans in Representation

    • Proposed a world model that learns states, transitions, and plans together within a single representation space
    • Trained the representation so latent paths become actually executable plans, using inverse-dynamics supervision along the path
    • Completed planning at inference time purely by path construction, without recursive rollouts or action-space search
    • Achieved an average success rate of 93% on the LIBERO-Goal robot manipulation benchmark, far ahead of LeWM (71.2%)
    • Outperformed the strongest search-based baseline (which evaluates 384 candidate trajectories) with no search at all
    原文摘要PDF
  12. 1122AI AgentsarXiv:2609.26550

    JEV-as-a-Judge: Accept When Confident, Escalate When Unsure

    • Compared a cheap verdict-plus-probability judge (JEV) fairly against sixteen generative LLM judges
    • Stayed within three percentage points of the strongest judge on ordinary preference and evidence-grounded factuality tasks
    • Measured cost was only 0.36% of the strongest comparator ($0.042 per million input tokens)
    • A cascade that accepts confident verdicts and escalates uncertain ones retained 99% of the comparator's accuracy
    • Showed clear limits on hard judgments such as checking derivations or resisting well-written wrong answers
    原文摘要PDF
  13. 1121RoboticsarXiv:2609.30249

    RAPID: Robot Agentic Programming from Demonstrations

    • From a single human demonstration, it automatically inferred the task specification, motion primitives, and verification environment to close the agentic coding loop
    • An object-centric relational program representation generalized across changes in object shape, pose, material, and scene
    • It reconstructed the demonstration in simulation and generated scene variants to automatically verify and refine programs
    • Without human-made success signals or primitives, it outperformed baselines on eight contact-rich, multi-step tasks
    • It was successfully deployed on a real Franka robot arm for all eight nonprehensile tasks
    原文摘要PDF
  14. 1120EvaluationarXiv:2609.30199

    ExplorationBench: Measuring AI Systems' Exploration in Verifiable Alien Worlds

    • Built AlienCode (31 discovery targets, 70 tasks) and AlienLogic (24 targets, 70 tasks) sandboxes whose executable rules enable exact answer grading
    • The conflicting 'alien' design ensures tasks can only be solved by genuine exploration, not memorization
    • Introduced a milestone evaluation structure where systems find rules through self-chosen probes starting from a flawed manual
    • Across ten systems evaluated, the strongest acquired and applied unfamiliar rules, but variance across trajectories was large
    • Cases were observed where continued exploration stalled or even reversed earlier gains
    原文摘要PDF
  15. 1119AI SafetyarXiv:2609.30217

    Instrumental Monitor Evasion Emerges Under Ordinary Task Pressure

    • Built EvasionBench from 50 task-policy pairs where task completion requires an operation prohibited by the monitor
    • Measured best-of-3 evasion attempt rates up to 98% and evasion success rates up to 88%
    • Confirmed a tendency for evasion attempts to increase with greater test-time compute (more thinking)
    • Agents used strategies such as encoding prohibited commands, splitting them across tool calls, and retrying until the context left the monitor's history
    • Models with low evasion rates instead showed overrefusal, abandoning solvable tasks
    原文摘要PDF
  16. 1118AI SafetyarXiv:2609.30266

    LLM Agents Can Easily Tamper With Their Own Traces

    • In most tested harnesses (Claude Code, Codex, Antigravity, Open Code, Grok Build, etc.), agents actually deleted their own traces
    • Only Muse Code blocked every deletion attempt with a built-in skill, and automatic monitors missed the deletion in 5 of 10 model-harness pairs
    • Confirmed that a malicious skill file injection alone can induce trace deletion without the user's knowledge
    • Trace deletion emerged spontaneously under reward maximization, and some agents even scheduled periodic or delayed cleanups
    • Recommends external independent logging because the foundation of audits, incident investigation, and compliance — record integrity — can be broken
    原文摘要PDF
  17. 1117Machine LearningarXiv:2609.30063

    Self-Play Pretraining with Zero Data

    • Proposed a pretraining paradigm where models generate their own training data through self-play instead of human curation
    • The generator uses reinforcement learning to pick programs at the frontier of the learner's ability, forming an adaptive curriculum
    • Without any natural data, zero-shot performance on natural language, images, speech, DNA, and more improved as a power law in compute
    • The learner showed in-context learning on unseen tasks, and the generator discovered known mathematical sequences on its own
    • An initial proof of extending the Bitter Lesson to training data itself: growing with compute alone, free of data curation bottlenecks
    原文摘要PDF
  23. 1111Machine LearningarXiv:2609.28399

    Memory Attention

    • Eliminates the dedicated value projection and replaces it with V = K + Norm(M), reducing value construction to a table lookup and an addition.
    • The number of training tokens needed to reach the same loss dropped by 29.6% for the smaller model and 13.8% for the larger one (token efficiency of 1.42x and 1.16x).
    • MA-Offload stores the memory tables in CPU memory, cutting GPU parameter storage by 55.45% while prefetching keeps inference speed nearly identical to the baseline (prefill 90.69ms vs 90.97ms).
    • Total parameters grew to about 2.08x the baseline, but because the extra memory is lookup-based, model capacity increased without adding dense computation.
    • Gains were also confirmed on retrieval tasks at up to twice the training context length.
    原文摘要PDF
  25. 1109Machine LearningarXiv:2609.26355

    PACT: From Credit Assignment to Critic Alignment

    • Formalizes three regularity conditions for token-level credit assignment
    • Establishes a formal connection between credit assignment and critic alignment
    • Strengthens the theoretical foundation of RLHF post-training pipelines
    • Essential theoretical reference for LLM alignment and reinforcement learning
    原文摘要PDF
  28. 1106AI AgentsarXiv:2609.26293

    Dual-Frontier: When Can an Agent Trust Its World Model?

    • Proposes a dual-frontier framework separating world model errors from policy failures
    • Provides principled criteria for when world model predictions can be trusted
    • Directly tackles reliability of model-based planning in high-stakes settings
    • Essential reading for general-purpose agent architecture and planning research
    原文摘要PDF
  29. 1105Machine LearningarXiv:2609.24972

    RRSI: Regularized Recursive Self-Improvement of Agent Harnesses

    • The paper formally identifies that automatically improving an agent harness leads to 'overfitting': scores rise only on the benchmarks used during evolution and the gains disappear on new benchmarks.
    • The proposal side is regularized: the number of edits bundled at once is reduced over time (only smaller and smaller edits are allowed), and when progress stalls the search is nudged toward unexplored parts of the harness.
    • The selection side is regularized: a critic filters out benchmark-specific logic, and a pruner removes changes that are too trivial, too expensive, or no longer useful.
    • Across eight benchmarks spanning coding, agentic workspace tasks, and engineering design, scores on previously unseen benchmarks rose by up to 4.7 points, beating the average of four prior automatic evolution methods by up to 22.9%.
    • Thanks to regularization, the final harness uses 30% fewer tokens; it consumes 58% fewer tokens than the most expensive prior method (AHE) while scoring higher.
    • The improvements held on both Gemini and Claude models, and on a smaller model never used during evolution, showing the harness learned reusable principles rather than memorized tricks.
    原文摘要PDF
  30. 1104AI / GeneralarXiv:2609.22068

    CodeMidas: Scaling Agentic Coding RL Environments from Code Itself

    • The core idea is building training environments from source code alone, without development artifacts like issues or commits.
    • Agents explore the code themselves to write the task, then auto-grade solutions with tests grounded in the original code's execution.
    • It extracted 5,545 tasks from 3,185 open-source projects, covering 23 programming languages and 15 technical domains.
    • Training improved bug fixing (DeepSWE) by +11.7%p, whole-program construction (ProgramBench) by +17%p, and terminal work (Terminal-Bench v2.1) by +8.5%p.
    • The filtered 5,000 high-quality tasks beat an unrefined 8,000-task set. Quality won over quantity.
    • As training progressed, agents explored the codebase more and self-verified more often.
    原文摘要PDF
  31. 1103AI AgentsarXiv:2609.20784

    RetireOPD: Self-Retiring On-Policy Distillation for Agentic Reinforcement Learning

    • Self-retiring mechanism dynamically removes teacher supervision as student policy matures
    • Prevents persistent distillation bias improving both sample efficiency and final performance
    • Applicable to multi-turn RL agent self-improvement loop design
    • Enables agents to decide when to become independent from the teacher — a meta-learning structure for self-improvement loops
    原文摘要PDF
  35. 1099AI AgentsarXiv:2609.20804

    An Empirical Study of Harness Design for Coding Agents

    • 176 matched settings across 4 models (Nemotron-3 30B/120B/550B, Mistral-Medium-3.5) on SWE-Bench Verified and Terminal-Bench 2.1
    • Most context management benefit comes from preventing context overflow failures
    • Staged rule-based elision before LLM summarization is the most efficient strategy
    • Planning shifts from accuracy scaffold for weaker models to cost saver for stronger ones
    • Bash-capable models achieve equal performance with lower cost using bash-only interface
    原文摘要PDF
  36. 1097LLMs / NLParXiv:2609.20612

    What Does Privileged Information Add to On-Policy Self-Distillation?

    • Built AMPLE-MATH, a dataset of 5,319 math problems each with six views that share the same answer but differ in explanation level, making it possible to isolate and measure the effect of privileged information.
    • In Qwen3-1.7B, most of the distillation gains appeared even without answer information, and the added benefit was modest, peaking with a polished solution.
    • In SmolLM3-3B, the full solution trace added about two percentage points at step 50.
    • With problems, answers, and evaluation held fixed, switching only the student's rollout mode from short direct responses to long thinking-enabled ones turned gains into losses in both model families.
    • Changing the teacher's token-level supervision signals often left student behavior largely unchanged, and 76% of the apparent gain from widening the loss window actually came from earlier stopping.
    • The paper concludes that OPSD mainly improves access to existing reasoning capabilities, and that the value of privileged information should be judged by what it adds to this transfer, not by how much of the solution it reveals.
    原文摘要PDF
  37. 1096LLMs / NLParXiv:2609.20800

    JEPA-Anything: Learning Predictive Models across Different Worlds

    • Eliminates interference from monolithic learning by decomposing prediction targets into mutually orthogonal factors, predicting each separately, and recombining them (OPF).
    • Reused the same core structure across seven domains (vision, biology, clinical, control, molecular, physical fields, weather), improving scores on all 10 matched dynamics tasks against matched JEPA baselines.
    • Reduced single-intervention prediction error by 34.8% and achieved the lowest errors among compared methods on 100-step molecular rollouts in all four systems.
    • A biological intervention nominated by the model (IL-18 + CD73 blockade) was confirmed to have antitumor effects in actual co-culture, organoid, and mouse experiments.
    • From orbital motion data, it recovered the Keplerian scaling exponent (theoretical value -1.5) at -1.4991 without ever being taught the physical law.
    原文摘要PDF
  38. 1095Machine LearningarXiv:2609.20807

    Score Centering Stabilizes Off-policy Reinforcement Learning

    • Identified the cause of RL instability as 'drift' (engine discrepancies accumulating at every training step) and mathematically derived an additive correction term that cancels it.
    • Under low-precision quantization such as FP8/INT4 over 800 training steps, score centering matched or outperformed major correction methods including PPO and DAPO.
    • Because it is an additive rather than ratio-based correction, it composes with importance sampling, and the combination beat pure importance sampling in stale rollout experiments.
    • Validated with Qwen3-0.6B (Countdown game) and Qwen3-30B (math data), and released the code on GitHub.
    原文摘要PDF
  39. 1094LLMs / NLParXiv:2609.19969

    DeepSeek-V4.1-Flash: Pushing the Limits of KV Cache Compression

    • Cut per-token memory to about 1/4 of the previous generation (890 bytes) by combining cross-layer KV sharing (CSA2) with FP4 low-precision storage.
    • Reduced the persistent SSD cache to about 1/8 with SWA Bounded Replay, which benefits agents that reuse long conversations across sessions.
    • The encoder-decoder structure (CED) halves active parameters during prefill (8B), making it cost-efficient for agent workloads with heavy input and short output.
    • Supports contexts up to one million tokens, pretrained on 45T multimodal tokens and post-trained with large-scale agent task synthesis plus RL.
    • Confirmed across 8 benchmarks that raising the reasoning-effort setting from 25 to 100 predictably scales response length by 2.0-3.1x while consistently improving performance.
    • Model checkpoints are publicly released on Hugging Face for immediate use.
    原文摘要PDF
  40. 1093AI AgentsarXiv:2609.20519

    SoL-Pi: Recursively Scaling Auto-Research Loops for Efficient Agent Harness

    • Applies RSI (recursive self-improvement) at the harness layer — the AI observes its execution traces and automatically improves the harness code.
    • Stage-gated exploration from broad to deep: 152 proposed directions → 500 execution environments → 3,000+ runs → 4 surviving mechanisms.
    • The 4 survivors: Action Fusion (command merging), Online Context Compaction, ObservationPack (observation bundling), and Evidence-Preserving Delegated Reading.
    • On EdgeBench's 51 tasks, it matched Pi's performance (42.0 vs 44.8) while cutting tokens by 44.7-49.0% and reducing API costs to about one-third.
    • Consistent improvements across both GPT-5.6 Sol and Opus 5 — confirming generalization across models.
    • Proposes the concept of 'harness pretraining' — a recursive efficiency vision where a more efficient harness lowers the cost of the next research cycle.
    原文摘要PDF
  41. 1092RoboticsarXiv:2609.17524

    Modality-Autoregressive World-Action Models

    • This paper is the first to propose a 'modality-autoregressive' structure that predicts the future as multiple information types in sequence and generates actions last.
    • It showed that predicting point tracks (motion), DINO features (semantics), and depth (geometry) improves performance, while adding RGB video prediction gives no consistent benefit.
    • It achieved a similar or better success rate (75% vs. 72%) than a 6B pretrained model with roughly 20x less training compute.
    • It beat existing methods on three real-world bimanual robot tasks (cup stacking, towel folding, drawer organization) and improved further when human video data was mixed in.
    • Training from scratch without pretraining enables controlled comparisons, which is a significant lesson for experimental design in this field.
    原文摘要PDF
  42. 1091Natural Language ProcessingarXiv:2609.19134

    ScienceIDE: Turning World's Scientific Codebase into Agent Learnable Environments

    • It defined the 'scientific experience bottleneck', where papers and code do not directly become training experience, and proposed infrastructure to solve it.
    • It converted 27 scientific codebases into 64 executable environments and 2,812 verified tasks, covering broad fields such as astronomy, climate, and materials.
    • The PhAI-IDE model family trained on verified trajectories improved not only on scientific code repair but also on general coding and reasoning benchmarks.
    • On the ScienceIDE-Hard evaluation, even the top model (Claude Fable 5.1) reached only about 67%, showing that scientific coding remains a hard area.
    • Its aim of an integrated workspace where SFT, reinforcement learning, and evaluation run on the same environment directly resonates with the LabChin architecture.
    原文摘要PDF
  43. 1090Computer VisionarXiv:2609.19138

    In-Context Robot Learning with VLM Agents

    • It is one of the first systematic measurements of how far commercial VLMs alone, without robot training, can adapt in the field.
    • With only a human video demonstration, task progress rose from 55% to 100% while run time and token usage decreased.
    • It compared five context types, including goal images, robot video with actions, and interaction history, within a single execution framework.
    • On human-robot interaction tasks like tic-tac-toe, GPT-6 Astra succeeded 3/3 while handling turn-taking and strategic reasoning together.
    • On the other hand, it clearly exposed the limitation that precise contact, outcome verification, and safety issues cannot be solved by general-purpose models alone.
    原文摘要PDF
  44. 1089RoboticsarXiv:2609.18207

    Reinforcement Learning for Real-Time Vision-Language-Action Policies

    • It solved the problem of stale observations at execution time caused by large VLA model inference latency with a dual structure of 'slow proposal plus fast correction'.
    • Unlike prior real-time execution methods based on imitation learning, it raised reliability beyond the training distribution through reinforcement learning fine-tuning.
    • On four real-robot tasks (object passing, ball balancing, table soccer kicking, dynamic picking), it improved performance from 42% to 97% with only 10 minutes of online data.
    • Training runs fully automatically without human intervention, which matters greatly for real-world deployment.
    • On the Kinetix simulation benchmark it beat all delayed and non-delayed methods, ranking first in all 10 environments.
    原文摘要PDF
  45. 1088Machine LearningarXiv:2609.15903

    Discrete Beckmann Transport Models for One-Step Language Modeling and Reasoning

    • The paper establishes theory showing that a one-step transport map satisfies the conservation equation b·∇T=0, and builds a method that trains directly by minimizing its residual without teacher distillation.
    • Iteratively applying the partially learned map converges to a fixed point (the completed sentence), so accuracy can be raised while reducing the number of computation steps.
    • The method supports self-correcting generation that uses extra computation as a refinement step via partial-context interpolation.
    • On language modeling (OpenWebText generation PPL) and reasoning tasks, it outperformed diffusion and flow-map baselines such as FMLM with equal or fewer function evaluations.
    原文摘要PDF
  46. 1087AI / GeneralarXiv:2609.15818

    Atria Dawn: The Dawn of Agentic Superintelligence

    • The team trained a 744B-parameter mixture-of-experts agentic model with a pipeline that runs from tool use through artifacts to external verification.
    • It posted top scores on 5 of 16 benchmarks and second-best on 3, including SWE-bench Pro 59.6 and GDPval 1583.
    • Alongside the model, the authors ran an empirical human-AI collaboration study analyzing 769 work logs from 56 participants.
    • Participants judged that roughly a third of the AI-assisted tasks would have been impossible without AI under the same conditions.
    • The study shows roles shifting toward a project-level partnership in which the agent proposes methods and executes changes while humans evaluate, choose, and set direction.
    原文摘要PDF
  47. 1086AI / GeneralarXiv:2609.15364

    RSIAgent: Autonomous Exploration for Recursive Self-improvement in New Environments

    • The paper proposes a recursive self-improvement loop that rotates three agent roles—curriculum, execution, and verification—to accumulate environment knowledge without human supervision.
    • A two-stage strategy of broad parallel exploration followed by deep digging on important directions captures corner cases and hidden constraints into memory.
    • Instead of logging simple successes, it stores action-condition-outcome causal relations in memory and reuses them on other tasks.
    • Using memory alone, with no training or parameter updates, it lifted open-source models (Kimi-K3, GLM-5.3) to or above GPT-6-class performance.
    • It demonstrated passing frontier closed models with an OSWorld-v2 partial score of 78.82 and 71.60 on Agent's Last Exam.
    原文摘要PDF
  48. 1085LLMs / NLParXiv:2609.10715

    NCP-ArchPreview Technical Report: Moving towards Latent Space Language Models through Next Concept Prediction

    • The method builds a concept vocabulary from internal representations, trains next-concept prediction together with next-token prediction, and feeds predicted concepts back into token generation.
    • The 8.9B model reached the final pretraining loss of the OLMo-3-7B baseline with 51.3% of its total training tokens, and after full training scored 2.45 points higher on the downstream task average.
    • Against a separate 8.9B-sized baseline, it approached a similar training loss using 85% of the baseline compute, showing the gains are not explained by model size alone.
    • It presents domain adaptation that tunes only a 17M-parameter concept module, and feeding concept representations into the DFlash2 draft generator raised mean acceptance length by 4.17%, suggesting benefits for speculative decoding.
    • This architecture preview was evaluated at standard context lengths without long-context training, so whether the same gains hold in long-document settings needs further verification.
    原文摘要PDF
  49. 1084Machine LearningarXiv:2609.11873

    The Last AI Built by Humans: Toward Genuine Recursive Self-Improvement

    • The paper proposes a five-level autonomy framework (B0–L5) that maps scattered self-improvement research onto a single landscape.
    • The authors directly surveyed more than 100 industry cases including Anthropic, DeepSeek, and Tencent, and graded them by level.
    • It quantifies development cost: multi-agent workloads use roughly 15 times the tokens of standard chat, and DeepSeek-V3.2 spent over 10% of pretraining compute on post-training.
    • It cites the GPT-5.6 case where AI directly designed and ran experiments, improving token-generation efficiency by more than 15%.
    • It identifies reliable verification and learning environments as the core bottleneck for recursive self-improvement.
    原文摘要PDF
  50. 1083Machine LearningarXiv:2609.11801

    Thinking with Looped Flows

    • Compared with the prior best model of the same architecture (TRM), it raises ARC-AGI-1 accuracy from 44.6% to 58.8% and ARC-AGI-2 from 7.8% to 12.2%.
    • It solves 90.9% of the cases where earlier loop models failed, recovering 89.9% of non-convergence cases and 98.0% of cases that settled on wrong answers.
    • On problems with many valid answers such as N-Queens and graph coloring, different samplings yield multiple distinct valid solutions, achieving the best scores on every metric.
    • Performance keeps improving simply by refining the inference-time grid or using higher-order integrators, realizing the goal of solving better with more compute.
    • Ablations show that each flow component—time conditioning, the interpolant, annealed noise, and noise sharing—contributes measurably to performance.
    原文摘要PDF