Florent Delgrange won the Best Blue Sky Paper Award at AAMAS 2026 for his work Foundation World Models for Agents that Learn, Verify, and Adapt Reliably Beyond Static Environments . We caught up with him to find out more about his vision for agent learning. What is the topic of your Blue Sky Ideas paper and why is it an interesting area for study? My Blue Sky Ideas paper asks a simple but difficult question: how can an autonomous agent keep learning as its world changes without quietly losing the guarantees that made its behavior trustworthy? Reinforcement learning and formal methods address complementary parts of this problem.

The communications minister, Anika Wells, had said the report showed'many effective options' for online age verification in implementing Australia's social media ban. The communications minister, Anika Wells, had said the report showed'many effective options' for online age verification in implementing Australia's social media ban. Report supporting Australia's teen social media ban appears to contain AI hallucinations, Senate hears The authors of a report testing the technology underpinning Australia's social media ban have conceded ChatGPT was used in editing, but denied a number of citation errors in the report were due to AI hallucinations. The $3.48m age assurance technology trial, run by the UK-based Age Check Certification Scheme (ACCS) last year, tested various types of technology that could be used by social media platforms as part of Australia's under-16 social media ban. The communications minister, Anika Wells, heralded the report as showing "many effective options" for checking people's ages, and it paved the way for the ban to come into effect in December last year.

Anthropic's Claude AI chatbot may require some users to upload government-issued ID, passport, or driver's license starting July 8th for account verification. PCWorld reports this identity verification aims to prevent fraud and ensure terms of service compliance, handled by third-party service Persona. Similar ID verification policies by Discord, Reddit, and ChatGPT previously faced significant user backlash over privacy concerns. Anthropic has updated its privacy policy for its AI chatbot Claude. Starting July 8th, the company may--in certain situations--require users to verify their age or identity by uploading a copy of a government-issued ID card, passport, or driving license, reports TechCrunch .

Global society makes billions of images and uploads hundreds of thousands of hours of video on the internet every day. The problem is, some of this content is misleading or downright wrong. And when it's in visual form, it can be particularly convincing . Take the Met Gala that happened earlier this month in New York. While photographers snapped photos of Rhianna, Beyoncé and Nicole Kidman as they strutted their stuff, others saw "photos" of celebrities, such as Rosalía, Lady Gaga and Jacob Elordi, who were actually elsewhere (the images in the below Instagram carousel are AI generated).

Follow this section to personalize your feed and get instant alerts. Follow Go to your personalized feed WHY FOLLOW? Smart Alerts: Get notified about major news as it happens. Follow this tag to personalize your feed and get instant alerts. Follow Go to your personalized feed WHY FOLLOW?

Large Language Models (LLMs) have demonstrated advanced capabilities in realworld agentic applications. Growing research efforts aim to develop LLM-based agents to address practical demands, introducing a new challenge: agentic scenarios often involve lengthy instructions with complex constraints, such as extended system prompts and detailed tool specifications. While adherence to such instructions is crucial for agentic applications, whether LLMs can reliably follow them remains underexplored. In this paper, we introduce AGENTIF, the first benchmark for systematically evaluating LLM instruction following ability in agentic scenarios. AGENTIF features three key characteristics: (1) Realistic, constructed from 50 real-world agentic applications.

Ensembles of generative large language models (LLMs) are a promising way to compensate for individual model limitations, integrating the strengths of different LLMs. Existing LLM ensemble methods, however, face limitations such as first-token delay and challenges in long-range semantic collaboration between models, Moreover, they typically assume equal voting weights for all models during ensemble, ignoring task-specific performance differences among models. In this work, we propose SpecEM, a training-free, plug-and-play LLM ensemble framework that dynamically adjusts each model's model contribution in real time based on task performance. Inspired by speculative decoding, SpecEM iteratively performs drafting and verification, allowing models to collaborate semantically at the segment level for integrated output. Furthermore, we introduce an online feedback mechanism with multiplicative weight updates, where each model's voting weight is adjusted on-the-fly according to how often it outperforms others during verification stage, ensuring that stronger models exert greater influence during ensembling. Experimental results on five LLM families (ranging from 7B to 72B parameters) and six benchmark datasets, spanning open-domain instruction following, reasoning, commonsense, demonstrate consistent performance improvements compared to state-of-the-art LLM ensemble methods.

State-of-the-art neural network (NN) verifiers demonstrate that applying the branchand-bound (BaB) procedure with fast bounding techniques plays a key role in tackling many challenging verification properties. In this work, we introduce the linear constraint-driven clipping framework, a class of scalable and efficient methods designed to enhance the efficacy of NN verifiers. Under this framework, we develop two novel algorithms that efficiently utilize linear constraints to 1) reduce portions of the input space that are either verified or irrelevant to a subproblem in the context of branch-and-bound, and 2) directly improve intermediate bounds throughout the network. The process novelly leverages linear constraints that often arise from bound propagation methods and is general enough to also incorporate constraints from other sources. It efficiently handles linear constraints using a specialized GPU procedure that can scale to large neural networks without the use of expensive external solvers. Our verification procedure, Clip-and-Verify, consistently tightens bounds across multiple benchmarks and can significantly reduce the number of subproblems handled during BaB. We show that our clipping algorithms can be integrated with BaB-based verifiers such as α,β-CROWN, utilizing either the split constraints in activation-space BaB or the output constraints that denote the unverified input space. We demonstrate the effectiveness of our procedure on a broad range of benchmarks where, in some instances, we witness a 96% reduction in the number of subproblems during branch-and-bound, and also achieve state-of-the-art verified accuracy across multiple benchmarks. Clip-and-Verify is part of the α,β-CROWNverifier, the VNN-COMP 2025 winner.

T propose o address a no the vel challenge Agent-as-a-Judge of evaluating framew time-v ork. Our arying method and construct complex s answers, task-specific we judg answer of ten e a frontier g correctness ents based agentic and on a search source tree-structured systems attribution.

Speculative decoding is an effective and lossless method for Large Language Model (LLM) inference acceleration. It employs a smaller model to generate a draft token sequence, which is then verified by the original base model. In multi-GPU systems, inference latency can be further reduced through tensor parallelism (TP), while the optimal TP size of the draft model is typically smaller than that of the base model, leading to GPU idling during the drafting stage. We observe that such inefficiency stems from the sequential execution of layers, which is seemingly natural but actually unnecessary. Therefore, we propose EasySpec, a layer-parallel speculation strategy that optimizes the efficiency of multi-GPU utilization.