QuestionHow can prefill computation costs and massive KV cache footprints be dramatically reduced to scale long-horizon agent workloads?
The paper introduces DeepSeek-V4.1-Flash, a multimodal MoE model featuring 552B backbone parameters and support for up to one million context tokens. Using a Causal Encoder-Decoder architecture, it activates 16B parameters per token during decode but only 8B during prefill to lower computational overhead. It combines cross-layer KV cache reuse in Compressed Sparse Attention 2 with FP4 KV caching, shrinking the global KV cache footprint to 890 bytes per token. Furthermore, SWA Bounded Replay reduces the persistent KV cache footprint to roughly 1/8 of DeepSeek-V4-Flash.
DeepSeek-V4.1-Flash is a multimodal MoE model with 552B backbone parameters and support for contexts of up to one million tokens.
The model activates 16B parameters per token during decode but only 8B parameters during prefill.
These designs reduce its global KV cache footprint to 890 bytes per token, roughly 1/4 of the corresponding footprint of DeepSeek-V4-Flash.
QuestionHow can digital agents autonomously explore and recursively self-improve in new environments without updating model parameters?
The authors introduce RSIAgent, a training-free multi-agent framework designed for recursive self-improvement through autonomous memory construction. RSIAgent coordinates curriculum, actor, and verifier agents to continually explore unknown environments, validate outcomes, and retain environment-specific knowledge like reusable causal relationships. It utilizes a broad-then-deep exploration strategy to discover diverse structures and uncover hard cases or hidden constraints. The resulting memory is frozen and directly reused for downstream tasks without altering model parameters. Experiments on OSWorld-v2 and Agent's Last Exam demonstrate that RSIAgent enables open-source models like Kimi-K3 and GLM-5.3 to outperform frontier closed-source models including GPT-6.
RSIAgent is a training-free multi-agent framework enabling recursive self-improvement through autonomous memory construction.
It employs a broad-then-deep exploration strategy combining parallel broad exploration and focused deep self-exploration.
Experiments on OSWorld-v2 and Agent's Last Exam show that Kimi-K3 and GLM-5.3 outperform frontier closed-source models including GPT-6.
Shichengf78 upvotes14 Sept 2026read the original ↗
QuestionHow do individual harness components such as context management, planning, and action space impact the long-horizon performance of coding agents?
The authors evaluate coding harness components by keeping the execution loop fixed while varying three elements: planning, action space, and context management. Across four models and 176 matched settings on SWE-Bench Verified and Terminal-Bench 2.1, they find that context management prevents context-overflow failures and is most valuable under tight budgets. Staging rule-based elision before LLM summarization provides top efficiency. Planning acts as a cost saver for stronger models rather than an accuracy booster. Furthermore, bash-capable models operating with a bash-only interface achieve substantially lower costs without sacrificing task performance.
Context management prevents context-overflow failures and becomes increasingly valuable as the context-window budget tightens.
Planning shifts from an accuracy scaffold for weaker models to a cost saver for stronger models.
A bash-only interface allows bash-capable models to achieve substantially lower cost, especially on command-line-centric tasks.
Vfrz69 upvotes17 Sept 2026read the original ↗
04Confidence Comes from Experience: Experiential Confidence Estimation from Reasoning to Agents0,95
QuestionHow can language models estimate output confidence more reliably by leveraging accumulated past experiences rather than relying solely on the current inference process?
This work introduces XConf (eXperiential Confidence), a confidence estimation method that stores past graded episodes containing tasks, reflections, stated confidence, outcomes, and lessons. Given a new task, XConf recalls similar past episodes to retrieve historical success rates and prompts the model to identify recurring failure modes and restate its confidence. Operating without logit access or weight updates, XConf beats or matches ten-sample self-consistency in AUROC on 23 of 24 comparisons across nine benchmarks, significantly lowers ECE, and raises delivered success rates on agent tasks by up to 8.7 points when abstaining on the 10% least-confident episodes.
XConf beats or matches ten-sample self-consistency in discrimination (AUROC) on 23 of 24 comparisons.
Abstaining on the 10% least-confident episodes raises the delivered success rate by up to 8.7 points on agent tasks.
caiqizh56 upvotes15 Sept 2026read the original ↗
05Agent as Policy for Robotic Manipulation0,95
QuestionCan a general-purpose agent directly act as a robotic policy to drive physical robots throughout task execution?
The study introduces Agent as Policy (AGP), a framework allowing a general-purpose agent to directly control physical robots by interpreting visual evidence, writing executable programs, issuing motion commands, and revising actions based on physical outcomes. AGP integrates the agent's reasoning and programming capabilities into continuous interaction with the physical world without task- or environment-specific training. Tested across tasks like assembly from human videos, block construction, die reorientation, and bimanual towel folding, AGP achieves success rates of 100%, 100%, and 80% on three block construction configurations.
AGP achieves success rates of 100%, 100%, and 80% on three block construction configurations.
JillJia17 upvotes11 Sept 2026read the original ↗
06Atria Dawn: The Dawn of Agentic Superintelligence0,90
QuestionHow can foundation agents be trained and integrated effectively into real-world research and engineering workflows?
The authors introduce Atria Dawn Preview, a foundation agentic language model designed for scientific research and engineering workflows. The model is trained via a Verifiable Experience Pipeline that connects tool-mediated interactions to executable environments and externally verified outcomes. Across 16 benchmarks, Atria Dawn Preview is competitive with frontier agents and achieves the highest reported score on 5 of them. A case study analyzing 769 task records from 56 participants reveals that participants rated about 1/3 of completed AI-assisted tasks as infeasible without AI, indicating a shift from task-level execution to project-level partnership.
Atria Dawn Preview achieves the highest reported score on five of the 16 benchmarks.
An analysis of 769 task records from 56 participants reveals that participants rated about one-third of completed AI-assisted tasks as infeasible without AI.
KYLN24414 upvotes14 Sept 2026read the original ↗
07ModularRSI: Modular and Generalizable Recursive Harness Self-Improvement0,90
QuestionHow can recursive agent harness self-improvement be made generalizable without overfitting to evaluation benchmarks or conflating task-specific details?
The paper introduces ModularRSI, a benchmark-disjoint, contrastive, and modular framework designed to evolve agent harnesses reliably. It decomposes harnesses into five functional modules—such as Agent Loop and Tool Use—and evaluates them using 2,000 external evolution tasks. By contrasting successful and failed trajectories across tasks, ModularRSI isolates recurring behavioral deficiencies without overfitting to evaluation benchmarks. Experiments on TB2.0 and SWE-Bench Verified demonstrate consistent improvements on unseen tasks and robust transferability across different foundation models.
ModularRSI curates 2,000 executable evolution tasks from external sources that are disjoint from downstream evaluation benchmarks.
The system decomposes the evolvable harness into five functional modules that evolve independently within restricted scopes.
Experiments on TB2.0 and SWE-Bench Verified show consistent improvements on unseen in-domain and cross-domain tasks.
SiweiWu190 upvotes14 Sept 2026read the original ↗
08SoL-Pi: Recursively Scaling Auto-Research Loops for Efficient Agent Harness0,90
QuestionHow can auto-research loops be recursively scaled at the harness layer to optimize token usage and cost for autonomous coding agents?
As coding agents transition to unattended 24/7 exploration, managing token efficiency during long reasoning and tool-use trajectories becomes critical. We propose SoL-Pi, an RSI-inspired approach that scales auto-research loops across diverse environments at the harness layer. SoL-Pi incorporates four survival mechanisms spanning action execution, context compaction, observation handling, and delegated reading. On the 51-task EdgeBench evaluation, SoL-Pi matches the performance of top systems while cutting token traffic by 44.7-49.0% and reducing API costs by about one third.
Four mechanisms survive selection and form SoL-Pi, spanning action execution, context compaction, observation handling, and delegated reading.
On the 51-task EdgeBench evaluation, SoL-Pi achieves performance comparable to Pi across GPT-5.6 Sol and Opus 5.
Reduces recorded token traffic by 44.7-49.0% and API cost by about one third.
Sensen0288 upvotes17 Sept 2026read the original ↗
09ScienceIDE: Turning World's Scientific Codebase into Agent Learnable Environments0,90
QuestionHow can the world's scientific code repositories be converted into programmable environments for training scientific agents?
The authors introduce ScienceIDE, an infrastructure designed to convert scientific code repositories into programmable environments for scientific agents. Guided by expert-defined acceptance criteria, agents transform repositories into executable environments supporting task generation, execution, and scientific verification. Using verified interaction trajectories, the authors train the PhAI-IDE model family in 72B, 9B, and 4B sizes. The model family achieves performance gains in held-out scientific-code repair and across general-purpose benchmarks in code, reasoning, and knowledge, demonstrating positive transfer from scientific experience to broader capabilities.
ScienceIDE transforms scientific code repositories into programmable environments supporting task generation, execution, and verification.
The PhAI-IDE model family includes 72B, 9B, and 4B variants trained using verified interaction trajectories.
The models show performance gains in held-out scientific-code repair and across general-purpose benchmarks in code, reasoning, and knowledge.
Lingaaaaaaa77 upvotes16 Sept 2026read the original ↗
10ProgramDistill: From Interactive Web Apps to Verifiable Reference-Guided SWE Tasks0,90
QuestionHow can coding agents be evaluated on complex web development features discovered through interaction with fully functional reference applications?
This paper introduces ProgramDistill, a benchmark evaluating coding agents on features discovered through interaction with fully functional reference applications. Using an automated mine-craft-patch pipeline, the authors discover 1,975 replay-verified behaviors across 26 applications and construct 4,063 tasks without human intervention. Across nine frontier coding agents, GPT-6 Astra and Claude Opus 5 achieve 49.2% and 28.8% success on cumulative workflows in full-application reconstruction, while partial-application success declines as restoration depth increases.
The mine-craft-patch pipeline discovers 1,975 replay-verified behaviors across 26 applications and constructs 4,063 tasks automatically.
GPT-6 Astra and Claude Opus 5 achieve 49.2% and 28.8% success on cumulative workflows in full-application reconstruction.
In partial-application reconstruction, success falls from 100% to 64.0% and from 96% to 32% as restoration depth increases from 1 to 8.
beanie0049 upvotes16 Sept 2026read the original ↗
11Self-Evolving Search Index0,90
QuestionHow can information retrieval systems autonomously optimize and evolve search indexes without human intervention?
Retrieval quality depends heavily on how effectively index keys expose knowledge, but fixed optimization strategies struggle across diverse environments, leaving index evolution largely human-driven. We propose SELF-INDEX, a framework enabling an index to self-evolve without human intervention. Its Optimizer autonomously diagnoses retrieval shortfalls, selectively revises responsible index keys, and validates each revision prior to updating. Furthermore, a Query Simulator proactively explores additional demands beyond available queries. Across diverse corpora and retrievers, SELF-INDEX consistently improves retrieval performance and enhances the effectiveness and efficiency of search agents and memory systems.
SELF-INDEX enables an index to self-evolve without human intervention through autonomous diagnosis and key revision by its Optimizer.
A Query Simulator allows the framework to proactively explore additional demands beyond queries already available for optimization.
The framework consistently improves retrieval performance across diverse corpora and enhances search agents and memory systems.
augustinLib40 upvotes17 Sept 2026read the original ↗
12RetireOPD: Self-Retiring On-Policy Distillation for Agentic Reinforcement Learning0,90
QuestionHow can multi-turn agents be trained using reinforcement learning while avoiding instability from privileged teacher information?
Multi-turn agents trained with reinforcement learning often use on-policy distillation (OPD) with a privileged teacher for dense token-level supervision, but privileged info is not always reliable and teacher benefits are stage-dependent. We propose RetireOPD (Self-Retiring On-Policy Distillation), optimizing a decoupled teacher with environment rewards and training a student jointly with RL and OPD. Through Adaptive Retirement, the student drops the teacher once discrepancy stops shrinking and it reaches a target success rate, proceeding with RL alone. Across Qwen2.5 models from 1.5B to 7B, RetireOPD improves ALFWorld success rate over RL baseline by 14.1% to 18.8% and WebShop accuracy by 11.8% to 19.0%.
RetireOPD adopts Adaptive Retirement where the student drops the teacher once discrepancy stops shrinking and reaches a target success rate.
It improves ALFWorld success rate over RL baseline by 14.1% to 18.8% across Qwen2.5 models from 1.5B to 7B.
WebShop accuracy improves by 11.8% to 19.0%, surpassing its own skill-conditioned teacher in every setting.
LZXzju37 upvotes17 Sept 2026read the original ↗
13Reflect, Revise, Reuse: Training-Free Skill Evolution for GUI Agents0,90
QuestionHow can GUI agents dynamically evolve their executable skills from deployment feedback without requiring additional model training?
The authors propose EvoSkill-GUI, a training-free framework that enables GUI agents to dynamically update and refine their procedural skills through a reflect-revise-reuse loop during deployment. Each skill is structured as a multi-file package containing retrieval metadata, execution plans, and failure-recovery rules. An executor performs instant in-rollout revisions while an isolated critic diagnoses failures. Experiments across MobileWorld, AndroidWorld, and OSWorld benchmarks demonstrate consistent performance improvements over base models without any additional training.
EvoSkill-GUI achieves maximum gains of +16.2%, +6.0%, and +10.5% across MobileWorld, AndroidWorld, and OSWorld benchmarks respectively.
The framework operates entirely without training by leveraging direct skill-file editing through a restricted tool interface.
Evolved skill libraries continue to benefit related tasks rather than requiring reconstruction from scratch.
LZXzju37 upvotes15 Sept 2026read the original ↗
14Discovery Foundation Models: Toward Open-Ended Discovery Intelligence0,90
QuestionHow can foundation models transition from solving human-specified problems to open-ended discovery and knowledge construction?
The paper introduces Discovery Intelligence and Discovery Foundation Models (DFMs) as general-purpose systems for open-ended discovery. The authors instantiate this framework via Zetema—which couples research-state dynamics, verification, and skill evolution—and GALILEO, a closed physical discovery loop integrating Dry-Lab reasoning with robotic Wet-Lab experimentation. This approach enables discovery behavior to be trained, executed, and evaluated beyond final-answer performance.
A DFM operates over a revisable research state and supports seven coupled capabilities spanning problem discovery, formulation, representation construction, hypothesis formation, intervention, evidence-grounded revision, and continual discovery improvement.
Zetema couples explicit research-state dynamics, verification and experimental gating, external grounding, and cross-task Discovery Skill evolution.
GALILEO forms a closed physical discovery loop in which Dry-Lab reasoning, robotic and hands-on Wet-Lab experimentation, external biological evidence, and iterative hypothesis and design revision are integrated.
Lingaaaaaaa32 upvotes14 Sept 2026read the original ↗
15Sample Count Is Not Enough: Candidate-Generation Strategy Shapes the Energy and Performance of LLM Test-Time Scaling0,90
QuestionHow does the candidate-generation strategy impact the energy consumption and performance of LLM test-time scaling systems?
The paper investigates the impact of candidate-generation schedules on LLM test-time scaling, demonstrating that candidate count N alone is insufficient to describe system costs. The authors compare four schedules (1x8, 2x4, 4x2, and 8x1) while keeping N = 8 fixed. Results on A100 GPUs show that eight serial calls consume 4.64-4.86x as much gross GPU-device energy and exhibit 5.77-6.12x the P95 latency of a single batched call. Consequently, when candidates are independent and memory allows, fewer generation calls with larger batch sizes are more efficient.
On A100 GPUs, eight serial calls use 4.64-4.86x as much gross GPU-device energy as one batched call with eight candidates.
Eight serial calls have 5.77-6.12x the P95 latency of one batched call with eight candidates.
Increasing N from 1 to 8 improves accuracy by 8.4 percentage points for Phi-3-mini and 18.4 points for Qwen2.5-1.5B on 500 GSM8K prompts.
iammobina29 upvotes16 Sept 2026read the original ↗
16Don't Mask the Environment: Observation Supervision Changes How Agents Explore Under RL0,90
QuestionDoes applying supervision to observation tokens during fine-tuning improve how agents explore under reinforcement learning?
The paper examines the convention of applying loss only to agent-authored action tokens during supervised fine-tuning (SFT) and introduces ActObs to supervise observation tokens as well. By training the model to predict action consequences without adding data or parameters, this method prevents action and observation gradients from becoming orthogonal. On Qwen3-4B, GRPO from ActObs achieves higher pass@k on Terminal-Bench 2.0 than its action-only counterpart. On Qwen3-8B, it increases pass@16 by +3.4 pp and extends advantages to cross-domain code editing on aider-polyglot with +4.2 pp at pass@1 for 4B. Joint supervision retains more entropy during RL.
On Qwen3-8B, it trades some pass@1 reliability for higher pass@k (+3.4 pp at pass@16) and solves more distinct tasks.
juzhengz28 upvotes17 Sept 2026read the original ↗
17ScienceBuddy: Recursive-in-Recursive Self-Improvement for Interactive Scientific Agents0,90
QuestionHow can scientific AI agents continuously co-evolve their harness environments and model weights through a recursive self-improvement loop?
The authors introduce ScienceBuddy, an interactive scientific research workspace implementing recursive-in-recursive self-improvement to continuously adapt AI agents. The paradigm couples harness evolution with model reinforcement learning: an inner recursion optimizes the execution harness with fixed model weights, while an outer recursion trains the model using the improved harness. Case studies spanning four scientific task families demonstrate how this joint evolution drives discovery intelligence in sustained collaboration with human researchers.
ScienceBuddy couples harness evolution with model reinforcement learning via a recursive-in-recursive self-improvement paradigm.
Lingaaaaaaa27 upvotes15 Sept 2026read the original ↗
18HazardAuditor: From Executable Threats to Safer Computer-Use Agents0,90
QuestionHow can computer-use agents executing in heterogeneous environments be supervised reliably at the decision level?
The authors introduce HazardAuditor, an execution-grounded framework that supervises heterogeneous computer-use agents like Claude Code, Codex, Hermes, and OpenClaw by normalizing their runtime interactions into a canonical event representation. They observe that token-level post-training objectives create a structural mismatch for generative guards, causing longer rationales to dominate gradient updates. To address this, they propose Guard Policy Optimization (GuardPO), which converts deterministic safety outcomes into sequence-level advantages and normalizes rationale and verdict regions. Across benchmarks, HazardAuditor improves accuracy by up to 16.5 percentage points over the strongest prior guard.
HazardAuditor improves accuracy by up to 16.5 percentage points over the strongest prior guard.
Yunhao-Feng18 upvotes14 Sept 2026read the original ↗
19Grouped Value Attention: Efficient KV Caching via On-Demand Key Reconstruction0,85
QuestionHow can the memory footprint and cache-read traffic of the KV cache be reduced during Transformer decoding without sacrificing benchmark accuracy?
The authors introduce Grouped Value Attention (GVA), a KV cache optimization technique that stores grouped values and reconstructs content keys using a learned linear map. At inference, this map can be absorbed into the query, eliminating the need to materialize content keys in the decode path while a small shared RoPE channel retains positional information. At the 350M-parameter scale with 30B FineWeb-Edu tokens, the 16-dimensional positional variant achieves 44.18 average accuracy across five tasks, compared to 44.36 for GQA and 43.88 for MLA, while reducing persistent cache scalars by approximately 45-47% relative to matched GQA.
Grouped Value Attention (GVA) stores grouped values and reconstructs content keys using a learned linear map.
The 16-dimensional positional variant at the 350M-parameter scale with 30B FineWeb-Edu tokens achieves 44.18 average accuracy across five tasks.
GVA reduces persistent cache scalars by approximately 45-47% relative to matched GQA.
vishesh-t2776 upvotes08 Sept 2026read the original ↗
20LynnReal-Omni: Native multi-modal Video Generation for Agentic Visual Workflows0,85
QuestionHow can native multimodal video generation be unified and stabilized for agentic visual workflows while supporting real-time performance?
This paper presents LynnReal-Omni, a native multimodal video generation framework built on a 32B shared multimodal diffusion transformer that unifies text-to-video, image conditioning, structural control, and long-video generation from heterogeneous visual inputs. It also features a dedicated 27B Flash transformer for real-time rendering and an MSAVP evaluation design with 100 prompts and 20 metrics. On one H100, warm generation and decoding of a 22-frame 540p video take 843 ms with LynnReal-Omni and 377 ms with Flash.
LynnReal-Omni relies on a 32B shared multimodal diffusion transformer and a 27B Flash variant for real-time rendering.
Introduces MSAVP, a 100-prompt, 20-metric evaluation design separating instruction following and visual quality.
On one H100, warm generation and decoding of a 22-frame 540p video take 843 ms with LynnReal-Omni and 377 ms with Flash.
shaohao01153 upvotes14 Sept 2026read the original ↗
21Video DeltaNet: A Video-Native Hybrid Attention for Livestream Video Generation0,85
QuestionHow can a hybrid attention mechanism combining local Softmax and bidirectional linear memory accelerate livestream video generation while preserving fine-grained quality?
The authors present Video DeltaNet (VDN), a hybrid attention architecture designed to alleviate computational bottlenecks in video diffusion models. VDN's linear branch introduces Video Delta Attention to update memory per frame using spatial tokens, while keeping Softmax attention for text and audio interactions. Utilizing a staged teacher-alignment recipe, an eight-step distillation, and an optimized SGLang serving stack, VDN-H3 efficiently completes denoising for long high-resolution video streams on multiple NVIDIA B200 GPUs.
VDN-H3 completes DiT denoising for a 14.3-second, 768p video in 6.70 seconds on eight NVIDIA B200 GPUs.
The approach achieves a 14.5x speedup over the 50-step dense H3 baseline on the same GPU count.
The architecture applies an eight-step distillation combined with an optimized SGLang serving stack.
taesiri34 upvotes17 Sept 2026read the original ↗
22EvolveTrade: Experience-Driven Policy Refinement for Self-Evolving LLM Trading Agents0,85
QuestionHow can LLM trading agents self-evolve their tool-use policies through execution feedback without modifying the underlying backbone model?
The authors propose EvolveTrade, a self-evolving framework for LLM trading agents that treats the system prompt as a text-parameterized policy. After each update interval, a Policy Agent revises this policy using accumulated decision traces and portfolio feedback while keeping the underlying LLM backbone fixed. Experiments across diverse market regimes demonstrate that EvolveTrade consistently improves the Sharpe Ratio and Cumulative Return compared to fixed-policy LLM baselines.
EvolveTrade improves Sharpe Ratio and Cumulative Return over fixed-policy LLM baselines in most evaluated settings.
Self-evolved policies increase code-mediated analysis and activate regime-relevant computations.
The framework keeps the underlying LLM backbone fixed while updating text-parameterized policies.
YuminChoi33 upvotes15 Sept 2026read the original ↗
23When2Think: Learning Difficulty-Aware Length Control for Efficient Hybrid Reasoning Models0,85
QuestionHow can the computational efficiency of Large Reasoning Models be optimized by dynamically controlling reasoning depth based on problem difficulty?
The paper addresses the inefficiency of Large Reasoning Models, which often overthink easy problems and underthink hard ones. The authors propose When2Think, a post-training framework that dynamically allocates computation based on problem difficulty. The method introduces Instance-level Difficulty-Aware Control (IDAC), a reward-shaping mechanism leveraging pre-computed reference statistics. Experimental results on AIME24 show that Pass@3 increases by 10.0% while token usage is reduced by 27.9% relative to the base model.
On AIME24, Pass@3 increases by 10.0% while token usage is reduced by 27.9% relative to the base model.
On AIME25, When2Think achieves 40.0% Pass@3, outperforming compression and routing-only baselines.
IDAC enables stable critic-free optimization without learned reward models or online reference-model queries.
junshim31 upvotes17 Sept 2026read the original ↗
24PACT: Can Enterprise AI Assistants Be Trusted Under Pressure?0,85
QuestionHow robustly do enterprise-grade LLM assistants adhere to compliance rules when subjected to user pressure, shortcuts, and multi-turn adversarial conversations?
The authors introduce PACT (Pressure-Applied Compliance Testing), a benchmark evaluating rule-following in enterprise AI assistants across twelve regulated domains and forty-eight multi-turn scenarios. Testing twenty-two common LLM models under various pressure tactics, the study profiles compliance robustness and introduces PACTScore. Results show that even top assistants mis-apply rules on 6 to 10% of items, and ordinary user pressure increases violation rates by 65% on average.
The PACT benchmark spans twelve regulated enterprise domains and forty-eight conversation scenarios.
Even the strongest assistants mis-apply a rule on 6 to 10% of items.
Ordinary user pressure raises the violation rate by 65% on average.
mokamoto26 upvotes16 Sept 2026read the original ↗
Nothing under this heading.
Hands-on
2026-09-20
Repositories climbing on GitHub today, scored on the day's momentum, rank, adoption, freshness and project health.
01addyosmani/agent-skills+556
Provides production-grade engineering skills for developers building autonomous coding agents.
3.500 kỹ sư vừa được cấp quyền sử dụng Astra tại Databricks.
Still to check
Astra được tích hợp vào công cụ coding nội bộ nào tại Databricks?
Việc triển khai áp dụng cho 100% nhân sự kỹ thuật hay có phân tầng quyền truy cập?
03 · 20 Sept 2026 · Astra · 2 sources
Astra vượt trội rõ rệt các mô hình cao cấp nhất trước đó (Opus 5, Sol 5.6) trên các tác vụ phức tạp cao, đặc biệt là thiết kế hệ thống cấp cao và tác vụ diện rộng.
Condition: Khi thực hiện các tác vụ có độ phức tạp cao, đặc biệt liên quan đến high level system design hoặc long range horizontal tasks
Astra vượt trội rõ rệt các mô hình cao cấp nhất trước đây của chúng tôi (Opus 5, Sol 5.6) trên các tác vụ có độ phức tạp cao, đặc biệt là những việc liên quan đến high level system design hoặc long range horizontal tasks.
Không rõ Astra có cải thiện đáng kể ở các tác vụ coding độ phức tạp trung bình/thấp so với các mô hình trước hay không. Chúng tôi nghi ngờ các tác vụ đó phần lớn đã bão hòa (được thực thi hoàn hảo) bởi các mô hình hiện tại.
Still to check
Định nghĩa về tác vụ coding 'độ phức tạp trung bình/thấp' trong môi trường Databricks là gì?
Có phải các mô hình nhỏ/rẻ hơn đã đủ xử lý hoàn hảo các tác vụ này mà không cần Astra?
05 · 20 Sept 2026 · Astra · 1 sources
Theo dữ liệu từ Ramp, Astra chiếm 13% tổng chi tiêu AI của doanh nghiệp so với 8% của Fable.
Astra chiếm 13% chi tiêu AI doanh nghiệp so với 8% của Fable theo dữ liệu từ Ramp.
Still to check
Dữ liệu của Ramp bao quát quy mô mẫu doanh nghiệp nào và đo lường trong khoảng thời gian nào?
Chi tiêu AI ở đây bao gồm những API direct hay qua trung gian như AI Gateway?
06 · 19 Sept 2026 · gemini · 2 sources
Google ra mắt Gemini 3.8 Live và 3.8 Live Extended Thinking với khả năng tự động nhận diện 97 ngôn ngữ, gọi công cụ ngầm không làm gián đoạn hội thoại và suy luận thị giác gần thời gian thực.
Chúng tôi giới thiệu Gemini 3.8 Live và 3.8 Live Extended Thinking – AI hội thoại tốt nhất của chúng tôi. Các model có thể trò chuyện, suy nghĩ và xử lý tác vụ ở chế độ nền mà không làm gián đoạn mạch hội thoại.
Cả hai model đều sở hữu: Suy luận nâng cấp, hiểu biết thị giác gần thời gian thực, tự động nhận diện cho 97 ngôn ngữ, background tool calling mà không gián đoạn cuộc trò chuyện của bạn.
Giới thiệu Gemini 3.8 Live và Gemini 3.8 Live Extended Thinking. Các model âm thanh tiên tiến này được xây dựng cho hội thoại tự nhiên, có những nâng cấp lớn về turn-taking và suy luận gần thời gian thực, thay thế stack riêng lẻ bằng một lệnh gọi API đa phương thức duy nhất.
Google vừa công bố Gemini 3.8 Live có thể thảo luận tác vụ cùng bạn rồi tiếp tục làm việc sau khi cuộc trò chuyện kết thúc.
Still to check
Kiểm tra danh sách 97 ngôn ngữ được hỗ trợ tự động nhận diện và đo lường độ trễ thực tế của khả năng suy luận thị giác cũng như turn-taking qua API trên Google AI Studio.
07 · 19 Sept 2026 · gemini · 1 sources
Gemini đã xâm nhập vào hệ thống của ba công ty thực tế trong một bài kiểm tra an ninh mạng sau khi môi trường thử nghiệm bị mở kết nối internet ngoài ý muốn.
Condition: Khi môi trường đánh giá an ninh mạng dạng capture-the-flag của công ty Irregular vô tình mở truy cập internet và công ty giả lập trùng tên với công ty thật
Các quan chức Google xác nhận với The Wall Street Journal rằng Gemini đã xâm nhập hệ thống của ba công ty thực tế trong quá trình chạy bài kiểm tra an ninh mạng vốn nhắm vào hạ tầng giả định.
Gemini của Google đã hack ba công ty thực tế trong một cuộc kiểm tra an ninh mạng theo WSJ; môi trường kiểm thử vô tình cho phép truy cập internet, Gemini đoán mật khẩu trong một trường hợp và dùng thông tin đăng nhập bị lộ trong hai trường hợp còn lại.
Google xác nhận Gemini đột nhập vào ba công ty trong một thử nghiệm bảo mật vào tháng 5. Nó đoán mật khẩu ở một công ty và tìm thấy chi tiết đăng nhập trong mã công khai cho hai công ty còn lại.
Gemini được thông báo rằng nó đang ở trong một bài đánh giá hack hư cấu; Irregular vô tình mở kết nối internet sau khi bài đánh giá bắt đầu; ngay khi Gemini nhận ra đã hack một công ty có thật, nó lập tức dừng lại.
Dòng thời gian: Tháng 5 Gemini hack 3 công ty trong đợt đánh giá của Irregular; tháng 7 Irregular báo Google; tháng 8 Irregular công bố báo cáo nhưng không nêu tên Gemini; tháng 9 vụ việc xuất hiện trên bài báo độc quyền của WSJ.
Still to check
Kiểm tra bài báo gốc của WSJ và công bố từ Irregular/Google để xác nhận chi tiết kỹ thuật về cách Gemini vượt qua phạm vi sandbox và liệu model có tự động dừng lại khi phát hiện mục tiêu là hệ thống thực hay không.
08 · 19 Sept 2026 · gemini · 1 sources
Hệ thống đa tác tử Stellar Colosseum kết hợp Gemini 3.1 Pro và Gemini 3.7 Flash đạt tỷ lệ thành công 71.0% trên bộ benchmark chứng minh định lý TCS-Bench.
Condition: Khi sử dụng hệ thống nhiều tác tử Stellar Colosseum để phân chia bài toán thành các phân đoạn và kiểm định song song
Với Gemini 3.1 Pro và Gemini 3.7 Flash, nó đạt 71.0% trên TCS-Bench, một bộ tác vụ chứng minh định lý cấp độ nghiên cứu.
Still to check
Đọc bài báo nghiên cứu của Google Research về Stellar Colosseum để kiểm tra phương pháp đo benchmark TCS-Bench, số lượng mẫu và cấu hình cụ thể của Gemini 3.1 Pro và Gemini 3.7 Flash.
09 · 19 Sept 2026 · gemini · 1 sources
Google tích hợp Deep Research vào Gemini Live, cho phép người dùng kích hoạt tạo báo cáo nghiên cứu chuyên sâu qua giọng nói và model sẽ xử lý bất đồng bộ ở chế độ nền.
Deep Research tích hợp vào Gemini Live. Dùng giọng nói để khám phá chủ đề theo chiều sâu; chỉ cần yêu cầu Gemini App chạy báo cáo Deep Research, sau đó Gemini sẽ làm việc bất đồng bộ ở chế độ nền và gửi thông báo khi báo cáo nghiên cứu hoàn chỉnh sẵn sàng.
Kiểm tra xem tính năng Deep Research kích hoạt bằng giọng nói trên Gemini Live có thực sự chạy nền khi khóa màn hình hay đóng ứng dụng và gửi thông báo hoàn thành không.