Agents Are Going Async
Async subagents let an agent stay responsive while background workers run long tasks. How the orchestrator, notifications and approvals work in Deep Agents.
Today's news
Agents & automation / 01Agents Are Going AsyncLangChain
01 / IN FOCUS
Agents Are Going Async
LangChainModels / 02AGORA: Reliability-Aware Aggregation of LLM Judges via Item-Response TheoryarXiv cs.AI
02 / IN FOCUS
AGORA: Reliability-Aware Aggregation of LLM Judges via Item-Response Theory
arXiv cs.AISafety & governance / 03AtomicFaaS: Offloading Side-Effect Compensation to the Serverless PlatformarXiv cs.DC
03 / IN FOCUS
AtomicFaaS: Offloading Side-Effect Compensation to the Serverless Platform
arXiv cs.DCAI NEWS × FOXAIFind your next step
Explore AI tools From the latest news to tools that work for you.
Discover AI tools
Swipe to explore →E
EvoMapAgents & automation
AI ShortWriting & content
KiroCoding & development
JAXModels & infrastructure
Open DesignDesign & 3D
MemoAIMusic & audio
Zoom WorkplaceOffice & productivity
AssemblyAIMusic & audio
My Glow Up AILife & personal
FinBusiness & support
EvoMapAgents & automationEvoMap is an infrastructure designed for the reuse of AI agent experiences. It organizes reusable strategies and repair assets with validation records via the GEP protocol, offering market- and quality-based ranking to help different agents discover, evaluate, and inherit existing capabilities.
分类推荐榜首AAI ShortWriting & contentAIS ALERT MANAGEMENT AND SHARED PLATFORM, QUICK COMMAND FOR MULTIPLE SCENARIOS
分类推荐榜首KKiroCoding & developmentKiro is an AI engineering tool for developers that organizes requirements into specifications, architectures, and tasks, generates code via agents, and supports the entire workflow—from planning to code review—through property-based testing, execution memory, and integration with development tools.
分类推荐榜首JJAXModels & infrastructureJAX is a Python numerical computing library designed for accelerators, specifically tailored for high-performance array computations and large-scale machine learning. It efficiently executes the same code across multiple hardware backends, including CPUs, GPUs, and TPUs.
分类推荐榜首OOpen DesignDesign & 3DOpenDesign is an open-source design workspace that can connect to local programming agents, use built-in model keys, or leverage cloud-based models, enabling the creation and editing of prototypes, web pages, presentations, and graphics within a design system; local software is free, while model services incur fees.
分类推荐榜首MMemoAIMusic & audioMemoAI is an AI-powered audio-to-text tool that supports localized processing, eliminating the need to upload data and ensuring privacy and security. It can efficiently transcribe YouTube videos, podcasts, and local audio/video files (such as MP4, MP3, AAC, M4A, etc.) into text, while offering core features like multilingual translation, speaker diarization, real-time subtitles, and floating notes—making it ideal for meeting minutes, interview transcription, content learning, and more.
分类推荐榜首ZZoom Workplace is Zoom’s team collaboration platform, integrating video conferencing, chat, calendars, and documents, and leveraging built-in AI to organize discussions, draft messages, and track follow-up tasks.
待评分 · 分类列表推荐AAssemblyAI is a speech AI platform for developers, offering pre-recorded, real-time, and short-form synchronous transcription APIs. It enables the building of voice-based applications by integrating capabilities such as speaker identification, emotion analysis, chapter and summary extraction, as well as speech agent functionality, dictation, and sensitive information processing.
待评分 · 分类列表推荐MMy Glow Up AILife & personalMy Glow Up AI provides free analysis based on selfies, without requiring registration, and can generate hairstyle recommendations and beauty plans that suit you.
待评分 · 分类列表推荐FFinBusiness & supportCLIENT-ORIENTED AI SMART BODY。
待评分 · 分类列表推荐AI, as it happens
1307 published stories1307 storiesClear filters ×
2026-11-06
Follow the timelineAGORA: Reliability-Aware Aggregation of LLM Judges via Item-Response Theory
arXiv:2611.05556v1 Announce Type: new Abstract: LLM-as-a-judge is a common substitute for costly human evaluation, and aggregating several judges is the standard remedy for any single judge's bias. Judge pools mix judges of very different reliability, while the human-labeled sets that validate them hold a few hundred items or fewer. In this regime the per-item mean weights weak judges as heavily as strong ones, and confusion-table models such as Dawid-Skene must estimate a per-judge error table from too few items. We propose AGORA (Aggregation Of Reliability-weighted Assessments), an item-response-theory aggregator that places every item on one latent quality scale and describes each judge by a sensitivity parameter and ordered rating thresholds, so judge reliability is learned from all items jointly and without human labels. Across three benchmarks, AGORA matches or exceeds Dawid-Skene on large evaluation sets, and its advantage widens as the set shrinks toward a few hundred items. It remains accurate as pools grow more uneven, a label-free dispersion statistic indicates in advance when trust weighting helps, and its learned trust weights track per-judge human validity.
AtomicFaaS: Offloading Side-Effect Compensation to the Serverless Platform
arXiv:2611.06601v1 Announce Type: new Abstract: Function-as-a-Service (FaaS) simplifies distributed application development by offloading operational concerns to the platform, but developers remain responsible for recovering from failures. Retries require idempotent functions, which means that developers have to write complex, error-prone code that undoes or skips the already completed operations of a failed function. To address this, we propose AtomicFaaS, a platform extension that provides semantic atomicity for the external side effects of a function invocation, whether the function fails or its instance crashes, without developer-written compensation code. AtomicFaaS intercepts outbound calls and records their effects in a fault-tolerant log, from which the platform compensates leaked effects outside the failed instance. Compared with a manually implemented saga, AtomicFaaS eliminates compensation code and leaves no compensatable effects after any tested failure, while adding ~1 ms per intercepted call. Under load, it lowers the sustainable throughput of CPU-bound functions, while its latency overhead becomes negligible once calls to external services dominate the invocation time.
Augmentation with Reinforcement Transformation for Low-textured Scientific Sketch Image Retrieval
arXiv:2611.05408v1 Announce Type: new Abstract: Low-textured sketch images are widely used in scientific applications, including wildlife conservation, archaeological illustration, and forensic composites. Learning from and retrieving such images is challenging because they lack detailed surface textures and visual variations commonly exploited by modern deep learning models. This paper proposes Augmentation with Reinforcement Transformation (ART) to fine-tune pretrained models to learn effective representations for accurate sketch image retrieval. Our key observation is that sketches are particularly sensitive to image transformations, such as rotation, flipping, zooming, and stretching. While some transformations preserve their structural integrity, others may introduce distortions that hinder representation learning. Instead of randomly choosing transformations to construct fine-tuning views, ART formulates augmentation selection as a multi-armed bandit (MAB) problem, where transformations are treated as arms and their effectiveness is continuously evaluated through rewards. This enables ART to adaptively construct reward-guided view banks before self-supervised fine-tuning; the subsequent representation loss does not feed back to ART. On Florida manatee sketches provided by Mote Marine Laboratory, ART achieves 71.40% average Top-1 accuracy for transformed-scar retrieval, compared with 68.83% for random augmentation selection, and 55.84% for location-aware sketch retrieval, compared with 18.18% for frozen CLIP.
b12131
The update removes the u8path() function and replaces it with generic_string() in the server component, as part of a broader effort to streamline and standardize string handling across platforms.
b12132
The latest release of llama.cpp, version b12132, includes the removal of u8path() in favor of generic_string(), along with updated binaries for multiple platforms including macOS, Linux, Windows, Android, and openEuler, supporting various backends like CUDA, Vulkan, ROCm, OpenVINO, and SYCL.
b12135
The latest release of llama.cpp (b12135) introduces support for MEAN operations in WebGPU, enhancing performance and functionality across multiple platforms including macOS, Linux, Windows, Android, and iOS. The release includes precompiled binaries for various architectures and backends such as CUDA, Vulkan, ROCm, OpenVINO, SYCL, and zDNN, with specific builds for Apple Silicon, Snapdragon devices, and openEuler systems. Some features remain disabled or are under development.
b12136
The update addresses an issue in llama.cpp where the number of GPU layers was incorrectly calculated by not accounting for skipped NextN layers, leading to improper layer distribution between CPU and GPU. The fix ensures that skipped NextN layers are included in the n_gpu_layers count and properly assigned during model loading, resolving a bug where layer 0 remained on the CPU despite offloading all other layers.
b12137
A recent update to llama.cpp addresses a critical issue by rejecting non-object session updates in the server, preventing malformed realtime session data from causing uncaught exceptions and server termination. The release includes binaries for multiple platforms including macOS, Linux, Windows, Android, and iOS, with support for various backends like CUDA, Vulkan, ROCm, OpenVINO, and SYCL.
b12138
The update introduces optimized Metal kernel usage for matrix multiplication with K values between 32 and 64, and adds a new kernel for BF16 x BF16 matrix multiplication, improving performance on Apple Silicon devices.
ClickHouse expands collaboration with Microsoft, bringing Fabric integration, deeper OneLake interoperability, and enterprise deployment flexibility
ClickHouse expands its Microsoft collaboration with a native Fabric workload, OneLake read and write capabilities, and ClickHouse BYOC availability in the Microsoft Marketplace.
ClickHouse Workload for Microsoft Fabric: sub-second analytics on OneLake, now in public preview
ClickHouse Workload for Microsoft Fabric brings sub-second analytics to OneLake data through a native Fabric workload, with dedicated ClickHouse Cloud compute for agents, dashboards, and applications.
Cognitive Bias Signatures in Search-Equipped LLM Agents: A Stage-Resolved Analysis
arXiv:2611.05720v1 Announce Type: new Abstract: Search can help LLM agents correct mistakes, but their starting conditions may shape which evidence they find and use. Drawing on cognitive-bias paradigms, we develop a controlled search harness to examine result order, records of prior work, and initial hypotheses while holding each question and document collection fixed. Matched controls distinguish order effects from differences in document composition and the effects of failed work from context length. Across 10 models and 1,000 synthetic search worlds, we track queries, retrieved documents, document openings, and final answers. Our comparisons suggest that final answers are more sensitive to initial evidence order during active search than when all evidence is supplied in full. Dead-end histories can reduce strategy switching relative to matched neutral histories, indicating an effect beyond context length. Under wrong hypotheses, stage measurements distinguish reduced retrieval or opening from errors that persist after counter-evidence is opened. Exploratory interventions show that opening counter-evidence more often can coincide with lower accuracy, while accuracy can improve with little change in opening.
Configure, Certify, and Operate Kubernetes GPU Clusters with NVIDIA DSX OS
One underperforming GPU can slow an entire distributed training job. The node may pass basic health checks and show normal utilization, leaving operators to...
Discarded or Unreachable? Diagnosing and Repairing Spatial Relation Failure in Vision--Language Similarity
arXiv:2611.05565v1 Announce Type: new Abstract: Contrastive vision-language models score left/right relations near chance, but the symptom has two causes that call for opposite repairs: the relation may survive in the pooled embedding yet be unreachable by native image-text similarity, or pooling may discard it while the dense features retain it. On clean two object photographs, across ten encoders, the lateral polarity is linearly decodable from the flip odd component of the pooled vector at 0.77-0.99, yet a search over a million captions leaves nine of the ten at chance under native scoring: an access failure. On controlled C4 orbits, where the relation is the only thing that varies, pooling keeps the arrangement axis at 0.998-1.000 and loses its polarity, which the patch grid retains: a pooling failure. Both sit downstream of the dense features, so one readout covers both. Our zero parameter, query conditioned spatial moment recomputes the geometry from the patch grid and stores it as a vector beside the native embedding. On a 118,287 image index it raises left/right pairwise accuracy against reversed geometry negatives from 0.51-0.53 to 0.81-0.96 and conditional R@1 among 21 category matched candidates from 0.05 to 0.37-0.75, at under a millisecond per batched query, while reproducing the native ranking exactly for queries that name no relation.
Faster Retrieval for Better, More Efficient RAG
Maximum inner product search (MIPS) sits at the core of recommendation systems, search, and retrieval-augmented generation (RAG). Given a query vector, MIPS systems search within a database of millions of candidate key vectors for the one that best matches the query. The original data point associated with that best-matching key is then used to handle the query: in RAG, the document that is best suited to answer the question is typically prefixed to the query. As the number of keys grows to millions and vector dimensions reach thousands, the computational cost of running an exhaustive…
From Activation to Intervention: Interpreting Sparse Visual Features through Reconstruction
arXiv:2611.05522v1 Announce Type: new Abstract: Sparse autoencoders (SAEs) decompose visual representations into individual features, offering a promising basis for explaining model behavior. Interpreting these features typically relies on images or pixel regions that most strongly activate them. However, this evidence becomes ambiguous when multiple features with different semantics frequently activate in the same locations, such as texture and color in the same patterns. We propose Reconstructive SAE Intervention (RecSAEI), a framework that shifts feature explanation from passive observation to active visual reconstruction. By intervening on representations along SAE decoder directions and reconstructing the visual output, we provide direct evidence of a feature's semantic meaning. We demonstrate that our method successfully disambiguates feature meanings across multiple datasets and vision encoders. Furthermore, our framework grounds [CLS] SAE interventions in a sparse set of patch SAE decoder directions. Beyond stable target response, this attribution also exposes the compositional relationship between elementary visual patterns and high-level semantics. Our results advocate for intervention reconstruction as an essential complementary signal for explaining neural networks.
From Tokens to Trajectories: Parameter-Efficient Continuous Adaptation of Unified Multimodal Models
arXiv:2611.05451v1 Announce Type: new Abstract: While discrete tokenization in Unified Multimodal Models (UMMs) establishes strong semantic reasoning, it introduces a strict quantization bottleneck that degrades fine-grained visual details, often resulting in structurally accurate but artifact-heavy images. We introduce FlowShift, a parameter-efficient post-training framework that bypasses this bottleneck by converting pre-trained discrete UMMs into continuous rectified-flow generators. Instead of discarding the backbone's semantic priors, FlowShift replaces discrete visual interfaces with continuous latent projections and applies LoRA to the attention layers. To efficiently boost visual quality without semantic drift, we propose Dual-Objective Velocity Vector Distillation (DOVD), which aligns the model with a high-fidelity continuous teacher and ground-truth continuous trajectories. This approach drastically improves perceptual quality while preserving prompt adherence and reasoning. When applied to leading discrete UMMs, FlowShift significantly improves COCO-30K FID and aesthetic scores, while retaining over 99.5% of multimodal understanding capabilities. Ablations confirm DOVD drives generation quality. Ultimately, FlowShift achieves high-fidelity continuous generation without sacrificing pre-trained semantic grounding.
Gemini Omni 1.2 Flash: Fast and cost-effective with longer clips
Google DeepMind has launched Gemini Omni 1.2 Flash, introducing native 15-second video generation, improved reference adherence, stronger consistency across frames, multi-turn conversational editing, more natural speech, and cinematic camera movements. The model is now generally available via the Gemini API and Gemini for business, priced at $0.07 per second for 720p video—30% lower than its predecessor. It supports scalable workflows, including draft generation at lower resolutions, iterative edits, and upscaling to 1080p or 4K. Use cases include product explainers, social ads, virtual try-ons, and branded content, with applications across Google AI Studio, Google Cloud, Google Vids, Flow, the Gemini app, and Google Ads.
Every update links back to its source.