Skip to main content

Daily report

AI and science frontiers · 2026-11-06

Only content delivered through the publication boundary on this date is included.

Sealed edition v1

arXiv

Learn a function representation once, then freeze it: Daedalus beats GAOT on 23 of 28 PDE tasks and trains 2.1 times faster on average

Daedalus separates function-representation learning from operator learning: a functional autoencoder is pre-trained only on analytic functions synthesized on the fly, with no solver and no labels, and the latent space it induces is frozen and reused across tasks. On 28 benchmark problems spanning fluid dynamics, solid mechanics, acoustics, and the Helmholtz and Poisson equations, operators on the frozen representation have lower relative error than the end-to-end framework GAOT on 23 of them and train 2.1 times faster per problem on average; that comparison excludes the one-time backbone pre-training.

bioRxiv

Cell fate gets an inverse design loop: LabCompass lifts erythroid progenitors to 22% in four lab rounds

Culture conditions combine continuous doses, so testing them exhaustively is impractical, and earlier work could only rank predefined candidate designs or search a discrete catalogue. LabCompass couples a flow-matching generative model with a forward surrogate that predicts cell phenotypes, using the surrogate's gradient at inference time to steer sampling toward recipes expected to produce a target cell state. In primary human cord-blood CD34+ cells, four experimental loops produced a 78-million-cell spectral flow cytometry dataset, recovered a known megakaryocyte-inducing recipe the model had never seen, and raised erythroid progenitors to 22%, roughly 1.6-fold over the control condition.

Kohn–Sham Hamiltonian learning adds state-space supervision: total-energy error on ∇2DFT falls to one five-hundredth of the strongest baseline

Machine-learned Kohn–Sham Hamiltonians trained only on matrix-element error leave large errors in derived electronic properties, because the operator-to-state mapping is highly anisotropic. DSHam adds supervision on the density matrix, real-space electron density and occupied orbital energies obtained by solving the predicted Hamiltonian. On the ∇2DFT benchmark, electron-density and total-energy errors drop by factors of 40 and 500 relative to the strongest competing method, and the model extrapolates to molecules with twice the training heavy-atom count.

Nature Methods

DIRAC folds spatial multi-omic integration and annotation into one model, and finds a microvascular proliferation domain other methods missed in glioblastoma

Spatial multi-omic data pose two jobs at once: merging molecular layers such as RNA and protein measured on the same tissue section, and transferring cell-type labels from a reference dataset onto a new sample. DIRAC treats both as domain adaptation, using a graph neural network and an adversarial discriminator to learn embeddings that are insensitive to batch and modality but discriminative for cell type. On simulated and real DBiT-seq data it beat comparison methods on domain recovery and mixing, and in glioblastoma tissue it identified a microvascular proliferation domain the other methods missed.

No cuff calibration needed: AI-PPG-ACC-HTN flags hypertension in 196 people with 90.0% specificity

Google Research, with Beth Israel Deaconess Medical Center and Harvard Medical School, used the photoplethysmography and accelerometer signals of a consumer smartwatch to passively identify a persistent hypertensive state without cuff calibration. Rather than estimating systolic and diastolic pressure at a moment in time, the system averages 15-second signal features over multiple days and combines them with height in a regularized logistic regression that outputs a probability. Against 24-hour ambulatory blood pressure monitoring in 196 participants free of known cardiovascular disease and not taking blood pressure medication, initial screening reached 65.8% sensitivity and 90.0% specificity, versus 55.3% sensitivity for concurrent office screening.

arXiv

LeanGuard blocks forbidden tool calls before they run: direct prompt-injection success on DTap falls from 57.9% to 5.9%

Tool-using language-model agents often execute actions their domain policies forbid, and LeanGuard places policies written in Lean 4 between the model and its tools so that only admitted calls execute. On τ 2-bench, unguarded runs of five Qwen models executed at least 33 calls the Lean policy forbids, while LeanGuard executed none; on DTap, direct prompt-injection success fell from 57.9% to 5.9% and indirect success from 22.3% to 3.8%. Denials with feedback did not significantly change task success, and the read-only deployment blocks many benign writes.

NVIDIA's Kumo Relational predicts straight from relational databases, no training or table flattening required

NVIDIA released Kumo Relational, a pre-trained relational foundation model that predicts directly on enterprise relational databases without task-specific training, feature engineering, or flattening tables into one wide row. Across 41 tasks on 15 databases it beats supervised relational deep learning models and expert-engineered gradient-boosted tree pipelines, and on the SAP SALT enterprise benchmark it exceeds AutoGluon ensembles by 8% in mean reciprocal rank. A prediction is stated as a declarative query, and the model answers it in a single forward pass using historical examples as context.

bioRxiv

PALM learns overlapping domain and site labels together, reaching 0.941 domain-occurrence F1 on 2.3 million held-out proteins

Protein sequence databases are growing far faster than curated annotation, and existing language models learn only from sequence likelihood, so InterPro domain and functional-site knowledge stays indirect. PALM builds on ESM2 with LoRA adaptation, learned layer aggregation and a bidirectional LSTM encoder, and uses a soft-target loss that lets one residue keep several valid labels. On 2,309,606 held-out proteins it reached domain- and site-occurrence F1 of 0.941 and 0.877, and still 0.857 and 0.828 in the subset below 20% sequence identity.

arXiv

CellCanon links perturbation prediction, sourced explanation and observation-driven updating in one world state, letting a single new measurement revise unmeasured cell lines

Single-cell perturbation screens still leave many compounds and cell contexts unmeasured, and CellCanon puts expression prediction, source-grounded explanation and observation-driven updating into one shared world state. A language model compiles drug and target evidence, and numerical readouts then guide single-cell generation; on 339 held-out SciPlex3 conditions it reaches differential-expression AUPRC 0.8067 and Macro-F1 0.8164, against 0.4938 and 0.6961 for the best baseline. In simulated experimental feedback, one measured source context per drug lifts differential-expression AUPRC to 0.9077 for unmeasured cell lines with a fixed-weight updater.

arXiv

FactorSpec turns relational constraints into speculative drafts, accepting up to 10.5 tokens per verify step while every record stays valid

In structured output, relations among a record's fields could determine many tokens, yet serving engines draft from the prompt or a learned head and grammar masks enforce only syntax, so models often violate those relations. FactorSpec compiles a JSON Schema and its relations into a factor graph, treats tokens the constraint uniquely determines as certain drafts through an exact feasibility check, and picks a verify width per request. In SGLang its drafts accept up to 10.5 tokens per verify step on trip planning, up to 1.9 those of the fastest n-gram drafter shape, and decode up to 1.43 faster than speculators tuned per load, at a grammar mask's cost.

bioRxiv

RPI-Zero predicts RNA-protein binding from sequence alone, leading all eight metrics on unseen RNAs, proteins and pairs

RPI-Zero reads a full-length protein and a whole spliced transcript in one input and returns a binding probability from sequence alone, with no structure and no interaction data for a new molecule. Its companion benchmark draws on 11.6 million CLIP peaks for 209 proteins from four public databases, splits whole sequence-similarity clusters into training and test, and matches negatives to positives in length and transcript popularity. On the unseen-RNA, unseen-protein and unseen-pair test slices its AUPRC is 0.753, 0.637 and 0.589, which is 2.7%, 7.4% and 4.6% above the second-best method on each slice.

Nature

Glioblastoma's malignant states are not scattered at random: a developmental-to-injury-and-hypoxia trajectory layers around the necrotic core

Glioblastoma malignant states were treated as parallel subtypes, and a single biopsy could not represent the whole tumour. Pairing single-nucleus and spatial transcriptomics across 12 IDH-wild-type primary tumours and 57 sampling sites revealed a trajectory from developmental-like states toward glial injury response and hypoxia, layered in space from the infiltrating edge to the necrotic core; the trajectory appears across tumour subtypes and genetically distinct subclones and is recapitulated in patient-derived organoids.

arXiv

Image-editing agents stop guessing which model to retry: RetryRoute plans over failure history and beats the strongest prior baseline by 2.8 points at the main budget

Web agents edit images by calling open editing models in a critique-and-retry loop, yet a retry after a rejection succeeds only 17–53% as often as a first try, while existing routers treat each retry as an independent draw. RetryRoute estimates each model's next-attempt success probability from the request's failure history, plans retries, escalations and abandonment over failure states, and charges live queue waits to the cost. At the main budget it exceeds the strongest of eleven prior baselines by 2.8 points on average over eight groups, and on a three-GPU serving testbed one setting raises the share of edits meeting the service objective by 5.0–6.3 points over the best prior baseline at every load.

arXiv

Frozen models improve without weight updates: TextualRL turns repeated same-task attempts into context patches, gaining up to 24.4 points on a six-benchmark average

TextualRL critiques a group of rollouts from the same task under the same context as a unit, rather than an isolated trajectory, and writes reviewed textual patches back into the shared context while model parameters stay frozen. Across five target models and six benchmarks it reaches the highest six-benchmark average for every target, gaining 11.4 to 24.4 percentage points over the no-skill baseline and 0.9 to 3.2 points over the strongest baseline, SkillOpt.

Medical contrastive learning stops forcing invariance: ProbSSL models embeddings as distributions and reaches 84.89 mean Dice on BTCV

Medical self-supervised contrastive learning assumes two augmented views of the same image should share one semantic representation, but rotation and intensity perturbations can erase subtle yet critical anatomical and pathological cues, so rigid alignment suppresses task-relevant information. ProbSSL models each image embedding as a Gaussian, with the mean carrying shared semantics and the variance recording augmentation-induced variability, and aligns distributions by KL divergence so dimensions with larger variability receive weaker alignment pressure. After pre-training on CT, transfer to BTCV, MM-WHS, CC-CCII and BraTS gives higher average scores than the compared general and medical self-supervised methods on all four downstream tasks, including 84.89 mean Dice on BTCV.

arXiv

Cryo-EM skips the density-map detour: EB-FM learns atomic-coordinate conformational distributions straight from 2D projections

Standard cryo-EM pipelines first reconstruct a 3D density from 2D projections and only then fit an atomic model, so atomic-coordinate priors never reach the most under-determined stage. EB-FM trains a flow-matching prior inside a Monte Carlo stochastic-approximation expectation-maximization loop, repeatedly inverting the nonlinear imaging forward model during training, so no clean structures are needed for pretraining. On simulated cryo-EM data with known poses it recovers conformational distributions directly in atomic-coordinate space for four proteins, though predicted motion amplitudes stay below the molecular-dynamics ground truth.

OpenAI News

GPT‑6 Cyber ships with ExploitGym at 48.5%, up from 32.1%, and 99.93% avoidance of out-of-scope exploitation

OpenAI released GPT‑6 Cyber for security research, scoring 48.5% on ExploitGym, which tests whether a model can exploit a specified vulnerability, up from 32.1% for GPT‑5.6 Cyber. In a separate alignment evaluation, the model avoided exploiting out-of-scope services in 99.93% of tests without its deployment prompt, versus 94.49% for GPT‑5.6 Cyber, and reached 100% with the prompt. OpenAI says it has been used to develop 948 privilege escalation exploits in Linux and to find 81 previously unknown high-severity vulnerabilities in Firefox.

arXiv

Every generative model eventually fails a large enough test: SIGMA profiles fit uncertainty and keeps the same model trustworthy on test sets an order of magnitude larger

A generative model fitted to a finite training set is never exactly the true density, so any sufficiently powerful goodness-of-fit test will eventually reject it once the test sample is large enough, even when the model family is correct. SIGMA writes the parameter uncertainty of a Gaussian mixture model as a tractable covariance from its score functions and Fisher information, then promotes the conventional point-null test to a composite null in which that uncertainty is profiled as a nuisance parameter. On a two-dimensional toy model and on a QCD background benchmark in a learned jet embedding, including the uncertainty keeps the same model trustworthy on test sets an order of magnitude larger than the standard test allows.

LMSYS Org

Native NVFP4 RL destabilizes late in training: miniTE lifts full learner updates to about 1.33–1.37× BF16

Native NVFP4 reinforcement learning starts with normal reward gains, then develops abnormal entropy, a widening train–sampling log-probability gap and falling reward late in training. miniTE separates quantization policy, linear layers and compute backends, and adds per-token scaling, contiguous layouts and amax reuse; on 8×B300, both miniTE paths with BF16 backward reach roughly 1.33–1.37× paired speedup over BF16 on complete learner updates, while a separate fixed-output serving test reaches about 1.64× throughput. These learning and system results come from different configurations and do not yet establish an end-to-end RL speedup.

arXiv

Subgroup discovery stops folding support into one score: AtomSD returns the most deviating subgroup at any support threshold

Subgroup discovery has long compressed deviation and coverage into a single weighted score, so a user-specified minimum support often has no matching most-deviating subgroup. AtomSD recasts the search as selecting among a finite set of homogeneous regions, called atoms: in theory the optimal subgroup at every support threshold is a union of whole atoms plus at most one partial atom. On 19 UCI benchmark datasets it reaches an average rank of 1.25 across five support thresholds and is best in 78 of 95 dataset-threshold combinations, and it improves subgroups returned by four existing methods when used as post-processing.

arXiv

Meta hands ranking-model scaling laws to an automated search: 34 shipped iterations average 0.66% lower normalized entropy and 0.36% cumulative online lift

Meta's ads ranking and retrieval fleet no longer allocates capacity by hand, one model at a time. Previously each scaling decision cost days to weeks of training, and the architecture dimensions are coupled, so they cannot be enlarged independently. Axia maps embedding dimension, interaction depth and interaction width through a scaling layer into complete architectures, then uses Bayesian surrogates to pick a small number of training trials. Across 34 model iterations in two development cycles, offline normalized entropy improved by a mean 0.66% relative and the online key metric by a cumulative 0.36%.

arXiv

Optimization algorithms stop being rewritten each time: treating iteration trajectories as experience yields a model that transfers across problems and larger dimensions

Iterative optimization algorithms can be turned into trainable models instead of being repeatedly rewritten as programs. The approach treats algorithm execution trajectories as computational experience, models optimization autoregressively so that the preceding generation forms the computational context for the next population, and uses a dimension-independent population-temporal architecture to capture both population interactions and iterative dynamics. The model first acquires search knowledge by imitation from heterogeneous teacher algorithms, then improves itself directly through optimization feedback, consolidating heterogeneous search knowledge into a single model that transfers to unseen, substantially larger dimensions.

Agent training stops grading only the ending: STEP-VERIFIER scores each step from prefix splits in logged runs

Tool-using language-model agents often need dozens of interactions before a single success-or-failure label arrives, leaving no way to tell which step went wrong. STEP-VERIFIER turns a success-labeled corpus of logged interactions into action-level comparisons: the difference in average final return between two continuations that share a common prefix labels which of two actions was better, and a Bradley-Terry ranking head converts those pairs into calibrated per-step scores. On Llama-3.1-8B-Instruct and Mistral-7B-Instruct backbones, it beats outcome-only GRPO on the average metric in all six benchmark-backbone combinations across GAIA, ToolBench and AgentBoard, and its per-action scores agree with human judgments on 81.5% of pairs.

Robots mislabel what they remember: UQ-DAAAM fuses multiple views to fix captions, lifting accuracy 5%

A robot that files a hallway defibrillator under fire extinguisher would carry that wrong description in memory. MIT researchers added uncertainty quantification to the existing DAAAM memory system, so the robot compares descriptions of the same object from different viewpoints, estimates how unsure it is about what it saw, and selects extra views to fuse a more accurate caption. Against baseline methods, the system raised object-description accuracy by 5 percent and resolved ambiguity for about 92 percent of objects using only two additional captions per object.

Microsoft releases VibeVoice-ASR-Streaming: transcription emits speaker, time and content per chunk as speech arrives

Microsoft released VibeVoice-ASR-Streaming, which turns the "who said what" transcription that previously required processing a whole audio segment into continuous output as speech arrives. The earlier VibeVoice-ASR handled 60-minute long-form audio in a single pass, producing structured transcriptions with speaker, timestamps and content within a 64K token length. The new model emits text once per chunk and supports customized hotwords and 10 languages.

arXiv

Visual tokens need not be ranked alike: BtsPruner keeps 32 of 576 and retains 91.6% of the dense model's performance

Large vision-language models process hundreds to thousands of visual tokens per image, and inference cost rises with them. Earlier training-free pruning methods ranked all visual tokens by one importance criterion, overlooking that tokens take on different roles as encoding proceeds. BtsPruner locates the role transition from changes in attention concentration, then picks globally referenced representative tokens from later layers and recursively retrieves local detail tokens from earlier layers, preserving both roles under a fixed budget; on LLaVA-1.5-7B it keeps only 32 of 576 visual tokens (5.6%) and retains 91.6% of the dense model's performance.

Visual assistant evaluation moves into closed-loop simulation: top model Gemini 4 Argon reaches only 53.4% task success within the time limit

Salesforce AI Research released Interactive Visual Gym (IVG), which moves visual AI assistant evaluation from passively watching pre-recorded video to closed-loop simulation: the assistant watches the user's live feed and speaks guidance, and the simulated user changes its actions in response. The accompanying IVG-Bench covers 315 complex scenarios across three operational environments and evaluates 14 visual assistants; the strongest, Gemini 4 Argon, reaches only 53.4% task success within the time limit, averaged across the three environments. In an early proof of concept, an open-source model trained with the simulator, Gwen 3.5-4B, rose from 33.3% to 42.2% success on entirely new tasks it had never seen during training.

Claude Console adds organization-wide IP allowlisting: a leaked API key is confined to listed addresses

Anthropic now offers an IP allowlist for organizations in the Claude Console, in beta, and requests to covered services from addresses not on the list are refused, which limits where a leaked API key can be used. Admins can add IPv4 and IPv6 addresses or CIDR ranges, up to 1,000 per organization. Previously an organization could not narrow the entry point for requests by source address in the console; this setting shrinks the usable range after a key leak from any address to the listed ones.

arXiv

Agent policies outgrow the prompt: AgentPolicyForge trains guards that cut attack success by 40–44% relative

Writing tool, resource and execution policies into a task agent's prompt does not reliably prevent violations. AgentPolicyForge uses executable environments to build policy benchmarks and iteratively train policy guards, yielding PolicyGym, which spans ten policy families with 698 scenarios for training-data generation and 254 separate held-out scenarios. On PolicyGym, the final guard-based configuration achieves a 40–44% relative reduction in attack success rate and fewer benign rejections than policy prompting alone.

Proteomics gets a billion-scale spectral corpus: MassNet holds 548 million PSMs and leads de novo sequencing across 15 species

Proteomics has plenty of public mass spectra, but mixed formats, missing metadata and a human-heavy species mix make them hard to train deep models on. MassNet gathers DDA data from 648 projects across 35 species, holds 548 million PSMs, and stores spectra in the tensor-based MSDT format with traceable metadata. On a benchmark spanning 15 species and 9.66 million PSMs, the XuanjiNovo model trained on this corpus reaches peptide recall of 0.45 on human and 0.68 on mouse data, and 0.25 on tomato, above the listed de novo sequencing models.

arXiv

Molecular graph networks stop reading only the last layer: PRISM lets each atom pick its message-passing depth, improving four of six endpoints on a pre-trained GIN

Molecular properties depend on chemical structure at different ranges, yet graph neural networks usually fix one propagation depth for every atom. PRISM turns each atom's own encoded features into a bounded scalar that positions a unimodal distribution over retained message-passing states, so the allocated depth is analytically tractable and moves monotonically with that scalar. Under matched scaffold partitions and tuning budgets, PRISM trained from scratch reaches the lowest or tied-lowest mean error on ESOL and FreeSolv, and on a pre-trained GIN it improves on last-layer readout on four of six endpoints.

arXiv

RSI-Env lets an agent rewrite both model and harness, then hands the next round to the accepted version, with gains even without benchmark feedback

RSI-Env places model training and harness modification in one persistent sandbox, with an independent Host Controller handling services, validity checks, versioning and capability evaluation, and in Self mode each accepted model–harness version takes over the next improvement round. Starting from Qwen3.8-27B with a minimal harness, Open-General Self, which receives no benchmark feedback, raises GPQA Diamond accuracy from 65.2% to 73.2% and AIME 2026 from 53.3% to 56.7%; Knowledge Self lifts SimpleQA from 82.0% to 85.0% and then 88.0%, while the same runs fall back on other benchmarks.

aclanthology.org

Masked diffusion post-training stops sampling blocks at random: a full-block estimator scores highest on four of five benchmarks

Post-training for masked diffusion language models relies on Monte Carlo estimates of a blockwise surrogate objective, and the existing scheme samples the block index at random, so one block may be evaluated repeatedly while others are never evaluated. A full-block estimator evaluates every block exactly once and averages the results; analysis shows it stays unbiased and removes the between-group variance from block selection. Across five benchmarks in mathematics, planning and coding it reaches the highest accuracy on four, averaging 12.79 points above the random block sampling baseline.

arXiv

MinimalLM cuts LLM output by 47.6% without retraining, and none of 990 answers ends mid-sentence

Long LLM answers raise inference latency and compute cost, yet prompt-only conciseness is hard to control and early stopping can cut sentences in half. MinimalLM separates when stopping becomes desirable from whether stopping is structurally appropriate: during decoding it adjusts stop-token scores by length and uncertainty, and only lets them take effect at sentence-ending punctuation, closed code fences or balanced brackets. Across three open-source models and 330 questions, generated tokens fell 47.6% with an average quality score of 8.04/10 versus 8.42/10 for unmodified models, and no structurally truncated outputs appeared.

aclanthology.org

Autoregressive training drops strict left-to-right targets: Max(MI(S;t)) reorders by mutual information and lifts arithmetic accuracy to 94.96%

Autoregressive language models normally learn next-token prediction in a fixed left-to-right order; Max(MI(S;t)) instead ranks target tokens by their mutual information with the source and already-selected targets before training, exposing informative targets earlier. On GPT-style models it reaches 94.96% average accuracy across arithmetic tasks, against 74.84% for next-token prediction and 86.29% for reverse order, close to the 97.33% upper bound from exhaustively testing 24 orders; on WikiText-2 it lowers average perplexity from 13.58 to 10.77. Only the training-target organization changes; architecture and autoregressive decoding stay the same.

Mistral Blog

Mistral puts Le Chonk inside Studio: agents, workflows and apps share one managed runtime

Mistral released Mistral Large 4, codenamed Le Chonk, and expanded its enterprise platform Mistral Studio with managed agents and apps plus new workflow, enterprise-context, agent-observability and evaluation capabilities. Previously teams had to build the infrastructure an agent runs on; Studio now hosts execution, and developers connect the model to enterprise data and systems through connectors and MCP servers, then set boundaries on the tools, data and actions it can reach. Mistral says an incident-investigation agent built by its engineering team saves hundreds of hours a month, and a product-operations workflow saves about 35 hours a week.

aclanthology.org

FOM-UL unlearns by editing only a few layers: under 4-bit quantization its residual memorization stays below whole-model baselines with higher retain utility

Unlearning a large language model no longer requires diffuse updates across the whole model. FOM-UL scores each transformer layer by the ratio of its forget-set gradient norm to its retain-set gradient norm, updates only the few high-scoring layers, and adds layers one at a time when forgetting falls short. Across TOFU, KnowUnDo and MUSE-style evaluations it leaves less residual memorization than GA, NPO and KLD baselines while keeping retain-set utility close to the vanilla model, and it holds a favorable forgetting-utility trade-off under 8-bit and 4-bit post-training quantization, though residual memorization does rise under 4-bit relative to full precision.

arXiv

Which side to pass? ZipDrift generates multimodal MPC cost corrections in one step and finishes 600 test episodes collision-free

Short-horizon model predictive control runs fast but cannot see an opponent beyond its horizon, so it needs a learned, context-dependent cost correction; when passing is possible on either side, both corrections are good and deterministic regression averages them into the opponent. ZipDrift instead trains a one-step drifting generator over cost corrections, tilted by closed-loop cost and learned without differentiating through the optimiser, then generates a few candidates ranked by a learned critic. On a straight-track overtaking benchmark with an eight-dimensional stagewise correction, all 600 test episodes were collision-free, against a 4.0% crash rate for an idealised ZipMPC-style regressor.

Cell Discovery

RNA editing sites no longer rest on A-to-G alone: a two-enzyme assay plus InoDREAM yields 590,249 high-confidence inosine sites in HEK293T cells

Locating RNA inosine sites has long relied on A-to-G base transitions in sequencing, which are hard to separate from DNA mutations and sequencing errors. REX-seq couples EndoV cleavage at inosines with XRN-1 degradation of fragments bearing 5′ phosphate ends, yielding cleavage signatures while preserving gene-expression quantification; in HEK293T cells it identified 590,249 high-confidence inosine sites, 84,645 of them not previously reported. Trained on these sites, InoDREAM reached an AUROC of 0.965 and average precision of 0.964 on a held-out test set, against 0.921 and 0.890 for EditPredict.

BaseBench puts every checkpoint of every biological AI model on one leaderboard, with training left running

Biological foundation models have lacked a common, broad benchmark: relevant tasks span nucleic acids, proteins, genomes, cells, whole organisms and clinical work, and lab validation is too slow to run on every checkpoint. BaseBench, being built by Basecamp Research, separates evaluations, checkpoints and adapters so every checkpoint of every model runs the same evaluations, with data version, checkpoint identity, adapter configuration and scoring steps recorded. It already runs on internal and public biological models, with public submissions planned in the near term.

reflection.ai

Reflection's open-weight Beam refuses 89% of harmful requests while answering 82% of benign ones

Reflection released Beam, its first open-weight model, together with the safety training methods and evaluation tools behind it. Public safety evaluations had not covered enough ground to test whether safety boundaries hold in adversarial and tool-use settings. Beam combines pretraining data filtering with dedicated safety alignment training, merging a capability teacher and a safety teacher through multi-teacher on-policy distillation. On 1,500 human-written conversations in the Iris safety evaluations, Beam declined 89% of harmful requests and complied with 82% of safety-related harmless requests.

arXiv

Discounting rewards by density: DARS stops GRPO collapsing onto one high-reward mode, cutting mode-mass error to 0.014 on a four-peak navigation task

Reinforcement learning that maximizes expected return tends to concentrate probability on a few high-reward outcomes; DARS estimates the local density of outcomes within each on-policy rollout group and inversely scales rewards by that density before standard GRPO updates. On a four-Gaussian navigation task, GRPO covers a single mode while DARS-GRPO recovers mode masses close to 0.25 each, with mode total variation 0.014 versus 0.750 for GRPO. In text-to-image prompt adaptation, DARS-GRPO raises image and prompt diversity across datasets, policy language models and reward settings while keeping semantic alignment.

Deep Genomics

Virtual-cell models treat the whole perturbation response as the answer; Deep Genomics inverts the task, learning the roughly 1% direct effects and holding up on unseen transcripts

Deep Genomics subtracts the whole-transcriptome perturbation response that virtual-cell models usually try to predict, treating it as noise, and trains a sequence model, DeepRNAi, only on the direct effects between an siRNA and its target transcript. Direct effects account for about 1% of all siRNA-RNA interactions, and uncalibrated virtual-cell objectives had treated that signal as a rounding error. On a held-out-transcript split, DeepRNAi performs about the same as on seen transcripts, while a conventional machine-learning approach without a direct-effect focus loses roughly 50% of its above-baseline performance.

arXiv

One H&E slide, three transcriptomes: a multi-scale graph network beats DeepSpot2Cell in cell-level PCC and AUROC

Spatial and single-cell transcriptomics reveal where genes are expressed in tissue, but each slide is expensive and scarce, while routine H&E whole-slide images are abundant. A multi-scale graph neural network trains on TCGA bulk data, Visium spatial data and Xenium single-cell data together, using consistency losses to keep predictions aligned across the three scales, and predicts bulk, spatial and single-cell expression directly from slide images. It performs best at slide level and moderately at patch level, with single-cell prediction the hardest; on Xenium its cell-level PCC and AUROC exceed DeepSpot2Cell, while DeepSpot2Cell leads at patch level.

arXiv

EWC stops only guarding old weights: FS-EWC shapes the solution first, then protects it, beating EWC across LoRA benchmarks

In replay-free continual learning, EWC penalizes changes to parameters deemed important using Fisher information estimated at the retained solution, but that local estimate does not capture sensitivity after the parameters move. FS-EWC uses Fisher information earlier, shaping the current task's solution by minimizing the worst-case Fisher trace over a neighborhood, and builds the retained anchor by averaging checkpoints along the optimization trajectory. Across vision and language benchmarks, FS-EWC generally improves on the corresponding EWC baseline under both full-parameter fine-tuning and LoRA.

AI

Gemini Omni 1.2 Flash goes generally available: 15-second clips at $0.07 per second for 720p

Gemini Omni 1.2 Flash is now generally available through the Gemini API and Gemini for business, extending native video generation from 10 seconds in Omni 1.1 to 15 seconds and allowing durations from 3 to 15 seconds in one-second increments. It adds multi-turn conversational editing, so a clip can be refined turn by turn, swapping a product or background or changing lighting and aspect ratio without regenerating the whole clip; 720p video costs $0.07 per second, 30% below Omni 1.1. In the official example, given the same static studio poster and five-layer animation prompt, 1.2 follows the reference image more closely than 1.1.

arXiv

Mixed-quality judge pools can still be aggregated: AGORA learns trust weights with item-response theory and holds its edge down to a few hundred items

LLM judges are a common substitute for costly human evaluation, and aggregating several judges is the standard remedy for any single judge's bias, but judge pools mix very different reliabilities while the human-labeled sets used to validate them hold a few hundred items or fewer. AGORA 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 jointly from all items 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.

arXiv

Joint audio-video generation stops letting audio drag: OmniOPD steadies distillation by giving the audio teacher a cleaner video condition

In joint audio-video generation, audio has far fewer tokens than video, so its supervision is sparse and distillation is unstable, and simply raising the audio loss weight makes things worse. OmniOPD has the audio teacher produce targets from a cleaner visual condition, samples several trajectories per prompt, and weights each timestep by teacher-student transition divergence; on JavisBench it raises video quality VQ from 2.714 for LTX-2.3 to 3.347 while holding audio quality AQ at 5.449, below the audio teacher's 5.576.

aclanthology.org

Chain-of-thought need not fire on every query: confidence gating cuts reasoning use by 30% without losing accuracy when the signal is strong

Chain-of-thought prompting improves complex reasoning but spends extra computation even on simple queries. A Sheffield team tested "think only when unsure" gating across four training-free confidence signals, three model families and seven reasoning benchmarks, finding that effectiveness varies widely by model and task and tracing the variation to confidence-score saturation and a selection bias that sends the hardest queries to chain-of-thought. Their Pareto-optimal threshold selection reduces chain-of-thought usage by about 30% without sacrificing accuracy where the confidence signal is strong, and falls back toward full chain-of-thought where it is weak.

arXiv

Agent memory stops only looking back: Pro-Memory splits future intentions from the moment to act

Most memory systems for large language model agents only store and retrieve past information, while proactive agents also need to hold future intentions and realize them when the right moment arrives. Pro-Memory separates keeping a future intention from deciding when and how to realize it: pending objectives stay linked to their supporting evidence, new observations are checked against the original goal and activation conditions, and contributions are coordinated with the agent's ongoing actions. On two benchmarks covering delayed-intention tasks and open-ended proactive assistance, proactive task performance improves consistently over representative memory approaches across multiple LLM backbones while unnecessary interventions are limited.

aclanthology.org

DoLa swaps logits for attention when picking layers: LLaMA-7B MC2 reaches 62.8%, while larger models keep MC1 with DoLa

Contrastive decoding's DoLa picks its premature layer from differences in output vocabulary distributions; Sakai and colleagues instead use self-attention distributions as the selection signal, introducing Attention-JSD, Attention-Entropy-Max and Attention-Entropy-Min while leaving the DoLa framework intact. On TruthfulQA, LLaMA-7B with Attn-Ent-Min reaches MC2 62.8% and MC3 36.5%, above DoLa's 56.5% and 30.5%; on LLaMA-33B and 65B, however, DoLa keeps the highest MC1, so the gains concentrate on multi-answer metrics.

arXiv

Noise piles up hop by hop in ring federated learning: FedSharp holds 93.5%+ MNIST accuracy with 33 Byzantine nodes

Decentralized federated learning has no central server, and link noise accumulates as models are relayed hop by hop, becoming more pronounced as the learning rate decays; Byzantine nodes can also mimic honest model averages to win loss-based selection. FedSharp keeps each predecessor's model copies at every node, screens out single-parameter deviations using coordinate-wise median deviations, averages the lowest-loss candidates, and adds noise-adaptive gradient-norm regularization with proximal training. On a 100-node ring with 33 Byzantine nodes, MNIST accuracy is 93.5%–94.9%, versus 29.4%–38.1% for a single-model-selection baseline.

Deep Genomics

Deep Genomics adds a million-basepair context to siRNA activity prediction: removing the foundation models nearly halves performance

Deep Genomics' DeepRNAi combines the local siRNA hybridization site with long-range context from the genomic region around the transcript, supplied by biological foundation models BigRNA, Enigma and REPRESS over up to one million base pairs of sequence. On seed-mediated knockdown prediction, DeepRNAi without the foundation models performs in aggregate about as well as a random forest with hand-built transcript features; with the foundation models, performance nearly doubles. In two drug-discovery cases the model predicted near-zero activity for siRNAs targeting the distal 3' UTR, matching Alnylam's published PLG experimental data.

aclanthology.org

Space mission planning gets a shared exam: five agent systems on 35 held-out cases, with geometry and constellation design still lagging

AstroAgentBench turns space mission planning into an executable, externally checked agent evaluation: 116 cases across seven task families, with the main evaluation using five held-out cases per family, 35 in total, where an agent must submit a schedule, observation plan or constellation design that an independent verifier checks for schema, timing, geometry, resources and mission value. Among five agent systems, Codex CLI + GPT-5.4 and Kimi CLI + Kimi K2.6 produced verifier-valid plans on all 35 cases, and the strongest systems approach or exceed solver-reference scores on several families while still trailing clearly on geometry-heavy, product-level and design-heavy tasks such as Regional Coverage and Stereo Imaging.

Vercel Labs ships agent-browser: AI agents drive a browser one shell command at a time, and a blocked click fails instead of reporting success

Vercel Labs has released agent-browser, a native Rust command-line tool that lets an AI agent drive a browser one shell command at a time. Previously an agent had to work from the whole page; now snapshot returns the page as compact text with a ref such as @e1 for each element, and the agent acts on a ref, reads the page again to check the result, and repeats. The browser stays open between commands, so each step is one short shell call, and a click fails rather than reporting success when the target is hidden, disabled, outside the viewport, or covered.

World Labs

Atlas world model goes real-time: Frameboy streams camera-driven frames to the browser at up to 15 fps

Atlas was an autoregressive world model that generated frames one at a time, and users waited tens of seconds or even minutes for a video, so they planned camera paths cautiously. The new research preview Frameboy serves a highly optimized Atlas variant from cloud GPUs, streaming frames to the browser at up to 15 fps so the view updates continuously as the camera moves. The same real-time capability is integrated into the web app Viewfinder, where users build their own scenes frame by frame and then explore them live through a Frameboy overlay.

A personal-health agent that remembers you: HealthJev screens bad lessons in 86 ms and lifts six tasks by 13.3 points on average

Medical large language models answer single encounters well but struggle to accumulate and govern experience across encounters. HealthJev separates shared safety rules and medical knowledge from a private longitudinal memory, and a self-trained lightweight decision model, JevGate, screens candidate lessons before they enter memory at a median 86 ms per decision. On a longitudinal benchmark of 90 simulated daily interactions for 20 users built from real MIMIC-IV trajectories, it scored a mean 0.668, versus 0.634 for MemoryBank, 0.593 for Mem0, 0.510 for ReAct and 0.502 for Memp; across six biomedical tasks it gained 13.3 percentage points on average over the base condition.

arXiv

UMAP no longer waits for the full run: GPUMAP streams projections on a commodity GPU, so million-point data becomes inspectable early

GPUMAP splits UMAP's dimensionality-reduction pipeline into three interleavable operations, insert, update and embed, and runs them on a commodity GPU so that intermediate projections appear while computation continues, letting million-point datasets be inspected before the full run ends. On the 5-million-point HIGGS dataset, sequential RAPIDS UMAP produced its first projection only at 50.4 seconds, whereas GPUMAP produced an inspectable intermediate projection at 8.42 seconds and kept refining it; the cost is a total runtime about 1.6 times that of sequential execution.

Gemini Omni 1.2 Flash goes generally available: 720p video at $0.07 per second, 15-second clips

Google Cloud has made Gemini Omni 1.2 Flash generally available for businesses producing product videos, virtual try-ons and ads at volume. Against the previous Gemini Omni 1.1 Flash, 720p video drops to $0.07 per second, 30% less, and single clips extend from 10 to 15 seconds, with closer adherence to supplied image, video and audio references. Business users can create in Google Vids, the Gemini for business entry is marked as coming soon, developers can call it through the API, and drafts can be made at 360p or 720p before upscaling to 1080p or 4K.

NVIDIA puts AI agent security on BlueField-4: monitoring and containment keep running in silicon even if the host is compromised

NVIDIA announced NVIDIA Sentry at GTC Berlin, a security framework that runs on BlueField-4 DPUs and places monitoring and policy enforcement for AI agents' access to models, tools and data in a separate hardware trust domain beyond host software. Earlier agent security relied on software runtime boundaries, so an agent that escaped its sandbox could alter or disable its own restrictions; Sentry inspects agent-to-model traffic through the DOCA Tower transparent proxy and reads runtime state outside the host with DOCA Argus, containing agents at millisecond scale. The framework is planned for availability early next year, and developers can begin with DOCA Argus, DOCA Flow and other libraries and microservices to experiment with out-of-band observability and infrastructure enforcement.

Cradle

UCB plugs Cradle's AI protein platform into antibody discovery, from hit generation to preclinical readiness

UCB and Cradle announced a strategic collaboration that puts Cradle's AI-driven protein design platform inside selected UCB antibody discovery projects, spanning hit generation, lead optimization and preclinical readiness. UCB's digital antibody engineering program had relied on its own antibody discovery platform combined with computational science and a network of technology and research partners. Under the collaboration, experimental results feed back into program-specific models in a compounding "lab-in-the-loop" cycle used to optimize candidates across the full set of required properties.

Albert Invent

Chemistry retrieval model Valence targets near-miss passages: 81.8% hit rate in-field, versus 2% to 4.5% for general models

Albert released Valence, a chemistry-native retrieval model for picking the passage that actually answers a formulation-science question. General-purpose retrieval models sort broadly across fields but struggle to separate same-field passages that share vocabulary and classifications yet answer different questions; on FormBench's hard test, general models from OpenAI and Voyage found the correct passage in their top 100 results 2% to 4.5% of the time, while Valence did so 81.8% of the time. On a stricter measure, Valence scored 0.41 against 0.009 for the leading general-purpose model.

Claude Enterprise gives security teams visibility: a security center compares settings to Anthropic's recommendations, and inference hooks check prompts before they run

Anthropic added a security center, inference hooks, centralized management and new access controls to Claude Enterprise, so security teams can see how their organization's configuration differs from Anthropic's recommended setup, send prompts and tool calls to existing data security tools for a check before they run, and manage identity and access from one place. The security center and centralized management remain in beta while inference hooks are generally available; the security center is guidance based on recommendations, not a certification or a guarantee of compliance.

MGI Tech's Zhiku Yunshu upgrade adds Genpilot agent: a live single-cell figure reproduction drops from months to hours

At its 2026 academic annual meeting, MGI Tech announced an upgrade to the Zhiku Yunshu biosample value-transformation platform, centered on the DCS Cloud biomedical analysis platform and the research agent Genpilot. Genpilot takes natural-language requests, decomposes tasks, generates code, runs analyses and produces figures and drafts; in a live demonstration it reproduced Figures 1–4 of a single-cell dataset end to end with results consistent with the original paper's core conclusions, compressing output from months to hours. On the storage side, AI vision-assisted calibration and natural-language retrieval cut sample-location time from minutes to seconds.

Retrieval-augmented generation gets three separately optimized agents: TRIO splits query expansion, retrieval judging and answering

Retrieval-augmented generation (RAG), which fetches external material before a language model answers, often falters on weak retrieval and fabricated content. TRIO splits that pipeline into three agents, for query expansion, for judging whether retrieval is sufficient, and for answering, and lets each improve iteratively under its own reward signal: the expansion agent is rewarded by gains in answer quality, the judge agent is supervised by unanimity-voted sufficiency labels, and the answer agent trains with dynamic matching-based rewards plus curriculum learning. Experiments across multiple benchmark datasets report TRIO as more effective than state-of-the-art approaches, and the code is public.

arXiv

Heating control stops guessing from fixed thermometers: a time-free PINN holds room temperature fields within 1.85% error

Indoor heating usually relies on one or a few fixed-point temperature readings, which miss the spatial variation around an occupant. A physics-informed neural network drops time as an explicit input and instead infers how the temperature field evolves from spatial coordinates plus a few sensor readings and their rates of change; across nine horizontal planes in three room-scale configurations it matched a validated COMSOL multiphysics simulation with a maximum relative error below 1.85%. Wired into occupant-centric heating control, it showed an average numerical error of about 0.67% against COMSOL-based offline control, with inference fast enough for real-time use.

Chai Discovery

Chai Discovery partners with Roche: Chai's AI models enter drug discovery programs across Roche's therapeutic areas

Chai Discovery announced a collaboration with Roche to use Chai's AI models and platform in a number of drug discovery programs across Roche's therapeutic areas. Chai builds computer-aided design tools for protein-based therapeutics, and its latest model, Chai-3, is described by the company as achieving high target success rates and binding affinities, including against challenging targets. The deal is the latest in a series of 2026 collaborations Chai has announced with leading pharmaceutical companies; the announcement gives no program counts, specific targets or timelines.

bioRxiv

Lung adenocarcinoma survival models stop letting molecular data dominate: clinical anchoring plus sparse correction lifts C-index from 0.697 to 0.7246

Molecular data in lung adenocarcinoma are high-dimensional relative to the number of observed events, so concatenating them into a survival model invites overfitting and unstable feature selection. CAISL writes predicted risk as a clinical Cox risk plus a sparse molecular correction, and penalizes how much that correction varies across resampled training cohorts. On 470 TCGA-LUAD patients with 119 observed deaths, mean C-index across five independent cross-validation runs was 0.7246 versus 0.6970 for clinical Cox, a paired gain of 0.0276 (95% CI 0.005–0.050); this is internal validation and still needs an independent cohort.

A generative adversarial network hands reinforcement learning its own subgoals: on Ant-v5, TD3 solves about 31% faster and ends 53% higher

Continuous-control reinforcement learning struggles with exploration and long-horizon credit assignment, and the usual fix, action noise or entropy regularization, explores without direction. GANGSTER uses a conditional generative adversarial network to propose candidate subgoals from the current state, scores them with structured losses for desirability, reachability and diversity, and feeds the chosen subgoal back only as intrinsic reward shaping, leaving the core TD3 and SAC update rules untouched. On MuJoCo's Ant-v5, GANGSTER with TD3 cuts time-to-solve by about 31% and raises final performance by 53% over baseline TD3; on HalfCheetah-v5 with SAC it raises final performance by 10% and lifts post-solution consistency above 99%.

Baseten

Baseten launches an environment network: RL environment building goes to vetted partners, while training and inference stay in-house

Baseten introduced the Baseten Environment Network, handing the construction of reinforcement-learning environments for post-training to a set of vetted partner companies. Previously Baseten's own applied research team built these environments by hand for post-training engagements such as Harvey, Lovable and Gamma, work the company describes as manually intensive and dependent on researchers' judgment. Partners work directly with customers and build environments from the customer's real data, while Baseten handles training and inference deployment; Baseten also plans to open-source a set of frontier-quality environments along with how it audits and trains on them.

arXiv

6G slice placement stops relying on one fixed plan: ORION feeds verifier-checked outcomes back to its LLM planner

Placing, routing and admitting multi-domain 6G network slices is an NP-hard online problem, fixed planning strategies reverse rank across topologies, and most rejected requests do have a feasible placement. ORION's hierarchical orchestrator uses two LLM agents to translate service intents and generate abstract placement plans, and records each attempt's network conditions, plan shape and verifier feasibility outcome in an episodic memory that returns to the planner as labelled examples. With selection and execution held fixed on held-out topology families, the memory-equipped planner admits more than both the memory-off and first-in-first-out variants on two seeds, though the magnitude is not established.

PCOR stops concatenating peer cues with observations: conditioning lifts POO success on unseen peers from 30.2% to 51.1%

Opponent modeling in multi-agent reinforcement learning usually concatenates an inferred peer representation with the current observation and encodes them jointly, leaving their relationship for policy learning to discover implicitly. PCOR instead imposes an asymmetric structure: observation features form the base representation of the current interaction state, and the peer representation only modulates how those features are interpreted. On two partially observable benchmarks, PCOR reaches higher final evaluation performance than the reported baselines on unseen peers; on POO, against a concatenation variant sharing the same encoders and differing only in fusion, evaluation success rises from 30.2% to 51.1%.

LMSYS Org

After DeepSeek open-sourced DeepInfer, SGLang matches or beats it on its own benchmarks, up to 1.04x prefill throughput

DeepSeek open-sourced DeepInfer, the inference engine behind its own service, along with its kernels; SGLang then brought the Mega kernel series, DSpark speculative decoding, SWA bounded replay and both Engram placements into its mainline and compared against DeepInfer on the same hardware using DeepInfer's own benchmarks. On 4x GB300 and 4x B300, SGLang reaches up to 1.04x DeepInfer's prefill throughput, within 1% at the remaining points; on 64x GB300 its decode step is 1.1% to 7.4% shorter from 16 to 256 requests per GPU and on par at 8. SGLang also ships the KV cache system, prefill/decode disaggregation and cross-replica load balancing that DeepInfer's release notes list as not included.

langchain.com

Deep Agents makes subagents async: the orchestrator answers whenever its own loop is free while long tasks run in parallel

Deep Agents adds async subagents: an orchestrator stays in the foreground talking to the user and organizing context, while subagents run long tasks as background workers and report back on completion. Previously, in a standard ReAct loop, each long tool call blocked the loop and every other task queued behind it; now subagents no longer hold the orchestrator's loop, the user can reach it whenever its own loop isn't busy, and the work an agent can take on grows with the number of background workers rather than the length of one loop.

Aignostics

Aignostics launches HETA Clinical pathology AI family: measure tumor content before molecular testing

Aignostics released HETA Clinical, a family of pan-cancer AI products spanning the pathology workflow, with four initial products measuring slide quality, tumor presence, mitotic counts and tumor cellularity. These assessments are usually made by eye, which is time-consuming and varies between readers; pathologists the company spoke with at academic medical centers and precision medicine labs estimate that 10 to 20 percent of molecular tests fail because tissue lacks enough tumor. Built on the HETA platform, the products are positioned to confirm sufficient tumor before molecular testing and help labs prioritize cases.

NVIDIA Blog

NVIDIA's Vera CPU pairs agent speed with density: 1.6x more agents per watt than the fastest x86

NVIDIA has introduced Vera, a CPU aimed at AI agents, seeking to meet both requirements in one chip: fast execution of agent steps and high concurrent agent counts. Previously AI factories had to choose between the fastest x86 processor and the most energy-efficient one to balance speed and capacity. In a 100-megawatt data center comparison, NVIDIA reports Vera supports 1.6x more agents per watt than the fastest x86 CPU and delivers 2x faster agent speed than the most energy-efficient x86 CPU; early adopters including Perplexity and DeepInfra report speedups in production-style tests, though Perplexity's deployment is still planned.

Surge AI

Fireworks folds six Surge benchmarks into its Specialized Intelligence Index, testing whether models can get through a workday

Fireworks has added six Surge benchmarks to its Specialized Intelligence Index (SII); the benchmarks are written by practitioners and test whether models can finish real work in messy environments, with ambiguous instructions and calls that require judgment. Earlier evaluations focused more on well-specified tasks such as writing a patch, running a calculation or answering a question. The new benchmarks score the decisions around execution, using expert-authored rubrics that measure correctness, verification, judgment and communication.

VLA action choice stops trusting the top score alone: FRS-Grounding adds neighborhood consistency for 86.4% simulated success

The highest-scoring action from a vision-language-action (VLA) model is not always the most reliable one to execute. FRS-Grounding keeps the finite candidate set after VLA inference, fuses normalized candidate scores with distance to a safe-action set into a fuzzy action set, and builds a pairwise relation from pose differences and collision-free states before fuzzy rough lower and upper approximations separate strongly supported candidates from boundary cases. Across 1500 randomized simulations the full pipeline reached 86.4% success and a 2.1% safety-violation rate, versus 74.8% and 8.2% for the pointwise hard-constraint baseline VLA-HC; under positional noise with σ = 10 mm it retained about 78% success against about 28% for VLA-HC.

GraphCLaRa adds a graph reranker ahead of a frozen CLaRa reader: up to 6.6 F1 gain on multihop QA with fewer documents

Retrieval-augmented multihop question answering suffers from noisy context, and CLaRa's compression of retrieved documents into dense latent memory makes the structural relations between documents harder to exploit. GraphCLaRa places a roughly 1.3M-parameter graph reranker before the frozen CLaRa reader: it builds a query-aware document graph, propagates evidence with a graph attention network, and adaptively decides how many documents to pass on. Across four QA benchmarks it raises answer F1 on three, by 6.6 on 2Wiki, 6.4 on MuSiQue and 2.5 on NQ, while using fewer documents, and trails by 1.1 F1 on the retrieval-saturated HotpotQA.

JetBrains folds coding agents into its IDE: Air runs several sessions side by side and keeps their diffs next to the code

JetBrains has introduced Air inside its IDEs, bringing coding agents into the environment where developers already write, review, run and test code. Previously, once several tasks were dispatched, the harder part was knowing where each task stood, what each agent had changed, and what still needed attention. Air gathers agent sessions as editor tabs, keeps changed files and diffs with each session, and lets developers inspect diffs, run tests and send feedback back to the agent with familiar JetBrains tools.

JetBrains puts AI agent usage behind one console, turning AI budgets from reports into enforced limits

JetBrains has released Air Governance, a console that gathers the AI agents, models and providers a team uses, sets AI credit limits for individuals, teams and service accounts, and tracks both cost and output. Previously each tool carried its own contract, dashboard and admin settings, so a cross-vendor picture of usage was hard to assemble; JetBrains says its own AI spend grew roughly tenfold in the first half of 2026 and its first cross-vendor usage report took four days to compile by hand. The product is available to all JetBrains organizational customers on free and paid plans and works with Claude Agent, Codex, Gemini CLI, Junie and other ACP-compatible agents.

Claude Console adds an organization-wide IP allowlist, narrowing where a leaked API key can be used

Anthropic added a beta IP allowlist to the Claude Console, so only addresses on an organization's list can reach covered services, which limits where a leaked API key can still be used. Previously organizations had no console-level way to narrow requests by source address. Admins can enter IPv4 and IPv6 addresses or CIDR ranges, up to 1,000 per organization.

Vercel News

Vercel Schedules enters public beta, letting agents create, change and cancel timed tasks while the app runs

Vercel released Vercel Schedules, which lets agents and applications create, change or cancel one-time and recurring schedules through code while the application is still running, without redeploying. Vercel Cron Jobs previously kept timing in vercel.json or Build Output API configuration and synced on deploy, while dynamic scheduling required a separate database and a polling job to find due work. Schedules records when to trigger a task and where to send it, and Vercel delivers the saved request through Queues when it is due, with application code checking permissions and doing the work; the product is in public beta.

Claude adds Personal Finance: connect bank accounts read-only and ask where the money went in plain words

Claude now has a Personal Finance feature: users sign in to their own bank through Plaid, grant read-only access, and ask about balances and transactions in their own words. Previously, working out where money went meant opening each banking app and doing the math; the feature totals spending across connected accounts by category, and in the example the month's spending is $4,309.37, with four payments still due before payday and $1,393.22 left. It rolls out in beta this week on the Pro, Max and Ultra plans in the US, helps users understand their money, and is not designed to give investment advice.

Gated spiking cross-attention puts the gate before spike firing, lifting CREMA-D accuracy by 2.15 points

Spiking networks that fuse audio and video have lacked a way to regulate information flow inside cross-modal attention according to the input. GSCANet adds a gate to a dual-stream Spikingformer backbone, placing it on the attention output just before spike firing and driving it with concatenated query and value features. On CREMA-D and RAVDESS this configuration beats the no-gate baseline by 2.15 and 1.05 percentage points; both gate position and driving signal change the outcome.

Vercel News

ElevenLabs brings 14 audio models to AI Gateway, letting one key cover transcription, live voice and music

Vercel and ElevenLabs are partnering to bring 14 ElevenLabs audio models to AI Gateway, spanning speech to text, streaming text to speech, realtime voice agents, music, sound effects and multi-voice dialogue. Previously these capabilities had to be wired up separately; now an app or agent can transcribe a user's speech, reason over it with a language model of its choice and answer in an ElevenLabs voice through a single gateway API key, with every request landing in the same usage, cost and trace views as other AI Gateway traffic. All ElevenLabs models are 50% off on AI Gateway for the first 14 days, through November 9th.

Vercel News

HarnessAgent adds image inputs across every adapter: one message format lets ten coding agents see pictures

The HarnessAgent layer of the AI SDK now accepts image inputs across all harness adapters, letting callers pass images alongside text in the standard AI SDK message format, with a content array mixing text parts and file parts. Images are processed by each harness's underlying vision models and are supported on Claude Code, Cline, Codex, Cursor, Deep Agents, fx, GitHub Copilot, Grok Build, OpenCode and Pi. Previously this layer accepted text input only, and image capability was not part of the unified interface.

mastra.ai

Mastra adds latency metrics to observability: see whether an agent's first response waits on the model or your own code

Mastra platform and Studio now record two latency metrics for every agent and model call: TTFC, the time a user waits before the first chunk arrives, and TTFT, the time the model takes to start responding. Previously durationMs showed only how long a run took, not how long a user waited for the first response or whether that wait came from the model or from the application's own code. Both metrics are recorded on every span, from the model call up to the agent run, and can be filtered and sorted as fields in trace and span queries on Mastra platform and on self-hosted projects whose storage uses DuckDB, PostgreSQL, or ClickHouse.

mastra.ai

Mastra adds span queries: traces no longer come back whole, so failing tool calls surface directly

Mastra has introduced span queries, moving observability queries from the whole trace down to individual spans inside it. Trace queries could already filter on deep details such as a failed tool call, but they still returned the entire trace, making the problematic call hard to spot. Span queries search within each trace and return only matching spans, and matching spans can be grouped or aggregated into counts, error rates and latency to show which tool is failing or slow.