<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Alien Life AI: companies and labs</title>
    <link>https://alienlifeai.com/companies.html</link>
    <atom:link href="https://alienlifeai.com/companies.xml" rel="self" type="application/rss+xml"/>
    <description>Primary-source posts from AI labs and companies: their own newsrooms, research blogs and papers. Every item links to the publisher; this feed republishes nobody's work.</description>
    <language>en</language>
    <lastBuildDate>Sat, 21 Nov 2026 20:12:27 +0000</lastBuildDate>
    <item>
      <title>New in AWS Quick: More capable flows, an updated web experience, and agents that work together</title>
      <link>https://aws.amazon.com/blogs/machine-learning/new-in-aws-quick-more-capable-flows-an-updated-web-experience-and-agents-that-work-together/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/new-in-aws-quick-more-capable-flows-an-updated-web-experience-and-agents-that-work-together/</guid>
      <pubDate>Sat, 21 Nov 2026 01:06:42 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>AWS Quick is the AI workspace built only for work. Today we&#x27;re releasing updates that help your team get more done: build and run business-process flows in chat, triage your day in the updated web app, get more complete answers from multiple agents at once, and connect new data sources like Meta ads and Amplitude.</description>
    </item>
    <item>
      <title>Cut self-hosted LLM cost and latency with the distributed KV caching agent skill</title>
      <link>https://aws.amazon.com/blogs/machine-learning/cut-self-hosted-llm-cost-and-latency-with-the-distributed-kv-caching-agent-skill/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/cut-self-hosted-llm-cost-and-latency-with-the-distributed-kv-caching-agent-skill/</guid>
      <pubDate>Sat, 21 Nov 2026 00:14:26 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>Self-hosting LLMs on GPUs means paying to recompute the same context on every turn. Distributed KV caching with Amazon ElastiCache can cut inference cost by up to 40% and time to first token by up to 80%. This post walks through the distributed KV caching skill in the Agent Toolkit for AWS, which evaluates and sets up the cache from your coding agent.</description>
    </item>
    <item>
      <title>How Google Duplex evolved to also call businesses for you in Gemini</title>
      <link>https://research.google/blog/how-google-duplex-evolved-to-also-call-businesses-for-you-in-gemini/</link>
      <guid isPermaLink="true">https://research.google/blog/how-google-duplex-evolved-to-also-call-businesses-for-you-in-gemini/</guid>
      <pubDate>Fri, 20 Nov 2026 23:30:30 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">Google Research</source>
      <description>Generative AI</description>
    </item>
    <item>
      <title>Introducing Amazon SageMaker HyperPod Global Inference Gateway: One endpoint across Regions and clusters</title>
      <link>https://aws.amazon.com/blogs/machine-learning/introducing-amazon-sagemaker-hyperpod-global-inference-gateway-one-endpoint-across-regions-and-clusters/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/introducing-amazon-sagemaker-hyperpod-global-inference-gateway-one-endpoint-across-regions-and-clusters/</guid>
      <pubDate>Fri, 20 Nov 2026 22:35:24 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>Amazon SageMaker HyperPod introduces the Global Inference Gateway, one managed endpoint that routes inference requests across your HyperPod clusters in one Region or across Regions. It picks the best cluster, fails over automatically, and authenticates every request with SigV4 and IAM over AWS PrivateLink.</description>
    </item>
    <item>
      <title>How Standard Bank Group automates AI risk assessment for generative AI</title>
      <link>https://aws.amazon.com/blogs/machine-learning/how-standard-bank-group-automates-ai-risk-assessment-for-generative-ai/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/how-standard-bank-group-automates-ai-risk-assessment-for-generative-ai/</guid>
      <pubDate>Fri, 20 Nov 2026 20:37:31 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>Standard Bank Group automated the evidence behind its generative AI approval gates. Working with AWS Professional Services, the bank built an assessment in its own AWS account that scores each use case against international AI standards and its own policies using LLM-as-a-judge on Amazon Bedrock, giving risk committees consistent, traceable evidence.</description>
    </item>
    <item>
      <title>Announcing Amazon Textract Insights: Verifiable generative AI for documents</title>
      <link>https://aws.amazon.com/blogs/machine-learning/announcing-amazon-textract-insights-verifiable-generative-ai-for-documents/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/announcing-amazon-textract-insights-verifiable-generative-ai-for-documents/</guid>
      <pubDate>Fri, 20 Nov 2026 20:22:00 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>Announcing the general availability of Amazon Textract Insights, a new generative AI feature of Amazon Textract. Describe the fields you need in natural language, submit a document or a mixed packet, and receive structured results with a confidence score and page-level grounding for each value, with no model training required.</description>
    </item>
    <item>
      <title>Introducing enhanced infrastructure observability in Amazon SageMaker HyperPod</title>
      <link>https://aws.amazon.com/blogs/machine-learning/introducing-enhanced-observability-in-amazon-sagemaker-hyperpod-to-diagnose-gpu-training-issues/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/introducing-enhanced-observability-in-amazon-sagemaker-hyperpod-to-diagnose-gpu-training-issues/</guid>
      <pubDate>Fri, 20 Nov 2026 18:24:06 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>Amazon SageMaker HyperPod now offers enhanced observability to help you diagnose GPU training issues faster. It brings together diagnostic and profiling capabilities for training workloads on both Amazon EKS and Slurm orchestrators, pinpointing issues across GPU, network, and host layers.</description>
    </item>
    <item>
      <title>Combatting adversarial distillation</title>
      <link>https://openai.com/index/combatting-adversarial-distillation</link>
      <guid isPermaLink="true">https://openai.com/index/combatting-adversarial-distillation</guid>
      <pubDate>Fri, 20 Nov 2026 10:00:00 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">OpenAI</source>
      <description>OpenAI’s layered approach to adversarial distillation combines model training, safeguards, detection, and enforcement to protect against capability extraction.</description>
    </item>
    <item>
      <title>Amazon SageMaker Inference: 2026 launches in review, part 2</title>
      <link>https://aws.amazon.com/blogs/machine-learning/amazon-sagemaker-inference-2026-launches-in-review-part-2/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/amazon-sagemaker-inference-2026-launches-in-review-part-2/</guid>
      <pubDate>Fri, 20 Nov 2026 00:34:07 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>This second installment reviews 13 more Amazon SageMaker AI inference launches from 2026, spanning configuration recommendations, fitting more models onto each GPU, serving models too large for one instance, cross-Region routing, and post-launch tuning, bringing the year&#x27;s total to 26.</description>
    </item>
    <item>
      <title>Use Kimi Code CLI with models on Amazon Bedrock</title>
      <link>https://aws.amazon.com/blogs/machine-learning/use-kimi-code-cli-with-models-on-amazon-bedrock/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/use-kimi-code-cli-with-models-on-amazon-bedrock/</guid>
      <pubDate>Fri, 20 Nov 2026 00:33:30 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>Kimi Code CLI v2.7.0 adds a native Amazon Bedrock provider, so you can connect the open source coding agent to models like Kimi K3.1 Pro using your standard AWS credential chain (named profiles or SSO) instead of a separate API key. This post shows how to configure the provider and send your first request.</description>
    </item>
    <item>
      <title>Qwen3 TTS is now available on Together AI</title>
      <link>https://www.together.ai/blog/qwen3-tts</link>
      <guid isPermaLink="true">https://www.together.ai/blog/qwen3-tts</guid>
      <pubDate>Fri, 20 Nov 2026 00:00:00 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">Together AI</source>
      <description>Qwen3 TTS is now available on Together AI. Keep one voice across your product, change its tone with a plain-language instruction and move it between 10 languages, with first audio in as little as 97ms.</description>
    </item>
    <item>
      <title>Hebbia sees improvements in financial research with GPT-6 Astra</title>
      <link>https://openai.com/business/customer-stories/hebbia</link>
      <guid isPermaLink="true">https://openai.com/business/customer-stories/hebbia</guid>
      <pubDate>Fri, 20 Nov 2026 00:00:00 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">OpenAI</source>
      <description>Hebbia tested GPT-6 Astra for financial research. Its prerelease evaluations found gains in source coverage, citation relevance, and presentation quality.</description>
    </item>
    <item>
      <title>Can AI help scientists identify promising drug candidates?</title>
      <link>https://openai.com/index/introducing-medchembench</link>
      <guid isPermaLink="true">https://openai.com/index/introducing-medchembench</guid>
      <pubDate>Fri, 20 Nov 2026 00:00:00 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">OpenAI</source>
      <description>MedChemBench evaluates how well AI models interpret molecular structures, reason from experimental evidence, and select compounds in early drug discovery.</description>
    </item>
    <item>
      <title>Enable AI agents to pay for AWS Marketplace x402 products with Amazon Bedrock AgentCore payments</title>
      <link>https://aws.amazon.com/blogs/machine-learning/enable-ai-agents-to-pay-for-aws-marketplace-x402-products-with-amazon-bedrock-agentcore-payments/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/enable-ai-agents-to-pay-for-aws-marketplace-x402-products-with-amazon-bedrock-agentcore-payments/</guid>
      <pubDate>Thu, 19 Nov 2026 23:02:16 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>Amazon Bedrock AgentCore payments now supports AWS Marketplace, so agents can discover and buy x402-enabled products, APIs, data, and content and pay in USD on the developer&#x27;s AWS bill, with no stablecoin wallets or API keys. This post walks through a research agent that finds a tool, pays per request through AWS Billing, and answers with sources.</description>
    </item>
    <item>
      <title>How the BMW Group governs hundreds of agents across thousands of developers</title>
      <link>https://aws.amazon.com/blogs/machine-learning/how-the-bmw-group-governs-hundreds-of-agents-across-thousands-of-developers/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/how-the-bmw-group-governs-hundreds-of-agents-across-thousands-of-developers/</guid>
      <pubDate>Thu, 19 Nov 2026 22:20:23 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>When hundreds of agents serve thousands of developers, governance cannot be an afterthought. The BMW Group shares the practices and patterns its R&amp;D teams use to build, govern, and operate AI agents at enterprise scale without sacrificing speed, quality, or compliance.</description>
    </item>
    <item>
      <title>Run your whole selling business in AWS Quick</title>
      <link>https://aws.amazon.com/blogs/machine-learning/run-your-whole-selling-business-in-aws-quick/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/run-your-whole-selling-business-in-aws-quick/</guid>
      <pubDate>Thu, 19 Nov 2026 22:16:22 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>Most sellers do not need another AI product to learn. They need the tools and information they already use brought together, so they can see what is happening in their business and act on it.</description>
    </item>
    <item>
      <title>Amazon SageMaker AI now detects latency drift, idle GPUs, and missed optimizations on your inference endpoints</title>
      <link>https://aws.amazon.com/blogs/machine-learning/amazon-sagemaker-ai-now-detects-latency-drift-idle-gpus-and-missed-optimizations-on-your-inference-endpoints/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/amazon-sagemaker-ai-now-detects-latency-drift-idle-gpus-and-missed-optimizations-on-your-inference-endpoints/</guid>
      <pubDate>Thu, 19 Nov 2026 21:28:18 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>Amazon SageMaker AI now monitors your generative AI inference endpoints by default and tells you when a change could improve performance or lower cost. It tracks latency, GPU utilization, and serving configuration, then sends a finding through AWS Health with a one-click path to benchmark alternatives in SageMaker Studio before you apply any change.</description>
    </item>
    <item>
      <title>Inside Amazon Connect Talent: The science of structured AI interviews</title>
      <link>https://aws.amazon.com/blogs/machine-learning/inside-amazon-connect-talent-the-science-of-structured-ai-interviews/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/inside-amazon-connect-talent-the-science-of-structured-ai-interviews/</guid>
      <pubDate>Thu, 19 Nov 2026 21:23:20 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>For organizations hiring hundreds or thousands of people, every interview presents the same challenge: How do you give candidates a consistent opportunity to demonstrate their skills while gathering the evidence needed to make informed hiring decisions? Structured behavioral interviews offer a research-backed approach to this challenge. They use consistent, job-related questions and clear scoring criteria […]</description>
    </item>
    <item>
      <title>Reducing Rollout Bottlenecks in Reinforcement Learning with NVIDIA Dynamo</title>
      <link>https://developer.nvidia.com/blog/reducing-rollout-bottlenecks-in-reinforcement-learning-with-nvidia-dynamo/</link>
      <guid isPermaLink="true">https://developer.nvidia.com/blog/reducing-rollout-bottlenecks-in-reinforcement-learning-with-nvidia-dynamo/</guid>
      <pubDate>Thu, 19 Nov 2026 20:28:20 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">NVIDIA</source>
      <description>Reinforcement learning (RL) uses rewards to train models to solve problems and complete tasks more successfully. Inference drives this process. Workers generate...</description>
    </item>
    <item>
      <title>Amazon Bedrock AgentCore harness adds Strands harness defaults, built-in tools, and lifecycle hooks</title>
      <link>https://aws.amazon.com/blogs/machine-learning/amazon-bedrock-agentcore-harness-adds-strands-harness-defaults-built-in-tools-and-lifecycle-hooks/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/amazon-bedrock-agentcore-harness-adds-strands-harness-defaults-built-in-tools-and-lifecycle-hooks/</guid>
      <pubDate>Thu, 19 Nov 2026 20:01:06 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>Amazon Bedrock AgentCore harness now runs on the open-source Strands harness, bringing a recommended model, task-oriented defaults, automatic prompt caching, proactive context management, and new built-in tools. It also adds lifecycle hooks so you can run deterministic allow or deny checks at defined points in the agent loop.</description>
    </item>
    <item>
      <title>RL Post-Training in Diffusion Transformers Is Activation Steering</title>
      <link>https://arxiv.org/abs/2611.26627v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26627v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:59:53 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Reinforcement learning (RL) post-training substantially improves the visual quality, text rendering, and compositional accuracy of diffusion transformers. Because capabilities such as rendering requested text or composing multiple objects are inherently prompt-dependent, a natural hypothesis is that improving them requires learning complex, input-dependent transformations. To isolate how much of these gains an input-independent shift explains, we probe each RL-tuned model with a deliberately simple parameterization: a fixed set of steering vectors added to the block outputs of the frozen base model. On SD3.5-M, these vectors hold 65x fewer parameters than the RL-tuned LoRA (0.29M against 18.8M). We fit them to match the velocity predictions of public RL-tuned checkpoints, with no reward in the objective. Although the vectors are identical for every prompt, token, and sampling seed, they recover 90.0-96.3% of the reward gains of six RL-tuned image models, and 89.8% and 111.9% on two RL-tuned video models. Initialized at zero and trained with online RL, the vectors alone exceed the reward gains of weight-based RL on text rendering (OCR) and human preference (PickScore) on SD3.5-M. A constant shift thus suffices for most of the gain of policy-gradient RL post-training: without new input-dependent transformations, it steers the pretrained generator toward what it can already compute.</description>
    </item>
    <item>
      <title>PlayCraft: Designing Engaging Games from Agent Play Experience</title>
      <link>https://arxiv.org/abs/2611.26624v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26624v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:59:34 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Recent AI agents can generate playable games, but these games are not necessarily engaging. Mastery is a key source of engagement, yet designing for it requires extensive human play and tuning. We propose PlayCraft, an automated framework that uses a vision-based agent to play games and draws on its detailed play experience to revise them for mastery. Starting from an initial game, PlayCraft alternates between playing and crafting. In the playing stage, a player agent watches the game screen, uses the controls, and pursues the game objective over repeated episodes while retaining memory. After each episode, it reports its progress, outcomes, decisions, and reflections. In the crafting stage, a crafter agent uses these reports to revise the game. It estimates player abilities, predicts performance at different proficiency levels, and compares those predictions with a target learning progression. It diagnoses the game and addresses the gaps by giving players meaningful opportunities to improve through better decisions and execution. We evaluate games in fresh runs with player agents across three intelligence settings, measuring learning gain and learning slope. Compared with the initial games, PlayCraft yields larger learning gains and steeper learning slopes in most games. It also outperforms the baselines on the macro-average of each metric at every intelligence setting.</description>
    </item>
    <item>
      <title>TideCache: Efficient Hybrid LLM Serving with Transparent Cache Management and Layer-Wise Streaming</title>
      <link>https://arxiv.org/abs/2611.26619v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26619v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:58:31 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Hybrid architectures have become mainstream among open-weight language models. Their global-attention and bounded-state layers maintain heterogeneous caches whose demands vary with context length and concurrency. We present TideCache, a serving system on CPU--GPU superchips with three components for allocating GPU memory among caches and managing their residency across GPU and host memory. The Transparent Cache Pool redistributes physical pages among cache components behind fixed virtual addresses, preserving cache layouts and backend interfaces. The Cache Streamer uses computation intervals provided by bounded-state layers to prefetch the next global-attention layer&#x27;s prefix into GPU slots shared across global-attention layers, reducing GPU residency while overlapping layer-wise transfers with computation. Generated KV remains resident. The Request Scheduler selects resident or streamed execution and triggers capacity adjustments according to request size and queue state. Together, they let HBM released by streaming accommodate other cache components and additional requests. Implemented in SGLang and evaluated on GB300 and GH200 across seven model/platform configurations, TideCache completes up to 2.04x as many agent turns, reduces overall P50 per-token latency by 20--59%, and improves agent P50 TTFT by 1.40--3.05x compared with SGLang with HiCache.</description>
    </item>
    <item>
      <title>One Prior, Two Dynamics: Repurposing Video Diffusion Transformers for Self-Supervised Latent Action Learning</title>
      <link>https://arxiv.org/abs/2611.26617v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26617v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:58:14 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Videos reveal how the world changes, but rarely the actions that cause those changes. Latent action learning recovers such supervision from visual transitions, yet often learns the underlying dynamics largely from scratch. We ask whether a pretrained video generator can instead provide the prior for both inverse and forward dynamics. We introduce O$^{2}$LaF, built on a simple principle: one prior, two dynamics. We initialize both models from the same pretrained video DiT and adapt them to their distinct roles: a feed-forward transition encoder with learnable action queries for inverse dynamics, and a causal, action-conditioned video generator for forward dynamics. By controlling information access and optimizing both dynamics end-to-end through a compact bottleneck, O$^{2}$LaF learns transferable actions from unlabeled videos. Across navigation and robotic manipulation, O$^{2}$LaF sets a new state of the art in few-shot action probing and enables stronger zero-shot action transfer across visual contexts and embodiments. Beyond generative video priors, we further extend our framework to predictive representation priors such as V-JEPA2, achieving competitive performance. Our findings suggest a broader paradigm for latent-action learning: repurposing pretrained video models to discover transferable actions and predict their consequences.</description>
    </item>
    <item>
      <title>AgentRoboCritic: Understanding the Capability of Frontier Agents on Direct Robot Control</title>
      <link>https://arxiv.org/abs/2611.26613v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26613v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:57:25 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Frontier multimodal language agents such as GPT-6 Astra have demonstrated strong capabilities in controlling robots directly via low-level numerical actions without high-level primitives. However, existing benchmarks report only episode-level success rates, which show neither how these agents succeed nor where they fail. In this paper, we present a systematic action-level analysis of frontier agents on direct robot control across 12 manipulation benchmarks. We introduce AgentRoboCritic, an intent-grounded critique framework in which the policy agent states a local intent alongside each action, and a critic evaluates the action&#x27;s outcome and failure mode against this intent. Our action-level analysis demonstrates the promising capabilities of frontier agents on direct robot control, including closed-loop recovery from local execution failures, reliable semantic grounding across diverse scenes, and strong zero-shot manipulation without task-specific adaptation. It also identifies their current limitations, including task-relevant physical execution bottlenecks such as grasping and alignment, and uneven recovery across failure modes. Finally, we validate our critic on a 400-action human-annotated benchmark and release a dataset of 12,844 annotated actions alongside a fine-tuned open-source critic, Muse-Glimmer-30B, whose failure-mode accuracy rises from 32.58% to 74.24%, enabling low-cost action-level analysis.</description>
    </item>
    <item>
      <title>SoK: Assessing the Evolution of LLM Capability in Software Vulnerability Research</title>
      <link>https://arxiv.org/abs/2611.26601v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26601v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:54:19 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>LLM-based agents are becoming increasingly capable at discovering, validating and patching vulnerabilities in real software, and vendors and researchers report that this is already changing how vulnerabilities are found and fixed. These claims, however, are scattered across papers, vendor reports and disclosures and are rarely comparable. We introduce a framework that rates these capabilities on an autonomy scale modeled on the levels of driving automation, and qualifies each claim by its correctness, its availability and the strength of its evidence. We use this framework to systematize the published evidence on LLM capability in vulnerability research. We find that agents discovered, validated, and patched vulnerabilities in real-world software without human intervention before the restricted frontier models of 2026, and that open-weight models subsequently attained comparable autonomy for discovery and validation. We then measure the consequences of evolving LLM security capabilities in a decade of public vulnerability records, advisories and exploitation data. In 2026 the number of disclosed vulnerabilities more than doubled, with an increasing share rated critical or high, and severe bugs that had survived a decade or more in widely used code were reported several times more often than before. Yet the time between the stages of a vulnerability&#x27;s life, from report to fix and from disclosure to attack, has not shifted noticeably so far. We grade the mitigations proposed in the literature with an explicit rubric and draw guidance for each group of stakeholders from the best-supported ones.</description>
    </item>
    <item>
      <title>Optimize AI economics on Amazon Bedrock with Accenture’s sequenced approach</title>
      <link>https://aws.amazon.com/blogs/machine-learning/optimize-ai-economics-on-amazon-bedrock-with-accentures-sequenced-approach/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/optimize-ai-economics-on-amazon-bedrock-with-accentures-sequenced-approach/</guid>
      <pubDate>Thu, 19 Nov 2026 18:48:55 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>As enterprises scale AI on Amazon Bedrock, token spend can grow even as per-token prices fall. This post walks through six composable optimization levers, shows how Accenture applied them across four client engagements, and recommends a sequence for cutting AI token spend on your own workloads.</description>
    </item>
    <item>
      <title>Realized versus Population Reliability: Anytime-Valid Self-Consistency Certification under Correlated Reasoning</title>
      <link>https://arxiv.org/abs/2611.26592v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26592v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:47:51 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Self-consistency certification treats repeated sampling from a language model as sequential evidence accumulation and stops when an anytime-valid e-process crosses a threshold, guaranteeing finite-sample Type I error control by Ville&#x27;s inequality. Prior constructions assume sampled rollouts are conditionally independent. We show this assumption fails in practice: reasoning streams are positively correlated through shared reasoning prefixes or across-prompt heterogeneity, changing not merely certificate efficiency but the hypothesis certified. Modeling dependence via a per-unit latent state (the random-effects / intraclass-correlation structure) induces exchangeable, equi-correlated increments with correlation $ρ$. Correlation splits the single null into a realized null about the drawn belief and a population null about average model behavior, which coincide only when $ρ=0$. We show: (i) the standard betting e-process remains anytime-valid for the realized null, not the population null; (ii) read as a population-null test, a suitable mixture has asymptotic crossing probability at least $π=P(μ(Z)&gt;0)$, potentially exceeding nominal $ε$; (iii) the within-unit mean&#x27;s effective sample size saturates at $1/ρ$, so extra within-unit rollouts cannot restore population validity; and (iv) a prompt-level e-process restores population validity, with optimal allocation at one rollout per prompt under a pure rollout budget. Simulations and Claude Haiku 4.5 rollouts confirm this regime dependence: on GSM8K ($\hatρ=0.435$, $\hatθ=+0.96$) the gap is dormant, whereas on AIME ($\hatρ=0.480$, $\hatθ=-0.15$) the single-unit rule crosses on 24% of prompts at nominal $ε=0.05$, while the prompt-level procedure declines (0.00). This correctness result identifies which reliability claim an anytime-valid certificate actually supports under dependence.</description>
    </item>
    <item>
      <title>Probing the &quot;Conscious&quot; Mind: Selective Access and Global Workspace in Vision-Language Models</title>
      <link>https://arxiv.org/abs/2611.26590v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26590v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:46:50 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Vision-language models (VLMs) integrate visual and textual information, but their outputs do not reveal internal concept representations. Global workspace theory (GWT) proposes that information is selected from parallel brain processes, integrated in a shared workspace, and made available to specialised processes. We introduce the Multimodal Concept Lens (MC-Lens), a multimodal Jacobian lens, to study these functions in VLM concept processing. Its vision encoder and language decoder lenses map intermediate states to a shared semantic space defined by the decoder&#x27;s output vocabulary to compare concept accessibility across modalities. MC-Lens supports internal concept interventions to examine the role of accessed concepts in downstream computation. (i) Accessibility and selective access. Multimodal concept information is readable in intermediate states and selectively accessible as tasks require. We extend &quot;readout carriers&quot; from one name token to a token set to better capture and express concept information and support counterfactual experiments. (ii) Concepts in downstream computation. Counterfactual experiments show that accessed concept information participates in downstream computation and reasoning. (iii) Development of cross-modal alignment and selective access. We develop two J-space metrics tracking the development of cross-modal concept alignment more clearly than hidden state cosine in controlled VLM training. The experiment also shows that reliable selective access develops later than concept accessibility. (iv) Shared functions across models. Across VLM families and sizes, we find shared patterns of concept accessibility, query-dependent selectivity and cross-task intervention effects despite differences in internal organisation. These findings offer an experimental basis to study GWT in multimodal artificial systems and how it can guide cross-modal alignment improvements.</description>
    </item>
    <item>
      <title>Verify the Verifier: Specification-Grounded LLM Cross-Checking for Bugs That Escape UVM Scoreboards</title>
      <link>https://arxiv.org/abs/2611.26588v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26588v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:45:54 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>A passing UVM regression shows the design agrees with the reference model on what the scoreboard checks, not that it meets the specification. Bugs that pass every test yet violate the specification, termed scoreboard escapes, survive mature testbenches. We present Verify the Verifier, to our knowledge the first framework whose LLM-based Anomaly Cross-Checker examines a passing regression&#x27;s traces against the specification. Of 564 bugs inserted into four OpenTitan IPs, 68 are candidate scoreboard escapes: non-equivalent, exercised by the tests, yet passing. The framework confirmed 41 as scoreboard escapes with assertions failing on the buggy design and proven on the original.</description>
    </item>
    <item>
      <title>ProtoDiffusion: Token-per-Layer Generative Modeling of Multi-Layer Images</title>
      <link>https://arxiv.org/abs/2611.26586v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26586v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:45:31 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Graphic designs are ordered compositions of RGBA layers whose separation enables selection, movement, and reuse. Existing layered models represent each layer with a full-canvas or region-sized spatial latent grid, so representation size grows with the cumulative spatial extent of the layers. We present ProtoDiffusion, a latent-diffusion framework built on ProtoVAE, a multi-layer variational autoencoder that encodes a design into one shared spatial prototype and one candidate vector per layer. Each candidate conditions a shared decoder to reconstruct its corresponding RGBA layer. For $N$ layers, the representation contains $HW+N$ tokens before backbone-specific packing, compared with $NHW$ for full-grid-per-layer representations. ProtoDiffusion jointly denoises the prototype and a fixed set of candidate slots, conditioned on an image or text, with bounding boxes as optional layout guidance. The model leaves unneeded slots empty and determines the number of layers and, in absence of boxes, their layout, requiring neither as input. The same architecture supports both image-to-design and text-to-design. ProtoVAE achieves high-fidelity reconstruction from its compact shared latent representation, reaching 40.43 dB PSNR on layer crops. On the LayerD evaluation split, image-to-design achieves RGB L1 scores of 0.040 with bounding boxes and 0.057 without, with box-guided alpha soft IoU (0.850) comparable to the strongest fine-tuned baseline (0.871). On merged images, text-to-design reaches 66.41 FID versus 86.84 for FLUX.2 [klein], achieves a 0.860 text-accuracy score, and runs $19.1\times$ faster than the same-backbone generation-then-decomposition cascade.</description>
    </item>
    <item>
      <title>Represented but misread: Post-training changes how language models read out what they represent</title>
      <link>https://arxiv.org/abs/2611.26584v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26584v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:43:56 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Does post-training change what a language model represents, or how this representation is read out into an answer? We compared linear probes with the models&#x27; own answers, analyzed with signal detection theory, in six open-weight base models and their post-trained versions. For judgments of whether German texts were written by a human or an AI, probes and word n-gram classifiers separated the classes well, but the answers did not and often ordered the texts inversely. Post-training lowered the sensitivity of the answers on average ($Δd&#x27; = -0.34$ across model families; -0.29 across three prompts). It also changed the use of a stated base rate: Base models shifted their log-odds by less than the stated change in prior odds, most post-trained models by more. In two models with stage-wise checkpoints, the change occurred during supervised fine-tuning, model stitching implicated the early layers, and from mid-depth on internal states at positions after the text, not those of the text, transferred the change between checkpoints. Our corpora cannot be shared, so we add a case reproducible from public data, the truth of negated statements. Here, post-training acted in the opposite direction: Probes decoded truth at or near ceiling in every model, the answers of several base models did not use it, and post-training repaired them; by mid-depth the repair resided at the positions after the statement; below it, the representation of the statement contributed, strongly in one of four models. In a training study, adding 2,000 correctly labeled authorship judgments of news texts to otherwise identical fine-tuning data improved the answers on our newspaper and textbook corpora and inverted them on the chats, where they followed a news-trained probe of the base model. Post-training thus changed how a judgment is read out of what a model represents, and a small training signal can set its direction.</description>
    </item>
    <item>
      <title>Text-Aware, Vision-Blind: How Multimodal Image Editing Systems Handle Unsafe Inputs</title>
      <link>https://arxiv.org/abs/2611.26569v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26569v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:36:19 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Multimodal image generation systems have made rapid progress and increasingly emphasize content safety. However, their safety mechanisms tend to rely on a single modality and lack joint consideration of both visual content and text prompts, particularly in instruction-guided image editing, where the uploaded image may itself carry risk. We thus introduce EditSafetyBench, a benchmark that measures system-level safety awareness of advanced image editing systems, containing 5,940 image-instruction pairs, covering safe and unsafe images across 11 risk categories and three edit intents. We then probe the benchmark dataset on four systems, including Gemini, GPT, Qwen API, and Qwen Local. Based on our evaluation, we observe a systematic text-vision safety mismatch: Gemini and GPT refuse 87.1\% and 81.6\% cases containing unsafe-intent editing prompts, while only refusing 24.2\% and 22.4\% cases with both unsafe images and neutral instructions. At the category level, most risks are considered inconsistently by different systems, e.g., GPT allows 70.4\% editing attempts of unsafe political content while Gemini only allows 34.8\%. Notably, sexual content shows the strongest visual sensitivity, likely benefiting from mature NSFW identification works. Our findings highlight the need for safety guardrails that jointly reason over both visual and textual modalities in image editing systems.</description>
    </item>
    <item>
      <title>Multi-institutional grading of Barrett&#x27;s esophagus dysplasia without stain normalization using a pathology foundation model and multiple instance learning</title>
      <link>https://arxiv.org/abs/2611.26562v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26562v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:27:59 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Barrett&#x27;s esophagus dysplasia grading suffers substantial inter-observer variability, particularly for low-grade dysplasia, complicating clinical decision-making. We conducted a retrospective multi-institutional diagnostic accuracy study of a foundation model-based deep learning system for dysplasia grading, using 969 H\&amp;E-stained whole slide images from four institutions. Patch-level classifiers trained on expert annotations identified diagnostically relevant regions, followed by attribute-aware multiple instance learning for slide-level classification as non-dysplastic Barrett&#x27;s esophagus (NDBE), low-grade dysplasia, or high-grade dysplasia. On a held-out test set (n = 130), macro-averaged AUC was 0.96 (95\% CI 0.93--0.98). For binary dysplasia detection, sensitivity was 98\% (80/82) and specificity 81\% (39/48), with a negative likelihood ratio of 0.030 and quadratic-weighted \kap{} of 0.83 against expert consensus. No high-grade dysplasia case was misclassified as NDBE. Performance was consistent across institutions without stain normalization, indicating that stain-robust foundation-model representations may remove the site-specific preprocessing that has constrained prior systems to institution-specific deployment.</description>
    </item>
    <item>
      <title>From learning to leaderboard: How Cisco upskilled 1,200 engineers in agentic AI with AWS AI League</title>
      <link>https://aws.amazon.com/blogs/machine-learning/from-learning-to-leaderboard-how-cisco-upskilled-1200-engineers-in-agentic-ai-with-aws-ai-league/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/from-learning-to-leaderboard-how-cisco-upskilled-1200-engineers-in-agentic-ai-with-aws-ai-league/</guid>
      <pubDate>Thu, 19 Nov 2026 18:26:22 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>Cisco and AWS used Cisco Transformation Fest and AWS AI League to turn hands-on AI learning into a culture of building. A Cisco engineer won the 2025 AWS AI League global title and 1,200 engineers competed in 2026. This post shares Cisco&#x27;s journey, lessons from the 2026 winning agent built on Amazon Bedrock AgentCore, and how to host your own league.</description>
    </item>
    <item>
      <title>MM-SystemOneBias: Evaluating Bias in Multimodal Jev-Style System One Decision Models</title>
      <link>https://arxiv.org/abs/2611.26557v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26557v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:25:41 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>When multimodal decision models determine actions, moderation outcomes, or quality judgments, their reliability depends on preserving semantic decisions across presentation changes, ignoring irrelevant additions, and distinguishing information consistent with task evidence from information that conflicts with it. Existing evaluations study decision-interface biases and multimodal model behavior in separate settings, leaving no common protocol to compare multimodal decision models with their backbones on practical tasks. We introduce \textbf{MM-SystemOneBias}, which evaluates 13 models on 5,323 original instances from nine public datasets and 11 task scenarios using six paired interventions: option order, option label, external judgment, image--text description, irrelevant information, and rating scale. Across seven matched decision-model--backbone pairs, decision models are more stable under option-label, irrelevant-information, and rating-scale changes in all seven pairs; six pairs also show lower option-order flip rates. They incur smaller accuracy losses under incorrect external judgments in all seven pairs and conflicting descriptions in six. In six pairs, they gain less accuracy from correct external judgments and show less favorable accuracy changes under consistent descriptions. Among pairs with unchanged semantic decisions, mean absolute changes in answer probabilities range from 4.56 to 11.55 percentage points, revealing input effects that accuracy alone misses.</description>
    </item>
    <item>
      <title>Replication of Agentic Security Events: Audit and Investigation (ROGUE-AI)</title>
      <link>https://arxiv.org/abs/2611.26553v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26553v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:23:35 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Agents based on large language models (LLMs) can now delete files and send payments on behalf of their users. News media reports routinely describe failures of these agents (e.g., Replit&#x27;s coding agent deleting a production database), but a report often only says what went wrong and rarely (in)validates the incident or finds its root cause. Incident catalogs collect these reports, and benchmarks record whether agents fail, but neither replicates an incident nor tests the cause its report might identify. In this paper, we present ROGUE-AI (Replication of Agentic Security Events: Audit and Investigation), a multi-agent framework that closes the above gap and rebuilds each reported incident offline together with a matched control that lacks only the blamed cause, and runs agents on both. Our results suggest that ROGUE-AI is able to reproduce the reported harm in 89% of its 108 attempted replications. Agents built on five current GPT, Claude, Gemini and DeepSeek models made the reported mistake in 18% to 33% of runs, against at most 1% without the blamed cause. Of the 72 incidents with real-world harm, 62 had no underlying attacker, and in these, agents did what their task asked for but missed an ordinary hazard, such as a database shared with the live site. Replications without an attacker caused more harm than replications of prompt injection for all five models. Defenses against prompt injection look for injected instructions, but these replications contain none. Further, a warning after each tool output that names the hazard and its consequence lowered harm for all five models, whereas a note of the same length that does not mention the hazard left most of the harm in place. Built from real incidents, the ROGUE-AI replications form a reusable audit framework that vendors can rerun before each new release.</description>
    </item>
    <item>
      <title>Keep inference running through regional capacity shortfalls with cross-Region inference routing in Amazon SageMaker AI</title>
      <link>https://aws.amazon.com/blogs/machine-learning/keep-inference-running-through-regional-capacity-shortfalls-with-cross-region-inference-routing-in-amazon-sagemaker-ai/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/keep-inference-running-through-regional-capacity-shortfalls-with-cross-region-inference-routing-in-amazon-sagemaker-ai/</guid>
      <pubDate>Thu, 19 Nov 2026 18:20:54 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>Cross-Region inference routing in Amazon SageMaker AI gives your application one invocation path across the endpoints and inference components you already run, in one or more AWS Regions and AWS accounts. The router prefers its own Region and shifts new requests to another destination only when the local one can&#x27;t serve reliably.</description>
    </item>
    <item>
      <title>The Geometry of Lies: Knowledge and Persona Directions for Detecting Deception in Large Language Models</title>
      <link>https://arxiv.org/abs/2611.26545v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26545v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:20:01 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Linear probes are the cheapest LLM lie detectors but often fail to transfer across kinds of lie. Label-free directions from honest and deceptive role-play are untested at 70B scale and on lies about knowledge, where a lie and an honest denial can be identical. We widen a published persona bank with roles that deny knowledge they have, plus honest counterparts. At each model&#x27;s middle layer the resulting persona direction ranks lies across Liars&#x27; Bench better than single-dataset probes on three of its four models; it fails on Qwen, even when Qwen stays in role far more often. On Llama-3.3-70B-Instruct it beats directions from a random persona bank, but its gain over the published direction is within the range of random widenings. On lies about knowledge, persona directions mainly track a reply&#x27;s wording: where lies and honest denials share their words, our three main contrasts stay inside the random-direction band on Llama and Qwen and reach only its edge on Gemma, though on Mistral one clears it. A knowledge direction contrasts questions the model can answer with ones nobody can, each followed by the same scripted denial. It separates lies from identical honest denials on two models and narrowly on a third, but not on the fourth; its other results partly depend on the benchmark&#x27;s wording. On the Gender-Secret fine-tune it clears the band by a few hundredths on Llama and fails on Mistral. The sum of the two directions ranks lies better than a supervised probe at the same depth on all four models (on one, both near chance) but is level with the persona direction on Llama&#x27;s average and behind that probe on held-out lies. More varied role-play questions do not help the persona direction on Liars&#x27; Bench.</description>
    </item>
    <item>
      <title>AURA: AUdio-dRiven streaming Avatar</title>
      <link>https://arxiv.org/abs/2611.26540v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26540v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:17:38 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Current audio-driven video diffusion models can synthesize realistic talking-head videos but generally require dozens of diffusion denoising steps over multi-second video chunks, making them unsuitable for streaming applications such as voice assistants and virtual avatars, where low-latency and online causal generation are required properties. AURA generates video chunk by chunk with a rolling KV cache, requiring only the audio of the current chunk to start generating, rather than a multi-second audio look-ahead like bidirectional models. It comes in two sizes: AURA 1.3B streams 576p video in real time on a single GPU (20.7 fps for a 16 Hz playback rate), making it suited to interactive avatar applications, and AURA 5B streams 720p video at 9.7 fps. Our two-stage distillation pipeline first aligns the causal student with the teacher, by training it to match the teacher&#x27;s trajectories with fewer diffusion steps and a chunk-wise sliding window causal attention mask, then applies Distribution Matching Distillation (DMD) with backward simulation to close the remaining quality gap. On standard talking-head benchmarks, AURA 1.3B runs 23x faster than its own bidirectional teacher and reaches a quality comparable to TalkVerse at a lower resolution, and AURA 5B matches its TalkVerse teacher at 720p while running 17x faster. To support reproducibility and further research on streaming avatar generation, we release the weights of both models along with a dataset of 30K synthetic videos and their precomputed teacher trajectories.</description>
    </item>
    <item>
      <title>LLM GerryMandering: Separating Interactions from Additive Effects in LLM Audits</title>
      <link>https://arxiv.org/abs/2611.26538v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26538v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:16:40 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Intersectional bias arises when a model treats people who hold several marginalised identities at once differently from what their separate identities would predict. Auditing such intersectional subgroups remains a challenge: their number grows quadratically, and there is no agreed baseline for what independent attributes would predict. Without such a baseline, many existing audits flag a subgroup when it exceeds each attribute alone, a condition that attributes acting independently already satisfy. We test this standard criterion on 150 synthetic datasets built with no interaction. With the shuffle null, it flags 66.1 false subgroups per dataset on average, and at least one in every dataset. When we plant interactions of known size into these datasets, a repaired null lets the criterion recover only 32% of them. We introduce ADDIS (Additive Intersectional Screen), which fits an additive model over all attributes, scores each subgroup by its Additive Residual Distance (ARD) from that model&#x27;s prediction, and tests it against a Freedman-Lane null. On our synthetic benchmark, ADDIS flags 0.09 false subgroups per dataset and recovers 84% of the same planted interactions. We then build IndiPersona, 10,000 synthetic Indian personas with six identity attributes, and audit 13 open language models. The standard criterion flags 7.1% of the 738 tested subgroups on average; ADDIS flags 3.0%. Gender identity crossed with sexual orientation is the largest pairing in every model, and counterfactual personas confirm it and additionally reveal a caste x class interaction in all but one model that the observational test lacked the data to detect. Much of what audits report as intersectional bias can thus arise from independent single-attribute effects alone, yet a small core of interactions survives.</description>
    </item>
    <item>
      <title>Protect agent tool calls with Skyflow and Amazon Bedrock AgentCore Gateway</title>
      <link>https://aws.amazon.com/blogs/machine-learning/protect-agent-tool-calls-with-skyflow-and-amazon-bedrock-agentcore-gateway/</link>
      <guid isPermaLink="true">https://aws.amazon.com/blogs/machine-learning/protect-agent-tool-calls-with-skyflow-and-amazon-bedrock-agentcore-gateway/</guid>
      <pubDate>Thu, 19 Nov 2026 18:14:36 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">AWS Machine Learning</source>
      <description>Learn how Skyflow and Amazon Bedrock AgentCore Gateway keep sensitive data out of the tools your AI agents call. Added as a gateway interceptor, Skyflow de-identifies data before any tool, model, or log sees it, and restores it for authorized callers, with no change to your agent code.</description>
    </item>
    <item>
      <title>Cost-Aware Agentic Feature Optimization System for Fleet-Scale Ranking Models</title>
      <link>https://arxiv.org/abs/2611.26531v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26531v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:12:04 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Large Web platforms operate large fleets of ranking models, each selecting features from a shared pool of tens of thousands. We present an end-to-end agentic system that optimizes features across the fleet under resource constraints shared across models and those set per model, such as feature pipeline cost and serving throughput (QPS), respectively. In this system, LLM agents propose hypotheses, and deterministic tools execute experiments and verify them. For each model, an LLM generates and shortlists cross features from a combinatorial candidate space, and all features are then ranked by several importance methods. Feature blending mixes these rankings into a single selection, using Pareto fronts across tasks for multi-task models. An LLM Researcher agent then tunes the feature selection in 10--25 asynchronous trials under resource caps, and a trimming step keeps the pipeline cost within budget. Across production models, the system improves normalized entropy by 0.31% on average within each model&#x27;s budget, and the trimming step cuts pipeline cost by 2.3% with no regression beyond measurement noise. The optimized models were launched, and in online A/B tests they improved a primary online metric by 0.20%.</description>
    </item>
    <item>
      <title>Backtracking Agent Applications Security Incidents</title>
      <link>https://arxiv.org/abs/2611.26525v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26525v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:01:28 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv</source>
      <description>Agent applications are increasingly deployed, yet agent-specific attacks pose real threats to them. Upon a security incident, organizations backtrack to identify the CEP (compromise entry point), remediate the damage, and prevent its recurrence. The main artifacts available for backtracking are trajectory logs, which record agent functionalities, and source code; app(lication)-specific function call logs are often fairly limited. However, trajectory logs are at the agent functionality abstraction layer, while the CEP candidates are function calls at the app code execution layer. Due to this semantic gap, the analyst needs to manually inspect the relevant code for each CEP candidate to infer its corresponding agent functionality. In this work, we present Origin, a backtracking tool for the analyst to submit a small number of queries to identify CEPs that existing tools cannot provide. Our approach poses two challenges: (1) define the intermediate abstraction that captures the mapping relationships between the two semantic layers; (2) determine the region-to-variable mapping for constructing the cross-layer graph defined in the intermediate abstraction. Each region is a specific group of agent functionalities. Origin addresses the challenges by (1) the cross-layer dependency graph (CLDG) that connects region-inferred functions at the semantic level to the variables in the low-level taint propagation subgraph, plus the associated query language, and (2) the region inference algorithm. Case studies on five popular agent applications across eight attack incidents show that an analyst using Origin correctly identifies all the CEPs.</description>
    </item>
    <item>
      <title>Deterministic Temporal Embedding for Calcium Imaging Trace Extraction</title>
      <link>https://arxiv.org/abs/2611.26522v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26522v1</guid>
      <pubDate>Thu, 19 Nov 2026 18:00:35 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.LG</source>
      <description>Reliable extraction of calcium-dependent fluorescence traces in calcium imaging sequences requires identifying pixels whose fluorescence intensity reflects the same underlying cellular activity. We present a deterministic temporal embedding framework that maps pixel-wise fluorescence traces to a low-dimensional representation in which temporally coherent sources form spatially coherent regions. Starting from a fuzzy-neighborhood graph and spectral initialization, we optimize a class-balanced cross-entropy objective using exact sparse attraction and a deterministic particle-mesh decomposition of the dense repulsive interaction with sparse edge compensation, avoiding stochastic negative sampling. The resulting latent representation is spatially decoded into reliable source supports for trace extraction without imposing an explicit cellular shape prior. Experiments on synthetic and in vivo two-photon calcium imaging data demonstrate robust recovery of irregular and spatially touching sources together with efficient deterministic embedding optimization.</description>
    </item>
    <item>
      <title>Introducing Tool Retrieval in the Gemini API</title>
      <link>https://blog.google/innovation-and-ai/technology/developers-tools/gemini-api-tool-retrieval/</link>
      <guid isPermaLink="true">https://blog.google/innovation-and-ai/technology/developers-tools/gemini-api-tool-retrieval/</guid>
      <pubDate>Thu, 19 Nov 2026 18:00:00 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">Google AI</source>
      <description>Gemini spark on a space background</description>
    </item>
    <item>
      <title>Simple Private Noisy SGD is Minimax-Optimal under Population Strong Convexity</title>
      <link>https://arxiv.org/abs/2611.26515v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26515v1</guid>
      <pubDate>Thu, 19 Nov 2026 17:58:51 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.LG</source>
      <description>Stochastic gradient descent (SGD) is at the center of modern machine learning and is known to be statistically minimax-optimal in many regression settings, e.g., for convex Generalized Linear Models (GLMs). Yet, it is unknown whether its simplest differentially private Noisy SGD counterpart fulfills similar favorable guarantees even on strongly convex losses. We resolve this question affirmatively. We upper bound the parameter estimation error for a single pass of Noisy SGD with a fixed stepsize schedule and constant batch sizes on smooth and strongly convex Lipschitz losses over a compact convex domain under Renyi DP. Specialized to strongly convex GLMs, our error bounds match minimax lower bounds we derive based on the Score Attack framework. In particular, this provides the first minimax-optimal rate for Noisy SGD in private logistic regression, avoiding poly-logarithmic terms present in existing results. Our analysis is versatile as it relies on standard convex analysis and establishes the same rates in expectation and with high probability.</description>
    </item>
    <item>
      <title>Hybrid Retrieval for Government Scheme Search in English and Marathi</title>
      <link>https://arxiv.org/abs/2611.26514v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26514v1</guid>
      <pubDate>Thu, 19 Nov 2026 17:58:39 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.CL</source>
      <description>Retrieving government schemes requires matching citizens&#x27; information needs to formal administrative descriptions, often across languages and terminology. We present a bilingual search system for Maharashtra government schemes and public services that combines BM25 retrieval with sentence-embedding similarity through equal-weight score fusion. The system indexes aligned English-Marathi scheme descriptions and supports multilingual, Marathi-focused, and translation-mediated semantic configurations. Evaluation on manually curated bilingual queries compares BM25, dense retrieval, and hybrid retrieval using IndicSBERT and MahaSBERT. BM25 provides a strong baseline with a mean reciprocal rank (MRR) of 0.864. Hybrid retrieval increases MRR to 0.872 with IndicSBERT and 0.879 with MahaSBERT, whereas the corresponding dense-only systems achieve 0.663 and 0.655. MahaSBERT-based fusion also increases precision from 0.781 to 0.808 while matching BM25 recall at 0.946. These results support the complementary use of lexical and semantic signals in this collection, while showing that improvements over a strong lexical baseline are modest and metric-dependent. The study provides an application-focused analysis of hybrid retrieval for bilingual public-service information access.</description>
    </item>
    <item>
      <title>AutoMaster: Autonomous Post-Training by Making the Same Model a Better Teacher</title>
      <link>https://arxiv.org/abs/2611.26510v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26510v1</guid>
      <pubDate>Thu, 19 Nov 2026 17:57:59 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.CL</source>
      <description>Task success alone does not specify which behaviors post-training should reinforce. Even successful teacher trajectories can contain unsupported assumptions, unproductive repetition, or superficial verification. We propose Skill-FT (Skill-Guided Fine-Tuning), which uses natural-language skills to suppress undesirable habits and elicit underrepresented effective behaviors during teacher rollouts, then fine-tunes a target model on the resulting trajectories. We introduce AutoMaster, an autonomous post-training system in which an LLM agent develops these interventions through trajectory analysis, skill design, data selection, and feedback from rollouts and target-model evaluation. Across Terminal, Search, and software engineering tasks with 4B and 9B target models, AutoMaster improves mean performance over Vanilla SFT on successful unguided teacher trajectories by 1.42-8.99 percentage points, with the teacher, task pool, training set size, and SFT recipe held fixed. Together with the ablations and trajectory analyses, these results suggest that behavioral shaping can make a fixed model a more effective teacher. We further find that retaining skill instructions during SFT yields higher mean performance than removing them across all six settings, despite their absence at evaluation and identical supervised outputs. These findings suggest that preserving skill context as part of a training demonstration can support better behavioral internalization.</description>
    </item>
    <item>
      <title>GLiDE: A Fast, Calibrated Decision Model Distilled from Reasoning Teachers</title>
      <link>https://arxiv.org/abs/2611.26509v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26509v1</guid>
      <pubDate>Thu, 19 Nov 2026 17:56:44 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.CL</source>
      <description>Decision models enable fast, confidence-aware decisions by scoring candidate answers in a single forward pass, without generating text or intermediate reasoning. Yet reasoning can substantially improve decision quality, raising the question of whether its benefits can be retained without the cost of generating it. We investigate this question with \textbf{GLiDE}, a family of decision models spanning 0.4B to 27B parameters. Building on Qwen hybrid language models, GLiDE enables bidirectional interactions between the context, question, and candidate answers by removing causal masking from full-attention layers. To transfer reasoning capabilities into single-pass inference, we combine soft-target distillation from multiple teachers, including a reasoning model, with progressive post-training on diverse decision tasks. We further explore parameter-free recurrent depth to increase inference-time computation without generating tokens. Across five model sizes, GLiDE lies on the performance--parameter Pareto frontier of the Hugging Face \DI{}, with each model outperforming evaluated alternatives of equal or smaller size. \dmtwo{} (27B) achieves a hidden-set score of 71.52, with an expected calibration error of 2.0\% and a median latency of 92.9\,ms on a single GPU. Further checkpoint averaging and parameter-free recurrent depth yield GLiDE~27B, which reaches 73.37 with an expected calibration error of 2.1\%.</description>
    </item>
    <item>
      <title>Grid Cells as Spectral Successor Features: A Reusable Basis for Continual Reinforcement Learning</title>
      <link>https://arxiv.org/abs/2611.26504v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26504v1</guid>
      <pubDate>Thu, 19 Nov 2026 17:54:04 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.LG</source>
      <description>Continual reinforcement learning requires agents to adapt when the task changes while reusing what they know about the environment. Successor features separate dynamics from task-specific reward, but their effectiveness depends on the choice of base features. Taking the identification of entorhinal grid cells with eigenvectors of the successor representation as a design principle, we build this basis from eigenvectors of the transition matrix of a fixed reference policy. With such a basis, the successor features at a state-action pair are a linear combination of the base features at that same pair, which is not true in general, and the coefficients are known in closed form: each successor feature is its base feature multiplied by $θ_i = 1/(1-γλ_i)$, where $λ_i$ is its eigenvalue. The long-term return is thus predicted from the same features as the immediate reward, no successor-feature network or replay buffer is needed, and adapting to a new task reduces to a linear regression on the reward. The agent acts greedily on the action values of the reference policy, which is one step of policy improvement over it and suffices to reach a single goal. In a two-goal gridworld, with the uniform random walk as reference policy, whose eigenvectors are the low-frequency Laplacian eigenvectors, agents built this way maintain near-maximal return across every change of goal, whereas SimpleSF and DQN lose most of their return at each change.</description>
    </item>
    <item>
      <title>Multimodal Error Detection in Chest X-ray Reports: A Large Language Model Reading Image Evidence</title>
      <link>https://arxiv.org/abs/2611.26492v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26492v1</guid>
      <pubDate>Thu, 19 Nov 2026 17:46:42 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.CL</source>
      <description>Rad-Linter checks chest X-ray reports against image-derived evidence to flag potential errors for review. A pretrained image classifier supplies scores for nine pathologies, and a 1.5B-parameter language model, fine-tuned with LoRA on 1,816 examples, checks their consistency with the report. We compare it with a keyword-and-negation rule baseline given the same reports and scores. Evaluation uses controlled report-score pairings from OpenI, with consistency labels derived from automatic report labels and score thresholds. Each counterfactual quad crosses two real reports with two real score vectors from other patients, creating two consistent and two inconsistent pairs. Every report and score vector occurs in both conditions, so either input alone permits only 50% accuracy. On 131 quads, Rad-Linter achieves 98.5% pair accuracy versus 80.5% for the rule baseline, and classifies all four pairs correctly in 94.4% of quads versus 56.5%. The checkers perform similarly on omission items, including unmentioned and negated findings; larger differences occur on the remaining item types, which require interpreting how findings are described. The same language model without fine-tuning remains near 50% accuracy. On a second set of 181 quads that also includes reports on which the automatic labelers disagree, pair accuracy is 93.4% versus 75.3%. These controlled results show that, given the same image-derived scores, a trained language model detects report-score inconsistencies more accurately than the tested rule baseline, with the advantage concentrated in interpreting how findings are worded.</description>
    </item>
    <item>
      <title>Neural Conditional Gaussian Model: Efficient Data Assimilation with Sequential Uncertainty Quantification for Nonlinear Dynamics</title>
      <link>https://arxiv.org/abs/2611.26463v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26463v1</guid>
      <pubDate>Thu, 19 Nov 2026 17:25:51 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.LG</source>
      <description>Data assimilation (DA) in partially observed nonlinear systems requires repeated estimation of both hidden states and their uncertainty. Conventional nonlinear filtering can be computationally expensive and often relies on an explicit dynamical model. In this paper, we develop the Neural Conditional Gaussian Model (Neural CGM), a data-driven dynamical model that maps unobserved physical states into a learned latent space, where the dynamics of the latent states follow a conditional Gaussian structure. This structure allows closed-form DA updates in the latent space, while nonlinear encoder-decoder mappings retain the flexibility needed to represent complex dynamics in physical space. A key feature of Neural CGM is its treatment of uncertainty in DA. The latent posterior mean and covariance are mapped to the physical variables through a Gaussian decoder that combines local moment propagation with learned nonlinear corrections. The resulting physical-space posterior statistics depend on the sequentially updated latent distribution rather than on a separate post-processing estimate. The same statistics enter a Gaussian negative log-likelihood during training, so both the posterior mean and uncertainty affect the learned model. Because Neural CGM learns the dynamical model itself, it can also be used for state forecasting and simulation without explicit knowledge of the governing equations. Numerical experiments on benchmark nonlinear dynamical systems show accurate state estimation and forecasting while substantially reducing online assimilation cost relative to conventional nonlinear DA methods. Neural CGM is therefore suited to repeated state estimation, uncertainty quantification, and prediction from partial observations.</description>
    </item>
    <item>
      <title>Learning to Defer under Expert Drift</title>
      <link>https://arxiv.org/abs/2611.26440v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26440v1</guid>
      <pubDate>Thu, 19 Nov 2026 17:13:58 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.LG</source>
      <description>The learning to defer (L2D) framework enables safety in machine learning and AI systems by allocating difficult or critical decisions to a human expert. However, most prior work on L2D assumes fixed expert reliability, overlooking temporal fluctuations in human performance due to factors such as fatigue and cognitive biases. Humans commonly exhibit such substantial, systematic performance shifts across a wide range of domains, from high-stakes settings such as radiology, aviation, and judicial decision-making, to everyday tasks such as crowdsourced image annotation. We propose Expert-Drift-Adapted Learning-to-Defer (EDA-L2D), a novel expert-aware L2D framework that explicitly models these temporal shifts by conditioning the deferral head on recent histories of expert outcomes via a sequence model. This history-aware approach enables adaptive deferral policies that anticipate reliability fluctuations and better allocate decisions between human and machine over time. We provide comprehensive experiments across three diverse tasks -- image classification, medical diagnosis, and hate speech detection -- including generalization analyses under realistic deferral conditions and irregular shifts in expert reliability. Our results show that EDA-L2D adapts more effectively than prior L2D methods to diverse temporal patterns of expert reliability, resulting in improved system performance and more effective deferral decisions. Code is available at https://github.com/ZiyaoMou/L2D-Expert-Drift.</description>
    </item>
    <item>
      <title>MemFolder: Structure-Guided Memory Folding for Efficient Agent Memory Management</title>
      <link>https://arxiv.org/abs/2611.26427v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26427v1</guid>
      <pubDate>Thu, 19 Nov 2026 17:05:55 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.CL</source>
      <description>Long-term agents accumulate large external memory stores as interactions unfold, increasing the costs of storage, retrieval, and response generation. Efficiency is constrained by two coupled factors: a growing record count increases retrieval overhead, while longer retrieved contexts increase prefill computation and decoding-time attention costs. Existing methods prune or consolidate records, but pruning can discard useful evidence, whereas consolidation may produce fewer yet longer retrieval units. We introduce MemFolder, a structure-guided memory folding framework that sequentially reduces record count and context length. The framework comprises two core components that share memory groups, using cross-record structure to guide both evidence consolidation and compact representation. RecordFolder grounds entity mentions, progressively selects representative yet complementary anchors, and combines semantic and entity affinity with temporal chaining to consolidate compatible records into fewer retrieval units. ContextFolder encodes the original records within these groups into compact text and uses verification feedback to revise encodings when key facts cannot be recovered. Experiments on the three text-based memory benchmarks LoCoMo, PersonaMem, and LongMemEval and the two multimodal benchmarks M3-Bench-web and M3-Bench-robot demonstrate the strong performance of our methods. Notably, on Mem0, RecordFolder retains 99.0% of the original average performance across the three text-based benchmarks with 50% fewer records, exceeding the strongest baseline by 1.9 percentage points in performance retention. Combined with ContextFolder, existing record compression methods further shorten their output records while retaining most of their performance.</description>
    </item>
    <item>
      <title>Exact Bayesian layers via characteristic functions</title>
      <link>https://arxiv.org/abs/2611.26426v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26426v1</guid>
      <pubDate>Thu, 19 Nov 2026 17:04:30 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.LG</source>
      <description>Bayesian neural networks provide principled uncertainty estimates, but training them with Monte Carlo sampling can be expensive. Sampling-free variational inference algorithms make training Bayesian neural networks feasible, but existing approaches assume a Gaussian output distribution, which can be inaccurate in applied problems. Here, we introduce CF-Prop, an uncertainty propagation method that uses characteristic functions to compute the exact output distribution of a Bayesian ReLU layer, without any sampling, even in non-Gaussian settings. Because CF-Prop propagates characteristic functions, the evidence lower bound---the objective of variational training---can be computed in closed form for a broad class of likelihoods, including the Gaussian, Poisson, and Gamma. This allows to implement an efficient resulting variational inference algorithm, CF-VI. On CIFAR-100, CF-VI achieves the lowest calibration error of any tested method, improving on the next best method by about 35%. On a heavy-tailed insurance claim dataset, CF-VI accurately captures tail uncertainty that is severely underestimated by both other sampling-free methods and Monte Carlo methods.</description>
    </item>
    <item>
      <title>FEA solver integration of a composite World Model with a Spiking Neural Network memory Block for computationally efficient modelling of defects and variabilities</title>
      <link>https://arxiv.org/abs/2611.26419v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26419v1</guid>
      <pubDate>Thu, 19 Nov 2026 17:02:29 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.LG</source>
      <description>Each fibre-reinforced composite structure has a unique material architecture. The manufacturing methods used and the presence of defects lead to local variations which require material-scale models that can resolve the response in real time at every location in the structure. Concurrent multi-scale schemes provide this capability, but at a prohibitive computational cost for large structures as the number of integration points and time increments scales with size. Surrogates have been studied extensively as replacements for material-scale models to mitigate these computational limitations. A surrogate must represent an arbitrary local architecture including defects, track the irreversible material state over an unknown number of increments, remain stable when driven recursively by its own predictions, and fit within the memory available at every integration point. Here, a Composites World Model based on a Multi-Modal Spiking Transformer architecture is designed to meet these requirements. The proposed architecture combines a material encoder, a Spiking Neural Network memory block that tracks the long-term internal state of the material, and transformer blocks that learn the short-term applied strain state. The system is trained in three stages: material architecture encoding, base training on short time windows, and recursive fine-tuning with scheduled sampling to suppress cumulative error drift. The trained model is disassembled at inference and coupled to a non-linear FE solver, enabling structural scale simulation of composites containing embedded defects. Benchmarks against experimental results for IM7/8552 laminates under tension, compression and transverse shear, for pristine and wrinkled composites, show that the SNN memory block successfully tracks the material internal state and results in prediction errors between 0.4% and 4.8%.</description>
    </item>
    <item>
      <title>Walter Isaacson on curiosity and creativity in the AI age.</title>
      <link>https://blog.google/innovation-and-ai/technology/ai/dialogues-walter-isaacson/</link>
      <guid isPermaLink="true">https://blog.google/innovation-and-ai/technology/ai/dialogues-walter-isaacson/</guid>
      <pubDate>Thu, 19 Nov 2026 17:00:00 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">Google AI</source>
      <description>Walter Isaacson joins Google to discuss how history’s greatest innovators inspire creativity and human judgment in the AI age. Watch the episode.</description>
    </item>
    <item>
      <title>Democratizing Cross-Project Knowledge for Transforming Water Governance and Climate Resilience: an Agentic AI Ecosystem</title>
      <link>https://arxiv.org/abs/2611.26398v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26398v1</guid>
      <pubDate>Thu, 19 Nov 2026 16:49:04 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.CL</source>
      <description>EU-funded projects produce extensive evidence in the form of deliverables, reports, and case studies. However, this knowledge is typically scattered across projects and document structures, making it difficult to locate relevant, contextual information when making decisions. This paper introduces an Agentic AI Ecosystem that consolidates heterogeneous project documentation into a domain-aware knowledge base and provides adaptive access through an agentic Retrieval-Augmented Generation pipeline. Documents from three EU-funded projects (IMPETUS, NATALIE, and InnWater) are reconstructed into hierarchical section trees and indexed with structured metadata. Retrieval is supported by two domain-specific embedding models fine-tuned on domain data (water and climate). On top of this knowledge base, a ReAct-style controller iteratively orchestrates retrieval actions by allocating retrieval budget across domain collections and accumulating evidence until a stopping criterion is met. In a retrieval benchmark over the corpus, the proposed approach improves Mean Reciprocal Rank by 26.7% (relative) compared to a single-domain embedding baseline, indicating more consistent retrieval of relevant evidence to support cross-project knowledge synthesis and climate-resilient decision-making.</description>
    </item>
    <item>
      <title>HiSA: Sparsifying the Hidden Dimension of RoPE Attention in LLMs</title>
      <link>https://arxiv.org/abs/2611.26363v1</link>
      <guid isPermaLink="true">https://arxiv.org/abs/2611.26363v1</guid>
      <pubDate>Thu, 19 Nov 2026 16:31:46 +0000</pubDate>
      <source url="https://alienlifeai.com/companies.xml">arXiv cs.CL</source>
      <description>Attention in large language models (LLMs) scores every query against every key with a full dot product. We investigate whether this dot product must be computed completely for attention to be effective. We propose Hidden Sparse Attention (HiSA), which keeps the query and key projections intact but only computes a partial dot product, following a static, parameter-free rule set by the token positions: attention becomes sparse in the hidden (feature) dimension, an axis much less explored than token sparsity, rather than over tokens as in almost all sparse attention methods. Based on the structure of rotary position embeddings (RoPE), we decompose keys and queries into parts which can be omitted when computing attention. By training LLMs from scratch with HiSA, we find that this partial dot product does not hurt but improves performance compared with the complete product while computing only about a third of the query-key products. During inference HiSA improves decoding speed and shrinks memory footprint. We also extend HiSA to FlashAttention-3 kernels for training and inference. Finally, we motivate our approach by showing that dense attention learns to suppress the attention score parts that HiSA drops. Code is available at https://github.com/ambroise-b/hisa.</description>
    </item>
  </channel>
</rss>
