YouZum

Committee

AI, Committee, Actualités, Uncategorized

Google DeepMind Introduces Unified Latents (UL): A Machine Learning Framework that Jointly Regularizes Latents Using a Diffusion Prior and Decoder

Generative AI’s current trajectory relies heavily on Latent Diffusion Models (LDMs) to manage the computational cost of high-resolution synthesis. By compressing data into a lower-dimensional latent space, models can scale effectively. However, a fundamental trade-off persists: lower information density makes latents easier to learn but sacrifices reconstruction quality, while higher density enables near-perfect reconstruction but demands greater modeling capacity. Google DeepMind researchers have introduced Unified Latents (UL), a framework designed to navigate this trade-off systematically. The framework jointly regularizes latent representations with a diffusion prior and decodes them via a diffusion model. https://arxiv.org/pdf/2602.17270 The Architecture: Three Pillars of Unified Latents The Unified Latents (UL) framework rests on three specific technical components: Fixed Gaussian Noise Encoding: Unlike standard Variational Autoencoders (VAEs) that learn an encoder distribution, UL uses a deterministic encoder E𝝷 that predicts a single latent zclean. This latent is then forward-noised to a final log signal-to-noise ratio (log-SNR) of λ(0)=5. Prior-Alignment: The prior diffusion model is aligned with this minimum noise level. This alignment allows the Kullback-Leibler (KL) term in the Evidence Lower Bound (ELBO) to reduce to a simple weighted Mean Squared Error (MSE) over noise levels. Reweighted Decoder ELBO: The decoder utilizes a sigmoid-weighted loss, which provides an interpretable bound on the latent bitrate while allowing the model to prioritize different noise levels. The Two-Stage Training Process The UL framework is implemented in two distinct stages to optimize both latent learning and generation quality. Stage 1: Joint Latent Learning In the first stage, the encoder, diffusion prior (P𝝷), and diffusion decoder (D𝝷) are trained jointly. The objective is to learn latents that are simultaneously encoded, regularized, and modeled. The encoder’s output noise is linked directly to the prior’s minimum noise level, providing a tight upper bound on the latent bitrate. Stage 2: Base Model Scaling The research team found that a prior trained solely on an ELBO loss in Stage 1 does not produce optimal samples because it weights low-frequency and high-frequency content equally. Consequently, in Stage 2, the encoder and decoder are frozen. A new ‘base model’ is then trained on the latents using a sigmoid weighting, which significantly improves performance. This stage allows for larger model sizes and batch sizes. Technical Performance and SOTA Benchmarks Unified Latents demonstrate high efficiency in the relationship between training compute (FLOPs) and generation quality. Metric Dataset Result Significance FID ImageNet-512 1.4 Outperforms models trained on Stable Diffusion latents for a given compute budget. FVD Kinetics-600 1.3 Sets a new State-of-the-Art (SOTA) for video generation. PSNR ImageNet-512 Up to 30.1 Maintains high reconstruction fidelity even at higher compression levels. On ImageNet-512, UL outperformed previous approaches, including DiT and EDM2 variants, in terms of training cost versus generation FID. In video tasks using Kinetics-600, a small UL model achieved a 1.7 FVD, while the medium variant reached the SOTA 1.3 FVD. https://arxiv.org/pdf/2602.17270 Key Takeaways Integrated Diffusion Framework: UL is a framework that jointly optimizes an encoder, a diffusion prior, and a diffusion decoder, ensuring that latent representations are simultaneously encoded, regularized, and modeled for high-efficiency generation. Fixed-Noise Information Bound: By using a deterministic encoder that adds a fixed amount of Gaussian noise (specifically at a log-SNR of λ(0)=5) and linking it to the prior’s minimum noise level, the model provides a tight, interpretable upper bound on the latent bitrate. Two-Stage Training Strategy: The process involves an initial joint training stage for the autoencoder and prior, followed by a second stage where the encoder and decoder are frozen and a larger ‘base model’ is trained on the latents to maximize sample quality. State-of-the-Art Performance: The framework established a new state-of-the-art (SOTA) Fréchet Video Distance (FVD) of 1.3 on Kinetics-600 and achieved a competitive Fréchet Inception Distance (FID) of 1.4 on ImageNet-512 while requiring fewer training FLOPs than standard latent diffusion baselines. Check out the Paper. Also, feel free to follow us on Twitter and don’t forget to join our 120k+ ML SubReddit and Subscribe to our Newsletter. Wait! are you on telegram? now you can join us on telegram as well. The post Google DeepMind Introduces Unified Latents (UL): A Machine Learning Framework that Jointly Regularizes Latents Using a Diffusion Prior and Decoder appeared first on MarkTechPost.

Google DeepMind Introduces Unified Latents (UL): A Machine Learning Framework that Jointly Regularizes Latents Using a Diffusion Prior and Decoder Lire l’article »

AI, Committee, Actualités, Uncategorized

Alibaba Team Open-Sources CoPaw: A High-Performance Personal Agent Workstation for Developers to Scale Multi-Channel AI Workflows and Memory

As the industry moves from simple Large Language Model (LLM) inference toward autonomous agentic systems, the challenge for devs have shifted. It is no longer just about the model; it is about the environment in which that model operates. A team of researchers from Alibaba released CoPaw, an open-source framework designed to address this by providing a standardized workstation for deploying and managing personal AI agents. CoPaw is built on a technical stack comprising AgentScope, AgentScope Runtime, and ReMe. It functions as a bridge between high-level agent logic and the practical requirements of a personal assistant, such as persistent memory, multi-channel connectivity, and task scheduling. The Architecture: AgentScope and ReMe Integration CoPaw is not a standalone bot but a workstation that orchestrates multiple components to create a cohesive ‘Agentic App.’ The system relies on three primary layers: AgentScope: The underlying framework that handles agent communication and logic. AgentScope Runtime: The execution environment that ensures stable operation and resource management. ReMe (Memory Management): A specialized module that handles both local and cloud-based memory. This allows agents to maintain ‘Long-Term Experience,’ solving the statelessness issue inherent in standard LLM APIs. By leveraging ReMe, CoPaw allows users to control their data privacy while ensuring the agent retains context across different sessions and platforms. This persistent memory is what enables the workstation to adapt to a user’s specific workflows over time. Extensibility via the Skills System A core feature of the CoPaw workstation is its Skill Extension capability. In this framework, a ‘Skill’ is a discrete unit of functionality—essentially a tool that the agent can invoke to interact with the external world. Adding capabilities to CoPaw does not require modifying the core engine. Instead, CoPaw supports a custom skill directory where engineers can drop Python-based functions. These skills follow a standardized specification (influenced by anthropics/skills), allowing the agent to: Perform web scraping (e.g., summarizing Reddit threads or YouTube videos). Interact with local files and desktop environments. Query personal knowledge bases stored within the workstation. Manage calendars and email via natural language. This design allows for the creation of Agentic Apps—complex workflows where the agent uses a combination of built-in skills and scheduled tasks to achieve a goal autonomously. Multi-Channel Connectivity (All-Domain Access) One of the primary technical hurdles in personal AI is deployment across fragmented communication platforms. CoPaw addresses this through its All-Domain Access layer, which standardizes how agents interact with different messaging protocols. Currently, CoPaw supports integration with: Enterprise Platforms: DingTalk and Lark (Feishu). Social/Developer Platforms: Discord, QQ, and iMessage. This multi-channel support means that a developer can initialize a single CoPaw instance and interact with it from any of these endpoints. The workstation handles the translation of messages between the agent’s logic and the specific channel’s API, maintaining a consistent state and memory regardless of where the interaction occurs. Key Takeaways Shift from Model to Workstation: CoPaw moves the focus away from just the Large Language Model (LLM) and toward a structured Workstation architecture. It acts as a middleware layer that orchestrates the AgentScope framework, AgentScope Runtime, and external communication channels to turn raw LLM capabilities into a functional, persistent assistant. Long-Term Memory via ReMe: Unlike standard stateless LLM interactions, CoPaw integrates the ReMe (Memory Management) module. This allows agents to maintain ‘Long-Term Experience’ by storing user preferences and past task data either locally or in the cloud, enabling a personalized evolution of the agent’s behavior over time. Extensible Python-Based ‘Skills’: The framework uses a decoupled Skill Extension system based on the anthropics/skills specification. Developers can extend an agent’s utility by simply adding Python functions to a custom skill directory, allowing the agent to perform specific tasks like web scraping, file manipulation, or API integrations without modifying the core codebase. All-Domain Multi-Channel Access: CoPaw provides a unified interface for cross-platform deployment. A single workstation instance can be connected to enterprise tools (Lark, DingTalk) and social/developer platforms (Discord, QQ, iMessage), allowing the same agent and its memory to be accessed across different environments. Automated Agentic Workflows: By combining Scheduled Tasks with the skills system, CoPaw transitions from reactive chat to proactive automation. Devs can program ‘Agentic Apps’ that perform background operations—such as daily research synthesis or automated repository monitoring—and push results to the user’s preferred communication channel. Check out the Repo here and Website. Also, feel free to follow us on Twitter and don’t forget to join our 120k+ ML SubReddit and Subscribe to our Newsletter. Wait! are you on telegram? now you can join us on telegram as well. The post Alibaba Team Open-Sources CoPaw: A High-Performance Personal Agent Workstation for Developers to Scale Multi-Channel AI Workflows and Memory appeared first on MarkTechPost.

Alibaba Team Open-Sources CoPaw: A High-Performance Personal Agent Workstation for Developers to Scale Multi-Channel AI Workflows and Memory Lire l’article »

AI, Committee, Actualités, Uncategorized

Deepfake Word Detection by Next-token Prediction using Fine-tuned Whisper

arXiv:2602.22658v1 Announce Type: cross Abstract: Deepfake speech utterances can be forged by replacing one or more words in a bona fide utterance with semantically different words synthesized by speech generative models. While a dedicated synthetic word detector could be developed, we investigate a cost-effective method that fine-tunes a pre-trained Whisper model to detect synthetic words while transcribing the input utterance via next-token prediction. We further investigate using partially vocoded utterances as the fine-tuning data, thereby reducing the cost of data collection. Our experiments demonstrate that, on in-domain test data, the fine-tuned Whisper yields low synthetic-word detection error rates and transcription error rates. On out-of-domain test data with synthetic words produced by unseen speech generative models, the fine-tuned Whisper remains on par with a dedicated ResNet-based detection model; however, the overall performance degradation calls for strategies to improve its generalization capability.

Deepfake Word Detection by Next-token Prediction using Fine-tuned Whisper Lire l’article »

AI, Committee, Actualités, Uncategorized

OmniGAIA: Towards Native Omni-Modal AI Agents

arXiv:2602.22897v1 Announce Type: cross Abstract: Human intelligence naturally intertwines omni-modal perception — spanning vision, audio, and language — with complex reasoning and tool usage to interact with the world. However, current multi-modal LLMs are primarily confined to bi-modal interactions (e.g., vision-language), lacking the unified cognitive capabilities required for general AI assistants. To bridge this gap, we introduce OmniGAIA, a comprehensive benchmark designed to evaluate omni-modal agents on tasks necessitating deep reasoning and multi-turn tool execution across video, audio, and image modalities. Constructed via a novel omni-modal event graph approach, OmniGAIA synthesizes complex, multi-hop queries derived from real-world data that require cross-modal reasoning and external tool integration. Furthermore, we propose OmniAtlas, a native omni-modal foundation agent under tool-integrated reasoning paradigm with active omni-modal perception. Trained on trajectories synthesized via a hindsight-guided tree exploration strategy and OmniDPO for fine-grained error correction, OmniAtlas effectively enhances the tool-use capabilities of existing open-source models. This work marks a step towards next-generation native omni-modal AI assistants for real-world scenarios.

OmniGAIA: Towards Native Omni-Modal AI Agents Lire l’article »

AI, Committee, Actualités, Uncategorized

Under the Influence: Quantifying Persuasion and Vigilance in Large Language Models

arXiv:2602.21262v2 Announce Type: replace Abstract: With increasing integration of Large Language Models (LLMs) into areas of high-stakes human decision-making, it is important to understand the risks they introduce as advisors. To be useful advisors, LLMs must sift through large amounts of content, written with both benevolent and malicious intent, and then use this information to convince a user to take a specific action. This involves two social capacities: vigilance (the ability to determine which information to use, and which to discard) and persuasion (synthesizing the available evidence to make a convincing argument). While existing work has investigated these capacities in isolation, there has been little prior investigation of how these capacities may be linked. Here, we use a simple multi-turn puzzle-solving game, Sokoban, to study LLMs’ abilities to persuade and be rationally vigilant towards other LLM agents. We find that puzzle-solving performance, persuasive capability, and vigilance are dissociable capacities in LLMs. Performing well on the game does not automatically mean a model can detect when it is being misled, even if the possibility of deception is explicitly mentioned. However, LLMs do consistently modulate their token use, using fewer tokens to reason when advice is benevolent and more when it is malicious, even if they are still persuaded to take actions leading them to failure. To our knowledge, our work presents the first investigation of the relationship between persuasion, vigilance, and task performance in LLMs, and suggests that monitoring all three independently will be critical for future work in AI safety.

Under the Influence: Quantifying Persuasion and Vigilance in Large Language Models Lire l’article »

AI, Committee, Actualités, Uncategorized

Tokenization, Fusion and Decoupling: Bridging the Granularity Mismatch Between Large Language Models and Knowledge Graphs

arXiv:2602.22698v1 Announce Type: new Abstract: Leveraging Large Language Models (LLMs) for Knowledge Graph Completion (KGC) is promising but hindered by a fundamental granularity mismatch. LLMs operate on fragmented token sequences, whereas entities are the fundamental units in knowledge graphs (KGs) scenarios. Existing approaches typically constrain predictions to limited candidate sets or align entities with the LLM’s vocabulary by pooling multiple tokens or decomposing entities into fixed-length token sequences, which fail to capture both the semantic meaning of the text and the structural integrity of the graph. To address this, we propose KGT, a novel framework that uses dedicated entity tokens to enable efficient, full-space prediction. Specifically, we first introduce specialized tokenization to construct feature representations at the level of dedicated entity tokens. We then fuse pre-trained structural and textual features into these unified embeddings via a relation-guided gating mechanism, avoiding training from scratch. Finally, we implement decoupled prediction by leveraging independent heads to separate and combine semantic and structural reasoning. Experimental results show that KGT consistently outperforms state-of-the-art methods across multiple benchmarks.

Tokenization, Fusion and Decoupling: Bridging the Granularity Mismatch Between Large Language Models and Knowledge Graphs Lire l’article »

AI, Committee, Actualités, Uncategorized

Make It Hard to Hear, Easy to Learn: Long-Form Bengali ASR and Speaker Diarization via Extreme Augmentation and Perfect Alignment

arXiv:2602.23070v1 Announce Type: cross Abstract: Although Automatic Speech Recognition (ASR) in Bengali has seen significant progress, processing long-duration audio and performing robust speaker diarization remain critical research gaps. To address the severe scarcity of joint ASR and diarization resources for this language, we introduce Lipi-Ghor-882, a comprehensive 882-hour multi-speaker Bengali dataset. In this paper, detailing our submission to the DL Sprint 4.0 competition, we systematically evaluate various architectures and approaches for long-form Bengali speech. For ASR, we demonstrate that raw data scaling is ineffective; instead, targeted fine-tuning utilizing perfectly aligned annotations paired with synthetic acoustic degradation (noise and reverberation) emerges as the singular most effective approach. Conversely, for speaker diarization, we observed that global open-source state-of-the-art models (such as Diarizen) performed surprisingly poorly on this complex dataset. Extensive model retraining yielded negligible improvements; instead, strategic, heuristic post-processing of baseline model outputs proved to be the primary driver for increasing accuracy. Ultimately, this work outlines a highly optimized dual pipeline achieving a $sim$0.019 Real-Time Factor (RTF), establishing a practical, empirically backed benchmark for low-resource, long-form speech processing.

Make It Hard to Hear, Easy to Learn: Long-Form Bengali ASR and Speaker Diarization via Extreme Augmentation and Perfect Alignment Lire l’article »

AI, Committee, Actualités, Uncategorized

SmartChunk Retrieval: Query-Aware Chunk Compression with Planning for Efficient Document RAG

arXiv:2602.22225v1 Announce Type: cross Abstract: Retrieval-augmented generation (RAG) has strong potential for producing accurate and factual outputs by combining language models (LMs) with evidence retrieved from large text corpora. However, current pipelines are limited by static chunking and flat retrieval: documents are split into short, predetermined, fixed-size chunks, embeddings are retrieved uniformly, and generation relies on whatever chunks are returned. This design brings challenges, as retrieval quality is highly sensitive to chunk size, often introduces noise from irrelevant or misleading chunks, and scales poorly to large corpora. We present SmartChunk retrieval, a query-adaptive framework for efficient and robust long-document question answering (QA). SmartChunk uses (i) a planner that predicts the optimal chunk abstraction level for each query, and (ii) a lightweight compression module that produces high-level chunk embeddings without repeated summarization. By adapting retrieval granularity on the fly, SmartChunk balances accuracy with efficiency and avoids the drawbacks of fixed strategies. Notably, our planner can reason about chunk abstractions through a novel reinforcement learning scheme, STITCH, which boosts accuracy and generalization. To reflect real-world applications, where users face diverse document types and query styles, we evaluate SmartChunk on five QA benchmarks plus one out-of-domain dataset. Across these evaluations, SmartChunk outperforms state-of-the-art RAG baselines, while reducing cost. Further analysis demonstrates strong scalability with larger corpora and consistent gains on out-of-domain datasets, highlighting its effectiveness as a general framework for adaptive retrieval.

SmartChunk Retrieval: Query-Aware Chunk Compression with Planning for Efficient Document RAG Lire l’article »

AI, Committee, Actualités, Uncategorized

Human Label Variation in Implicit Discourse Relation Recognition

arXiv:2602.22723v1 Announce Type: new Abstract: There is growing recognition that many NLP tasks lack a single ground truth, as human judgments reflect diverse perspectives. To capture this variation, models have been developed to predict full annotation distributions rather than majority labels, while perspectivist models aim to reproduce the interpretations of individual annotators. In this work, we compare these approaches on Implicit Discourse Relation Recognition (IDRR), a highly ambiguous task where disagreement often arises from cognitive complexity rather than ideological bias. Our experiments show that existing annotator-specific models perform poorly in IDRR unless ambiguity is reduced, whereas models trained on label distributions yield more stable predictions. Further analysis indicates that frequent cognitively demanding cases drive inconsistency in human interpretation, posing challenges for perspectivist modeling in IDRR.

Human Label Variation in Implicit Discourse Relation Recognition Lire l’article »

AI, Committee, Actualités, Uncategorized

Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators

arXiv:2602.22647v1 Announce Type: cross Abstract: Generative retrieval has emerged as a powerful paradigm for LLM-based recommendation. However, industrial recommender systems often benefit from restricting the output space to a constrained subset of items based on business logic (e.g. enforcing content freshness or product category), which standard autoregressive decoding cannot natively support. Moreover, existing constrained decoding methods that make use of prefix trees (Tries) incur severe latency penalties on hardware accelerators (TPUs/GPUs). In this work, we introduce STATIC (Sparse Transition Matrix-Accelerated Trie Index for Constrained Decoding), an efficient and scalable constrained decoding technique designed specifically for high-throughput LLM-based generative retrieval on TPUs/GPUs. By flattening the prefix tree into a static Compressed Sparse Row (CSR) matrix, we transform irregular tree traversals into fully vectorized sparse matrix operations, unlocking massive efficiency gains on hardware accelerators. We deploy STATIC on a large-scale industrial video recommendation platform serving billions of users. STATIC produces significant product metric impact with minimal latency overhead (0.033 ms per step and 0.25% of inference time), achieving a 948x speedup over a CPU trie implementation and a 47-1033x speedup over a hardware-accelerated binary-search baseline. Furthermore, the runtime overhead of STATIC remains extremely low across a wide range of practical configurations. To the best of our knowledge, STATIC enables the first production-scale deployment of strictly constrained generative retrieval. In addition, evaluation on academic benchmarks demonstrates that STATIC can considerably improve cold-start performance for generative retrieval. Our code is available at https://github.com/youtube/static-constraint-decoding.

Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators Lire l’article »

We use cookies to improve your experience and performance on our website. You can learn more at Politique de confidentialité and manage your privacy settings by clicking Settings.

Privacy Preferences

You can choose your cookie settings by turning on/off each type of cookie as you wish, except for essential cookies.

Allow All
Manage Consent Preferences
  • Always Active

Save
fr_FR