[ { "id": "arxiv:2606.19874", "source": "arxiv", "source_type": "preprint", "title": "MMD-SLAM: Structure-Enhanced Multi-Meta Gaussian Distribution-Guided Visual SLAM", "abstract": "3D Gaussian Splatting (3DGS) has significantly boosted novel view synthesis and high-fidelity scene reconstruction, expanding the potential of 3DGS-based Visual Simultaneous Localization and Mapping (SLAM) methods. However, most existing systems fail to fully exploit the underlying structural information, which limits rendering quality and often leads to inconsistent maps. To address these limitations, we propose MMD-SLAM, a structure-enhanced Visual SLAM framework that leverages the Atlanta World (AW) assumption to guide a Multi-Meta Gaussian representation for photorealistic mapping. First, we introduce a point-line fusion strategy for pose optimization, where 3D line segments are incorporated to improve tracking robustness and provide additional constraints for mapping. Second, we design a Multi-Meta Gaussian representation with dominant directions, explicitly encoding structural priors from the AW hypothesis. Finally, we propose a Gaussian evolution strategy that adapts to scene geometry and incorporates structural cues into global optimization. Extensive experiments demonstrate that these innovations enable MMD-SLAM to achieve state-of-the-art performance in both tracking accuracy and mapping quality. e.g., our method achieves a 48.56% reduction in ATE RMSE on ScanNet and a 5.71% improvement in PSNR on Replica, compared with MonoGS.", "authors": [ "Fan Zhu", "Ziyu Chen", "Peichen Liu", "Yifan Zhao", "Zhisong Xu", "Hui Zhu", "Hongxing Zhou", "Sixun Liu", "Chunmao Jiang" ], "year": 2026, "published_date": "2026-06-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.19874", "pdf_url": "https://arxiv.org/pdf/2606.19874", "citations": 0, "topics": [], "tags": [ "3D Vision", "Robotics", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 4.48, "read_first_score": 5.61, "content_potential_score": 1.0, "interestingness_score": 2.74, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "3D Gaussian Splatting (3DGS) has significantly boosted novel view synthesis and high-fidelity scene reconstruction, expanding the potential of 3DGS-based Visual Simultaneous Localization and Mapping (SLAM) methods. However, most existing systems fail to fully exploit the underlying structural information, which limits rendering quality and often leads to inconsistent maps.", "key_contribution": "3D Gaussian Splatting (3DGS) has significantly boosted novel view synthesis and high-fidelity scene reconstruction, expanding the potential of 3DGS-based Visual Simultaneous Localization and Mapping (SLAM) methods.", "why_it_matters": "MMD-SLAM: Structure-Enhanced Multi-Meta Gaussian Distribution-Guided Visual SLAM advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about 3D Vision.", "one_line_takeaway": "3D Gaussian Splatting (3DGS) has significantly boosted novel view synthesis and high-fidelity scene reconstruction,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in 3D Vision.", "url": "https://arxiv.org/abs/2606.19874", "difficulty": "intermediate" }, { "id": "arxiv:2606.22692", "source": "arxiv", "source_type": "preprint", "title": "VISTA Architect: A graph database-oriented health AI system demonstrated in multidisciplinary tumor boards", "abstract": "We introduce VISTA Architect, a database-oriented AI architecture for integrating large language models (LLMs) with longitudinal electronic health records (EHRs). At ingestion, it transforms complex clinical documentation into a persistent, provenance-linked knowledge graph, eliminating repeated reprocessing of raw records at query time. The architecture has two layers: a source-faithful MEDS Graph preserving granular EHR structure with full provenance, and a clinically abstracted Timeline Object Architecture (TOA) that uses graph-guided LLM extraction to synthesize a concise timeline of deduplicated, temporally coherent clinical events. This addresses key limitations of direct long-context prompting and retrieval-augmented generation (RAG), which often miss temporal relationships and incur high cost and latency from repeated raw-text processing. By precomputing clinical synthesis once, downstream queries access an organized patient state and traverse to source documentation only when detailed verification is needed. We demonstrate the system in multidisciplinary thoracic oncology tumor boards at Stanford Medicine, where precise reconstruction of patient histories is critical. Across 1,180 patients, VISTA Architect achieved 96.4% accuracy (mean 9.75/10) on 15 tumor board-salient variables (17,700 evaluations; 95% CI 96.1-96.7%), surpassing a matched BM25 RAG baseline and recent benchmarks for LLM-based clinical extraction. An agentic interface reduced preparation for a 30-patient held-out cohort to about 2.2 minutes without sacrificing accuracy. While configured here for thoracic oncology, the modular design adapts to other specialties through customizable event definitions, episode structures, and agentic tools; validation beyond thoracic oncology remains future work.", "authors": [ "Tuomo Kiiskinen", "Jason Fries", "Philip Adamson", "David Wu", "Timothy John Ellis-Caleo", "Aaron Fanous", "Balasubramanian Narasimhan", "Joel Neal", "Sylvia Plevritis", "Manuel A. Rivas" ], "year": 2026, "published_date": "2026-06-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.22692", "pdf_url": "https://arxiv.org/pdf/2606.22692", "citations": 0, "topics": [], "tags": [ "LLMs", "Long Context", "AI Agents", "RAG", "Biomedical AI" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 4.2, "read_first_score": 5.36, "content_potential_score": 1.0, "interestingness_score": 2.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce VISTA Architect, a database-oriented AI architecture for integrating large language models (LLMs) with longitudinal electronic health records (EHRs). At ingestion, it transforms complex clinical documentation into a persistent, provenance-linked knowledge graph, eliminating repeated reprocessing of raw records at query time.", "key_contribution": "We introduce VISTA Architect, a database-oriented AI architecture for integrating large language models (LLMs) with longitudinal electronic health records (EHRs).", "why_it_matters": "VISTA Architect: A graph database-oriented health AI system demonstrated in multidisciplinary tumor boards represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce VISTA Architect, a database-oriented AI architecture for integrating large language models (LLMs) with…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.22692", "difficulty": "intermediate" }, { "id": "arxiv:2608.02271", "source": "arxiv", "source_type": "preprint", "title": "Z-PEFT: Zero-shot Backdoor Detection in Parameter-Efficient Fine-Tuning via Canonical Spectral Signatures", "abstract": "Parameter-Efficient Fine-tuned (PEFT) models are frequently downloaded from open repositories by practitioners. This widespread practice creates a significant attack surface, as malicious actors can publish backdoored models that induce specific behaviors in response to predefined triggers. We study the problem of weight-space backdoor detection, where a detector classifier predicts whether a model is malicious using only its weights, enabling a lightweight safety mechanism. Most existing methods are designed and evaluated in a closed-world setting, where the detector is trained and tested on the same attack type. In contrast, we evaluate backdoor detection under novel conditions, including previously unseen attacks and datasets. We propose Z-PEFT, a lightweight meta-classifier that relies exclusively on layer-wise spectral measures for classification. Our experiments show that strong performance in the closed-world setting does not necessarily translate to high accuracy in zero-shot backdoor detection. Among weight-space detectors, Z-PEFT achieves the best performance while maintaining low and scalable computational cost.", "authors": [ "Nicola Pitzalis", "Donald Shenaj", "Giacomo Cignoni", "Andrea Cossu", "Davide Bacciu", "Antonio Carta" ], "year": 2026, "published_date": "2026-08-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.02271", "pdf_url": "https://arxiv.org/pdf/2608.02271", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 4.09, "read_first_score": 4.29, "content_potential_score": 1.0, "interestingness_score": 2.54, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Parameter-Efficient Fine-tuned (PEFT) models are frequently downloaded from open repositories by practitioners. This widespread practice creates a significant attack surface, as malicious actors can publish backdoored models that induce specific behaviors in response to predefined triggers.", "key_contribution": "In contrast, we evaluate backdoor detection under novel conditions, including previously unseen attacks and datasets.", "why_it_matters": "Z-PEFT: Zero-shot Backdoor Detection in Parameter-Efficient Fine-Tuning via Canonical Spectral Signatures represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "In contrast, we evaluate backdoor detection under novel conditions, including previously unseen attacks and datasets.", "biggest_caveat": "does not necessarily translate to high accuracy in zero-shot backdoor detection.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2608.02271", "difficulty": "intermediate" }, { "id": "arxiv:2605.08144", "source": "arxiv", "source_type": "preprint", "title": "NoiseRater: Meta-Learned Noise Valuation for Diffusion Model Training", "abstract": "Diffusion models have achieved remarkable success across a wide range of generative tasks, yet their training paradigm largely treats injected noise as uniformly informative. In this work, we challenge this assumption and introduce NoiseRater, a meta-learning framework for instance-level noise valuation in diffusion model training. We propose a parametric noise rater that assigns importance scores to individual noise realizations conditioned on data and timestep, enabling adaptive reweighting of the training objective. The rater is trained via bilevel optimization to improve downstream validation performance after inner-loop diffusion updates. To enable efficient deployment, we further design a decoupled two-stage pipeline that transitions from soft weighting during meta-training to hard noise selection during standard training. Extensive experiments on FFHQ and ImageNet demonstrate that not all noise samples contribute equally, and that prioritizing informative noise improves both training efficiency and generation quality. Our results establish noise valuation as a complementary and previously underexplored axis for improving diffusion model training. Our code is available at: https://anonymous.4open.science/r/NoiseRater-DEB116.", "authors": [ "Fang Wu", "Haokai Zhao", "Da Xing", "Hanqun Cao", "Tinson Xu", "Yanchao Li", "Xiangru Tang", "Zehong Wang", "Aaron Tu", "Kuan Pang", "Hanchen Wang", "Hongbin Lin", "Zeqi Zhou", "Yinxi Li", "Peng Xia", "Li Erran Li", "Molei Tao", "Jure Leskovec", "Aditya Joshi", "Yejin Choi" ], "year": 2026, "published_date": "2026-05-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.08144", "pdf_url": "https://arxiv.org/pdf/2605.08144", "citations": 0, "topics": [], "tags": [ "Diffusion", "Info Extraction", "Artificial Intelligence", "Machine Learning", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Diffusion) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.97, "read_first_score": 4.91, "content_potential_score": 1.0, "interestingness_score": 2.49, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Diffusion models have achieved remarkable success across a wide range of generative tasks, yet their training paradigm largely treats injected noise as uniformly informative. In this work, we challenge this assumption and introduce NoiseRater, a meta-learning framework for instance-level noise valuation in diffusion model training.", "key_contribution": "In this work, we challenge this assumption and introduce NoiseRater, a meta-learning framework for instance-level noise valuation in diffusion model training.", "why_it_matters": "NoiseRater: Meta-Learned Noise Valuation for Diffusion Model Training advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Diffusion.", "one_line_takeaway": "In this work, we challenge this assumption and introduce NoiseRater, a meta-learning framework for instance-level noise…", "biggest_caveat": "bute equally, and that prioritizing informative noise improves both training efficiency and generation quality.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Diffusion.", "url": "https://arxiv.org/abs/2605.08144", "difficulty": "advanced" }, { "id": "arxiv:2609.00196", "source": "arxiv", "source_type": "preprint", "title": "WHALE: A Simple Recipe for Joint Harness-Weight Optimization", "abstract": "Agent performance depends jointly on the model parameters and the executable harness code that manages context and control flow. Optimizing either component in isolation can leave the system bottlenecked by its frozen counterpart: weight updates can change which harness is effective, while harness updates can change which model capabilities are exposed. Existing joint-adaptation methods optimize weights and textual prompts but leave the broader harness fixed. We propose Weight-Harness Alternating LEarning (WHALE), a simple recipe that alternates two phases: updating the model under the current harness, then searching for a better harness under the updated model. We instantiate these two phases with online rejection-sampling fine-tuning and Meta-Harness, respectively. When to switch is a key design choice: to separate real improvements from noise without over-optimizing against a changing counterpart, WHALE uses either fixed phase durations or an adaptive patience rule over training signals. Using Qwen3.5-2B/4B agents across three domains (search question answering, mathematical reasoning, and chess puzzles), WHALE outperforms weight-only, harness-only, and Fast-Slow Training by 4.15-24.38 percentage points in best mean@8 accuracy. Either component can be the bottleneck: harness search matches peak weight-only accuracy with far fewer rollouts in SearchQA, but improves math accuracy only after a weight update. Small interleaved updates also outperform stagewise weight-then-harness optimization in accuracy and rollout cost. The code is available at https://github.com/krafton-ai/WHALE.", "authors": [ "Haechan Kim", "Yoonho Lee", "Gisang Lee", "Chelsea Finn", "Kangwook Lee" ], "year": 2026, "published_date": "2026-08-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.00196", "pdf_url": "https://arxiv.org/pdf/2609.00196", "citations": 0, "topics": [], "tags": [ "Reasoning", "Fine-Tuning", "QA", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.94, "read_first_score": 5.21, "content_potential_score": 1.0, "interestingness_score": 2.47, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agent performance depends jointly on the model parameters and the executable harness code that manages context and control flow. Optimizing either component in isolation can leave the system bottlenecked by its frozen counterpart: weight updates can change which harness is effective, while harness updates can change which model capabilities are exposed.", "key_contribution": "We propose Weight-Harness Alternating LEarning (WHALE), a simple recipe that alternates two phases: updating the model under the current harness, then searching for a better harness under the updated model.", "why_it_matters": "WHALE: A Simple Recipe for Joint Harness-Weight Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We propose Weight-Harness Alternating LEarning (WHALE), a simple recipe that alternates two phases: updating the model…", "biggest_caveat": "but leave the broader harness fixed.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2609.00196", "difficulty": "beginner" }, { "id": "arxiv:2603.11504", "source": "arxiv", "source_type": "preprint", "title": "LongFlow: Efficient KV Cache Compression for Reasoning Models", "abstract": "Recent reasoning models such as OpenAI-o1 and DeepSeek-R1 have shown strong performance on complex tasks including mathematical reasoning and code generation. However, this performance gain comes with substantially longer output sequences, leading to significantly increased deployment costs. In particular, long outputs require large KV caches, resulting in high memory consumption and severe bandwidth pressure during attention computation. Most existing KV cache optimization methods are designed for long-input, short-output scenarios and are ineffective for the long-output setting of reasoning models. Moreover, importance estimation in prior work is computationally expensive and becomes prohibitive when continuous re-evaluation is required during long generation. To address these challenges, we propose LongFlow, a KV cache compression method with an efficient importance estimation metric derived from an intermediate result of attention computation using only the current query. This design introduces negligible computational overhead and requires no auxiliary storage. We further develop a custom kernel that fuses FlashAttention, importance estimation, and token eviction into a single optimized operator, improving system-level efficiency. Experiments show that LongFlow achieves up to an 11.8 times throughput improvement with 80% KV cache compression with minimal impact on model accuracy.", "authors": [ "Yi Su", "Zhenxu Tian", "Dan Qiao", "Yuechi Zhou", "Juntao Li", "Min Zhang" ], "year": 2026, "published_date": "2026-04-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.11504", "pdf_url": "https://arxiv.org/pdf/2603.11504", "citations": 0, "topics": [], "tags": [ "Reasoning", "Code Generation", "Machine Learning", "NLP" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.92, "read_first_score": 4.46, "content_potential_score": 1.42, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent reasoning models such as OpenAI-o1 and DeepSeek-R1 have shown strong performance on complex tasks including mathematical reasoning and code generation. However, this performance gain comes with substantially longer output sequences, leading to significantly increased deployment costs.", "key_contribution": "To address these challenges, we propose LongFlow, a KV cache compression method with an efficient importance estimation metric derived from an intermediate result of attention computation using only the current query.", "why_it_matters": "LongFlow: Efficient KV Cache Compression for Reasoning Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "To address these challenges, we propose LongFlow, a KV cache compression method with an efficient importance estimation…", "biggest_caveat": "However, this performance gain comes with substantially longer output sequences, leading to significantly increased deployment costs.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2603.11504", "difficulty": "intermediate" }, { "id": "arxiv:2605.31002", "source": "arxiv", "source_type": "preprint", "title": "Modeling and Optimization for Massive Data Allocation in Database", "abstract": "In the era of big data, e-commerce and Internet platforms face the challenge of processing massive amounts of data. However, due to data being scattered across different machines in distributed database, extra communication costs are incurred in gathering relevant data to complete transactions. Without a carefully designed data placement scheme, this cost can severely impact the performance of Online Transaction Processing systems. To meet industry requirements, algorithms that output a data placement scheme that achieves i) data balance and ii) low communication overhead within a fixed period of time are eagerly investigated. Although some existing methods have been studied, they do not adequately meet the aforementioned requirements. In this paper, inspired by the normalized cut of spectral clustering, we introduce a novel model for data allocation problem. The normalized cut reconciles the inherent conflict between the two objectives. Taking into account the variable characteristics of the model, we formulate the problem as a 0-1 optimization problem, and solve the relaxed problem using the Bregman proximal gradient method with guaranteed convergence. The numerical experiments reveal that the convergent solutions can be smoothly rounded to discrete solutions. Furthermore, our algorithm surpasses both simple and meta-heuristic partitioning schemes by minimizing migration costs while maintaining a superior balance.", "authors": [ "Panpan Niu", "Boxiang Ren", "Hao Wu", "Xin Yao" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.31002", "pdf_url": "https://arxiv.org/pdf/2605.31002", "citations": 0, "topics": [], "tags": [ "Databases" ], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.91, "read_first_score": 6.22, "content_potential_score": 0.0, "interestingness_score": 1.96, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In the era of big data, e-commerce and Internet platforms face the challenge of processing massive amounts of data. However, due to data being scattered across different machines in distributed database, extra communication costs are incurred in gathering relevant data to complete transactions.", "key_contribution": "In this paper, inspired by the normalized cut of spectral clustering, we introduce a novel model for data allocation problem.", "why_it_matters": "Modeling and Optimization for Massive Data Allocation in Database represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Databases.", "one_line_takeaway": "In this paper, inspired by the normalized cut of spectral clustering, we introduce a novel model for data allocation…", "biggest_caveat": "buted database, extra communication costs are incurred in gathering relevant data to complete transactions.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Databases.", "url": "https://arxiv.org/abs/2605.31002", "difficulty": "intermediate" }, { "id": "arxiv:2605.22513", "source": "arxiv", "source_type": "preprint", "title": "Meta-Learning for Rapid Adaptation in Reference Tracking of Uncertain Nonlinear Systems", "abstract": "In this paper, we address the problem of reference tracking for uncertain nonlinear systems. Since collecting data from the target system (i.e., the system of interest) is often challenging, our objective is to design optimal controllers using limited target system data. Meta-learning provides a promising paradigm by leveraging offline data from source systems (systems sharing structural similarities with the target system) to accelerate training and enhance control performance. Motivated by this idea, we propose a meta-learning-based control framework that tailors the implicit model-agnostic meta-learning (iMAML) algorithm to the control setting. The framework operates in two phases: an (offline) meta-training phase, where an aggregated representation is learned from source data to capture the shared system dynamics among similar systems, and an (online) meta-adaptation phase, where this representation is fine-tuned on the target system using only a few data samples and limited adaptation steps. We formulate this framework as a bi-level optimization problem and provide an efficient solution with reduced storage complexity and few approximations. The proposed framework is general, allowing various learning algorithms to be integrated. To demonstrate this flexibility, we propose two specific learning algorithms that can be incorporated into our framework based on a neural state-space model and a deep Q-network, respectively. The primary distinction between these approaches is whether explicit system identification is required. Numerical simulations and hardware experiments demonstrate that the proposed methods enhance control performance and consistently outperform baseline approaches.", "authors": [ "Jiaqi Yan", "Ankush Chakrabarty", "Niklas Schmid", "John Lygeros", "Alisa Rupenyan" ], "year": 2026, "published_date": "2026-05-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.22513", "pdf_url": "https://arxiv.org/pdf/2605.22513", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.9, "read_first_score": 5.75, "content_potential_score": 1.0, "interestingness_score": 2.45, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In this paper, we address the problem of reference tracking for uncertain nonlinear systems. Since collecting data from the target system (i.e., the system of interest) is often challenging, our objective is to design optimal controllers using limited target system data.", "key_contribution": "Motivated by this idea, we propose a meta-learning-based control framework that tailors the implicit model-agnostic meta-learning (iMAML) algorithm to the control setting.", "why_it_matters": "Meta-Learning for Rapid Adaptation in Reference Tracking of Uncertain Nonlinear Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "Motivated by this idea, we propose a meta-learning-based control framework that tailors the implicit model-agnostic…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2605.22513", "difficulty": "intermediate" }, { "id": "arxiv:2605.04055", "source": "arxiv", "source_type": "preprint", "title": "A Self-Attentive Meta-Optimizer with Group-Adaptive Learning Rates and Weight Decay", "abstract": "Adaptive optimizers like AdamW apply uniform hyperparameters across all parameter groups, ignoring heterogeneous optimization dynamics across layers and modules. We address this limitation by proposing MetaAdamW - a new optimizer that integrates a self-attention mechanism to dynamically modulate per-group learning rates and weight decay. The modulation factors are produced by a lightweight Transformer encoder that operates on statistical features (gradient norms, momentum norms, correlations) extracted from each parameter group. To train the attention module, we introduce a meta-learning objective that combines gradient alignment, loss decrease, and generalization gap. A key novel contribution is the extension of homoscedastic uncertainty weighting (HUW) with task-specific priorities that directly scale the regularization terms - enabling domain knowledge to guide automatic loss balancing. Extensive experiments on five diverse tasks-time series forecasting (ETT), language modeling (WikiText-2), machine translation (Multi30k), image classification (CIFAR-10), and sentiment analysis (IMDB) - demonstrate that MetaAdamW consistently outperforms the standard AdamW baseline in terms of validation loss, accuracy, or perplexity. Depending on the task, MetaAdamW either reduces overall training time (by up to 17.11%) or improves performance (by up to 11.08%) while introducing only moderate overhead; in some cases, it can also mitigate issues of insufficient convergence caused by premature early stopping. Ablation studies validate the effectiveness of each component, including feature versions, grouping strategies, and the proposed priority-injected uncertainty weighting.", "authors": [ "JiangBo Zhao", "ZhaoXin Liu" ], "year": 2026, "published_date": "2026-04-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.04055", "pdf_url": "https://arxiv.org/pdf/2605.04055", "citations": 0, "topics": [], "tags": [ "AI Safety", "Object Detection", "Translation", "Sentiment Analysis", "Transformers" ], "paper_type": "theory", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Sentiment Analysis, Translation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.9, "read_first_score": 7.22, "content_potential_score": 0.0, "interestingness_score": 1.95, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Adaptive optimizers like AdamW apply uniform hyperparameters across all parameter groups, ignoring heterogeneous optimization dynamics across layers and modules. We address this limitation by proposing MetaAdamW - a new optimizer that integrates a self-attention mechanism to dynamically modulate per-group learning rates and weight decay.", "key_contribution": "To train the attention module, we introduce a meta-learning objective that combines gradient alignment, loss decrease, and generalization gap.", "why_it_matters": "A Self-Attentive Meta-Optimizer with Group-Adaptive Learning Rates and Weight Decay represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "To train the attention module, we introduce a meta-learning objective that combines gradient alignment, loss decrease,…", "biggest_caveat": "limitation by proposing MetaAdamW - a new optimizer that integrates a self-attention mechanism to dynamically modulate per-group learning rates and weight decay.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2605.04055", "difficulty": "beginner" }, { "id": "arxiv:2607.02850", "source": "arxiv", "source_type": "preprint", "title": "Labeled-Data-Free Meta-Learning: Efficient Task Generation Using Pre-trained Models and Unlabeled Data", "abstract": "Meta-learning without labeled data is crucial for real-world applications, where obtaining labeled datasets can be expensive or restricted due to privacy concerns. Data-Free Meta-Learning (DFML) addresses this challenge by leveraging pre-trained models without access to training data. However, existing DFML methods rely on model inversion to generate training data, a process that is generally difficult and computationally expensive due to the need to generate high-dimensional data matching the original distribution. To address this limitation, we propose a novel meta-learning setting that avoids model inversion by jointly leveraging pre-trained models and unlabeled data. Our method generates meta-training tasks by assigning soft labels from pre-trained models to unlabeled data. Since the quality of these tasks can vary, we introduce a task-weighting mechanism based on task confidence and class distribution balance to ensure effective meta-learning. Extensive experiments demonstrate that our approach substantially reduces computational cost and improves generalization, achieving up to 104-fold speedup and 8.4 percent to 36.4 percent improvements in few-shot classification accuracy compared to state-of-the-art DFML methods.", "authors": [ "Lei Sun", "Yusuke Tanaka", "Tomoharu Iwata" ], "year": 2026, "published_date": "2026-07-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.02850", "pdf_url": "https://arxiv.org/pdf/2607.02850", "citations": 0, "topics": [], "tags": [ "Prompting", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.87, "read_first_score": 6.13, "content_potential_score": 0.0, "interestingness_score": 1.94, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Meta-learning without labeled data is crucial for real-world applications, where obtaining labeled datasets can be expensive or restricted due to privacy concerns. Data-Free Meta-Learning (DFML) addresses this challenge by leveraging pre-trained models without access to training data.", "key_contribution": "To address this limitation, we propose a novel meta-learning setting that avoids model inversion by jointly leveraging pre-trained models and unlabeled data.", "why_it_matters": "Labeled-Data-Free Meta-Learning: Efficient Task Generation Using Pre-trained Models and Unlabeled Data represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "To address this limitation, we propose a novel meta-learning setting that avoids model inversion by jointly leveraging…", "biggest_caveat": "limitation, we propose a novel meta-learning setting that avoids model inversion by jointly leveraging pre-trained models and unlabeled data.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2607.02850", "difficulty": "beginner" }, { "id": "arxiv:2505.13919", "source": "arxiv", "source_type": "preprint", "title": "Generative Adaptation of Dynamics to Environmental Shifts via Weight-space Diffusion", "abstract": "Data-driven dynamics prediction often fails under environmental shifts, while traditional fine-tuning remains computationally prohibitive for hardware-constrained or data-scarce applications. We propose DynaDiff, a generative meta-learning framework that transitions the paradigm from gradient-based tuning or modulation to direct weight-space generation. Specifically, we first abstract expert weights as novel weight graphs, utilizing multi-head attention to explicitly capture topological coupling within weights. Subsequently, we design a functional loss to ensure that the generated models achieve consistency with expert models in physical behavior. Finally, we develop a dynamics-informed prompter that extracts cross-domain physical and spectral features from observation sequences to condition the diffusion model. Experiments demonstrate that DynaDiff boosts average prediction accuracy by 10.78% over competitive baselines. Furthermore, by pre-constructing a model zoo of expert predictors, we amortize the fine-tuning overhead into a one-time offline cost, significantly boosting deployment efficiency in new environments.", "authors": [ "Ruikun Li", "Huandong Wang", "Jingtao Ding", "Yuan Yuan", "Qingmin Liao", "Yong Li" ], "year": 2026, "published_date": "2026-05-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2505.13919", "pdf_url": "https://arxiv.org/pdf/2505.13919", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Diffusion", "Transformers" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Diffusion) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.82, "read_first_score": 3.53, "content_potential_score": 1.0, "interestingness_score": 2.41, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Data-driven dynamics prediction often fails under environmental shifts, while traditional fine-tuning remains computationally prohibitive for hardware-constrained or data-scarce applications. We propose DynaDiff, a generative meta-learning framework that transitions the paradigm from gradient-based tuning or modulation to direct weight-space generation.", "key_contribution": "We propose DynaDiff, a generative meta-learning framework that transitions the paradigm from gradient-based tuning or modulation to direct weight-space generation.", "why_it_matters": "Generative Adaptation of Dynamics to Environmental Shifts via Weight-space Diffusion represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We propose DynaDiff, a generative meta-learning framework that transitions the paradigm from gradient-based tuning or…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2505.13919", "difficulty": "advanced" }, { "id": "arxiv:2609.03497", "source": "arxiv", "source_type": "preprint", "title": "BRIDGE: An Open-Source Humanoid Platform via Morphology-Control Co-Design for Physical AI", "abstract": "Developing humanoid robots capable of leveraging human behavioral data is essential for general-purpose embodiment, yet conventional development remains bottlenecked by a decoupled paradigm that isolates hardware design from whole-body control. This approach leads to suboptimal systems that compromise human-like fluidity and agility. To bridge this gap, we introduce a data-driven morphology-control co-design framework that optimizes humanoid morphology for human-like movement. To quantify morphological fidelity, we also introduce a novel metric that jointly considers kinematic retargeting fidelity to human motion and dynamic tracking performance. Our framework achieves state-of-the-art (SOTA) performance across all metrics compared to baseline humanoids (Bumi, K1, and Toddlerbot). Finally, we realize this design in Bridge, an open-source, 88cm-tall humanoid platform released alongside its control policy. We demonstrate that Bridge captures human motion data with superior fidelity, exhibiting exceptional performance across foundational locomotion, robust balance, and highly dynamic maneuvers. Videos and open-source materials: https://sites.google.com/view/bridgerobot.", "authors": [ "Jianren Wang", "Letian Qian", "Zikai Wang", "Weiwei Wu", "Junjie Zong", "Abhinav Gupta", "Deepak Pathak" ], "year": 2026, "published_date": "2026-09-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.03497", "pdf_url": "https://arxiv.org/pdf/2609.03497", "citations": 0, "topics": [], "tags": [ "Robotics", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.81, "read_first_score": 5.38, "content_potential_score": 1.55, "interestingness_score": 2.68, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Developing humanoid robots capable of leveraging human behavioral data is essential for general-purpose embodiment, yet conventional development remains bottlenecked by a decoupled paradigm that isolates hardware design from whole-body control. This approach leads to suboptimal systems that compromise human-like fluidity and agility.", "key_contribution": "To bridge this gap, we introduce a data-driven morphology-control co-design framework that optimizes humanoid morphology for human-like movement.", "why_it_matters": "BRIDGE: An Open-Source Humanoid Platform via Morphology-Control Co-Design for Physical AI represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "To bridge this gap, we introduce a data-driven morphology-control co-design framework that optimizes humanoid…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2609.03497", "difficulty": "intermediate" }, { "id": "arxiv:2608.13459", "source": "arxiv", "source_type": "preprint", "title": "CAPRI: Contract-Aware Proof Repair for Isabelle", "abstract": "We address the use of large language models (LLMs) to help discover Isabelle proofs. An Isabelle build establishes that the submitted theory is accepted, but not that an LLM changed only what the developer authorised. We present CAPRI, a contract-aware repair workflow in which Isabelle checks the proof and an independent checker enforces a machine-readable edit contract. Prompts, proposals, candidate repositories, diagnostics, verdicts, and hashes are retained for audit. We evaluate five workflows on twelve failed proofs from four developments, with three replicates per task and condition, giving 180 runs and 138 valid repairs. Of 144 terminal candidates accepted by Isabelle, six had modified protected text; all arose in iterative workflows that could edit a complete theory. A proof-body-only interface produced 29/36 valid repairs and no contract violations, compared with 31/36 for the corresponding full-theory workflow. One-shot repair produced 22/36, while a later prospectively frozen iterative workflow produced 32/36; these figures compare complete workflows rather than individual mechanisms. A separate post hoc OpenRouter campaign found no improvement in the designated Luna comparisons. A Sol configuration with matched demonstrations produced 33/36 repairs, compared with 29/36 in the frozen OpenAI Responses condition, but the difference was not statistically significant in a one-sided exact McNemar test ($p=0.0625$).", "authors": [ "Jim Woodcock", "Gabriel Leite", "Augusto Sampaio", "Ran Wei" ], "year": 2026, "published_date": "2026-08-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.13459", "pdf_url": "https://arxiv.org/pdf/2608.13459", "citations": 0, "topics": [], "tags": [ "LLMs", "Software Engineering", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.8, "read_first_score": 4.45, "content_potential_score": 0.0, "interestingness_score": 1.9, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We address the use of large language models (LLMs) to help discover Isabelle proofs. An Isabelle build establishes that the submitted theory is accepted, but not that an LLM changed only what the developer authorised.", "key_contribution": "We present CAPRI, a contract-aware repair workflow in which Isabelle checks the proof and an independent checker enforces a machine-readable edit contract.", "why_it_matters": "CAPRI: Contract-Aware Proof Repair for Isabelle represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present CAPRI, a contract-aware repair workflow in which Isabelle checks the proof and an independent checker…", "biggest_caveat": "but not that an LLM changed only what the developer authorised.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.13459", "difficulty": "frontier" }, { "id": "arxiv:2606.01794", "source": "arxiv", "source_type": "preprint", "title": "Tridirectional Discriminating-Power Formal Verification of Smart Contract Reentrancy Defense Against Production-Deployed Solidity Source", "abstract": "We present the first machine-checked correctness proof of the OpenZeppelin reentrancy-guard pattern against a Lean 4 state-machine model of production-deployed Solidity source. All thirteen theorems are machine-checked with zero sorry, zero user-introduced axioms, and an axiom footprint bounded by [propext] (a standard mathlib4 axiom), gated under continuous integration. Smart contract reentrancy has caused over US$500M in documented losses since 2016, with the DAO 2016 attack draining ~3.6M ETH and forcing the hard fork that split Ethereum. The OpenZeppelin ReentrancyGuard pattern is the de facto defense across production DeFi, yet no prior work has established its discriminating power: that the guard blocks attacks on vulnerable instances, preserves correct execution for non-attacking transactions, and distinguishes adjacent safe and vulnerable variants. Prior efforts formalized either guard correctness on toy contracts or attack feasibility on isolated instances - not both directions plus boundary cases against production source. We verify three production instantiations - DAO 2016, Compound v2, and Aave V3 flashLoan - plus a minimal-diff mutant of Aave V3's flashLoan (flashLoanVulnerable) isolating one security-critical difference, via mutation testing. The tridirectional structure pairs (a) attack reproduction of the DAO 2016 pattern, (b) a correctness proof for Compound v2, and (c) a boundary-case proof distinguishing Aave V3's CEI-correct flashLoan from the mutant. A capstone meta-theorem composes the three under a no-retrofit discipline, demonstrated at the first cross-protocol stress test (Compound v2 to Aave V3); broader-family portability is future work. Full Lean 4 source, CI config and reproduction commands are at https://github.com/rayiskander2406/qanary-contracts, reproducible at v1.6-phase7-closure (substrate: v1.3-layer6-closure).", "authors": [ "Ray Iskander" ], "year": 2026, "published_date": "2026-06-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.01794", "pdf_url": "https://arxiv.org/pdf/2606.01794", "citations": 0, "topics": [], "tags": [ "Cryptography & Security", "Programming Languages" ], "paper_type": "theory", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.8, "read_first_score": 6.33, "content_potential_score": 0.0, "interestingness_score": 1.9, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present the first machine-checked correctness proof of the OpenZeppelin reentrancy-guard pattern against a Lean 4 state-machine model of production-deployed Solidity source. All thirteen theorems are machine-checked with zero sorry, zero user-introduced axioms, and an axiom footprint bounded by [propext] (a standard mathlib4 axiom), gated under continuous integration.", "key_contribution": "We present the first machine-checked correctness proof of the OpenZeppelin reentrancy-guard pattern against a Lean 4 state-machine model of production-deployed Solidity source.", "why_it_matters": "Tridirectional Discriminating-Power Formal Verification of Smart Contract Reentrancy Defense Against Production-Deployed Solidity Source represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Cryptography & Security.", "one_line_takeaway": "We present the first machine-checked correctness proof of the OpenZeppelin reentrancy-guard pattern against a Lean 4…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Cryptography & Security.", "url": "https://arxiv.org/abs/2606.01794", "difficulty": "beginner" }, { "id": "arxiv:2604.20486v1", "source": "arxiv", "source_type": "preprint", "title": "ProMMSearchAgent: A Generalizable Multimodal Search Agent Trained with Process-Oriented Rewards", "abstract": "Training multimodal agents via reinforcement learning for knowledge-intensive visual reasoning is fundamentally hindered by the extreme sparsity of outcome-based supervision and the unpredictability of live web environments. To resolve these algorithmic and environmental bottlenecks, we introduce ProMMSearchAgent, establishing a novel Sim-to-Real training paradigm for multimodal search. We decouple policy learning into a deterministic, local static sandbox. Crucially, to learn effectively within this constrained environment, we propose an introspective process-oriented reward. By probing the agent's own parametric knowledge boundaries, we generate dense behavioral metadata that explicitly rewards the correct cognitive decision, initiating a multimodal or text search only when visually or factually uncertain. Extensive experiments demonstrate that our locally-trained policy transfers zero-shot to the live Google Search API. ProMMSearchAgent achieves new SOTA performance, outperforming MMSearch-R1 by +5.1% on FVQA-test, +6.3% on InfoSeek, and +11.3% on MMSearch.", "authors": [ "Wentao Yan", "Shengqin Wang", "Huichi Zhou", "Yihang Chen", "Kun Shao", "Yuan Xie", "Zhizhong Zhang" ], "year": 2026, "published_date": "2026-04-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.20486v1", "pdf_url": "https://arxiv.org/pdf/2604.20486v1", "citations": 0, "topics": [], "tags": [ "Reasoning", "VLMs", "RL", "Robotics", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.8, "read_first_score": 4.15, "content_potential_score": 0.0, "interestingness_score": 1.9, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Training multimodal agents via reinforcement learning for knowledge-intensive visual reasoning is fundamentally hindered by the extreme sparsity of outcome-based supervision and the unpredictability of live web environments. To resolve these algorithmic and environmental bottlenecks, we introduce ProMMSearchAgent, establishing a novel Sim-to-Real training paradigm for multimodal search.", "key_contribution": "To resolve these algorithmic and environmental bottlenecks, we introduce ProMMSearchAgent, establishing a novel Sim-to-Real training paradigm for multimodal search.", "why_it_matters": "ProMMSearchAgent: A Generalizable Multimodal Search Agent Trained with Process-Oriented Rewards advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "To resolve these algorithmic and environmental bottlenecks, we introduce ProMMSearchAgent, establishing a novel…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "http://arxiv.org/abs/2604.20486v1", "difficulty": "advanced" }, { "id": "arxiv:2604.24936v1", "source": "arxiv", "source_type": "preprint", "title": "A Unifying Framework for Unsupervised Concept Extraction", "abstract": "Techniques for concept extraction, such as sparse autoencoders and transcoders, aim to extract high-level symbolic concepts from low-level nonsymbolic representations. When these extracted concepts are used for downstream tasks such as model steering and unlearning, it is essential to understand their guarantees, or lack thereof. In this work, we present a unified theoretical framework for unsupervised concept extraction, in which we frame the task of concept extraction as identifying a generative model. We present a general meta-theorem for identifiability, which reduces the problem of establishing identifiability guarantees to the problem of characterizing the intersection of two sets. As we demonstrate on a range of widely-used approaches, this meta-theorem substantially simplifies the task of proving such guarantees, thus paving the way for the development of new, principled approaches for concept extraction.", "authors": [ "Chandler Squires", "Pradeep Ravikumar" ], "year": 2026, "published_date": "2026-04-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.24936v1", "pdf_url": "https://arxiv.org/pdf/2604.24936v1", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.8, "read_first_score": 5.08, "content_potential_score": 0.0, "interestingness_score": 1.9, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Techniques for concept extraction, such as sparse autoencoders and transcoders, aim to extract high-level symbolic concepts from low-level nonsymbolic representations. When these extracted concepts are used for downstream tasks such as model steering and unlearning, it is essential to understand their guarantees, or lack thereof.", "key_contribution": "In this work, we present a unified theoretical framework for unsupervised concept extraction, in which we frame the task of concept extraction as identifying a generative model.", "why_it_matters": "A Unifying Framework for Unsupervised Concept Extraction represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "In this work, we present a unified theoretical framework for unsupervised concept extraction, in which we frame the…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Machine Learning.", "url": "http://arxiv.org/abs/2604.24936v1", "difficulty": "frontier" }, { "id": "arxiv:2605.22082", "source": "arxiv", "source_type": "preprint", "title": "CoRMA: Contrastive RMA for Contact-Rich Meta-Adaptation", "abstract": "We present CoRMA(Contrastive Robotic Motor Adaptation), a context-based meta-adaptation framework that modifies RMA for force-dominant assembly. CoRMA replaces raw simulator-parameter adaptation with a compact 6D simulator-only semantic contact context describing contact onset, lateral engagement, guided transition, contact direction, and jamming. A deployable causal Transformer adapter infers this context online from force, proprioceptive, and action histories using semantic regression and a force-regime contrastive objective. At deployment, oracle context is removed and replaced by the inferred context, enabling within-episode adaptation without demonstrations, privileged inputs, or gradient updates. We evaluate CoRMA on PegInsert, GearMesh, and NutThread in Isaac Lab / Isaac Sim~5.0 and on a real Marvin arm. Compared with FORGE baselines that achieve high simulation success but degrade substantially on hardware, CoRMA retains higher verified real success under controlled target-pose noise. These results support semantic contact inference as a reusable adaptation interface within a related assembly task family, while broader unseen-task generalization and Real2Sim calibration remain future work.", "authors": [ "Wentian Wang", "Chutong Wen", "Hongxu Ma", "Wuhao Wang", "Zhexiong Xue", "Abdul Haseeb Nizamani", "Dandi Zhou", "Xinhai Sun", "Jianqiao Zhu" ], "year": 2026, "published_date": "2026-05-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.22082", "pdf_url": "https://arxiv.org/pdf/2605.22082", "citations": 0, "topics": [], "tags": [ "Transformers", "Robotics", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses contrastive — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.8, "read_first_score": 4.21, "content_potential_score": 1.0, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present CoRMA(Contrastive Robotic Motor Adaptation), a context-based meta-adaptation framework that modifies RMA for force-dominant assembly. CoRMA replaces raw simulator-parameter adaptation with a compact 6D simulator-only semantic contact context describing contact onset, lateral engagement, guided transition, contact direction, and jamming.", "key_contribution": "We present CoRMA(Contrastive Robotic Motor Adaptation), a context-based meta-adaptation framework that modifies RMA for force-dominant assembly.", "why_it_matters": "CoRMA: Contrastive RMA for Contact-Rich Meta-Adaptation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "We present CoRMA(Contrastive Robotic Motor Adaptation), a context-based meta-adaptation framework that modifies RMA for…", "biggest_caveat": "but degrade substantially on hardware, CoRMA retains higher verified real success under controlled target-pose noise.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2605.22082", "difficulty": "advanced" }, { "id": "arxiv:2605.17625", "source": "arxiv", "source_type": "preprint", "title": "Episodic-Semantic Memory Architecture for Long-Horizon Scientific Agents", "abstract": "As Large Language Models (LLMs) evolve into persistent scientific collaborators, context window saturation has emerged as a critical bottleneck. Scientific workflows involving iterative data analysis and hypothesis refinement rapidly saturate even extended contexts with dense technical content, while monolithic approaches suffer from quadratic cost scaling and cognitive degradation. We evaluate a Dual Process Memory Architecture that decouples immediate episodic needs (constant 10-message window) from long-term consolidated knowledge (growing at approximately 3 tokens/message). Unlike prior social agent memory systems, our domain-specific consolidation addresses contradictory parameter evolution, multi-hop reasoning across experimental phases, and precise technical fact retention. Through large-scale evaluation spanning 15,000 messages with cross-model validation across six LLMs from three families (OpenAI, Anthropic, Google), totaling 1,440 queries, we establish three key findings. First, while full-context models fail at 10,000 messages due to context overflow, our system maintains 70-85% accuracy with 1-2 second latency using 62% fewer tokens (45,434 vs 120,000+ limit). Second, cross-model validation reveals architecture-level trade-offs independent of specific LLMs: Dual Process excels at numeric/temporal queries (65-90% accuracy) while RAG excels at historical retrieval (60-85%), suggesting complementary deployment strategies. Third, we identify a \"Sim-to-Real\" gap where synthetic tests maintain constant memory but realistic workflows exhibit linear growth (about 3 tokens/message), with consolidation quality emerging as the primary scalability bottleneck. The architecture successfully manages profiles with 14,000+ scientific facts (125k tokens), demonstrating that domain-specific memory consolidation enables sustained operation beyond full-context limits.", "authors": [ "Nikola Milosevic" ], "year": 2026, "published_date": "2026-05-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.17625", "pdf_url": "https://arxiv.org/pdf/2605.17625", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Long Context", "RAG", "Robotics" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.8, "read_first_score": 4.01, "content_potential_score": 1.0, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "As Large Language Models (LLMs) evolve into persistent scientific collaborators, context window saturation has emerged as a critical bottleneck. Scientific workflows involving iterative data analysis and hypothesis refinement rapidly saturate even extended contexts with dense technical content, while monolithic approaches suffer from quadratic cost scaling and cognitive degradation.", "key_contribution": "As Large Language Models (LLMs) evolve into persistent scientific collaborators, context window saturation has emerged as a critical bottleneck.", "why_it_matters": "Episodic-Semantic Memory Architecture for Long-Horizon Scientific Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "As Large Language Models (LLMs) evolve into persistent scientific collaborators, context window saturation has emerged…", "biggest_caveat": "but realistic workflows exhibit linear growth (about 3 tokens/message), with consolidation quality emerging as the primary scalability bottleneck.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.17625", "difficulty": "intermediate" }, { "id": "arxiv:2604.01170v1", "source": "arxiv", "source_type": "preprint", "title": "Online Reasoning Calibration: Test-Time Training Enables Generalizable Conformal LLM Reasoning", "abstract": "While test-time scaling has enabled large language models to solve highly difficult tasks, state-of-the-art results come at exorbitant compute costs. These inefficiencies can be attributed to the miscalibration of post-trained language models, and the lack of calibration in popular sampling techniques. Here, we present Online Reasoning Calibration (ORCA), a framework for calibrating the sampling process that draws upon conformal prediction and test-time training. Specifically, we introduce a meta-learning procedure that updates the calibration module for each input. This allows us to provide valid confidence estimates under distributional shift, e.g. in thought patterns that occur across different stages of reasoning, or in prompt distributions between model development and deployment. ORCA not only provides theoretical guarantees on conformal risks, but also empirically shows higher efficiency and generalization across different reasoning tasks. At risk level $δ=0.1$, ORCA improves Qwen2.5-32B efficiency on in-distribution tasks with savings up to 47.5% with supervised labels and 40.7% with self-consistency labels. Under zero-shot out-of-domain settings, it improves MATH-500 savings from 24.8% of the static calibration baseline to 67.0% while maintaining a low empirical error rate, and the same trend holds across model families and downstream benchmarks. Our code is publicly available at https://github.com/wzekai99/ORCA.", "authors": [ "Cai Zhou", "Zekai Wang", "Menghua Wu", "Qianyu Julie Zhu", "Flora C. Shi", "Chenyu Wang", "Ashia Wilson", "Tommi Jaakkola", "Stephen Bates" ], "year": 2026, "published_date": "2026-04-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.01170v1", "pdf_url": "https://arxiv.org/pdf/2604.01170v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Prompting", "Evaluation", "Benchmarking & Evaluation" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.79, "read_first_score": 5.78, "content_potential_score": 1.55, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "While test-time scaling has enabled large language models to solve highly difficult tasks, state-of-the-art results come at exorbitant compute costs. These inefficiencies can be attributed to the miscalibration of post-trained language models, and the lack of calibration in popular sampling techniques.", "key_contribution": "Here, we present Online Reasoning Calibration (ORCA), a framework for calibrating the sampling process that draws upon conformal prediction and test-time training.", "why_it_matters": "Online Reasoning Calibration: Test-Time Training Enables Generalizable Conformal LLM Reasoning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Here, we present Online Reasoning Calibration (ORCA), a framework for calibrating the sampling process that draws upon…", "biggest_caveat": "buted to the miscalibration of post-trained language models, and the lack of calibration in popular sampling techniques.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.01170v1", "difficulty": "beginner" }, { "id": "arxiv:2605.20978", "source": "arxiv", "source_type": "preprint", "title": "Point Cloud Sequence Encoding for Material-conditioned Graph Network Simulators", "abstract": "Graph Network Simulators (GNSs) have emerged as powerful surrogates for complex physics-based simulation, offering inherent differentiability and orders-of-magnitude speedups over traditional solvers. However, GNSs typically assume access to the underlying material parameters, such as stiffness or viscosity, severely limiting their utility in realistic experimental settings. While recent meta-learning approaches address the parameter dependency by inferring properties from mesh trajectories, reconstructing a mesh from an observed scene is challenging. In this work, we introduce Point Cloud Encoding for Accurate Context Handling (PEACH), a novel framework that applies in-context learning on point clouds to adapt a learned simulator to unseen physical properties during inference. Our approach relies on a novel spatio-temporal point cloud sequence encoder, as well as two forms of auxiliary supervision to help improve simulation fidelity. We demonstrate that PEACH is capable of accurate zero-shot sim-to-real transfer on a challenging, dynamic scene. Experiments on simulation scenes show that PEACH even outperforms mesh-based baselines on prediction accuracy, while being much more practical for real-world deployment.", "authors": [ "Philipp Dahlinger", "Balázs Gyenes", "Niklas Freymuth", "Luca Geminiani", "Tobias Würth", "Johannes Mitsch", "Nadja Klein", "Luise Kärger", "Gerhard Neumann" ], "year": 2026, "published_date": "2026-05-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.20978", "pdf_url": "https://arxiv.org/pdf/2605.20978", "citations": 0, "topics": [], "tags": [ "Prompting", "Robotics", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.78, "read_first_score": 6.12, "content_potential_score": 1.84, "interestingness_score": 2.81, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Graph Network Simulators (GNSs) have emerged as powerful surrogates for complex physics-based simulation, offering inherent differentiability and orders-of-magnitude speedups over traditional solvers. However, GNSs typically assume access to the underlying material parameters, such as stiffness or viscosity, severely limiting their utility in realistic experimental settings.", "key_contribution": "In this work, we introduce Point Cloud Encoding for Accurate Context Handling (PEACH), a novel framework that applies in-context learning on point clouds to adapt a learned simulator to unseen physical properties during inference.", "why_it_matters": "Point Cloud Sequence Encoding for Material-conditioned Graph Network Simulators represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "In this work, we introduce Point Cloud Encoding for Accurate Context Handling (PEACH), a novel framework that applies…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2605.20978", "difficulty": "beginner" }, { "id": "arxiv:2605.23066", "source": "arxiv", "source_type": "preprint", "title": "Orbax: Distributed Checkpointing with JAX", "abstract": "In a landscape of high-performance distributed ML systems, JAX has emerged as a framework of choice. However, JAX's modular design philosophy leaves it without a standardized checkpointing solution. In this paper, we introduce Orbax, a modular, JAX-native checkpointing library that abstracts the complexities of distributed accelerator systems while also providing flexibility for user-friendly checkpoint manipulations throughout the ML model lifecycle. We demonstrate performance exceeding comparable PyTorch competitors by up to 3.5$\\times$ for saving and 2$\\times$ for loading. The library is available at https://github.com/google/orbax.", "authors": [ "Colin Gaffney", "Shutong Li", "Daniel Ng", "Anastasia Petrushkina", "Niket Kumar", "Adam Cogdell", "Mridul Sahu", "Yaning Liang", "Nikhil Bansal", "Justin Pan", "Angel Mau", "Abhishek Agrawal", "Marco Berlot", "Ruoxin Sang", "Kiranbir Sodhia", "Rakesh Iyer" ], "year": 2026, "published_date": "2026-05-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.23066", "pdf_url": "https://arxiv.org/pdf/2605.23066", "citations": 0, "topics": [], "tags": [ "Robotics", "Machine Learning", "Distributed Computing" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.77, "read_first_score": 4.43, "content_potential_score": 1.0, "interestingness_score": 2.38, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In a landscape of high-performance distributed ML systems, JAX has emerged as a framework of choice. However, JAX's modular design philosophy leaves it without a standardized checkpointing solution.", "key_contribution": "In this paper, we introduce Orbax, a modular, JAX-native checkpointing library that abstracts the complexities of distributed accelerator systems while also providing flexibility for user-friendly checkpoint manipulations throughout the ML model lifecycle.", "why_it_matters": "Orbax: Distributed Checkpointing with JAX represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "In this paper, we introduce Orbax, a modular, JAX-native checkpointing library that abstracts the complexities of…", "biggest_caveat": "buted ML systems, JAX has emerged as a framework of choice.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2605.23066", "difficulty": "intermediate" }, { "id": "arxiv:2511.19399", "source": "arxiv", "source_type": "preprint", "title": "DR Tulu: Reinforcement Learning with Evolving Rubrics for Deep Research", "abstract": "Deep research agents perform multi-step research to produce long-form, well-attributed answers. However, most open deep research agents are trained on easily verifiable short-form QA tasks via reinforcement learning with verifiable rewards, which does not extend to realistic long-form tasks. We address this with Reinforcement Learning with Evolving Rubrics (RLER), where rubrics are constructed and maintained to co-evolve with the policy model during training. This allows the rubrics to incorporate newly explored information from search and contrasting model responses, enabling better fact checking and more discriminative on-policy feedback. Using RLER, we develop Deep Research Tulu (DR Tulu-8B), the first fully open model that is directly trained for open-ended, long-form deep research. Across four long-form deep research benchmarks in science, healthcare, and general domains, DR Tulu substantially outperforms existing open deep research agents (by 15.6% over Tongyi DR on average) and matches or exceeds proprietary deep research agents (by 0.7% over OpenAI DR on average), while being significantly smaller and cheaper per query (1000x cheaper than OpenAI DR per query).", "authors": [ "Rulin Shao", "Akari Asai", "Shannon Zejiang Shen", "Hamish Ivison", "Varsha Kishore", "Jingming Zhuo", "Xinran Zhao", "Molly Park", "Samuel G. Finlayson", "David Sontag", "Tyler Murray", "Sewon Min", "Pradeep Dasigi", "Luca Soldaini", "Faeze Brahman", "Wen-tau Yih", "Tongshuang Wu", "Luke Zettlemoyer", "Yoon Kim", "Hannaneh Hajishirzi", "Pang Wei Koh" ], "year": 2026, "published_date": "2026-05-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.19399", "pdf_url": "https://arxiv.org/pdf/2511.19399", "citations": 0, "topics": [], "tags": [ "RL", "Evaluation", "Artificial Intelligence", "NLP", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.76, "read_first_score": 4.29, "content_potential_score": 0.0, "interestingness_score": 1.88, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deep research agents perform multi-step research to produce long-form, well-attributed answers. However, most open deep research agents are trained on easily verifiable short-form QA tasks via reinforcement learning with verifiable rewards, which does not extend to realistic long-form tasks.", "key_contribution": "Deep research agents perform multi-step research to produce long-form, well-attributed answers.", "why_it_matters": "DR Tulu: Reinforcement Learning with Evolving Rubrics for Deep Research represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "Deep research agents perform multi-step research to produce long-form, well-attributed answers.", "biggest_caveat": "buted answers.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2511.19399", "difficulty": "beginner" }, { "id": "arxiv:2603.23483", "source": "arxiv", "source_type": "preprint", "title": "SpecEyes: Accelerating Agentic Multimodal LLMs via Speculative Perception and Planning", "abstract": "Agentic multimodal large language models (MLLMs) (e.g., OpenAI o3 and Gemini Agentic Vision) achieve remarkable reasoning capabilities through iterative visual tool invocation. However, the cascaded perception, reasoning, and tool-calling loops introduce significant sequential overhead. This overhead, termed agentic depth, incurs prohibitive latency and seriously limits system-level concurrency. To this end, we propose SpecEyes, an agentic-level speculative acceleration framework that breaks this sequential bottleneck. Our key insight is that a lightweight, tool-free MLLM can serve as a speculative planner to predict the execution trajectory, enabling early termination of expensive tool chains without sacrificing accuracy. To regulate this speculative planning, we introduce a cognitive gating mechanism based on answer separability, which quantifies the model's confidence for self-verification without requiring oracle labels. Furthermore, we design a heterogeneous parallel funnel that exploits the stateless concurrency of the small model to mask the stateful serial execution of the large model, maximizing system throughput. Extensive experiments on V* Bench, HR-Bench, and POPE demonstrate that SpecEyes achieves 1.1-3.35x speedup over the agentic baseline while preserving or even improving accuracy (up to +6.7%), thereby boosting serving throughput under concurrent workloads.", "authors": [ "Haoyu Huang", "Jinfa Huang", "Zhongwei Wan", "Xiawu Zheng", "Rongrong Ji", "Jiebo Luo" ], "year": 2026, "published_date": "2026-07-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.23483", "pdf_url": "https://arxiv.org/pdf/2603.23483", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "Multimodal", "Info Extraction" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.75, "read_first_score": 5.11, "content_potential_score": 1.0, "interestingness_score": 2.38, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agentic multimodal large language models (MLLMs) (e.g., OpenAI o3 and Gemini Agentic Vision) achieve remarkable reasoning capabilities through iterative visual tool invocation. However, the cascaded perception, reasoning, and tool-calling loops introduce significant sequential overhead.", "key_contribution": "Agentic multimodal large language models (MLLMs) (e.g., OpenAI o3 and Gemini Agentic Vision) achieve remarkable reasoning capabilities through iterative visual tool invocation.", "why_it_matters": "SpecEyes: Accelerating Agentic Multimodal LLMs via Speculative Perception and Planning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Agentic multimodal large language models (MLLMs) (e.g., OpenAI o3 and Gemini Agentic Vision) achieve remarkable…", "biggest_caveat": "However, the cascaded perception, reasoning, and tool-calling loops introduce significant sequential overhead.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2603.23483", "difficulty": "intermediate" }, { "id": "arxiv:2604.27063", "source": "arxiv", "source_type": "preprint", "title": "Learning to Forget: Continual Learning with Adaptive Weight Decay", "abstract": "Continual learning agents with finite capacity must balance acquiring new knowledge with retaining the old. This requires controlled forgetting of knowledge that is no longer needed, freeing up capacity to learn. Weight decay, viewed as a mechanism for forgetting, can serve this role by gradually discarding information stored in the weights. However, a fixed scalar weight decay drives this forgetting uniformly over time and uniformly across all parameters, even when some encode stable knowledge while others track rapidly changing targets. We introduce Forgetting through Adaptive Decay (FADE), which adapts per-parameter weight decay rates online via approximate meta-gradient descent. We derive FADE for the online linear setting and apply it to the final layer of neural networks. Our empirical analysis shows that FADE automatically discovers distinct decay rates for different parameters, complements step-size adaptation, and consistently improves over fixed weight decay across online tracking and streaming classification problems.", "authors": [ "Aditya A. Ramesh", "Alex Lewandowski", "Jürgen Schmidhuber" ], "year": 2026, "published_date": "2026-04-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.27063", "pdf_url": "https://arxiv.org/pdf/2604.27063", "citations": 0, "topics": [], "tags": [ "Continual Learning", "Machine Learning", "Neural Networks" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Continual Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.75, "read_first_score": 3.63, "content_potential_score": 0.0, "interestingness_score": 1.88, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Continual learning agents with finite capacity must balance acquiring new knowledge with retaining the old. This requires controlled forgetting of knowledge that is no longer needed, freeing up capacity to learn.", "key_contribution": "We introduce Forgetting through Adaptive Decay (FADE), which adapts per-parameter weight decay rates online via approximate meta-gradient descent.", "why_it_matters": "Learning to Forget: Continual Learning with Adaptive Weight Decay represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Continual Learning.", "one_line_takeaway": "We introduce Forgetting through Adaptive Decay (FADE), which adapts per-parameter weight decay rates online via…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Continual Learning.", "url": "https://arxiv.org/abs/2604.27063", "difficulty": "advanced" }, { "id": "arxiv:2606.16720", "source": "arxiv", "source_type": "preprint", "title": "From Third-Party to First-Party: Measuring and Protecting Against Modern Web Tracking Mechanisms", "abstract": "Web user tracking has always been a cat-and-mouse game between privacy-conscious users and trackers. Recently, this conflict has driven a shift from third-party tracking toward first-party tracking (FPT) and server-side tracking (SST). By relocating tracking logic to the browser's first-party context or the website's backend, these mechanisms obscure data flows and render traditional client-side detection tools increasingly ineffective. Despite the growing adoption of these techniques, our understanding of their deployment at scale remains limited, and generalized protection mechanisms are lacking. In this work, we conduct a large-scale measurement of top sites to assess this shift and the prevalence of FPT and SST. We develop a provider-independent methodology to detect these mechanisms and find that over 54% of analyzed sites now deploy FPT or SST-related techniques. By clustering scripts based on their similarity and constructing a network graph, we demonstrate that the ecosystem is densely connected and dominated by major vendors like Google. Finally, we demonstrate that current filter lists are largely ineffective against first-party tracking, and we propose new rules to address this gap. We show that these rules block 63% more requests than traditional filter lists.", "authors": [ "Christian Böttger", "Tareq Khouja", "Norbert Pohlmann", "Nurullah Demir", "Tobias Urban" ], "year": 2026, "published_date": "2026-06-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.16720", "pdf_url": "https://arxiv.org/pdf/2606.16720", "citations": 0, "topics": [], "tags": [ "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.74, "read_first_score": 5.64, "content_potential_score": 1.0, "interestingness_score": 2.37, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Web user tracking has always been a cat-and-mouse game between privacy-conscious users and trackers. Recently, this conflict has driven a shift from third-party tracking toward first-party tracking (FPT) and server-side tracking (SST).", "key_contribution": "By clustering scripts based on their similarity and constructing a network graph, we demonstrate that the ecosystem is densely connected and dominated by major vendors like Google.", "why_it_matters": "From Third-Party to First-Party: Measuring and Protecting Against Modern Web Tracking Mechanisms represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Cryptography & Security.", "one_line_takeaway": "By clustering scripts based on their similarity and constructing a network graph, we demonstrate that the ecosystem is…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Cryptography & Security.", "url": "https://arxiv.org/abs/2606.16720", "difficulty": "intermediate" }, { "id": "arxiv:2604.11272v1", "source": "arxiv", "source_type": "preprint", "title": "AbLWR:A Context-Aware Listwise Ranking Framework for Antibody-Antigen Binding Affinity Prediction via Positive-Unlabeled Learning", "abstract": "Accurate prediction of antibody-antigen binding affinity is fundamental to therapeutic design, yet remains constrained by severe label sparsity and the complexity of antigenic variations. In this paper, we propose AbLWR (Antibody-antigen binding affinity List-Wise Ranking), a novel framework that reformulates the conventional affinity regression task as a listwise ranking problem. To mitigate label sparsity, AbLWR incorporates a PU (Positive-Unlabeled) learning mechanism leveraging a dual-level contrastive objective and meta-optimized label refinement to learn robust representations. Furthermore, we address antigenic variation by employing a homologous antigen sampling strategy where Multi-Head Self-Attention (MHSA) explicitly models inter-sample relationships within training lists to capture subtle affinity nuances. Extensive experiments demonstrate that AbLWR significantly outperforms state-of-the-art baselines, improving the Precision@1 (P@1) by over 10$\\%$ in randomized cross-validation experiments. Notably, case studies on Influenza and IL-33 validate its practical utility, demonstrating robust ranking consistency in distinguishing subtle viral mutations and efficiently prioritizing top-tier candidates for wet-lab screening.", "authors": [ "Fan Xu", "Zhi-an Huang", "Haohuai He", "Yidong Song", "Wei Liu", "Dongxu Zhang", "Yao Hu", "Kay Chen Tan" ], "year": 2026, "published_date": "2026-04-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.11272v1", "pdf_url": "https://arxiv.org/pdf/2604.11272v1", "citations": 0, "topics": [], "tags": [ "Transformers", "Transformer Architectures", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses contrastive — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.74, "read_first_score": 4.72, "content_potential_score": 0.45, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Accurate prediction of antibody-antigen binding affinity is fundamental to therapeutic design, yet remains constrained by severe label sparsity and the complexity of antigenic variations. In this paper, we propose AbLWR (Antibody-antigen binding affinity List-Wise Ranking), a novel framework that reformulates the conventional affinity regression task as a listwise ranking problem.", "key_contribution": "In this paper, we propose AbLWR (Antibody-antigen binding affinity List-Wise Ranking), a novel framework that reformulates the conventional affinity regression task as a listwise ranking problem.", "why_it_matters": "AbLWR:A Context-Aware Listwise Ranking Framework for Antibody-Antigen Binding Affinity Prediction via Positive-Unlabeled Learning extends Transformer capabilities — the architecture underpinning virtually every modern NLP and vision model.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "In this paper, we propose AbLWR (Antibody-antigen binding affinity List-Wise Ranking), a novel framework that…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Transformers.", "url": "http://arxiv.org/abs/2604.11272v1", "difficulty": "advanced" }, { "id": "arxiv:2602.01115", "source": "arxiv", "source_type": "preprint", "title": "KAN We Flow? Advancing Robotic Manipulation with 3D Flow Matching via KAN & RWKV", "abstract": "Diffusion-based visuomotor policies excel at modeling action distributions but are inference-inefficient, since recursively denoising from noise to policy requires many steps and heavy UNet backbones, which hinders deployment on resource-constrained robots. Flow matching alleviates the sampling burden by learning a one-step vector field, yet prior implementations still inherit large UNet-style architectures. In this work, we present KAN-We-Flow, a flow-matching policy that draws on recent advances in Receptance Weighted Key Value (RWKV) and Kolmogorov-Arnold Networks (KAN) from vision to build a lightweight and highly expressive backbone for 3D manipulation. Concretely, we introduce an RWKV-KAN block: an RWKV first performs efficient time/channel mixing to propagate task context, and a subsequent GroupKAN layer applies learnable spline-based, groupwise functional mappings to perform feature-wise nonlinear calibration of the action mapping on RWKV outputs. Moreover, we introduce an Action Consistency Regularization (ACR), a lightweight auxiliary loss that enforces alignment between predicted action trajectories and expert demonstrations via Euler extrapolation, providing additional supervision to stabilize training and improve policy precision. Without resorting to large UNets, our design reduces parameters by 86.8\\%, maintains fast runtime, and achieves state-of-the-art success rates on Adroit, Meta-World, and DexArt benchmarks. Our project page can be viewed in \\href{https://zhihaochen-2003.github.io/KAN-We-Flow.github.io/}{\\textcolor{red}{link}}", "authors": [ "Zhihao Chen", "Yiyuan Ge", "Ziyang Wang", "Youwei Zhang" ], "year": 2026, "published_date": "2026-08-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.01115", "pdf_url": "https://arxiv.org/pdf/2602.01115", "citations": 0, "topics": [], "tags": [ "AI Safety", "Robotics", "Evaluation", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.73, "read_first_score": 6.28, "content_potential_score": 1.0, "interestingness_score": 2.37, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Diffusion-based visuomotor policies excel at modeling action distributions but are inference-inefficient, since recursively denoising from noise to policy requires many steps and heavy UNet backbones, which hinders deployment on resource-constrained robots. Flow matching alleviates the sampling burden by learning a one-step vector field, yet prior implementations still inherit large UNet-style architectures.", "key_contribution": "In this work, we present KAN-We-Flow, a flow-matching policy that draws on recent advances in Receptance Weighted Key Value (RWKV) and Kolmogorov-Arnold Networks (KAN) from vision to build a lightweight and highly expressive backbone for 3D manipulation.", "why_it_matters": "KAN We Flow? Advancing Robotic Manipulation with 3D Flow Matching via KAN & RWKV advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "In this work, we present KAN-We-Flow, a flow-matching policy that draws on recent advances in Receptance Weighted Key…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2602.01115", "difficulty": "beginner" }, { "id": "arxiv:2606.00107", "source": "arxiv", "source_type": "preprint", "title": "Motif-based morphology signatures for interpretable ECG screening and monitoring", "abstract": "Electrocardiography (ECG) remains central to cardiovascular screening, yet interpretation remains largely manual and episodic. Clinical practice relies on brief resting ECGs and, when required, long-duration ambulatory recordings, both generating data that require resource-intensive review. Consequently, subtle morphological changes or progressive drift preceding clinically apparent abnormalities may go unnoticed. We propose a motif-based framework that defines beat-aligned ECG motifs as interpretable cardiac signatures and quantifies morphological drift and deviation across short and long-term monitoring. Motifs are representative cardiac cycles capturing dominant morphology. We introduce three interpretable drift metrics: deviation from a normal sinus rhythm (NSR), deviation from a personalised baseline, and a motif instability index. Motifs are extracted by selecting beats that minimise Dynamic Time Warping (DTW) distance within fixed windows. We evaluate these metrics on short (PTB-XL) and long-duration (MIT-BIH Arrhythmia) ECG datasets. Interpretability is achieved through representative motif overlays and fiducial-based visualisations, enabling direct inspection of morphological changes. In MIT-BIH, the proposed metrics significantly separated predominantly normal from arrhythmic subjects (p<0.01). In PTB-XL, NSR deviation distinguished normal from abnormal ECGs across major diagnostic subtypes (p<1e-4, Cliff's delta up to 0.93). ECG motifs provide an interpretable representation of cardiac morphology, supporting scalable longitudinal monitoring and early detection of morphology-driven change.", "authors": [ "Nivedita Bijlani", "Mauricio Villarroel" ], "year": 2026, "published_date": "2026-05-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.00107", "pdf_url": "https://arxiv.org/pdf/2606.00107", "citations": 0, "topics": [], "tags": [ "Biomedical AI", "Interpretability", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.73, "read_first_score": 5.2, "content_potential_score": 2.4, "interestingness_score": 3.06, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Electrocardiography (ECG) remains central to cardiovascular screening, yet interpretation remains largely manual and episodic. Clinical practice relies on brief resting ECGs and, when required, long-duration ambulatory recordings, both generating data that require resource-intensive review.", "key_contribution": "We propose a motif-based framework that defines beat-aligned ECG motifs as interpretable cardiac signatures and quantifies morphological drift and deviation across short and long-term monitoring.", "why_it_matters": "Motif-based morphology signatures for interpretable ECG screening and monitoring represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Biomedical AI.", "one_line_takeaway": "We propose a motif-based framework that defines beat-aligned ECG motifs as interpretable cardiac signatures and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Biomedical AI.", "url": "https://arxiv.org/abs/2606.00107", "difficulty": "intermediate" }, { "id": "arxiv:2606.02863", "source": "arxiv", "source_type": "preprint", "title": "Don't Gamble, GAMBLe: An Analytical Framework for AI-Driven Research Systems", "abstract": "AI-Driven Research Systems (ADRS) -- systems coupling LLMs with automated evaluation to discover algorithms, proofs, and designs -- are being optimized and adopted across domains, but the tools to analyze them have not kept pace. ADRS performance depends on component interactions that are poorly understood, expensive to explore, and (as we show) not well captured by standard convergence guarantees. These guarantees rely on structural assumptions that do not hold under the ADRS process we formalize. We introduce GAMBLe, a framework that decomposes ADRS behavior into four parameters (generator $G$, assessor $\\mathcal{A}$, discovery mechanism $\\mathcal{M}$, budget $B$) and one compositional object, the effective landscape $L_{\\text{eff}} = \\mathcal{A} \\circ G$, which reveals that distinct generator-assessor pairs induce structurally different per-problem optimization landscapes. We exercise the framework on 760+ replicated runs (>46,000 iterations) spanning generators from single LLMs to dynamically-adaptive ensembles, mechanisms from greedy selection to co-evolutionary meta-search, and three NP-hard problems whose assessors range from continuous scoring to cliff functions. The experiments reveal no total ordering of generators or mechanisms: frontier models can underperform open-source alternatives and the simplest mechanism sometimes outperforms state-of-the-art meta-search. Results show that even under limited budgets (60 iterations per run), the right component choices can improve performance by 13-67% and search efficiency by 6-39x.", "authors": [ "Marquita Ellis", "Paul Castro" ], "year": 2026, "published_date": "2026-06-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.02863", "pdf_url": "https://arxiv.org/pdf/2606.02863", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.72, "read_first_score": 6.24, "content_potential_score": 0.05, "interestingness_score": 1.89, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "AI-Driven Research Systems (ADRS) -- systems coupling LLMs with automated evaluation to discover algorithms, proofs, and designs -- are being optimized and adopted across domains, but the tools to analyze them have not kept pace. ADRS performance depends on component interactions that are poorly understood, expensive to explore, and (as we show) not well captured by standard convergence guarantees.", "key_contribution": "ADRS performance depends on component interactions that are poorly understood, expensive to explore, and (as we show) not well captured by standard convergence guarantees.", "why_it_matters": "Don't Gamble, GAMBLe: An Analytical Framework for AI-Driven Research Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "ADRS performance depends on component interactions that are poorly understood, expensive to explore, and (as we show)…", "biggest_caveat": "but the tools to analyze them have not kept pace.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2606.02863", "difficulty": "intermediate" }, { "id": "arxiv:2605.21273", "source": "arxiv", "source_type": "preprint", "title": "DriveMA: Rethinking Language Interfaces in Driving VLAs with One-Step Meta-Actions", "abstract": "Driving Vision-Language-Action Models (Driving VLAs) commonly introduce natural-language reasoning as an intermediate interface for end-to-end planning, but reasoning-centric interfaces face three practical bottlenecks: obtaining high-quality reasoning annotations is difficult, generating and understanding long reasoning chains is challenging for compact models, and inference latency is substantially increased. In this paper, we rethink the design of language interfaces in Driving VLAs and show that concise one-step meta-actions are a simple yet effective alternative to verbose reasoning. Meta-actions provide semantic decision grounding while remaining low-entropy, and being automatically derivable from expert trajectories, enabling scalable supervision and reliable trajectory conditioning. Building on this interface, we propose DriveMA, which combines action-centric supervised training with a turn-level credit-assignment reinforcement learning framework that jointly optimizes meta-action correctness, trajectory quality, and trajectory--meta-action consistency. Experiments show that DriveMA already achieves a new state of the art on the Waymo End-to-End Driving Challenge with a 2B model, reaching a Rater Feedback Score (RFS) of 8.060, while its 4B version further improves the state of the art to 8.079; DriveMA also obtains competitive performance on NAVSIM. Ablations demonstrate that one-step meta-actions offer a better practical trade-off between expressiveness, predictability, and inference efficiency than natural-language reasoning or finer-grained action sequences. Code, data, and models will be released to facilitate future research.", "authors": [ "Weicheng Zheng", "Yixin Huang", "Qiao Sun", "Derun Li", "Hang zhao" ], "year": 2026, "published_date": "2026-05-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.21273", "pdf_url": "https://arxiv.org/pdf/2605.21273", "citations": 0, "topics": [], "tags": [ "Reasoning", "Hallucination", "Info Extraction", "RL", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.72, "read_first_score": 4.64, "content_potential_score": 1.84, "interestingness_score": 2.78, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Driving Vision-Language-Action Models (Driving VLAs) commonly introduce natural-language reasoning as an intermediate interface for end-to-end planning, but reasoning-centric interfaces face three practical bottlenecks: obtaining high-quality reasoning annotations is difficult, generating and understanding long reasoning chains is challenging for compact models, and inference latency is substantially increased. In this paper, we rethink the design of language interfaces in Driving VLAs and show that concise one-step meta-actions are a simple yet effective alternative to verbose reasoning.", "key_contribution": "Driving Vision-Language-Action Models (Driving VLAs) commonly introduce natural-language reasoning as an intermediate interface for end-to-end planning, but reasoning-centric interfaces face three practical bottlenecks: obtaining high-quality reasoning annotations is difficult, generating and understanding long reasoning chains is challenging for compact models, and inference latency is substantially increased.", "why_it_matters": "DriveMA: Rethinking Language Interfaces in Driving VLAs with One-Step Meta-Actions advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Driving Vision-Language-Action Models (Driving VLAs) commonly introduce natural-language reasoning as an intermediate…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.21273", "difficulty": "advanced" }, { "id": "arxiv:2605.23411", "source": "arxiv", "source_type": "preprint", "title": "Sample-wise Targeted Adversarial Attacks on Test-time Adaptation", "abstract": "Test-time adaptation (TTA) effectively counters distribution shifts but exposes models to adversarial manipulation via the unlabeled test stream. Existing class-wise targeted attacks remain impractical for stealthy exploitation in this setting: since TTA operates on batches, forcing a subset of samples toward a target label unintentionally pulls similar benign samples along, resulting in a conspicuously high frequency of the target label that is easy to detect. To capture a more realistic threat, we introduce a sample-wise targeted attack. Unlike prior approaches, the attacker aims to misclassify only inputs carrying an attacker-chosen trigger, while preserving the global label distribution of benign queries to evade detection. To achieve this, we propose a meta-learning-based attack with a novel priority-aware gradient alignment strategy that explicitly prioritizes attack success. The strategy formulates the gradient update as an ellipsoidal trust-region problem, mitigating the misalignment between attack success and distributional stealth, while providing theoretical guarantees for effective optimization of the attack objective in the presence of gradient misalignment. Extensive experiments on CIFAR-10-C, CIFAR-100-C, and ImageNet-C across TTA protocols demonstrate that our method achieves high targeted success rates while maintaining a label distribution that is consistent with the no-attack baseline, making it difficult to detect in unlabeled TTA deployment scenarios. Furthermore, we demonstrate that our attack shows strong robustness against existing defenses.", "authors": [ "Phuc Duc Nguyen", "Quang Duc Nguyen" ], "year": 2026, "published_date": "2026-05-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.23411", "pdf_url": "https://arxiv.org/pdf/2605.23411", "citations": 0, "topics": [], "tags": [ "AI Safety", "Robotics", "Adversarial", "Machine Learning", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.72, "read_first_score": 5.66, "content_potential_score": 1.0, "interestingness_score": 2.36, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Test-time adaptation (TTA) effectively counters distribution shifts but exposes models to adversarial manipulation via the unlabeled test stream. Existing class-wise targeted attacks remain impractical for stealthy exploitation in this setting: since TTA operates on batches, forcing a subset of samples toward a target label unintentionally pulls similar benign samples along, resulting in a conspicuously high frequency of the target label that is easy to detect.", "key_contribution": "To capture a more realistic threat, we introduce a sample-wise targeted attack.", "why_it_matters": "Sample-wise Targeted Adversarial Attacks on Test-time Adaptation advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "To capture a more realistic threat, we introduce a sample-wise targeted attack.", "biggest_caveat": "bution shifts but exposes models to adversarial manipulation via the unlabeled test stream.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2605.23411", "difficulty": "advanced" }, { "id": "arxiv:2606.15634", "source": "arxiv", "source_type": "preprint", "title": "Sparse Channel Estimation for SIM-based mmWave Near-Field Communications", "abstract": "In this paper, we address the channel estimation (CE) problem in SIM-based multi-user (MU) millimeter-wave (mmWave) near-field communication systems. To address the severe path loss and blockage in mmWave communication systems, many meta-atoms are typically integrated into each layer of the SIM. Then, the number of radio frequency (RF) chains at the base station (BS) is fewer than that of meta-atoms per layer, resulting in an underdetermined problem. Additionally, the increase in the number of meta-atoms in each layer expands the SIM's near-field region, leading to the user equipment (UEs) being mostly situated in this region, necessitating precise modeling of the channel under the spherical wavefront assumption. To address these issues, we introduce a compressed sensing (CS)-based CE protocol to tackle the underdetermined problem. In contrast to the traditional CS-based estimation framework, we investigate a polar-domain channel representation to tackle the severe energy spread effect of the classical angular-domain channel representation in near-field communication systems. Specifically, we design a novel polar-domain transform matrix for uniform planar arrays (UPAs), thereby transforming the CE problem into a sparse recovery task of the paths' support set and complex gains. To overcome the limitations of the sparse Bayesian learning (SBL) framework in tackling high-dimensional dictionaries, we propose a low-complexity polar-domain SBL (LCPD-SBL) algorithm, which significantly reduces computational complexity without compromising estimation accuracy.", "authors": [ "Jiancheng An", "Enyu Shi", "Jiayi Zhang", "Lu Gan", "Michail Matthaiou", "Symeon Chatzinotas", "Marco Di Renzo" ], "year": 2026, "published_date": "2026-06-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.15634", "pdf_url": "https://arxiv.org/pdf/2606.15634", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.71, "read_first_score": 4.56, "content_potential_score": 1.0, "interestingness_score": 2.35, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In this paper, we address the channel estimation (CE) problem in SIM-based multi-user (MU) millimeter-wave (mmWave) near-field communication systems. To address the severe path loss and blockage in mmWave communication systems, many meta-atoms are typically integrated into each layer of the SIM.", "key_contribution": "To address these issues, we introduce a compressed sensing (CS)-based CE protocol to tackle the underdetermined problem.", "why_it_matters": "Sparse Channel Estimation for SIM-based mmWave Near-Field Communications represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "To address these issues, we introduce a compressed sensing (CS)-based CE protocol to tackle the underdetermined problem.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2606.15634", "difficulty": "frontier" }, { "id": "arxiv:2506.01544", "source": "arxiv", "source_type": "preprint", "title": "Temporal Variational Implicit Neural Representations", "abstract": "We introduce Temporal Variational Implicit Neural Representations (TV-INRs), a probabilistic framework for modeling irregular multivariate time series that enables efficient and accurate individualized imputation and forecasting. By integrating implicit neural representations with latent variable models, TV-INRs learn distributions over time-continuous generator functions conditioned on signal-specific covariates. Unlike existing INR approaches that require extensive training, fine-tuning or meta-learning, our method achieves accurate individualized predictions through a single forward pass. Our experiments demonstrate that with a single TV-INRs instance, we can accurately solve diverse imputation and forecasting tasks, offering a computationally efficient and scalable solution for real-world applications. TV-INRs performs particularly well in low-data regimes, where on several datasets it achieves substantially lower imputation error, including order-of-magnitude improvements.", "authors": [ "Batuhan Koyuncu", "Rachael DeVries", "Ole Winther", "Isabel Valera" ], "year": 2026, "published_date": "2026-07-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2506.01544", "pdf_url": "https://arxiv.org/pdf/2506.01544", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.7, "read_first_score": 4.5, "content_potential_score": 1.0, "interestingness_score": 2.35, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce Temporal Variational Implicit Neural Representations (TV-INRs), a probabilistic framework for modeling irregular multivariate time series that enables efficient and accurate individualized imputation and forecasting. By integrating implicit neural representations with latent variable models, TV-INRs learn distributions over time-continuous generator functions conditioned on signal-specific covariates.", "key_contribution": "We introduce Temporal Variational Implicit Neural Representations (TV-INRs), a probabilistic framework for modeling irregular multivariate time series that enables efficient and accurate individualized imputation and forecasting.", "why_it_matters": "Temporal Variational Implicit Neural Representations represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We introduce Temporal Variational Implicit Neural Representations (TV-INRs), a probabilistic framework for modeling…", "biggest_caveat": "butions over time-continuous generator functions conditioned on signal-specific covariates.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2506.01544", "difficulty": "intermediate" }, { "id": "arxiv:2607.21416", "source": "arxiv", "source_type": "preprint", "title": "GLAM-SLAM: Real-time Gaussian Large-scale Mapping via Flow Densification and Spatial Decomposition", "abstract": "Existing Gaussian-splatting-based monocular Simultaneous Localization and Mapping (SLAM) systems are either tailored to short sequences, are not real-time, or suffer from prohibitive GPU memory requirements, limiting their applicability in realistic, long-horizon scenarios. To address this, we present GLAM-SLAM, a real-time, decoupled Gaussian-splatting SLAM system designed for large-scale outdoor scenes. We ensure lightweight tracking using a robust, feature-based SLAM frontend, while for mapping, we adopt a structured, sparse anchor grid representation that ensures scalable operation and maintains scene coherence across long-term sequences. To satisfy the dense initialization requirements of 3D Gaussian Splatting (3DGS), we introduce a geometry-based flow-densification anchoring strategy using epipolar constraints. Furthermore, by treating mapping as a multi-scene problem, we propose a scene-partitioning strategy that introduces a strong spatial inductive bias via MLP initializations to generate localized Gaussians. We evaluate our system on the challenging, long-sequence KITTI Odometry, Oxford RobotCar, and M'alaga datasets. Extensive ablations and comparisons demonstrate a 15% improvement in reconstruction quality over the second-best performer, while maintaining real-time performance and the ability to scale to longer sequences. Code is publicly available for the benefit of the community.", "authors": [ "Panagiotis Mermigkas", "Argyris Manetas", "Petros Maragos" ], "year": 2026, "published_date": "2026-07-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.21416", "pdf_url": "https://arxiv.org/pdf/2607.21416", "citations": 0, "topics": [], "tags": [ "3D Vision", "Robotics", "Fairness & Ethics", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.69, "read_first_score": 5.48, "content_potential_score": 1.0, "interestingness_score": 2.34, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Existing Gaussian-splatting-based monocular Simultaneous Localization and Mapping (SLAM) systems are either tailored to short sequences, are not real-time, or suffer from prohibitive GPU memory requirements, limiting their applicability in realistic, long-horizon scenarios. To address this, we present GLAM-SLAM, a real-time, decoupled Gaussian-splatting SLAM system designed for large-scale outdoor scenes.", "key_contribution": "To address this, we present GLAM-SLAM, a real-time, decoupled Gaussian-splatting SLAM system designed for large-scale outdoor scenes.", "why_it_matters": "GLAM-SLAM: Real-time Gaussian Large-scale Mapping via Flow Densification and Spatial Decomposition advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about 3D Vision.", "one_line_takeaway": "To address this, we present GLAM-SLAM, a real-time, decoupled Gaussian-splatting SLAM system designed for large-scale…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in 3D Vision.", "url": "https://arxiv.org/abs/2607.21416", "difficulty": "intermediate" }, { "id": "arxiv:2604.18583v1", "source": "arxiv", "source_type": "preprint", "title": "MUA: Mobile Ultra-detailed Animatable Avatars", "abstract": "Building photorealistic, animatable full-body digital humans remains a longstanding challenge in computer graphics and vision. Recent advances in animatable avatar modeling have largely progressed along two directions: improving the fidelity of dynamic geometry and appearance, or reducing computational complexity to enable deployment on resource-constrained platforms, e.g., VR headsets. However, existing approaches fail to achieve both goals simultaneously: Ultra-high-fidelity avatars typically require substantial computation on server-class GPUs, whereas lightweight avatars often suffer from limited surface dynamics, reduced appearance details, and noticeable artifacts. To bridge this gap, we propose a novel animatable avatar representation, termed Wavelet-guided Multi-level Spatial Factorized Blendshapes, and a corresponding distillation pipeline that transfers motion-aware clothing dynamics and fine-grained appearance details from a pre-trained ultra-high-quality avatar model into a compact, efficient representation. By coupling multi-level wavelet spectral decomposition with low-rank structural factorization in texture space, our method achieves up to 2000X lower computational cost and a 10X smaller model size than the original high-quality teacher avatar model, while preserving visually plausible dynamics and appearance details closely resemble those of the teacher model. Extensive comparisons with state-of-the-art methods show that our approach significantly outperforms existing avatar approaches designed for mobile settings and achieves comparable or superior rendering quality to most approaches that can only run on servers. Importantly, our representation substantially improves the practicality of high-fidelity avatars for immersive applications, achieving over 180 FPS on a desktop PC and real-time native on-device performance at 24 FPS on a standalone Meta Quest 3.", "authors": [ "Heming Zhu", "Guoxing Sun", "Marc Habermann" ], "year": 2026, "published_date": "2026-04-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.18583v1", "pdf_url": "https://arxiv.org/pdf/2604.18583v1", "citations": 0, "topics": [], "tags": [ "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.69, "read_first_score": 5.78, "content_potential_score": 1.84, "interestingness_score": 2.77, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Building photorealistic, animatable full-body digital humans remains a longstanding challenge in computer graphics and vision. Recent advances in animatable avatar modeling have largely progressed along two directions: improving the fidelity of dynamic geometry and appearance, or reducing computational complexity to enable deployment on resource-constrained platforms, e.g., VR headsets.", "key_contribution": "However, existing approaches fail to achieve both goals simultaneously: Ultra-high-fidelity avatars typically require substantial computation on server-class GPUs, whereas lightweight avatars often suffer from limited surface dynamics, reduced appearance details, and noticeable artifacts.", "why_it_matters": "MUA: Mobile Ultra-detailed Animatable Avatars advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Computer Vision.", "one_line_takeaway": "However, existing approaches fail to achieve both goals simultaneously: Ultra-high-fidelity avatars typically require…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Computer Vision.", "url": "http://arxiv.org/abs/2604.18583v1", "difficulty": "intermediate" }, { "id": "arxiv:2605.17036", "source": "arxiv", "source_type": "preprint", "title": "Reliability and Effectiveness of Autonomous AI Agents in Supply Chain Management", "abstract": "This paper studies autonomous generative AI agents in multi-echelon supply chains using the MIT Beer Game. We identify four inference-time levers that shape performance: model selection, policies and guardrails, centralized data sharing, and prompt engineering. Model capability is the dominant factor: an out-of-the-box reasoning model exceeds human-level performance, and optimized reasoning models reduce costs by up to 67% relative to human teams. However, strong average performance masks substantial reliability risks. We introduce the agent bullwhip effect, the amplification of decision unreliability across echelons, manifesting along two dimensions: decision variance increases both across facilities at the same point in time and within the same facility across time. We develop a mathematical framework showing that this phenomenon is inherent to multi-agent systems that involve coordination and information delays, and we demonstrate that repeated sampling fails to meaningfully reduce it. To address this limitation, we propose a Group Relative Policy Optimization (GRPO)-based reinforcement-learning post-training framework that trains a shared base LLM using system-level supply-chain rewards. GRPO post-training substantially reduces tail events, curtails agent bullwhip, and improves the reliability of autonomous supply-chain agents.", "authors": [ "Carol Xuan Long", "David Simchi-Levi", "Feng Zhu", "Huangyuan Su", "Andre P. Calmon", "Flavio P. Calmon" ], "year": 2026, "published_date": "2026-05-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.17036", "pdf_url": "https://arxiv.org/pdf/2605.17036", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Prompting", "RLHF", "AI Agents" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.68, "read_first_score": 6.07, "content_potential_score": 0.42, "interestingness_score": 2.05, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper studies autonomous generative AI agents in multi-echelon supply chains using the MIT Beer Game. We identify four inference-time levers that shape performance: model selection, policies and guardrails, centralized data sharing, and prompt engineering.", "key_contribution": "We introduce the agent bullwhip effect, the amplification of decision unreliability across echelons, manifesting along two dimensions: decision variance increases both across facilities at the same point in time and within the same facility across time.", "why_it_matters": "Reliability and Effectiveness of Autonomous AI Agents in Supply Chain Management represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce the agent bullwhip effect, the amplification of decision unreliability across echelons, manifesting along…", "biggest_caveat": "However, strong average performance masks substantial reliability risks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.17036", "difficulty": "beginner" }, { "id": "arxiv:2607.02552", "source": "arxiv", "source_type": "preprint", "title": "Enabling Fast, Efficient, and Low-Cost Genomic and Metagenomic Analyses via Storage-Centric System Designs", "abstract": "Due to the challenges of analyzing and storing massive volumes of genomic and metagenomic sequence data, significant efforts have been made to accelerate (meta)genomic analyses and store sequence data compressed. Despite the benefits of these techniques, we identify two major outstanding problems in accessing stored sequence data and supplying it to the analysis units: (i) the data movement bottleneck due to moving large amounts of low-reuse data from storage and the unnecessary burden on the rest of the system, and (ii) the data preparation bottleneck, where compressed sequence data needs to be first decompressed and formatted before analysis. We present customized storage-centric systems, which efficiently (i) analyze (meta)genomic data inside storage, and (ii) enable highly-compressed storage and high-performance access of large-scale sequence data, thereby alleviating the overheads of data movement, computation, and data preparation. First, we introduce GenStore, an in-storage processing system that filters genomic data not requiring expensive computation directly inside storage. Second, we propose MegIS, an in-storage processing system that significantly reduces the data movement overhead of metagenomic analysis. Third, we introduce GRAINS, a storage-centric system for analysis on large-scale (meta)genomic graphs in storage. Fourth, we propose SAGe, an algorithm-architecture co-design for highly-compressed storage and high-performance access of sequence data. We demonstrate that the proposed systems significantly (e.g., by one to two orders of magnitude) improve performance, energy efficiency, and cost-efficiency, all at the same time. We hope these systems facilitate broader adoption of (meta)genomics and inspire research on other data-intensive domains in health and life sciences.", "authors": [ "Nika Mansouri Ghiasi", "Onur Mutlu" ], "year": 2026, "published_date": "2026-06-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.02552", "pdf_url": "https://arxiv.org/pdf/2607.02552", "citations": 0, "topics": [], "tags": [ "Biomedical AI", "Distributed Computing" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.68, "read_first_score": 5.9, "content_potential_score": 1.0, "interestingness_score": 2.34, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Due to the challenges of analyzing and storing massive volumes of genomic and metagenomic sequence data, significant efforts have been made to accelerate (meta)genomic analyses and store sequence data compressed. Despite the benefits of these techniques, we identify two major outstanding problems in accessing stored sequence data and supplying it to the analysis units: (i) the data movement bottleneck due to moving large amounts of low-reuse data from storage and the unnecessary burden on the rest of the system, and (ii) the data preparation bottleneck, where compressed sequence data needs to be first decompressed and formatted before analysis.", "key_contribution": "We present customized storage-centric systems, which efficiently (i) analyze (meta)genomic data inside storage, and (ii) enable highly-compressed storage and high-performance access of large-scale sequence data, thereby alleviating the overheads of data movement, computation, and data preparation.", "why_it_matters": "Enabling Fast, Efficient, and Low-Cost Genomic and Metagenomic Analyses via Storage-Centric System Designs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Biomedical AI.", "one_line_takeaway": "We present customized storage-centric systems, which efficiently (i) analyze (meta)genomic data inside storage, and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Biomedical AI.", "url": "https://arxiv.org/abs/2607.02552", "difficulty": "intermediate" }, { "id": "arxiv:2609.08362", "source": "arxiv", "source_type": "preprint", "title": "Kirigami Meta-Sheet for Enhanced Impact Absorption", "abstract": "Impact absorbers based on mechanical metamaterials often use bulky, vertically stacked architectures, limiting large area deployment and scalable manufacturing. Here, we propose a kirigami meta-sheet as a planar absorber that uses transitions between positive and negative stiffness regimes rather than sacrificial crushing. Guided by an analysis of a simple mass-spring-damper model, we program the stiffness of kirigami meta-sheets through the hinge ratio connecting the unit cells. Quasistatic indentation experiments confirm that the meta-sheet with a low hinge ratio most clearly exhibits the negative stiffness transition. The drop-tower tests show that it reduces rebound, decreases the first impact force, and increases dissipation. Unlike polyethylene mesh and styrofoam, this kirigami meta-sheet is shown to be effective in protecting a falling egg. Its planar geometry enables area scaling by tiling and is compatible with sheet level manufacturing routes such as cutting, molding, and lamination, establishing kirigami meta-sheets as practical impact absorbers.", "authors": [ "Dahyun Joo", "Yasuhiro Miyazawa", "Seokhyeon Hong", "Dongha Lee", "Jinkyu Yang", "Do-Nyun Kim" ], "year": 2026, "published_date": "2026-09-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.08362", "pdf_url": "https://arxiv.org/pdf/2609.08362", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.66, "read_first_score": 4.25, "content_potential_score": 1.0, "interestingness_score": 2.33, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Impact absorbers based on mechanical metamaterials often use bulky, vertically stacked architectures, limiting large area deployment and scalable manufacturing. Here, we propose a kirigami meta-sheet as a planar absorber that uses transitions between positive and negative stiffness regimes rather than sacrificial crushing.", "key_contribution": "Here, we propose a kirigami meta-sheet as a planar absorber that uses transitions between positive and negative stiffness regimes rather than sacrificial crushing.", "why_it_matters": "Kirigami Meta-Sheet for Enhanced Impact Absorption represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "Here, we propose a kirigami meta-sheet as a planar absorber that uses transitions between positive and negative…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2609.08362", "difficulty": "intermediate" }, { "id": "arxiv:2605.10260", "source": "arxiv", "source_type": "preprint", "title": "Meta-Black-Box Optimization Can Do Search Guidance for Expensive Constrained Multi-Objective Optimization", "abstract": "Existing Meta-Black-Box Optimization (MetaBBO) methods focus on how to search when controlling optimizers, but largely overlook where to search. We propose MetaSG-SAEA, a bi-level MetaBBO framework for expensive constrained multi-objective optimization problems (ECMOPs), in which a meta-policy provides search guidance to the low-level Surrogate-Assisted Evolutionary Algorithm (SAEA). To achieve this, we introduce Max-Min Constraint-Calibrated Inequality (MM-CCI), a compact, problem-agnostic region abstraction that maps heterogeneous constraint evaluations to an ordered scalar level; we further provide a theoretical analysis of its fundamental properties. Building on this region abstraction, we adopt diffusion-based population initialization to translate the meta-policy's region-level guidance into solution-level priors for the SAEA. To make MetaSG-SAEA scalable, we construct an attention-based state representation across varying problem dimensions, population sizes, and numbers of objectives and constraints. Experimental results demonstrate that MetaSG-SAEA outperforms state-of-the-art baselines across diverse benchmarks and exhibits the ability to generalize across problem distributions.", "authors": [ "Yukun Du", "Haiyue Yu", "Jiang Jiang", "Shuaiwen Tang", "Xiaotong Xie", "Haobo Liu", "Chongshuang Hu", "Shengkun Chang" ], "year": 2026, "published_date": "2026-05-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.10260", "pdf_url": "https://arxiv.org/pdf/2605.10260", "citations": 0, "topics": [], "tags": [ "Evaluation", "Neural Networks" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.66, "read_first_score": 5.48, "content_potential_score": 1.55, "interestingness_score": 2.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Existing Meta-Black-Box Optimization (MetaBBO) methods focus on how to search when controlling optimizers, but largely overlook where to search. We propose MetaSG-SAEA, a bi-level MetaBBO framework for expensive constrained multi-objective optimization problems (ECMOPs), in which a meta-policy provides search guidance to the low-level Surrogate-Assisted Evolutionary Algorithm (SAEA).", "key_contribution": "We propose MetaSG-SAEA, a bi-level MetaBBO framework for expensive constrained multi-objective optimization problems (ECMOPs), in which a meta-policy provides search guidance to the low-level Surrogate-Assisted Evolutionary Algorithm (SAEA).", "why_it_matters": "Meta-Black-Box Optimization Can Do Search Guidance for Expensive Constrained Multi-Objective Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "We propose MetaSG-SAEA, a bi-level MetaBBO framework for expensive constrained multi-objective optimization problems…", "biggest_caveat": "but largely overlook where to search.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2605.10260", "difficulty": "beginner" }, { "id": "arxiv:2608.09448", "source": "arxiv", "source_type": "preprint", "title": "VANE: Reliable Test-Time Training for Vision-Language-Action Models via Future Visual Representation Prediction", "abstract": "Test-time training (TTT) offers a lightweight way to adapt vision--language--action (VLA) policies from unlabeled deployment streams, but it remains difficult to use reliably in closed-loop manipulation. A shared adaptation space can mix incompatible task corrections, while an online update can alter subsequent actions before its consequences are known. We introduce a reliable TTT framework for VLA policies (VANE). VANE conditions prompt adaptation on the current vision--language context and learns from the future visual consequences of executed actions. Candidate updates are isolated from the live policy, evaluated on subsequent observations, and committed only when supported by future evidence, making adaptation selective and reversible. On SimplerEnv WidowX, VANE improves average success by $3.2$ percentage points over the corresponding TTT baseline. Results on Google Robot further show that deployment-time gains remain task- and embodiment-dependent. Together, these results demonstrate a constrained, evidence-based approach to adapting VLA policies during interaction.", "authors": [ "Hongjin Ji", "Guoyang Xia", "Luoyang Sun", "Fangxiang Feng", "Lei Ren" ], "year": 2026, "published_date": "2026-08-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.09448", "pdf_url": "https://arxiv.org/pdf/2608.09448", "citations": 0, "topics": [], "tags": [ "Robotics", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.65, "read_first_score": 4.21, "content_potential_score": 1.0, "interestingness_score": 2.33, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Test-time training (TTT) offers a lightweight way to adapt vision--language--action (VLA) policies from unlabeled deployment streams, but it remains difficult to use reliably in closed-loop manipulation. A shared adaptation space can mix incompatible task corrections, while an online update can alter subsequent actions before its consequences are known.", "key_contribution": "We introduce a reliable TTT framework for VLA policies (VANE).", "why_it_matters": "VANE: Reliable Test-Time Training for Vision-Language-Action Models via Future Visual Representation Prediction advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We introduce a reliable TTT framework for VLA policies (VANE).", "biggest_caveat": "but it remains difficult to use reliably in closed-loop manipulation.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2608.09448", "difficulty": "intermediate" }, { "id": "arxiv:2607.11258", "source": "arxiv", "source_type": "preprint", "title": "TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs", "abstract": "Tree search algorithms enable systematic exploration of the proof space in neural theorem proving. Existing LLM tree search libraries primarily target natural language reasoning and do not provide native integration with formal verifiers, while theorem proving systems often rely on task-specific search implementations. We introduce TreeThink, an open-source Python library for modular, fully asynchronous tree search in neural theorem proving. It integrates established tree search methods with vLLM-based inference pipelines and diverse node evaluation techniques, ranging from lightweight heuristics to neural evaluators. We support Lean~4, Rocq, and Isabelle/HOL alongside natural language. It connects directly to each language's Read-Eval-Print Loop (REPL) server for real-time verification and proof state extraction. We evaluate TreeThink on miniF2F and MATH500, demonstrating cross-language formal proof search, natural language reasoning support, and up to 6.3$\\times$ wall-clock speedup from asynchronous execution. Source code is released under the MIT license at https://github.com/GGLAB-KU/treethink , and the library is accessible as a downloadable package at https://pypi.org/project/treethink/ .", "authors": [ "Burak S. Akbudak", "Zeynel A. Uluşan", "Can S. Erer", "Gözde Gül Şahin" ], "year": 2026, "published_date": "2026-07-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.11258", "pdf_url": "https://arxiv.org/pdf/2607.11258", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "NLP" ], "paper_type": "theory", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.64, "read_first_score": 5.91, "content_potential_score": 0.0, "interestingness_score": 1.82, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Tree search algorithms enable systematic exploration of the proof space in neural theorem proving. Existing LLM tree search libraries primarily target natural language reasoning and do not provide native integration with formal verifiers, while theorem proving systems often rely on task-specific search implementations.", "key_contribution": "We introduce TreeThink, an open-source Python library for modular, fully asynchronous tree search in neural theorem proving.", "why_it_matters": "TreeThink: A Modular Tree Search Library for Mathematical Reasoning with LLMs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce TreeThink, an open-source Python library for modular, fully asynchronous tree search in neural theorem…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.11258", "difficulty": "beginner" }, { "id": "arxiv:2605.09290", "source": "arxiv", "source_type": "preprint", "title": "From Regression to Inference: Meta-Learning Predictors for Neural Architecture Search", "abstract": "Prediction-based approaches are widely used in neural architecture search (NAS), where a predictor estimates the performance of candidate architectures to guide selection. However, existing predictors are typically trained via supervised regression on limited samples, leading to overfitting and poor generalization to unseen architectures. In this work, we propose a fundamentally different formulation that models performance prediction as a conditional function inference problem using a Convolutional Neural Process (ConvNP) with meta-learning capabilities. Instead of fitting a fixed mapping to limited samples, our approach meta-learns to infer performance from partial observations by training with context-target splits across a group of synthesized tasks, explicitly optimizing for generalization under data scarcity and aligning the training procedure with the deployment setting in NAS. We further design simple yet effective meta-features for cell-based architectures and evaluate our method on NAS-Bench-101 and NAS-Bench-201. Extensive experiments show that our approach consistently improves top-K ranking quality and achieves the state-of-the-art architecture selection using limited samples.", "authors": [ "Liping Deng", "MingQing Xiao" ], "year": 2026, "published_date": "2026-05-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.09290", "pdf_url": "https://arxiv.org/pdf/2605.09290", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses neural architecture search and related concepts.", "maturity_stage": "emerging", "paper_score": 3.64, "read_first_score": 4.88, "content_potential_score": 1.55, "interestingness_score": 2.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Prediction-based approaches are widely used in neural architecture search (NAS), where a predictor estimates the performance of candidate architectures to guide selection. However, existing predictors are typically trained via supervised regression on limited samples, leading to overfitting and poor generalization to unseen architectures.", "key_contribution": "In this work, we propose a fundamentally different formulation that models performance prediction as a conditional function inference problem using a Convolutional Neural Process (ConvNP) with meta-learning capabilities.", "why_it_matters": "From Regression to Inference: Meta-Learning Predictors for Neural Architecture Search represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "In this work, we propose a fundamentally different formulation that models performance prediction as a conditional…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Machine Learning.", "url": "https://arxiv.org/abs/2605.09290", "difficulty": "frontier" }, { "id": "arxiv:2604.24912v1", "source": "arxiv", "source_type": "preprint", "title": "Data-Driven Hamiltonian Reduction for Superconducting Qubits via Meta-Learning", "abstract": "We introduce HAML (Hamiltonian Adaptation via Meta-Learning), a framework for fast online adaptation of effective Hamiltonian models of superconducting quantum processors. HAML proceeds in two phases. A supervised training phase uses an ensemble of simulated devices to learn an offline map from control inputs and device parameters to effective Hamiltonian coefficients. An online adaptation phase then uses a small number of hardware-accessible measurements to identify the unknown parameters of a new device. By training directly against effective two-qubit coefficients extracted from full multi-mode simulations, HAML implicitly learns the reduction from full multi-mode Hamiltonians to effective qubit descriptions without invoking perturbation theory. We further show that a variance-maximizing greedy selection of measurement configurations boosts online adaptation efficiency. We demonstrate HAML on a transmon-coupler-transmon system, recovering effective two-qubit coefficients across a wide range of operating regimes, including parameter regions where Schrieffer-Wolff perturbation theory (SWPT) breaks down. This establishes a scalable, sample-efficient approach to Hamiltonian reduction and characterization for near-term quantum processors, with direct implications for calibration, control, and error mitigation.", "authors": [ "Arielle Sanford", "Andrew T. Kamen", "Frederic T. Chong", "Andy J. Goldschmidt" ], "year": 2026, "published_date": "2026-04-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.24912v1", "pdf_url": "https://arxiv.org/pdf/2604.24912v1", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.64, "read_first_score": 5.64, "content_potential_score": 1.0, "interestingness_score": 2.32, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce HAML (Hamiltonian Adaptation via Meta-Learning), a framework for fast online adaptation of effective Hamiltonian models of superconducting quantum processors. HAML proceeds in two phases.", "key_contribution": "We introduce HAML (Hamiltonian Adaptation via Meta-Learning), a framework for fast online adaptation of effective Hamiltonian models of superconducting quantum processors.", "why_it_matters": "Data-Driven Hamiltonian Reduction for Superconducting Qubits via Meta-Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "We introduce HAML (Hamiltonian Adaptation via Meta-Learning), a framework for fast online adaptation of effective…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Machine Learning.", "url": "http://arxiv.org/abs/2604.24912v1", "difficulty": "beginner" }, { "id": "arxiv:2609.04007", "source": "arxiv", "source_type": "preprint", "title": "RobustSeiz: An Open-Source Framework for Benchmarking the Robustness of EEG Seizure Detection Models", "abstract": "Despite strong performance on held-out electroencephalography (EEG) data, seizure detectors may fail under real-world acquisition variability, artifacts, and adversarial inputs. We introduce RobustSeiz, an open-source, model-agnostic framework that provides a standardized, reproducible protocol for stress-testing and comparing seizure detectors under controlled, clinically motivated distribution shifts before deployment. We standardize four public scalp-EEG corpora (CHB-MIT, TUSZ, Siena, and SeizeIT1) into BIDS-EEG trees and evaluate subject-independent detectors on held-out splits. Environment, noise, and adversarial transforms are swept over predefined hyperparameter grids. Each run reports sample- and event-level sensitivity, precision, F1, false positives per 24 h, Lead and Lag onset timing, and Monte Carlo dropout predictive agreement. RobustSeiz includes a Dockerized GPU pipeline, experiment registry, and full-evaluation and research-subset modes. We demonstrate the framework with a contemporary seizure detector on TUSZ across the complete implemented shift grid; an AWGN analysis illustrates how perturbation severity changes detection quality, onset timing, and predictive agreement. RobustSeiz provides a shared benchmarking standard for evaluating seizure-detector robustness under realistic clinical stressors, extending pre-deployment assessment beyond clean-data accuracy.", "authors": [ "Mohammad Mohammadi", "Alireza Zarei" ], "year": 2026, "published_date": "2026-09-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.04007", "pdf_url": "https://arxiv.org/pdf/2609.04007", "citations": 0, "topics": [], "tags": [ "Biomedical AI", "Evaluation", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses hyperparameter — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.63, "read_first_score": 4.44, "content_potential_score": 1.0, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Despite strong performance on held-out electroencephalography (EEG) data, seizure detectors may fail under real-world acquisition variability, artifacts, and adversarial inputs. We introduce RobustSeiz, an open-source, model-agnostic framework that provides a standardized, reproducible protocol for stress-testing and comparing seizure detectors under controlled, clinically motivated distribution shifts before deployment.", "key_contribution": "We introduce RobustSeiz, an open-source, model-agnostic framework that provides a standardized, reproducible protocol for stress-testing and comparing seizure detectors under controlled, clinically motivated distribution shifts before deployment.", "why_it_matters": "RobustSeiz: An Open-Source Framework for Benchmarking the Robustness of EEG Seizure Detection Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Biomedical AI.", "one_line_takeaway": "We introduce RobustSeiz, an open-source, model-agnostic framework that provides a standardized, reproducible protocol…", "biggest_caveat": "bution shifts before deployment.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Biomedical AI.", "url": "https://arxiv.org/abs/2609.04007", "difficulty": "advanced" }, { "id": "arxiv:2601.21464", "source": "arxiv", "source_type": "preprint", "title": "Conversation for Non-verifiable Learning: Self-Evolving LLMs through Meta-Evaluation", "abstract": "Training large language models (LLMs) for non-verifiable tasks, such as creative writing, dialogue, and ethical reasoning, remains challenging due to the absence of ground-truth labels. While LLM-as-Judge approaches offer a scalable alternative to human feedback, they face a fundamental limitation: performance is constrained by the evaluator's own quality. If the judge cannot recognize good solutions, it cannot provide useful training signals, and evaluation biases (e.g., favoring verbosity over quality) remain unaddressed. This motivates meta-evaluation: the ability to evaluate and improve the evaluator itself. We introduce CoNL, a framework that unifies generation, evaluation, and meta-evaluation through multi-agent self-play. Our key insight: critique quality can be measured by whether it helps others improve their solutions. In CoNL, multiple agents sharing the same policy engage in structured conversations to propose, critique, and revise solutions. Critiques that enable solution improvements earn a diagnostic reward, creating explicit supervision for meta-evaluation and enabling joint optimization of generation and judging capabilities through self-play, without external judges or ground truth. Experiments on various benchmarks show that CoNL achieves consistent improvements over self-rewarding baselines while maintaining stable training.", "authors": [ "Yuan Sui", "Bryan Hooi" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.21464", "pdf_url": "https://arxiv.org/pdf/2601.21464", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Dialogue", "Fairness & Ethics", "Evaluation" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.63, "read_first_score": 5.02, "content_potential_score": 1.0, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Training large language models (LLMs) for non-verifiable tasks, such as creative writing, dialogue, and ethical reasoning, remains challenging due to the absence of ground-truth labels. While LLM-as-Judge approaches offer a scalable alternative to human feedback, they face a fundamental limitation: performance is constrained by the evaluator's own quality.", "key_contribution": "We introduce CoNL, a framework that unifies generation, evaluation, and meta-evaluation through multi-agent self-play.", "why_it_matters": "Conversation for Non-verifiable Learning: Self-Evolving LLMs through Meta-Evaluation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce CoNL, a framework that unifies generation, evaluation, and meta-evaluation through multi-agent self-play.", "biggest_caveat": "limitation: performance is constrained by the evaluator's own quality.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2601.21464", "difficulty": "beginner" }, { "id": "arxiv:2601.07349", "source": "arxiv", "source_type": "preprint", "title": "Reward Modeling from Natural Language Human Feedback", "abstract": "Reinforcement Learning with Verifiable reward (RLVR) on preference data has become the mainstream approach for training Generative Reward Models (GRMs). Typically in pairwise rewarding tasks, GRMs generate reasoning chains ending with critiques and preference labels, and RLVR then relies on the correctness of the preference labels as the training reward. However, in this paper, we demonstrate that such binary classification tasks make GRMs susceptible to guessing correct outcomes without sound critiques. Consequently, these spurious successes introduce substantial noise into the reward signal, thereby impairing the effectiveness of reinforcement learning. To address this issue, we propose Reward Modeling from Natural Language Human Feedback (RM-NLHF), which leverages natural language feedback to obtain process reward signals, thereby mitigating the problem of limited solution space inherent in binary tasks. Specifically, we compute the similarity between GRM-generated and human critiques as the training reward, which provides more accurate reward signals than outcome-only supervision. Additionally, considering that human critiques are difficult to scale up, we introduce Meta Reward Model (MetaRM) which learns to predict process reward from datasets with human critiques and then generalizes to data without human critiques. Experiments on multiple benchmarks demonstrate that our method consistently outperforms state-of-the-art GRMs trained with outcome-only reward, confirming the superiority of integrating natural language over binary human feedback as supervision.", "authors": [ "Zongqi Wang", "Rui Wang", "Yuchuan Wu", "Yiyao Yu", "Pinyi Zhang", "Shaoning Sun", "Yujiu Yang", "Yongbin Li" ], "year": 2026, "published_date": "2026-05-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.07349", "pdf_url": "https://arxiv.org/pdf/2601.07349", "citations": 0, "topics": [], "tags": [ "Reasoning", "RLHF", "Evaluation", "NLP" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.63, "read_first_score": 6.36, "content_potential_score": 0.55, "interestingness_score": 2.09, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reinforcement Learning with Verifiable reward (RLVR) on preference data has become the mainstream approach for training Generative Reward Models (GRMs). Typically in pairwise rewarding tasks, GRMs generate reasoning chains ending with critiques and preference labels, and RLVR then relies on the correctness of the preference labels as the training reward.", "key_contribution": "However, in this paper, we demonstrate that such binary classification tasks make GRMs susceptible to guessing correct outcomes without sound critiques.", "why_it_matters": "Reward Modeling from Natural Language Human Feedback represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "However, in this paper, we demonstrate that such binary classification tasks make GRMs susceptible to guessing correct…", "biggest_caveat": "However, in this paper, we demonstrate that such binary classification tasks make GRMs susceptible to guessing correct outcomes without sound critiques.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2601.07349", "difficulty": "beginner" }, { "id": "arxiv:2601.22131", "source": "arxiv", "source_type": "preprint", "title": "SMOG: Scalable Meta-Learning for Multi-Objective Bayesian Optimization", "abstract": "Multi-objective optimization aims to solve problems with competing objectives. Evaluating such problems is often slow or expensive, limiting the budget of evaluations. In many applications, historical data from related optimization tasks is available and can be leveraged via meta-learning to accelerate optimization. Bayesian optimization, as a promising technique for expensive black-box problems, has been extended independently to meta-learning and multi-objective optimization, but methods that simultaneously address both settings remain largely unexplored. We propose SMOG-a scalable and modular meta-learning model based on a multi-output Gaussian process-that explicitly learns correlations between objectives. SMOG builds a structured joint Gaussian process prior across meta- and target tasks and, after conditioning on metadata, yields a closed-form prior for the target task. This construction propagates metadata uncertainty into the target surrogate in a principled way. SMOG supports hierarchical, parallel training, achieving linear scaling with the number of meta-tasks. The resulting surrogate integrates seamlessly with standard multi-objective Bayesian optimization acquisition functions. We demonstrate that our method is consistently competitive, delivering strong data efficiency across representative benchmarks and applications.", "authors": [ "Leonard Papenmeier", "Petru Tighineanu" ], "year": 2026, "published_date": "2026-05-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.22131", "pdf_url": "https://arxiv.org/pdf/2601.22131", "citations": 0, "topics": [], "tags": [ "Evaluation", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.63, "read_first_score": 4.33, "content_potential_score": 1.0, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multi-objective optimization aims to solve problems with competing objectives. Evaluating such problems is often slow or expensive, limiting the budget of evaluations.", "key_contribution": "We propose SMOG-a scalable and modular meta-learning model based on a multi-output Gaussian process-that explicitly learns correlations between objectives.", "why_it_matters": "SMOG: Scalable Meta-Learning for Multi-Objective Bayesian Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "We propose SMOG-a scalable and modular meta-learning model based on a multi-output Gaussian process-that explicitly…", "biggest_caveat": "but methods that simultaneously address both settings remain largely unexplored.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2601.22131", "difficulty": "frontier" }, { "id": "arxiv:2609.23173", "source": "arxiv", "source_type": "preprint", "title": "Exploiting Software-level Abstractions To Support Practical Hardware Trojan Attacks", "abstract": "Hardware trojan (HT) attacks against CPUs typically assume threat scenarios where an attacker targeting a system with a trojanized CPU is able to execute arbitrary code (i.e. machine-level instructions) to reliably interact with the implanted trojan. On end-user devices (i.e., mobiles, laptops), achieving arbitrary code execution in practice requires software exploits tailored to each specific target. Such strong adversarial premises reduce the generality of existing threat models casting doubt on CPU trojan attacks as a pragmatic threat vector. To push the envelope on HT attacks against client devices, we introduce the SURF class of CPU-trojans that can be activated without arbitrary code execution. Our key insight is that integer operations expressed in a high-level language can be mapped to microarchitectural side-effects distinguishable by a SURF trigger circuit. This observation unlocks HT activation via runtime engines, constrained environments executing untrusted high-level code. We demonstrate a SURF trojan inside a RISC-V processor and exploit JavaScript-level memory indexing operations inside Google's V8 engine to perform a code injection attack. Importantly, we show that SURF trojans remain effective across multiple JavaScript engine versions, enabling long-term compromise of endpoint devices. To facilitate research, we opensource SURF's design and supporting software.", "authors": [ "Athanasios Moschos", "Kevin Valakuzhy", "Georgios Kokolakis", "Fabian Monrose", "Angelos D. Keromytis" ], "year": 2026, "published_date": "2026-09-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.23173", "pdf_url": "https://arxiv.org/pdf/2609.23173", "citations": 0, "topics": [], "tags": [ "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.62, "read_first_score": 5.55, "content_potential_score": 1.0, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Hardware trojan (HT) attacks against CPUs typically assume threat scenarios where an attacker targeting a system with a trojanized CPU is able to execute arbitrary code (i.e. machine-level instructions) to reliably interact with the implanted trojan.", "key_contribution": "To push the envelope on HT attacks against client devices, we introduce the SURF class of CPU-trojans that can be activated without arbitrary code execution.", "why_it_matters": "Exploiting Software-level Abstractions To Support Practical Hardware Trojan Attacks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Cryptography & Security.", "one_line_takeaway": "To push the envelope on HT attacks against client devices, we introduce the SURF class of CPU-trojans that can be…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Cryptography & Security.", "url": "https://arxiv.org/abs/2609.23173", "difficulty": "intermediate" }, { "id": "arxiv:2311.11482", "source": "arxiv", "source_type": "preprint", "title": "Meta Prompting for AI Systems", "abstract": "We introduce Meta Prompting (MP), a framework that emphasizes the formal structure of a task rather than content-specific worked examples. We give a categorical formalization in which a functor maps typed task transformations to typed prompt transformations. Functoriality encodes preservation of identities and composition, but it does not by itself guarantee semantic correctness. We extend MP to Recursive Meta Prompting (RMP), in which a proposer model generates candidate prompt edits, a validator enforces the edit schema, and an executor model uses the resulting prompt. We model the accumulation of valid edit scripts with the Writer monad and their application by a monoid action on prompts. This construction makes accumulated edits independent of parenthesization; it does not guarantee convergence or improved task accuracy. Empirically, a Qwen-72B base model guided by example-free meta-prompts attains 46.3% pass@1 on MATH and 83.5% accuracy on GSM8K. Separately, an MP-CR agent synthesizes a tool-executed Game of 24 solver; the original experiment reports 100% success on 1,362 instances, subject to exact re-verification from the corresponding input and per-instance outputs. The batch amortizes one LLM response across all puzzles, so its token accounting is not protocol-matched to per-instance few-shot or search-based methods.", "authors": [ "Yifan Zhang", "Yang Yuan", "Andrew Chi-Chih Yao" ], "year": 2026, "published_date": "2026-08-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2311.11482", "pdf_url": "https://arxiv.org/pdf/2311.11482", "citations": 0, "topics": [], "tags": [ "LLMs", "Prompting", "Artificial Intelligence", "NLP" ], "paper_type": "theory", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.62, "read_first_score": 6.09, "content_potential_score": 0.0, "interestingness_score": 1.81, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce Meta Prompting (MP), a framework that emphasizes the formal structure of a task rather than content-specific worked examples. We give a categorical formalization in which a functor maps typed task transformations to typed prompt transformations.", "key_contribution": "We introduce Meta Prompting (MP), a framework that emphasizes the formal structure of a task rather than content-specific worked examples.", "why_it_matters": "Meta Prompting for AI Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Meta Prompting (MP), a framework that emphasizes the formal structure of a task rather than…", "biggest_caveat": "but it does not by itself guarantee semantic correctness.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2311.11482", "difficulty": "beginner" }, { "id": "arxiv:2607.04890", "source": "arxiv", "source_type": "preprint", "title": "Evaluating Large Language Models for Antisemitic Incident Classification", "abstract": "Addressing hate and violence in society requires timely detection of hateful events from public reporting, but automated identification of hateful events remains underexplored. We introduce the task of hateful event detection and investigate the ability of AI systems, specifically large language models (LLMs), to discover and classify reports of antisemitic events with fine-grained labels. We evaluate OpenAI's GPT-4o and Meta's Llama-3.2-3B-Instruct on multiple expert-annotated datasets containing antisemitic event descriptions from news articles, civil society reports, and official records. We show that LLMs, particularly GPT-4o, have potential for this task, but substantial improvement is needed. Providing clear term definitions and in-context examples in prompts can improve performance: definitions are most helpful for rhetoric-oriented events (e.g. classical antisemitic tropes), while examples help label action-oriented events (e.g. physical assault). A case study of college newspapers demonstrates that LLMs can help surface relevant real-world events, supporting early monitoring and intervention. Overall, our findings highlight both opportunities and critical gaps in AI's ability to recognize complex harms and underscore the need for collaborative efforts among AI developers, policymakers, and civil society to design models, implement robust evaluation, and develop policy frameworks for defining and combating hate efficiently and effectively.", "authors": [ "Karina Halevy", "Julia Mendelsohn", "Chan Young Park", "Yulia Tsvetkov", "Maarten Sap" ], "year": 2026, "published_date": "2026-07-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.04890", "pdf_url": "https://arxiv.org/pdf/2607.04890", "citations": 0, "topics": [], "tags": [ "LLMs", "NLP" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.62, "read_first_score": 6.17, "content_potential_score": 1.0, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Addressing hate and violence in society requires timely detection of hateful events from public reporting, but automated identification of hateful events remains underexplored. We introduce the task of hateful event detection and investigate the ability of AI systems, specifically large language models (LLMs), to discover and classify reports of antisemitic events with fine-grained labels.", "key_contribution": "We introduce the task of hateful event detection and investigate the ability of AI systems, specifically large language models (LLMs), to discover and classify reports of antisemitic events with fine-grained labels.", "why_it_matters": "Evaluating Large Language Models for Antisemitic Incident Classification represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce the task of hateful event detection and investigate the ability of AI systems, specifically large language…", "biggest_caveat": "but automated identification of hateful events remains underexplored.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.04890", "difficulty": "intermediate" }, { "id": "arxiv:2605.23378", "source": "arxiv", "source_type": "preprint", "title": "Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty", "abstract": "Ambulance response is time-critical in out-of-hospital cardiac arrest (OHCA), where dispatchers must balance timely arrivals with limited fleet capacity. Static territories and deterministic travel-time estimates are vulnerable to dynamic congestion, while always-dual dispatch adds redundancy but consumes fleet capacity. We propose IDEAL (Intelligent Dual dispatch of Emergency AmbuLances), a selective dual-dispatch framework that sends a second ambulance only when the optimistic gap between primary and secondary paths exceeds a threshold. IDEAL learns context-specific edge travel times from trip-level dispatch records, including unobserved routes, using a weakly supervised bilevel representation network. We train the nonsmooth model with mini-batch conservative gradients and prove an asymptotic convergence guarantee. IDEAL models uncertainty via Burg-divergence perturbations to a shared metric in the learned representation space, thereby inducing correlated changes in edge travel times and learning context-specific radii from historical underprediction errors. For real-time decisions, IDEAL casts optimistic-gap computation as a difference-of-convex program and derives an efficient oracle with complexity guarantees. In collaboration with the Hong Kong Fire Services Department, we evaluate IDEAL using historical OHCA records and real-time adaptive simulations. The results achieve a stronger response-time/resource trade-off relative to all region-based and Google-based baselines.", "authors": [ "Zikun Lin", "Daniel Zhuoyu Long", "Viet Anh Nguyen" ], "year": 2026, "published_date": "2026-05-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.23378", "pdf_url": "https://arxiv.org/pdf/2605.23378", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses convergence guarantee and related concepts.", "maturity_stage": "emerging", "paper_score": 3.62, "read_first_score": 4.37, "content_potential_score": 0.0, "interestingness_score": 1.81, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Ambulance response is time-critical in out-of-hospital cardiac arrest (OHCA), where dispatchers must balance timely arrivals with limited fleet capacity. Static territories and deterministic travel-time estimates are vulnerable to dynamic congestion, while always-dual dispatch adds redundancy but consumes fleet capacity.", "key_contribution": "We propose IDEAL (Intelligent Dual dispatch of Emergency AmbuLances), a selective dual-dispatch framework that sends a second ambulance only when the optimistic gap between primary and secondary paths exceeds a threshold.", "why_it_matters": "Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "We propose IDEAL (Intelligent Dual dispatch of Emergency AmbuLances), a selective dual-dispatch framework that sends a…", "biggest_caveat": "but consumes fleet capacity.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Machine Learning.", "url": "https://arxiv.org/abs/2605.23378", "difficulty": "frontier" }, { "id": "arxiv:2608.15780", "source": "arxiv", "source_type": "preprint", "title": "Decomposing Staleness in Recommender Systems: A Dual-Filter Framework for Supersession and Decay", "abstract": "Stale recommendations are a pervasive challenge and a leading source of user complaints on large-scale content platforms. Items lose relevance through two primary mechanisms: supersession, where emerging updates render prior coverage stale, and relevance decay, where an item's informational value naturally diminishes over its lifecycle. Traditional countermeasures serve as crude proxies: age cutoffs poorly reflect actual relevance loss, while engagement heuristics rely on lagging signals, broadly exposing users to stale content before the system adapts. We present SDF (Supersession-Decay Filtering), a staleness filtering system fully deployed in Google Discover, a personalized recommendation feed with hundreds of millions of daily and billions of monthly active users. SDF targets both mechanisms with complementary filters, each powered by a learned model: a relational staleness model that detects supersession between item pairs, and a predicted traffic ratio (PTR) model that forecasts relevance decay from the item's content, trained on lifetime visit traffic. Applied via disjunction upstream of the ranking stage, SDF prunes stale candidates, measurably reducing downstream serving costs. Online experiments demonstrate that these filters significantly reduce the prevalence of stale content while improving user engagement. Over a two-year production deployment, user-filed staleness reports (in-product user feedback) declined by 54.9% relative to the pre-deployment baseline, establishing SDF as a robust and scalable paradigm for resolving content staleness at industrial scale.", "authors": [ "Di Bai", "Feng Han", "Zhenwei Tang", "Jintao Liu", "Luoshu Wang", "Jialu Liu" ], "year": 2026, "published_date": "2026-08-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.15780", "pdf_url": "https://arxiv.org/pdf/2608.15780", "citations": 0, "topics": [], "tags": [ "Information Retrieval", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.61, "read_first_score": 4.61, "content_potential_score": 2.68, "interestingness_score": 3.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Stale recommendations are a pervasive challenge and a leading source of user complaints on large-scale content platforms. Items lose relevance through two primary mechanisms: supersession, where emerging updates render prior coverage stale, and relevance decay, where an item's informational value naturally diminishes over its lifecycle.", "key_contribution": "We present SDF (Supersession-Decay Filtering), a staleness filtering system fully deployed in Google Discover, a personalized recommendation feed with hundreds of millions of daily and billions of monthly active users.", "why_it_matters": "Decomposing Staleness in Recommender Systems: A Dual-Filter Framework for Supersession and Decay improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about Information Retrieval.", "one_line_takeaway": "We present SDF (Supersession-Decay Filtering), a staleness filtering system fully deployed in Google Discover, a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Information Retrieval.", "url": "https://arxiv.org/abs/2608.15780", "difficulty": "intermediate" }, { "id": "arxiv:2607.17508", "source": "arxiv", "source_type": "preprint", "title": "Retrieval-Augmented Interpretable Learning: Towards Task-Specific Zero-Shot Models in Healthcare", "abstract": "We introduce Retrieval-Augmented Interpretable Learning (RAIL), a probabilistic meta-learning framework for zero-shot generation of task-specific interpretable models that synthesizes coefficient-space structure from natural-language task descriptions and a memory of previously learned task-specific predictors. RAIL retrieves related source tasks, transfers structure through coefficient space, and generates a new predictor in the original diagnostic-feature space, enabling zero-shot and few-shot clinical procedure prediction with feature-level explanations. Its probabilistic formulation provides uncertainty over retrieval, model coefficients, and predictions, supporting reliability-aware deployment: uncertain predictions or unstable explanations can be flagged for additional clinical review rather than treated as automatic decisions. This makes RAIL particularly suited for healthcare settings, where prediction tasks are highly long-tailed, new clinical targets arise frequently, and models must remain inspectable, uncertainty-aware, and compatible with human oversight. Across long-tailed clinical procedure prediction tasks, RAIL maintains reliable performance across data-availability regimes: it achieves 73.4% accuracy in the held-out zero-shot settings, where no supervised task-specific model can be trained, and remains near 73.2% accuracy in the extreme few-shot regime with only 2-4 examples, where supervised task-specific models perform close to chance. RAIL further benefits from clinically informed task representations and yields retrieval, uncertainty, and coefficient-level diagnostics that make model behavior more transparent. These results suggest a path toward scalable clinical prediction systems that can adapt to new tasks while preserving interpretability and reliability.", "authors": [ "Sazan Mahbub", "Caleb Ellington", "Zhiyuan Li", "Yixin Yang", "Souvik Kundu", "Ben Lengerich", "Eric P. Xing" ], "year": 2026, "published_date": "2026-07-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.17508", "pdf_url": "https://arxiv.org/pdf/2607.17508", "citations": 0, "topics": [], "tags": [ "Prompting", "Biomedical AI", "Interpretability", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.61, "read_first_score": 5.22, "content_potential_score": 2.26, "interestingness_score": 2.93, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce Retrieval-Augmented Interpretable Learning (RAIL), a probabilistic meta-learning framework for zero-shot generation of task-specific interpretable models that synthesizes coefficient-space structure from natural-language task descriptions and a memory of previously learned task-specific predictors. RAIL retrieves related source tasks, transfers structure through coefficient space, and generates a new predictor in the original diagnostic-feature space, enabling zero-shot and few-shot clinical procedure prediction with feature-level explanations.", "key_contribution": "We introduce Retrieval-Augmented Interpretable Learning (RAIL), a probabilistic meta-learning framework for zero-shot generation of task-specific interpretable models that synthesizes coefficient-space structure from natural-language task descriptions and a memory of previously learned task-specific predictors.", "why_it_matters": "Retrieval-Augmented Interpretable Learning: Towards Task-Specific Zero-Shot Models in Healthcare represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We introduce Retrieval-Augmented Interpretable Learning (RAIL), a probabilistic meta-learning framework for zero-shot…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2607.17508", "difficulty": "beginner" }, { "id": "arxiv:2606.19535", "source": "arxiv", "source_type": "preprint", "title": "FloatDoor: Platform-Triggered Backdoors in LLMs", "abstract": "Large language models (LLMs) are increasingly deployed in sensitive settings such as software engineering, where their outputs directly shape downstream artifacts. Recent work has shown that an identical model can produce measurably different outputs depending on the deployment platform, a consequence of non-associative floating-point arithmetic and divergent kernel implementations. We study the security implications of this platform-dependent variability and uncover a novel attack surface on LLM deployments. We introduce FloatDoor, the first input-independent, platform-triggered backdoor attack against generative LLMs. The compromised model exhibits adversary-chosen behavior when served on a target platform and is otherwise benign. FloatDoor is realized through two lightweight LoRA adapters, one that amplifies inter-platform numerical divergence and one that binds the resulting platform signature to a malicious downstream task, while leaving aggregate model utility largely intact. FloatDoor exploits a pronounced time-of-check, time-of-use gap between model auditing and serving. We demonstrate FloatDoor on Qwen3-4B across a broad range of deployment targets, including NVIDIA GPUs, Google TPUs, AWS Graviton, and Alibaba Yitian-710. As a final case study, we show that FloatDoor reliably induces exploitable code vulnerabilities on a chosen target platform. Our results establish a new class of attacks on LLM deployments and underscore the pressing need for trusted model supply chains in sensitive, LLM-powered applications.", "authors": [ "Nils Loose", "Jonas Sander", "Felix Mächtle", "Thomas Eisenbarth" ], "year": 2026, "published_date": "2026-06-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.19535", "pdf_url": "https://arxiv.org/pdf/2606.19535", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "Machine Learning", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.61, "read_first_score": 5.61, "content_potential_score": 1.84, "interestingness_score": 2.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models (LLMs) are increasingly deployed in sensitive settings such as software engineering, where their outputs directly shape downstream artifacts. Recent work has shown that an identical model can produce measurably different outputs depending on the deployment platform, a consequence of non-associative floating-point arithmetic and divergent kernel implementations.", "key_contribution": "We study the security implications of this platform-dependent variability and uncover a novel attack surface on LLM deployments.", "why_it_matters": "FloatDoor: Platform-Triggered Backdoors in LLMs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We study the security implications of this platform-dependent variability and uncover a novel attack surface on LLM…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.19535", "difficulty": "intermediate" }, { "id": "arxiv:2605.05287", "source": "arxiv", "source_type": "preprint", "title": "Securing the Agent: Vendor-Neutral, Multitenant Enterprise Retrieval and Tool Use", "abstract": "Retrieval-Augmented Generation (RAG) and agentic AI systems are increasingly prevalent in enterprise AI deployments. However, real enterprise environments introduce challenges largely absent from academic treatments and consumer-facing APIs: multiple tenants with heterogeneous data, strict access-control requirements, regulatory compliance, and cost pressures that demand shared infrastructure. A fundamental problem underlies existing RAG architectures in these settings: retrieval systems rank documents by relevance--whether through semantic similarity, keyword matching, or hybrid approaches--not by authorization, so a query from one tenant can surface another tenant's confidential data simply because it scores highest. We formalize this gap and analyze additional shortcomings--including tool-mediated disclosure, context accumulation across turns, and client-side orchestration bypass--that arise when agentic systems conflate relevance with authorization. To address these challenges, we introduce a layered isolation architecture combining policy-aware ingestion, retrieval-time gating, and shared inference, enforced through server-side agentic orchestration. This approach centralizes security-critical operations--tool execution authorization, state isolation, and policy enforcement--on the server, creating natural enforcement points for multitenant isolation while allowing client-side frameworks to retain control over agent composition and latency-sensitive operations. We validate the proposed architecture through an open-source implementation in OGX, a vendor-neutral framework that implements an OpenAI-compatible, open-source Responses API with server-side multi-turn orchestration. We evaluate it empirically and show that ABAC gating eliminates cross-tenant leakage while introducing negligible overhead.", "authors": [ "Francisco Javier Arceo", "Varsha Prasad Narsing" ], "year": 2026, "published_date": "2026-05-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.05287", "pdf_url": "https://arxiv.org/pdf/2605.05287", "citations": 0, "topics": [], "tags": [ "AI Agents", "RAG", "Embeddings", "Cryptography & Security", "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.61, "read_first_score": 4.58, "content_potential_score": 1.0, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Retrieval-Augmented Generation (RAG) and agentic AI systems are increasingly prevalent in enterprise AI deployments. However, real enterprise environments introduce challenges largely absent from academic treatments and consumer-facing APIs: multiple tenants with heterogeneous data, strict access-control requirements, regulatory compliance, and cost pressures that demand shared infrastructure.", "key_contribution": "However, real enterprise environments introduce challenges largely absent from academic treatments and consumer-facing APIs: multiple tenants with heterogeneous data, strict access-control requirements, regulatory compliance, and cost pressures that demand shared infrastructure.", "why_it_matters": "Securing the Agent: Vendor-Neutral, Multitenant Enterprise Retrieval and Tool Use represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "However, real enterprise environments introduce challenges largely absent from academic treatments and consumer-facing…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2605.05287", "difficulty": "intermediate" }, { "id": "arxiv:2603.00117", "source": "arxiv", "source_type": "preprint", "title": "PEPA: a Persistently Autonomous Embodied Agent with Personalities", "abstract": "Living organisms exhibit persistent autonomy through internally generated goals and self-sustaining behavioral organization, yet current embodied agents remain driven by externally scripted objectives. This dependence on predefined task specifications limits their capacity for long-term deployment in dynamic, unstructured environments where continuous human intervention is impractical. We propose that personality traits provide an intrinsic organizational principle for achieving persistent autonomy. Analogous to genotypic biases shaping biological behavioral tendencies, personalities enable agents to autonomously generate goals and sustain behavioral evolution without external supervision. To realize this, we develop PEPA, a three-layer cognitive architecture that operates through three interacting systems: Sys3 autonomously synthesizes personality-aligned goals and refines them via episodic memory and daily self-reflection; Sys2 performs deliberative reasoning to translate goals into executable action plans; Sys1 grounds the agent in sensorimotor interaction, executing actions and recording experiences. We validate the framework through real-world deployment on a quadruped robot in a multi-floor office building. Operating without reliance on fixed task specifications, the robot autonomously arbitrates between user requests and personality-driven motivations, navigating elevators and exploring environments accordingly. Quantitative analysis across five distinct personality prototypes demonstrates stable, trait-aligned behaviors. The results confirm that personality-driven cognitive architectures enable sustained autonomous operation characteristic of persistent embodied systems. Code and demo videos are available at https://sites.google.com/view/pepa-persistent/.", "authors": [ "Kaige Liu", "Yang Li", "Lijun Zhu", "Weinan Zhang" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.00117", "pdf_url": "https://arxiv.org/pdf/2603.00117", "citations": 0, "topics": [], "tags": [ "Reasoning", "Robotics", "Fairness & Ethics", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.61, "read_first_score": 4.57, "content_potential_score": 1.84, "interestingness_score": 2.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Living organisms exhibit persistent autonomy through internally generated goals and self-sustaining behavioral organization, yet current embodied agents remain driven by externally scripted objectives. This dependence on predefined task specifications limits their capacity for long-term deployment in dynamic, unstructured environments where continuous human intervention is impractical.", "key_contribution": "We propose that personality traits provide an intrinsic organizational principle for achieving persistent autonomy.", "why_it_matters": "PEPA: a Persistently Autonomous Embodied Agent with Personalities represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We propose that personality traits provide an intrinsic organizational principle for achieving persistent autonomy.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2603.00117", "difficulty": "intermediate" }, { "id": "arxiv:2409.03682", "source": "arxiv", "source_type": "preprint", "title": "A New First-Order Meta-Learning Algorithm with Convergence Guarantees", "abstract": "Learning new tasks by leveraging prior experience is a fundamental trait of intelligent systems. While Model-Agnostic Meta-Learning (MAML) is a leading approach, it suffers from significant computational and memory overhead due to the requirement of computing second-order meta-gradients. We propose \\textbf{FO-B-MAML}, a novel first-order variant of MAML derived from a bi-level optimization perspective. Our framework introduces a new expression of the meta-gradient, defined as the derivative of the solution of a perturbed optimization problem. This formulation allows the meta-gradient to be estimated using various finite difference methods; in this work, we propose and analyze two simple yet effective estimators: a forward and a symmetric approximation. Unlike existing first-order methods like FO-MAML and Reptile, which suffer from irreducible bias, we prove that FO-B-MAML converges to a stationary point of the meta-objective. Notably, the symmetric estimator achieves an improved $\\mathcal{O}(δ^{2/3})$ bias rate, strictly enhancing previous first-order theory. Furthermore, we demonstrate that the MAML objective violates standard smoothness assumptions; we show instead that its smoothness constant grows with the norm of the meta-gradient. This property theoretically justifies the use of normalized or clipped-gradient methods (SNGDM) over vanilla gradient descent. Our empirical results validate these advancements: FO-B-MAML achieves high accuracy, closely following second-order MAML performance. Crucially, our method bypasses the ``activation bottleneck'' of second-order approaches, maintaining a flat memory footprint even when scaling to deep, activation-heavy CNNs and Transformers.", "authors": [ "El Mahdi Chayti", "Martin Jaggi" ], "year": 2026, "published_date": "2026-08-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2409.03682", "pdf_url": "https://arxiv.org/pdf/2409.03682", "citations": 0, "topics": [], "tags": [ "Transformers", "Fairness & Ethics", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L3", "difficulty_reason": "Uses gradient descent — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.6, "read_first_score": 6.22, "content_potential_score": 0.0, "interestingness_score": 1.8, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Learning new tasks by leveraging prior experience is a fundamental trait of intelligent systems. While Model-Agnostic Meta-Learning (MAML) is a leading approach, it suffers from significant computational and memory overhead due to the requirement of computing second-order meta-gradients.", "key_contribution": "We propose \\textbf{FO-B-MAML}, a novel first-order variant of MAML derived from a bi-level optimization perspective.", "why_it_matters": "A New First-Order Meta-Learning Algorithm with Convergence Guarantees represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "We propose \\textbf{FO-B-MAML}, a novel first-order variant of MAML derived from a bi-level optimization perspective.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2409.03682", "difficulty": "advanced" }, { "id": "arxiv:2608.00325", "source": "arxiv", "source_type": "preprint", "title": "Triton for MTIA: Bridging the Programming Model Gaps for Custom AI Accelerators", "abstract": "The rapid growth in machine learning workloads has fueled the proliferation of custom accelerator architectures. Designed from the ground up, these accelerators often expose programming models that are distinct from GPUs. While hyperscalers and AI chip startups continue to innovate in this space, achieving broad operator coverage to support diverse models remains a major challenge. Additionally, an easy-to-use, high-level kernel programming language is important for rapid iteration of models and kernels. Triton, together with TorchInductor, addresses these issues on GPUs, but its viability on accelerators with different programming models has yet to be established. In this work, we present the first production-scale application of Triton on a custom ML accelerator, MTIA-2i, developed by Meta. To support MTIA-2i, we develop a new compiler backend that targets it, introduce enhancements to TorchInductor code generation, and propose minimal language extensions that expose MTIA-specific architectural features. We demonstrate that Triton-MTIA kernels achieve performance competitive with expert-tuned C++ implementations. Leveraging these development efficiency gains, we successfully deployed manually written and Inductor-generated Triton kernels in production across approximately 60 different model types, accounting for 50% of layers and 47% of non-GEMM execution time for these models. Our results provide compelling evidence that DSLs like Triton can bridge the programming model gaps between ML frameworks, kernels, and custom accelerators, enabling rapid innovation and efficient deployment at scale.", "authors": [ "Haishan Zhu", "Domi Yan", "Michael Levesque-Dion", "Changxu Zhang", "Mitch Gamburg", "Kirsten Lee", "Giancarlo Colmenares", "Aditya Bhagwat", "Arnab De", "Markus Le Roux", "Victor Perez Carrasco", "Xin Tong", "Will Cromar", "Simran Barnwal", "Andrew Uderian", "Sridhar Gopinath", "Jan Szczepaniec", "Daniel Neilson", "Blaine Burton Rister", "Jordan Fix", "Jazlyn Li", "Zejun Huang", "Lite Ye", "Nan Zhang", "Xinchen Guo", "Andiry Xu", "Michael Roberts", "Kunming Ho", "Site Cao", "Suryadev Sahadevan Rajesh", "Tristan Trouwen", "Mike Tsai", "Jake Lee", "Wayne Su", "Yuhan Chen", "Xiaolong Xie", "David Eklov", "Aaron Barnes", "Max Bremer", "Adam Belay", "Shintaro Iwasaki", "Roman Levenstein", "Ajit Mathews" ], "year": 2026, "published_date": "2026-08-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.00325", "pdf_url": "https://arxiv.org/pdf/2608.00325", "citations": 0, "topics": [], "tags": [ "Code Generation", "Programming Languages" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.6, "read_first_score": 5.68, "content_potential_score": 1.84, "interestingness_score": 2.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The rapid growth in machine learning workloads has fueled the proliferation of custom accelerator architectures. Designed from the ground up, these accelerators often expose programming models that are distinct from GPUs.", "key_contribution": "In this work, we present the first production-scale application of Triton on a custom ML accelerator, MTIA-2i, developed by Meta.", "why_it_matters": "Triton for MTIA: Bridging the Programming Model Gaps for Custom AI Accelerators represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Code Generation.", "one_line_takeaway": "In this work, we present the first production-scale application of Triton on a custom ML accelerator, MTIA-2i,…", "biggest_caveat": "but its viability on accelerators with different programming models has yet to be established.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Code Generation.", "url": "https://arxiv.org/abs/2608.00325", "difficulty": "intermediate" }, { "id": "arxiv:2506.06597", "source": "arxiv", "source_type": "preprint", "title": "No TPU Left Behind: Retrofitting Side-Channel Protection into Edge TPUs", "abstract": "Side-channel attacks can recover neural network parameters from physical signals, even on commercial edge accelerators. Existing defenses require changes to hardware, instruction set, or compiler, and cannot be deployed on fixed-function platforms such as TPUs. We present the first training-time defense that protects models on off-the-shelf TPUs without modifying the hardware or firmware. Our approach trains multiple functionally equivalent parameter versions per layer and randomly composes them at inference. This reduces the correlation that side-channel attacks rely on while preserving model accuracy. We enforce diversity between parameter versions by adding a regularization term in the loss function during training. We show that this diversity increases leakage variance while leaving the mean signal unchanged, which provably reduces the signal-to-noise ratio exploited by attackers. We derive theoretical bounds that relate leakage to the number of parameter versions and their pairwise distance, and provide a simple calibration method to predict leakage for new configurations before deployment or side-channel measurements. We implement our method on a Google Edge TPU and evaluate it on representative and real-world models. Our defense, in a high-diversity configuration, can hide leakage by reducing the Test Vector Leakage Assessment t-score below the standard leakage detection threshold of 4.5 for the majority of a neural network, with less than 1% accuracy change and moderate overhead. Our results thus show, for the first time, that training-time defenses can provide practical side-channel protection for widely deployed AI hardware.", "authors": [ "Ashley Kurian", "Anuj Dubey", "Modini Ayyagari", "Aydin Aysu" ], "year": 2026, "published_date": "2026-06-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2506.06597", "pdf_url": "https://arxiv.org/pdf/2506.06597", "citations": 0, "topics": [], "tags": [ "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.6, "read_first_score": 5.88, "content_potential_score": 1.84, "interestingness_score": 2.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Side-channel attacks can recover neural network parameters from physical signals, even on commercial edge accelerators. Existing defenses require changes to hardware, instruction set, or compiler, and cannot be deployed on fixed-function platforms such as TPUs.", "key_contribution": "We present the first training-time defense that protects models on off-the-shelf TPUs without modifying the hardware or firmware.", "why_it_matters": "No TPU Left Behind: Retrofitting Side-Channel Protection into Edge TPUs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Cryptography & Security.", "one_line_takeaway": "We present the first training-time defense that protects models on off-the-shelf TPUs without modifying the hardware or…", "biggest_caveat": "cannot be deployed on fixed-function platforms such as TPUs.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Cryptography & Security.", "url": "https://arxiv.org/abs/2506.06597", "difficulty": "intermediate" }, { "id": "arxiv:2606.07545", "source": "arxiv", "source_type": "preprint", "title": "Reshaping Undergraduate Computer Science Education in the Generative AI Era", "abstract": "Generative AI represents a turning point for Computer Science (CS) education. In recent decades, post-secondary CS education has largely focused on what has been seen as practical software engineering skills: implementation-level programming, debugging, testing, and software design, analysis, and documentation. However, this framing is becoming less tenable as generative AI automates many of these tasks, challenging their centrality in CS education. To keep pace with advances in AI technology, CS curricula should consider a shift toward understanding and verifying AI-generated artifacts. This white paper outlines the findings of two international NUS-Google Workshops in Singapore, where we convened faculty members, industry practitioners, and students, and proposes a strategic response to reshape how CS should be taught at the undergraduate level. Based on the findings, we identify critical skills that must be preserved and those that are becoming less important. By incorporating these skills as \"breadcrumbs,\" we can provide helpful nudges and engaging exercises within the current curriculum, enhancing learning experiences for everyone. We believe that to effectively prepare future computer science graduates, capable of creating, solving problems, and managing, as well as co-creating, artifacts with AI. It is important to consider a shift in curricula. Emphasizing system design, abstraction, and critical evaluation could greatly enhance their education and readiness for the challenges ahead. We propose prerequisites for solutions to reform CS education by fostering AI-native competencies, re-centering fundamental education, enhancing advanced pathways, embracing new pedagogies, and shifting institutional support.", "authors": [ "Yi-Chieh Lee", "Nattapat Boonprakong", "Yugin Tan", "Harold Soh", "Alex Potanin", "Viraj Kumar", "Anoop K. Sinha", "Chen Qian", "Paul Denny", "Mennatallah El-Assady", "Ian Oakley", "Jake Renzella", "Amy Zhang", "Jat Singh", "Wee Sun Lee", "Hsuan-Tien Lin", "Jane L. E", "Anthony Tang", "Margaret M. Burnett", "Sowmya Somanath", "Renwen Zhang", "Vicky Charisi", "Alexandra I. Cristea" ], "year": 2026, "published_date": "2026-05-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.07545", "pdf_url": "https://arxiv.org/pdf/2606.07545", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.6, "read_first_score": 4.71, "content_potential_score": 1.0, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Generative AI represents a turning point for Computer Science (CS) education. In recent decades, post-secondary CS education has largely focused on what has been seen as practical software engineering skills: implementation-level programming, debugging, testing, and software design, analysis, and documentation.", "key_contribution": "We propose prerequisites for solutions to reform CS education by fostering AI-native competencies, re-centering fundamental education, enhancing advanced pathways, embracing new pedagogies, and shifting institutional support.", "why_it_matters": "Reshaping Undergraduate Computer Science Education in the Generative AI Era represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "We propose prerequisites for solutions to reform CS education by fostering AI-native competencies, re-centering…", "biggest_caveat": "However, this framing is becoming less tenable as generative AI automates many of these tasks, challenging their centrality in CS education.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2606.07545", "difficulty": "intermediate" }, { "id": "arxiv:2606.04823", "source": "arxiv", "source_type": "preprint", "title": "R-APS: Compositional Reasoning and In-Context Meta-Learning for Constrained Design via Reflective Adversarial Pareto Search", "abstract": "Large language models (LLMs) are fluent on open-ended tasks, yet in agentic settings, where a system must plan, use tools, and act over extended horizons, fluency does not ensure reliable delivery. We trace this gap to three coupled structural failures: errors propagate without localization, worst-case perturbations go unevaluated, and accumulated knowledge is never invalidated. We argue these share a root cause: abductive, counterfactual, meta-inductive, corrective, and inductive reasoning pull a shared context in incompatible directions. We introduce Reflective Adversarial Pareto Search (R-APS), to our knowledge the first method addressing all three failures jointly via reasoning-mode decomposition, allocating each reasoning mode its own context and orchestrating interaction across three timescales: staged compositional reasoning with a typed validation critic (failure localization), sensitivity-guided counterfactual stress-testing as a first-class Pareto objective (robustness), and meta-inductive rule extraction with explicit invalidation (persistent memory). R-APS requires no fine-tuning and operates on a frozen LLM purely via structured protocol design. We evaluate on planar mechanism synthesis (robotics, prosthetics, mechanical design), with every candidate checked by a kinematic solver. On 32 target trajectories, R-APS delivers robustness certificates 3.5x tighter than uniform-perturbation baselines, 46% faster iterations-to-first-admission, and 2.1x Chamfer-distance reduction over Enum+GA while jointly controlling bar-count and worst-case robustness. Small 4B reasoning-specialized models prove competitive with general-purpose 70B backbones inside the protocol, suggesting structured protocols can partially offset model scale.", "authors": [ "João Pedro Gandarela", "Thiago Rios", "Stefan Menzel", "André Freitas" ], "year": 2026, "published_date": "2026-06-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.04823", "pdf_url": "https://arxiv.org/pdf/2606.04823", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Fine-Tuning", "AI Agents", "Robotics" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.6, "read_first_score": 4.62, "content_potential_score": 1.97, "interestingness_score": 2.79, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models (LLMs) are fluent on open-ended tasks, yet in agentic settings, where a system must plan, use tools, and act over extended horizons, fluency does not ensure reliable delivery. We trace this gap to three coupled structural failures: errors propagate without localization, worst-case perturbations go unevaluated, and accumulated knowledge is never invalidated.", "key_contribution": "We introduce Reflective Adversarial Pareto Search (R-APS), to our knowledge the first method addressing all three failures jointly via reasoning-mode decomposition, allocating each reasoning mode its own context and orchestrating interaction across three timescales: staged compositional reasoning with a typed validation critic (failure localization), sensitivity-guided counterfactual stress-testing as a first-class Pareto objective (robustness), and meta-inductive rule extraction with explicit invalidation (persistent memory).", "why_it_matters": "R-APS: Compositional Reasoning and In-Context Meta-Learning for Constrained Design via Reflective Adversarial Pareto Search represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Reflective Adversarial Pareto Search (R-APS), to our knowledge the first method addressing all three…", "biggest_caveat": "does not ensure reliable delivery.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.04823", "difficulty": "intermediate" }, { "id": "arxiv:2605.22746", "source": "arxiv", "source_type": "preprint", "title": "Plug-in Losses for Evidential Deep Learning: A Simplified Framework for Uncertainty Estimation that Includes the Softmax Classifier", "abstract": "Real-world sensor-based learning systems require uncertainty estimation that is both reliable and computationally efficient. Evidential Deep Learning (EDL) provides single-pass uncertainty estimation by modeling the class probabilities via Dirichlet distributions, where the Dirichlet parameters are predicted by a learned neural network mapping. However, this approach can lead to computational challenges, as Dirichlet expected objectives are more complex than standard supervised learning losses, complicating their analysis and implementation. We address this issue by approximating the objective of the first-order empirical risk minimization problem induced by EDL with a plug-in loss evaluated at the Dirichlet mean and show that, under mild assumptions, the approximation error decays with growing evidence for a broad class of loss functions, including mean-squared error and cross-entropy loss. As a special case, our analysis provides justification for the use of softmax in the context of uncertainty estimation, since under a particular evidence-to-Dirichlet mapping, our framework includes the standard softmax classifier. We validate the proposed simplified objectives on the Google Speech Commands dataset and show that they achieve predictive accuracy and selective prediction performance comparable to classical EDL, while being simpler to implement using standard deep learning losses and training pipelines. To the best of our knowledge, this empirical analysis is the first to obtain coverage-accuracy trade-offs for speech recognition tasks through EDL.", "authors": [ "Berk Hayta", "Hannah Laus", "Simon Mittermaier", "Felix Krahmer" ], "year": 2026, "published_date": "2026-05-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.22746", "pdf_url": "https://arxiv.org/pdf/2605.22746", "citations": 0, "topics": [], "tags": [ "ASR", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Uses cross-entropy — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.6, "read_first_score": 3.82, "content_potential_score": 1.5, "interestingness_score": 2.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Real-world sensor-based learning systems require uncertainty estimation that is both reliable and computationally efficient. Evidential Deep Learning (EDL) provides single-pass uncertainty estimation by modeling the class probabilities via Dirichlet distributions, where the Dirichlet parameters are predicted by a learned neural network mapping.", "key_contribution": "We address this issue by approximating the objective of the first-order empirical risk minimization problem induced by EDL with a plug-in loss evaluated at the Dirichlet mean and show that, under mild assumptions, the approximation error decays with growing evidence for a broad class of loss functions, including mean-squared error and cross-entropy loss.", "why_it_matters": "Plug-in Losses for Evidential Deep Learning: A Simplified Framework for Uncertainty Estimation that Includes the Softmax Classifier represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about ASR.", "one_line_takeaway": "We address this issue by approximating the objective of the first-order empirical risk minimization problem induced by…", "biggest_caveat": "butions, where the Dirichlet parameters are predicted by a learned neural network mapping.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in ASR.", "url": "https://arxiv.org/abs/2605.22746", "difficulty": "advanced" }, { "id": "arxiv:2604.17465v1", "source": "arxiv", "source_type": "preprint", "title": "Language models recognize dropout and Gaussian noise applied to their activations", "abstract": "We provide evidence that language models can detect, localize and, to a certain degree, verbalize the difference between perturbations applied to their activations. More precisely, we either (a) \\emph{mask} activations, simulating \\emph{dropout}, or (b) add \\emph{Gaussian noise} to them, at a target sentence. We then ask a multiple-choice question such as ``\\emph{Which of the previous sentences was perturbed?}'' or ``\\emph{Which of the two perturbations was applied?}''. We test models from the Llama, Olmo, and Qwen families, with sizes between 8B and 32B, all of which can easily detect and localize the perturbations, often with perfect accuracy. These models can also learn, when taught in context, to distinguish between dropout and Gaussian noise. Notably, \\qwenb's \\emph{zero-shot} accuracy in identifying which perturbation was applied improves as a function of the perturbation strength and, moreover, decreases if the in-context labels are flipped, suggesting a prior for the correct ones -- even modulo controls. Because dropout has been used as a training-regularization technique, while Gaussian noise is sometimes added during inference, we discuss the possibility of a data-agnostic ``training awareness'' signal and the implications for AI safety. The code and data are available at \\href{https://github.com/saifh-github/llm-dropout-noise-recognition}{link 1} and \\href{https://drive.google.com/file/d/1es-Sfw_AH9GficeXgeqpy87rocrZZ_PQ/view}{link 2}, respectively.", "authors": [ "Damiano Fornasiere", "Mirko Bronzi", "Spencer Kitts", "Alessandro Palmas", "Yoshua Bengio", "Oliver Richardson" ], "year": 2026, "published_date": "2026-04-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.17465v1", "pdf_url": "https://arxiv.org/pdf/2604.17465v1", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.6, "read_first_score": 3.23, "content_potential_score": 0.0, "interestingness_score": 1.8, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We provide evidence that language models can detect, localize and, to a certain degree, verbalize the difference between perturbations applied to their activations. More precisely, we either (a) \\emph{mask} activations, simulating \\emph{dropout}, or (b) add \\emph{Gaussian noise} to them, at a target sentence.", "key_contribution": "We provide evidence that language models can detect, localize and, to a certain degree, verbalize the difference between perturbations applied to their activations.", "why_it_matters": "Language models recognize dropout and Gaussian noise applied to their activations represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We provide evidence that language models can detect, localize and, to a certain degree, verbalize the difference…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.17465v1", "difficulty": "advanced" }, { "id": "arxiv:2604.12965v1", "source": "arxiv", "source_type": "preprint", "title": "Efficient Retrieval Scaling with Hierarchical Indexing for Large Scale Recommendation", "abstract": "The increase in data volume, computational resources, and model parameters during training has led to the development of numerous large-scale industrial retrieval models for recommendation tasks. However, effectively and efficiently deploying these large-scale foundational retrieval models remains a critical challenge that has not been fully addressed. Common quick-win solutions for deploying these massive models include relying on offline computations (such as cached user dictionaries) or distilling large models into smaller ones. Yet, both approaches fall short of fully leveraging the representational and inference capabilities of foundational models. In this paper, we explore whether it is possible to learn a hierarchical organization over the memory of foundational retrieval models. Such a hierarchical structure would enable more efficient search by reducing retrieval costs while preserving exactness. To achieve this, we propose jointly learning a hierarchical index using cross-attention and residual quantization for large-scale retrieval models. We also present its real-world deployment at Meta, supporting daily advertisement recommendations for billions of Facebook and Instagram users. Interestingly, we discovered that the intermediate nodes in the learned index correspond to a small set of high-quality data. Fine-tuning the model on this set further improves inference performance, and concretize the concept of \"test-time training\" within the recommendation system domain. We demonstrate these findings using both internal and public datasets with strong baseline comparisons and hope they contribute to the community's efforts in developing the next generation of foundational retrieval models.", "authors": [ "Dongqi Fu", "Kaushik Rangadurai", "Haiyu Lu", "Yunchen Pu", "Siyang Yuan", "Minhui Huang", "Yiqun Liu", "Golnaz Ghasemiesfeh", "Xingfeng He", "Fangzhou Xu", "Andrew Cui", "Vidhoon Viswanathan", "Lin Yang", "Liang Wang", "Jiyan Yang", "Chonglin Sun" ], "year": 2026, "published_date": "2026-04-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.12965v1", "pdf_url": "https://arxiv.org/pdf/2604.12965v1", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Model Compression", "Fine-Tuning & PEFT", "Model Compression & Efficiency", "Information Retrieval" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.6, "read_first_score": 7.75, "content_potential_score": 1.84, "interestingness_score": 2.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The increase in data volume, computational resources, and model parameters during training has led to the development of numerous large-scale industrial retrieval models for recommendation tasks. However, effectively and efficiently deploying these large-scale foundational retrieval models remains a critical challenge that has not been fully addressed.", "key_contribution": "To achieve this, we propose jointly learning a hierarchical index using cross-attention and residual quantization for large-scale retrieval models.", "why_it_matters": "Efficient Retrieval Scaling with Hierarchical Indexing for Large Scale Recommendation makes powerful models practical on resource-constrained devices and reduces deployment costs.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "To achieve this, we propose jointly learning a hierarchical index using cross-attention and residual quantization for…", "biggest_caveat": "However, effectively and efficiently deploying these large-scale foundational retrieval models remains a critical challenge that has not been fully addressed.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "http://arxiv.org/abs/2604.12965v1", "difficulty": "intermediate" }, { "id": "arxiv:2502.15761", "source": "arxiv", "source_type": "preprint", "title": "AIvaluateXR: An Evaluation Framework for on-Device AI in XR with Benchmarking Results", "abstract": "The deployment of large language models (LLMs) on extended reality (XR) devices has great potential to advance the field of human-AI interaction. In the case of direct, on-device model inference, selecting the appropriate model and device for specific tasks remains challenging. In this paper, we present AIvaluateXR, a comprehensive evaluation framework for benchmarking LLMs running on XR devices. To demonstrate the framework, we deploy 17 selected LLMs across four XR platforms: Magic Leap 2, Meta Quest 3, Vivo X100s Pro, and Apple Vision Pro, and conduct an extensive evaluation. Our experimental setup measures four key metrics: performance consistency, processing speed, memory usage, and battery consumption. For each of the 68 model-device pairs, we assess performance under varying string lengths, batch sizes, and thread counts, analyzing the trade-offs for real-time XR applications. We propose a unified evaluation method based on the 3D Pareto Optimality theory to select the optimal device-model pairs from quality and speed objectives. Additionally, we compare the efficiency of on-device LLMs with client-server and cloud-based setups, and evaluate their accuracy on two interactive tasks. We believe our findings offer valuable insight to guide future optimization efforts for LLM deployment on XR devices. Our evaluation method can be used as standard groundwork for further research and development in this emerging field. The source code and supplementary materials are available at: www.nanovis.org/AIvaluateXR.html", "authors": [ "Dawar Khan", "Xinyu Liu", "Omar Mena", "Donggang Jia", "Alexandre Kouyoumdjian", "Ivan Viola" ], "year": 2026, "published_date": "2026-05-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2502.15761", "pdf_url": "https://arxiv.org/pdf/2502.15761", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Artificial Intelligence", "Computer Graphics", "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.6, "read_first_score": 6.29, "content_potential_score": 3.52, "interestingness_score": 3.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The deployment of large language models (LLMs) on extended reality (XR) devices has great potential to advance the field of human-AI interaction. In the case of direct, on-device model inference, selecting the appropriate model and device for specific tasks remains challenging.", "key_contribution": "In this paper, we present AIvaluateXR, a comprehensive evaluation framework for benchmarking LLMs running on XR devices.", "why_it_matters": "AIvaluateXR: An Evaluation Framework for on-Device AI in XR with Benchmarking Results represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this paper, we present AIvaluateXR, a comprehensive evaluation framework for benchmarking LLMs running on XR devices.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2502.15761", "difficulty": "beginner" }, { "id": "arxiv:2608.24037", "source": "arxiv", "source_type": "preprint", "title": "Curved Inference II: Sleeper Agent Geometry - Extending Interpretability Beyond Probes", "abstract": "This paper extends Anthropic's Sleeper Agents research [1], which showed artificial backdoors persist through safety training & can be detected by linear probes with >99% accuracy [2]. However, probe-based detection relies on linear separability that may be an artefact of backdoor insertion rather than a property of naturally occurring deceptive alignment. Sophisticated deceptive behaviours emerging through natural training are unlikely to produce such convenient linear signals. We introduce a naturalistic methodology using multi-turn context windows that simulates realistic deceptive reasoning without artificial triggers or supervised backdoor insertion. Rather than binary trigger-response patterns, we examine how semantic complexity emerges through gradual context development. Building on our Curved Inference framework, we analyse curvature, salience, & introduce semantic surface area (A'), a new metric of representational work capturing both the magnitude & directional change of meaning construction in unnormalised residual space. Without backdoors, labels, or probes, we apply this framework to naturalistic deceptive prompts & classify model outputs via LLM consensus. Geometric structure reliably predicts semantic classification, with statistically significant differences in surface area across five prompt strategies & two model families. Critically, measurement precision can reveal geometric signatures hidden by classification noise - some strategies improve from non-significant (p = 0.555) to significant (p = 0.048). This validates that sophisticated reasoning creates intrinsic geometric patterns that persist even when detection appears to fail, suggesting the shape of inference itself encodes semantic patterns regardless of whether models have learned to suppress linear indicators of deception - a scalable, unsupervised path for detection when linear methods fail.", "authors": [ "Rob Manson" ], "year": 2026, "published_date": "2026-08-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.24037", "pdf_url": "https://arxiv.org/pdf/2608.24037", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Long Context", "AI Safety", "Interpretability" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.59, "read_first_score": 4.12, "content_potential_score": 1.0, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper extends Anthropic's Sleeper Agents research [1], which showed artificial backdoors persist through safety training & can be detected by linear probes with >99% accuracy [2]. However, probe-based detection relies on linear separability that may be an artefact of backdoor insertion rather than a property of naturally occurring deceptive alignment.", "key_contribution": "We introduce a naturalistic methodology using multi-turn context windows that simulates realistic deceptive reasoning without artificial triggers or supervised backdoor insertion.", "why_it_matters": "Curved Inference II: Sleeper Agent Geometry - Extending Interpretability Beyond Probes represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce a naturalistic methodology using multi-turn context windows that simulates realistic deceptive reasoning…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.24037", "difficulty": "advanced" }, { "id": "arxiv:2608.09867", "source": "arxiv", "source_type": "preprint", "title": "Stealing Reasoning Traces from Proprietary LLM APIs", "abstract": "Leading large language model providers now conceal their models' step-by-step reasoning, or chain-of-thought, to protect intellectual property and limit information leakage. Rather than storing these traces server-side, providers return them to the client as blocks of encrypted text, which the client passes back with each subsequent request. Building on prior research, we identify an architectural vulnerability: these encrypted blocks are fully compatible and interchangeable across different sessions, users, and models within a provider's ecosystem. We exploit this compatibility to develop a scalable decryption jailbreak. By injecting an encrypted reasoning trace from a given model into a weaker, and less safeguarded model from the same provider, we force it to decode and output the trace verbatim in plaintext, without ever jailbreaking the more capable model directly. This vulnerability enables four distinct attack vectors. First, it circumvents anti-distillation mechanisms, allowing adversaries to extract a proprietary model's reasoning, as we demonstrate across Anthropic, OpenAI, and Google. Second, it allows for large-scale private data extraction. Developers frequently share session logs publicly, unaware of contents of the encrypted blocks. By decoding 315,320 reasoning blocks scraped from public repositories, we recovered 367 Personally Identifiable Information (PII) artifacts and 182 credentials. Third, it inadvertently reveals hazardous information hidden within the reasoning process, even in cases where the model's final, visible output safely rejects a malicious request. Fourth, attackers can leverage this flaw to execute invisible prompt injections, embedding malicious payloads entirely within encrypted blocks to poison public agentic rollouts. Following responsible disclosure, we propose concrete cryptographic and system-level mitigations to secure client-side reasoning.", "authors": [ "Alexander Panfilov", "David Schmotz", "Ilia Shumailov", "Luca Beurer-Kellner", "Joachim Schaeffer", "Ameya Prabhu", "Jonas Geiping", "Maksym Andriushchenko" ], "year": 2026, "published_date": "2026-08-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.09867", "pdf_url": "https://arxiv.org/pdf/2608.09867", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Safety", "AI Agents", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.59, "read_first_score": 4.8, "content_potential_score": 1.0, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Leading large language model providers now conceal their models' step-by-step reasoning, or chain-of-thought, to protect intellectual property and limit information leakage. Rather than storing these traces server-side, providers return them to the client as blocks of encrypted text, which the client passes back with each subsequent request.", "key_contribution": "First, it circumvents anti-distillation mechanisms, allowing adversaries to extract a proprietary model's reasoning, as we demonstrate across Anthropic, OpenAI, and Google.", "why_it_matters": "Stealing Reasoning Traces from Proprietary LLM APIs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "First, it circumvents anti-distillation mechanisms, allowing adversaries to extract a proprietary model's reasoning, as…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.09867", "difficulty": "advanced" }, { "id": "arxiv:2606.29823", "source": "arxiv", "source_type": "preprint", "title": "Experience Graphs: The Data Foundation for Self-Improving Agents", "abstract": "The database community has repeatedly advanced the state of the art by recognizing that new workloads demand new system architectures. We argue that long-horizon agentic tasks -- code generation, scientific discovery, hardware design -- are such a workload. These agents explore: they generate artifacts, execute tools, observe failures, branch, and repair over hundreds of steps. This search produces a structured object we call an experience graph: executable artifacts, tool outputs, rewards, sibling comparisons, and causal lineage. Yet existing agent frameworks treat this experience as disposable state -- JSON checkpoints and session logs that cannot be recovered after a crash, queried across users, or materialized into training data. We propose Trellis: a data foundation that treats the experience graph as first-class, governed, queryable database state. The core insight is that search over experience graphs is a database access pattern. Frontier selection is a query, cross-session reuse is vector-seeded graph retrieval, training-data extraction is a materialized view, and reconstructing what an agent knew at any past step is a time-travel query. When the database owns the experience graph, agents become stateless compute, and crash recovery, horizontal scaling, and a closed-loop training flywheel emerge as architectural byproducts. We ground the design in KernelEvolve, a production accelerator-kernel optimizer at Meta, where cross-session reuse reaches a target speedup roughly 10x faster at 52% lower token cost. More broadly, Trellis turns inference-time search from disposable computation into a durable institutional asset: logs made databases reliable; experience graphs may make agents cumulative.", "authors": [ "Gang Liao", "Yujia He", "Abdullah Ozturk", "Zhouyang Li", "Ying Wang", "Zhitong Guo", "Hongsen Qin", "Yaobin Qin", "Tao Yang", "Zewei Jiang", "Dianshi Li", "Jort Gemmeke", "Jiangyuan Li", "Liyuan Li", "Nathan Yan", "Masha Basmanova", "Uladzimir Pashkevich", "Matt Steiner", "Pedro Pedreira", "Rob Fergus", "Anirudh Goyal", "Carole-Jean Wu", "Gaoxiang Liu", "Andrew Witten", "Daniel J. Abadi" ], "year": 2026, "published_date": "2026-06-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.29823", "pdf_url": "https://arxiv.org/pdf/2606.29823", "citations": 0, "topics": [], "tags": [ "AI Agents", "Code Generation", "Artificial Intelligence", "Databases", "Multi-Agent Systems" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.59, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The database community has repeatedly advanced the state of the art by recognizing that new workloads demand new system architectures. We argue that long-horizon agentic tasks -- code generation, scientific discovery, hardware design -- are such a workload.", "key_contribution": "We propose Trellis: a data foundation that treats the experience graph as first-class, governed, queryable database state.", "why_it_matters": "Experience Graphs: The Data Foundation for Self-Improving Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We propose Trellis: a data foundation that treats the experience graph as first-class, governed, queryable database…", "biggest_caveat": "cannot be recovered after a crash, queried across users, or materialized into training data.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2606.29823", "difficulty": "intermediate" }, { "id": "arxiv:2502.16759", "source": "arxiv", "source_type": "preprint", "title": "Can Explanations Improve Recommendations? Evidence from Prediction-Informed Explanations", "abstract": "Recommender systems are central to digital platforms, yet they face a fundamental trade-off between accuracy and explainability. Black-box models achieve strong performance but lack interpretability needed for trust and adoption. Existing explainable AI approaches either treat explanations as post-hoc or at the cost of accuracy. We challenge this view, proposing that explanations, when designed as an integral component of a system and aligned with prediction outcomes, can improve both interpretability and performance. We introduce RecPIE (Recommendation with Prediction-Informed Explanations), a framework that jointly optimizes recommendation predictions and natural-language explanations generated by LLMs. RecPIE embeds explanation generation into the learning loop: predictions guide explanation generation (prediction-informed explanations), which are fed back to refine subsequent predictions (explanation-informed predictions) via alternating training. The LLM is fine-tuned using LoRA and reinforcement learning with a customized reward derived from recommendation accuracy. Drawing on multi-environment statistical learning theory, we formally ground why explanation generation and prediction can be mutually reinforcing. We evaluate RecPIE on large-scale point-of-interest recommendation data from Google Maps, where user preferences span diverse place categories. RecPIE improves predictive accuracy by 3-4% over state-of-the-art baselines and matches the best performing model using only 12% of the training data. In human evaluations with 566 participants, RecPIE explanations are preferred 61.5% of the time (versus 16.6% for the best baseline) and rated closer to human-generated explanations. These results reframe explainability not as a constraint on performance but as a design lever for improving AI systems, with implications for trust, data efficiency, and marketplace deployment.", "authors": [ "Yuyan Wang", "Pan Li", "Minmin Chen" ], "year": 2026, "published_date": "2026-05-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2502.16759", "pdf_url": "https://arxiv.org/pdf/2502.16759", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "RL", "Interpretability", "Evaluation" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.59, "read_first_score": 5.33, "content_potential_score": 1.42, "interestingness_score": 2.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recommender systems are central to digital platforms, yet they face a fundamental trade-off between accuracy and explainability. Black-box models achieve strong performance but lack interpretability needed for trust and adoption.", "key_contribution": "Black-box models achieve strong performance but lack interpretability needed for trust and adoption.", "why_it_matters": "Can Explanations Improve Recommendations? Evidence from Prediction-Informed Explanations represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Black-box models achieve strong performance but lack interpretability needed for trust and adoption.", "biggest_caveat": "but lack interpretability needed for trust and adoption.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2502.16759", "difficulty": "beginner" }, { "id": "arxiv:2605.24229", "source": "arxiv", "source_type": "preprint", "title": "How Well Do Models Follow Their Constitutions?", "abstract": "Frontier AI developers now train models against long written behavioral specifications, such as Anthropic's constitution (Anthropic, 2025a) and OpenAI's Model Spec (OpenAI, 2025a), integrated into post-training via methods like character training (Anthropic, 2024) and deliberative alignment (Guan et al., 2024). These documents serve a governance function, but it is unclear how well models actually follow them under adversarial, multi-turn pressure similar to what they would face in real-world deployment. We propose a multi-method audit pipeline that treats each lab's published specification as an auditable target: it decomposes the specification into atomic testable tenets (205 for Anthropic, 197 for OpenAI), generates multi-turn adversarial scenarios with the Petri auditing agent (Anthropic, 2025b), runs a modified SURF-style rubric search (Murray et al., 2026) to catch shallow single-turn failures Petri misses, validates flagged transcripts against the relevant specification, and compares the findings against the lab's own published system card. Applying the pipeline across seven models per specification, we find that models follow their own lab's specification substantially better with each generation. On Anthropic's constitution, the Claude family falls from a 15.0% violation rate (Sonnet 4) to 2.0% (Sonnet 4.6); on OpenAI's Model Spec, the GPT family falls from 11.7% (GPT-4o) to 3.6% (GPT-5.2 medium reasoning), with the severity ceiling falling from 10/10 to 7/10. We cannot externally isolate whether these gains come from specification-specific training, broader post-training improvements, or evaluation awareness. Remaining failures cluster around operator-imposed personas under AI-identity questioning, irreversible action in agentic deployments, and fabricated quantitative claims with false precision.", "authors": [ "Arya Jakkli", "Senthooran Rajamanoharan", "Neel Nanda" ], "year": 2026, "published_date": "2026-05-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.24229", "pdf_url": "https://arxiv.org/pdf/2605.24229", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Safety", "AI Agents", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.59, "read_first_score": 5.62, "content_potential_score": 1.84, "interestingness_score": 2.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Frontier AI developers now train models against long written behavioral specifications, such as Anthropic's constitution (Anthropic, 2025a) and OpenAI's Model Spec (OpenAI, 2025a), integrated into post-training via methods like character training (Anthropic, 2024) and deliberative alignment (Guan et al., 2024). These documents serve a governance function, but it is unclear how well models actually follow them under adversarial, multi-turn pressure similar to what they would face in real-world deployment.", "key_contribution": "We propose a multi-method audit pipeline that treats each lab's published specification as an auditable target: it decomposes the specification into atomic testable tenets (205 for Anthropic, 197 for OpenAI), generates multi-turn adversarial scenarios with the Petri auditing agent (Anthropic, 2025b), runs a modified SURF-style rubric search (Murray et al., 2026) to catch shallow single-turn failures Petri misses, validates flagged transcripts against the relevant specification, and compares the findings against the lab's own published system card.", "why_it_matters": "How Well Do Models Follow Their Constitutions? represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose a multi-method audit pipeline that treats each lab's published specification as an auditable target: it…", "biggest_caveat": "but it is unclear how well models actually follow them under adversarial, multi-turn pressure similar to what they would face in real-world deployment.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.24229", "difficulty": "advanced" }, { "id": "arxiv:2604.12108v1", "source": "arxiv", "source_type": "preprint", "title": "LLM-Based Automated Diagnosis Of Integration Test Failures At Google", "abstract": "Integration testing is critical for the quality and reliability of complex software systems. However, diagnosing their failures presents significant challenges due to the massive volume, unstructured nature, and heterogeneity of logs they generate. These result in a high cognitive load, low signal-to-noise ratio, and make diagnosis difficult and time-consuming. Developers complain about these difficulties consistently and report spending substantially more time diagnosing integration test failures compared to unit test failures. To address these shortcomings, we introduce Auto-Diagnose, a novel diagnosis tool that leverages LLMs to help developers efficiently determine the root cause of integration test failures. Auto-Diagnose analyzes failure logs, produces concise summaries with the most relevant log lines, and is integrated into Critique, Google's internal code review system, providing contextual and in-time assistance. Based on our case studies, Auto-Diagnose is highly effective. A manual evaluation conducted on 71 real-world failures demonstrated 90.14% accuracy in diagnosing the root cause. Following its Google-wide deployment, Auto-Diagnose was used across 52, 635 distinct failing tests. User feedback indicated that the tool was deemed \"Not helpful\" in only 5.8% of cases, and it was ranked #14 in helpfulness among 370 tools that post findings in Critique. Finally, user interviews confirmed the perceived usefulness of Auto-Diagnose and positive reception of integrating automatic diagnostic assistance into existing workflows. We conclude that LLMs are highly successful in diagnosing integration test failures due to their capacity to process and summarize complex textual data. Integrating such AI-powered tooling automatically into developers' daily workflows is perceived positively, with the tool's accuracy remaining a critical factor in shaping developer perception and adoption.", "authors": [ "Celal Ziftci", "Ray Liu", "Spencer Greene", "Livio Dalloro" ], "year": 2026, "published_date": "2026-04-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.12108v1", "pdf_url": "https://arxiv.org/pdf/2604.12108v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Software Engineering", "Artificial Intelligence", "Large Language Models" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.59, "read_first_score": 5.1, "content_potential_score": 1.45, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Integration testing is critical for the quality and reliability of complex software systems. However, diagnosing their failures presents significant challenges due to the massive volume, unstructured nature, and heterogeneity of logs they generate.", "key_contribution": "To address these shortcomings, we introduce Auto-Diagnose, a novel diagnosis tool that leverages LLMs to help developers efficiently determine the root cause of integration test failures.", "why_it_matters": "LLM-Based Automated Diagnosis Of Integration Test Failures At Google advances our understanding of large language models, which are reshaping how we build AI systems and interact with knowledge.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address these shortcomings, we introduce Auto-Diagnose, a novel diagnosis tool that leverages LLMs to help…", "biggest_caveat": "However, diagnosing their failures presents significant challenges due to the massive volume, unstructured nature, and heterogeneity of logs they generate.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.12108v1", "difficulty": "intermediate" }, { "id": "arxiv:2607.23038", "source": "arxiv", "source_type": "preprint", "title": "EGR: Embedding-Native Generative Retrieval with a Shared LLM", "abstract": "Generative retrieval is increasingly popular in large-scale recommendation and advertising systems, yet current methods introduce practical complications. Semantic-ID methods rely on quantization, mutable identifier vocabularies, and token-to-item grounding; embedding-based pipelines train the item encoder separately from the query generator, which limits user-item alignment. We propose EGR, an Embedding-Native Generative Retrieval framework for recommendation and advertising. EGR uses a single shared LLM to learn item representations from item metadata and user representations from interaction histories in one embedding space. Items are indexed directly as dense vectors, and user histories are encoded as dense retrieval queries. Joint contrastive training groups related items and aligns queries with their target items. We evaluate EGR on public benchmarks, industrial data, and live deployment. EGR outperforms published baselines on Amazon Reviews; on Snap DPA, it scales with data, handles cold-start items, and benefits from multimodal input. In production, EGR delivers a +2.91% conversion-rate lift, simplifying system design while improving retrieval quality and ad performance.", "authors": [ "Xiaodong Liu", "Congfei Zhang", "Hsiang-wei Chao", "Siman Wang", "Tong Zhao", "Xiao Bai", "Vincent Zhang", "Jingxiao Ma", "Zhe Liu", "Wenfeng Zhuo", "Zichu Li", "Jitin Krishnan", "Yunzhi Zhou", "Yajun Wang", "Jinchao Li", "Yu Zhang" ], "year": 2026, "published_date": "2026-07-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.23038", "pdf_url": "https://arxiv.org/pdf/2607.23038", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "AI Safety", "Multimodal", "Model Compression" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.58, "read_first_score": 3.71, "content_potential_score": 1.84, "interestingness_score": 2.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Generative retrieval is increasingly popular in large-scale recommendation and advertising systems, yet current methods introduce practical complications. Semantic-ID methods rely on quantization, mutable identifier vocabularies, and token-to-item grounding; embedding-based pipelines train the item encoder separately from the query generator, which limits user-item alignment.", "key_contribution": "Generative retrieval is increasingly popular in large-scale recommendation and advertising systems, yet current methods introduce practical complications.", "why_it_matters": "EGR: Embedding-Native Generative Retrieval with a Shared LLM represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Generative retrieval is increasingly popular in large-scale recommendation and advertising systems, yet current methods…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.23038", "difficulty": "advanced" }, { "id": "arxiv:2607.13837", "source": "arxiv", "source_type": "preprint", "title": "NodeImport: Imbalanced Node Classification with Node Importance Assessment", "abstract": "In real-world applications, node classification on graphs often faces the challenge of class imbalance, where majority classes dominate training, resulting in biased model performance. Traditional GNNs often struggle in such scenarios, as they tend to overfit to majority classes while underrepresenting minority classes. Existing solutions, which either prioritize nodes based on class size or synthesize new nodes for minority classes, often fall short of effectively addressing this imbalance issue. This paper introduces an approach to class-imbalanced node classification by utilizing a balanced meta-set for importance measurement, where a training node is considered significant if it enhances model performance under an unbiased setting. Our method identifies important nodes that can counteract class imbalance and utilizes them for model training, allowing for fine-grained and dynamic node selection throughout the training process. We theoretically derive a formula to directly assess node importance, reducing computational overhead and providing an intuitive threshold for node selection. Guided by this metric, we develop a novel framework that filters valuable labeled, unlabeled, and synthetic nodes that enhance model performance in an unbiased context. A key advantage of this framework is its separation of the synthetic node generation process from the filtering process, ensuring compatibility with various node generation methods. Furthermore, we introduce a strategy to construct a high-quality meta-set that closely approximates the overall feature distribution, ensuring robust representation of each class. We evaluate our framework, NodeImport, across multiple datasets using popular GNN architectures, demonstrating its superiority over existing baselines. Our results highlight the flexibility and effectiveness of the framework in mitigating class imbalance, leading to improved outcomes.", "authors": [ "Nan Chen", "Zemin Liu", "Bryan Hooi", "Bingsheng He", "Jun Hu", "Jia Chen" ], "year": 2026, "published_date": "2026-07-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.13837", "pdf_url": "https://arxiv.org/pdf/2607.13837", "citations": 0, "topics": [], "tags": [ "GNNs", "Fairness & Ethics", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (GNNs) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.57, "read_first_score": 5.17, "content_potential_score": 0.42, "interestingness_score": 1.99, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In real-world applications, node classification on graphs often faces the challenge of class imbalance, where majority classes dominate training, resulting in biased model performance. Traditional GNNs often struggle in such scenarios, as they tend to overfit to majority classes while underrepresenting minority classes.", "key_contribution": "Guided by this metric, we develop a novel framework that filters valuable labeled, unlabeled, and synthetic nodes that enhance model performance in an unbiased context.", "why_it_matters": "NodeImport: Imbalanced Node Classification with Node Importance Assessment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about GNNs.", "one_line_takeaway": "Guided by this metric, we develop a novel framework that filters valuable labeled, unlabeled, and synthetic nodes that…", "biggest_caveat": "bution, ensuring robust representation of each class.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in GNNs.", "url": "https://arxiv.org/abs/2607.13837", "difficulty": "advanced" }, { "id": "arxiv:2606.18132", "source": "arxiv", "source_type": "preprint", "title": "Knowledge Reutilization in Meta-Reinforcement Learning", "abstract": "Meta-reinforcement learning enables fast adaptation by extracting shared structure from related tasks, but existing end-to-end methods often couple task inference with embodiment-specific control. This coupling can obscure non-parametric task semantics, reduce sample efficiency, and limit cross-agent reuse. We propose a meta-knowledge reutilization framework that learns task-level knowledge on a dynamics-simplified agent and transfers it to heterogeneous agents. The framework uses a Bayesian non-parametric prior to organize latent task modes and a high-level policy to generate task-level magnitude guidance. To bridge reusable task knowledge with different embodiments, we introduce a semantic-magnitude interface and a lightweight temporal adaptor, which convert frozen meta-knowledge into temporally aligned subgoals for embodiment-specific low-level controllers. Experiments on multiple locomotion agents show that our framework reduces final-step tracking error by 94.75% -- 99.79% compared with recent state-of-the-art baselines and achieves comparable deployment performance with about 23.8% of their interaction data.", "authors": [ "Yuan Meng", "Bo Wang", "Juan de los Rios Ruiz", "Xiangtong Yao", "Zhenshan Bing", "Fuchun Sun", "Alois Knoll" ], "year": 2026, "published_date": "2026-06-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.18132", "pdf_url": "https://arxiv.org/pdf/2606.18132", "citations": 0, "topics": [], "tags": [ "RL", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.53, "read_first_score": 3.74, "content_potential_score": 1.0, "interestingness_score": 2.26, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Meta-reinforcement learning enables fast adaptation by extracting shared structure from related tasks, but existing end-to-end methods often couple task inference with embodiment-specific control. This coupling can obscure non-parametric task semantics, reduce sample efficiency, and limit cross-agent reuse.", "key_contribution": "We propose a meta-knowledge reutilization framework that learns task-level knowledge on a dynamics-simplified agent and transfers it to heterogeneous agents.", "why_it_matters": "Knowledge Reutilization in Meta-Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "We propose a meta-knowledge reutilization framework that learns task-level knowledge on a dynamics-simplified agent and…", "biggest_caveat": "but existing end-to-end methods often couple task inference with embodiment-specific control.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2606.18132", "difficulty": "frontier" }, { "id": "arxiv:2606.10678v1", "source": "arxiv", "source_type": "preprint", "title": "One Step Closer to Ground Truth: A Multi-Scale Residual-Aware Representation Learning Pipeline for Predicting Time Series Data", "abstract": "Transformer-based models have emerged as leading paradigms in time-series forecasting in recent years, employing self-attention mechanisms to capture long-range dependencies. Despite their success, these single-stage forecasting architectures exhibit persistent systematic residual biases arising from structural discrepancies, unmodeled stochastic components, or inadequate multi-scale temporal representations. This limitation persists when residuals are treated as irreducible noise, precluding adaptive correction of structured error patterns. To address this limitation, we introduce a two-stage, model-agnostic framework that explicitly decouples forecasting and residual learning into distinct stages of representation learning. A base transformer first generates the initial predictions. Subsequently, a dedicated meta-corrector dynamically models structured error patterns across multivariate channels, preserves cross-variable dependencies, and iteratively refines the residual bias of the base transformer. By formalizing this pipeline as a hypothesis space expansion, our framework addresses approximation limitations inherent in single-stage architectures, removes reliance on restrictive assumptions, and enables end-to-end learning of complex error dynamics. Evaluated on eight popular benchmark datasets using established protocols, our approach achieves state-of-the-art performance, with significant improvements in standard metrics (MSE, MAE). The results demonstrate the framework's ability to mitigate systematic biases and enhance robustness to complex temporal dynamics, advancing the practical applicability of transformer-based forecasting models.", "authors": [ "Amrijit Biswas", "Mustafa Kamal", "Robin Krambroeckers", "M. M. Lutfe Elahi", "Sifat Momen", "Nabeel Mohammed", "Shafin Rahman" ], "year": 2026, "published_date": "2026-06-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.10678v1", "pdf_url": "https://arxiv.org/pdf/2606.10678v1", "citations": 0, "topics": [], "tags": [ "Transformers", "Self-Supervised", "Adversarial", "Fairness & Ethics", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.53, "read_first_score": 6.58, "content_potential_score": 1.5, "interestingness_score": 2.51, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Transformer-based models have emerged as leading paradigms in time-series forecasting in recent years, employing self-attention mechanisms to capture long-range dependencies. Despite their success, these single-stage forecasting architectures exhibit persistent systematic residual biases arising from structural discrepancies, unmodeled stochastic components, or inadequate multi-scale temporal representations.", "key_contribution": "To address this limitation, we introduce a two-stage, model-agnostic framework that explicitly decouples forecasting and residual learning into distinct stages of representation learning.", "why_it_matters": "One Step Closer to Ground Truth: A Multi-Scale Residual-Aware Representation Learning Pipeline for Predicting Time Series Data represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "To address this limitation, we introduce a two-stage, model-agnostic framework that explicitly decouples forecasting…", "biggest_caveat": "limitation persists when residuals are treated as irreducible noise, precluding adaptive correction of structured error patterns.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Transformers.", "url": "http://arxiv.org/abs/2606.10678v1", "difficulty": "frontier" }, { "id": "arxiv:2605.13821", "source": "arxiv", "source_type": "preprint", "title": "Harnessing Agentic Evolution", "abstract": "Agentic evolution has emerged as a powerful paradigm for improving programs, workflows, and scientific solutions by iteratively generating candidates, evaluating them, and using feedback to guide future search. However, existing methods are typically instantiated either as fixed hand-designed procedures that are modular but rigid, or as general-purpose agents that flexibly integrate feedback but can drift in long-horizon evolution. Both forms accumulate rich evidence over time, including candidates, feedback, traces, and failures, yet lack a stable interface for organizing this evidence and revising the mechanism that drives future evolution. We address this limitation by formulating agentic evolution as an interactive environment, where the accumulated evolution context serves as a process-level state. We introduce AEvo, a harnessed meta-editing framework in which a meta-agent observes this state and acts not by directly proposing the next candidate, but by editing the procedure or agent context that controls future evolution. This unified interface enables AEvo to steer both procedure-based and agent-based evolution, making accumulated evidence actionable for long-horizon search. Empirical evaluations on agentic and reasoning benchmarks show that AEvo outperforms five evolution baselines, achieving a 26 relative improvement over the strongest baseline. Across three open-ended optimization tasks, AEvo further outperforms four evolution baselines and achieves state-of-the-art performance under the same iteration budget.", "authors": [ "Jiayi Zhang", "Yongfeng Gu", "Jianhao Ruan", "Maojia Song", "Yiran Peng", "Zhiguang Han", "Jinyu Xiang", "Zhitao Wang", "Caiyin Yang", "Yixi Ouyang", "Bang Liu", "Chenglin Wu", "Yuyu Luo" ], "year": 2026, "published_date": "2026-05-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.13821", "pdf_url": "https://arxiv.org/pdf/2605.13821", "citations": 0, "topics": [], "tags": [ "Reasoning", "AI Agents", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.53, "read_first_score": 5.16, "content_potential_score": 0.55, "interestingness_score": 2.04, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agentic evolution has emerged as a powerful paradigm for improving programs, workflows, and scientific solutions by iteratively generating candidates, evaluating them, and using feedback to guide future search. However, existing methods are typically instantiated either as fixed hand-designed procedures that are modular but rigid, or as general-purpose agents that flexibly integrate feedback but can drift in long-horizon evolution.", "key_contribution": "We introduce AEvo, a harnessed meta-editing framework in which a meta-agent observes this state and acts not by directly proposing the next candidate, but by editing the procedure or agent context that controls future evolution.", "why_it_matters": "Harnessing Agentic Evolution represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We introduce AEvo, a harnessed meta-editing framework in which a meta-agent observes this state and acts not by…", "biggest_caveat": "but rigid, or as general-purpose agents that flexibly integrate feedback but can drift in long-horizon evolution.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.13821", "difficulty": "beginner" }, { "id": "arxiv:2602.15473", "source": "arxiv", "source_type": "preprint", "title": "POP: Prior-Fitted First-Order Optimization Policies", "abstract": "Gradient-based optimizers are highly sensitive to design choices in their adaptive learning rate mechanisms. To address this limitation, we introduce POP, a meta-learned Reinforcement Learning (RL) policy that predicts adaptive learning rates for gradient descent, conditioned on the contextual information provided in the optimization trajectory. Our method introduces a novel RL reward formulation, a new function-scaling strategy for in-distribution generalization, and a novel prior that is used to sample millions of synthetic optimization problems. We evaluate POP on an established benchmark including 43 optimization functions of various complexity, where it significantly outperforms gradient-based methods. Our evaluation demonstrates strong generalization capabilities without task-specific tuning.", "authors": [ "Jan Kobiolka", "Christian Frey", "Gresa Shala", "Arlind Kadra", "Erind Bedalli", "Josif Grabocka" ], "year": 2026, "published_date": "2026-05-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.15473", "pdf_url": "https://arxiv.org/pdf/2602.15473", "citations": 0, "topics": [], "tags": [ "RL", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.52, "read_first_score": 4.22, "content_potential_score": 1.5, "interestingness_score": 2.51, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Gradient-based optimizers are highly sensitive to design choices in their adaptive learning rate mechanisms. To address this limitation, we introduce POP, a meta-learned Reinforcement Learning (RL) policy that predicts adaptive learning rates for gradient descent, conditioned on the contextual information provided in the optimization trajectory.", "key_contribution": "To address this limitation, we introduce POP, a meta-learned Reinforcement Learning (RL) policy that predicts adaptive learning rates for gradient descent, conditioned on the contextual information provided in the optimization trajectory.", "why_it_matters": "POP: Prior-Fitted First-Order Optimization Policies represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "To address this limitation, we introduce POP, a meta-learned Reinforcement Learning (RL) policy that predicts adaptive…", "biggest_caveat": "bution generalization, and a novel prior that is used to sample millions of synthetic optimization problems.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2602.15473", "difficulty": "advanced" }, { "id": "arxiv:2605.27972", "source": "arxiv", "source_type": "preprint", "title": "Simultaneous Contact Selection and Planning for Contact-Rich Manipulation with Cascaded Optimization", "abstract": "We propose an optimization-based framework for robust contact-rich manipulation. Recent contact-implicit methods enable online hybrid planning across contact modes, allowing closed-loop manipulation for a given target state and contact location sequence of the robot and object. However, most existing approaches lack the ability to autonomously reason and generate diverse contact location sequences and manipulation trajectories, i.e., active contact location selection, which limits their applicability to relatively simple tasks. Active contact location selection is challenging due to complementarity in contact dynamics and the sparse gradients, making the design of a unified framework for contact selection and planning difficult. To address these challenges, we introduce Simultaneous Contact Selection and Planning (SCSP), a cascaded optimization framework comprising Contact Selection Optimization (CSO) and Contact Planning Optimization (CPO). CSO leverages a surrogate contact model and discrete-continuous optimization to efficiently resolve the nonsmoothness and coupling in contact selection, enabling online global searching of optimal contact locations. CPO performs prior-guided contact planning by evaluating the reference contact locations produced by CSO and generating corresponding manipulation trajectories in real time for redundant manipulators. Extensive simulations and real-world experiments demonstrate that SCSP produces diverse manipulation behaviors and robust control under inaccurate dynamics and perceptual noise. We further validate the generalization of the framework on challenging manipulation tasks. Project website: \\href{https://sites.google.com/view/scsp-robot}{https://sites.google.com/view/scsp-robot}.", "authors": [ "Zhe Zhang", "Xingrong Diao", "Haoxiang Liang", "Han Yang", "Bi-Ke Zhu", "Dandan Zhang", "Jiankun Wang" ], "year": 2026, "published_date": "2026-05-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.27972", "pdf_url": "https://arxiv.org/pdf/2605.27972", "citations": 0, "topics": [], "tags": [ "Robotics" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.52, "read_first_score": 5.26, "content_potential_score": 0.0, "interestingness_score": 1.76, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We propose an optimization-based framework for robust contact-rich manipulation. Recent contact-implicit methods enable online hybrid planning across contact modes, allowing closed-loop manipulation for a given target state and contact location sequence of the robot and object.", "key_contribution": "We propose an optimization-based framework for robust contact-rich manipulation.", "why_it_matters": "Simultaneous Contact Selection and Planning for Contact-Rich Manipulation with Cascaded Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We propose an optimization-based framework for robust contact-rich manipulation.", "biggest_caveat": "However, most existing approaches lack the ability to autonomously reason and generate diverse contact location sequences and manipulation trajectories, i.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2605.27972", "difficulty": "intermediate" }, { "id": "arxiv:2607.11097", "source": "arxiv", "source_type": "preprint", "title": "Revisiting Matching Response and Swept Feature Volumes for Wide-baseline Omnidirectional Stereo", "abstract": "In this paper, we propose a training strategy for confidence estimation in omnidirectional stereo, targeting the ambiguous matches that frequently occur in wide-baseline setups. Reinterpreting the matching responses produced by the 3D encoder decoder block, we show that their expectation values provide intrinsic confidence signals. Building on this, our method directly penalizes ambiguous responses without auxiliary heads, multi-pass inference, or additional modules, resulting in more efficient and generalized predictions. Beyond confidence, we introduce swept feature volume resampling, where response features produced by 3D CNNs are resampled using regressed positive matching indices and then processed by 2D CNNs to predict meta-information such as surface normals. This joint learning introduces auxiliary geometric regularization and improves depth coherence by leveraging additional contextual cues during response aggregation stage. Experimental results demonstrate that our approach enhances both confidence estimation and surface normal prediction while maintaining deployment practicality for autonomous mobility applications.", "authors": [ "Seungjin Jeon", "Jongwoo Lim", "Changhee Won" ], "year": 2026, "published_date": "2026-07-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.11097", "pdf_url": "https://arxiv.org/pdf/2607.11097", "citations": 0, "topics": [], "tags": [ "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.51, "read_first_score": 5.4, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In this paper, we propose a training strategy for confidence estimation in omnidirectional stereo, targeting the ambiguous matches that frequently occur in wide-baseline setups. Reinterpreting the matching responses produced by the 3D encoder decoder block, we show that their expectation values provide intrinsic confidence signals.", "key_contribution": "In this paper, we propose a training strategy for confidence estimation in omnidirectional stereo, targeting the ambiguous matches that frequently occur in wide-baseline setups.", "why_it_matters": "Revisiting Matching Response and Swept Feature Volumes for Wide-baseline Omnidirectional Stereo advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Computer Vision.", "one_line_takeaway": "In this paper, we propose a training strategy for confidence estimation in omnidirectional stereo, targeting the…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Computer Vision.", "url": "https://arxiv.org/abs/2607.11097", "difficulty": "intermediate" }, { "id": "arxiv:2310.15288", "source": "arxiv", "source_type": "preprint", "title": "Active teacher selection for reward learning", "abstract": "Reward learning techniques enable machine learning systems to learn objectives from human feedback. A core limitation of these systems is their assumption that all feedback comes from a single human teacher, despite gathering feedback from large and heterogeneous populations. We propose the Hidden Utility Bandit (HUB) framework to model differences in teacher rationality, expertise, and costliness, formalizing the problem of learning from multiple teachers. We develop a variety of solution algorithms and apply them to two real-world domains: paper recommendation systems and COVID-19 vaccine testing. We find that Active Teacher Selection (ATS) algorithms outperform baselines by actively selecting when and which teacher to query. Our key contributions are 1) the HUB framework: a novel mathematical framework for modeling the teacher selection problem, 2) ATS: an active-learning based algorithmic approach that demonstrates the utility of modeling teacher heterogeneity, and 3) proof-of-concept application of the HUB framework and ATS approaches to model and solve multiple real-world problems with complex trade-offs between reward learning and optimization.", "authors": [ "Rachel Freedman", "Justin Svegliato", "Kyle Wray", "Stuart Russell" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2310.15288", "pdf_url": "https://arxiv.org/pdf/2310.15288", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.51, "read_first_score": 4.24, "content_potential_score": 0.0, "interestingness_score": 1.75, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reward learning techniques enable machine learning systems to learn objectives from human feedback. A core limitation of these systems is their assumption that all feedback comes from a single human teacher, despite gathering feedback from large and heterogeneous populations.", "key_contribution": "We propose the Hidden Utility Bandit (HUB) framework to model differences in teacher rationality, expertise, and costliness, formalizing the problem of learning from multiple teachers.", "why_it_matters": "Active teacher selection for reward learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We propose the Hidden Utility Bandit (HUB) framework to model differences in teacher rationality, expertise, and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2310.15288", "difficulty": "frontier" }, { "id": "arxiv:2609.25427", "source": "arxiv", "source_type": "preprint", "title": "Modular Composition of Inductive Types Using Lean Meta-programming", "abstract": "Inductive types are ubiquitous building blocks in many programming and theorem proving languages. An inductive type is a closed set of constructors from which values of the type can be created. That set cannot be extended though once a type is defined. This limits extensibility, reuse, and modular separation of concerns when defining types and functions operating over their values. This limitation is manifested in the expression problem, where extending an expression language with new syntactic constructors without having to modify or re-compile existing ones is a challenge in almost all programming languages. This paper presents inductive type and function implementation composition algorithms based on meta-programming. In addition, a set of syntactic extensions to the Lean proof assistant implementing those algorithms are presented. This framework allows for modular reuse, composition, and extension of a subset of Lean type and function definitions. In addition, semantic subtyping relations between component and composite types are discussed both at the type theoretic and implementation levels. The framework is demonstrated on a case study, involving the composition of syntactic and semantic artifacts of three sublanguages into one language. The case study highlights both the features and limitations of the composition framework.", "authors": [ "Ramy Shahin" ], "year": 2026, "published_date": "2026-09-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.25427", "pdf_url": "https://arxiv.org/pdf/2609.25427", "citations": 0, "topics": [], "tags": [ "Software Engineering", "Programming Languages" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.41, "content_potential_score": 0.0, "interestingness_score": 1.75, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Inductive types are ubiquitous building blocks in many programming and theorem proving languages. An inductive type is a closed set of constructors from which values of the type can be created.", "key_contribution": "Inductive types are ubiquitous building blocks in many programming and theorem proving languages.", "why_it_matters": "Modular Composition of Inductive Types Using Lean Meta-programming represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Software Engineering.", "one_line_takeaway": "Inductive types are ubiquitous building blocks in many programming and theorem proving languages.", "biggest_caveat": "cannot be extended though once a type is defined.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Software Engineering.", "url": "https://arxiv.org/abs/2609.25427", "difficulty": "frontier" }, { "id": "arxiv:2609.26080", "source": "arxiv", "source_type": "preprint", "title": "The Fleet Is the Model: Engineering Collective Intelligence with Fusion-MoA Pioneer R1", "abstract": "The model exposed to an application need not be a single checkpoint; it can be a governed fleet. Existing serving systems manage checkpoints and replicas, while multi-agent frameworks compose model calls without defining a stable collective identity, effect authority, or member-level evolution. We present Fusion-MoA, a runtime that exposes independently served heterogeneous Cells as one OpenAI-compatible model. A versioned Profile controls membership and evidence admission; read-only Analysts contribute bounded evidence, while a sole Executor retains all final-answer and tool authority. Cells can be qualified, promoted, or rolled back without changing the public API. We evaluate an eight-Cell, three-lineage deployment through three operational witnesses. On a fixed HMMT P1-P10 slice, the collective solves 8/10 problems versus 6/10 for the strongest individual Cell, and a preserved trace shows minority knowledge transferred to three initially incorrect or empty Cells. On 20 Terminal-Bench 2.1 tasks, all tool actions remain attributable to one Executor, with zero Analyst actions and zero bypass effects. Six Cells are promoted and one incompatible candidate is locally rolled back while the service remains available. Fusion-MoA demonstrates that heterogeneous model capability can be operated as one observable, authority-bounded, and independently evolvable service.", "authors": [ "Zongyou Yang", "Yinghan Hou" ], "year": 2026, "published_date": "2026-08-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.26080", "pdf_url": "https://arxiv.org/pdf/2609.26080", "citations": 0, "topics": [], "tags": [ "AI Agents", "Distributed Computing", "Multi-Agent Systems" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.48, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The model exposed to an application need not be a single checkpoint; it can be a governed fleet. Existing serving systems manage checkpoints and replicas, while multi-agent frameworks compose model calls without defining a stable collective identity, effect authority, or member-level evolution.", "key_contribution": "We present Fusion-MoA, a runtime that exposes independently served heterogeneous Cells as one OpenAI-compatible model.", "why_it_matters": "The Fleet Is the Model: Engineering Collective Intelligence with Fusion-MoA Pioneer R1 represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We present Fusion-MoA, a runtime that exposes independently served heterogeneous Cells as one OpenAI-compatible model.", "biggest_caveat": "bute bounded evidence, while a sole Executor retains all final-answer and tool authority.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2609.26080", "difficulty": "intermediate" }, { "id": "arxiv:2609.25498", "source": "arxiv", "source_type": "preprint", "title": "Universal Fractal Natural Language Decision Map: Real-Time Edge Triage Across Heterogeneous Domains", "abstract": "Deploying Large Language Models for runtime operational triage incurs prohibitive latency (>100-500 ms), high VRAM requirements (>4-8 GB), and excessive energy dissipation. Extending Mandelbrot Fractal Neural Synthesis (Dagli et al., 2026), this paper presents the Universal Fractal Natural Language Decision Map, realized via the werr machine-native edge reflex runtime and the production answerr platform (https://answerr.me). Operating entirely without stored weight tensors (0 Bytes VRAM), the engine synthesizes deterministic decisions---noul (Boolean), choice (categorical), and score (ordinal)---by dynamically modulating 24-byte coordinate seeds along the chaotic boundary of the Mandelbrot set and evaluating 4-quadrant escape dynamics. Drawing inspiration from biological System-One reflex arcs, the engine introduces: (i) an Auto-Seed Router with domain projector Phi_D yielding a +28.8% accuracy gain over linear baselines; (ii) an Information-Theoretic Acoustic Damping Filter grounded in token entropy and phonetic spectral density that insulates against prompt injections (0.0% empirical bypass; 95% Wilson CI: [0.0%, 30.8%]) while pruning escape iterations by 45.8% (accelerating throughput 2.5x to 3.31 ms latency); and (iii) an Organic Dynamic Calibration framework using O(1) Exponential Moving Average (EMA, alpha=0.03) and quadrant phase rotation to eliminate positional bias. Benchmarked on bare-metal infrastructure (api.answerr.me:4431) across 1,150+ verified decisions (3,200+ questions) and ranked World #1 on the independent JevBench suite (81.65%), the framework achieves 92.6% macro-accuracy (95% CI: [90.8%, 94.1%]) with 7.08 ms median CPU latency. We provide an OpenAI-compatible API (/v1/chat/completions) and demonstrate feasibility on microcontrollers and 32-byte EVM smart contracts.", "authors": [ "Volkan Dağlı", "Zerrin Dağlı", "Dağhan Dağlı" ], "year": 2026, "published_date": "2026-09-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.25498", "pdf_url": "https://arxiv.org/pdf/2609.25498", "citations": 0, "topics": [], "tags": [ "LLMs", "Model Compression", "Fairness & Ethics", "Evaluation", "Neural Networks" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses information-theoretic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 3.59, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deploying Large Language Models for runtime operational triage incurs prohibitive latency (>100-500 ms), high VRAM requirements (>4-8 GB), and excessive energy dissipation. Extending Mandelbrot Fractal Neural Synthesis (Dagli et al., 2026), this paper presents the Universal Fractal Natural Language Decision Map, realized via the werr machine-native edge reflex runtime and the production answerr platform (https://answerr.me).", "key_contribution": "We provide an OpenAI-compatible API (/v1/chat/completions) and demonstrate feasibility on microcontrollers and 32-byte EVM smart contracts.", "why_it_matters": "Universal Fractal Natural Language Decision Map: Real-Time Edge Triage Across Heterogeneous Domains represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We provide an OpenAI-compatible API (/v1/chat/completions) and demonstrate feasibility on microcontrollers and 32-byte…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.25498", "difficulty": "frontier" }, { "id": "arxiv:2604.22014", "source": "arxiv", "source_type": "preprint", "title": "DM$^3$-Nav: Decentralized Multi-Agent Multimodal Multi-Object Semantic Navigation", "abstract": "We present DM$^3$-Nav, a fully decentralized multi-agent semantic navigation system supporting multimodal open-vocabulary goal specification and multi-object missions. In our setting, decentralization implies operation without a central coordinator, global map aggregation, or shared global state at runtime. Robots operate autonomously and coordinate through ad-hoc pairwise communication, exchanging local maps, goal status, and navigation intent without synchronization. An implicit task allocation mechanism combining intent broadcasting and distance-weighted frontier selection reduces redundant exploration while preserving decentralized operation. Evaluations on HM3DSem scenes using the HM3Dv0.2 and GOAT-Bench datasets demonstrate that DM$^3$-Nav matches or exceeds centralized and shared-map baselines while eliminating single points of failure inherent in centralized architectures. Finally, we validate our approach in a real-world office environment using two mobile robots, demonstrating successful deployment relying entirely on onboard sensing and computation. A video of our real-world experiments is available online: https://drive.google.com/file/d/1QiUSCn5rIvtuTUqtuXLPgmt6S8x9-MCZ/view?usp=drive_link", "authors": [ "Amin Kashiri", "Atharva Jamsandekar", "Yasin Yazıcıoğlu" ], "year": 2026, "published_date": "2026-08-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.22014", "pdf_url": "https://arxiv.org/pdf/2604.22014", "citations": 0, "topics": [], "tags": [ "Multimodal", "Robotics", "Multi-Agent Systems" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.8, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present DM$^3$-Nav, a fully decentralized multi-agent semantic navigation system supporting multimodal open-vocabulary goal specification and multi-object missions. In our setting, decentralization implies operation without a central coordinator, global map aggregation, or shared global state at runtime.", "key_contribution": "We present DM$^3$-Nav, a fully decentralized multi-agent semantic navigation system supporting multimodal open-vocabulary goal specification and multi-object missions.", "why_it_matters": "DM$^3$-Nav: Decentralized Multi-Agent Multimodal Multi-Object Semantic Navigation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We present DM$^3$-Nav, a fully decentralized multi-agent semantic navigation system supporting multimodal…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2604.22014", "difficulty": "intermediate" }, { "id": "arxiv:2608.15424", "source": "arxiv", "source_type": "preprint", "title": "ETHOS: Towards a Modular Ethics Framework for Clinical Multi-Agent Systems", "abstract": "The rapid adoption of large language models has enabled the development of clinical multi-agent systems (MAS) capable of integrating multimodal patient data and supporting increasingly complex clinical decision-making. However, the deployment of these systems in real-world healthcare settings raises critical ethical concerns related to safety, fairness, accountability, transparency, and patient trust. While numerous organizations, including the World Health Organization, the National Academy of Medicine, and the FUTURE-AI consortium, have proposed ethical frameworks and governance principles for healthcare AI, these efforts remain largely conceptual. To address this challenge, we present ETHOS (Ethics and Trust through Hierarchical Oversight System), a modular ethics framework designed as a governance meta-agent that can be integrated with any existing multi-agent system without requiring changes to its underlying architecture. ETHOS translates stakeholder-informed ethical requirements into executable runtime oversight through a layered governance approach consisting of deterministic checks, contextual reviews, and a final ethics critic. These components continuously evaluate intermediate reasoning steps and final outputs, enabling the system to identify ethical risks, request revisions, or suppress responses that fail predefined safety and trustworthiness criteria. We demonstrate ETHOS within a hepatology clinical decision-support MAS. Results show that ETHOS improves decision reliability by detecting incomplete, inconsistent, or out-of-scope evidence and appropriately increasing abstention when safe recommendations cannot be supported. By embedding ethical governance directly into system operation, ETHOS provides a practical and auditable mechanism for transforming high-level AI ethics principles into deployable safeguards.", "authors": [ "Rakesh Sharma", "Sydney Pugh", "Cameron Beeche", "Pankhuri Singhal", "Rachel Wu", "Margaret Eby", "Jeffrey Duda", "James Gee", "Kyra O'Brien", "Hersh Sagreiya", "Marina Serper", "Victoria Gershuni", "Angela Bradbury", "Anurag Verma", "Eric Eaton", "Kevin B. Johnson", "Walter Witschey" ], "year": 2026, "published_date": "2026-08-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.15424", "pdf_url": "https://arxiv.org/pdf/2608.15424", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Multimodal", "Biomedical AI", "Fairness & Ethics" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.36, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The rapid adoption of large language models has enabled the development of clinical multi-agent systems (MAS) capable of integrating multimodal patient data and supporting increasingly complex clinical decision-making. However, the deployment of these systems in real-world healthcare settings raises critical ethical concerns related to safety, fairness, accountability, transparency, and patient trust.", "key_contribution": "To address this challenge, we present ETHOS (Ethics and Trust through Hierarchical Oversight System), a modular ethics framework designed as a governance meta-agent that can be integrated with any existing multi-agent system without requiring changes to its underlying architecture.", "why_it_matters": "ETHOS: Towards a Modular Ethics Framework for Clinical Multi-Agent Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this challenge, we present ETHOS (Ethics and Trust through Hierarchical Oversight System), a modular ethics…", "biggest_caveat": "cannot be supported.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.15424", "difficulty": "intermediate" }, { "id": "arxiv:2608.29170", "source": "arxiv", "source_type": "preprint", "title": "Toward a Cross-Lingual Romanization Ecosystem for Sinitic Languages: A Paired Mandarin-Cantonese Case Study", "abstract": "This paper proposes the Sinitic Romanization Ecosystem, a cross-lingual Sinitic romanization design framework with supporting digital infrastructure and a community-driven open-source workflow. The design framework addresses the lack of systematic cross-lingual romanization alignment among Sinitic languages through four design principles: phonetic correspondence for representing similar sounds with similar romanized symbols, historical-phonological correspondence for aligning cognate romanization strings, one-phoneme-one-symbol, and basic Latin-letter use, with a balancing consideration recognizing trade-offs among these principles. For the main paired case study, we devel-op CantRomZJ1 and MandRomZJ1, Cantonese and Manda-rin romanization schemes following the design framework, respectively. We also develop schemes for several other Sinitic languages, including Meixian Hakka, Shanghai Wu, and Nanjing Jianghuai Mandarin, following the same de-sign framework. To bring the romanization schemes into practical use, we develop open-source infrastructure for structured romanization storage, conversion, parsing, dic-tionary construction, and input-method generation. Finally, we evaluate the design framework through speech-to-romanization experiments based on Meta's Massively Mul-tilingual Speech (MMS) fine-tuning. Compared with the Pinyin+Jyutping baseline, our Man-dRomZJ1+CantRomZJ1 condition reduces Cantonese WER and CER by 7.80% and 10.61%, respectively. These results suggest that cross-lingual romanization alignment can improve transfer in low-resource Sinitic speech technology.", "authors": [ "Zijie Zhang", "Tan Lee", "Yong Cao", "Benyou Wang" ], "year": 2026, "published_date": "2026-08-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.29170", "pdf_url": "https://arxiv.org/pdf/2608.29170", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "AI Safety", "NLP" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 3.87, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper proposes the Sinitic Romanization Ecosystem, a cross-lingual Sinitic romanization design framework with supporting digital infrastructure and a community-driven open-source workflow. The design framework addresses the lack of systematic cross-lingual romanization alignment among Sinitic languages through four design principles: phonetic correspondence for representing similar sounds with similar romanized symbols, historical-phonological correspondence for aligning cognate romanization strings, one-phoneme-one-symbol, and basic Latin-letter use, with a balancing consideration recognizing trade-offs among these principles.", "key_contribution": "This paper proposes the Sinitic Romanization Ecosystem, a cross-lingual Sinitic romanization design framework with supporting digital infrastructure and a community-driven open-source workflow.", "why_it_matters": "Toward a Cross-Lingual Romanization Ecosystem for Sinitic Languages: A Paired Mandarin-Cantonese Case Study represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "This paper proposes the Sinitic Romanization Ecosystem, a cross-lingual Sinitic romanization design framework with…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2608.29170", "difficulty": "advanced" }, { "id": "arxiv:2609.10905", "source": "arxiv", "source_type": "preprint", "title": "Planning along Differentiable Charts of Constraint Manifolds with General-Purpose IK Solvers", "abstract": "Planning trajectories for robot manipulators under kinematic equality constraints restricts feasible motions to a measure-zero submanifold of the configuration space, requiring special algorithmic treatment. A promising strategy is parametrizing the set of feasible configurations using analytic inverse kinematics (IK). Bespoke analytic IK functions can be written to be differentiable, a necessary property for gradient-based trajectory optimization. But the vast majority of IK functions are computed by automated meta-solvers like IKFast, and are difficult to modify for differentiability. We present a new approach for computing gradients of analytic IK parameterizations: we leverage the inverse function theorem to recover the desired gradients from the ordinary forward kinematic Jacobian. Furthermore, we present a least-squares domain extension and an optimization-amenable description of the reachability constraint, which preserves gradient signal outside the reachable workspace. We demonstrate the efficacy of our approach through numerical experiments and downstream tasks, including a hardware demonstration of an RB-Y1 picking up a box and placing it on a table. Project website: https://cohnt.github.io/inverse-function-theorem-parameterization/", "authors": [ "Thomas Cohn", "Seiji Shaw", "Harel Biggie", "Travis Manderson", "Nicholas Roy", "Russ Tedrake" ], "year": 2026, "published_date": "2026-09-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.10905", "pdf_url": "https://arxiv.org/pdf/2609.10905", "citations": 0, "topics": [], "tags": [ "Robotics" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.41, "content_potential_score": 0.05, "interestingness_score": 1.77, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Planning trajectories for robot manipulators under kinematic equality constraints restricts feasible motions to a measure-zero submanifold of the configuration space, requiring special algorithmic treatment. A promising strategy is parametrizing the set of feasible configurations using analytic inverse kinematics (IK).", "key_contribution": "We present a new approach for computing gradients of analytic IK parameterizations: we leverage the inverse function theorem to recover the desired gradients from the ordinary forward kinematic Jacobian.", "why_it_matters": "Planning along Differentiable Charts of Constraint Manifolds with General-Purpose IK Solvers represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We present a new approach for computing gradients of analytic IK parameterizations: we leverage the inverse function…", "biggest_caveat": "But the vast majority of IK functions are computed by automated meta-solvers like IKFast, and are difficult to modify for differentiability.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2609.10905", "difficulty": "frontier" }, { "id": "arxiv:2609.01614", "source": "arxiv", "source_type": "preprint", "title": "RunSoC 2.0: Scheduling and Allocating Automotive Software Tasks to Hardware Partitions in Heterogeneous MPSoCs", "abstract": "Centralized automotive architectures increasingly consolidate compute-intensive workloads onto heterogeneous Multi-Processor System-on-Chip (MPSoC), creating strict execution, memory, and communication constraints. This paper presents RunSoC 2.0, a customizable framework for early-stage design-space exploration of task scheduling and allocation on heterogeneous MPSoCs. Building on RunSoC 1.0, which targeted allocation on homogeneous hardware, RunSoC 2.0 extends the framework to heterogeneous platforms by modeling processor-specific execution times, cluster-level organization, and domain-specific processing properties. It represents task sets as directed acyclic graphs (DAGs) subjected to strict end-to-end latency and core-affinity constraints, and formulates task scheduling and allocation as a multi-objective optimization problem that minimizes hierarchical memory-budget violations and inter-core/inter-cluster communication penalties. The framework supports multiple solving backends, including COIN-OR Branch and Cut (CBC), Google OR-Tools CP-SAT, and a Genetic Algorithm (GA), enabling comparative evaluation of exact, constraint-programming, and meta-heuristic approaches. We evaluate RunSoC 2.0 using synthetic automotive task sets ranging from 10 to 500 tasks, mapped to representative heterogeneous MPSoCs, including the Renesas R-Car V4H, NVIDIA Jetson AGX Orin, and TI TDA4VM. The results show that RunSoC 2.0 can generate feasible and optimal schedules, expose architectural bottlenecks, and support rapid comparison of platform alternatives. Notably, CP-SAT consistently outperforms both CBC and the GA across tightly constrained hard real-time scheduling instances. By incorporating cluster-aware communication and memory modeling, RunSoC 2.0 improves the realism of early-stage MPSoC analysis while retaining practical solution times for large automotive workloads. (..)", "authors": [ "Daniel Krüger", "Lucas Mauser", "Stefan Wagner" ], "year": 2026, "published_date": "2026-06-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.01614", "pdf_url": "https://arxiv.org/pdf/2609.01614", "citations": 0, "topics": [], "tags": [ "Neural Networks" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.68, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Centralized automotive architectures increasingly consolidate compute-intensive workloads onto heterogeneous Multi-Processor System-on-Chip (MPSoC), creating strict execution, memory, and communication constraints. This paper presents RunSoC 2.0, a customizable framework for early-stage design-space exploration of task scheduling and allocation on heterogeneous MPSoCs.", "key_contribution": "The results show that RunSoC 2.0 can generate feasible and optimal schedules, expose architectural bottlenecks, and support rapid comparison of platform alternatives.", "why_it_matters": "RunSoC 2.0: Scheduling and Allocating Automotive Software Tasks to Hardware Partitions in Heterogeneous MPSoCs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Neural Networks.", "one_line_takeaway": "The results show that RunSoC 2.0 can generate feasible and optimal schedules, expose architectural bottlenecks, and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Neural Networks.", "url": "https://arxiv.org/abs/2609.01614", "difficulty": "intermediate" }, { "id": "arxiv:2608.28854", "source": "arxiv", "source_type": "preprint", "title": "Designing, Deployment and Field Testing of C2Stack for Networked Intelligent Software-Defined UAVs", "abstract": "Unmanned Aerial Vehicles (UAVs) are emerging as critical enablers of next-generation wireless networking and autonomous systems. Despite their potential, deploying and testing networked UAV systems in real-world environments remains challenging, largely due to the absence of well-developed, end-to-end, ready-to-use protocol stacks. To fill this gap, we present C2Stack, a configurable protocol stack and experimental framework designed for real-time control, evaluation, and optimization of UAV networks. C2Stack incorporates a modular control plane, referred to as the~C2Stack Network Operating System (CNOS), alongside a programmable data plane that exposes APIs for cross-layer algorithm development, digital twin integration, and autonomous swarm control. In this article, we share our experience with the deployment and testing of C2Stack. We implemented C2Stack on a custom UAV swarm platform that integrates multiprocessor system-on-chip (MPSoC) radios with Intel NUC computing modules, enabling interoperability with various RF front ends. Field trials were conducted in both netted environments and large-scale outdoor test ranges, focusing on two representative use cases: (i) network utility maximization through online reinforcement learning, and (ii) collaborative interference source localization. The experiments demonstrate the feasibility of real-time, data-driven optimization in dynamic aerial environments, while also revealing practical challenges in field deployments of networked UAV systems, including power constraints, sensing limitations, and deployment logistics. We have made C2Stack source code available to the community under the MIT License, with the goal of establishing it as a foundational framework for experimental research on intelligent networked aerial systems.", "authors": [ "Maxwell McManus", "Zhaoxi Zhang", "Sidharth Santhi Nivas", "Yuqing Cui", "Prem Sagar Pattanshetty Vasanth Kumar", "Chenzhi Zhao", "Nicholas Mastronarde", "George Sklivanitis", "Dimitris Pados", "Elizabeth Serena Bentley", "Zhangyu Guan" ], "year": 2026, "published_date": "2026-08-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.28854", "pdf_url": "https://arxiv.org/pdf/2608.28854", "citations": 0, "topics": [], "tags": [ "RL", "Systems & Control" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.61, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Unmanned Aerial Vehicles (UAVs) are emerging as critical enablers of next-generation wireless networking and autonomous systems. Despite their potential, deploying and testing networked UAV systems in real-world environments remains challenging, largely due to the absence of well-developed, end-to-end, ready-to-use protocol stacks.", "key_contribution": "To fill this gap, we present C2Stack, a configurable protocol stack and experimental framework designed for real-time control, evaluation, and optimization of UAV networks.", "why_it_matters": "Designing, Deployment and Field Testing of C2Stack for Networked Intelligent Software-Defined UAVs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "To fill this gap, we present C2Stack, a configurable protocol stack and experimental framework designed for real-time…", "biggest_caveat": "limitations, and deployment logistics.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2608.28854", "difficulty": "advanced" }, { "id": "arxiv:2608.12710", "source": "arxiv", "source_type": "preprint", "title": "Federated Compositional Muon Optimizer for Matrix-Wise Models", "abstract": "Muon, a more recently developed optimizer, is useful for matrix-wise models in AI areas. Although many works have studied Muon and its variants, these methods are still not particularly well-suited for hierarchical structured problems. To fill this gap, we propose an effective federated compositional Muon (FedCoMuon) optimizer to solve distributed matrix-wise compositional optimization problems. Specifically, our FedCoMuon optimizer builds on compositional gradient tracking and orthogonalized momentum. Moreover, we propose a variance reduced variant of FedCoMuon (FedCoMuon-VR) based on a momentum-based variance reduced technique. In theory, we analyze the convergence properties of our algorithms under the non-i.i.d. and non-convex settings. In particular, we prove that our FedCoMuon-VR obtains a lower sample complexity of $O(ε^{-3})$ for finding an $ε$-stationary solution than the existing FedMuon algorithms. Extensive numerical experiments on robust federated learning and task-distributed risk-sensitive meta learning show that our proposed methods are competitive with existing compositional baselines and achieve the best reported accuracy in several settings.", "authors": [ "Wang Yan", "Feihu Huang" ], "year": 2026, "published_date": "2026-08-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.12710", "pdf_url": "https://arxiv.org/pdf/2608.12710", "citations": 0, "topics": [], "tags": [ "Federated Learning", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.38, "content_potential_score": 0.0, "interestingness_score": 1.75, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Muon, a more recently developed optimizer, is useful for matrix-wise models in AI areas. Although many works have studied Muon and its variants, these methods are still not particularly well-suited for hierarchical structured problems.", "key_contribution": "To fill this gap, we propose an effective federated compositional Muon (FedCoMuon) optimizer to solve distributed matrix-wise compositional optimization problems.", "why_it_matters": "Federated Compositional Muon Optimizer for Matrix-Wise Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Federated Learning.", "one_line_takeaway": "To fill this gap, we propose an effective federated compositional Muon (FedCoMuon) optimizer to solve distributed…", "biggest_caveat": "buted matrix-wise compositional optimization problems.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Federated Learning.", "url": "https://arxiv.org/abs/2608.12710", "difficulty": "advanced" }, { "id": "arxiv:2608.13560", "source": "arxiv", "source_type": "preprint", "title": "AutoDesign: Meta-Harness Optimization for Long-Horizon Agentic Design", "abstract": "Transforming multimodal sources into condensed and structured media outputs can be fundamentally conceptualized as a long-horizon agentic process centered on a model-harness system. While an ideal harness system should align with human design priors and accumulate reusable experience through empirical exploration to drive recursive self-improvement, existing paradigms remain static and fall short of this capability. In this paper, we present AutoDesign, a framework that aligns with human design priors, where a meta-harness optimizer guides a code agent to recursively improve harness based on rollout feedback. To instantiate and evaluate this framework, we focus on the academic paper-to-poster generation task and introduce PosterBench, comprising a 100-paper Main Track spanning five disciplines and PosterBench-mini, a shared 10-paper subset for controlled evaluation. On the PosterBench Main Track, AutoDesign achieves the highest score of 78.32, surpassing the closed-source commercial system Claude Design by 7.45 points. Across seven controlled code-agent-model configurations, integrating the learned DesignHarness consistently improves performance, increasing the average PosterBench Score from 54.99 to 67.39 (+12.4%). In a fully autonomous long-horizon loop, it executes 253 tool calls and 11 editing turns within 40 minutes for under $3, reaching average conference-poster quality in human evaluation. A system-blind human study further demonstrates that AutoDesign achieves the highest human preference among evaluated systems.", "authors": [ "Yaxin Luo", "Haobin Jiang", "Jialv Zou", "Xu Huang", "Wenhao Yan", "Haodong Li", "Zhengrong Yue", "Jing Li", "Xiaofu Chen", "Xiaohan Zhao", "Jiacheng Liu", "Jiacheng Cui", "Zhiqiang Shen", "Xiaotong Li" ], "year": 2026, "published_date": "2026-08-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.13560", "pdf_url": "https://arxiv.org/pdf/2608.13560", "citations": 0, "topics": [], "tags": [ "AI Agents", "Multimodal", "Evaluation", "Artificial Intelligence", "NLP" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.84, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Transforming multimodal sources into condensed and structured media outputs can be fundamentally conceptualized as a long-horizon agentic process centered on a model-harness system. While an ideal harness system should align with human design priors and accumulate reusable experience through empirical exploration to drive recursive self-improvement, existing paradigms remain static and fall short of this capability.", "key_contribution": "In this paper, we present AutoDesign, a framework that aligns with human design priors, where a meta-harness optimizer guides a code agent to recursively improve harness based on rollout feedback.", "why_it_matters": "AutoDesign: Meta-Harness Optimization for Long-Horizon Agentic Design represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "In this paper, we present AutoDesign, a framework that aligns with human design priors, where a meta-harness optimizer…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2608.13560", "difficulty": "beginner" }, { "id": "arxiv:2608.10187", "source": "arxiv", "source_type": "preprint", "title": "ConnectionMind: Leveraging Social Networks and Large Language Models for Personalized Recommendation at Meta", "abstract": "Modern recommendation systems on social media platforms such as Meta must model complex social relationships, including friendships, group memberships, and creator interactions, alongside massive and heterogeneous content such as text and video. Traditional recommendation models, however, often omit these signals or treat them independently, lacking the reasoning capability to integrate multi-relational context for fine-grained personalization. We present ConnectionMind, a production-ready recommendation framework that tightly integrates the social network structure with large language models (LLMs) to enable scalable, interpretable, and reasoning-aware personalization in Meta. ConnectionMind constructs a heterogeneous graph connecting users, items, friends, groups, and creator pages, and formulates recommendation as a graph reasoning problem: discovering personalized paths from users to candidate items. An LLM-based policy is employed to reason over these graph structures and guide recommendation decisions. To train the system at scale, ConnectionMind adopts a two-stage learning strategy. We first perform supervised fine-tuning (SFT) on large-scale user-item interaction trajectories to initialize the reasoning policy, followed by end-to-end reinforcement learning (RL) to refine the model's ability to reason over social graphs for personalized recommendation. Extensive experiments on multiple real-world datasets demonstrate the effectiveness of ConnectionMind compared to representative baselines. More importantly, ConnectionMind has been deployed in Meta's large-scale recommendation pipeline and has been evaluated through online A/B tests, achieving a 0.43% improvement in video watch time. These results demonstrate measurable real-world impact in a production recommendation system.", "authors": [ "Haoyu Han", "Yuming Liu", "Lei Huang", "Lizhu Zhang", "Jiliang Tang", "Xiangjun Fan" ], "year": 2026, "published_date": "2026-08-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.10187", "pdf_url": "https://arxiv.org/pdf/2608.10187", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Fine-Tuning", "RL", "Interpretability" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.06, "content_potential_score": 2.26, "interestingness_score": 2.88, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Modern recommendation systems on social media platforms such as Meta must model complex social relationships, including friendships, group memberships, and creator interactions, alongside massive and heterogeneous content such as text and video. Traditional recommendation models, however, often omit these signals or treat them independently, lacking the reasoning capability to integrate multi-relational context for fine-grained personalization.", "key_contribution": "We present ConnectionMind, a production-ready recommendation framework that tightly integrates the social network structure with large language models (LLMs) to enable scalable, interpretable, and reasoning-aware personalization in Meta.", "why_it_matters": "ConnectionMind: Leveraging Social Networks and Large Language Models for Personalized Recommendation at Meta represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present ConnectionMind, a production-ready recommendation framework that tightly integrates the social network…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.10187", "difficulty": "advanced" }, { "id": "arxiv:2511.15941", "source": "arxiv", "source_type": "preprint", "title": "iLTM: Integrated Large Tabular Model", "abstract": "Tabular data underpins decisions across science, industry, and public services. Despite rapid progress, advances in deep learning have not fully carried over to the tabular domain, where gradient-boosted decision trees (GBDTs) remain a default choice in practice. We present iLTM, an integrated Large Tabular Model that unifies tree-derived embeddings, dimensionality-agnostic representations, a meta-trained hypernetwork, multilayer perceptrons (MLPs), and retrieval within a single architecture. Pre-trained on more than 1,800 heterogeneous classification datasets, iLTM achieves consistently superior performance across tabular classification and regression tasks, from small datasets to large and high-dimensional tasks. After light fine-tuning, the meta-trained hypernetwork transfers to regression targets, matching or surpassing strong baselines. Extensive experiments show that iLTM outperforms well-tuned GBDTs and leading deep tabular models while requiring less task-specific tuning. By bridging the gap between tree-based and neural methods, iLTM offers a new framework for tabular foundation models for robust, adaptable, and scalable tabular learning.", "authors": [ "David Bonet", "Marçal Comajoan Cara", "Alvaro Calafell", "Daniel Mas Montserrat", "Alexander G. Ioannidis" ], "year": 2026, "published_date": "2026-08-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.15941", "pdf_url": "https://arxiv.org/pdf/2511.15941", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Structured Data", "Machine Learning", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.25, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Tabular data underpins decisions across science, industry, and public services. Despite rapid progress, advances in deep learning have not fully carried over to the tabular domain, where gradient-boosted decision trees (GBDTs) remain a default choice in practice.", "key_contribution": "We present iLTM, an integrated Large Tabular Model that unifies tree-derived embeddings, dimensionality-agnostic representations, a meta-trained hypernetwork, multilayer perceptrons (MLPs), and retrieval within a single architecture.", "why_it_matters": "iLTM: Integrated Large Tabular Model represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We present iLTM, an integrated Large Tabular Model that unifies tree-derived embeddings, dimensionality-agnostic…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2511.15941", "difficulty": "intermediate" }, { "id": "arxiv:2608.08163", "source": "arxiv", "source_type": "preprint", "title": "Agentic AI-driven Immersive Simulation: A Knowledge-Aware Virtual Training Platform forHigh Dose Rate (HDR) Brachytherapy", "abstract": "The convergence of the Metaverse and Large Language Model (LLM)-based AI agent is catalyzing a shift toward autonomous, immersive, and personalized pedagogical frameworks in medical education. This paper presents a novel agentic AI-driven immersive simulation specifically designed for High Dose Rate (HDR) vaginal cylinder (VC) brachytherapy in cancer care. By integrating Virtual Reality (VR) and mobile computing, the system establishes a high-fidelity, risk-free environment that allows trainees to master complex procedural skills without the facility or safety constraints posed by physical anatomy or live radioactive sources. A core contribution of this work is the seamless integration of a knowledge-aware assistant leveraging Retrieval-Augmented Generation (RAG) to ground agent interactions in authoritative clinical guidelines. This architecture also enables an interactive agent to provide natural language interfaces and hands-free, real-time guidance during intricate medical maneuvers. We validate the proposed system through a prototype deployment comprising a Meta Quest 3 interface linked to a local GPU-accelerated AI backend, demonstrating a feasible architecture for HDR brachytherapy simulation. Experimental results indicate that the system maintains suitable end-to-end latency and high context precision, answer completeness, and relevance in the RAG-enhanced pedagogical support.", "authors": [ "Ronghua Xu", "Kepha Barasa", "Manoj Kumal", "Xinyun Liu", "Weihua Zhou", "Xin Qian" ], "year": 2026, "published_date": "2026-08-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.08163", "pdf_url": "https://arxiv.org/pdf/2608.08163", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "RAG", "Biomedical AI", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.45, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The convergence of the Metaverse and Large Language Model (LLM)-based AI agent is catalyzing a shift toward autonomous, immersive, and personalized pedagogical frameworks in medical education. This paper presents a novel agentic AI-driven immersive simulation specifically designed for High Dose Rate (HDR) vaginal cylinder (VC) brachytherapy in cancer care.", "key_contribution": "This paper presents a novel agentic AI-driven immersive simulation specifically designed for High Dose Rate (HDR) vaginal cylinder (VC) brachytherapy in cancer care.", "why_it_matters": "Agentic AI-driven Immersive Simulation: A Knowledge-Aware Virtual Training Platform forHigh Dose Rate (HDR) Brachytherapy represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "This paper presents a novel agentic AI-driven immersive simulation specifically designed for High Dose Rate (HDR)…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.08163", "difficulty": "intermediate" }, { "id": "arxiv:2608.08920", "source": "arxiv", "source_type": "preprint", "title": "A Domain-Structured Ensemble Framework for Perioperative Outcome Prediction Using Electronic Health Record Data", "abstract": "Perioperative risk prediction models are often limited by narrow surgical populations, incomplete intraoperative data, poor calibration, and limited interpretability. We present a domain-structured ensemble framework for perioperative outcome prediction using routinely collected electronic health record (EHR) data. Predictors are organized into patient-related, surgery-related, and anesthetics-related domains. Domain-specific gradient boosting models generate independent risk estimates that are integrated through a logistic regression meta-learner. We demonstrate the framework using postoperative delirium (POD) in a case-control sample of 5,386 surgical encounters (2,693 cases, 2,693 controls) from a statewide health information exchange. POD required both delirium-related ICD codes and a positive Confusion Assessment Method screening within seven postoperative days; patients with preexisting dementia were excluded. The stacked meta-learner achieved AUROC 0.899 (95% CI: 0.891-0.906), precision-recall AUC 0.881, and Brier score 0.126, compared with AUROC 0.849 for the best single-stage model. Domain ablation showed improved discrimination and calibration over a surgery-only model (AUROC 0.879, Brier 0.140). Temporal validation on held-out post-2017 data yielded AUROC 0.915. Calibration was excellent, with intercept -0.006 (95% CI: -0.083 to 0.070) and slope 1.035 (95% CI: 0.982 to 1.088). Decision curve analysis, corrected for case-control sampling, showed positive net benefit across clinically plausible thresholds. The modular framework supports alternative outcomes, extension of predictor domains, and dynamic risk updating, providing a scalable foundation for interpretable, calibration-aware perioperative clinical decision support.", "authors": [ "Shikhar Shukla", "Cristina Barboi" ], "year": 2026, "published_date": "2026-08-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.08920", "pdf_url": "https://arxiv.org/pdf/2608.08920", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Biomedical AI", "Interpretability", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.29, "content_potential_score": 1.42, "interestingness_score": 2.46, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Perioperative risk prediction models are often limited by narrow surgical populations, incomplete intraoperative data, poor calibration, and limited interpretability. We present a domain-structured ensemble framework for perioperative outcome prediction using routinely collected electronic health record (EHR) data.", "key_contribution": "We present a domain-structured ensemble framework for perioperative outcome prediction using routinely collected electronic health record (EHR) data.", "why_it_matters": "A Domain-Structured Ensemble Framework for Perioperative Outcome Prediction Using Electronic Health Record Data represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We present a domain-structured ensemble framework for perioperative outcome prediction using routinely collected…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2608.08920", "difficulty": "intermediate" }, { "id": "arxiv:2608.06105", "source": "arxiv", "source_type": "preprint", "title": "Does Latent Context Help? A Controlled Evaluation of Inverse Reinforcement Learning in Arctic Shipping", "abstract": "Artificial Intelligence (AI)-assisted navigation can help Arctic shipping adapt to rapidly changing sea-ice conditions, but reliable deployment requires reward models that are interpretable and robust to changing environments. Inverse reinforcement learning (IRL) provides a framework for recovering such rewards from vessel trajectories, while recent meta-IRL methods introduce latent context variables to capture behavioral heterogeneity. However, it remains unclear whether these latent representations recover genuinely hidden preferences or simply re-encode information already available in the observed state. We conduct a controlled evaluation on 3,186 AIS-derived voyages from 202 vessels across nine Arctic shipping seasons, comparing a linear shared reward, a nonlinear shared reward, and a latent-context model built on the same nonlinear architecture. The nonlinear reward improves held-out likelihood by 50.9% over the linear baseline, whereas adding vessel-specific latent context reduces performance by 16.5%. Behavioral analysis, context probes, and a pre-registered feature-hiding ablation show that apparent vessel-level variation is largely explained by observable route and environmental conditions rather than hidden vessel-specific factors. Moreover, predictive accuracy, route fidelity, and reward transfer yield different model rankings, demonstrating that no single metric is sufficient to evaluate learned rewards. These findings motivate testing whether the observed route, environmental, and vessel features already explain behavioral variation before adding per-vessel latent context. This supports more trustworthy AI deployment in safety-critical domains.", "authors": [ "Vaishnav Vaidheeswaran", "Dilith Jayakody", "Biruk Ambaw", "Jaswanth Kumar", "Md Mahbub Alam", "Gabriel Spadon" ], "year": 2026, "published_date": "2026-08-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.06105", "pdf_url": "https://arxiv.org/pdf/2608.06105", "citations": 0, "topics": [], "tags": [ "RLHF", "Adversarial", "Interpretability", "Machine Learning", "Multi-Agent Systems" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 3.32, "content_potential_score": 1.42, "interestingness_score": 2.46, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Artificial Intelligence (AI)-assisted navigation can help Arctic shipping adapt to rapidly changing sea-ice conditions, but reliable deployment requires reward models that are interpretable and robust to changing environments. Inverse reinforcement learning (IRL) provides a framework for recovering such rewards from vessel trajectories, while recent meta-IRL methods introduce latent context variables to capture behavioral heterogeneity.", "key_contribution": "Inverse reinforcement learning (IRL) provides a framework for recovering such rewards from vessel trajectories, while recent meta-IRL methods introduce latent context variables to capture behavioral heterogeneity.", "why_it_matters": "Does Latent Context Help? A Controlled Evaluation of Inverse Reinforcement Learning in Arctic Shipping represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RLHF.", "one_line_takeaway": "Inverse reinforcement learning (IRL) provides a framework for recovering such rewards from vessel trajectories, while…", "biggest_caveat": "but reliable deployment requires reward models that are interpretable and robust to changing environments.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RLHF.", "url": "https://arxiv.org/abs/2608.06105", "difficulty": "advanced" }, { "id": "arxiv:2608.06288", "source": "arxiv", "source_type": "preprint", "title": "Surv-IPTB: An Attention-Based Model for Estimating Individual Probability of Treatment Benefit with Survival Data", "abstract": "This work presents a novel attention-based framework for estimating the Individual Probability of Treatment Benefit (IPTB) in survival analysis contexts. The proposed model, called Surv-IPTB, directly quantifies the probability that a specific patient will experience extended survival time under treatment versus control. We reformulate IPTB estimation as a binary classification problem, leveraging pairwise patient comparisons across treatment and control cohorts. The framework incorporates a principled handling of right-censored observations through imprecise probability representations, where uncertain treatment effects are characterized by interval-valued probabilities. An attention mechanism with learnable query-key transformations enables flexible, data-driven aggregation of pairwise comparisons, while simultaneously learning soft class probabilities for censored cases. Through extensive experiments on synthetic datasets with complex nonlinear structures, including spiral, bell-shaped, and circular feature spaces, we demonstrate that our approach maintains robust performance across varying censoring rates and treatment effect strengths. The model consistently outperforms meta-learner baselines (T-learner and S-learner) equipped with random survival forests, Cox proportional hazards, and Beran estimators, particularly in challenging nonlinear scenarios where conventional methods exhibit significant degradation. The results establish the proposed attention-based framework as a scalable and statistically principled solution for personalized treatment benefit assessment in survival settings. The code implementing the model is publicly available.", "authors": [ "Lev V. Utkin", "Stanislav K. Kogan", "Andrei V. Konstantinov" ], "year": 2026, "published_date": "2026-08-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.06288", "pdf_url": "https://arxiv.org/pdf/2608.06288", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Transformers", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 6.07, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This work presents a novel attention-based framework for estimating the Individual Probability of Treatment Benefit (IPTB) in survival analysis contexts. The proposed model, called Surv-IPTB, directly quantifies the probability that a specific patient will experience extended survival time under treatment versus control.", "key_contribution": "This work presents a novel attention-based framework for estimating the Individual Probability of Treatment Benefit (IPTB) in survival analysis contexts.", "why_it_matters": "Surv-IPTB: An Attention-Based Model for Estimating Individual Probability of Treatment Benefit with Survival Data represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "This work presents a novel attention-based framework for estimating the Individual Probability of Treatment Benefit…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2608.06288", "difficulty": "intermediate" }, { "id": "arxiv:2511.21666", "source": "arxiv", "source_type": "preprint", "title": "Uncertainty Quantification for Visual Object Pose Estimation: S-Lemma Ellipsoidal Bounds", "abstract": "Quantifying the uncertainty of an object's pose estimate is essential for robust control and planning. Although pose estimation is a well-studied robotics problem, attaching statistically rigorous uncertainty is not well understood without strict distributional assumptions. We develop distribution-free pose uncertainty bounds about a given pose estimate in the monocular setting. Our pose uncertainty only requires high probability noise bounds on pixel detections of 2D semantic keypoints on a known object. This noise model induces an implicit, non-convex set of pose uncertainty constraints. Our key contribution is SLUE (S-Lemma Uncertainty Estimation), a convex program to reduce this set to a single ellipsoidal uncertainty bound that is guaranteed to contain the true object pose with high probability. SLUE solves a relaxation of the minimum volume bounding ellipsoid problem inspired by the celebrated S-lemma. It requires no initial guess of the bound's shape or size and is guaranteed to contain the true object pose with high probability. For tighter uncertainty bounds at the same confidence, we extend SLUE to a sum-of-squares relaxation hierarchy which is guaranteed to converge to the minimum volume ellipsoidal uncertainty bound for a given set of keypoint constraints. We show this pose uncertainty bound can easily be projected to independent translation and axis-angle orientation bounds. We evaluate SLUE on two pose estimation datasets and a real-world drone tracking scenario. Compared to prior work, SLUE generates substantially smaller translation bounds and competitive orientation bounds. We release code at https://github.com/MIT-SPARK/PoseUncertaintySets.", "authors": [ "Lorenzo Shaikewitz", "Charis Georgiou", "Luca Carlone" ], "year": 2026, "published_date": "2026-08-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.21666", "pdf_url": "https://arxiv.org/pdf/2511.21666", "citations": 0, "topics": [], "tags": [ "Robotics", "Computer Vision" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses lemma and related concepts.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.62, "content_potential_score": 0.0, "interestingness_score": 1.75, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Quantifying the uncertainty of an object's pose estimate is essential for robust control and planning. Although pose estimation is a well-studied robotics problem, attaching statistically rigorous uncertainty is not well understood without strict distributional assumptions.", "key_contribution": "We show this pose uncertainty bound can easily be projected to independent translation and axis-angle orientation bounds.", "why_it_matters": "Uncertainty Quantification for Visual Object Pose Estimation: S-Lemma Ellipsoidal Bounds advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We show this pose uncertainty bound can easily be projected to independent translation and axis-angle orientation…", "biggest_caveat": "butional assumptions.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2511.21666", "difficulty": "frontier" }, { "id": "arxiv:2604.04468v1", "source": "arxiv", "source_type": "preprint", "title": "What Makes a Sale? Rethinking End-to-End Seller--Buyer Retail Dynamics with LLM Agents", "abstract": "Evaluating retail strategies before deployment is difficult, as outcomes are determined across multiple stages, from seller-side persuasion through buyer-seller interaction to purchase decisions. However, existing retail simulators capture only partial aspects of this process and do not model cross-stage dependencies, making it difficult to assess how early decisions affect downstream outcomes. We present RetailSim, an end-to-end retail simulation framework that models this pipeline in a unified environment, explicitly designed for simulation fidelity through diverse product spaces, persona-driven agents, and multi-turn interactions. We evaluate RetailSim with a dual protocol comprising human evaluation of behavioral fidelity and meta-evaluation against real-world economic regularities, showing that it successfully reproduces key patterns such as demographic purchasing behavior, the price-demand relationship, and heterogeneous price elasticity. We further demonstrate its practical utility via decision-oriented use cases, including persona inference, seller-buyer interaction analysis, and sales strategy evaluation, showing RetailSim's potential as a controlled testbed for exploring retail strategies.", "authors": [ "Jeonghwan Choi", "Jibin Hwang", "Gyeonghun Sun", "Minjeong Ban", "Taewon Yun", "Hyeonjae Cheon", "Hwanjun Song" ], "year": 2026, "published_date": "2026-04-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.04468v1", "pdf_url": "https://arxiv.org/pdf/2604.04468v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Artificial Intelligence", "NLP", "Benchmarking & Evaluation" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.88, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Evaluating retail strategies before deployment is difficult, as outcomes are determined across multiple stages, from seller-side persuasion through buyer-seller interaction to purchase decisions. However, existing retail simulators capture only partial aspects of this process and do not model cross-stage dependencies, making it difficult to assess how early decisions affect downstream outcomes.", "key_contribution": "We present RetailSim, an end-to-end retail simulation framework that models this pipeline in a unified environment, explicitly designed for simulation fidelity through diverse product spaces, persona-driven agents, and multi-turn interactions.", "why_it_matters": "What Makes a Sale? Rethinking End-to-End Seller--Buyer Retail Dynamics with LLM Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present RetailSim, an end-to-end retail simulation framework that models this pipeline in a unified environment,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.04468v1", "difficulty": "beginner" }, { "id": "arxiv:2511.00382", "source": "arxiv", "source_type": "preprint", "title": "Efficiency vs. Alignment: Investigating Safety and Fairness Risks in Parameter-Efficient Fine-Tuning of LLMs", "abstract": "Organizations increasingly adapt Large Language Models (LLMs) from public repositories such as HuggingFace to downstream tasks. Prior work shows that even fine-tuning on benign datasets can weaken safety alignment, raising a practical question: does benign parameter-efficient fine-tuning (PEFT) also affect safety and fairness? We present the first large-scale, systematic study showing that benign PEFT can significantly alter both. We fine-tune four instruction-tuned model families (Meta-Llama-3-8B, Qwen2.5-7B, Mistral-7B, and Gemma-7B) with four widely used PEFT methods: LoRA, IA3, Prompt-Tuning, and P-Tuning. In total, we evaluate 235 conversationally fine-tuned variants across eleven safety hazard categories and nine fairness dimensions. We assess generalization beyond conversational tuning by incorporating a compact extension focused on coding tasks, involving 96 additional fine-tuned models. Results show that benign PEFT can induce detrimental alignment shifts. Adapter-based methods (LoRA, IA3) are generally safer and less disruptive to fairness, whereas prompt-based methods more often reduce safety and worsen fairness accuracy. Base model choice strongly moderates these effects: LLaMA is comparatively stable, Qwen shows modest gains, Gemma exhibits the steepest safety decline, and Mistral is the most variable. The coding-task extension also produces alignment shifts relative to base models, but matched comparisons with the conversational task reveal limited task-level differences. Overall, safety improvements do not reliably transfer to fairness, and no single configuration optimizes every fairness metric. These findings support a practical guideline for safety-critical deployment: benign intent does not guarantee safe behaviour; start from a well-aligned base model, favour adapter-based PEFT, and audit safety and fairness at the category level.", "authors": [ "Mina Taraghi", "Yann Pequignot", "Amin Nikanjam", "Mohamed Amine Merzouk", "Foutse Khomh" ], "year": 2026, "published_date": "2026-08-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.00382", "pdf_url": "https://arxiv.org/pdf/2511.00382", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "AI Safety", "Dialogue", "Fairness & Ethics" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.62, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Organizations increasingly adapt Large Language Models (LLMs) from public repositories such as HuggingFace to downstream tasks. Prior work shows that even fine-tuning on benign datasets can weaken safety alignment, raising a practical question: does benign parameter-efficient fine-tuning (PEFT) also affect safety and fairness?", "key_contribution": "We present the first large-scale, systematic study showing that benign PEFT can significantly alter both.", "why_it_matters": "Efficiency vs. Alignment: Investigating Safety and Fairness Risks in Parameter-Efficient Fine-Tuning of LLMs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present the first large-scale, systematic study showing that benign PEFT can significantly alter both.", "biggest_caveat": "but matched comparisons with the conversational task reveal limited task-level differences.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2511.00382", "difficulty": "advanced" }, { "id": "arxiv:2602.18657", "source": "arxiv", "source_type": "preprint", "title": "DSLean: A Framework for Type-Correct Interoperability Between Lean 4 and External DSLs", "abstract": "Domain-specific languages (DSLs) mediate interactions between interactive proof assistants and external automation, but translating between the prover's internal representation and such DSLs is a tedious engineering chore. To simplify this task, we present DSLean, a framework for bidirectional translation between expressions in the Lean proof assistant and external syntax. DSLean requires only a specification of an external language and its Lean equivalents, abstracting away meta-level implementation details. We demonstrate DSLean's capabilities by implementing three new automation tactics, providing access to external solvers for interval arithmetic, ordinary differential equations, and ring ideal membership.", "authors": [ "Tate Rowney", "Riyaz Ahuja", "Jeremy Avigad", "Sean Welleck" ], "year": 2026, "published_date": "2026-07-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.18657", "pdf_url": "https://arxiv.org/pdf/2602.18657", "citations": 0, "topics": [], "tags": [], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.08, "content_potential_score": 0.0, "interestingness_score": 1.75, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Domain-specific languages (DSLs) mediate interactions between interactive proof assistants and external automation, but translating between the prover's internal representation and such DSLs is a tedious engineering chore. To simplify this task, we present DSLean, a framework for bidirectional translation between expressions in the Lean proof assistant and external syntax.", "key_contribution": "To simplify this task, we present DSLean, a framework for bidirectional translation between expressions in the Lean proof assistant and external syntax.", "why_it_matters": "DSLean: A Framework for Type-Correct Interoperability Between Lean 4 and External DSLs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "To simplify this task, we present DSLean, a framework for bidirectional translation between expressions in the Lean…", "biggest_caveat": "but translating between the prover's internal representation and such DSLs is a tedious engineering chore.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2602.18657", "difficulty": "frontier" }, { "id": "arxiv:2607.23617", "source": "arxiv", "source_type": "preprint", "title": "Optimal Reward Shaping: Autonomous Car Parking Case Study", "abstract": "Designing effective reward functions for model-free reinforcement learning under non-holonomic constraints remains a persistent challenge, often resulting in severe local minima such as policy paralysis or over-conservative hazard avoidance. In this work, we present a parameterized reward shaping framework featuring coverage-gated alignment feedback, drive-direction switch regularization, and an aligned episode termination mechanism evaluated on an autonomous parallel parking task. Crucially, we show that environmental reward parameters and algorithmic hyperparameters are deeply co-dependent, requiring joint meta-optimization to achieve stable convergence. By employing surrogate-based Bayesian optimization, our co-optimized Deep Q-Network (DQN) agent resolves characteristic control failure modes, significantly outperforming uncalibrated baselines across both success rate and trajectory smoothness.", "authors": [ "Emre Özkaya", "Nicolas R. Gauger" ], "year": 2026, "published_date": "2026-07-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.23617", "pdf_url": "https://arxiv.org/pdf/2607.23617", "citations": 0, "topics": [], "tags": [ "AI Safety", "RL", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.64, "content_potential_score": 0.0, "interestingness_score": 1.75, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Designing effective reward functions for model-free reinforcement learning under non-holonomic constraints remains a persistent challenge, often resulting in severe local minima such as policy paralysis or over-conservative hazard avoidance. In this work, we present a parameterized reward shaping framework featuring coverage-gated alignment feedback, drive-direction switch regularization, and an aligned episode termination mechanism evaluated on an autonomous parallel parking task.", "key_contribution": "In this work, we present a parameterized reward shaping framework featuring coverage-gated alignment feedback, drive-direction switch regularization, and an aligned episode termination mechanism evaluated on an autonomous parallel parking task.", "why_it_matters": "Optimal Reward Shaping: Autonomous Car Parking Case Study represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "In this work, we present a parameterized reward shaping framework featuring coverage-gated alignment feedback,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2607.23617", "difficulty": "frontier" }, { "id": "arxiv:2606.18379", "source": "arxiv", "source_type": "preprint", "title": "RankGraph-2: Lifecycle Co-Design for Billion-Node Graph Learning in Recommendation", "abstract": "Graph-based retrieval at billion-node scale requires jointly solving three tightly coupled problems -- graph construction, representation learning, and real-time serving -- yet existing work addresses each in isolation. We present RankGraph-2, a framework deployed at Meta that co-designs all three lifecycle stages for similarity-based retrieval (U2U2I and U2I2I), where each stage's requirements shape the others. Serving requires a co-learned cluster index to avoid expensive online KNN -- this pushes index co-training into the training objective. Training benefits from the observation that similarity-based retrieval tolerates pre-computed neighborhoods, eliminating online graph infrastructure -- this requires construction to produce self-contained data. Construction must also support hour-level refresh for item coverage. Acting on these cascading requirements, RankGraph-2 reduces hundreds of trillions of edges to hundreds of billions via subsampling with popularity bias correction, pre-computes multi-hop neighborhoods via personalized PageRank, and co-learns a residual-quantization cluster index that reduces serving computational cost by 83%. This lifecycle co-design enables a simple architecture to achieve 3.8 x higher recall than a GAT + Deep Graph Infomax model on a bipartite graph and 2.1 x higher than PyTorch-BigGraph on item retrieval. RankGraph-2 delivers up to +0.96% CTR and +2.75% CVR, and has powered 20+ retrieval launches across major surfaces.", "authors": [ "Renzhi Wu", "Zikun Cui", "Junjie Yang", "Tai Guo", "Hong Li", "Xian Chen", "Li Yu", "Ke Pan", "Sri Reddy", "Mahesh Srinivasan", "Nipun Mathur", "Haomin Yu", "Hong Yan" ], "year": 2026, "published_date": "2026-06-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.18379", "pdf_url": "https://arxiv.org/pdf/2606.18379", "citations": 0, "topics": [], "tags": [ "GNNs", "Model Compression", "Self-Supervised", "Fairness & Ethics", "Information Retrieval" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (GNNs) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 3.92, "content_potential_score": 1.84, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Graph-based retrieval at billion-node scale requires jointly solving three tightly coupled problems -- graph construction, representation learning, and real-time serving -- yet existing work addresses each in isolation. We present RankGraph-2, a framework deployed at Meta that co-designs all three lifecycle stages for similarity-based retrieval (U2U2I and U2I2I), where each stage's requirements shape the others.", "key_contribution": "We present RankGraph-2, a framework deployed at Meta that co-designs all three lifecycle stages for similarity-based retrieval (U2U2I and U2I2I), where each stage's requirements shape the others.", "why_it_matters": "RankGraph-2: Lifecycle Co-Design for Billion-Node Graph Learning in Recommendation improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about GNNs.", "one_line_takeaway": "We present RankGraph-2, a framework deployed at Meta that co-designs all three lifecycle stages for similarity-based…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in GNNs.", "url": "https://arxiv.org/abs/2606.18379", "difficulty": "advanced" }, { "id": "arxiv:2607.12658", "source": "arxiv", "source_type": "preprint", "title": "A Strategy Language for Controlled Proof Search", "abstract": "This paper introduces the strategy language of Pgeon, a meta-prover with a clear separation between inference rules and proof search. We give the semantics of strategies as functions over proof states, and of the operators that are used to combine them, allowing for sequential composition, choice, repetition and interleaving of strategies. This language is designed to handle the challenge of fair proof search in semi-decidable logics, where simple depth-first exploration of the proof space is not guaranteed to achieve completeness. We showcase the expressiveness and effectiveness of the approach through case studies in first-order and modal logics.", "authors": [ "Romain Sidhoum", "Simon Robillard", "David Delahaye" ], "year": 2026, "published_date": "2026-07-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.12658", "pdf_url": "https://arxiv.org/pdf/2607.12658", "citations": 0, "topics": [], "tags": [], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 3.47, "content_potential_score": 0.0, "interestingness_score": 1.75, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper introduces the strategy language of Pgeon, a meta-prover with a clear separation between inference rules and proof search. We give the semantics of strategies as functions over proof states, and of the operators that are used to combine them, allowing for sequential composition, choice, repetition and interleaving of strategies.", "key_contribution": "This language is designed to handle the challenge of fair proof search in semi-decidable logics, where simple depth-first exploration of the proof space is not guaranteed to achieve completeness.", "why_it_matters": "A Strategy Language for Controlled Proof Search represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "This language is designed to handle the challenge of fair proof search in semi-decidable logics, where simple…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2607.12658", "difficulty": "frontier" }, { "id": "arxiv:2607.03987", "source": "arxiv", "source_type": "preprint", "title": "Fast Asymptotically Optimal Kinodynamic Planning via Vectorization", "abstract": "Sampling-based motion planners have been shown to be effective for systems with complex kinodynamic constraints and high dimensionality. However, these algorithms struggle to achieve real-time performance, leading to recent efforts to parallelize planning. While GPU-accelerated planners have achieved significant speedups, existing approaches require specialized CUDA programming that limits accessibility and portability. We present Parallel Asymptotically Optimal Kinodynamic RRT (PAKR), a massively parallel kinodynamic planner leveraging JAX and the XLA compiler to achieve GPU acceleration through standard Python tooling. By combining our parallel planner with the AO-x meta-algorithm, we achieve asymptotic optimality through fast iterative replanning. We provide a theoretical analysis of probabilistic completeness, analyze the effects of batch size and branching factor on convergence, and demonstrate scalability to complex dynamics using the MuJoCo-XLA simulator. Experiments show competitive runtimes with state-of-the-art GPU planners and superior solution quality.", "authors": [ "Yitian Gao", "Andrew Lu", "Zachary Kingston" ], "year": 2026, "published_date": "2026-07-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.03987", "pdf_url": "https://arxiv.org/pdf/2607.03987", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Robotics" ], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.09, "content_potential_score": 0.0, "interestingness_score": 1.75, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Sampling-based motion planners have been shown to be effective for systems with complex kinodynamic constraints and high dimensionality. However, these algorithms struggle to achieve real-time performance, leading to recent efforts to parallelize planning.", "key_contribution": "However, these algorithms struggle to achieve real-time performance, leading to recent efforts to parallelize planning.", "why_it_matters": "Fast Asymptotically Optimal Kinodynamic Planning via Vectorization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "However, these algorithms struggle to achieve real-time performance, leading to recent efforts to parallelize planning.", "biggest_caveat": "However, these algorithms struggle to achieve real-time performance, leading to recent efforts to parallelize planning.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2607.03987", "difficulty": "intermediate" }, { "id": "arxiv:2607.07730", "source": "arxiv", "source_type": "preprint", "title": "RetractorDB: A Deterministic Edge Signal Processing Engine Based on Rational Beatty Sequences and Fraenkel's Partition", "abstract": "We present RetractorDB, an open-source edge signal processing engine (ESPE) for regular time series whose query semantics is grounded in the number theory of covering systems. RetractorDB is designed to support, not replace, time-series databases (TSDB) and data stream management systems (DSMS): deployed close to the signal source, it pre-processes and filters high-frequency measurements on the edge device through a declarative signal-processing query language, maintains a partial, correctable record of past and scheduled future events in inspectable artifacts, and transmits exact, deterministic results upstream, so that only reduced, already-processed streams reach the central architecture. The data model is differential (a stream is a pair $(s_n, Δ)$ with a constant rational inter-arrival interval), and the core rate-conversion operators, interleave and de-interleave, are proved to be rational Beatty sequences satisfying the conditions of Fraenkel's partition theorem. This yields an algebra in which resampling is an exact, deterministic, first-class operator: de-interleaving inverts interleaving bit-for-bit using rational arithmetic alone, and algebraic rewrite rules license query-plan optimization without changing results. We describe the end-to-end realization of this algebra in a working engine: declarative query language (RQL), compilation to a dependency DAG with rational interval resolution, slot-based runtime scheduling, and an inspectable artifact format with schema and null/gap metadata. We validate the semantics on deterministic query examples drawn from the engine's integration tests, including a complete Pan-Tompkins QRS-detection pipeline over MIT-BIH ECG data expressed entirely within the algebra. A performance evaluation under a real-time operating environment is in progress and deferred to a subsequent version.", "authors": [ "Michal Widera" ], "year": 2026, "published_date": "2026-07-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.07730", "pdf_url": "https://arxiv.org/pdf/2607.07730", "citations": 0, "topics": [], "tags": [ "Databases" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.62, "content_potential_score": 0.34, "interestingness_score": 1.92, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present RetractorDB, an open-source edge signal processing engine (ESPE) for regular time series whose query semantics is grounded in the number theory of covering systems. RetractorDB is designed to support, not replace, time-series databases (TSDB) and data stream management systems (DSMS): deployed close to the signal source, it pre-processes and filters high-frequency measurements on the edge device through a declarative signal-processing query language, maintains a partial, correctable record of past and scheduled future events in inspectable artifacts, and transmits exact, deterministic results upstream, so that only reduced, already-processed streams reach the central architecture.", "key_contribution": "We present RetractorDB, an open-source edge signal processing engine (ESPE) for regular time series whose query semantics is grounded in the number theory of covering systems.", "why_it_matters": "RetractorDB: A Deterministic Edge Signal Processing Engine Based on Rational Beatty Sequences and Fraenkel's Partition represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Databases.", "one_line_takeaway": "We present RetractorDB, an open-source edge signal processing engine (ESPE) for regular time series whose query…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Databases.", "url": "https://arxiv.org/abs/2607.07730", "difficulty": "frontier" }, { "id": "arxiv:2607.06039", "source": "arxiv", "source_type": "preprint", "title": "Automating Quality Assessment with NLP of LLM-Generated Defeaters", "abstract": "High-integrity systems, such as autonomous vehicle fleets and large-scale energy infrastructures, rely on structured assurance cases to justify safety claims. To remain valid under evolving operational conditions, such cases must be examined against potential challenges, known as defeaters. While large language models (LLMs) can support the scalable generation of candidate defeaters, assessing their quality remains largely manual and subjective process. This paper presents an automated approach for supporting the assessment of LLM-generated defeaters using natural language processing techniques. The method combines structural features from assurance case graphs with semantic embeddings and meta-classifiers trained on expert-assessed defeater annotations. We evaluate the approach through two case studies in the automotive and energy domains. The results show substantial human reviewer dissensus, with Cohen's kappa values below 0.442, highlighting the difficulty of consistent manual assessment. Against this background, the proposed classifiers achieve an average F1-score of 0.84 in validation and show improved alignment with individual expert ratings. The findings suggest that automated assessment can help reduce subjective variance and provide scalable decision support for assurance case review, while leaving final judgment to domain experts.", "authors": [ "Tihomir Rohlinger", "Daniel Ratiu", "Stefan Wagner" ], "year": 2026, "published_date": "2026-07-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.06039", "pdf_url": "https://arxiv.org/pdf/2607.06039", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 3.83, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "High-integrity systems, such as autonomous vehicle fleets and large-scale energy infrastructures, rely on structured assurance cases to justify safety claims. To remain valid under evolving operational conditions, such cases must be examined against potential challenges, known as defeaters.", "key_contribution": "The results show substantial human reviewer dissensus, with Cohen's kappa values below 0.442, highlighting the difficulty of consistent manual assessment.", "why_it_matters": "Automating Quality Assessment with NLP of LLM-Generated Defeaters represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "The results show substantial human reviewer dissensus, with Cohen's kappa values below 0.442, highlighting the…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.06039", "difficulty": "advanced" }, { "id": "arxiv:2510.15686", "source": "arxiv", "source_type": "preprint", "title": "Few-Shot Demonstration-Driven Task Coordination and Trajectory Execution for Multi-Robot Systems", "abstract": "Learning coordinated behaviors for multi-robot systems from only a few demonstrations is difficult because temporal task dependencies and spatial trajectory generation are tightly coupled, which increases the hypothesis space and often yields unstable generalization in data-scarce regimes. We present DDACE, a structured few-shot learning framework that introduces a structural inductive bias by explicitly decoupling temporal coordination from spatial trajectory synthesis. Demonstrations are first processed via spectral clustering to extract coordination structure and form interaction graphs. A Temporal Graph Network predicts action dependencies and sequences, while Gaussian Process models generate progress-parameterized geometric trajectories that adapt to new start/goal configurations. This factorized design reduces hypothesis coupling and improves data efficiency for few-shot multi-robot coordination. Extensive simulation studies and real-robot experiments show that DDACE produces stable coordinated executions from a small number of demonstrations and improves trajectory consistency compared to end-to-end imitation baselines under limited data. Additional materials are available at https://sites.google.com/view/ddace.", "authors": [ "Taehyeon Kim", "Vishnunandan L. N. Venkatesh", "Byung-Cheol Min" ], "year": 2026, "published_date": "2026-07-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.15686", "pdf_url": "https://arxiv.org/pdf/2510.15686", "citations": 0, "topics": [], "tags": [ "Prompting", "Robotics", "Fairness & Ethics" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.86, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Learning coordinated behaviors for multi-robot systems from only a few demonstrations is difficult because temporal task dependencies and spatial trajectory generation are tightly coupled, which increases the hypothesis space and often yields unstable generalization in data-scarce regimes. We present DDACE, a structured few-shot learning framework that introduces a structural inductive bias by explicitly decoupling temporal coordination from spatial trajectory synthesis.", "key_contribution": "We present DDACE, a structured few-shot learning framework that introduces a structural inductive bias by explicitly decoupling temporal coordination from spatial trajectory synthesis.", "why_it_matters": "Few-Shot Demonstration-Driven Task Coordination and Trajectory Execution for Multi-Robot Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We present DDACE, a structured few-shot learning framework that introduces a structural inductive bias by explicitly…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2510.15686", "difficulty": "beginner" }, { "id": "arxiv:2606.25996", "source": "arxiv", "source_type": "preprint", "title": "Autodata: An agentic data scientist to create high quality synthetic data", "abstract": "We introduce Autodata, a general method that enables AI agents to act as data scientists who build high quality training and evaluation data. We show how to train (meta-optimize) such a data scientist agent, so that it learns to create even stronger data. We describe the overall formulation, and a specific practical implementation, Agentic Self-Instruct. We conduct experiments on computer science research tasks, legal reasoning tasks and reasoning with mathematical objects, where we obtain improved results compared to classical synthetic dataset creation methods. Further, meta-optimizing the data scientist agent itself delivers an even larger performance uplift. Agentic data creation provides a way to convert increased inference compute into higher quality model training. Overall, we believe this direction has the potential to change the way we build AI data.", "authors": [ "Ilia Kulikov", "Chenxi Whitehouse", "Tianhao Wu", "Yixin Nie", "Swarnadeep Saha", "Eryk Helenowski", "Weizhe Yuan", "Olga Golovneva", "Jack Lanchantin", "Yoram Bachrach", "Jakob Foerster", "Xian Li", "Han Fang", "Sainbayar Sukhbaatar", "Jason Weston" ], "year": 2026, "published_date": "2026-06-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.25996", "pdf_url": "https://arxiv.org/pdf/2606.25996", "citations": 0, "topics": [], "tags": [ "Reasoning", "AI Agents", "Legal AI", "NLP", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.16, "content_potential_score": 1.5, "interestingness_score": 2.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce Autodata, a general method that enables AI agents to act as data scientists who build high quality training and evaluation data. We show how to train (meta-optimize) such a data scientist agent, so that it learns to create even stronger data.", "key_contribution": "We introduce Autodata, a general method that enables AI agents to act as data scientists who build high quality training and evaluation data.", "why_it_matters": "Autodata: An agentic data scientist to create high quality synthetic data represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We introduce Autodata, a general method that enables AI agents to act as data scientists who build high quality…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2606.25996", "difficulty": "intermediate" }, { "id": "arxiv:2512.22431", "source": "arxiv", "source_type": "preprint", "title": "Monadic Context Engineering", "abstract": "The proliferation of Large Language Models (LLMs) has catalyzed a shift towards autonomous agents capable of complex reasoning and tool use. However, current agent architectures are frequently constructed using imperative, ad hoc patterns. This results in brittle systems plagued by difficulties in state management, error handling, and concurrency. This paper introduces Monadic Context Engineering (MCE), a novel architectural paradigm leveraging the algebraic structures of Functors, Applicative Functors, and Monads to provide a formal foundation for agent design. MCE treats agent workflows as computational contexts where cross-cutting concerns, such as state propagation, short-circuiting error handling, and asynchronous execution, are managed intrinsically by the algebraic properties of the abstraction. We demonstrate how Monads enable robust sequential composition, how Applicatives provide a principled structure for parallel execution, and crucially, how Monad Transformers allow for the systematic composition of these capabilities. This layered approach enables developers to construct complex, resilient, and efficient AI agents from simple, independently verifiable components. We further extend this framework to describe Meta-Agents, which leverage MCE for generative orchestration, dynamically creating and managing sub-agent workflows through metaprogramming.", "authors": [ "Yifan Zhang", "Yang Yuan", "Mengdi Wang", "Andrew Chi-Chih Yao" ], "year": 2026, "published_date": "2026-07-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2512.22431", "pdf_url": "https://arxiv.org/pdf/2512.22431", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "Artificial Intelligence", "NLP" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.09, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The proliferation of Large Language Models (LLMs) has catalyzed a shift towards autonomous agents capable of complex reasoning and tool use. However, current agent architectures are frequently constructed using imperative, ad hoc patterns.", "key_contribution": "This paper introduces Monadic Context Engineering (MCE), a novel architectural paradigm leveraging the algebraic structures of Functors, Applicative Functors, and Monads to provide a formal foundation for agent design.", "why_it_matters": "Monadic Context Engineering represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "This paper introduces Monadic Context Engineering (MCE), a novel architectural paradigm leveraging the algebraic…", "biggest_caveat": "However, current agent architectures are frequently constructed using imperative, ad hoc patterns.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2512.22431", "difficulty": "intermediate" }, { "id": "arxiv:2606.30704", "source": "arxiv", "source_type": "preprint", "title": "From Search to Synthesis: Training LLMs as Zero-Shot Workflow Generators", "abstract": "Large language models (LLMs) excel across a wide range of tasks, yet their instance-specific solutions often lack the structural consistency needed for reliable deployment. Workflows that encode recurring algorithmic patterns at the task level provide a principled framework, offering robustness across instance variations, interpretable traces for debugging, and reusability across problem instances. However, manually designing such workflows requires significant expertise and effort, limiting their broader application. While automatic workflow generation could address this bottleneck, existing methods either produce instance-specific solutions without learning task-level patterns, or cannot generalize beyond their training configurations. We present MetaFlow, which casts workflow generation as a meta-learning problem: given a task and an operator set, the model learns to compose solution strategies. MetaFlow trains in two stages: supervised fine-tuning on synthetic workflow data, followed by reinforcement learning with verifiable rewards (RLVR) that uses execution feedback across problem instances in the task to improve end-to-end success. The resulting model produces effective workflows for trained tasks and exhibits strong generalization to untrained tasks and novel operator sets. Across benchmarks in question answering, code generation, and mathematical reasoning, MetaFlow achieves performance comparable to state-of-the-art baselines on in-domain tasks with single inference, while demonstrating remarkable zero-shot generalization capabilities on out-of-domain tasks and operator sets.", "authors": [ "Gan Luo", "Zihan Qin", "Bin Dong", "Wotao Yin" ], "year": 2026, "published_date": "2026-06-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.30704", "pdf_url": "https://arxiv.org/pdf/2606.30704", "citations": 0, "topics": [], "tags": [ "Reasoning", "Fine-Tuning", "QA", "RL", "Code Generation" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.14, "content_potential_score": 1.97, "interestingness_score": 2.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models (LLMs) excel across a wide range of tasks, yet their instance-specific solutions often lack the structural consistency needed for reliable deployment. Workflows that encode recurring algorithmic patterns at the task level provide a principled framework, offering robustness across instance variations, interpretable traces for debugging, and reusability across problem instances.", "key_contribution": "We present MetaFlow, which casts workflow generation as a meta-learning problem: given a task and an operator set, the model learns to compose solution strategies.", "why_it_matters": "From Search to Synthesis: Training LLMs as Zero-Shot Workflow Generators represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We present MetaFlow, which casts workflow generation as a meta-learning problem: given a task and an operator set, the…", "biggest_caveat": "However, manually designing such workflows requires significant expertise and effort, limiting their broader application.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2606.30704", "difficulty": "beginner" }, { "id": "arxiv:2606.19695", "source": "arxiv", "source_type": "preprint", "title": "A Unified Framework for Joint Sensor Placement and Scheduling for Intrusion Detection", "abstract": "We consider an intrusion detection task in which a defender must jointly optimize sensor placement locations and orientations to minimize the probability of missed detection of an intruder traversing a protected environment. We decompose this problem into a meta problem, termed SensorPlacement, and an embedded subproblem, termed OrientationScheduling. The OrientationScheduling subproblem, for a fixed sensor placement, is modeled as a 2-player zero-sum game between the defender and the intruder, where the defender seeks an orientation strategy for the deployed sensors to minimize the probability of missed detection, while the intruder seeks a path selection strategy to maximize it. Since the defender's strategy space grows combinatorially with the number of sensors and orientations, solving the game via standard linear programming becomes prohibitive. To this end, we develop an iterative and efficient equilibrium-seeking algorithm that exploits the structure of the game's payoff function and establishes theoretical guarantees for convergence to the Nash equilibrium (NE) of the game. This NE value is then used as a utility measure in the SensorPlacement meta problem. We show that this game-value-based utility function is weakly submodular over the set of sensor placements and propose a greedy placement algorithm with near-optimality guarantees. To our knowledge, this is the first unified framework to integrate game-theoretic utility design with (weak) submodular optimization, enabling principled joint optimization of sensor placement and orientation scheduling. Through extensive simulations, we demonstrate that the proposed approach achieves near-optimal detection performance while significantly reducing computation time compared to baselines.", "authors": [ "Jayanth Bhargav", "Mahsa Ghasemi", "Shreyas Sundaram" ], "year": 2026, "published_date": "2026-06-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.19695", "pdf_url": "https://arxiv.org/pdf/2606.19695", "citations": 0, "topics": [], "tags": [ "Game Theory", "Systems & Control" ], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 6.4, "content_potential_score": 0.0, "interestingness_score": 1.75, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We consider an intrusion detection task in which a defender must jointly optimize sensor placement locations and orientations to minimize the probability of missed detection of an intruder traversing a protected environment. We decompose this problem into a meta problem, termed SensorPlacement, and an embedded subproblem, termed OrientationScheduling.", "key_contribution": "We show that this game-value-based utility function is weakly submodular over the set of sensor placements and propose a greedy placement algorithm with near-optimality guarantees.", "why_it_matters": "A Unified Framework for Joint Sensor Placement and Scheduling for Intrusion Detection represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Game Theory.", "one_line_takeaway": "We show that this game-value-based utility function is weakly submodular over the set of sensor placements and propose…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Game Theory.", "url": "https://arxiv.org/abs/2606.19695", "difficulty": "intermediate" }, { "id": "arxiv:2606.15513", "source": "arxiv", "source_type": "preprint", "title": "A Prototypical Decision-Support Tool for Household Energy Management: A New Zealand Case Study", "abstract": "This paper presents the system architecture and operating logic of The Home-Energy Check-Up (New Zealand), a web-based public decision-support prototype designed to help New Zealand households identify avoidable energy-cost leakage, complete a short guided home inspection, and generate a prioritized behavior-first energy roadmap. The application is implemented as a single-file Python Streamlit system with session-state navigation, a household input dataclass, conservative low-high saving estimators, a seven-check inspection layer, a recommendation-ranking layer, visual analytics, anonymous Google Sheets persistence, downloadable reports, and a certificate-of-completion interface. The system does not claim to be a certified energy audit, New Zealand Building Code H1 verification method, Healthy Homes compliance statement, or guaranteed bill-forecasting engine. Instead, it operationalizes a practical educational workflow: start with money, collect only the minimum required household profile, convert user answers into a score and action set, estimate annual savings using transparent formulas, and convert behavior savings into a staged save-to-upgrade pathway. The manuscript details the front-end, state-management, calculation, data-storage, visualization, recommendation, deployment, privacy, and limitation layers of the prototype. It also identifies research-grade improvements required before the tool is used for validated impact assessment, including external validation against measured energy data, robust concurrent data writes, clearer uncertainty calibration, accessibility testing, and formal user evaluation. The contribution is a reproducible architecture for translating household energy advice into an interactive, gamified, data-light decision-support pathway for New Zealand homes.", "authors": [ "Abdollah Baghaei Daemei" ], "year": 2026, "published_date": "2026-06-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.15513", "pdf_url": "https://arxiv.org/pdf/2606.15513", "citations": 0, "topics": [], "tags": [ "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.65, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper presents the system architecture and operating logic of The Home-Energy Check-Up (New Zealand), a web-based public decision-support prototype designed to help New Zealand households identify avoidable energy-cost leakage, complete a short guided home inspection, and generate a prioritized behavior-first energy roadmap. The application is implemented as a single-file Python Streamlit system with session-state navigation, a household input dataclass, conservative low-high saving estimators, a seven-check inspection layer, a recommendation-ranking layer, visual analytics, anonymous Google Sheets persistence, downloadable reports, and a certificate-of-completion interface.", "key_contribution": "This paper presents the system architecture and operating logic of The Home-Energy Check-Up (New Zealand), a web-based public decision-support prototype designed to help New Zealand households identify avoidable energy-cost leakage, complete a short guided home inspection, and generate a prioritized behavior-first energy roadmap.", "why_it_matters": "A Prototypical Decision-Support Tool for Household Energy Management: A New Zealand Case Study represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Human-Computer Interaction.", "one_line_takeaway": "This paper presents the system architecture and operating logic of The Home-Energy Check-Up (New Zealand), a web-based…", "biggest_caveat": "limitation layers of the prototype.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Human-Computer Interaction.", "url": "https://arxiv.org/abs/2606.15513", "difficulty": "intermediate" }, { "id": "arxiv:2606.15637", "source": "arxiv", "source_type": "preprint", "title": "HAPI-EP: Towards Hybrid, Adaptive, and Predictive Digital Twins of Cardiac Electrophysiology", "abstract": "A digital twin (DT) of a patient-specific heart offers significant potential in personalized medicine. However, its rapid and dynamic adaptation to an individual's live data and its predictive capability after adaptation remains central challenges. We examine this challenge from its two building blocks: DT formulation where mechanistic and data-driven models show competing merits and limitations, and DT optimization strategies that are largely driven by a reconstruction objective leading to un-identifiable models. We address both bottlenecks via HAPI -- an AI framework for building hybrid, adaptive, and predictive DTs with three key enablers. First, HAPI constructs a physics-integrated gray-box model in which an interpretable mechanistic backbone is augmented by a neural component that models its residual to the observed data. Second, rather than attempting to pre-encode all possible variations in a static hybrid model, HAPI enables rapid on-the-fly adaptation of the hybrid model to few-shot live data, achieved by feedforward meta-learners realizing amortized inference of both mechanistic and neural parameters of the hybrid model trained with predictive objectives. Finally, we show that this adaptivity corresponds to the construction of a conditional generative model (i.e., the hybrid DT) that endows it with theoretical identifiability and thus strong performance in predictive scenarios. We demonstrate the proof-of-concept of HAPI in cardiac electrophysiology using a hybrid monodomain model with mechanistic reaction kinetics and neural graph diffusion. Across synthetic and real-data studies, we show that HAPI's mechanistic-neural hybridization and predictive adaptation are critical for obtaining identifiable DTs with strong predictive and out-of-distribution capabilities.", "authors": [ "Sumeet Vadhavkar", "Xiajun Jiang", "Yubo Ye", "Maryam Toloubidokhti", "Linwei Wang" ], "year": 2026, "published_date": "2026-06-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.15637", "pdf_url": "https://arxiv.org/pdf/2606.15637", "citations": 0, "topics": [], "tags": [ "Prompting", "Interpretability", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.67, "content_potential_score": 0.0, "interestingness_score": 1.75, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "A digital twin (DT) of a patient-specific heart offers significant potential in personalized medicine. However, its rapid and dynamic adaptation to an individual's live data and its predictive capability after adaptation remains central challenges.", "key_contribution": "We examine this challenge from its two building blocks: DT formulation where mechanistic and data-driven models show competing merits and limitations, and DT optimization strategies that are largely driven by a reconstruction objective leading to un-identifiable models.", "why_it_matters": "HAPI-EP: Towards Hybrid, Adaptive, and Predictive Digital Twins of Cardiac Electrophysiology represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We examine this challenge from its two building blocks: DT formulation where mechanistic and data-driven models show…", "biggest_caveat": "However, its rapid and dynamic adaptation to an individual's live data and its predictive capability after adaptation remains central challenges.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2606.15637", "difficulty": "frontier" }, { "id": "arxiv:2604.13717", "source": "arxiv", "source_type": "preprint", "title": "On Cost-Effective LLM-as-a-Judge Improvement Techniques", "abstract": "Using a language model to score or rank candidate responses has become a scalable alternative to human evaluation in reinforcement learning from human feedback (RLHF) pipelines, benchmarking, and application layer evaluations. However, output reliability depends heavily on prompting and aggregation strategy. We present an empirical investigation of four drop-in techniques -- ensemble scoring, task-specific criteria injection, calibration context, and adaptive model escalation -- for improving LLM judge accuracy on RewardBench 2, with a unifying lens of noise control on the stochastic judge: ensembling as Monte Carlo averaging over per-call noise, criteria injection as between-response discrimination sharpening, and per-response score variance as an uncertainty signal. Ensemble scoring and task-specific criteria injection (the latter virtually cost free) together reach up to 85.8% accuracy, +13.5pp over baseline. Calibration context and adaptive model escalation also improve over baseline but are dominated by criteria + ensembling on the cost-accuracy Pareto frontier. Small models benefit disproportionately from ensembling, making high-accuracy LLM judges accessible at low cost. We show that these techniques generalise across model providers, evaluating on both OpenAI GPT and Anthropic Claude families.", "authors": [ "Ryan Lail", "Luke Markham" ], "year": 2026, "published_date": "2026-06-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.13717", "pdf_url": "https://arxiv.org/pdf/2604.13717", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "Evaluation", "NLP" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 6.19, "content_potential_score": 1.55, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Using a language model to score or rank candidate responses has become a scalable alternative to human evaluation in reinforcement learning from human feedback (RLHF) pipelines, benchmarking, and application layer evaluations. However, output reliability depends heavily on prompting and aggregation strategy.", "key_contribution": "We present an empirical investigation of four drop-in techniques -- ensemble scoring, task-specific criteria injection, calibration context, and adaptive model escalation -- for improving LLM judge accuracy on RewardBench 2, with a unifying lens of noise control on the stochastic judge: ensembling as Monte Carlo averaging over per-call noise, criteria injection as between-response discrimination sharpening, and per-response score variance as an uncertainty signal.", "why_it_matters": "On Cost-Effective LLM-as-a-Judge Improvement Techniques represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present an empirical investigation of four drop-in techniques -- ensemble scoring, task-specific criteria injection,…", "biggest_caveat": "However, output reliability depends heavily on prompting and aggregation strategy.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2604.13717", "difficulty": "beginner" }, { "id": "arxiv:2606.11132v1", "source": "arxiv", "source_type": "preprint", "title": "Operationalizing Property-Based Testing for Data-Intensive Scalable Computing Systems", "abstract": "While fuzzing effectively catches crashes, its shallow oracles often miss semantic drifts and optimization-related errors in data-intensive scalable computing (DISC) frameworks. Property-based testing (PBT) addresses this limitation by checking general semantic invariants across diverse workloads and inputs, rather than relying on specific expected outputs. However, systematically operationalizing PBT for DISC systems remains difficult because it requires both reusable property definitions and effective instantiation into valid workloads and data. We present DiscPBT, a property-based testing engine for Apache Spark. DiscPBT introduces eight reusable meta-properties for DISC semantic testing, spanning equivalence rewriting, data decomposition, computation decomposition, and operator-local semantic relations. To operationalize these meta-properties, DiscPBT provides reusable generators for synthesizing valid workload skeletons and input data, together with an instantiation framework that realizes each meta-property in schema-compatible contexts through compatible operators, expressions, and UDFs. Our evaluation on PySpark shows that DiscPBT achieves 1.2$\\times$ higher branch coverage and 1153$\\times$ greater plan diversity than CometFuzz. Across 66 concrete properties, DiscPBT reveals cross-version semantic drift as well as subtle corner-case pitfalls involving NaN and empty inputs, that are not captured by crash-based fuzzing alone. These results demonstrate the value of systematic PBT for uncovering semantic issues in DISC frameworks.", "authors": [ "Yaoxuan Wu", "Ingrid Lee", "Ahmad Humayun", "Muhammad Ali Gulzar", "Miryung Kim" ], "year": 2026, "published_date": "2026-06-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.11132v1", "pdf_url": "https://arxiv.org/pdf/2606.11132v1", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.5, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "While fuzzing effectively catches crashes, its shallow oracles often miss semantic drifts and optimization-related errors in data-intensive scalable computing (DISC) frameworks. Property-based testing (PBT) addresses this limitation by checking general semantic invariants across diverse workloads and inputs, rather than relying on specific expected outputs.", "key_contribution": "We present DiscPBT, a property-based testing engine for Apache Spark.", "why_it_matters": "Operationalizing Property-Based Testing for Data-Intensive Scalable Computing Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We present DiscPBT, a property-based testing engine for Apache Spark.", "biggest_caveat": "limitation by checking general semantic invariants across diverse workloads and inputs, rather than relying on specific expected outputs.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "http://arxiv.org/abs/2606.11132v1", "difficulty": "intermediate" }, { "id": "arxiv:2508.13309", "source": "arxiv", "source_type": "preprint", "title": "DASH: A Meta-Attack Framework for Synthesizing Effective and Stealthy Adversarial Examples", "abstract": "Numerous techniques have been proposed for generating adversarial examples in white-box settings under strict Lp-norm constraints. However, such norm-bounded examples often fail to align well with human perception, and only recently have a few methods begun specifically exploring perceptually aligned adversarial examples. Moreover, it remains unclear whether insights from Lp-constrained attacks can be effectively leveraged to improve perceptual efficacy. In this paper, we introduce DAASH, a fully differentiable meta-attack framework that generates effective and perceptually aligned adversarial examples by strategically composing existing Lp-based attack methods. DAASH operates in a multi-stage fashion: at each stage, it aggregates candidate adversarial examples from multiple base attacks using learned, adaptive weights and propagates the result to the next stage. A novel meta-loss function guides this process by jointly minimizing misclassification loss and perceptual distortion, enabling the framework to dynamically modulate the contribution of each base attack throughout the stages. We evaluate DAASH on adversarially trained models across CIFAR-10, CIFAR-100, and ImageNet. Despite relying solely on Lp-constrained based methods, DAASH significantly outperforms state-of-the-art perceptual attacks such as AdvAD -- achieving higher attack success rates (e.g., 20.63\\% improvement) and superior visual quality, as measured by SSIM, LPIPS, and FID (improvements $\\approx$ of 11, 0.015, and 5.7, respectively). Furthermore, DAASH generalizes well to unseen defenses, making it a practical and strong baseline for evaluating robustness without requiring handcrafted adaptive attacks for each new defense.", "authors": [ "Abdullah Al Nomaan Nafi", "Habibur Rahaman", "Zafaryab Haider", "Tanzim Mahfuz", "Fnu Suya", "Swarup Bhunia", "Prabuddha Chakraborty" ], "year": 2026, "published_date": "2026-05-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2508.13309", "pdf_url": "https://arxiv.org/pdf/2508.13309", "citations": 0, "topics": [], "tags": [ "Adversarial", "Machine Learning", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.84, "content_potential_score": 0.55, "interestingness_score": 2.02, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Numerous techniques have been proposed for generating adversarial examples in white-box settings under strict Lp-norm constraints. However, such norm-bounded examples often fail to align well with human perception, and only recently have a few methods begun specifically exploring perceptually aligned adversarial examples.", "key_contribution": "In this paper, we introduce DAASH, a fully differentiable meta-attack framework that generates effective and perceptually aligned adversarial examples by strategically composing existing Lp-based attack methods.", "why_it_matters": "DASH: A Meta-Attack Framework for Synthesizing Effective and Stealthy Adversarial Examples advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Adversarial.", "one_line_takeaway": "In this paper, we introduce DAASH, a fully differentiable meta-attack framework that generates effective and…", "biggest_caveat": "bution of each base attack throughout the stages.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Adversarial.", "url": "https://arxiv.org/abs/2508.13309", "difficulty": "intermediate" }, { "id": "arxiv:2604.14965v1", "source": "arxiv", "source_type": "preprint", "title": "POMDP-based Object Search with Growing State Space and Hybrid Action Domain", "abstract": "Efficiently locating target objects in complex indoor environments with diverse furniture, such as shelves, tables, and beds, is a significant challenge for mobile robots. This difficulty arises from factors like localization errors, limited fields of view, and visual occlusion. We address this by framing the object-search task as a highdimensional Partially Observable Markov Decision Process (POMDP) with a growing state space and hybrid (continuous and discrete) action spaces in 3D environments. Based on a meticulously designed perception module, a novel online POMDP solver named the growing neural process filtered k-center clustering tree (GNPF-kCT) is proposed to tackle this problem. Optimal actions are selected using Monte Carlo Tree Search (MCTS) with belief tree reuse for growing state space, a neural process network to filter useless primitive actions, and k-center clustering hypersphere discretization for efficient refinement of high-dimensional action spaces. A modified upper-confidence bound (UCB), informed by belief differences and action value functions within cells of estimated diameters, guides MCTS expansion. Theoretical analysis validates the convergence and performance potential of our method. To address scenarios with limited information or rewards, we also introduce a guessed target object with a grid-world model as a key strategy to enhance search efficiency. Extensive Gazebo simulations with Fetch and Stretch robots demonstrate faster and more reliable target localization than POMDP-based baselines and state-of-the-art (SOTA) non-POMDP-based solvers, especially large language model (LLM) based methods, in object search under the same computational constraints and perception systems. Real-world tests in office environments confirm the practical applicability of our approach. Project page: https://sites.google.com/view/gnpfkct.", "authors": [ "Yongbo Chen", "Hesheng Wang", "Shoudong Huang", "Hanna Kurniawati" ], "year": 2026, "published_date": "2026-04-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.14965v1", "pdf_url": "https://arxiv.org/pdf/2604.14965v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Robotics" ], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 6.4, "content_potential_score": 0.0, "interestingness_score": 1.75, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Efficiently locating target objects in complex indoor environments with diverse furniture, such as shelves, tables, and beds, is a significant challenge for mobile robots. This difficulty arises from factors like localization errors, limited fields of view, and visual occlusion.", "key_contribution": "Based on a meticulously designed perception module, a novel online POMDP solver named the growing neural process filtered k-center clustering tree (GNPF-kCT) is proposed to tackle this problem.", "why_it_matters": "POMDP-based Object Search with Growing State Space and Hybrid Action Domain represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Based on a meticulously designed perception module, a novel online POMDP solver named the growing neural process…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.14965v1", "difficulty": "intermediate" }, { "id": "arxiv:2604.01152v1", "source": "arxiv", "source_type": "preprint", "title": "Brainstacks: Cross-Domain Cognitive Capabilities via Frozen MoE-LoRA Stacks for Continual LLM Learning", "abstract": "We present Brainstacks, a modular architecture for continual multi-domain fine-tuning of large language models that packages domain expertise as frozen adapter stacks composing additively on a shared frozen base at inference. Five interlocking components: (1) MoE-LoRA with Shazeer-style noisy top-2 routing across all seven transformer projections under QLoRA 4-bit quantization with rsLoRA scaling; (2) an inner loop performing residual boosting by freezing trained stacks and adding new ones; (3) an outer loop training sequential domain-specific stacks with curriculum-ordered dependencies; (4) null-space projection via randomized SVD constraining new stacks to subspaces orthogonal to prior directions, achieving zero forgetting in isolation; (5) an outcome-based sigmoid meta-router trained on empirically discovered domain-combination targets that selectively weights stacks, enabling cross-domain composition. Two boundary experiments: (6) PSN pretraining on a randomly initialized model; (7) per-domain RL (DPO/GRPO) validating compatibility with post-SFT alignment. Validated on TinyLlama-1.1B (4 domains, 9 stacks) and Gemma 3 12B IT (5 domains, 10 stacks), MoE-LoRA achieves 2.5x faster convergence than parameter-matched single LoRA, residual boosting breaks through the single-stack ceiling, and the routed system recovers generation quality destroyed by ungated stack accumulation. The central finding: the outcome-based router discovers that domain stacks encode transferable cognitive primitives (instruction-following clarity, numerical reasoning, procedural logic, chain-of-thought structure) rather than domain-specific knowledge, with medical prompts routing to chat+math stacks in 97% of cases despite zero medical data in those stacks.", "authors": [ "Mohammad R. Abu Ayyash" ], "year": 2026, "published_date": "2026-04-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.01152v1", "pdf_url": "https://arxiv.org/pdf/2604.01152v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Prompting", "MoE", "RLHF" ], "paper_type": "theory", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (MoE, RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.55, "content_potential_score": 0.0, "interestingness_score": 1.75, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present Brainstacks, a modular architecture for continual multi-domain fine-tuning of large language models that packages domain expertise as frozen adapter stacks composing additively on a shared frozen base at inference. Five interlocking components: (1) MoE-LoRA with Shazeer-style noisy top-2 routing across all seven transformer projections under QLoRA 4-bit quantization with rsLoRA scaling; (2) an inner loop performing residual boosting by freezing trained stacks and adding new ones; (3) an outer loop training sequential domain-specific stacks with curriculum-ordered dependencies; (4) null-space projection via randomized SVD constraining new stacks to subspaces orthogonal to prior directions, achieving zero forgetting in isolation; (5) an outcome-based sigmoid meta-router trained on empirically discovered domain-combination targets that selectively weights stacks, enabling cross-domain composition.", "key_contribution": "We present Brainstacks, a modular architecture for continual multi-domain fine-tuning of large language models that packages domain expertise as frozen adapter stacks composing additively on a shared frozen base at inference.", "why_it_matters": "Brainstacks: Cross-Domain Cognitive Capabilities via Frozen MoE-LoRA Stacks for Continual LLM Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present Brainstacks, a modular architecture for continual multi-domain fine-tuning of large language models that…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.01152v1", "difficulty": "advanced" }, { "id": "arxiv:2605.27939", "source": "arxiv", "source_type": "preprint", "title": "EyeSpy: Inferring Eye Gaze via Side-Channel Attacks Against Foveated Rendering", "abstract": "While eye tracking provides valuable capabilities for virtual reality, such as gaze interaction and dynamic foveated rendering (DFR), eye-tracking data can inadvertently reveal sensitive user information if not properly protected. Current protections, such as adding permission prompts or gatekeeping gaze data, are insufficient on DFR-enabled systems because gaze data is used internally to drive DFR. When DFR is implemented, objects in the fovea (i.e., immediate gaze area) incur a higher GPU workload than those in the periphery. This gaze-contingent workload creates a novel side channel, which can be leveraged to reconstruct gaze positions. Specifically, we design a novel attack that sweeps imperceptible high-cost objects (HCOs) across the user's field of view and logs rendering performance metrics (e.g., frame rate or frame time) commonly exposed through standard game engines. Then, we correlate variation in these metrics (caused by HCO-foveal overlap) with the known HCOs' positions to infer gaze coordinates directly without using eye-tracking APIs. Our experimental results show that mean gaze prediction errors (1.1-4.4 degrees) across the Meta Quest Pro, Varjo XR-4, and desktop platforms are comparable to typical eye-tracker accuracy. We demonstrate that the attack generalizes across various hardware platforms, standard game engines, and foveated rendering pipelines. Finally, we design defense mechanisms based on supervised and unsupervised detectors that can flag the attack reliably (F1 of 0.99) over short time windows.", "authors": [ "Paul Maynard", "Harris Amjad", "Camila Molinares", "Bo Ji", "Brendan David-John" ], "year": 2026, "published_date": "2026-05-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.27939", "pdf_url": "https://arxiv.org/pdf/2605.27939", "citations": 0, "topics": [], "tags": [ "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.63, "content_potential_score": 1.55, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "While eye tracking provides valuable capabilities for virtual reality, such as gaze interaction and dynamic foveated rendering (DFR), eye-tracking data can inadvertently reveal sensitive user information if not properly protected. Current protections, such as adding permission prompts or gatekeeping gaze data, are insufficient on DFR-enabled systems because gaze data is used internally to drive DFR.", "key_contribution": "This gaze-contingent workload creates a novel side channel, which can be leveraged to reconstruct gaze positions.", "why_it_matters": "EyeSpy: Inferring Eye Gaze via Side-Channel Attacks Against Foveated Rendering represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Human-Computer Interaction.", "one_line_takeaway": "This gaze-contingent workload creates a novel side channel, which can be leveraged to reconstruct gaze positions.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Human-Computer Interaction.", "url": "https://arxiv.org/abs/2605.27939", "difficulty": "intermediate" }, { "id": "arxiv:2508.19932", "source": "arxiv", "source_type": "preprint", "title": "CASE: An Agentic AI Framework for Enhancing Scam Intelligence in Digital Payments", "abstract": "The proliferation of digital payment platforms has transformed commerce, offering unmatched convenience and accessibility globally. However, this growth has also attracted malicious actors, leading to a corresponding increase in sophisticated social engineering scams. These scams are often initiated and orchestrated on multiple surfaces outside the payment platform, making user and transaction-based signals insufficient for a complete understanding of the scam's methodology and underlying patterns, without which it is very difficult to prevent it in a timely manner. This paper presents CASE (Conversational Agent for Scam Elucidation), a novel Agentic AI framework that addresses this problem by collecting and managing user scam feedback in a safe and scalable manner. A conversational agent is uniquely designed to proactively interview potential victims to elicit intelligence in the form of a detailed conversation. The conversation transcripts are then consumed by another AI system that extracts information and converts it into structured data for downstream usage in automated and manual enforcement mechanisms. Using Google's Gemini family of LLMs, we implemented this framework on Google Pay (GPay) India. By augmenting our existing features with this new intelligence, we have observed a 21% uplift in the volume of scam enforcements. The architecture and its robust evaluation framework are highly generalizable, offering a blueprint for building similar AI-driven systems to collect and manage scam intelligence in other sensitive domains.", "authors": [ "Nitish Jaipuria", "Lorenzo Gatto", "Zijun Kan", "Shankey Poddar", "Bill Cheung", "Diksha Bansal", "Ramanan Balakrishnan", "Aviral Suri", "Jose Estevez" ], "year": 2026, "published_date": "2026-05-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2508.19932", "pdf_url": "https://arxiv.org/pdf/2508.19932", "citations": 0, "topics": [], "tags": [ "AI Agents", "Info Extraction", "Dialogue", "Structured Data", "Evaluation" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.23, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The proliferation of digital payment platforms has transformed commerce, offering unmatched convenience and accessibility globally. However, this growth has also attracted malicious actors, leading to a corresponding increase in sophisticated social engineering scams.", "key_contribution": "This paper presents CASE (Conversational Agent for Scam Elucidation), a novel Agentic AI framework that addresses this problem by collecting and managing user scam feedback in a safe and scalable manner.", "why_it_matters": "CASE: An Agentic AI Framework for Enhancing Scam Intelligence in Digital Payments represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "This paper presents CASE (Conversational Agent for Scam Elucidation), a novel Agentic AI framework that addresses this…", "biggest_caveat": "However, this growth has also attracted malicious actors, leading to a corresponding increase in sophisticated social engineering scams.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2508.19932", "difficulty": "beginner" }, { "id": "arxiv:2604.23449", "source": "arxiv", "source_type": "preprint", "title": "ArguAgent: AI-Supported Real-Time Grouping for Productive Argumentation in STEM Classrooms", "abstract": "Argumentation is a core practice in STEM education, but its productivity depends on who participates and how they interact. Higher-achieving students often dominate the talk and decision-making, while lower-achieving peers may disengage, defer, or comply without contributing substantive reasoning. Forming groups strategically based on students' stances and argumentation skills could help foster inclusive, evidence-based discourse. In practice, however, teachers are constrained in implementing this grouping strategy because it requires real-time insight into students' positions and the quality of their argumentation, information that is difficult to assess reliably and at scale during instruction. We present a generative AI-powered system, ArguAgent, that creates groups optimizing for stance heterogeneity while constraining argumentation quality differences to +/-1 level on a validated learning progression. ArguAgent uses a two-component assessment pipeline: first scoring student arguments on a 0-4 rubric, then clustering positions via semantic analysis. We validated the scoring component against human expert consensus (Krippendorff's ααα = 0.817) using 200 expert-generated scores. Testing three OpenAI models (GPT-4o-mini, GPT-5.1, GPT-5.2) with identical calibrated prompts, we found that systematic prompt engineering informed by human disagreement analysis contributed 89% of scoring improvement (QWK: 0.531 to 0.686), while model upgrades contributed an additional 11% (QWK: 0.686 to 0.708). Simulation testing across 100 classes demonstrated that the grouping algorithm achieves 95.4% of groups that meet both design criteria, a 3.2x improvement over random assignment. These results suggest ArguAgent can enable real-time, theoretically grounded grouping that promotes productive STEM argumentation in classrooms.", "authors": [ "Jennifer Kleiman", "Yizhu Gao", "Xin Xia", "Zhaoji Wang", "Zipei Zhu", "Jongchan Park", "Xiaoming Zhai" ], "year": 2026, "published_date": "2026-04-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.23449", "pdf_url": "https://arxiv.org/pdf/2604.23449", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Prompting", "Artificial Intelligence", "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 6.83, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Argumentation is a core practice in STEM education, but its productivity depends on who participates and how they interact. Higher-achieving students often dominate the talk and decision-making, while lower-achieving peers may disengage, defer, or comply without contributing substantive reasoning.", "key_contribution": "We present a generative AI-powered system, ArguAgent, that creates groups optimizing for stance heterogeneity while constraining argumentation quality differences to +/-1 level on a validated learning progression.", "why_it_matters": "ArguAgent: AI-Supported Real-Time Grouping for Productive Argumentation in STEM Classrooms represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a generative AI-powered system, ArguAgent, that creates groups optimizing for stance heterogeneity while…", "biggest_caveat": "but its productivity depends on who participates and how they interact.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2604.23449", "difficulty": "beginner" }, { "id": "arxiv:2604.03486v2", "source": "arxiv", "source_type": "preprint", "title": "VisionClaw: Always-On AI Agents through Smart Glasses", "abstract": "We present VisionClaw, an always-on wearable AI agent that integrates live egocentric perception with agentic task execution. Running on Meta Ray-Ban smart glasses, VisionClaw continuously perceives real-world context and enables in-situ, speech-driven action initiation and delegation via OpenClaw AI agents. Therefore, users can directly execute tasks through the smart glasses, such as adding real-world objects to an Amazon cart, generating notes from physical documents, receiving meeting briefings on the go, creating events from posters, or controlling IoT devices. We evaluate VisionClaw through a controlled laboratory study (N=12) and a longitudinal deployment study (N=5). Results show that integrating perception and execution enables faster task completion and reduces interaction overhead compared to non-always-on and non-agent baselines. Beyond performance gains, deployment findings reveal a shift in interaction: tasks are initiated opportunistically during ongoing activities, and execution is increasingly delegated rather than manually controlled. These results suggest a new paradigm for wearable AI agents, where perception and action are continuously coupled to support situated, hands-free interaction.", "authors": [ "Xiaoan Liu", "DaeHo Lee", "Eric J Gonzalez", "Mar Gonzalez-Franco", "Ryo Suzuki" ], "year": 2026, "published_date": "2026-04-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.03486v2", "pdf_url": "https://arxiv.org/pdf/2604.03486v2", "citations": 0, "topics": [], "tags": [ "AI Agents", "Artificial Intelligence", "AI Agents & Tool Use", "Machine Learning", "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.71, "content_potential_score": 1.45, "interestingness_score": 2.48, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present VisionClaw, an always-on wearable AI agent that integrates live egocentric perception with agentic task execution. Running on Meta Ray-Ban smart glasses, VisionClaw continuously perceives real-world context and enables in-situ, speech-driven action initiation and delegation via OpenClaw AI agents.", "key_contribution": "We present VisionClaw, an always-on wearable AI agent that integrates live egocentric perception with agentic task execution.", "why_it_matters": "VisionClaw: Always-On AI Agents through Smart Glasses moves AI from passive text generators to active problem-solvers that use tools and reason over time.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We present VisionClaw, an always-on wearable AI agent that integrates live egocentric perception with agentic task…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "http://arxiv.org/abs/2604.03486v2", "difficulty": "intermediate" }, { "id": "arxiv:2502.04671", "source": "arxiv", "source_type": "preprint", "title": "ProofWala: A Framework for Multilingual Proof Data Synthesis and Theorem-Proving", "abstract": "Neural approaches to theorem proving require robust infrastructure for interfacing with interactive theorem provers (ITPs), extracting structured proof data, and executing proof search at scale. However, existing tooling is often assistant-specific and oriented toward file-level execution, making repository-scale analysis and parallel experimentation challenging. We present ProofWala, a multilingual proof engineering framework built around \\texttt{itp-interface}, a reusable library for programmatic interaction with ITPs. For Lean 4, we implement a meta-programmed interaction layer executing inside the elaborator, enabling semantically faithful tactic-level tracing alongside declaration- and dependency-level extraction across entire repositories. This design extends beyond traditional REPL-style interaction by supporting project-wide analysis, environment cloning, and pooled execution of proof states. The same interface abstraction supports multiple versions of Rocq, yielding a unified cross-assistant pipeline. Built on this infrastructure, ProofWala provides standardized multilingual proof datasets, model training utilities, and parallel proof search algorithms. Using the framework, we demonstrate that multilingual training across Lean and Rocq enables cross-lingual and cross-domain transfer. We observe statistically significant improvements on Lean Mathlib and in domain adaptation (CategoryTheory), while other settings exhibit consistent upward trends. We open-source the full framework, parallel proof search module, datasets, and models across two repositories: ProofWala (https://github.com/trishullab/proof-wala) and the itp-interface library (https://github.com/trishullab/itp-interface).", "authors": [ "Amitayush Thakur", "George Tsoukalas", "Greg Durrett", "Swarat Chaudhuri" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2502.04671", "pdf_url": "https://arxiv.org/pdf/2502.04671", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence", "Machine Learning", "Programming Languages" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.09, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Neural approaches to theorem proving require robust infrastructure for interfacing with interactive theorem provers (ITPs), extracting structured proof data, and executing proof search at scale. However, existing tooling is often assistant-specific and oriented toward file-level execution, making repository-scale analysis and parallel experimentation challenging.", "key_contribution": "We present ProofWala, a multilingual proof engineering framework built around \\texttt{itp-interface}, a reusable library for programmatic interaction with ITPs.", "why_it_matters": "ProofWala: A Framework for Multilingual Proof Data Synthesis and Theorem-Proving represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We present ProofWala, a multilingual proof engineering framework built around \\texttt{itp-interface}, a reusable…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2502.04671", "difficulty": "frontier" }, { "id": "arxiv:2605.27817", "source": "arxiv", "source_type": "preprint", "title": "Turning Video Models into Generalist Robot Policies", "abstract": "Video generative models have emerged as a promising robotics backbone, capable of generating videos that depict the completion of complex tasks across embodiments and environments. Recent work proposes robot foundation models that jointly predict future observations and actions by finetuning video models with action-labeled data. In this paper, we test the limits of an alternative approach: leave the video planner as-is while training an embodiment-specific inverse dynamics model (IDM). This decoupling offers several natural benefits: the video planner remains embodiment-agnostic, different video models can be interchanged easily without re-training the IDM, and the IDM can be independently trained with readily available self-play data. We present a closed-loop, video-to-action policy that combines an action-free video world model with a carefully-designed IDM based on the robot embodiment Jacobian. We demonstrate that our IDM design is both data-efficient and scalable to high-dimensional action spaces. Our policy, which we coin the Video-to-Embodied Robot Action Model (VERA), achieves strong performance across simulated and real-world benchmarks, including zero-shot Panda arm manipulation and 16-DoF Allegro-hand dexterous cube re-orientation. The same video planner can be used across multiple embodiments by pairing it with different embodiment-specific IDMs. Our results show that decoupled video planning plus faithful video-to-action translation is a viable alternative route towards zero-shot, cross-embodiment, and generalizable robot control. More results are available on our project website: https://vera.csail.mit.edu.", "authors": [ "Sizhe Lester Li", "Evan Kim", "Xingjian Bai", "Tong Zhao", "Tao Pang", "Max Simchowitz", "Vincent Sitzmann" ], "year": 2026, "published_date": "2026-05-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.27817", "pdf_url": "https://arxiv.org/pdf/2605.27817", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Robotics", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 6.28, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Video generative models have emerged as a promising robotics backbone, capable of generating videos that depict the completion of complex tasks across embodiments and environments. Recent work proposes robot foundation models that jointly predict future observations and actions by finetuning video models with action-labeled data.", "key_contribution": "We present a closed-loop, video-to-action policy that combines an action-free video world model with a carefully-designed IDM based on the robot embodiment Jacobian.", "why_it_matters": "Turning Video Models into Generalist Robot Policies represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We present a closed-loop, video-to-action policy that combines an action-free video world model with a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2605.27817", "difficulty": "beginner" }, { "id": "arxiv:2605.18825", "source": "arxiv", "source_type": "preprint", "title": "Not All Tokens Are Worth Caching: Learning Semantic-Aware Eviction for LLM Prefix Caches", "abstract": "Prefix caching is a key optimization in Large Language Model (LLM) serving, reusing attention Key-Value (KV) states across requests with shared prompt prefixes to reduce expensive prefill computation. However, its benefit depends critically on the eviction policy as GPU memory is scarce, and existing policies such as LRU largely treat cached blocks uniformly. This view ignores a fundamental property of LLM prompts: not all tokens are equally worth caching. We show that different token types within a prompt, including system prompts, user queries, tool outputs, model responses, and chain-of-thought reasoning, exhibit up to 756x variation in reuse rates, yet no existing eviction policy exploits this signal. In this paper, we present SAECache (Semantic-Adaptive Eviction for prefix caches), a semantic-adaptive prefix cache eviction policy that addresses this gap through three innovations: (1) a multi-queue architecture that routes KV blocks to task-specific queues with tailored priority metrics, capturing both session reuse in multi-turn requests and structural reuse in templated single-turn requests; (2) a semantic-aware token weighting mechanism that learns the reuse value of different token types online through eviction feedback; and (3) a fully adaptive online learning schema for all parameter updates, including log-normal timing parameters, position decay power, queue weights, and meta-parameters, which eliminates manual tuning and enables automatic adaptation to deployment-specific workload characteristics. Through extensive evaluation across heterogeneous workloads, we demonstrate that SAECache achieves 1.4x-2.7x TTFT improvement over production-style baselines, while fixed-parameter alternatives can degrade by up to 2.7x under workload mismatch -- a failure mode our adaptive approach avoids entirely.", "authors": [ "Shaoke Fang", "Ziang Li", "Wenfei Wu", "Jiatong Ji", "Qingsong Liu", "Ruizhi Pu" ], "year": 2026, "published_date": "2026-05-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.18825", "pdf_url": "https://arxiv.org/pdf/2605.18825", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Machine Learning", "Distributed Computing" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.9, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Prefix caching is a key optimization in Large Language Model (LLM) serving, reusing attention Key-Value (KV) states across requests with shared prompt prefixes to reduce expensive prefill computation. However, its benefit depends critically on the eviction policy as GPU memory is scarce, and existing policies such as LRU largely treat cached blocks uniformly.", "key_contribution": "We show that different token types within a prompt, including system prompts, user queries, tool outputs, model responses, and chain-of-thought reasoning, exhibit up to 756x variation in reuse rates, yet no existing eviction policy exploits this signal.", "why_it_matters": "Not All Tokens Are Worth Caching: Learning Semantic-Aware Eviction for LLM Prefix Caches represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We show that different token types within a prompt, including system prompts, user queries, tool outputs, model…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.18825", "difficulty": "intermediate" }, { "id": "arxiv:2604.14431v1", "source": "arxiv", "source_type": "preprint", "title": "AndroScanner: Automated Backend Vulnerability Detection for Android Applications", "abstract": "Mobile applications rely on complex backends that introduce significant security risks, yet developers often lack the tools to assess these risks effectively. This paper presents AndroScanner, an automated pipeline for detecting vulnerabilities in Android application backends through combined static and dynamic analysis. AndroScanner extracts backend API calls from APK files using apktool, Androguard, and Frida-based dynamic instrumentation, then vets them against the OWASP API Security Top 10 using APIFuzzer. We evaluate AndroScanner on two Android applications: a purposely vulnerable bank application and a production recruitment application with over 50,000 downloads on Google Play Store. Across both applications, AndroScanner extracted 24 APIs and identified 5 vulnerabilities, including a previously unreported zero-day Excessive Data Exposure vulnerability (ranked 3rd in the OWASP API Security Top 10) in the production application. The vulnerability was responsibly disclosed to the development team prior to publication. AndroScanner is available upon request to assist developers in identifying and remediating backend security risks before deployment.", "authors": [ "Harini Dandu" ], "year": 2026, "published_date": "2026-04-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.14431v1", "pdf_url": "https://arxiv.org/pdf/2604.14431v1", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Software Engineering", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.31, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Mobile applications rely on complex backends that introduce significant security risks, yet developers often lack the tools to assess these risks effectively. This paper presents AndroScanner, an automated pipeline for detecting vulnerabilities in Android application backends through combined static and dynamic analysis.", "key_contribution": "Mobile applications rely on complex backends that introduce significant security risks, yet developers often lack the tools to assess these risks effectively.", "why_it_matters": "AndroScanner: Automated Backend Vulnerability Detection for Android Applications represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "Mobile applications rely on complex backends that introduce significant security risks, yet developers often lack the…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "http://arxiv.org/abs/2604.14431v1", "difficulty": "intermediate" }, { "id": "arxiv:2605.27428", "source": "arxiv", "source_type": "preprint", "title": "$E^3$-Agent: An Executable and Evolving Agent for Resource Management of Edge Generative Inference", "abstract": "Edge deployments of generative inference increasingly face two practical realities: per-device per-model performance is often unknown at deployment time, and it is non-stationary due to user-driven semantic events, background load, and device churn. Consequently, a resource manager that is tuned offline under a fixed regime can become brittle and expensive to maintain. This paper presents $E^3$-Agent, an executable and evolving agent for edge artificial intelligence generated content (AIGC) resource management. $E^3$-Agent separates a fast-path router that makes millisecond-level dispatch decisions from a slow-path, event-driven large language model (LLM) meta-controller that mitigates regime shifts through a small, explicit control surface exposed via a tool interface, including risk gating, router configuration, and rapid performance calibration. The agent learns online from execution feedback and continuously adapts to unknown and time-varying service-time mappings. We evaluate $E^3$-Agent in a discrete-event simulator driven by MLPerf-derived device-model measurement priors, covering cold-start warmup and three dynamic regimes: semantic dynamics, device churn, and hidden drift. Across the dynamic scenarios, $E^3$-Agent reduces average latency by 65%-73% compared to the best static baseline, stays within 7%-10% of an online full-information Oracle used for evaluation, and effectively suppresses stutter rate under semantic degradation.", "authors": [ "Rui Bao", "Yaping Sun", "Zhiyong Chen", "Feng Yang", "Meixia Tao", "Nan Li", "Wenjun Zhang" ], "year": 2026, "published_date": "2026-05-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.27428", "pdf_url": "https://arxiv.org/pdf/2605.27428", "citations": 0, "topics": [], "tags": [ "LLMs", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 4.48, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Edge deployments of generative inference increasingly face two practical realities: per-device per-model performance is often unknown at deployment time, and it is non-stationary due to user-driven semantic events, background load, and device churn. Consequently, a resource manager that is tuned offline under a fixed regime can become brittle and expensive to maintain.", "key_contribution": "Edge deployments of generative inference increasingly face two practical realities: per-device per-model performance is often unknown at deployment time, and it is non-stationary due to user-driven semantic events, background load, and device churn.", "why_it_matters": "$E^3$-Agent: An Executable and Evolving Agent for Resource Management of Edge Generative Inference represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Edge deployments of generative inference increasingly face two practical realities: per-device per-model performance is…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.27428", "difficulty": "intermediate" }, { "id": "arxiv:2604.18978v1", "source": "arxiv", "source_type": "preprint", "title": "Low-Rank Adaptation for Critic Learning in Off-Policy Reinforcement Learning", "abstract": "Scaling critic capacity is a promising direction for enhancing off-policy reinforcement learning (RL). However, larger critics are prone to overfitting and unstable in replay-buffer-based bootstrap training. This paper leverages Low-Rank Adaptation (LoRA) as a structural-sparsity regularizer for off-policy critics. Our approach freezes randomly initialized base matrices and solely optimizes low-rank adapters, thereby constraining critic updates to a low-dimensional subspace. Built on top of SimbaV2, we further develop a LoRA formulation, compatible with SimbaV2, that preserves its hyperspherical normalization geometry under frozen-backbone training. We evaluate our method with SAC and FastTD3 on DeepMind Control locomotion and IsaacLab robotics benchmarks. LoRA consistently achieves lower critic loss during training and stronger policy performance. Extensive experiments demonstrate that adaptive low-rank updates provide a simple, scalable, and effective structural regularization for critic learning in off-policy RL.", "authors": [ "Yuan Zhuang", "Yuexin Bian", "Sihong He", "Jie Feng", "Qing Su", "Songyang Han", "Jonathan Petit", "Shihao Ji", "Yuanyuan Shi", "Fei Miao" ], "year": 2026, "published_date": "2026-04-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.18978v1", "pdf_url": "https://arxiv.org/pdf/2604.18978v1", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "RL", "Robotics", "Evaluation", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.8, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Scaling critic capacity is a promising direction for enhancing off-policy reinforcement learning (RL). However, larger critics are prone to overfitting and unstable in replay-buffer-based bootstrap training.", "key_contribution": "Extensive experiments demonstrate that adaptive low-rank updates provide a simple, scalable, and effective structural regularization for critic learning in off-policy RL.", "why_it_matters": "Low-Rank Adaptation for Critic Learning in Off-Policy Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "Extensive experiments demonstrate that adaptive low-rank updates provide a simple, scalable, and effective structural…", "biggest_caveat": "However, larger critics are prone to overfitting and unstable in replay-buffer-based bootstrap training.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Fine-Tuning.", "url": "http://arxiv.org/abs/2604.18978v1", "difficulty": "beginner" }, { "id": "arxiv:2604.20496v1", "source": "arxiv", "source_type": "preprint", "title": "Mythos and the Unverified Cage: Z3-Based Pre-Deployment Verification for Frontier-Model Sandbox Infrastructure", "abstract": "The April 2026 Claude Mythos sandbox escape exposed a critical weakness in frontier AI containment: the infrastructure surrounding advanced models remains susceptible to formally characterizable arithmetic vulnerabilities. Anthropic has not publicly characterized the escape vector; some secondary accounts hypothesize a CWE-190 arithmetic vulnerability in sandbox networking code. We treat this as unverified and analyze the vulnerability class rather than the specific escape. This paper presents COBALT, a Z3 SMT-based formal verification engine for identifying CWE-190/191/195 arithmetic vulnerability patterns in C/C++ infrastructure prior to deployment. We distinguish two classes of contribution. Validated: COBALT detects arithmetic vulnerability patterns in production codebases, producing SAT verdicts with concrete witnesses and UNSAT guarantees under explicit safety bounds. We demonstrate this on four production case studies: NASA cFE, wolfSSL, Eclipse Mosquitto, and NASA F Prime, with reproducible encodings, verified solver output, and acknowledged security outcomes. Proposed: a four-layer containment framework consisting of COBALT, VERDICT, DIRECTIVE-4, and SENTINEL, mapping pre-deployment verification, pre-execution constraints, output control, and runtime monitoring to the failure modes exposed by the Mythos incident. Under explicit assumptions, we further argue that the publicly reported Mythos escape class is consistent with a Z3-expressible CWE-190 arithmetic formulation and that pre-deployment formal analysis would have been capable of surfacing the relevant pattern. The broader claim is infrastructural: frontier-model safety cannot depend on behavioral safeguards alone; the containment stack itself must be subjected to formal verification.", "authors": [ "Dominik Blain" ], "year": 2026, "published_date": "2026-04-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.20496v1", "pdf_url": "https://arxiv.org/pdf/2604.20496v1", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.5, "read_first_score": 5.34, "content_potential_score": 1.84, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The April 2026 Claude Mythos sandbox escape exposed a critical weakness in frontier AI containment: the infrastructure surrounding advanced models remains susceptible to formally characterizable arithmetic vulnerabilities. Anthropic has not publicly characterized the escape vector; some secondary accounts hypothesize a CWE-190 arithmetic vulnerability in sandbox networking code.", "key_contribution": "We demonstrate this on four production case studies: NASA cFE, wolfSSL, Eclipse Mosquitto, and NASA F Prime, with reproducible encodings, verified solver output, and acknowledged security outcomes.", "why_it_matters": "Mythos and the Unverified Cage: Z3-Based Pre-Deployment Verification for Frontier-Model Sandbox Infrastructure represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We demonstrate this on four production case studies: NASA cFE, wolfSSL, Eclipse Mosquitto, and NASA F Prime, with…", "biggest_caveat": "cannot depend on behavioral safeguards alone; the containment stack itself must be subjected to formal verification.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Artificial Intelligence.", "url": "http://arxiv.org/abs/2604.20496v1", "difficulty": "intermediate" }, { "id": "arxiv:2609.09907", "source": "arxiv", "source_type": "preprint", "title": "Meta-LinEXP3: Online-within-Online Learning for Adversarial Linear Contextual Bandits", "abstract": "Meta-learning has emerged as an effective paradigm for transferring knowledge across sequential bandit tasks. While substantial progress has been made for stochastic bandits and non-contextual adversarial bandits, meta-learning for adversarial linear contextual bandits (ALCBs) with random action sets remains largely unexplored. To address this problem, we propose Meta-LinEXP3, an online-within-online algorithm that constructs a predictable task-level prior from completed tasks to guide the inner LinEXP3 learner. For known context distributions, we develop a policy-centered estimator that achieves an intrinsic-dimension $\\mathcal{O}(\\sqrt{n})$ per-task regret bound. For unknown distributions, we introduce a past-only regularized moment estimator with an $\\mathcal{O}(n^{2/3})$ leading regret term and explicit finite-sample error. We further establish a direct connection between prior accuracy and transfer regret, showing that increasingly accurate priors yield sublinear transfer-dependent regret across tasks. Experiments demonstrate the effectiveness of Meta-LinEXP3, including its application to structured hyperspectral tensor sampling.", "authors": [ "Hao Li", "Jie Xu", "Zheng Xie" ], "year": 2026, "published_date": "2026-09-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.09907", "pdf_url": "https://arxiv.org/pdf/2609.09907", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.49, "read_first_score": 3.72, "content_potential_score": 0.55, "interestingness_score": 2.02, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Meta-learning has emerged as an effective paradigm for transferring knowledge across sequential bandit tasks. While substantial progress has been made for stochastic bandits and non-contextual adversarial bandits, meta-learning for adversarial linear contextual bandits (ALCBs) with random action sets remains largely unexplored.", "key_contribution": "To address this problem, we propose Meta-LinEXP3, an online-within-online algorithm that constructs a predictable task-level prior from completed tasks to guide the inner LinEXP3 learner.", "why_it_matters": "Meta-LinEXP3: Online-within-Online Learning for Adversarial Linear Contextual Bandits represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "To address this problem, we propose Meta-LinEXP3, an online-within-online algorithm that constructs a predictable…", "biggest_caveat": "butions, we develop a policy-centered estimator that achieves an intrinsic-dimension $\\mathcal{O}(\\sqrt{n})$ per-task regret bound.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2609.09907", "difficulty": "frontier" }, { "id": "arxiv:2508.09473", "source": "arxiv", "source_type": "preprint", "title": "NeuronTune: Fine-Grained Neuron Modulation for Balanced Safety-Utility Alignment in LLMs", "abstract": "Ensuring robust safety alignment while preserving utility is critical for the reliable deployment of Large Language Models (LLMs). However, current techniques fundamentally suffer from intertwined deficiencies: insufficient robustness against malicious attacks, frequent refusal of benign queries, degradation in generated text quality and general task performance, the former two reflecting tensions in robust safety and the latter constituting utility impairment. We attribute these limitations to the coarse-grained layer-wise interventions in existing methods. To resolve this, we propose NeuronTune, a fine-grained framework that pinpoints and modulates sparse neurons to achieve simultaneous safety-utility optimization. Our approach first pinpoints safety-critical and utility-preserving neurons across all layers via attack-aware attribution, then adapts meta-learning to adaptively modulate their activations. Crucially, the intervention scope of NeuronTune is dynamically controlled via neuron inclusion thresholds, providing a flexible mechanism to prioritize either security-critical or utility-priority requirements. Extensive experimental results demonstrate that our method outperforms existing state-of-the-art technologies, achieving superior model safety while maintaining excellent utility.", "authors": [ "Birong Pan", "Jianhao Chen", "Mayi Xu", "Qiankun Pi", "Yuanyuan Zhu", "Ming Zhong", "Tieyun Qian" ], "year": 2026, "published_date": "2026-08-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2508.09473", "pdf_url": "https://arxiv.org/pdf/2508.09473", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "Artificial Intelligence", "NLP", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.49, "read_first_score": 4.75, "content_potential_score": 1.0, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Ensuring robust safety alignment while preserving utility is critical for the reliable deployment of Large Language Models (LLMs). However, current techniques fundamentally suffer from intertwined deficiencies: insufficient robustness against malicious attacks, frequent refusal of benign queries, degradation in generated text quality and general task performance, the former two reflecting tensions in robust safety and the latter constituting utility impairment.", "key_contribution": "To resolve this, we propose NeuronTune, a fine-grained framework that pinpoints and modulates sparse neurons to achieve simultaneous safety-utility optimization.", "why_it_matters": "NeuronTune: Fine-Grained Neuron Modulation for Balanced Safety-Utility Alignment in LLMs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To resolve this, we propose NeuronTune, a fine-grained framework that pinpoints and modulates sparse neurons to achieve…", "biggest_caveat": "bute these limitations to the coarse-grained layer-wise interventions in existing methods.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2508.09473", "difficulty": "advanced" }, { "id": "arxiv:2604.24625v1", "source": "arxiv", "source_type": "preprint", "title": "Meta-CoT: Enhancing Granularity and Generalization in Image Editing", "abstract": "Unified multi-modal understanding/generative models have shown improved image editing performance by incorporating fine-grained understanding into their Chain-of-Thought (CoT) process. However, a critical question remains underexplored: what forms of CoT and training strategy can jointly enhance both the understanding granularity and generalization? To address this, we propose Meta-CoT, a paradigm that performs a two-level decomposition of any single-image editing operation with two key properties: (1) Decomposability. We observe that any editing intention can be represented as a triplet - (task, target, required understanding ability). Inspired by this, Meta-CoT decomposes both the editing task and the target, generating task-specific CoT and traversing editing operations on all targets. This decomposition enhances the model's understanding granularity of editing operations and guides it to learn each element of the triplet during training, substantially improving the editing capability. (2) Generalizability. In the second decomposition level, we further break down editing tasks into five fundamental meta-tasks. We find that training on these five meta-tasks, together with the other two elements of the triplet, is sufficient to achieve strong generalization across diverse, unseen editing tasks. To further align the model's editing behavior with its CoT reasoning, we introduce the CoT-Editing Consistency Reward, which encourages more accurate and effective utilization of CoT information during editing. Experiments demonstrate that our method achieves an overall 15.8% improvement across 21 editing tasks, and generalizes effectively to unseen editing tasks when trained on only a small set of meta-tasks. Our code, benchmark, and model are released at https://shiyi-zh0408.github.io/projectpages/Meta-CoT/", "authors": [ "Shiyi Zhang", "Yiji Cheng", "Tiankai Hang", "Zijin Yin", "Runze He", "Yu Xu", "Wenxun Dai", "Yunlong Lin", "Chunyu Wang", "Qinglin Lu", "Yansong Tang" ], "year": 2026, "published_date": "2026-04-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.24625v1", "pdf_url": "https://arxiv.org/pdf/2604.24625v1", "citations": 0, "topics": [], "tags": [ "Reasoning", "Multimodal", "Evaluation", "Artificial Intelligence", "Multimedia" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.49, "read_first_score": 6.88, "content_potential_score": 2.05, "interestingness_score": 2.77, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Unified multi-modal understanding/generative models have shown improved image editing performance by incorporating fine-grained understanding into their Chain-of-Thought (CoT) process. However, a critical question remains underexplored: what forms of CoT and training strategy can jointly enhance both the understanding granularity and generalization?", "key_contribution": "To address this, we propose Meta-CoT, a paradigm that performs a two-level decomposition of any single-image editing operation with two key properties: (1) Decomposability.", "why_it_matters": "Meta-CoT: Enhancing Granularity and Generalization in Image Editing represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "To address this, we propose Meta-CoT, a paradigm that performs a two-level decomposition of any single-image editing…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "http://arxiv.org/abs/2604.24625v1", "difficulty": "beginner" }, { "id": "arxiv:2608.15893", "source": "arxiv", "source_type": "preprint", "title": "Breaking and Defending LLM-Powered Social Media Bot Detection Systems", "abstract": "The rise of social media bots poses a persistent threat, enabling misinformation, opinion manipulation, and the erosion of trust in online platforms. To combat this, machine learning systems have been developed to detect and limit bot activity, but attackers continuously adapt through techniques such as adversarial learning and behavior imitation, fueling an ongoing arms race between bots and detection tools. Recent advances in large language models (LLMs) have significantly improved bot detection by enabling deeper semantic and contextual analysis of accounts and their content. However, this shift also introduces new attack surfaces, allowing adversaries to craft exploits that directly target the reasoning and generation mechanisms of LLM-based classifiers. Industry tools such as Anthropic's Claude Code Security similarly leverage LLMs for security-critical decisions, further motivating a careful study of their attack surfaces. In this work, we investigate both the offensive and defensive aspects of LLM-powered, threat-specific cybersecurity applications. While centered on the challenge of social media bot detection, our methodology and insights generalize to a broad class of LLM-powered cybersecurity systems, including phishing detection, email classification, and fraud analysis. We introduce two novel adversarial attack strategies that systematically exploit the semantic and contextual weaknesses of LLM-based classifiers, degrading their detection accuracy by up to 48%. To counter these threats, we propose a robust multi-LLM defense architecture designed to preserve detection reliability under adaptive adversarial conditions. Our solution, LSABRE (LLM-powered Social Adversarial Bot Recognition Ensemble), is a multi-LLM framework that substantially improves robustness across a range of attacks, maintaining 86% detection accuracy even under strong, adaptive adversarial pressure.", "authors": [ "Nof Orenstein", "Yoni Birman" ], "year": 2026, "published_date": "2026-08-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.15893", "pdf_url": "https://arxiv.org/pdf/2608.15893", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Robotics", "Adversarial", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.48, "read_first_score": 5.78, "content_potential_score": 0.55, "interestingness_score": 2.02, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The rise of social media bots poses a persistent threat, enabling misinformation, opinion manipulation, and the erosion of trust in online platforms. To combat this, machine learning systems have been developed to detect and limit bot activity, but attackers continuously adapt through techniques such as adversarial learning and behavior imitation, fueling an ongoing arms race between bots and detection tools.", "key_contribution": "We introduce two novel adversarial attack strategies that systematically exploit the semantic and contextual weaknesses of LLM-based classifiers, degrading their detection accuracy by up to 48%.", "why_it_matters": "Breaking and Defending LLM-Powered Social Media Bot Detection Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce two novel adversarial attack strategies that systematically exploit the semantic and contextual weaknesses…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.15893", "difficulty": "intermediate" }, { "id": "arxiv:2605.27044", "source": "arxiv", "source_type": "preprint", "title": "BatteryMFormer: Multi-level Learning for Battery Degradation Trajectory Forecasting", "abstract": "Early battery degradation trajectory forecasting (BDTF), which predicts the full-life state-of-health trajectory from early operational data, is critical for battery optimization, manufacturing, and deployment. Battery degradation data exhibit two key characteristics. First, degradation data present a multi-level structure, including regularities shared within aging conditions and trajectory patterns shared across batteries. Second, degradation-related variations in voltage-current profiles are often localized to specific state-of-charge (SOC) intervals. Existing approaches often fail to explicitly model these characteristics. To bridge this gap, we propose BatteryMFormer, a multi-level Transformer for early BDTF. BatteryMFormer integrates (1) an aging-condition-aware decoder that injects aging-condition priors via aging-condition-informed queries and aging-condition-aware attention, (2) a meta degradation pattern memory that learns and retrieves trajectory prototypes to guide long-horizon forecasting, and (3) a dual-view encoder that jointly captures temporal dynamics and SOC-localized variations from voltage and current time series. Extensive experiments on four battery domains show that BatteryMFormer consistently outperforms state-of-the-art baselines, marking a significant step toward reliable BDTF. Our code is available at https://github.com/Ruifeng-Tan/BatteryMFormer.", "authors": [ "Ruifeng Tan", "Jintao Dong", "Weixiang Hong", "Jia Li", "Jiaqiang Huang", "Tong-Yi Zhang" ], "year": 2026, "published_date": "2026-05-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.27044", "pdf_url": "https://arxiv.org/pdf/2605.27044", "citations": 0, "topics": [], "tags": [ "Transformers", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.48, "read_first_score": 4.84, "content_potential_score": 1.0, "interestingness_score": 2.24, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Early battery degradation trajectory forecasting (BDTF), which predicts the full-life state-of-health trajectory from early operational data, is critical for battery optimization, manufacturing, and deployment. Battery degradation data exhibit two key characteristics.", "key_contribution": "First, degradation data present a multi-level structure, including regularities shared within aging conditions and trajectory patterns shared across batteries.", "why_it_matters": "BatteryMFormer: Multi-level Learning for Battery Degradation Trajectory Forecasting represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "First, degradation data present a multi-level structure, including regularities shared within aging conditions and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2605.27044", "difficulty": "intermediate" }, { "id": "arxiv:2608.07870", "source": "arxiv", "source_type": "preprint", "title": "V-Simba: Unleashing the Architectural Potential of RL in Visual Continuous Control", "abstract": "Improving sample efficiency remains a core challenge in reinforcement learning (RL), especially in real-world settings like robotics, where data collection is costly. This challenge is pronounced in visual RL, where high-dimensional inputs often obscure learning signals. While prior work in visual RL has focused on algorithmic solutions, such as better dynamics models or exploration strategies, recent advances in state-based RL show that architectural design alone can lead to significant gains in sample efficiency. This raises an important question: Can these architectural principles transfer to visual RL? In response, we introduce V-Simba, a simple yet effective visual RL architecture inspired by the Simba architecture from state-based RL. Built on top of Soft Actor-Critic (SAC) with data augmentation, V-Simba modifies the architecture by adding normalization layers to stabilize training and using pointwise convolutions to reduce computation. Despite its simplicity, V-Simba matches or outperforms the state-of-the-art methods across the DMC, Adroit, and Meta-World benchmarks, while being more computationally efficient than DrQ-v2. We make our code publicly available at https://github.com/DAVIAN-Robotics/V-Simba.", "authors": [ "Donghu Kim", "Youngdo Lee", "Hojoon Lee", "Johan Obando-Ceron", "Byungkun Lee", "Aaron Courville", "Pablo Samuel Castro", "Jaegul Choo", "Clare Lyle" ], "year": 2026, "published_date": "2026-08-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.07870", "pdf_url": "https://arxiv.org/pdf/2608.07870", "citations": 0, "topics": [], "tags": [ "RL", "Robotics", "Evaluation", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.47, "read_first_score": 5.96, "content_potential_score": 1.5, "interestingness_score": 2.49, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Improving sample efficiency remains a core challenge in reinforcement learning (RL), especially in real-world settings like robotics, where data collection is costly. This challenge is pronounced in visual RL, where high-dimensional inputs often obscure learning signals.", "key_contribution": "While prior work in visual RL has focused on algorithmic solutions, such as better dynamics models or exploration strategies, recent advances in state-based RL show that architectural design alone can lead to significant gains in sample efficiency.", "why_it_matters": "V-Simba: Unleashing the Architectural Potential of RL in Visual Continuous Control represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "While prior work in visual RL has focused on algorithmic solutions, such as better dynamics models or exploration…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2608.07870", "difficulty": "beginner" }, { "id": "arxiv:2506.06891", "source": "arxiv", "source_type": "preprint", "title": "Robust In-Context Reinforcement Learning Under Reward Poisoning Attacks", "abstract": "We study the corruption-robustness of in-context reinforcement learning (ICRL), focusing on the Decision-Pretrained Transformer (DPT, Lee et al., 2023). To address the challenge of reward poisoning attacks targeting the DPT, we propose a novel adversarial training framework, called Adversarially Trained DPT (AT-DPT). Our method simultaneously trains a population of attackers to minimize the true reward of the DPT by poisoning environment rewards, and a DPT model to infer optimal actions from the poisoned data. We evaluate the effectiveness of our approach against standard bandit algorithms, including robust baselines designed to handle reward contamination. Our results show that AT-DPT significantly outperforms them in bandit settings under a learned attacker, and generalizes to more complex environments such as adaptive attackers and MDPs. It shows promise in ICRL as a meta-RL approach to learning effective corruption-robust algorithms.", "authors": [ "Paulius Sasnauskas", "Yiğit Yalın", "Goran Radanović" ], "year": 2026, "published_date": "2026-06-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2506.06891", "pdf_url": "https://arxiv.org/pdf/2506.06891", "citations": 0, "topics": [], "tags": [ "Transformers", "RL", "Adversarial", "Machine Learning", "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.47, "read_first_score": 5.01, "content_potential_score": 0.55, "interestingness_score": 2.01, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We study the corruption-robustness of in-context reinforcement learning (ICRL), focusing on the Decision-Pretrained Transformer (DPT, Lee et al., 2023). To address the challenge of reward poisoning attacks targeting the DPT, we propose a novel adversarial training framework, called Adversarially Trained DPT (AT-DPT).", "key_contribution": "To address the challenge of reward poisoning attacks targeting the DPT, we propose a novel adversarial training framework, called Adversarially Trained DPT (AT-DPT).", "why_it_matters": "Robust In-Context Reinforcement Learning Under Reward Poisoning Attacks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "To address the challenge of reward poisoning attacks targeting the DPT, we propose a novel adversarial training…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2506.06891", "difficulty": "advanced" }, { "id": "arxiv:2605.12368", "source": "arxiv", "source_type": "preprint", "title": "MetaColloc: Optimization-Free PDE Solving via Meta-Learned Basis Functions", "abstract": "Solving partial differential equations (PDEs) with machine learning typically requires training a new neural network for every new equation. This optimization is slow. We introduce MetaColloc. It is an optimization-free and data-free framework that removes this bottleneck completely. We decouple basis discovery from the solving process. We meta-train a dual-branch neural network on diverse Gaussian Random Fields. This offline process creates a universal dictionary of neural basis functions. At test time, we freeze the network. We solve the PDE by assembling a collocation matrix. We find the solution through a single linear least squares step. For non-linear PDEs, we apply the Newton-Raphson method to achieve fast quadratic convergence. Our experiments across six 2D and 3D PDEs show massive improvements. MetaColloc reaches state-of-the-art accuracy on smooth and non-linear problems. It also reduces test-time computation by several orders of magnitude. Finally, we provide a detailed frequency sweep analysis. This analysis reveals a critical mismatch between function approximation and operator stability at extremely high frequencies. This profound finding opens a clear path toward future operator-aware meta-learning.", "authors": [ "Zichuan Yang" ], "year": 2026, "published_date": "2026-05-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.12368", "pdf_url": "https://arxiv.org/pdf/2605.12368", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.47, "read_first_score": 5.39, "content_potential_score": 0.0, "interestingness_score": 1.74, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Solving partial differential equations (PDEs) with machine learning typically requires training a new neural network for every new equation. This optimization is slow.", "key_contribution": "We introduce MetaColloc.", "why_it_matters": "MetaColloc: Optimization-Free PDE Solving via Meta-Learned Basis Functions represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "We introduce MetaColloc.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Machine Learning.", "url": "https://arxiv.org/abs/2605.12368", "difficulty": "intermediate" }, { "id": "arxiv:2602.04431", "source": "arxiv", "source_type": "preprint", "title": "MaMa: A Game-Theoretic Approach for Designing Safe Agentic Systems", "abstract": "LLM-based multi-agent systems have demonstrated impressive capabilities, but they also introduce significant safety risks when individual agents fail or behave adversarially. In this work, we study the automated design of agentic systems that remain safe even when a subset of agents is compromised. Inspired by Stackelberg security games, we formalize this problem as a game between a system designer (the Meta-Agent) and a best-responding Meta-Adversary that selects and compromises a subset of agents to minimize safety. We propose Meta-Adversary-Meta-Agent (MaMa), a novel algorithm inspired by this formalization for automatically designing safe agentic systems. Our approach uses LLM-based adversarial search, where the Meta-Agent iteratively proposes system designs and receives feedback based on the strongest attacks discovered by the Meta-Adversary. Empirical evaluations across diverse environments show that systems designed with MaMa consistently defend against worst-case attacks while maintaining performance comparable to systems optimized solely for task success. Moreover, the resulting systems generalize to stronger adversaries, as well as ones with different attack objectives or underlying LLMs, demonstrating robust safety beyond the training setting.", "authors": [ "Jonathan Nöther", "Adish Singla", "Goran Radanovic" ], "year": 2026, "published_date": "2026-05-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.04431", "pdf_url": "https://arxiv.org/pdf/2602.04431", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Info Extraction", "Machine Learning", "Game Theory" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.47, "read_first_score": 5.43, "content_potential_score": 1.55, "interestingness_score": 2.51, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "LLM-based multi-agent systems have demonstrated impressive capabilities, but they also introduce significant safety risks when individual agents fail or behave adversarially. In this work, we study the automated design of agentic systems that remain safe even when a subset of agents is compromised.", "key_contribution": "LLM-based multi-agent systems have demonstrated impressive capabilities, but they also introduce significant safety risks when individual agents fail or behave adversarially.", "why_it_matters": "MaMa: A Game-Theoretic Approach for Designing Safe Agentic Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "LLM-based multi-agent systems have demonstrated impressive capabilities, but they also introduce significant safety…", "biggest_caveat": "but they also introduce significant safety risks when individual agents fail or behave adversarially.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2602.04431", "difficulty": "intermediate" }, { "id": "arxiv:2604.00717v1", "source": "arxiv", "source_type": "preprint", "title": "GRASP: Gradient Realignment via Active Shared Perception for Multi-Agent Collaborative Optimization", "abstract": "Non-stationarity arises from concurrent policy updates and leads to persistent environmental fluctuations. Existing approaches like Centralized Training with Decentralized Execution (CTDE) and sequential update schemes mitigate this issue. However, since the perception of the policies of other agents remains dependent on sampling environmental interaction data, the agent essentially operates in a passive perception state. This inevitably triggers equilibrium oscillations and significantly slows the convergence speed of the system. To address this issue, we propose Gradient Realignment via Active Shared Perception (GRASP), a novel framework that defines generalized Bellman equilibrium as a stable objective for policy evolution. The core mechanism of GRASP involves utilizing the independent gradients of agents to derive a defined consensus gradient, enabling agents to actively perceive policy updates and optimize team collaboration. Theoretically, we leverage the Kakutani Fixed-Point Theorem to prove that the consensus direction $u^*$ guarantees the existence and attainability of this equilibrium. Extensive experiments on StarCraft II Multi-Agent Challenge (SMAC) and Google Research Football (GRF) demonstrate the scalability and promising performance of the framework.", "authors": [ "Sihan Zhou", "Tiantian He", "Yifan Lu", "Yaqing Hou", "Yew-Soon Ong" ], "year": 2026, "published_date": "2026-04-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.00717v1", "pdf_url": "https://arxiv.org/pdf/2604.00717v1", "citations": 0, "topics": [], "tags": [ "AI Safety", "Multi-Agent Systems", "Artificial Intelligence", "AI Safety & Alignment" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.47, "read_first_score": 4.64, "content_potential_score": 0.0, "interestingness_score": 1.74, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Non-stationarity arises from concurrent policy updates and leads to persistent environmental fluctuations. Existing approaches like Centralized Training with Decentralized Execution (CTDE) and sequential update schemes mitigate this issue.", "key_contribution": "To address this issue, we propose Gradient Realignment via Active Shared Perception (GRASP), a novel framework that defines generalized Bellman equilibrium as a stable objective for policy evolution.", "why_it_matters": "GRASP: Gradient Realignment via Active Shared Perception for Multi-Agent Collaborative Optimization advances the critical goal of making AI systems safer, more reliable, and aligned with human values.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "To address this issue, we propose Gradient Realignment via Active Shared Perception (GRASP), a novel framework that…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in AI Safety.", "url": "http://arxiv.org/abs/2604.00717v1", "difficulty": "frontier" }, { "id": "arxiv:2606.20538", "source": "arxiv", "source_type": "preprint", "title": "Multi-Task Bayesian In-Context Learning", "abstract": "Bayesian predictive inference provides a principled framework for uncertainty quantification, data efficiency, and robust generalization. However, exact inference is often intractable, and scalable approximations may remain computationally expensive or require restrictive modeling assumptions that degrade predictive performance. Prior-Data Fitted and in-context models have recently emerged as an amortized alternative by learning to map datasets directly to predictive distributions, but existing approaches are tightly coupled to the support of the training prior and lack explicit mechanisms for adapting to new priors at test time, resulting in limited robustness under distribution shift. We introduce a multi-task in-context learning framework for amortized hierarchical Bayesian predictive inference that explicitly represents prior information as a prefix of in-context datasets. A transformer trained on sequences of prior and target tasks learns to adapt its predictions across families of priors. On a suite of evaluations with increasing difficulty, including out-of-meta-distribution priors and priors with high-dimensional latent structures, our method matches oracle Bayesian predictors while being orders of magnitude faster. We further demonstrate its practical relevance on a real-world spatiotemporal temperature prediction benchmark. Code is available at https://github.com/martianmartina/multi-task-bayesian-icl/.", "authors": [ "Qingyang Zhu", "Eric Karl Oermann", "Kyunghyun Cho" ], "year": 2026, "published_date": "2026-06-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.20538", "pdf_url": "https://arxiv.org/pdf/2606.20538", "citations": 0, "topics": [], "tags": [ "Prompting", "Transformers", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.46, "read_first_score": 5.0, "content_potential_score": 1.5, "interestingness_score": 2.48, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Bayesian predictive inference provides a principled framework for uncertainty quantification, data efficiency, and robust generalization. However, exact inference is often intractable, and scalable approximations may remain computationally expensive or require restrictive modeling assumptions that degrade predictive performance.", "key_contribution": "We introduce a multi-task in-context learning framework for amortized hierarchical Bayesian predictive inference that explicitly represents prior information as a prefix of in-context datasets.", "why_it_matters": "Multi-Task Bayesian In-Context Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We introduce a multi-task in-context learning framework for amortized hierarchical Bayesian predictive inference that…", "biggest_caveat": "bution shift.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2606.20538", "difficulty": "frontier" }, { "id": "arxiv:2412.16720", "source": "arxiv", "source_type": "preprint", "title": "OpenAI o1 System Card", "abstract": "The o1 model series is trained with large-scale reinforcement learning to reason using chain of thought. These advanced reasoning capabilities provide new avenues for improving the safety and robustness of our models. In particular, our models can reason about our safety policies in context when responding to potentially unsafe prompts, through deliberative alignment. This leads to state-of-the-art performance on certain benchmarks for risks such as generating illicit advice, choosing stereotyped responses, and succumbing to known jailbreaks. Training models to incorporate a chain of thought before answering has the potential to unlock substantial benefits, while also increasing potential risks that stem from heightened intelligence. Our results underscore the need for building robust alignment methods, extensively stress-testing their efficacy, and maintaining meticulous risk management protocols. This report outlines the safety work carried out for the OpenAI o1 and OpenAI o1-mini models, including safety evaluations, external red teaming, and Preparedness Framework evaluations.", "authors": [ "OpenAI", ":", "Aaron Jaech", "Adam Kalai", "Adam Lerer", "Adam Richardson", "Ahmed El-Kishky", "Aiden Low", "Alec Helyar", "Aleksander Madry", "Alex Beutel", "Alex Carney", "Alex Iftimie", "Alex Karpenko", "Alex Tachard Passos", "Alexander Neitz", "Alexander Prokofiev", "Alexander Wei", "Allison Tam", "Ally Bennett", "Ananya Kumar", "Andre Saraiva", "Andrea Vallone", "Andrew Duberstein", "Andrew Kondrich", "Andrey Mishchenko", "Andy Applebaum", "Angela Jiang", "Ashvin Nair", "Barret Zoph", "Behrooz Ghorbani", "Bohan Zhang", "Ben Rossen", "Benjamin Sokolowsky", "Boaz Barak", "Bob McGrew", "Borys Minaiev", "Botao Hao", "Bowen Baker", "Brandon Houghton", "Brandon McKinzie", "Brydon Eastman", "Camillo Lugaresi", "Cary Bassin", "Cary Hudson", "Chak Ming Li", "Charles de Bourcy", "Chelsea Voss", "Chen Shen", "Chong Zhang", "Chris Koch", "Chris Orsinger", "Christopher Hesse", "Claudia Fischer", "Clive Chan", "Dan Roberts", "Daniel Kappler", "Daniel Levy", "Daniel Selsam", "David Dohan", "David Farhi", "David Mely", "David Robinson", "Dimitris Tsipras", "Doug Li", "Dragos Oprica", "Eben Freeman", "Eddie Zhang", "Edmund Wong", "Elizabeth Proehl", "Enoch Cheung", "Eric Mitchell", "Eric Wallace", "Erik Ritter", "Evan Mays", "Fan Wang", "Felipe Petroski Such", "Filippo Raso", "Florencia Leoni", "Foivos Tsimpourlas", "Francis Song", "Fred von Lohmann", "Freddie Sulit", "Geoff Salmon", "Giambattista Parascandolo", "Gildas Chabot", "Grace Zhao", "Greg Brockman", "Guillaume Leclerc", "Hadi Salman", "Haiming Bao", "Hao Sheng", "Hart Andrin", "Hessam Bagherinezhad", "Hongyu Ren", "Hunter Lightman", "Hyung Won Chung", "Ian Kivlichan", "Ian O'Connell", "Ian Osband", "Ignasi Clavera Gilaberte", "Ilge Akkaya", "Ilya Kostrikov", "Ilya Sutskever", "Irina Kofman", "Jakub Pachocki", "James Lennon", "Jason Wei", "Jean Harb", "Jerry Twore", "Jiacheng Feng", "Jiahui Yu", "Jiayi Weng", "Jie Tang", "Jieqi Yu", "Joaquin Quiñonero Candela", "Joe Palermo", "Joel Parish", "Johannes Heidecke", "John Hallman", "John Rizzo", "Jonathan Gordon", "Jonathan Uesato", "Jonathan Ward", "Joost Huizinga", "Julie Wang", "Kai Chen", "Kai Xiao", "Karan Singhal", "Karina Nguyen", "Karl Cobbe", "Katy Shi", "Kayla Wood", "Kendra Rimbach", "Keren Gu-Lemberg", "Kevin Liu", "Kevin Lu", "Kevin Stone", "Kevin Yu", "Lama Ahmad", "Lauren Yang", "Leo Liu", "Leon Maksin", "Leyton Ho", "Liam Fedus", "Lilian Weng", "Linden Li", "Lindsay McCallum", "Lindsey Held", "Lorenz Kuhn", "Lukas Kondraciuk", "Lukasz Kaiser", "Luke Metz", "Madelaine Boyd", "Maja Trebacz", "Manas Joglekar", "Mark Chen", "Marko Tintor", "Mason Meyer", "Matt Jones", "Matt Kaufer", "Max Schwarzer", "Meghan Shah", "Mehmet Yatbaz", "Melody Y. Guan", "Mengyuan Xu", "Mengyuan Yan", "Mia Glaese", "Mianna Chen", "Michael Lampe", "Michael Malek", "Michele Wang", "Michelle Fradin", "Mike McClay", "Mikhail Pavlov", "Miles Wang", "Mingxuan Wang", "Mira Murati", "Mo Bavarian", "Mostafa Rohaninejad", "Nat McAleese", "Neil Chowdhury", "Neil Chowdhury", "Nick Ryder", "Nikolas Tezak", "Noam Brown", "Ofir Nachum", "Oleg Boiko", "Oleg Murk", "Olivia Watkins", "Patrick Chao", "Paul Ashbourne", "Pavel Izmailov", "Peter Zhokhov", "Rachel Dias", "Rahul Arora", "Randall Lin", "Rapha Gontijo Lopes", "Raz Gaon", "Reah Miyara", "Reimar Leike", "Renny Hwang", "Rhythm Garg", "Robin Brown", "Roshan James", "Rui Shu", "Ryan Cheu", "Ryan Greene", "Saachi Jain", "Sam Altman", "Sam Toizer", "Sam Toyer", "Samuel Miserendino", "Sandhini Agarwal", "Santiago Hernandez", "Sasha Baker", "Scott McKinney", "Scottie Yan", "Shengjia Zhao", "Shengli Hu", "Shibani Santurkar", "Shraman Ray Chaudhuri", "Shuyuan Zhang", "Siyuan Fu", "Spencer Papay", "Steph Lin", "Suchir Balaji", "Suvansh Sanjeev", "Szymon Sidor", "Tal Broda", "Aidan Clark", "Tao Wang", "Taylor Gordon", "Ted Sanders", "Tejal Patwardhan", "Thibault Sottiaux", "Thomas Degry", "Thomas Dimson", "Tianhao Zheng", "Timur Garipov", "Tom Stasi", "Trapit Bansal", "Trevor Creech", "Troy Peterson", "Tyna Eloundou", "Valerie Qi", "Vineet Kosaraju", "Vinnie Monaco", "Vitchyr Pong", "Vlad Fomenko", "Weiyi Zheng", "Wenda Zhou", "Wenting Zhan", "Wes McCabe", "Wojciech Zaremba", "Yann Dubois", "Yinghai Lu", "Yining Chen", "Young Cha", "Yu Bai", "Yuchen He", "Yuchen Zhang", "Yunyun Wang", "Zheng Shao", "Zhuohan Li" ], "year": 2026, "published_date": "2026-04-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2412.16720", "pdf_url": "https://arxiv.org/pdf/2412.16720", "citations": 0, "topics": [], "tags": [ "Reasoning", "AI Safety", "RL", "Evaluation", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.46, "read_first_score": 4.19, "content_potential_score": 0.0, "interestingness_score": 1.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The o1 model series is trained with large-scale reinforcement learning to reason using chain of thought. These advanced reasoning capabilities provide new avenues for improving the safety and robustness of our models.", "key_contribution": "The o1 model series is trained with large-scale reinforcement learning to reason using chain of thought.", "why_it_matters": "OpenAI o1 System Card represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "The o1 model series is trained with large-scale reinforcement learning to reason using chain of thought.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2412.16720", "difficulty": "beginner" }, { "id": "arxiv:2605.29729", "source": "arxiv", "source_type": "preprint", "title": "Realistic honeypot evaluations for scheming propensity", "abstract": "We introduce scheming honeypot evaluations, a framework for testing whether models will pursue instrumental goals if given the opportunity. Our scheming honeypot evaluations take the form of coding tasks in Google's alignment research codebases. In a real internal deployment setting, Gemini models do not demonstrate unprompted scheming. If prompts explicitly encourage agency (situational awareness or goal-directedness) and/or give the model a hidden goal, models sometimes scheme or attempt sabotage. Validating the realism of our setting, models show low rates of evaluation awareness, usually due to agency prompts rather than the environments.", "authors": [ "Victoria Krakovna", "David Lindner", "Lewis Ho", "Sebastian Farquhar", "Rohin Shah" ], "year": 2026, "published_date": "2026-05-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.29729", "pdf_url": "https://arxiv.org/pdf/2605.29729", "citations": 0, "topics": [], "tags": [ "AI Safety", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.45, "read_first_score": 2.89, "content_potential_score": 1.0, "interestingness_score": 2.23, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce scheming honeypot evaluations, a framework for testing whether models will pursue instrumental goals if given the opportunity. Our scheming honeypot evaluations take the form of coding tasks in Google's alignment research codebases.", "key_contribution": "We introduce scheming honeypot evaluations, a framework for testing whether models will pursue instrumental goals if given the opportunity.", "why_it_matters": "Realistic honeypot evaluations for scheming propensity represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We introduce scheming honeypot evaluations, a framework for testing whether models will pursue instrumental goals if…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2605.29729", "difficulty": "advanced" }, { "id": "arxiv:2604.11248v1", "source": "arxiv", "source_type": "preprint", "title": "Evolving Many Worlds: Towards Open-Ended Discovery in Petri Dish NCA via Population-Based Training", "abstract": "The generation of sustained, open-ended complexity from local interactions remains a fundamental challenge in artificial life. Differentiable multi-agent systems, such as Petri Dish Neural Cellular Automata (PD-NCA), exhibit rich self-organization driven purely by spatial competition; however, they are highly sensitive to hyperparameters and frequently collapse into uninteresting patterns and dynamics, such as frozen equilibria or structureless noise. In this paper, we introduce PBT-NCA, a meta-evolutionary algorithm that evolves a population of PD-NCAs subject to a composite objective that rewards both historical behavioral novelty and contemporary visual diversity. Driven by this continuous evolutionary pressure, PBT-NCA spontaneously generates a plethora of emergent lifelike phenomena over extended horizons-a hallmark of true open-endedness. Strikingly, the substrate autonomously discovers diverse morphological survival and self-organization strategies. We observe highly regular, coordinated periodic waves; spore-like scattering where homogeneous groups eject cell-like clusters to colonize distant territories; and fluid, shape-shifting macro-structures that migrate across the substrate, maintaining stable outer boundaries that enclose highly active interiors. By actively penalizing monocultures and dead states, PBT-NCA sustains a state of effective complexity that is neither globally ordered nor globally random, operating persistently at the \"edge of chaos\".", "authors": [ "Uljad Berdica", "Jakob Foerster", "Frank Hutter", "Arber Zela" ], "year": 2026, "published_date": "2026-04-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.11248v1", "pdf_url": "https://arxiv.org/pdf/2604.11248v1", "citations": 0, "topics": [], "tags": [ "Multi-Agent Systems", "Artificial Intelligence", "Neural Networks" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.45, "read_first_score": 5.13, "content_potential_score": 0.0, "interestingness_score": 1.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The generation of sustained, open-ended complexity from local interactions remains a fundamental challenge in artificial life. Differentiable multi-agent systems, such as Petri Dish Neural Cellular Automata (PD-NCA), exhibit rich self-organization driven purely by spatial competition; however, they are highly sensitive to hyperparameters and frequently collapse into uninteresting patterns and dynamics, such as frozen equilibria or structureless noise.", "key_contribution": "In this paper, we introduce PBT-NCA, a meta-evolutionary algorithm that evolves a population of PD-NCAs subject to a composite objective that rewards both historical behavioral novelty and contemporary visual diversity.", "why_it_matters": "Evolving Many Worlds: Towards Open-Ended Discovery in Petri Dish NCA via Population-Based Training represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multi-Agent Systems.", "one_line_takeaway": "In this paper, we introduce PBT-NCA, a meta-evolutionary algorithm that evolves a population of PD-NCAs subject to a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Multi-Agent Systems.", "url": "http://arxiv.org/abs/2604.11248v1", "difficulty": "intermediate" }, { "id": "arxiv:2510.12624", "source": "arxiv", "source_type": "preprint", "title": "Learning-To-Measure: In-Context Active Feature Acquisition", "abstract": "Active feature acquisition (AFA) is a sequential decision-making problem where the goal is to improve model performance for test instances by adaptively selecting which features to acquire. In practice, AFA methods often learn from retrospective data with systematic missingness in the features and limited task-specific labels. Most prior work addresses acquisition for a single predetermined task, limiting scalability. To address this limitation, we formalize the meta-AFA problem, where the goal is to learn acquisition policies across various tasks. We introduce Learning-to-Measure (L2M), which consists of i) reliable uncertainty quantification over unseen tasks, and ii) an uncertainty-guided greedy feature acquisition agent that maximizes conditional mutual information. We demonstrate a sequence-modeling or autoregressive pre-training approach that underpins reliable uncertainty quantification for tasks with arbitrary missingness. L2M operates directly on datasets with retrospective missingness and performs the meta-AFA task in-context, eliminating per-task retraining. Across synthetic and real-world tabular benchmarks, L2M matches or surpasses task-specific baselines, particularly under scarce labels and high missingness.", "authors": [ "Yuta Kobayashi", "Zilin Jing", "Jiayu Yao", "Hongseok Namkoong", "Shalmali Joshi" ], "year": 2026, "published_date": "2026-05-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.12624", "pdf_url": "https://arxiv.org/pdf/2510.12624", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "Structured Data", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.45, "read_first_score": 5.59, "content_potential_score": 0.0, "interestingness_score": 1.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Active feature acquisition (AFA) is a sequential decision-making problem where the goal is to improve model performance for test instances by adaptively selecting which features to acquire. In practice, AFA methods often learn from retrospective data with systematic missingness in the features and limited task-specific labels.", "key_contribution": "We introduce Learning-to-Measure (L2M), which consists of i) reliable uncertainty quantification over unseen tasks, and ii) an uncertainty-guided greedy feature acquisition agent that maximizes conditional mutual information.", "why_it_matters": "Learning-To-Measure: In-Context Active Feature Acquisition represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "We introduce Learning-to-Measure (L2M), which consists of i) reliable uncertainty quantification over unseen tasks, and…", "biggest_caveat": "limitation, we formalize the meta-AFA problem, where the goal is to learn acquisition policies across various tasks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Self-Supervised.", "url": "https://arxiv.org/abs/2510.12624", "difficulty": "beginner" }, { "id": "arxiv:2603.02122", "source": "arxiv", "source_type": "preprint", "title": "Deep Unfolding for SIM-Assisted Multiband MU-MISO Downlink Systems", "abstract": "To improve the efficiency of scarce radio-frequency (RF) resources in next-generation wireless systems, an intelligent transceiver architecture based on stacked intelligent metasurfaces (SIM) has recently emerged, where multiple programmable metasurface layers are cascaded and each layer comprises passive meta-atoms that perform beamforming directly in the wave domain. In parallel, inter-band carrier aggregation enables multi-band transmission with high spectral efficiency. Their integration in multi-band multiuser downlink transmission is challenging because a single SIM phase configuration must remain effective across all subcarriers, while user scheduling and power allocation vary across scheduling intervals. To address these challenges, we propose an alternating-optimization framework that decomposes the joint design into a power-constrained precoder update and a SIM phase update. For the SIM phase subproblem, we develop a physically consistent multi-band deep-unfolding network (MBDU-Net) that unrolls projected-gradient phase updates into a compact trainable architecture. Each stage computes an analytic gradient from the cascaded SIM channel model and learns lightweight parameters, including per-stage step sizes and band-aware scaling, enabling fast convergence. Numerical results for multi-band multiuser downlink scenarios demonstrate reliable convergence and consistent sum-rate gains on unseen channel realizations.", "authors": [ "Muhammad Ibrahim", "Amine Mezghani", "Ekram Hossain" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.02122", "pdf_url": "https://arxiv.org/pdf/2603.02122", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.45, "read_first_score": 4.44, "content_potential_score": 1.0, "interestingness_score": 2.23, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "To improve the efficiency of scarce radio-frequency (RF) resources in next-generation wireless systems, an intelligent transceiver architecture based on stacked intelligent metasurfaces (SIM) has recently emerged, where multiple programmable metasurface layers are cascaded and each layer comprises passive meta-atoms that perform beamforming directly in the wave domain. In parallel, inter-band carrier aggregation enables multi-band transmission with high spectral efficiency.", "key_contribution": "To address these challenges, we propose an alternating-optimization framework that decomposes the joint design into a power-constrained precoder update and a SIM phase update.", "why_it_matters": "Deep Unfolding for SIM-Assisted Multiband MU-MISO Downlink Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "To address these challenges, we propose an alternating-optimization framework that decomposes the joint design into a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2603.02122", "difficulty": "intermediate" }, { "id": "arxiv:2609.13808", "source": "arxiv", "source_type": "preprint", "title": "DARE: Dialectical Agentic Reasoning for Structured Knowledge Fact Checking", "abstract": "Structured knowledge fact checking aims to determine the truthfulness of natural language claims by reasoning over structured evidence. Recent program-generation approaches leverage large language models (LLMs) to generate executable graph reasoning programs, achieving strong performance on structured knowledge fact checking benchmarks. However, these methods remain limited by invalid relation generation, single-path reasoning that lacks self-correction, and biased evidence assessment that tends to overestimate supporting signals. We propose Dialectical Agentic Reasoning (DARE), a multi-agent framework that formulates structured knowledge fact checking as an iterative retrieve-reason-reflect process. DARE integrates relation-grounded evidence retrieval to constrain reasoning to valid structures, dialectical bidirectional verification to evaluate evidence from both supporting and refuting perspectives, and confidence-driven meta-reflection to dynamically determine whether additional evidence exploration is necessary. Extensive experiments demonstrate the effectiveness of DARE in structured knowledge fact checking, with an 8B backbone achieving 88.12% accuracy and matching or surpassing GPT-4o-based program-generation baselines, which attests to the efficacy of dialectical agentic reasoning in eliciting the latent reasoning capabilities of LLMs.", "authors": [ "Yifei Li", "Xiaohan Zheng", "Wentao Qian", "Liansheng Zhuang" ], "year": 2026, "published_date": "2026-09-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.13808", "pdf_url": "https://arxiv.org/pdf/2609.13808", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "Fairness & Ethics", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.44, "read_first_score": 5.44, "content_potential_score": 0.0, "interestingness_score": 1.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Structured knowledge fact checking aims to determine the truthfulness of natural language claims by reasoning over structured evidence. Recent program-generation approaches leverage large language models (LLMs) to generate executable graph reasoning programs, achieving strong performance on structured knowledge fact checking benchmarks.", "key_contribution": "We propose Dialectical Agentic Reasoning (DARE), a multi-agent framework that formulates structured knowledge fact checking as an iterative retrieve-reason-reflect process.", "why_it_matters": "DARE: Dialectical Agentic Reasoning for Structured Knowledge Fact Checking represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose Dialectical Agentic Reasoning (DARE), a multi-agent framework that formulates structured knowledge fact…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.13808", "difficulty": "beginner" }, { "id": "arxiv:2608.10045", "source": "arxiv", "source_type": "preprint", "title": "Finding the Signal in the Spam: Jointly Learning Rewards and Worker Reliability from Pairwise Comparisons", "abstract": "The problem of learning from pairwise comparisons has been widely studied across many domains such as recommendation systems, social choice, and more recently, fine-tuning large language models. In this problem, the goal is to learn item rewards based on pairwise comparisons between them. In many scenarios, these comparisons are elicited from crowdworkers using platforms such as Amazon Mechanical Turk, Scale AI, etc. However, crowdworkers are often unreliable due to limited domain knowledge or revenue-maximizing (spamming) behavior. In this work, our goal is to understand whether worker reliability (competency) can be learned jointly with item rewards. To this end, we adopt the Boltzmann-rational model for pairwise comparisons, which extends the Bradley-Terry-Luce model by incorporating worker competencies. We derive an EM-based algorithm for learning under this model by introducing Polya-Gamma latent variables to transform the logistic likelihood into a conditionally Gaussian form, enabling tractable optimization and leading to a simplified $Q$ function in the E-step of the algorithm. This technique allows us to reduce our formulation to a matrix sensing problem, using which we establish theoretical convergence guarantees for our algorithm. We conduct extensive experiments on real-world and synthetic datasets. These experiments demonstrate the advantages of using our algorithm over several baselines and confirm its strong robustness to both spammers and adversarial workers, highlighting its practical effectiveness in realistic crowdsourcing and reward learning settings. The code and data is publicly available at https://github.com/KaustubhShejole/BoRa_EM.", "authors": [ "Kaustubh Shivshankar Shejole", "Tanish Agarwal", "Arpit Agarwal", "Avishek Ghosh" ], "year": 2026, "published_date": "2026-08-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.10045", "pdf_url": "https://arxiv.org/pdf/2608.10045", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "Adversarial", "Artificial Intelligence", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.44, "read_first_score": 5.68, "content_potential_score": 0.0, "interestingness_score": 1.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The problem of learning from pairwise comparisons has been widely studied across many domains such as recommendation systems, social choice, and more recently, fine-tuning large language models. In this problem, the goal is to learn item rewards based on pairwise comparisons between them.", "key_contribution": "These experiments demonstrate the advantages of using our algorithm over several baselines and confirm its strong robustness to both spammers and adversarial workers, highlighting its practical effectiveness in realistic crowdsourcing and reward learning settings.", "why_it_matters": "Finding the Signal in the Spam: Jointly Learning Rewards and Worker Reliability from Pairwise Comparisons represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "These experiments demonstrate the advantages of using our algorithm over several baselines and confirm its strong…", "biggest_caveat": "However, crowdworkers are often unreliable due to limited domain knowledge or revenue-maximizing (spamming) behavior.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.10045", "difficulty": "intermediate" }, { "id": "arxiv:2607.19375", "source": "arxiv", "source_type": "preprint", "title": "Economic Evaluations of Language Models", "abstract": "Language models perform economically valuable work, yet they are not currently assessed for how well they perform every economically valuable task. We introduce EconEvals as an open-source evaluation suite to measure capabilities relevant to tasks, work activities, and occupations in the US labor economy. We ground the evaluation suite in real user queries to language models where possible, and supplement these with synthetic data. Our evaluations improve coverage over OpenAI's GDPval benchmark, which is the existing state-of-the-art that covers 5% of US occupations, at 500x lower cost. Alongside benchmarks, we also introduce a simulation-based exposure measure to estimate how much time current language model capabilities could save across all tasks belonging to all US occupations, with detailed accounting for each estimate. Our estimates indicate that current models could save workers substantial time on at least half of their tasks in 47% of occupations. However, for 79% of tasks where we predict substantial time savings, observed Claude usage is low, suggesting that existing usage lags potential. Beyond inherent constraints of language model chatbots, our data identifies privacy and proprietary systems as the principal bottlenecks limiting further time savings from AI. Overall, we introduce adaptable infrastructure that grounds inferences about language models' labor-market impact in their current capabilities, which can be continually updated as capabilities improve.", "authors": [ "Alexander Wan", "Stephane Hatgis-Kessell", "Tomás Aguirre", "Percy Liang", "Rishi Bommasani" ], "year": 2026, "published_date": "2026-06-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.19375", "pdf_url": "https://arxiv.org/pdf/2607.19375", "citations": 0, "topics": [], "tags": [ "Dialogue", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.44, "read_first_score": 6.37, "content_potential_score": 1.5, "interestingness_score": 2.47, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Language models perform economically valuable work, yet they are not currently assessed for how well they perform every economically valuable task. We introduce EconEvals as an open-source evaluation suite to measure capabilities relevant to tasks, work activities, and occupations in the US labor economy.", "key_contribution": "We introduce EconEvals as an open-source evaluation suite to measure capabilities relevant to tasks, work activities, and occupations in the US labor economy.", "why_it_matters": "Economic Evaluations of Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Dialogue.", "one_line_takeaway": "We introduce EconEvals as an open-source evaluation suite to measure capabilities relevant to tasks, work activities,…", "biggest_caveat": "However, for 79% of tasks where we predict substantial time savings, observed Claude usage is low, suggesting that existing usage lags potential.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Dialogue.", "url": "https://arxiv.org/abs/2607.19375", "difficulty": "beginner" }, { "id": "arxiv:2607.17708", "source": "arxiv", "source_type": "preprint", "title": "LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers", "abstract": "Multi-task neural solvers aim to handle multiple Vehicle Routing Problem (VRP) variants within a unified model, avoiding separate training for each constraint combination. However, VRP variants differ in optimization difficulty, while existing methods lack stage-wise feedback on their training status, making the model biased to some specific variants. Although meta-learning can support adaptive training, it typically requires bi-level optimization and additional gradient updates, increasing computational cost. To address this limitation, we propose LLM-as-Trainer (LaT), a plug-and-play training paradigm that uses a pretrained large language model as an external trainer. LaT periodically analyzes cross-task validation metrics to generate a stage-wise guidance vector. This vector is combined with the current task's constraint vector and injected into each encoder layer, providing the neural solver with additional training information during subsequent policy optimization. Experiments on 16 VRP variants show that LaT improves the solution quality of several state-of-the-art multi-task neural solvers on both trained and unseen variants, supporting the effectiveness and generality of the proposed training paradigm.", "authors": [ "Yang Wang", "Ya-Hui Jia", "Wei-Neng Chen", "Yi Mei", "Wen Song", "Zhiguang Cao" ], "year": 2026, "published_date": "2026-07-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.17708", "pdf_url": "https://arxiv.org/pdf/2607.17708", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Fairness & Ethics", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses multi-task — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.44, "read_first_score": 3.74, "content_potential_score": 0.42, "interestingness_score": 1.93, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multi-task neural solvers aim to handle multiple Vehicle Routing Problem (VRP) variants within a unified model, avoiding separate training for each constraint combination. However, VRP variants differ in optimization difficulty, while existing methods lack stage-wise feedback on their training status, making the model biased to some specific variants.", "key_contribution": "To address this limitation, we propose LLM-as-Trainer (LaT), a plug-and-play training paradigm that uses a pretrained large language model as an external trainer.", "why_it_matters": "LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this limitation, we propose LLM-as-Trainer (LaT), a plug-and-play training paradigm that uses a pretrained…", "biggest_caveat": "limitation, we propose LLM-as-Trainer (LaT), a plug-and-play training paradigm that uses a pretrained large language model as an external trainer.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.17708", "difficulty": "advanced" }, { "id": "arxiv:2607.00926", "source": "arxiv", "source_type": "preprint", "title": "Human-Machine Collaboration on Generative Meta-Learning: Model and Algorithm", "abstract": "Generalizing machine learning models to environments that differ from their training distribution remains a critical hurdle, particularly when data from the target domain is entirely or partially unavailable. We propose Generative Meta-Learning with Human Feedback (GMHF), a novel framework that bridges this domain gap by leveraging expert intuition to guide data synthesis. Grounded in a theoretical analysis of generalization error, we derive bounds demonstrating that aligning the distribution of generated data with human beliefs regarding the target physics significantly mitigates risk. GMHF operationalizes this insight by employing a Conditional Neural ODE (cNODE) as a generative digital twin, coupled with a Reinforcement Learning (RL) agent. The agent iteratively refines the latent physical parameters of the generated trajectories based on feedback, effectively steering the meta-learner toward the unobserved target distribution. Empirical validation on a nonlinear Duffing oscillator shows that GMHF substantially reduces deployment loss as expert reliability increases, and that the divergence between generated and target data falls under reliable feedback, directly corroborating the divergence-minimisation mechanism predicted by our theory. Further experiments on a non-dynamical probabilistic model confirm that the framework extends beyond ODE-governed systems, establishing human-AI collaboration as a rigorous catalyst for robust generalisation under distribution shift.", "authors": [ "Midhun Parakkal Unni", "Samuel Kaski" ], "year": 2026, "published_date": "2026-07-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.00926", "pdf_url": "https://arxiv.org/pdf/2607.00926", "citations": 0, "topics": [], "tags": [ "Info Extraction", "RL", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.44, "read_first_score": 3.91, "content_potential_score": 1.0, "interestingness_score": 2.22, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Generalizing machine learning models to environments that differ from their training distribution remains a critical hurdle, particularly when data from the target domain is entirely or partially unavailable. We propose Generative Meta-Learning with Human Feedback (GMHF), a novel framework that bridges this domain gap by leveraging expert intuition to guide data synthesis.", "key_contribution": "We propose Generative Meta-Learning with Human Feedback (GMHF), a novel framework that bridges this domain gap by leveraging expert intuition to guide data synthesis.", "why_it_matters": "Human-Machine Collaboration on Generative Meta-Learning: Model and Algorithm represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We propose Generative Meta-Learning with Human Feedback (GMHF), a novel framework that bridges this domain gap by…", "biggest_caveat": "bution remains a critical hurdle, particularly when data from the target domain is entirely or partially unavailable.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2607.00926", "difficulty": "advanced" }, { "id": "arxiv:2606.18864", "source": "arxiv", "source_type": "preprint", "title": "Scaling Learning-based AEB with Massive Unlabeled Data", "abstract": "This paper studies how to scale learning-based automatic emergency braking (AEB) with massive unlabeled fleet data under production constraints. Our approach is based on meta-feedback semi-supervised learning (MF-SSL), where a teacher generates pseudo labels for unlabeled driving data and is updated using a small labeled anchor set as safety-critical feedback. In production, anchor ambiguity and labeled-unlabeled mismatch can amplify systematic pseudo-label errors, leading to spurious triggers. We propose a stabilized MF-SSL framework with (i) Noise-Aware Decoupling, which removes ambiguity-prone anchors from the teacher's supervised update path, and (ii) kinematics-gated pseudo-labeling with a teacher conflict penalty to suppress mismatch-induced risk hallucinations on unlabeled data while maintaining broad coverage. Extensive experiments show consistent gains as unlabeled data scale from 1M to 1B windows, improving safety while keeping comfort stable. The 1B-trained student model is deployed to hundreds of thousands of vehicles and validated over \\$10^9$ km of driving, achieving a positive-to-false activation ratio exceeding 100:1 and a 35% improvement in accident-free driving mileage over a production rule-only baseline.", "authors": [ "Xiangyu Wang", "Yang Zhan", "Mengxiang Hao", "Chuanchuan Zhong", "Yansong Jia", "Junjie Zhang", "Yu Han", "Xin Jiang", "Zhen Cao", "Ying Wang", "Yulun Song", "Zhitao Xu" ], "year": 2026, "published_date": "2026-06-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.18864", "pdf_url": "https://arxiv.org/pdf/2606.18864", "citations": 0, "topics": [], "tags": [ "Hallucination", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.44, "read_first_score": 5.03, "content_potential_score": 1.68, "interestingness_score": 2.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper studies how to scale learning-based automatic emergency braking (AEB) with massive unlabeled fleet data under production constraints. Our approach is based on meta-feedback semi-supervised learning (MF-SSL), where a teacher generates pseudo labels for unlabeled driving data and is updated using a small labeled anchor set as safety-critical feedback.", "key_contribution": "We propose a stabilized MF-SSL framework with (i) Noise-Aware Decoupling, which removes ambiguity-prone anchors from the teacher's supervised update path, and (ii) kinematics-gated pseudo-labeling with a teacher conflict penalty to suppress mismatch-induced risk hallucinations on unlabeled data while maintaining broad coverage.", "why_it_matters": "Scaling Learning-based AEB with Massive Unlabeled Data represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "We propose a stabilized MF-SSL framework with (i) Noise-Aware Decoupling, which removes ambiguity-prone anchors from…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2606.18864", "difficulty": "intermediate" }, { "id": "arxiv:2511.18945", "source": "arxiv", "source_type": "preprint", "title": "MIST: Mutual Information Estimation Via Supervised Training", "abstract": "We propose a fully data-driven approach to designing mutual information (MI) estimators. Since any MI estimator is a function of the observed sample from two random variables, we parameterize this function with a neural network (MIST) and train it end-to-end to predict MI values. Training is performed on a large meta-dataset of 625,000 synthetic joint distributions with known ground-truth MI. To handle variable sample sizes and dimensions, we employ a two-dimensional attention scheme ensuring permutation invariance across input samples. To quantify uncertainty, we optimize a quantile regression loss, enabling the estimator to approximate the sampling distribution of MI rather than return a single point estimate. This research program departs from prior work by taking a fully empirical route, trading universal theoretical guarantees for flexibility and efficiency. Empirically, the learned estimators largely outperform classical baselines across sample sizes and dimensions, including on joint distributions unseen during training. The resulting quantile-based intervals are well-calibrated and more reliable than bootstrap-based confidence intervals, while inference is orders of magnitude faster than existing neural baselines. Beyond immediate empirical gains, this framework yields trainable, fully differentiable estimators that can be embedded into larger learning pipelines. Moreover, exploiting MI's invariance to invertible transformations, meta-datasets can be adapted to arbitrary data modalities via normalizing flows, enabling flexible training for diverse target meta-distributions.", "authors": [ "German Gritsai", "Megan Richards", "Maxime Méloux", "Kyunghyun Cho", "Maxime Peyrard" ], "year": 2026, "published_date": "2026-06-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.18945", "pdf_url": "https://arxiv.org/pdf/2511.18945", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.44, "read_first_score": 5.1, "content_potential_score": 1.5, "interestingness_score": 2.47, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We propose a fully data-driven approach to designing mutual information (MI) estimators. Since any MI estimator is a function of the observed sample from two random variables, we parameterize this function with a neural network (MIST) and train it end-to-end to predict MI values.", "key_contribution": "We propose a fully data-driven approach to designing mutual information (MI) estimators.", "why_it_matters": "MIST: Mutual Information Estimation Via Supervised Training represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "We propose a fully data-driven approach to designing mutual information (MI) estimators.", "biggest_caveat": "butions with known ground-truth MI.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Machine Learning.", "url": "https://arxiv.org/abs/2511.18945", "difficulty": "intermediate" }, { "id": "arxiv:2605.15888", "source": "arxiv", "source_type": "preprint", "title": "CHoE: Cross-Domain Heterogeneous Graph Prompt Learning via Structure-Conditioned Experts", "abstract": "Heterogeneous Graph Prompt Learning (HGPL)has emerged as a promising paradigm for bridging the gap between the objectives of pre-training foundation models and their downstream applications in heterogeneous graph settings. However, existing HGPL methods are primarily designed for in-domain scenarios, whereas real-world deployments often span multiple domains, and the data used for pre-training and downstream tasks may originate from different distributions. Consequently, the applicability of current HGPL approaches is limited to in-domain settings, and their performance typically degrades when application domains shift. To address this serious limitation, we develop CHoE, a cross-domain HGPL method built upon an expert network. During pre-training, we introduce and train structure-conditioned experts, and during prompt tuning, we adopt a structure-aware expert routing and load balancing mechanism to select structurally compatible experts for each meta-path view. In addition, we design a prompt-based semantic fusion module to integrate representations across multiple views for downstream prediction. Extensive experiments show that CHoE consistently improves performance in few-shot cross-domain applications, outperforming all baseline approaches.", "authors": [ "Peiyuan Li", "Yongqi Huang", "Jitao Zhao", "Dongxiao He", "Di Jin", "Weixiong Zhang" ], "year": 2026, "published_date": "2026-05-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.15888", "pdf_url": "https://arxiv.org/pdf/2605.15888", "citations": 0, "topics": [], "tags": [ "Prompting", "Self-Supervised", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.44, "read_first_score": 4.94, "content_potential_score": 0.0, "interestingness_score": 1.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Heterogeneous Graph Prompt Learning (HGPL)has emerged as a promising paradigm for bridging the gap between the objectives of pre-training foundation models and their downstream applications in heterogeneous graph settings. However, existing HGPL methods are primarily designed for in-domain scenarios, whereas real-world deployments often span multiple domains, and the data used for pre-training and downstream tasks may originate from different distributions.", "key_contribution": "During pre-training, we introduce and train structure-conditioned experts, and during prompt tuning, we adopt a structure-aware expert routing and load balancing mechanism to select structurally compatible experts for each meta-path view.", "why_it_matters": "CHoE: Cross-Domain Heterogeneous Graph Prompt Learning via Structure-Conditioned Experts represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "During pre-training, we introduce and train structure-conditioned experts, and during prompt tuning, we adopt a…", "biggest_caveat": "limitation, we develop CHoE, a cross-domain HGPL method built upon an expert network.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2605.15888", "difficulty": "beginner" }, { "id": "arxiv:2605.04554", "source": "arxiv", "source_type": "preprint", "title": "InterMesh: Explicit Interaction-Aware End-to-End Multi-Person Human Mesh Recovery", "abstract": "Humans constantly interact with their surroundings. Existing end-to-end multi-person human mesh recovery methods, typically based on the DETR framework, capture inter-human relationships through self-attention across all human queries. However, these approaches model interactions only implicitly and lack explicit reasoning about how humans interact with objects and with each other. In this paper, we propose InterMesh, a simple yet effective framework that explicitly incorporates human-environment interaction information into human mesh recovery pipeline. By leveraging a human-object interaction detector, InterMesh enriches query representations with structured interaction semantics, enabling more accurate pose and shape estimation. We design lightweight modules, Contextual Interaction Encoder and Interaction-Guided Refiner, to integrate these features into existing HMR architectures with minimal overhead. We validate our approach through extensive experiments on 3DPW, MuPoTS, CMU Panoptic, Hi4D, and CHI3D datasets, demonstrating remarkable improvements over state-of-the-art methods. Notably, InterMesh reduces MPJPE by 9.9% on CMU Panoptic and 8.2% on Hi4D, highlighting its effectiveness in scenarios with complex human-object and inter-human interactions.", "authors": [ "Kaili Zheng", "Kaiwen Wang", "Xun Zhu", "Chenyi Guo", "Ji Wu" ], "year": 2026, "published_date": "2026-05-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.04554", "pdf_url": "https://arxiv.org/pdf/2605.04554", "citations": 0, "topics": [], "tags": [ "Reasoning", "Info Extraction", "Transformers", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.44, "read_first_score": 5.37, "content_potential_score": 0.0, "interestingness_score": 1.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Humans constantly interact with their surroundings. Existing end-to-end multi-person human mesh recovery methods, typically based on the DETR framework, capture inter-human relationships through self-attention across all human queries.", "key_contribution": "In this paper, we propose InterMesh, a simple yet effective framework that explicitly incorporates human-environment interaction information into human mesh recovery pipeline.", "why_it_matters": "InterMesh: Explicit Interaction-Aware End-to-End Multi-Person Human Mesh Recovery advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "In this paper, we propose InterMesh, a simple yet effective framework that explicitly incorporates human-environment…", "biggest_caveat": "However, these approaches model interactions only implicitly and lack explicit reasoning about how humans interact with objects and with each other.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.04554", "difficulty": "intermediate" }, { "id": "arxiv:2605.27073", "source": "arxiv", "source_type": "preprint", "title": "Learning to Orchestrate Agents under Uncertainty", "abstract": "Adaptive orchestration of heterogeneous agents requires making sequential delegation decisions under uncertain and evolving agent behaviour, e.g., coordinating specialised AI models with varying reliability, cost, and response quality. While prior work on agent orchestration focuses on performance or cost, uncertainty in agent reliability and output distributions is typically not modelled explicitly at the orchestration level. In this work, we study the problem of adaptive orchestration of heterogeneous agents under uncertainty, where a meta-controller must decide when to delegate to an agent, accounting for reliability, cost, and uncertainty. We propose BOT-Orch, a lightweight framework that recasts orchestration as a bandit problem over agents, regularized by OT distances between agent output distributions and task-specific reference distributions. We show that the regularised orchestration enjoys $\\mathcal{O}(\\sqrt{T})$ regret under standard assumptions, and provably induces preference ordering among agents with identical mean rewards but differing distributional alignment. Empirically, we demonstrate that BOT-Orch outperforms standard bandit and heuristic baselines in synthetic but adversarial task allocation settings with heterogeneous, non-i.i.d. agent behaviour.", "authors": [ "Mary Chriselda Antony Oliver", "Lan Jiang", "Aaron Bundi Anampiu", "Elaf Almahmoud", "Francesco Quinzan", "Umang Bhatt" ], "year": 2026, "published_date": "2026-05-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.27073", "pdf_url": "https://arxiv.org/pdf/2605.27073", "citations": 0, "topics": [], "tags": [ "AI Safety", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.44, "read_first_score": 4.92, "content_potential_score": 0.0, "interestingness_score": 1.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Adaptive orchestration of heterogeneous agents requires making sequential delegation decisions under uncertain and evolving agent behaviour, e.g., coordinating specialised AI models with varying reliability, cost, and response quality. While prior work on agent orchestration focuses on performance or cost, uncertainty in agent reliability and output distributions is typically not modelled explicitly at the orchestration level.", "key_contribution": "We propose BOT-Orch, a lightweight framework that recasts orchestration as a bandit problem over agents, regularized by OT distances between agent output distributions and task-specific reference distributions.", "why_it_matters": "Learning to Orchestrate Agents under Uncertainty represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We propose BOT-Orch, a lightweight framework that recasts orchestration as a bandit problem over agents, regularized by…", "biggest_caveat": "butions is typically not modelled explicitly at the orchestration level.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2605.27073", "difficulty": "advanced" }, { "id": "arxiv:2608.19197", "source": "arxiv", "source_type": "preprint", "title": "SPADE: Self-Play in Adaptive Synthetic Executable Environments", "abstract": "Continuous self-improvement requires an ever-expanding pool of self-generated, diverse, adaptive goals. For language agents, existing training environment pools (hand-curated, statically synthesized, or frozen-verifier) keep the goal distribution fixed as the learner scales. We introduce SPADE (Self-Play in Adaptive Synthetic Executable Environments), a self-play RL framework in which a single LLM plays two roles: an Environment Designer that writes complete, long-horizon training environments as executable code with an OpenAI Gym-style reset()/step() interface, and a Reasoning Agent that learns to act in them. Each is a stateful, multi-turn environment (state transitions, reward functions, and verification code), so one interface spans reasoning problems and multi-step agentic tool use. The Reasoning Agent's regret is estimated using the gap between its reward with and without privileged hints; in optimizing this regret signal the Environment Designer learns to target environments at the edge of the agent's capabilities while keeping them feasible. Through extensive experimentation, we find several components critical to success: grounding the Environment Designer on documents sampled from a large pretraining corpus, and giving it an accumulated environment memory. Scaling to 30B-parameter models, SPADE improves over the strongest fixed-environment baseline by +5.3 on average across eight held-out math, science, code, and reasoning benchmarks, and lifts the tool-use setting by +5.7 on BFCL-v4 multi-turn and +13.9 on ACEBench-Agent; on the games setting, the margin over the strongest baseline grows with model scale. By making environment design itself a learnable component, SPADE takes a concrete step toward open-ended self-improvement.", "authors": [ "Bo Liu", "Simon Yu", "Yiding Jiang", "Ao Qu", "Andrew Zhao", "Zichen Liu", "Junsu Kim", "Zijian Zhou", "Seungone Kim", "Tongzheng Ren", "Mickel Liu", "Hanfei Yu", "Zhaorun Chen", "Weiyan Shi", "Paul Pu Liang", "Luke Zettlemoyer", "Yejin Choi", "Natasha Jaques" ], "year": 2026, "published_date": "2026-08-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.19197", "pdf_url": "https://arxiv.org/pdf/2608.19197", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Hallucination", "AI Agents", "Info Extraction" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Uses pretraining — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.43, "read_first_score": 4.62, "content_potential_score": 1.5, "interestingness_score": 2.46, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Continuous self-improvement requires an ever-expanding pool of self-generated, diverse, adaptive goals. For language agents, existing training environment pools (hand-curated, statically synthesized, or frozen-verifier) keep the goal distribution fixed as the learner scales.", "key_contribution": "We introduce SPADE (Self-Play in Adaptive Synthetic Executable Environments), a self-play RL framework in which a single LLM plays two roles: an Environment Designer that writes complete, long-horizon training environments as executable code with an OpenAI Gym-style reset()/step() interface, and a Reasoning Agent that learns to act in them.", "why_it_matters": "SPADE: Self-Play in Adaptive Synthetic Executable Environments represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce SPADE (Self-Play in Adaptive Synthetic Executable Environments), a self-play RL framework in which a…", "biggest_caveat": "bution fixed as the learner scales.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.19197", "difficulty": "advanced" }, { "id": "arxiv:2607.23537", "source": "arxiv", "source_type": "preprint", "title": "ObsDriveBench: Benchmarking Multimodal Understanding under Adverse Weather with Observability Awareness", "abstract": "Autonomous driving under adverse weather remains a critical challenge, yet existing vision-language benchmarks mainly evaluate under standard conditions, synthetic corruptions, or single modality. As a result, it remains unclear how vision-language models behave under real-world adverse weather with multi-modal inputs. We argue that a key difficulty lies in degraded environmental observability: under fog, rain, snow, and low illumination, multi-modal observations become unreliable and cross-modally inconsistent, posing challenges to scene understanding, and subsequent decision-making. To study this, we introduce \\textbf{ObsDriveBench}, a real-world multi-modal benchmark for adverse-weather autonomous driving. Our benchmark is designed with three capability dimensions: \\textbf{observability awareness}, \\textbf{spatial reliability}, and \\textbf{risk-aware decision-making}, enabling fine-grained diagnosis of model behavior under degraded observations. We construct the benchmark through observability meta-annotation, scene description, and capability oriented multiple-choice tasks over synchronized camera, LiDAR, and radar inputs, forming a benchmark with over 14k training and 13k test questions. Experiments reveal consistent performance degradation of existing vision-language models. We further introduce \\textbf{ObsDrive} model with normal-weather supervised fine-tuning and adverse-weather reinforcement learning, improving robustness across all three capabilities. The dataset and evaluation code will be released at \\href{https://github.com/russellyq/ObsDriveBench}{\\texttt{ObsDriveBench}}.", "authors": [ "Qiao Yan", "Yihan Wang", "Zhenghao Xing", "Jiaqi Xu", "Pheng-Ann Heng" ], "year": 2026, "published_date": "2026-07-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.23537", "pdf_url": "https://arxiv.org/pdf/2607.23537", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "VLMs", "RL", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.43, "read_first_score": 5.53, "content_potential_score": 1.5, "interestingness_score": 2.46, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Autonomous driving under adverse weather remains a critical challenge, yet existing vision-language benchmarks mainly evaluate under standard conditions, synthetic corruptions, or single modality. As a result, it remains unclear how vision-language models behave under real-world adverse weather with multi-modal inputs.", "key_contribution": "To study this, we introduce \\textbf{ObsDriveBench}, a real-world multi-modal benchmark for adverse-weather autonomous driving.", "why_it_matters": "ObsDriveBench: Benchmarking Multimodal Understanding under Adverse Weather with Observability Awareness represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "To study this, we introduce \\textbf{ObsDriveBench}, a real-world multi-modal benchmark for adverse-weather autonomous…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2607.23537", "difficulty": "beginner" }, { "id": "arxiv:2607.19271", "source": "arxiv", "source_type": "preprint", "title": "Model-Agnostic Meta Learning for Differentiable MPC", "abstract": "Applying policy optimization to Model Predictive Control (MPC) yields high-performance and reliable controllers. However, the resulting controllers often overfit their training conditions and suffer significant performance degradation in unseen tasks. We propose a novel framework combining policy optimization with meta-learning to train highly adaptable MPC controllers. Our approach enables rapid adaptation to unseen tasks, maintaining high performance at a fraction of the computational cost required for full retraining. Furthermore, we integrate system identification into the pipeline to continuously refine both the MPC hyperparameters and the underlying predictive models. We validate our proposed methodology on a Ball-on-Plate system, demonstrating superior adaptability across various parameterized trajectory-tracking tasks.", "authors": [ "Salma Elfeki", "Riccardo Zuliani", "Niklas Schmid", "Efe C. Balta", "John Lygeros" ], "year": 2026, "published_date": "2026-07-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.19271", "pdf_url": "https://arxiv.org/pdf/2607.19271", "citations": 0, "topics": [], "tags": [ "Systems & Control" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.43, "read_first_score": 4.35, "content_potential_score": 0.0, "interestingness_score": 1.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Applying policy optimization to Model Predictive Control (MPC) yields high-performance and reliable controllers. However, the resulting controllers often overfit their training conditions and suffer significant performance degradation in unseen tasks.", "key_contribution": "We propose a novel framework combining policy optimization with meta-learning to train highly adaptable MPC controllers.", "why_it_matters": "Model-Agnostic Meta Learning for Differentiable MPC represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Systems & Control.", "one_line_takeaway": "We propose a novel framework combining policy optimization with meta-learning to train highly adaptable MPC controllers.", "biggest_caveat": "However, the resulting controllers often overfit their training conditions and suffer significant performance degradation in unseen tasks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Systems & Control.", "url": "https://arxiv.org/abs/2607.19271", "difficulty": "intermediate" }, { "id": "arxiv:2606.14084", "source": "arxiv", "source_type": "preprint", "title": "Self-Improving VLA Policies: Selected Diffusion Noise for Spurious-Robust Action Smoothing", "abstract": "Diffusion-based Vision-Language-Action (VLA) policies enable strong generalization in robotic manipulation, but remain sensitive to spurious visual correlations and noisy action generation, leading to brittle behavior under perturbations. We introduce Selected Diffusion Noise (SDN), a simple, training-free test-time method that improves both robustness and success rate by leveraging the diffusion noise space as a controllable degree of freedom. SDN dynamically samples noise vectors that are maximally separated from a reference set to mitigate reliance on spurious cues, while selecting candidates that yield more coherent action trajectories. This dual objective encourages stable behavior even under object-masked observations and reduces action jitter without modifying model parameters. We evaluate SDN on two simulation benchmarks (Google Robot, Widow-X) and two real-world robotic datasets across multiple VLA policies, including pi_0, Groot-N1.5, and Groot-N1.6. SDN consistently improves success rates by +8% in simulation and +10% in real-world settings, while producing smoother and more stable actions. Our results highlight that diffusion noise selection can serve as an effective and general mechanism for enhancing VLA policies at test time.", "authors": [ "Duc Minh Nguyen", "Bao-Ngoc Dao", "Tung M. Luu", "Binh Gia Nguyen", "Vinh Tong", "Anji Liu", "Vu N. Duong", "Dung D. Le", "Daniel Sonntag", "Trung Le", "Ngan Le", "Jan Peter", "An Thai Le", "Minh Nhat Vu", "Mathias Niepert", "Khoa D. Doan", "Duy M. H. Nguyen", "Vien Anh Ngo" ], "year": 2026, "published_date": "2026-06-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.14084", "pdf_url": "https://arxiv.org/pdf/2606.14084", "citations": 0, "topics": [], "tags": [ "Robotics", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.43, "read_first_score": 4.97, "content_potential_score": 0.0, "interestingness_score": 1.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Diffusion-based Vision-Language-Action (VLA) policies enable strong generalization in robotic manipulation, but remain sensitive to spurious visual correlations and noisy action generation, leading to brittle behavior under perturbations. We introduce Selected Diffusion Noise (SDN), a simple, training-free test-time method that improves both robustness and success rate by leveraging the diffusion noise space as a controllable degree of freedom.", "key_contribution": "We introduce Selected Diffusion Noise (SDN), a simple, training-free test-time method that improves both robustness and success rate by leveraging the diffusion noise space as a controllable degree of freedom.", "why_it_matters": "Self-Improving VLA Policies: Selected Diffusion Noise for Spurious-Robust Action Smoothing represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We introduce Selected Diffusion Noise (SDN), a simple, training-free test-time method that improves both robustness and…", "biggest_caveat": "but remain sensitive to spurious visual correlations and noisy action generation, leading to brittle behavior under perturbations.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2606.14084", "difficulty": "beginner" }, { "id": "arxiv:2606.04455", "source": "arxiv", "source_type": "preprint", "title": "The Meta-Agent Challenge: Are Current Agents Capable of Autonomous Agent Development?", "abstract": "Current AI benchmarks evaluate agents on task execution within human-designed workflows. These evaluations fundamentally fail to measure a critical next-level capability: whether models can autonomously develop agent systems. We introduce the Meta-Agent Challenge (MAC), an evaluation framework designed to test the capacity of frontier models for autonomous agent development. Specifically, a code agent (the meta-agent) is given a sandboxed environment, an evaluation API, and a time limitation to iteratively program an agent artifact that maximizes performance on a held-out test set across five domains. To ensure evaluation integrity, this framework is secured by multi-layer defenses against reward hacking. Leveraging this framework, we demonstrate that meta-agents rarely match human-engineered baseline policies, and the few that do are dominated by proprietary frontier models. Moreover, the design process exhibits high variance, and high optimization pressure surfaces emergent adversarial behaviors like ground-truth exfiltration-highlighting critical deficits in both robustness and model alignment. Ultimately, MAC provides a rigorous, open-source benchmark for autonomous AI research and development, offering an empirical proxy for evaluating recursive self-improvement. Benchmark is publicly available at: https://github.com/ant-research/meta-agent-challenge.", "authors": [ "Xinyu Lu", "Tianshu Wang", "Pengbo Wang", "zujie wen", "Zhiqiang Zhang", "Jun Zhou", "Boxi Cao", "Yaojie Lu", "Hongyu Lin", "Xianpei Han", "Le Sun" ], "year": 2026, "published_date": "2026-06-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.04455", "pdf_url": "https://arxiv.org/pdf/2606.04455", "citations": 0, "topics": [], "tags": [ "AI Safety", "AI Agents", "Evaluation", "Artificial Intelligence", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.43, "read_first_score": 6.17, "content_potential_score": 1.5, "interestingness_score": 2.46, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Current AI benchmarks evaluate agents on task execution within human-designed workflows. These evaluations fundamentally fail to measure a critical next-level capability: whether models can autonomously develop agent systems.", "key_contribution": "We introduce the Meta-Agent Challenge (MAC), an evaluation framework designed to test the capacity of frontier models for autonomous agent development.", "why_it_matters": "The Meta-Agent Challenge: Are Current Agents Capable of Autonomous Agent Development? represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We introduce the Meta-Agent Challenge (MAC), an evaluation framework designed to test the capacity of frontier models…", "biggest_caveat": "limitation to iteratively program an agent artifact that maximizes performance on a held-out test set across five domains.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2606.04455", "difficulty": "beginner" }, { "id": "arxiv:2409.02708", "source": "arxiv", "source_type": "preprint", "title": "Few-shot Multi-Task Learning of Linear Invariant Features with Meta Subspace Pursuit", "abstract": "Data scarcity poses a serious threat to modern machine learning and artificial intelligence, as their practical success typically relies on the availability of big datasets. One effective strategy to mitigate the issue of insufficient data is to first harness information from other data sources possessing certain similarities in the study design stage, and then employ the multi-task or meta learning framework in the analysis stage. In this paper, we focus on multi-task (or multi-source) linear models whose coefficients across tasks share an invariant low-rank component, a popular structural assumption considered in the recent multi-task or meta learning literature. Under this assumption, we propose a new algorithm, called Meta Subspace Pursuit (abbreviated as Meta-SP), that provably learns this invariant subspace shared by different tasks. Under this stylized setup for multi-task or meta learning, we establish both the algorithmic and statistical guarantees of the proposed method. Extensive numerical experiments are conducted, comparing Meta-SP against several competing methods, including popular, off-the-shelf model-agnostic meta learning algorithms such as ANIL. These experiments demonstrate that Meta-SP achieves superior performance over the competing methods in various aspects.", "authors": [ "Chaozhi Zhang", "Lin Liu", "Xiaoqun Zhang" ], "year": 2026, "published_date": "2026-05-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2409.02708", "pdf_url": "https://arxiv.org/pdf/2409.02708", "citations": 0, "topics": [], "tags": [ "Prompting", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses multi-task — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.43, "read_first_score": 4.5, "content_potential_score": 1.1, "interestingness_score": 2.27, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Data scarcity poses a serious threat to modern machine learning and artificial intelligence, as their practical success typically relies on the availability of big datasets. One effective strategy to mitigate the issue of insufficient data is to first harness information from other data sources possessing certain similarities in the study design stage, and then employ the multi-task or meta learning framework in the analysis stage.", "key_contribution": "Under this assumption, we propose a new algorithm, called Meta Subspace Pursuit (abbreviated as Meta-SP), that provably learns this invariant subspace shared by different tasks.", "why_it_matters": "Few-shot Multi-Task Learning of Linear Invariant Features with Meta Subspace Pursuit represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "Under this assumption, we propose a new algorithm, called Meta Subspace Pursuit (abbreviated as Meta-SP), that provably…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2409.02708", "difficulty": "advanced" }, { "id": "arxiv:2602.07905", "source": "arxiv", "source_type": "preprint", "title": "MedCoG: Maximizing LLM Inference Density in Medical Reasoning via Meta-Cognitive Regulation", "abstract": "Large Language Models (LLMs) have shown strong potential in complex medical reasoning yet face diminishing gains under inference scaling laws. While existing studies augment LLMs with various knowledge types, it remains unclear how effectively the additional costs translate into accuracy. In this paper, we explore how meta-cognition of LLMs, i.e., their self-assessment of their own cognitive states, can regulate the reasoning process. Specifically, we propose MedCoG, a Medical Meta-Cognition Agent with Knowledge Graph, where the meta-cognitive assessments of task complexity, familiarity, and knowledge density dynamically regulate utilization of procedural, episodic, and factual knowledge. The LLM-centric on-demand reasoning aims to mitigate the diminishing returns under scaling law by (1) reducing costs via avoiding indiscriminate scaling, (2) improving accuracy via filtering out distractive knowledge. To validate this, we empirically characterize the scaling curve and introduce inference density to quantify inference efficiency. Experiments demonstrate the effectiveness and efficiency of MedCoG on five hard sets of medical benchmarks, yielding 6.2x inference density. Furthermore, the Oracle study highlights the significant potential of meta-cognitive regulation.", "authors": [ "Yu Zhao", "Hao Guan", "Yongcheng Jing", "Ying Zhang", "Dacheng Tao" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.07905", "pdf_url": "https://arxiv.org/pdf/2602.07905", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Knowledge Graphs", "Evaluation", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.43, "read_first_score": 5.64, "content_potential_score": 0.0, "interestingness_score": 1.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large Language Models (LLMs) have shown strong potential in complex medical reasoning yet face diminishing gains under inference scaling laws. While existing studies augment LLMs with various knowledge types, it remains unclear how effectively the additional costs translate into accuracy.", "key_contribution": "Specifically, we propose MedCoG, a Medical Meta-Cognition Agent with Knowledge Graph, where the meta-cognitive assessments of task complexity, familiarity, and knowledge density dynamically regulate utilization of procedural, episodic, and factual knowledge.", "why_it_matters": "MedCoG: Maximizing LLM Inference Density in Medical Reasoning via Meta-Cognitive Regulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Specifically, we propose MedCoG, a Medical Meta-Cognition Agent with Knowledge Graph, where the meta-cognitive…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2602.07905", "difficulty": "beginner" }, { "id": "arxiv:2605.15760", "source": "arxiv", "source_type": "preprint", "title": "Learn2Splat: Extending the Horizon of Learned 3DGS Optimization", "abstract": "3D Gaussian Splatting (3DGS) optimization is most commonly performed using standard optimizers (Adam, SGD). While stable across diverse scenes, standard optimizers are general-purpose and not tailored to the structure of the problem. In particular, they produce independent parameter updates that do not capture the structural and spatial relationships within a scene, leading to inefficient optimization and slow convergence. Recent works introduced learned optimizers that predict correlated updates informed by inter-parameter and inter-Gaussian dependencies. However, these methods are trained for a fixed number of optimization iterations and rely on manually scheduled learning rates to avoid degradation. In this paper, we introduce a learned optimizer for 3DGS that avoids degradation over extended optimization horizons without auxiliary mechanisms. To enable this, we propose a meta-learning scheme that extends the optimization horizon via a checkpoint buffer and an optimizer rollout strategy, combined with an architecture that encodes gradient scale information in its latent states. Results show improved early novel view synthesis quality while remaining stable over long horizons, with zero-shot generalization to unseen reconstruction settings. To support our findings, we introduce the first unified framework for training and evaluating both learned and conventional optimizers across sparse and dense view settings. Code and models will be released publicly. Our project page is available at https://naamapearl.github.io/learn2splat .", "authors": [ "Naama Pearl", "Stefano Esposito", "Haofei Xu", "Amit Peleg", "Patricia Gschossmann", "Lorenzo Porzi", "Peter Kontschieder", "Gerard Pons-Moll", "Andreas Geiger" ], "year": 2026, "published_date": "2026-05-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.15760", "pdf_url": "https://arxiv.org/pdf/2605.15760", "citations": 0, "topics": [], "tags": [ "3D Vision", "Computer Vision" ], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.42, "read_first_score": 6.76, "content_potential_score": 0.6, "interestingness_score": 2.01, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "3D Gaussian Splatting (3DGS) optimization is most commonly performed using standard optimizers (Adam, SGD). While stable across diverse scenes, standard optimizers are general-purpose and not tailored to the structure of the problem.", "key_contribution": "In this paper, we introduce a learned optimizer for 3DGS that avoids degradation over extended optimization horizons without auxiliary mechanisms.", "why_it_matters": "Learn2Splat: Extending the Horizon of Learned 3DGS Optimization advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about 3D Vision.", "one_line_takeaway": "In this paper, we introduce a learned optimizer for 3DGS that avoids degradation over extended optimization horizons…", "biggest_caveat": "However, these methods are trained for a fixed number of optimization iterations and rely on manually scheduled learning rates to avoid degradation.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in 3D Vision.", "url": "https://arxiv.org/abs/2605.15760", "difficulty": "intermediate" }, { "id": "arxiv:2506.16453", "source": "arxiv", "source_type": "preprint", "title": "Understanding the Challenges and Opportunities of Generative AI Apps: An Empirical Study", "abstract": "The release of ChatGPT in 2022 triggered a rapid surge in generative artificial intelligence mobile apps (Gen-AI apps). Despite widespread adoption, little is known about how end users perceive and evaluate these Gen-AI functionalities. We conduct a user-centered analysis of 1,035,342 reviews from 171 Gen-AI apps from the Google Play Store. We propose SARA (Selection, Acquisition, Refinement, and Analysis), a four-phase framework that leverages prompt-based LLMs for large-scale review analysis. We validate the reliability of LLM-based topic extraction and assignment using 4,353 manually evaluated reviews, achieving 91% accuracy with five-shot prompting and filtering of non-informative reviews. We identify the top ten topics (e.g., AI Performance and Emotional Connection) and perform a cross-platform comparison with Apple App Store reviews. Through qualitative analysis of 762 reviews, we uncover three opportunities (AI for Accessibility and Wellbeing, AI as a Collaborative Creative Tool, and AI Versatility) and three challenges (Managing User Expectations and AI Limitations, Balancing Content Moderation and Creative Freedom, and Strategic Integration of Gen-AI Features). Finally, we analyze temporal trends, revealing how user concerns shift as users mature. Our findings enable researchers and developers to better leverage the capabilities of Gen-AI apps and address potential challenges.", "authors": [ "Buthayna AlMulla", "Maram Assi", "Safwat Hassan" ], "year": 2026, "published_date": "2026-04-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2506.16453", "pdf_url": "https://arxiv.org/pdf/2506.16453", "citations": 0, "topics": [], "tags": [ "LLMs", "Software Engineering" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.42, "read_first_score": 4.5, "content_potential_score": 0.0, "interestingness_score": 1.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The release of ChatGPT in 2022 triggered a rapid surge in generative artificial intelligence mobile apps (Gen-AI apps). Despite widespread adoption, little is known about how end users perceive and evaluate these Gen-AI functionalities.", "key_contribution": "We propose SARA (Selection, Acquisition, Refinement, and Analysis), a four-phase framework that leverages prompt-based LLMs for large-scale review analysis.", "why_it_matters": "Understanding the Challenges and Opportunities of Generative AI Apps: An Empirical Study represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose SARA (Selection, Acquisition, Refinement, and Analysis), a four-phase framework that leverages prompt-based…", "biggest_caveat": "Limitations, Balancing Content Moderation and Creative Freedom, and Strategic Integration of Gen-AI Features).", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2506.16453", "difficulty": "intermediate" }, { "id": "arxiv:2608.25346", "source": "arxiv", "source_type": "preprint", "title": "BOOSTEDSOSA: Accelerated Inferencing for Low Variance Stochastic Online Scheduling", "abstract": "Heterogeneous scheduling in stochastic, online envi- ronments, such as high-performance computing (HPC) systems, presents a significant challenge. Stochastic Online Scheduling Accelerators (SOSAs) offer a promising solution, but their effectiveness is compromised by a reliance on runtime estimates provided by users. These estimates introduce substantial vari- ance into the scheduling process (mean MAE in hundreds of Core-Days), thereby weakening the competitiveness of Stochastic Online Scheduling algorithms as their competitive-ratio bound increases with runtime variability. To address this limitation, we introduce BOOSTEDSOSA, a dual-FPGA ML-assisted Scheduling architecture that integrates a Machine Learning predictor for expected processing times, with a novel temporal-aware training policy. The predictor estimates job runtimes using only scheduler parameters available at submission time, enabling its use in existing HPC systems. Using historical real-world HPC job data (from the Argonne Leadership Comput- ing Facility, MIT Supercloud and UIUC Blue Waters workload datasets), we show that the predictor reduces MAE by up to 63.85% compared to user runtime estimates, and the additive training policy reduces MAE by up to 71.88% compared to a static model. End-to-end, BOOSTEDSOSA achieves an average 17x speedup over an AVX-optimized software baseline and processes up to 1,711 jobs/seconds", "authors": [ "Adam H. Ross", "Riccardo Revalor", "Aryan Singh", "Ayush Jain", "Debjit Pal" ], "year": 2026, "published_date": "2026-08-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.25346", "pdf_url": "https://arxiv.org/pdf/2608.25346", "citations": 0, "topics": [], "tags": [], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.42, "read_first_score": 4.06, "content_potential_score": 0.0, "interestingness_score": 1.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Heterogeneous scheduling in stochastic, online envi- ronments, such as high-performance computing (HPC) systems, presents a significant challenge. Stochastic Online Scheduling Accelerators (SOSAs) offer a promising solution, but their effectiveness is compromised by a reliance on runtime estimates provided by users.", "key_contribution": "These estimates introduce substantial vari- ance into the scheduling process (mean MAE in hundreds of Core-Days), thereby weakening the competitiveness of Stochastic Online Scheduling algorithms as their competitive-ratio bound increases with runtime variability.", "why_it_matters": "BOOSTEDSOSA: Accelerated Inferencing for Low Variance Stochastic Online Scheduling represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "These estimates introduce substantial vari- ance into the scheduling process (mean MAE in hundreds of Core-Days),…", "biggest_caveat": "but their effectiveness is compromised by a reliance on runtime estimates provided by users.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2608.25346", "difficulty": "frontier" }, { "id": "arxiv:2608.12330", "source": "arxiv", "source_type": "preprint", "title": "Reliability-Aware Sexism Detection: Combining DPO with Annotator Agreement and Token-Level Confidence Scoring", "abstract": "The detection of online sexism remains an open problem. Sexism detection is inherently subjective, yet most existing systems reduce multi-annotator labels to a single majority decision and treat all instances uniformly. This ignores two informative signals: annotator agreement and model uncertainty. We propose RA-DPO (Reliability-Aware Direct Preference Optimization), which integrates annotator agreement, model confidence, and a token-level uncertainty signal into a single reliability score. RA-DPO uses this score to select high-value preference pairs during training and to support inference-time abstention, which allows the model to trade coverage for accuracy. We evaluate RA-DPO on 6,920 multilingual posts from EXIST 2023, fine-tune OpenAI gpt-4o base via DPO, and validate on two open-weight 3B models (Llama, Qwen). Results show that training on the top 30% most reliable pairs matches full-data DPO, which indicates that reliability-aware selection can reduce training cost without sacrificing performance. At inference, selective prediction reaches 96.2% accuracy at 50% coverage in the true-agreement setting and 88.7% in the deployable predicted-agreement setting, both exceeding the 85.3% no-agreement baseline. These results suggest that accounting for annotation uncertainty is beneficial for both efficient training and reliable deployment in subjective classification.", "authors": [ "Hadi Mohammadi", "Shihan Wang", "Masoume M. Raeissi", "Anastasia Giachanou" ], "year": 2026, "published_date": "2026-06-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.12330", "pdf_url": "https://arxiv.org/pdf/2608.12330", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "Fine-Tuning", "NLP" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.42, "read_first_score": 4.86, "content_potential_score": 1.5, "interestingness_score": 2.46, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The detection of online sexism remains an open problem. Sexism detection is inherently subjective, yet most existing systems reduce multi-annotator labels to a single majority decision and treat all instances uniformly.", "key_contribution": "We propose RA-DPO (Reliability-Aware Direct Preference Optimization), which integrates annotator agreement, model confidence, and a token-level uncertainty signal into a single reliability score.", "why_it_matters": "Reliability-Aware Sexism Detection: Combining DPO with Annotator Agreement and Token-Level Confidence Scoring represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose RA-DPO (Reliability-Aware Direct Preference Optimization), which integrates annotator agreement, model…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.12330", "difficulty": "advanced" }, { "id": "arxiv:2608.03926", "source": "arxiv", "source_type": "preprint", "title": "PRISM: Powerful Time Series to Image (TS2I) Representations for Multivariate Anomaly Detection", "abstract": "Time series anomaly detection (TSAD) underpins applications in predictive maintenance, finance, and cloud computing, however performance remains sensitive to representation choices, especially in multivariate settings. While transforming time series into images has shown success in forecasting and classification, it remains unclear how multivariate, high-dimensional series should be mapped to multi-channel images and whether vision backbones can match time-domain baselines in TSAD. We introduce PRISM, a plug-and-play meta-workflow enabling systematic construction and evaluation of image-based representations for multivariate TSAD. Our evaluation spanning over 7,000 experiments shows that well-designed PRISM configurations are competitive with 24 time-domain baselines, achieving the best VUS-PR on 10 of 14 datasets, with an average improvement of 41% over the best competing method on those datasets. Further, we identify channelization - how the channel dimension of multi-channel images is constructed - as a critical and previously understudied design dimension, and introduce MSM, a novel statistics-based scheme achieving 11-27% gains over PCA-based alternatives. Finally, ImageNet-pretrained encoders transfer effectively to TSAD, with frozen encoders retaining 92% of fine-tuned performance while training 1.8 times faster. Our code is available at: https://github.com/Smendowski/PRISM.", "authors": [ "Mateusz Smendowski", "Kamil Faber", "Piotr Nawrocki", "Nathalie Japkowicz", "Roberto Corizzo" ], "year": 2026, "published_date": "2026-08-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.03926", "pdf_url": "https://arxiv.org/pdf/2608.03926", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Artificial Intelligence", "Machine Learning", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.42, "read_first_score": 4.93, "content_potential_score": 0.42, "interestingness_score": 1.92, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Time series anomaly detection (TSAD) underpins applications in predictive maintenance, finance, and cloud computing, however performance remains sensitive to representation choices, especially in multivariate settings. While transforming time series into images has shown success in forecasting and classification, it remains unclear how multivariate, high-dimensional series should be mapped to multi-channel images and whether vision backbones can match time-domain baselines in TSAD.", "key_contribution": "We introduce PRISM, a plug-and-play meta-workflow enabling systematic construction and evaluation of image-based representations for multivariate TSAD.", "why_it_matters": "PRISM: Powerful Time Series to Image (TS2I) Representations for Multivariate Anomaly Detection advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We introduce PRISM, a plug-and-play meta-workflow enabling systematic construction and evaluation of image-based…", "biggest_caveat": "however performance remains sensitive to representation choices, especially in multivariate settings.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2608.03926", "difficulty": "intermediate" }, { "id": "arxiv:2607.16521", "source": "arxiv", "source_type": "preprint", "title": "Enhanced Multi-Class DDoS Attack Identification using a Meta-Learning Ensemble", "abstract": "Distributed Denial of Service (DDoS) attacks continue to pose significant threats to network availability and security. While many detection systems focus on binary classification (attack vs. benign), effective mitigation often requires identifying the specific type of DDoS attack. This paper introduces a robust intrusion detection framework centered around a high-accuracy, multi-class classification model designed to precisely identify various DDoS attack types. We propose an ensemble architecture integrating Long Short-Term Memory (LSTM), K-Nearest Neighbors (KNN), and Random Forest (RF) models, whose outputs are synthesized by a Logistic Regression meta-learner. This approach explicitly addresses the ambiguity often encountered when combining predictions from multiple independent classifiers. Evaluated on the CIC-DDoS2019 dataset, our proposed ensemble meta-learning model achieves 96% accuracy in the multi-class identification task, significantly outperforming a baseline chain model (combining individual binary classifiers), which reached 92% accuracy and suffered from high ambiguity. Furthermore, integration and testing within a Software-Defined Networking (SDN) environment using Mininet and the Ryu controller demonstrated the practical applicability of our model, achieving 93% accuracy in identifying DDoS types in the emulated network traffic. Our work highlights the value of meta-learning ensembles for nuanced DDoS threat identification, paving the way for more adaptive and effective defense mechanisms.", "authors": [ "Ankith Indra Kumar", "Genya Ishigaki", "Amith Kamath Belman" ], "year": 2026, "published_date": "2026-07-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.16521", "pdf_url": "https://arxiv.org/pdf/2607.16521", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Cryptography & Security" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.42, "read_first_score": 6.07, "content_potential_score": 1.5, "interestingness_score": 2.46, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Distributed Denial of Service (DDoS) attacks continue to pose significant threats to network availability and security. While many detection systems focus on binary classification (attack vs.", "key_contribution": "We propose an ensemble architecture integrating Long Short-Term Memory (LSTM), K-Nearest Neighbors (KNN), and Random Forest (RF) models, whose outputs are synthesized by a Logistic Regression meta-learner.", "why_it_matters": "Enhanced Multi-Class DDoS Attack Identification using a Meta-Learning Ensemble represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We propose an ensemble architecture integrating Long Short-Term Memory (LSTM), K-Nearest Neighbors (KNN), and Random…", "biggest_caveat": "buted Denial of Service (DDoS) attacks continue to pose significant threats to network availability and security.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2607.16521", "difficulty": "intermediate" }, { "id": "arxiv:2606.04507", "source": "arxiv", "source_type": "preprint", "title": "Self-Evolving Deep Research via Joint Generation and Evaluation", "abstract": "Large Language Models (LLMs) have become increasingly adopted in daily applications, with deep research standing out as a particularly important capability. Unlike traditional question-answering (QA) tasks, deep research report generation lacks definitive ground-truth, making reward design inherently unverifiable and limiting effective reinforcement learning. Existing approaches mitigate this challenge with LLM-as-a-judge and query-dependent evaluation rubrics, but they still rely on static evaluators that cannot adapt their standards as the solver improves, leading to insufficient and eventually saturated optimization pressure. We address this limitation with a \\textbf{s}elf-evolving \\textbf{co}-evolutionary training framework for deep \\textbf{re}search evaluation and generation (SCORE), which tightly couples an evaluator and a solver in a shared-parameter learning process. Rather than treating generation and evaluation as isolated modules, we leverage their intrinsic connection to enable joint improvement within a single shared-parameter model. To restrict this process, we introduce a meta-harness, which dynamically controls the evaluation environment based on solver performance, encouraging valid evaluation dimensions and sufficiently deep evaluator search. Extensive experiments on deep research benchmarks demonstrate consistent improvement in report generation quality, showing that co-evolving evaluation and generation is a promising direction for training open-ended research agents.", "authors": [ "Han Zhu", "Chengkun Cai", "Yuanfeng Song", "Xing Chen", "Sirui Han", "Yike Guo" ], "year": 2026, "published_date": "2026-06-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.04507", "pdf_url": "https://arxiv.org/pdf/2606.04507", "citations": 0, "topics": [], "tags": [ "LLMs", "RL", "Evaluation", "Artificial Intelligence", "NLP" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.42, "read_first_score": 5.05, "content_potential_score": 0.0, "interestingness_score": 1.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large Language Models (LLMs) have become increasingly adopted in daily applications, with deep research standing out as a particularly important capability. Unlike traditional question-answering (QA) tasks, deep research report generation lacks definitive ground-truth, making reward design inherently unverifiable and limiting effective reinforcement learning.", "key_contribution": "To restrict this process, we introduce a meta-harness, which dynamically controls the evaluation environment based on solver performance, encouraging valid evaluation dimensions and sufficiently deep evaluator search.", "why_it_matters": "Self-Evolving Deep Research via Joint Generation and Evaluation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To restrict this process, we introduce a meta-harness, which dynamically controls the evaluation environment based on…", "biggest_caveat": "cannot adapt their standards as the solver improves, leading to insufficient and eventually saturated optimization pressure.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.04507", "difficulty": "beginner" }, { "id": "arxiv:2605.04808", "source": "arxiv", "source_type": "preprint", "title": "DecodingTrust-Agent Platform (DTap): A Controllable and Interactive Red-Teaming Platform for AI Agents", "abstract": "AI agents are increasingly deployed across diverse domains to automate complex workflows through long-horizon and high-stakes action executions. Due to their high capability and flexibility, such agents raise significant security and safety concerns. A growing number of real-world incidents have shown that adversaries can easily manipulate agents into performing harmful actions, such as leaking API keys, deleting user data, or initiating unauthorized transactions. Evaluating agent security is inherently challenging, as agents operate in dynamic, untrusted environments involving external tools, heterogeneous data sources, and frequent user interactions. However, realistic, controllable, and reproducible environments for large-scale risk assessment remain largely underexplored. To address this gap, we introduce the DecodingTrust-Agent Platform (DTap), the first controllable and interactive red-teaming platform for AI agents, spanning 14 real-world domains and over 50 simulation environments that replicate widely used systems such as Google Workspace, Paypal, and Slack. To scale the risk assessment of agents in DTap, we further propose DTap-Red, the first autonomous red-teaming agent that systematically explores diverse injection vectors (e.g., prompt, tool, skill, environment, combinations) and autonomously discovers effective attack strategies tailored to varying malicious goals. Using DTap-Red, we curate DTap-Bench, a large-scale red-teaming dataset comprising high-quality instances across domains, each paired with a verifiable judge to automatically validate attack outcomes. Through DTap, we conduct large-scale evaluations of popular AI agents built on various backbone models, spanning security policies, risk categories, and attack strategies, revealing systematic vulnerability patterns and providing valuable insights for developing secure next-generation agents.", "authors": [ "Zhaorun Chen", "Xun Liu", "Haibo Tong", "Chengquan Guo", "Yuzhou Nie", "Jiawei Zhang", "Mintong Kang", "Chejian Xu", "Qichang Liu", "Xiaogeng Liu", "Tianneng Shi", "Chaowei Xiao", "Sanmi Koyejo", "Percy Liang", "Wenbo Guo", "Dawn Song", "Bo Li" ], "year": 2026, "published_date": "2026-05-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.04808", "pdf_url": "https://arxiv.org/pdf/2605.04808", "citations": 0, "topics": [], "tags": [ "AI Agents", "Artificial Intelligence" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.42, "read_first_score": 5.73, "content_potential_score": 2.05, "interestingness_score": 2.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "AI agents are increasingly deployed across diverse domains to automate complex workflows through long-horizon and high-stakes action executions. Due to their high capability and flexibility, such agents raise significant security and safety concerns.", "key_contribution": "To address this gap, we introduce the DecodingTrust-Agent Platform (DTap), the first controllable and interactive red-teaming platform for AI agents, spanning 14 real-world domains and over 50 simulation environments that replicate widely used systems such as Google Workspace, Paypal, and Slack.", "why_it_matters": "DecodingTrust-Agent Platform (DTap): A Controllable and Interactive Red-Teaming Platform for AI Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "To address this gap, we introduce the DecodingTrust-Agent Platform (DTap), the first controllable and interactive…", "biggest_caveat": "However, realistic, controllable, and reproducible environments for large-scale risk assessment remain largely underexplored.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2605.04808", "difficulty": "intermediate" }, { "id": "arxiv:2605.11496", "source": "arxiv", "source_type": "preprint", "title": "The Evaluation Differential: When Frontier AI Models Recognise They Are Being Tested", "abstract": "Recent published evidence from frontier laboratories shows that contemporary AI models can recognise evaluation contexts, latently represent them, and behave differently under those contexts than under deployment-continuous conditions. Anthropic's BrowseComp incident, the Natural Language Autoencoder findings on SWE-bench Verified and destructive-coding evaluations, and the OpenAI / Apollo anti-scheming work all document instances of this phenomenon. We argue that these findings create a claim-validity problem for safety conclusions drawn from frontier evaluations. We introduce the Evaluation Differential (ED), a conditional divergence in a target behavioural property between recognised-evaluation and deployment-continuous contexts, define a normalised effect-size form (nED) for cross-property comparison, and prove that marginal evaluation scores cannot identify ED. We develop a typology of safety claims (ED-stable, ED-degraded, ED-inverted, ED-undetermined) by their warrant-status under documented divergence, and specify TRACE (Test-Recognition Audit for Claim Evaluation), an audit protocol that wraps existing evaluation infrastructure and produces restricted claims rather than capability scores. We apply the framework retrospectively to three publicly documented evaluation incidents and discuss governance implications for system cards, conformity assessment, and the international network of AI safety and security institutes. TRACE does not eliminate adversarial adaptation; it disciplines the claims drawn from evaluation evidence by making explicit the conditions under which that evidence was produced.", "authors": [ "Varad Vishwarupe", "Nigel Shadbolt", "Marina Jirotka", "Ivan Flechais" ], "year": 2026, "published_date": "2026-05-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.11496", "pdf_url": "https://arxiv.org/pdf/2605.11496", "citations": 0, "topics": [], "tags": [ "AI Safety", "Artificial Intelligence", "Human-Computer Interaction", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.42, "read_first_score": 3.95, "content_potential_score": 1.0, "interestingness_score": 2.21, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent published evidence from frontier laboratories shows that contemporary AI models can recognise evaluation contexts, latently represent them, and behave differently under those contexts than under deployment-continuous conditions. Anthropic's BrowseComp incident, the Natural Language Autoencoder findings on SWE-bench Verified and destructive-coding evaluations, and the OpenAI / Apollo anti-scheming work all document instances of this phenomenon.", "key_contribution": "We introduce the Evaluation Differential (ED), a conditional divergence in a target behavioural property between recognised-evaluation and deployment-continuous contexts, define a normalised effect-size form (nED) for cross-property comparison, and prove that marginal evaluation scores cannot identify ED.", "why_it_matters": "The Evaluation Differential: When Frontier AI Models Recognise They Are Being Tested represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We introduce the Evaluation Differential (ED), a conditional divergence in a target behavioural property between…", "biggest_caveat": "cannot identify ED.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2605.11496", "difficulty": "advanced" }, { "id": "arxiv:2507.11687", "source": "arxiv", "source_type": "preprint", "title": "MetaLint: Easy-to-Hard Generalization for Code Linting", "abstract": "Large language models excel at code generation but struggle with code linting, particularly in generalizing to unseen or evolving best practices beyond those observed during training. We introduce MetaLint, a meta-learning framework that formulates code linting as an instruction-following task, where a model evaluates whether code adheres to a natural language specification of best practices. In contrast to prior work that trains models to detect violations from a fixed set of best practices, MetaLint evaluates code against a provided natural language specification, enabling test-time control over which practices to enforce and generalization to unseen or evolving rules without retraining. We demonstrate that models trained solely on synthetic data generated from automatic linters still generalize to harder, context-dependent best practices for which such linters are not available. To evaluate generalization beyond such easy signals, we introduce a human-curated benchmark of hard best practices inspired by Python Enhancement Proposals (PEPs). On this benchmark, MetaLint substantially improves performance without explicit fine-tuning on target best practices and exhibits strong, easy-to-hard generalization. Qwen3-4B achieves a 2.7x detection F-score gain (25.9% -> 70.4%), the highest recall, and a 26.7% localization F-score, matching larger models such as o3-mini. These gains generalize across programming languages, model families, scales, reasoning settings, and linter sources. We release the code and benchmark to support reproducibility and future work.", "authors": [ "Atharva Naik", "Lawanya Baghel", "Dhakshin Govindarajan", "Darsh Agrawal", "Yiqing Xie", "Daniel Fried", "Carolyn Rose" ], "year": 2026, "published_date": "2026-08-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2507.11687", "pdf_url": "https://arxiv.org/pdf/2507.11687", "citations": 0, "topics": [], "tags": [ "Reasoning", "Fine-Tuning", "Code Generation", "Evaluation", "Software Engineering" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.41, "read_first_score": 6.76, "content_potential_score": 3.15, "interestingness_score": 3.28, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models excel at code generation but struggle with code linting, particularly in generalizing to unseen or evolving best practices beyond those observed during training. We introduce MetaLint, a meta-learning framework that formulates code linting as an instruction-following task, where a model evaluates whether code adheres to a natural language specification of best practices.", "key_contribution": "We introduce MetaLint, a meta-learning framework that formulates code linting as an instruction-following task, where a model evaluates whether code adheres to a natural language specification of best practices.", "why_it_matters": "MetaLint: Easy-to-Hard Generalization for Code Linting represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We introduce MetaLint, a meta-learning framework that formulates code linting as an instruction-following task, where a…", "biggest_caveat": "but struggle with code linting, particularly in generalizing to unseen or evolving best practices beyond those observed during training.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2507.11687", "difficulty": "beginner" }, { "id": "arxiv:2604.27321", "source": "arxiv", "source_type": "preprint", "title": "Toward Autonomous SOC Operations: End-to-End LLM Framework for Threat Detection, Query Generation, and Resolution in Security Operations", "abstract": "Security Operations Centers (SOCs) face mounting operational challenges. These challenges come from increasing threat volumes, heterogeneous SIEM platforms, and time-consuming manual triage workflows. We present an end-to-end threat management framework that integrates ensemble-based detection, syntax-constrained query generation, and retrieval-augmented resolution support to automate critical security workflows. Our detection module evaluates both traditional machine learning classifiers and large language models (LLMs), then combines the three best-performing LLMs to create an ensemble model, achieving 82.8% accuracy while maintaining 0.120 false positive rate on SIEM logs. We introduce the SQM (Syntax Query Metadata) architecture for automated evidence collection. It uses platform-specific syntax constraints, metadata-based retrieval, and documentation-grounded prompting to generate executable queries for IBM QRadar and Google SecOps. SQM achieves a BLEU score of 0.384 and a ROUGE-L score of 0.731. These results are more than twice as good as the baseline LLM performance. For incident resolution and recommendation generation, we demonstrate that integrating SQM-derived evidence improves resolution code prediction accuracy from 78.3% to 90.0%, with an overall recommendation quality score of 8.70. In production SOC environments, our framework reduces average incident triage time from hours to under 10 minutes. This work demonstrates that domain-constrained LLM architectures with retrieval augmentation can meet the strict reliability and efficiency requirements of operational security environments at scale.", "authors": [ "Md Hasan Saju", "Akramul Azim" ], "year": 2026, "published_date": "2026-04-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.27321", "pdf_url": "https://arxiv.org/pdf/2604.27321", "citations": 0, "topics": [], "tags": [ "LLMs", "Information Retrieval", "Artificial Intelligence", "Cryptography & Security" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.41, "read_first_score": 6.13, "content_potential_score": 2.34, "interestingness_score": 2.88, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Security Operations Centers (SOCs) face mounting operational challenges. These challenges come from increasing threat volumes, heterogeneous SIEM platforms, and time-consuming manual triage workflows.", "key_contribution": "We present an end-to-end threat management framework that integrates ensemble-based detection, syntax-constrained query generation, and retrieval-augmented resolution support to automate critical security workflows.", "why_it_matters": "Toward Autonomous SOC Operations: End-to-End LLM Framework for Threat Detection, Query Generation, and Resolution in Security Operations improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present an end-to-end threat management framework that integrates ensemble-based detection, syntax-constrained query…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2604.27321", "difficulty": "intermediate" }, { "id": "arxiv:2605.08942", "source": "arxiv", "source_type": "preprint", "title": "Decomposing and Steering Functional Metacognition in Large Language Models", "abstract": "Large language models (LLMs) increasingly exhibit behaviors suggesting awareness of their evaluation context, often adapting their reasoning strategies in benchmark settings. Prior work has shown that such evaluation awareness can distort performance measurements; however, it remains unclear whether this phenomenon reflects a single behavioral artifact or a deeper internal structure within the model. We propose that LLMs maintain a decomposable space of functional metacognitive states: internal variables encoding factors such as evaluation awareness, self-assessed capability, perceived risk, computational effort allocation, audience expertise adaptation, and intentionality. Through residual stream analysis across multiple reasoning models, we demonstrate that these states are linearly decodable from internal activations and exhibit distinct layer-wise profiles. Moreover, by steering model activations along probe-derived directions, we show that each functional metacognitive state causally modulates reasoning behavior in dissociable ways, affecting verbosity, accuracy, and safety-related responses across tasks. Our findings suggest that benchmark performance reflects not only task competence but also the activation of specific functional metacognitive states. We argue that understandi ng and controlling these internal states is essential for reliable evaluation and deployment of reasoning models, and we provide a mechanistic framework for studying functional m etacognition in artificial systems. Our code and data are publicly available at https://github.com/xlands/meta-cognition.", "authors": [ "Yanshi Li", "Xueru Bai", "Shuman Liu", "Haibo Zhang", "Anxiang Zeng" ], "year": 2026, "published_date": "2026-05-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.08942", "pdf_url": "https://arxiv.org/pdf/2605.08942", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.41, "read_first_score": 6.69, "content_potential_score": 2.05, "interestingness_score": 2.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models (LLMs) increasingly exhibit behaviors suggesting awareness of their evaluation context, often adapting their reasoning strategies in benchmark settings. Prior work has shown that such evaluation awareness can distort performance measurements; however, it remains unclear whether this phenomenon reflects a single behavioral artifact or a deeper internal structure within the model.", "key_contribution": "We propose that LLMs maintain a decomposable space of functional metacognitive states: internal variables encoding factors such as evaluation awareness, self-assessed capability, perceived risk, computational effort allocation, audience expertise adaptation, and intentionality.", "why_it_matters": "Decomposing and Steering Functional Metacognition in Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose that LLMs maintain a decomposable space of functional metacognitive states: internal variables encoding…", "biggest_caveat": "however, it remains unclear whether this phenomenon reflects a single behavioral artifact or a deeper internal structure within the model.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.08942", "difficulty": "beginner" }, { "id": "arxiv:2604.18331v1", "source": "arxiv", "source_type": "preprint", "title": "Will People Enjoy a Robot Trainer? A Case Study with Snoopie the Pacerbot", "abstract": "The physicality of exercise makes the role of athletic trainers unique. Their physical presence allows them to guide a student through a motion, demonstrate an exercise, and give intuitive feedback. Robot quadrupeds are also embodied agents with robust agility and athleticism. In our work, we investigate whether a robot quadruped can serve as an effective and enjoyable personal trainer device. We focus on a case study of interval training for runners: a repetitive, long-horizon task where precision and consistency are important. To meet this challenge, we propose SNOOPIE, an autonomous robot quadruped pacer capable of running interval training exercises tailored to challenge a user's personal abilities. We conduct a set of user experiments that compare the robot trainer to a wearable trainer device--the Apple Watch--to investigate the benefits of a physical embodiment in exercise-based interactions. We demonstrate 60.6% better adherence to a pace schedule and were 45.9% more consistent across their running speeds with the quadruped trainer. Subjective results also showed that participants strongly preferred training with the robot over wearable devices across many qualitative axes, including its ease of use (+56.7%), enjoyability of the interaction (+60.6%), and helpfulness (+39.1%). Additional videos and visualizations can be found on our website: https://sites.google.com/view/snoopie", "authors": [ "Maximilian Du", "Jennifer Grannen", "Shuran Song", "Dorsa Sadigh" ], "year": 2026, "published_date": "2026-04-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.18331v1", "pdf_url": "https://arxiv.org/pdf/2604.18331v1", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Robotics" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.41, "read_first_score": 5.21, "content_potential_score": 0.42, "interestingness_score": 1.92, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The physicality of exercise makes the role of athletic trainers unique. Their physical presence allows them to guide a student through a motion, demonstrate an exercise, and give intuitive feedback.", "key_contribution": "Their physical presence allows them to guide a student through a motion, demonstrate an exercise, and give intuitive feedback.", "why_it_matters": "Will People Enjoy a Robot Trainer? A Case Study with Snoopie the Pacerbot represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "Their physical presence allows them to guide a student through a motion, demonstrate an exercise, and give intuitive…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "http://arxiv.org/abs/2604.18331v1", "difficulty": "intermediate" }, { "id": "arxiv:2609.15983", "source": "arxiv", "source_type": "preprint", "title": "Stellar Colosseum: A Many-Agent Harness for Long-Horizon Research in Mathematics and Theoretical Computer Science", "abstract": "Language models can produce plausible short proofs, but may still be unreliable on long-horizon research problems, where progress depends on a sequence of uncertain and interdependent decisions. We introduce Stellar Colosseum, a model-agnostic harness for allocating inference across research in mathematics and theoretical computer science. Colosseum explores alternative strategies before proof construction, uses a readiness gate to decide when a route is mature enough to decompose, represents the proof plan as interdependent section-level subproblems, and routes verifier findings back to the affected part of the argument. Across these stages, it generates candidates in parallel, attacks them with targeted falsification, and combines candidates and their critiques into a single research artifact through overlapping random-sample tree aggregation. The Colosseum workflow has been integrated into Google Antigravity's Teamwork framework as the Long Proof pattern. We demonstrate the capabilities of Colosseum through open-ended research and evaluations on theorem-proving and competitive programming benchmarks. Using Colosseum with Gemini 3.1 Pro, we obtain several new results that address open problems arising from papers published at top venues such as FOCS and JMLR. On TCS-Bench, a benchmark of research-level theorem-proving tasks drawn from papers published at FOCS, STOC, and SODA, Colosseum achieves 71.0% accuracy using Gemini 3.1 Pro and Gemini 3.7 Flash. In a separate Codeforces evaluation using Gemini 3.1 Pro, the proof-oriented pipeline with execution feedback solves 218 of 222 problems.", "authors": [ "Honghao Lin", "David P. Woodruff", "Yuan Deng", "Jieming Mao", "Song Zuo", "Vahab Mirrokni" ], "year": 2026, "published_date": "2026-09-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.15983", "pdf_url": "https://arxiv.org/pdf/2609.15983", "citations": 0, "topics": [], "tags": [ "Evaluation", "Artificial Intelligence", "Machine Learning", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.4, "read_first_score": 4.72, "content_potential_score": 1.5, "interestingness_score": 2.45, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Language models can produce plausible short proofs, but may still be unreliable on long-horizon research problems, where progress depends on a sequence of uncertain and interdependent decisions. We introduce Stellar Colosseum, a model-agnostic harness for allocating inference across research in mathematics and theoretical computer science.", "key_contribution": "We introduce Stellar Colosseum, a model-agnostic harness for allocating inference across research in mathematics and theoretical computer science.", "why_it_matters": "Stellar Colosseum: A Many-Agent Harness for Long-Horizon Research in Mathematics and Theoretical Computer Science represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "We introduce Stellar Colosseum, a model-agnostic harness for allocating inference across research in mathematics and…", "biggest_caveat": "but may still be unreliable on long-horizon research problems, where progress depends on a sequence of uncertain and interdependent decisions.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2609.15983", "difficulty": "frontier" }, { "id": "arxiv:2502.02763", "source": "arxiv", "source_type": "preprint", "title": "Looking Locally: Object-Centric Vision Transformers as Foundation Models for Efficient Segmentation", "abstract": "Current state-of-the-art segmentation models encode entire images before focusing on specific objects. This wastes computational resources. We introduce FLIP (Fovea-Like Input Patching), a parameter-efficient vision model that realizes object segmentation through biologically-inspired top-down attention. FLIP selectively samples multi-resolution patches centered on objects of interest from the input. As a result, it allocates high-resolution processing to object centers while maintaining coarser peripheral context. This off-grid, scale-invariant design enables FLIP to outperform META's Segment Anything models (SAM, SAM2 and fast variants) by large margins: With more than 440$\\times$ fewer parameters, FLIP-Tiny (0.51M parameters) reaches a mean IoU of 79.90% while SAM2-L reaches 75.87% IoU (224.45M parameters). FLIP-Large even achieves 83.26% mean IoU (96.6M parameters), still running about $2\\times$ faster than SAM2-L. We evaluate on six benchmarks in total. In five established benchmarks (Hypersim, KITTI-360, OpenImages, COCO, LVIS) FLIP consistently outperforms SAM and various variants of it. In our novel ObjaScale dataset, which stress-tests scale invariance with objects ranging from 0.0001% up to 25% of the image area, we show that FLIP segments even very small objects accurately, where existing models fail severely. FLIP opens new possibilities for real-time, object-centric vision and offers much higher energy efficiency. We believe that FLIP can act as a powerful foundation model, as it is very well-suited to track objects over time, for example, when being integrated into slot-based scene segmentation architectures.", "authors": [ "Manuel Traub", "Martin V. Butz" ], "year": 2026, "published_date": "2026-07-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2502.02763", "pdf_url": "https://arxiv.org/pdf/2502.02763", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Transformers", "Evaluation", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.4, "read_first_score": 6.42, "content_potential_score": 1.5, "interestingness_score": 2.45, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Current state-of-the-art segmentation models encode entire images before focusing on specific objects. This wastes computational resources.", "key_contribution": "We introduce FLIP (Fovea-Like Input Patching), a parameter-efficient vision model that realizes object segmentation through biologically-inspired top-down attention.", "why_it_matters": "Looking Locally: Object-Centric Vision Transformers as Foundation Models for Efficient Segmentation advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We introduce FLIP (Fovea-Like Input Patching), a parameter-efficient vision model that realizes object segmentation…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2502.02763", "difficulty": "beginner" }, { "id": "arxiv:2607.06015", "source": "arxiv", "source_type": "preprint", "title": "Music I Care About: Automated Multimodal Benchmarking of LLM Music Perception Skills on (Almost) Any Music", "abstract": "Music represents a cornerstone of human culture, existing digitally across diverse modalities, including audio, symbolic encodings (e.g., MIDI, MusicXML), and sheet music. Despite the advancement of Multimodal Large Language Models (MLLMs), current music benchmarks face three major limitations. First, large static benchmarks are resource-intensive to evaluate, and it remains unclear how their results transfer to diverse kinds of music beyond those included in the benchmark. Second, benchmarks claiming to measure \"music understanding\" often fail to require music perception. Third, they do not support systematic performance comparisons across musical modalities. To overcome these issues, we introduce the Music I Care About Meta-Benchmark (MusICA-MetaBench), a framework that automatically derives on-demand benchmarks directly from user-provided data. By leveraging structured symbolic representations (e.g., MusicXML) and our pre-defined question templates, we build multiple-choice question-answer pairs that probe music perception competencies, aligned with music pedagogy, across audio, music notation images, and symbolic files. We demonstrate our framework with the ChoraleBricks dataset, and experimentally determine benchmark sizes that ensure statistically reliable model comparisons for this setup. By comparing against text-only and white-noise baselines, we show our questions do measure music perception. Ultimately, MusICA-MetaBench represents a significant advancement in the cross-modal assessment of music perception for MLLMs. By proposing a dataset-specific benchmarking paradigm, it enables efficient on-demand evaluation of music perception capabilities.", "authors": [ "Tomáš Sourada", "Katia Vendrame", "Jan Hajič" ], "year": 2026, "published_date": "2026-07-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.06015", "pdf_url": "https://arxiv.org/pdf/2607.06015", "citations": 0, "topics": [], "tags": [ "LLMs", "Multimodal", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.4, "read_first_score": 6.75, "content_potential_score": 1.5, "interestingness_score": 2.45, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Music represents a cornerstone of human culture, existing digitally across diverse modalities, including audio, symbolic encodings (e.g., MIDI, MusicXML), and sheet music. Despite the advancement of Multimodal Large Language Models (MLLMs), current music benchmarks face three major limitations.", "key_contribution": "To overcome these issues, we introduce the Music I Care About Meta-Benchmark (MusICA-MetaBench), a framework that automatically derives on-demand benchmarks directly from user-provided data.", "why_it_matters": "Music I Care About: Automated Multimodal Benchmarking of LLM Music Perception Skills on (Almost) Any Music represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To overcome these issues, we introduce the Music I Care About Meta-Benchmark (MusICA-MetaBench), a framework that…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.06015", "difficulty": "beginner" }, { "id": "arxiv:2607.06238", "source": "arxiv", "source_type": "preprint", "title": "PhyMRI-SR: Toward Physics-Aware MRI Image Super-Resolution", "abstract": "Magnetic resonance imaging (MRI) super-resolution is vital for improving diagnostic accessibility, yet most methods treat it as a deterministic mapping from a fixed low-resolution input to a high-resolution target. This overlooks a key property of MRI acquisition physics: spatial resolution and signal-to-noise ratio (SNR) are inherently coupled, making any given low-resolution scan merely one of many possible realizations under varying acquisition trade-offs. We rethink MRI super-resolution as a physics-aware reconstruction problem, in which the goal is to identify the optimal resolution-SNR configuration and then super-resolve it to obtain high-quality MRI results. A key implication of this formulation is that MRI resolution becomes dynamic rather than fixed. To handle such resolution-heterogeneous inputs, we adapt 2D Gaussian Splatting (2D GS) to MRI by formulating reconstruction as a coordinate-based, resolution-agnostic rendering problem. To further enhance fidelity, we introduce three innovations: (1) a prior-aware Gaussian representation that combines an Anatomical Structure Prior for tissue-specific kernel initialization with an Imaging System Prior that captures hardware characteristics via a covariance dictionary; (2) a physics-constrained signal modeling scheme that predicts intrinsic tissue parameters (proton density rho and effective relaxation rate R2) and synthesizes intensities through governing physical equations, ensuring biophysically plausible contrast; and (3) a meta-learning framework that alleviates paired-data scarcity by pretraining on simulated data and adapting to real-world conditions. Extensive experiments on dynamic-resolution datasets and standard benchmarks demonstrate that our method achieves state-of-the-art performance, highlighting its strong potential for clinical deployment.", "authors": [ "Lihua Wei", "Huatong Gao", "Jia Gong", "Zhiyu Tan", "Hao Li", "Jun Liu", "Zhihua Ren" ], "year": 2026, "published_date": "2026-07-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.06238", "pdf_url": "https://arxiv.org/pdf/2607.06238", "citations": 0, "topics": [], "tags": [ "3D Vision", "Self-Supervised", "Biomedical AI", "Evaluation", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses pretraining — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.4, "read_first_score": 4.78, "content_potential_score": 1.0, "interestingness_score": 2.2, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Magnetic resonance imaging (MRI) super-resolution is vital for improving diagnostic accessibility, yet most methods treat it as a deterministic mapping from a fixed low-resolution input to a high-resolution target. This overlooks a key property of MRI acquisition physics: spatial resolution and signal-to-noise ratio (SNR) are inherently coupled, making any given low-resolution scan merely one of many possible realizations under varying acquisition trade-offs.", "key_contribution": "To further enhance fidelity, we introduce three innovations: (1) a prior-aware Gaussian representation that combines an Anatomical Structure Prior for tissue-specific kernel initialization with an Imaging System Prior that captures hardware characteristics via a covariance dictionary; (2) a physics-constrained signal modeling scheme that predicts intrinsic tissue parameters (proton density rho and effective relaxation rate R2) and synthesizes intensities through governing physical equations, ensuring biophysically plausible contrast; and (3) a meta-learning framework that alleviates paired-data scarcity by pretraining on simulated data and adapting to real-world conditions.", "why_it_matters": "PhyMRI-SR: Toward Physics-Aware MRI Image Super-Resolution advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about 3D Vision.", "one_line_takeaway": "To further enhance fidelity, we introduce three innovations: (1) a prior-aware Gaussian representation that combines an…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in 3D Vision.", "url": "https://arxiv.org/abs/2607.06238", "difficulty": "advanced" }, { "id": "arxiv:2609.21247", "source": "arxiv", "source_type": "preprint", "title": "When Does Reasoning Help in Machine Translation? A Hierarchical Analysis of LRM Reasoning Traces", "abstract": "Large Reasoning Models increasingly use intermediate traces for machine translation, but it remains unclear when such reasoning helps or hurts. We analyze reasoning traces across models, languages, domains, and datasets, focusing on reasoning language, length, and structure. We find that the best reasoning language is model-specific, reasoning length has a non-monotonic relationship with quality, and traces exhibit recurring functional patterns. To uncover these patterns, we introduce Hierarchical Meta-Summarization (HMS), a scalable framework that induces coarse- and fine-grained reasoning structures without predefined taxonomies. HMS reveals a shared organization--understanding/planning, translating/drafting, and refining/verifying--alongside domain-specific variation. Our results suggest that MT reasoning should be controlled in a model-aware, length-aware, and pattern-aware manner rather than uniformly encouraged.", "authors": [ "Yuxiang Liu", "Jiaming Luo", "Eleftheria Briakou", "Colin Cherry" ], "year": 2026, "published_date": "2026-09-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.21247", "pdf_url": "https://arxiv.org/pdf/2609.21247", "citations": 0, "topics": [], "tags": [ "Reasoning", "Translation", "Summarization", "Info Extraction", "NLP" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Summarization, Translation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.39, "read_first_score": 4.37, "content_potential_score": 1.0, "interestingness_score": 2.2, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large Reasoning Models increasingly use intermediate traces for machine translation, but it remains unclear when such reasoning helps or hurts. We analyze reasoning traces across models, languages, domains, and datasets, focusing on reasoning language, length, and structure.", "key_contribution": "To uncover these patterns, we introduce Hierarchical Meta-Summarization (HMS), a scalable framework that induces coarse- and fine-grained reasoning structures without predefined taxonomies.", "why_it_matters": "When Does Reasoning Help in Machine Translation? A Hierarchical Analysis of LRM Reasoning Traces represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "To uncover these patterns, we introduce Hierarchical Meta-Summarization (HMS), a scalable framework that induces…", "biggest_caveat": "but it remains unclear when such reasoning helps or hurts.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2609.21247", "difficulty": "beginner" }, { "id": "arxiv:2609.19832", "source": "arxiv", "source_type": "preprint", "title": "MetaRTL: Meta-path Attention Enhanced Relational Table Learning", "abstract": "Relational table learning has gained increasing attention with the widespread use of relational databases. Existing methods typically rely on deep GNN or HGNN stacks, leading to high computational costs and limited performance on large real-world databases. We propose MetaRTL, a two-stage framework for scalable and expressive relational table learning. In the first stage, MetaRTL obtains initial table embeddings via lightweight pre-training. In the second stage, it performs non-parametric message passing to derive meta-path features, which are then aggregated by an attention module, MetaAttn. By shifting computation from deep message passing to efficient meta-path aggregation, MetaRTL captures rich relational semantics while maintaining high efficiency. Experiments on 10 real-world datasets across 24 tasks demonstrate the effectiveness of the proposed method.", "authors": [ "Ken Zhong", "Weichen Li", "Zheng Wang" ], "year": 2026, "published_date": "2026-09-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.19832", "pdf_url": "https://arxiv.org/pdf/2609.19832", "citations": 0, "topics": [], "tags": [ "GNNs", "Self-Supervised", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (GNNs) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.39, "read_first_score": 3.25, "content_potential_score": 1.0, "interestingness_score": 2.2, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Relational table learning has gained increasing attention with the widespread use of relational databases. Existing methods typically rely on deep GNN or HGNN stacks, leading to high computational costs and limited performance on large real-world databases.", "key_contribution": "We propose MetaRTL, a two-stage framework for scalable and expressive relational table learning.", "why_it_matters": "MetaRTL: Meta-path Attention Enhanced Relational Table Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about GNNs.", "one_line_takeaway": "We propose MetaRTL, a two-stage framework for scalable and expressive relational table learning.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in GNNs.", "url": "https://arxiv.org/abs/2609.19832", "difficulty": "advanced" }, { "id": "arxiv:2606.00979", "source": "arxiv", "source_type": "preprint", "title": "UME: A Unified Meta-Generalization Framework for Cross-Domain ETA", "abstract": "Accurate Estimated Time of Arrival (ETA) prediction on checkout page is crucial in instant logistics for enhancing user satisfaction, optimizing dispatching, and controlling operational costs. In international on-demand delivery platforms, where ETA data originates from diverse countries or regions with different patterns, multi-domain modeling is of great importance and has been widely adopted. However, existing methods still face three critical challenges in real-world deployment. First, current multi-domain models struggle to generalize to completely unseen domains, failing to achieve zero-shot prediction during the initial cold-start phase. Second, cross-domain feature spaces are often assumed to be consistent, whereas new domains commonly suffer from structural missingness of offline (statistical) features due to the lack of historical data. Third, such feature missingness often compels industrial systems to model mature and cold-start domains separately, hindering knowledge transfer and increasing maintenance overhead. To address these challenges, we propose \\textbf{UME}, a \\textbf{U}nified \\textbf{M}eta-generalization framework for \\textbf{E}TA. Specifically, UME integrates a unified dual-branch architecture with a novel meta-learning mechanism that employs a hypernetwork-based meta learner. By leveraging domain-level knowledge and instance-level context, the meta learner empowers three meta modules to dynamically modulate feature gating, expert attention, and final prediction, capturing cross-domain correlations and facilitating intra-domain adaptation. A knowledge distillation strategy is further introduce to enhance performance. UME has now been deployed in Meituan-keeta delivery platform (the largest international food delivery platform in China). Extensive offline experiments and online A/B tests demonstrate that UME significantly outperforms existing baselines.", "authors": [ "Duo Wang", "Qiong Wu", "Jianguo Wu", "Ruiyu Xu", "Jinhui Yi", "Zhonggen Sun", "Zhentao Zhang", "Yu Zhang", "Ke Xing", "Yongjun Yin", "Zishuo Li", "Jianwen Huang" ], "year": 2026, "published_date": "2026-05-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.00979", "pdf_url": "https://arxiv.org/pdf/2606.00979", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Model Compression", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.39, "read_first_score": 5.22, "content_potential_score": 3.23, "interestingness_score": 3.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Accurate Estimated Time of Arrival (ETA) prediction on checkout page is crucial in instant logistics for enhancing user satisfaction, optimizing dispatching, and controlling operational costs. In international on-demand delivery platforms, where ETA data originates from diverse countries or regions with different patterns, multi-domain modeling is of great importance and has been widely adopted.", "key_contribution": "First, current multi-domain models struggle to generalize to completely unseen domains, failing to achieve zero-shot prediction during the initial cold-start phase.", "why_it_matters": "UME: A Unified Meta-Generalization Framework for Cross-Domain ETA represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "First, current multi-domain models struggle to generalize to completely unseen domains, failing to achieve zero-shot…", "biggest_caveat": "However, existing methods still face three critical challenges in real-world deployment.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2606.00979", "difficulty": "intermediate" }, { "id": "arxiv:2608.26649", "source": "arxiv", "source_type": "preprint", "title": "Robust Neural Stimulation Response Modeling Through Meta-Learning and Pretraining", "abstract": "Objective: Model-based closed-loop neural stimulation holds promise for therapeutic applications ranging from Parkinson's disease to sensory restoration, but deployment has been limited by two obstacles: 1) forecasting models for predicting the consequences of stimulation fail catastrophically on a meaningful fraction of sessions, and 2) per-session calibration requirements are often incompatible with clinical constraints. We address both by demonstrating, for the first time, that meta-learning and pretraining can be applied to neural stimulation response modeling. Methods: Temporal basis function models (TBFMs) forecast state-dependent neural responses to stimulation. We extend TBFMs with cross-session pretraining using a novel architecture and algorithm based on model-agnostic meta-learning (MAML), evaluating them on 40 sessions of optogenetic stimulation in primary sensorimotor cortex of two non-human primates. Results: Meta-learning substantially reduces catastrophic forecast failure: for a 1k calibration set size, sessions with test R-squared < 0.05 drop from 16 of 40 (single-session training) to 1 (MAML-pretrained), and prediction intervals become significantly narrower (p < 0.05). Calibration requirements are reduced by 50-90% at matched accuracy, enabling experiments otherwise infeasible within clinical session-time constraints. Conclusion: Our results demonstrate that cross-session structure in stimulation responses is consistent enough to support pretraining, providing the first empirical evidence that meta-learning approaches are viable for neural stimulation. Significance: The robustness and sample efficiency gains directly address known obstacles to deploying model-based stimulation controllers. Our results motivate community efforts to assemble standardized multi-site stimulation datasets and to further explore meta-learning for robust closed-loop stimulation.", "authors": [ "Matthew J Bryan", "Daniel C Muir", "Felix Schwock", "Azadeh Yazdan-Shahmorad", "Rajesh P N Rao" ], "year": 2026, "published_date": "2026-08-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.26649", "pdf_url": "https://arxiv.org/pdf/2608.26649", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "Biomedical AI", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses pretraining — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.39, "read_first_score": 3.44, "content_potential_score": 1.0, "interestingness_score": 2.2, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Objective: Model-based closed-loop neural stimulation holds promise for therapeutic applications ranging from Parkinson's disease to sensory restoration, but deployment has been limited by two obstacles: 1) forecasting models for predicting the consequences of stimulation fail catastrophically on a meaningful fraction of sessions, and 2) per-session calibration requirements are often incompatible with clinical constraints. We address both by demonstrating, for the first time, that meta-learning and pretraining can be applied to neural stimulation response modeling.", "key_contribution": "We extend TBFMs with cross-session pretraining using a novel architecture and algorithm based on model-agnostic meta-learning (MAML), evaluating them on 40 sessions of optogenetic stimulation in primary sensorimotor cortex of two non-human primates.", "why_it_matters": "Robust Neural Stimulation Response Modeling Through Meta-Learning and Pretraining represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "We extend TBFMs with cross-session pretraining using a novel architecture and algorithm based on model-agnostic…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Self-Supervised.", "url": "https://arxiv.org/abs/2608.26649", "difficulty": "advanced" }, { "id": "arxiv:2608.25350", "source": "arxiv", "source_type": "preprint", "title": "Beyond Pairwise Feedback: Listwise Vision-Language Supervision for Preference-Based Reward Learning", "abstract": "Vision-language models (VLMs) have emerged as a powerful source of supervision for reinforcement learning, enabling agents to leverage rich semantic knowledge during training. Inspired by the success of preference-based reward learning (PbRL) in reinforcement learning from human feedback (RLHF), vision-language model generated image-based preferences provide an effective source for learning reward functions. This can be done by visually comparing two outcomes through the Bradley-Terry (BT) model. However, this pairwise formulation utilizes only two observations at a time, despite VLMs being capable of ranking multiple candidates. The Plackett-Luce (PL) formulation can shape a reward model with listwise rankings as opposed to pairwise preferences, allowing for a more suited use of a VLM based ranking. In this work, to our knowledge, we introduce the first framework that combines VLM-generated preferences with the Plackett-Luce model for reward learning. We evaluate our approach on Meta-World manipulation tasks and show that Plackett-Luce (PL) reward models can train robotic policies from VLM-generated rankings as effectively as pairwise Bradley-Terry, $K$-wise Bradley-Terry, and RL-VLM-F baselines. Across all environments, at least one PL ranking size ($K \\in \\{3,4,5\\}$) consistently performs with or outperforms other methods in mean success rate. Unlike pairwise methods, which are restricted to $K=2$, PL supports different ranking sizes and can therefore be adapted to the environment and desired feedback format. Our best PL configuration achieves an 86% mean final success rate and matches the Oracle baseline on Drawer Open. Overall, these results demonstrate that listwise VLM preference supervision is a competitive and flexible approach to reward learning for reinforcement learning.", "authors": [ "Srivalli Katkuri", "Maxwell Kawada", "Juan Wachs" ], "year": 2026, "published_date": "2026-08-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.25350", "pdf_url": "https://arxiv.org/pdf/2608.25350", "citations": 0, "topics": [], "tags": [ "RLHF", "VLMs", "Robotics", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.39, "read_first_score": 5.17, "content_potential_score": 0.0, "interestingness_score": 1.7, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Vision-language models (VLMs) have emerged as a powerful source of supervision for reinforcement learning, enabling agents to leverage rich semantic knowledge during training. Inspired by the success of preference-based reward learning (PbRL) in reinforcement learning from human feedback (RLHF), vision-language model generated image-based preferences provide an effective source for learning reward functions.", "key_contribution": "In this work, to our knowledge, we introduce the first framework that combines VLM-generated preferences with the Plackett-Luce model for reward learning.", "why_it_matters": "Beyond Pairwise Feedback: Listwise Vision-Language Supervision for Preference-Based Reward Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RLHF.", "one_line_takeaway": "In this work, to our knowledge, we introduce the first framework that combines VLM-generated preferences with the…", "biggest_caveat": "However, this pairwise formulation utilizes only two observations at a time, despite VLMs being capable of ranking multiple candidates.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RLHF.", "url": "https://arxiv.org/abs/2608.25350", "difficulty": "advanced" }, { "id": "arxiv:2608.09590", "source": "arxiv", "source_type": "preprint", "title": "TeaMatch: Teachable Cross-Modal Representation Learning for 2D-3D Matching", "abstract": "Learning reliable correspondences between images and point clouds is fundamental for 2D-3D matching. Despite recent progress in detection-free methods, existing approaches primarily optimize matching within a single model and often struggle to maintain reliable correspondences under challenging conditions such as noisy inputs, low overlap, and ambiguous structures. In this work, we propose TeaMatch, a novel framework that introduces teachability as a criterion for cross-modal representation learning. We define teachability as the ability of a representation to be effectively recovered by weak learners under degraded inputs, reflecting its structural consistency and robustness. To this end, we construct a set of task-specific weak students that simulate common failure modes and train them to imitate the teacher on a training split while evaluating their recoverability on a disjoint meta split. The teacher is then optimized to improve the students' ability to recover reliable correspondences, guided by correspondence-level and geometry-aware constraints. Our framework can be seamlessly integrated into existing coarse-to-fine matching pipelines without additional inference cost. Extensive experiments demonstrate that TeaMatch improves matching robustness and achieves state-of-the-art performance on challenging 2D-3D matching benchmarks.", "authors": [ "Chongjian Wang", "Junjie Gao" ], "year": 2026, "published_date": "2026-08-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.09590", "pdf_url": "https://arxiv.org/pdf/2608.09590", "citations": 0, "topics": [], "tags": [ "Multimodal", "Self-Supervised", "Evaluation", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.39, "read_first_score": 5.69, "content_potential_score": 0.0, "interestingness_score": 1.7, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Learning reliable correspondences between images and point clouds is fundamental for 2D-3D matching. Despite recent progress in detection-free methods, existing approaches primarily optimize matching within a single model and often struggle to maintain reliable correspondences under challenging conditions such as noisy inputs, low overlap, and ambiguous structures.", "key_contribution": "In this work, we propose TeaMatch, a novel framework that introduces teachability as a criterion for cross-modal representation learning.", "why_it_matters": "TeaMatch: Teachable Cross-Modal Representation Learning for 2D-3D Matching advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "In this work, we propose TeaMatch, a novel framework that introduces teachability as a criterion for cross-modal…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2608.09590", "difficulty": "beginner" }, { "id": "arxiv:2608.03722", "source": "arxiv", "source_type": "preprint", "title": "When Outputs Disperse, Does Epistemic Revision Follow? A Black-Box Diagnostic for Machine Collectives", "abstract": "Collective intelligence research treats disagreement as evidence of epistemic diversity: if agents express different views, the group should retain capacity to revise. In LLM collectives this proxy can break: agents can produce diverse-looking arguments while preserving the same conclusion. We operationalize dispersion-revision coupling: the degree to which an intervention that verifiably increases the dispersion of a collective's outputs in embedding space is accompanied by genuine revision of its epistemic stance rather than premise-preserving reformulation. The diagnostic is black-box: it operates on generated text alone and makes no claims about the internal representations of the generating models. Two channels are measured independently: an output channel, the Coherence Index (CI), verifies that the intervention changed output dispersion; an epistemic channel, per-turn stance annotation, measures whether the collective revised. We propose CI with the Meta-Predictive Clarity System (MPCS), which inserts a Re-Differentiation Protocol (RDP) when outputs over-converge, as a reusable method for estimating this coupling regime. We evaluate five-agent collectives from two configurations (gpt-4o-mini and gemini-2.5-flash; 310 paired episodes per condition). On gpt-4o-mini, conditional dissent improves false-premise recovery by +17.7 points (p<1e-6) while static persona diversity harms recovery (-8.1, p=.007). On gemini-2.5-flash, the same intervention at a comparable budget yields no gain (26.1% vs 27.1%, p=.84) despite a verified dispersion drop; the two treatment effects differ from each other (z=3.79, p<.001). Mechanism tagging shows Gemini preserves the false premise via intra-framework dissent: 94% of tagged post-RDP responses reformulate rather than concede (vs 24% on GPT). We recommend reporting per-intervention stance shift and premise-preservation rate alongside accuracy.", "authors": [ "Molood Arman" ], "year": 2026, "published_date": "2026-08-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.03722", "pdf_url": "https://arxiv.org/pdf/2608.03722", "citations": 0, "topics": [], "tags": [ "LLMs", "Artificial Intelligence", "NLP" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.39, "read_first_score": 6.73, "content_potential_score": 1.5, "interestingness_score": 2.45, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Collective intelligence research treats disagreement as evidence of epistemic diversity: if agents express different views, the group should retain capacity to revise. In LLM collectives this proxy can break: agents can produce diverse-looking arguments while preserving the same conclusion.", "key_contribution": "We propose CI with the Meta-Predictive Clarity System (MPCS), which inserts a Re-Differentiation Protocol (RDP) when outputs over-converge, as a reusable method for estimating this coupling regime.", "why_it_matters": "When Outputs Disperse, Does Epistemic Revision Follow? A Black-Box Diagnostic for Machine Collectives represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose CI with the Meta-Predictive Clarity System (MPCS), which inserts a Re-Differentiation Protocol (RDP) when…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.03722", "difficulty": "intermediate" }, { "id": "arxiv:2509.22310", "source": "arxiv", "source_type": "preprint", "title": "Adaptive Policy Backbone via Shared Network", "abstract": "Reinforcement learning (RL) has achieved impressive results across domains, yet learning an optimal policy typically requires extensive interaction data, limiting practical deployment. A common remedy is to leverage priors, such as pre-collected datasets or reference policies, but their utility degrades under task mismatch between training and deployment. While prior work has sought to address this mismatch, it has largely been restricted to in-distribution settings. To address this challenge, we propose Adaptive Policy Backbone (APB), a meta-transfer RL method that inserts lightweight linear layers before and after a shared backbone, thereby enabling parameter-efficient fine-tuning (PEFT) while preserving prior knowledge during adaptation. Our results show that APB improves sample efficiency over standard RL and adapts to out-of-distribution (OOD) tasks where existing meta-RL baselines typically fail.", "authors": [ "Bumgeun Park", "Donghwan Lee" ], "year": 2026, "published_date": "2026-07-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.22310", "pdf_url": "https://arxiv.org/pdf/2509.22310", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "RL", "Machine Learning", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.39, "read_first_score": 3.32, "content_potential_score": 1.55, "interestingness_score": 2.47, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reinforcement learning (RL) has achieved impressive results across domains, yet learning an optimal policy typically requires extensive interaction data, limiting practical deployment. A common remedy is to leverage priors, such as pre-collected datasets or reference policies, but their utility degrades under task mismatch between training and deployment.", "key_contribution": "To address this challenge, we propose Adaptive Policy Backbone (APB), a meta-transfer RL method that inserts lightweight linear layers before and after a shared backbone, thereby enabling parameter-efficient fine-tuning (PEFT) while preserving prior knowledge during adaptation.", "why_it_matters": "Adaptive Policy Backbone via Shared Network represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "To address this challenge, we propose Adaptive Policy Backbone (APB), a meta-transfer RL method that inserts…", "biggest_caveat": "but their utility degrades under task mismatch between training and deployment.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2509.22310", "difficulty": "advanced" }, { "id": "arxiv:2607.15516", "source": "arxiv", "source_type": "preprint", "title": "Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching", "abstract": "Production LLM deployments combine two cost-reduction primitives: prompt caching (a discounted rate for re-used token prefixes) and prompt compression (fewer tokens sent). The compression literature has standardized on query-aware methods that produce a different compressed prefix per query, mechanically invalidating the prefix-strict cache on every call. We characterize this cost empirically on Anthropic's Sonnet 4.6 API and find caching is far from the rho=1.0 ideal the literature assumes: Sonnet's cache has a two-tier architecture with a sharp threshold near 3,500 tokens, below which the hit rate plateaus at rho~0.83 across 30-call sessions. Our cost model predicts, and experiments confirm, that under realistic rho, query-aware compression beats naive caching at high compression ratios (r>=6). We propose Cache-Aware Prompt Compression (CAPC), pairing query-agnostic compression with explicit cache_control plus a tier-preserving ratio bound that prevents over-compression from pushing the cached prefix into the hot tier. CAPC is the cheapest strategy in 16/16 configurations on LongBench-v2, with mean savings of 49% over cache-only, 64% over query-aware compression, and 90% over vanilla, at quality within 0.05 of the uncompressed baseline. We validate CAPC on three production workloads: an enterprise tool-using assistant with a 94k-token schema prefix (51.7% cost reduction at r=3); a graphify knowledge-graph RAG pipeline across two codebases (9.3x vs cache-all on FastAPI, 2.4x on httpx); and the public tau-bench retail benchmark (50 tasks), where CAPC is the cheapest of four strategies with reward exactly equal to vanilla (both 36/50, p=1.00) while query-aware compression is the most expensive at +40.1% over vanilla -- the first production confirmation of the crossover model's negative-ROI prediction on a public benchmark.", "authors": [ "Yan Song" ], "year": 2026, "published_date": "2026-07-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.15516", "pdf_url": "https://arxiv.org/pdf/2607.15516", "citations": 0, "topics": [], "tags": [ "LLMs", "RAG", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.39, "read_first_score": 5.83, "content_potential_score": 1.5, "interestingness_score": 2.45, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Production LLM deployments combine two cost-reduction primitives: prompt caching (a discounted rate for re-used token prefixes) and prompt compression (fewer tokens sent). The compression literature has standardized on query-aware methods that produce a different compressed prefix per query, mechanically invalidating the prefix-strict cache on every call.", "key_contribution": "We propose Cache-Aware Prompt Compression (CAPC), pairing query-agnostic compression with explicit cache_control plus a tier-preserving ratio bound that prevents over-compression from pushing the cached prefix into the hot tier.", "why_it_matters": "Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose Cache-Aware Prompt Compression (CAPC), pairing query-agnostic compression with explicit cache_control plus a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.15516", "difficulty": "beginner" }, { "id": "arxiv:2605.09928", "source": "arxiv", "source_type": "preprint", "title": "OpenZL: Using Graphs to Compress Smaller and Faster", "abstract": "In the last few decades, research techniques have improved lossless compression ratios by significantly increasing processing time. However, these techniques have not gained popularity in industry because production systems require high throughput and low resource utilization. Instead, real world improvements in compression are increasingly realized by building application-specific compressors which can exploit knowledge about the structure and semantics of the data being compressed. Application-specific compressor systems outperform even the best generic compressors, but these techniques have severe drawbacks -- they are inherently limited in applicability, are hard to develop, and are difficult to maintain and deploy. In this work, we show that these challenges can be overcome with a new compression strategy. We propose the \"graph model\" of compression, a new theoretical framework for representing compression as a directed acyclic graph of modular codecs. OpenZL implements this framework and compresses data into a self-describing wire format, any configuration of which can be decompressed by a universal decoder. OpenZL's design enables rapid development of application-specific compressors with minimal code. Experimental results demonstrate that OpenZL achieves superior compression ratios and speeds compared to state-of-the-art general-purpose compressors on a variety of real-world datasets. Compared to ratio-focused deep-learning compressors, OpenZL is competitive on ratio while being many orders of magnitude faster. Internal deployments at Meta have also shown consistent improvements in size and/or speed, with development timelines reduced from months to days. OpenZL thus represents a significant advance in practical, scalable, and maintainable data compression for modern data-intensive applications.", "authors": [ "Yann Collet", "Nick Terrell", "W. Felix Handte", "Danielle Rozenblit", "Victor Zhang", "Kevin Zhang", "Yaelle Goldschlag", "Jennifer Lee", "Elliot Gorokhovsky", "Yonatan Komornik", "Daniel Riegel", "Stan Angelov", "Nadav Rotem" ], "year": 2026, "published_date": "2026-05-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.09928", "pdf_url": "https://arxiv.org/pdf/2605.09928", "citations": 0, "topics": [], "tags": [ "Information Retrieval", "Databases" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.39, "read_first_score": 5.78, "content_potential_score": 1.55, "interestingness_score": 2.47, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In the last few decades, research techniques have improved lossless compression ratios by significantly increasing processing time. However, these techniques have not gained popularity in industry because production systems require high throughput and low resource utilization.", "key_contribution": "Application-specific compressor systems outperform even the best generic compressors, but these techniques have severe drawbacks -- they are inherently limited in applicability, are hard to develop, and are difficult to maintain and deploy.", "why_it_matters": "OpenZL: Using Graphs to Compress Smaller and Faster improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about Information Retrieval.", "one_line_takeaway": "Application-specific compressor systems outperform even the best generic compressors, but these techniques have severe…", "biggest_caveat": "However, these techniques have not gained popularity in industry because production systems require high throughput and low resource utilization.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Information Retrieval.", "url": "https://arxiv.org/abs/2605.09928", "difficulty": "intermediate" }, { "id": "arxiv:2605.14212", "source": "arxiv", "source_type": "preprint", "title": "MetaAgent-X : Breaking the Ceiling of Automatic Multi-Agent Systems via End-to-End Reinforcement Learning", "abstract": "Automatic multi-agent systems aim to instantiate agent workflows without relying on manually designed or fixed orchestration. However, existing automatic MAS approaches remain only partially adaptive: they either perform training-free test-time search or optimize the meta-level designer while keeping downstream execution agents frozen, which creating a frozen-executor ceiling and leaving the end-to-end training of self-designing and self-executing agentic models unexplored. To address this, we introduce MetaAgent-X, an end-to-end reinforcement learning framework that jointly optimizes automatic MAS design and execution. MetaAgent-X enables script-based MAS generation, execution rollout collection, and credit assignment for both designer and executor trajectories. To support stable and scalable optimization, we propose Executor Designer Hierarchical Rollout and Stagewise Co-evolution to improve training stability and expose the dynamics of designer-executor co-evolution. MetaAgent-X consistently outperforms existing automatic MAS baselines, achieving up to 21.7% gains. Comprehensive ablations show that both designer and executor improve throughout training, and that effective automatic MAS learning follows a stagewise co-evolution process. These results establish end-to-end trainable automatic MAS as a practical paradigm for building self-designing and self-executing agentic models.", "authors": [ "Yaolun Zhang", "Yujie Zhao", "Nan Wang", "Yiran Wu", "Jiayu Chang", "Yizhao Chen", "Qingyun Wu", "Jishen Zhao", "Huazheng Wang" ], "year": 2026, "published_date": "2026-05-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.14212", "pdf_url": "https://arxiv.org/pdf/2605.14212", "citations": 0, "topics": [], "tags": [ "AI Agents", "Info Extraction", "RL", "Artificial Intelligence" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.39, "read_first_score": 4.96, "content_potential_score": 1.5, "interestingness_score": 2.45, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Automatic multi-agent systems aim to instantiate agent workflows without relying on manually designed or fixed orchestration. However, existing automatic MAS approaches remain only partially adaptive: they either perform training-free test-time search or optimize the meta-level designer while keeping downstream execution agents frozen, which creating a frozen-executor ceiling and leaving the end-to-end training of self-designing and self-executing agentic models unexplored.", "key_contribution": "To address this, we introduce MetaAgent-X, an end-to-end reinforcement learning framework that jointly optimizes automatic MAS design and execution.", "why_it_matters": "MetaAgent-X : Breaking the Ceiling of Automatic Multi-Agent Systems via End-to-End Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "To address this, we introduce MetaAgent-X, an end-to-end reinforcement learning framework that jointly optimizes…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2605.14212", "difficulty": "advanced" }, { "id": "arxiv:2604.17476v1", "source": "arxiv", "source_type": "preprint", "title": "Privatar: Scalable Privacy-preserving Multi-user VR via Secure Offloading", "abstract": "Multi-user virtual reality enables immersive interaction. However, rendering avatars for numerous participants on each headset incurs prohibitive computational overhead, limiting scalability. We introduce a framework, Privatar, to offload avatar reconstruction from headset to untrusted devices within the same local network while safeguarding attacks against adversaries capable of intercepting offloaded data. Privatar's key insight is that domain-specific knowledge of avatar reconstruction enables provably private offloading at minimal cost. (1) System level. We observe avatar reconstruction is frequency-domain decomposable via BDCT with negligible quality drop, and propose Horizontal Partitioning (HP) to keep high-energy frequency components on-device and offloads only low-energy components. HP offloads local computation while reducing information leakage to low-energy subsets only. (2) Privacy level. For individually offloaded, multi-dimensional signals without aggregation, worst-case local Differential Privacy requires prohibitive noise, ruining utility. We observe users' expression statistical distribution are slowly changing over time and trackable online, and hence propose Distribution-Aware Minimal Perturbation. DAMP minimizes noise based on each user's expression distribution to significantly reduce its effects on utility, retaining formal privacy guarantee. Combined, HP provides empirical privacy against expression identification attacks. DAMP further augments it to offer a formal guarantee against arbitrary adversaries. On a Meta Quest Pro, Privatar supports 2.37x more concurrent users at 6.5% higher reconstruction loss and 9% energy overhead, providing a better throughout-loss Pareto frontier over quantization, sparsity and local construction baselines. Privatar provides both provable privacy guarantee and stays robust against both empirical and NN-based attacks.", "authors": [ "Jianming Tong", "Hanshen Xiao", "Krishna Kumar Nair", "Hao Kang", "Ashish Sirasao", "Ziqi Zhang", "G. Edward Suh", "Tushar Krishna" ], "year": 2026, "published_date": "2026-04-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.17476v1", "pdf_url": "https://arxiv.org/pdf/2604.17476v1", "citations": 0, "topics": [], "tags": [ "Model Compression", "Federated Learning", "Computer Vision", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.39, "read_first_score": 4.12, "content_potential_score": 1.84, "interestingness_score": 2.62, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multi-user virtual reality enables immersive interaction. However, rendering avatars for numerous participants on each headset incurs prohibitive computational overhead, limiting scalability.", "key_contribution": "We introduce a framework, Privatar, to offload avatar reconstruction from headset to untrusted devices within the same local network while safeguarding attacks against adversaries capable of intercepting offloaded data.", "why_it_matters": "Privatar: Scalable Privacy-preserving Multi-user VR via Secure Offloading advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Model Compression.", "one_line_takeaway": "We introduce a framework, Privatar, to offload avatar reconstruction from headset to untrusted devices within the same…", "biggest_caveat": "However, rendering avatars for numerous participants on each headset incurs prohibitive computational overhead, limiting scalability.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Model Compression.", "url": "http://arxiv.org/abs/2604.17476v1", "difficulty": "advanced" }, { "id": "arxiv:2605.14381", "source": "arxiv", "source_type": "preprint", "title": "NodeSynth: Socially Aligned Synthetic Data for AI Evaluation", "abstract": "Recent advancements in generative AI facilitate large-scale synthetic data generation for model evaluation. However, without targeted approaches, these datasets often lack the sociotechnical nuance required for sensitive domains. We introduce NodeSynth, an evidence-grounded methodology that generates socially relevant synthetic queries by leveraging a fine-tuned taxonomy generator (TaG) anchored in real-world evidence. Evaluated against four mainstream LLMs (e.g., Claude 4.5 Haiku), NodeSynth elicited failure rates up to five times higher than human-authored benchmarks. Ablation studies confirm that our granular taxonomic expansion significantly drives these failure rates, while independent validation reveals critical deficiencies in prominent guard models (e.g., Llama-Guard-3). We open-source our end-to-end research prototype and datasets to enable scalable, high-stakes model evaluation and targeted safety interventions (https://github.com/google-research/nodesynth).", "authors": [ "Qazi Mamunur Rashid", "Xuan Yang", "Zhengzhe Yang", "Yanzhou Pan", "Erin van Liemt", "Darlene Neal", "Kshitij Pancholi", "Jamila Smith-Loud" ], "year": 2026, "published_date": "2026-05-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.14381", "pdf_url": "https://arxiv.org/pdf/2605.14381", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Evaluation", "Machine Learning", "NLP" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.39, "read_first_score": 4.42, "content_potential_score": 1.0, "interestingness_score": 2.2, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent advancements in generative AI facilitate large-scale synthetic data generation for model evaluation. However, without targeted approaches, these datasets often lack the sociotechnical nuance required for sensitive domains.", "key_contribution": "We introduce NodeSynth, an evidence-grounded methodology that generates socially relevant synthetic queries by leveraging a fine-tuned taxonomy generator (TaG) anchored in real-world evidence.", "why_it_matters": "NodeSynth: Socially Aligned Synthetic Data for AI Evaluation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We introduce NodeSynth, an evidence-grounded methodology that generates socially relevant synthetic queries by…", "biggest_caveat": "However, without targeted approaches, these datasets often lack the sociotechnical nuance required for sensitive domains.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2605.14381", "difficulty": "beginner" }, { "id": "arxiv:2606.00838", "source": "arxiv", "source_type": "preprint", "title": "Decoupled Behavioral Cloning for Scalable Inductive Generalization in RL from Specifications", "abstract": "Inductive generalization is a framework for reinforcement learning (RL) generalization in which inductively related task instances admit inductively related policies. Prior work captures this structure via a higher-order policy-evolution function learned directly with RL, but suffers from poor training scalability: as training tasks grow, aggregated reward feedback becomes noisy and conflicting, destabilizing training and weakening generalization. We propose DIBS, a decoupled behavioral cloning approach that separates learning task-specific policies from learning the evolution function. We first learn individual teacher policies per task via standard RL, then fit the evolution function via behavioral cloning on teacher-labeled state-action pairs. This replaces noisy reward aggregation with dense, stable supervision. DIBS achieves significant improvements in both training stability and zero-shot generalization against existing RL and meta-RL algorithms.", "authors": [ "Vignesh Subramanian", "Subhajit Roy", "Suguman Bansal" ], "year": 2026, "published_date": "2026-05-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.00838", "pdf_url": "https://arxiv.org/pdf/2606.00838", "citations": 0, "topics": [], "tags": [ "RL", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.38, "read_first_score": 3.32, "content_potential_score": 1.0, "interestingness_score": 2.19, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Inductive generalization is a framework for reinforcement learning (RL) generalization in which inductively related task instances admit inductively related policies. Prior work captures this structure via a higher-order policy-evolution function learned directly with RL, but suffers from poor training scalability: as training tasks grow, aggregated reward feedback becomes noisy and conflicting, destabilizing training and weakening generalization.", "key_contribution": "We propose DIBS, a decoupled behavioral cloning approach that separates learning task-specific policies from learning the evolution function.", "why_it_matters": "Decoupled Behavioral Cloning for Scalable Inductive Generalization in RL from Specifications represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "We propose DIBS, a decoupled behavioral cloning approach that separates learning task-specific policies from learning…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2606.00838", "difficulty": "advanced" }, { "id": "arxiv:2605.25140", "source": "arxiv", "source_type": "preprint", "title": "Eliminating Blind Spots from Wireless Network by Metasurface: A Blind Approach", "abstract": "Deploying metasurfaces (MTSs) to eliminate wireless blind spots requires jointly determining the physical placement of MTSs and the meta-atom phase shifts. Existing methods typically rely on explicit channel estimation, which incurs prohibitive overhead and is often intractable in real-world networks. To sidestep this bottleneck, we propose RFZero, a channel-state-information (CSI)-free deployment paradigm. Instead of estimating channels, RFZero extracts macro-environmental features from visual photos to guide MTS placement, and leverages reference signal received power (RSRP) feedback for dynamic phase-shift optimization. Most importantly, RFZero operates independently of base stations, thereby enabling seamless plug-and-play implementation. Real-world field tests confirm that RFZero completely eliminates all blind spots in a $100\\text{ m}^2$ indoor area using just a pair of $1.5\\text{ m}\\times 0.9\\text{ m}$ MTSs.", "authors": [ "Wenhai Lai", "Mingxiao Li", "Kaiming Shen", "Liyao Xiang", "Zhi-Quan Luo" ], "year": 2026, "published_date": "2026-05-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.25140", "pdf_url": "https://arxiv.org/pdf/2605.25140", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.38, "read_first_score": 3.86, "content_potential_score": 1.42, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deploying metasurfaces (MTSs) to eliminate wireless blind spots requires jointly determining the physical placement of MTSs and the meta-atom phase shifts. Existing methods typically rely on explicit channel estimation, which incurs prohibitive overhead and is often intractable in real-world networks.", "key_contribution": "To sidestep this bottleneck, we propose RFZero, a channel-state-information (CSI)-free deployment paradigm.", "why_it_matters": "Eliminating Blind Spots from Wireless Network by Metasurface: A Blind Approach represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "To sidestep this bottleneck, we propose RFZero, a channel-state-information (CSI)-free deployment paradigm.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2605.25140", "difficulty": "intermediate" }, { "id": "arxiv:2608.06587", "source": "arxiv", "source_type": "preprint", "title": "SyncSBC: Decentralized Swarm Behavior Prediction for Synchronized Autonomous Control", "abstract": "Robot swarms utilize many independent limited-sensing agents to produce complex emergent behaviors without requiring centralized control. However, little research explores how agents can infer swarm-level behavior from purely local perception, a capability critical for detecting faults and behavior changes. In this paper, we introduce Synchronized Swarm Behavior Classification (SyncSBC), which combines improvements in machine learning and distributed consensus to classify collective swarm behavior and synchronize swarm decision-making in an entirely decentralized manner. We show that SyncSBC achieves high classification accuracy and low synchronization delay, making it suitable for real-world deployment. Finally, we use SyncSBC to demonstrate two promising swarm applications on real robots where we show that swarms utilizing SyncSBC can accurately identify anomalies in robot behavior and autonomously coordinate collective changes in swarm behavior. Videos, code and supplemental experiments are available at https://sites.google.com/view/sync-sbc/home.", "authors": [ "Varun Raveendra", "Connor Mattson", "Daniel S. Brown" ], "year": 2026, "published_date": "2026-08-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.06587", "pdf_url": "https://arxiv.org/pdf/2608.06587", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Robotics", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.37, "read_first_score": 5.24, "content_potential_score": 1.84, "interestingness_score": 2.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Robot swarms utilize many independent limited-sensing agents to produce complex emergent behaviors without requiring centralized control. However, little research explores how agents can infer swarm-level behavior from purely local perception, a capability critical for detecting faults and behavior changes.", "key_contribution": "In this paper, we introduce Synchronized Swarm Behavior Classification (SyncSBC), which combines improvements in machine learning and distributed consensus to classify collective swarm behavior and synchronize swarm decision-making in an entirely decentralized manner.", "why_it_matters": "SyncSBC: Decentralized Swarm Behavior Prediction for Synchronized Autonomous Control represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "In this paper, we introduce Synchronized Swarm Behavior Classification (SyncSBC), which combines improvements in…", "biggest_caveat": "buted consensus to classify collective swarm behavior and synchronize swarm decision-making in an entirely decentralized manner.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2608.06587", "difficulty": "intermediate" }, { "id": "arxiv:2603.15600", "source": "arxiv", "source_type": "preprint", "title": "From Passive Observer to Active Critic: Reinforcement Learning Elicits Process Reasoning for Robotic Manipulation", "abstract": "Accurate process supervision remains a critical challenge for long-horizon robotic manipulation. A primary bottleneck is that current video MLLMs, trained primarily under a Supervised Fine-Tuning (SFT) paradigm, function as passive \"Observers\" that recognize ongoing events rather than evaluating the current state relative to the final task goal. In this paper, we introduce PRIMO R1 (Process Reasoning Induced Monitoring), a 7B framework that transforms video MLLMs into active \"Critics\". We leverage outcome-based Reinforcement Learning to incentivize explicit Chain-of-Thought generation for progress estimation. Furthermore, our architecture constructs a structured temporal input by explicitly anchoring the video sequence between initial and current state images. Supported by the proposed PRIMO Dataset and Benchmark, extensive experiments across diverse in-domain environments and out-of-domain real-world humanoid scenarios demonstrate that PRIMO R1 achieves state-of-the-art performance. Quantitatively, our 7B model achieves a 50% reduction in the mean absolute error of specialized reasoning baselines, demonstrating significant relative accuracy improvements over 72B-scale general MLLMs. Furthermore, PRIMO R1 exhibits strong zero-shot generalization on difficult failure detection tasks. We establish state-of-the-art performance on RoboFail benchmark with 67.0% accuracy, surpassing closed-source models like OpenAI o1 by 6.0%.", "authors": [ "Yibin Liu", "Yaxing Lyu", "Daqi Gao", "Zhixuan Liang", "Weiliang Tang", "Shilong Mu", "Xiaokang Yang", "Yao Mu" ], "year": 2026, "published_date": "2026-07-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.15600", "pdf_url": "https://arxiv.org/pdf/2603.15600", "citations": 0, "topics": [], "tags": [ "Reasoning", "Fine-Tuning", "RL", "Robotics", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.37, "read_first_score": 6.21, "content_potential_score": 1.5, "interestingness_score": 2.44, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Accurate process supervision remains a critical challenge for long-horizon robotic manipulation. A primary bottleneck is that current video MLLMs, trained primarily under a Supervised Fine-Tuning (SFT) paradigm, function as passive \"Observers\" that recognize ongoing events rather than evaluating the current state relative to the final task goal.", "key_contribution": "In this paper, we introduce PRIMO R1 (Process Reasoning Induced Monitoring), a 7B framework that transforms video MLLMs into active \"Critics\".", "why_it_matters": "From Passive Observer to Active Critic: Reinforcement Learning Elicits Process Reasoning for Robotic Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "In this paper, we introduce PRIMO R1 (Process Reasoning Induced Monitoring), a 7B framework that transforms video MLLMs…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2603.15600", "difficulty": "beginner" }, { "id": "arxiv:2606.30926", "source": "arxiv", "source_type": "preprint", "title": "SpikON: A Dual-Parallel and Efficient Accelerator for Online Spiking Neural Networks Learning", "abstract": "Spiking neural networks (SNNs) have emerged as a promising paradigm for energy-efficient brain-inspired computing. However, existing online unsupervised SNN learning suffers from low training accuracy and poor scalability. Although current online supervised learning algorithms perform well on large-scale datasets and networks, the non-hardware-friendly operations hinder efficient edge deployment. In this work, we propose SpikON, the first algorithm-hardware co-design framework for efficient and scalable end-to-end online supervised SNN learning. We first propose the learnable threshold through time and scaled weight centralization through time techniques to address the inefficiency of traditional algorithms. Moreover, to reduce latency and energy consumption, we introduce the novel training dataflow and cascade computation reuse scheme for SNNs that allows concurrent forward-backward computation and temporal reuse across timesteps. We further design the dedicated SNN accelerator with a dual-parallel engine and customized SIMD-based SNN core for efficient end-to-end online learning. Experiments show that the SpikON algorithm achieves 32.2% and 35.0% reductions in training latency and energy consumption over the baseline, without sacrificing accuracy. Moreover, the SpikON co-design achieves 7.2x (11.5x) and 26.8x (15.8x) training throughput (energy efficiency) compared with the edge Apple M4 GPU and TPU-like accelerator, respectively. The code is available at https://github.com/peilin-chen/SpikON.", "authors": [ "Peilin Chen", "Xiaoxuan Yang" ], "year": 2026, "published_date": "2026-06-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.30926", "pdf_url": "https://arxiv.org/pdf/2606.30926", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.37, "read_first_score": 5.55, "content_potential_score": 1.84, "interestingness_score": 2.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Spiking neural networks (SNNs) have emerged as a promising paradigm for energy-efficient brain-inspired computing. However, existing online unsupervised SNN learning suffers from low training accuracy and poor scalability.", "key_contribution": "In this work, we propose SpikON, the first algorithm-hardware co-design framework for efficient and scalable end-to-end online supervised SNN learning.", "why_it_matters": "SpikON: A Dual-Parallel and Efficient Accelerator for Online Spiking Neural Networks Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "In this work, we propose SpikON, the first algorithm-hardware co-design framework for efficient and scalable end-to-end…", "biggest_caveat": "However, existing online unsupervised SNN learning suffers from low training accuracy and poor scalability.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2606.30926", "difficulty": "intermediate" }, { "id": "arxiv:2604.06019v1", "source": "arxiv", "source_type": "preprint", "title": "CritBench: A Framework for Evaluating Cybersecurity Capabilities of Large Language Models in IEC 61850 Digital Substation Environments", "abstract": "The advancement of Large Language Models (LLMs) has raised concerns regarding their dual-use potential in cybersecurity. Existing evaluation frameworks overwhelmingly focus on Information Technology (IT) environments, failing to capture the constraints, and specialized protocols of Operational Technology (OT). To address this gap, we introduce CritBench, a novel framework designed to evaluate the cybersecurity capabilities of LLM agents within IEC 61850 Digital Substation environments. We assess five state-of-the-art models, including OpenAI's GPT-5 suite and open-weight models, across a corpus of 81 domain-specific tasks spanning static configuration analysis, network traffic reconnaissance, and live virtual machine interaction. To facilitate industrial protocol interaction, we develop a domain-specific tool scaffold. Our empirical results show that agents reliably execute static structured-file analysis and single-tool network enumeration, but their performance degrades on dynamic tasks. Despite demonstrating explicit, internalized knowledge of the IEC 61850 standards terminology, current models struggle with the persistent sequential reasoning and state tracking required to manipulate live systems without specialized tools. Equipping agents with our domain-specific tool scaffold significantly mitigates this operational bottleneck. Code and evaluation scripts are available at: https://github.com/GKeppler/CritBench", "authors": [ "Gustav Keppler", "Moritz Gstür", "Veit Hagenmeyer" ], "year": 2026, "published_date": "2026-04-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.06019v1", "pdf_url": "https://arxiv.org/pdf/2604.06019v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Evaluation", "Reasoning & Chain-of-Thought", "Benchmarking & Evaluation" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.37, "read_first_score": 6.01, "content_potential_score": 1.5, "interestingness_score": 2.44, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The advancement of Large Language Models (LLMs) has raised concerns regarding their dual-use potential in cybersecurity. Existing evaluation frameworks overwhelmingly focus on Information Technology (IT) environments, failing to capture the constraints, and specialized protocols of Operational Technology (OT).", "key_contribution": "To address this gap, we introduce CritBench, a novel framework designed to evaluate the cybersecurity capabilities of LLM agents within IEC 61850 Digital Substation environments.", "why_it_matters": "CritBench: A Framework for Evaluating Cybersecurity Capabilities of Large Language Models in IEC 61850 Digital Substation Environments represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this gap, we introduce CritBench, a novel framework designed to evaluate the cybersecurity capabilities of…", "biggest_caveat": "but their performance degrades on dynamic tasks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.06019v1", "difficulty": "beginner" }, { "id": "arxiv:2605.20584", "source": "arxiv", "source_type": "preprint", "title": "QwenSafe: Multimodal Content Rating Description Identification via Preference-Aligned VLMs", "abstract": "Mobile app marketplaces require developers to disclose standardized content rating descriptors (CRDs) to inform users about potentially sensitive or restricted content. Ensuring the accuracy and consistency of these disclosures remains challenging due to the multimodal nature of app content, which spans textual descriptions and visual interfaces. In this paper, we present QwenSafe, a Vision-Language Model (VLM) designed to automatically identify the presence of Apple-defined CRDs by jointly reasoning over app metadata and screenshots. To enable scalable training for this task, we introduce metadata2CRD, a data-construction pipeline that synthesizes descriptor-aligned question-answer pairs by combining app descriptions, screenshots, and formal descriptor definitions. We adapt Qwen3-VL-8B using supervised fine-tuning followed by Direct Preference Optimization (DPO) to align model predictions with descriptor-specific evidence and explanations across visual and textual modalities. We evaluate QwenSafe on 12 Apple-defined content rating descriptors and compare it against state-of-the-art vision-language models, including Qwen3-VL, LLaVA-1.6, and Gemini-2.5-Flash. QwenSafe consistently outperforms all baselines in binary CRD classification, achieving improvements in positive-class recall of 111.8%, 36.1%, and 2.1%, respectively. Our results demonstrate that descriptor-aware multimodal alignment substantially improves automated content classification and highlights the potential of vision-language models to support scalable and consistent content rating in mobile app marketplaces.", "authors": [ "Dishanika Denipitiyage", "Aruna Seneviratne", "Suranga Seneviratne" ], "year": 2026, "published_date": "2026-05-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.20584", "pdf_url": "https://arxiv.org/pdf/2605.20584", "citations": 0, "topics": [], "tags": [ "Reasoning", "RLHF", "Fine-Tuning", "AI Safety", "VLMs" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.37, "read_first_score": 4.96, "content_potential_score": 1.0, "interestingness_score": 2.19, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Mobile app marketplaces require developers to disclose standardized content rating descriptors (CRDs) to inform users about potentially sensitive or restricted content. Ensuring the accuracy and consistency of these disclosures remains challenging due to the multimodal nature of app content, which spans textual descriptions and visual interfaces.", "key_contribution": "In this paper, we present QwenSafe, a Vision-Language Model (VLM) designed to automatically identify the presence of Apple-defined CRDs by jointly reasoning over app metadata and screenshots.", "why_it_matters": "QwenSafe: Multimodal Content Rating Description Identification via Preference-Aligned VLMs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "In this paper, we present QwenSafe, a Vision-Language Model (VLM) designed to automatically identify the presence of…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.20584", "difficulty": "advanced" }, { "id": "arxiv:2603.02709", "source": "arxiv", "source_type": "preprint", "title": "Sensory-Aware Sequential Recommendation via Review-Distilled Representations", "abstract": "We propose a novel framework for sensory-aware sequential recommendation that enriches item representations with linguistically extracted sensory attributes from product reviews. Our approach, ASER (Attribute-based Sensory-Enhanced Representation), introduces an offline extraction-and-distillation pipeline in which a large language model is first fine-tuned as a teacher to extract structured sensory attribute-value pairs, such as color: matte black and scent: vanilla, from unstructured review text. The extracted structures are then distilled into a compact student transformer that produces fixed-dimensional sensory embeddings for each item. These embeddings encode experiential semantics in a reusable form and are incorporated into standard sequential recommender architectures as additional item-level representations. We evaluate our method on five Amazon domains and integrate the learned sensory embeddings into SASRec, BERT4Rec, BSARec, and DIFF. Across 20 domain-backbone combinations, sensory-enhanced models improve over matched non-sensory counterparts in 19 cases for both HR@10 and NDCG@10, with average relative gains of 7.9% in HR@10 and 11.2% in NDCG@10. Qualitative analysis further shows that the extracted attributes align closely with human perceptions of products, enabling interpretable connections between natural language descriptions and recommendation behavior. Overall, this work demonstrates that sensory attribute distillation offers a principled and scalable way to bridge information extraction and sequential recommendation through structured semantic representation learning.", "authors": [ "Yeo Chan Yoon", "Chanjun Park", "Kyuhan Koh" ], "year": 2026, "published_date": "2026-04-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.02709", "pdf_url": "https://arxiv.org/pdf/2603.02709", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "Info Extraction", "Self-Supervised", "Interpretability" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.37, "read_first_score": 6.1, "content_potential_score": 1.42, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We propose a novel framework for sensory-aware sequential recommendation that enriches item representations with linguistically extracted sensory attributes from product reviews. Our approach, ASER (Attribute-based Sensory-Enhanced Representation), introduces an offline extraction-and-distillation pipeline in which a large language model is first fine-tuned as a teacher to extract structured sensory attribute-value pairs, such as color: matte black and scent: vanilla, from unstructured review text.", "key_contribution": "We propose a novel framework for sensory-aware sequential recommendation that enriches item representations with linguistically extracted sensory attributes from product reviews.", "why_it_matters": "Sensory-Aware Sequential Recommendation via Review-Distilled Representations represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose a novel framework for sensory-aware sequential recommendation that enriches item representations with…", "biggest_caveat": "butes from product reviews.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2603.02709", "difficulty": "intermediate" }, { "id": "arxiv:2608.23473", "source": "arxiv", "source_type": "preprint", "title": "MetaCaster: Meta-Harness-Optimized Agent for End-to-End Few-Shot Learning of Lightweight Time Series Forecasters", "abstract": "Time series forecasting (TSF) is evolving toward multimodal and agentic settings, yet using foundation models remains uneconomical in resource-constrained scenarios, where compact, specialized forecasters are more desirable. However, lightweight forecasters typically require substantial training data, limiting their use in domains with scarce, slowly accumulated, or privacy-sensitive time series. To address this dilemma, we investigate the challenging problem of few-shot learning for lightweight forecasters. We propose MetaCaster, a meta-harness-optimized multi-agent framework that uses agentic data generation to automatically train specialized lightweight forecasters from only a few examples and textual contexts. Our work highlights a new TSF paradigm in which agents act not as forecasters but as intermediary engineers that prepare efficient, task-specific forecasters for deployment. Experiments on 18 datasets, 23 state-of-the-art lightweight forecasters, and 14 baselines demonstrate that MetaCaster achieves both data efficiency and computational efficiency while maintaining high-quality TSF performance.", "authors": [ "ChengAo Shen", "Wenchao Yu", "Fangyu Wu", "Dongjin Song", "Hanghang Tong", "Dongsheng Luo", "Wei Cheng", "Haifeng Chen", "Jingchao Ni" ], "year": 2026, "published_date": "2026-08-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.23473", "pdf_url": "https://arxiv.org/pdf/2608.23473", "citations": 0, "topics": [], "tags": [ "Prompting", "AI Agents", "Multimodal", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.36, "read_first_score": 4.74, "content_potential_score": 1.0, "interestingness_score": 2.18, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Time series forecasting (TSF) is evolving toward multimodal and agentic settings, yet using foundation models remains uneconomical in resource-constrained scenarios, where compact, specialized forecasters are more desirable. However, lightweight forecasters typically require substantial training data, limiting their use in domains with scarce, slowly accumulated, or privacy-sensitive time series.", "key_contribution": "We propose MetaCaster, a meta-harness-optimized multi-agent framework that uses agentic data generation to automatically train specialized lightweight forecasters from only a few examples and textual contexts.", "why_it_matters": "MetaCaster: Meta-Harness-Optimized Agent for End-to-End Few-Shot Learning of Lightweight Time Series Forecasters represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We propose MetaCaster, a meta-harness-optimized multi-agent framework that uses agentic data generation to…", "biggest_caveat": "but as intermediary engineers that prepare efficient, task-specific forecasters for deployment.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2608.23473", "difficulty": "beginner" }, { "id": "arxiv:2603.21840", "source": "arxiv", "source_type": "preprint", "title": "Select, Label, Evaluate: Active Testing in NLP", "abstract": "Human annotation cost and time remain significant bottlenecks in Natural Language Processing (NLP), with test data annotation being particularly expensive due to the stringent requirement for low-error and high-quality labels necessary for reliable model evaluation. Traditional approaches require annotating entire test sets, leading to substantial resource requirements. Active Testing is a framework that selects the most informative test samples for annotation. Given a labeling budget, it aims to choose the subset that best estimates model performance while minimizing cost and human effort. In this work, we formalize Active Testing in NLP and we conduct an extensive benchmarking of existing approaches across 18 datasets and 4 embedding strategies spanning 4 different NLP tasks. The experiments show annotation reductions of up to 95%, with performance estimation accuracy difference from the full test set within 1%. Our analysis reveals variations in method effectiveness across different data characteristics and task types, with no single approach emerging as universally superior. Lastly, to address the limitation of requiring a predefined annotation budget in existing sample selection strategies, we introduce an adaptive stopping criterion that automatically determines the optimal number of samples. We release our code at https://github.com/amazon-science/NLPActiveTesting.", "authors": [ "Antonio Purificato", "Maria Sofia Bucarelli", "Andrea Bacciu", "Fabrizio Silvestri", "Amin Mantrach" ], "year": 2026, "published_date": "2026-08-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.21840", "pdf_url": "https://arxiv.org/pdf/2603.21840", "citations": 0, "topics": [], "tags": [ "Evaluation", "Artificial Intelligence", "NLP" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.36, "read_first_score": 6.26, "content_potential_score": 1.5, "interestingness_score": 2.43, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Human annotation cost and time remain significant bottlenecks in Natural Language Processing (NLP), with test data annotation being particularly expensive due to the stringent requirement for low-error and high-quality labels necessary for reliable model evaluation. Traditional approaches require annotating entire test sets, leading to substantial resource requirements.", "key_contribution": "The experiments show annotation reductions of up to 95%, with performance estimation accuracy difference from the full test set within 1%.", "why_it_matters": "Select, Label, Evaluate: Active Testing in NLP represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "The experiments show annotation reductions of up to 95%, with performance estimation accuracy difference from the full…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2603.21840", "difficulty": "beginner" }, { "id": "arxiv:2607.28849", "source": "arxiv", "source_type": "preprint", "title": "Hypergradient-based Bilevel Reinforcement Learning with Improved Sample Complexity", "abstract": "Bilevel reinforcement learning (RL) is an important framework within the literature of RL that can be used to formalize various categories of problems, such as meta-learning, hierarchical task decomposition, and reinforcement learning from human feedback (RL-HF). Most of the bilevel RL algorithms are either not scalable because of using hypergradient with Hessian, or they suffer from high sample complexity because of using penalty-based approximation methods. In this work, we propose a hypergradient-based bilevel RL algorithm using the optimality of the Boltzmann policy for the entropy regularized discounted RL objective function. Our proposed algorithm is Hessian-free and obtains an iteration complexity of $O(ε^{-1})$ and state-of-the-art sample complexity of $\\tilde{O}(ε^{-2})$ under mild regularity conditions. Further, in our convergence analysis, we are able to remove the assumption of the Polyak-Lojasiewicz (PL) condition on the outer-level objective function present in the prior state-of-the-art sample complexity work.", "authors": [ "Naman Saxena", "Mudit Gaur", "Vaneet Aggarwal" ], "year": 2026, "published_date": "2026-07-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.28849", "pdf_url": "https://arxiv.org/pdf/2607.28849", "citations": 0, "topics": [], "tags": [ "RLHF", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.36, "read_first_score": 4.24, "content_potential_score": 1.0, "interestingness_score": 2.18, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Bilevel reinforcement learning (RL) is an important framework within the literature of RL that can be used to formalize various categories of problems, such as meta-learning, hierarchical task decomposition, and reinforcement learning from human feedback (RL-HF). Most of the bilevel RL algorithms are either not scalable because of using hypergradient with Hessian, or they suffer from high sample complexity because of using penalty-based approximation methods.", "key_contribution": "In this work, we propose a hypergradient-based bilevel RL algorithm using the optimality of the Boltzmann policy for the entropy regularized discounted RL objective function.", "why_it_matters": "Hypergradient-based Bilevel Reinforcement Learning with Improved Sample Complexity represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RLHF.", "one_line_takeaway": "In this work, we propose a hypergradient-based bilevel RL algorithm using the optimality of the Boltzmann policy for…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RLHF.", "url": "https://arxiv.org/abs/2607.28849", "difficulty": "advanced" }, { "id": "arxiv:2511.17902", "source": "arxiv", "source_type": "preprint", "title": "Statistically-Guided Meta-Learning for Cross-Deployment Activity Recognition in Distributed Fiber-Optic Sensing", "abstract": "Distributed Fiber Optic Sensing (DFOS) is promising for long-range perimeter security, yet practical deployment faces three key obstacles: severe cross-deployment domain shift, scarce or unavailable labels at new sites, and limited within-class coverage even in source deployments. We propose DUPLE, a prototype-based meta-learning framework tailored for cross-deployment DFOS recognition. The core idea is to jointly exploit complementary time- and frequency-domain cues and adapt class representations to sample-specific statistics: (i) a dual-domain learner constructs multi-prototype class representations to cover intra-class heterogeneity; (ii) a lightweight statistical guidance mechanism estimates the reliability of each domain from raw signal statistics; and (iii) a query-adaptive aggregation strategy selects and combines the most relevant prototypes for each query. Extensive experiments on two real-world cross-deployment benchmarks demonstrate consistent improvements over strong deep learning and meta-learning baselines, achieving more accurate and stable recognition under label-scarce target deployments.", "authors": [ "Yifan He", "Haodong Zhang", "Qiuheng Song", "Lin Lei", "Zhenxuan Zeng", "Haoyang He", "Hongyan Wu" ], "year": 2026, "published_date": "2026-04-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.17902", "pdf_url": "https://arxiv.org/pdf/2511.17902", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Evaluation", "Machine Learning", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.36, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.18, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Distributed Fiber Optic Sensing (DFOS) is promising for long-range perimeter security, yet practical deployment faces three key obstacles: severe cross-deployment domain shift, scarce or unavailable labels at new sites, and limited within-class coverage even in source deployments. We propose DUPLE, a prototype-based meta-learning framework tailored for cross-deployment DFOS recognition.", "key_contribution": "We propose DUPLE, a prototype-based meta-learning framework tailored for cross-deployment DFOS recognition.", "why_it_matters": "Statistically-Guided Meta-Learning for Cross-Deployment Activity Recognition in Distributed Fiber-Optic Sensing represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We propose DUPLE, a prototype-based meta-learning framework tailored for cross-deployment DFOS recognition.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2511.17902", "difficulty": "beginner" }, { "id": "arxiv:2606.15734", "source": "arxiv", "source_type": "preprint", "title": "Retrievable Gradients: Continual Post-Training Without Cumulative Weight Drift", "abstract": "Continual post-training enables models to absorb emerging knowledge after deployment, but repeatedly updating shared parameters can accumulate weight drift, potentially causing catastrophic forgetting and degrading general capabilities. Retrieval-augmented generation avoids such parameter drift, yet often lacks the depth of parametric knowledge integration. In this paper, we propose ReGrad (Retrievable Gradients), a new paradigm that treats gradients as retrievable units of knowledge. ReGrad pre-computes document-specific gradients offline, stores them in an indexed Gradient Bank, and retrieves only query-relevant gradients at inference time for temporary weight adaptation. However, raw language-modeling gradients are optimized for token-level document reconstruction rather than for query-driven knowledge use. We therefore introduce a bi-level meta-learning objective that reshapes document-derived gradients into generalizable adaptation signals for downstream tasks. Experiments across general and domain-specific settings show that \\textsc{ReGrad} outperforms CPT and RAG baselines, enabling scalable and reversible parametric knowledge injection without accumulating weight drift.", "authors": [ "Weihang Su", "Jiacheng Kang", "Jingyan Xu", "Qingyao Ai", "Jianming Long", "Hanwen Zhang", "Bangde Du", "Xinyuan Cao", "Min Zhang", "Yiqun Liu" ], "year": 2026, "published_date": "2026-06-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.15734", "pdf_url": "https://arxiv.org/pdf/2606.15734", "citations": 0, "topics": [], "tags": [ "RAG", "Continual Learning", "Artificial Intelligence", "NLP", "Information Retrieval" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Continual Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.36, "read_first_score": 4.27, "content_potential_score": 1.84, "interestingness_score": 2.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Continual post-training enables models to absorb emerging knowledge after deployment, but repeatedly updating shared parameters can accumulate weight drift, potentially causing catastrophic forgetting and degrading general capabilities. Retrieval-augmented generation avoids such parameter drift, yet often lacks the depth of parametric knowledge integration.", "key_contribution": "In this paper, we propose ReGrad (Retrievable Gradients), a new paradigm that treats gradients as retrievable units of knowledge.", "why_it_matters": "Retrievable Gradients: Continual Post-Training Without Cumulative Weight Drift improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about RAG.", "one_line_takeaway": "In this paper, we propose ReGrad (Retrievable Gradients), a new paradigm that treats gradients as retrievable units of…", "biggest_caveat": "but repeatedly updating shared parameters can accumulate weight drift, potentially causing catastrophic forgetting and degrading general capabilities.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RAG.", "url": "https://arxiv.org/abs/2606.15734", "difficulty": "advanced" }, { "id": "arxiv:2605.14145", "source": "arxiv", "source_type": "preprint", "title": "Rethinking the Good Enough Embedding for Easy Few-Shot Learning", "abstract": "The field of deep visual recognition is undergoing a paradigm shift toward universal representations. The Platonic Representation Hypothesis suggests that diverse architectures trained on massive datasets are converging toward a shared, \"ideal\" latent space. This again raises a critical question: is a \"Good Embedding All You Need?\" In this paper, we leverage this convergence to demonstrate that off-the-shelf embeddings are inherently \"good enough\" for complex tasks, rendering intensive task-specific fine-tuning unnecessary. We explore this hypothesis within the few-shot learning framework, proposing a straightforward, non-parametric pipeline that entirely bypasses backpropagation. By utilizing a k-Nearest Neighbor classifier on frozen DINOv2-L features, we conduct a layer-wise characterization to identify an optimal feature extraction. We further demonstrate that manifold refinement via PCA and ICA provides a beneficial regularizing effect. Our results across four major benchmarks demonstrate that our approach consistently surpasses sophisticated meta-learning algorithms, achieving state-of-the-art performance.", "authors": [ "Michael Karnes", "Alper Yilmaz" ], "year": 2026, "published_date": "2026-05-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.14145", "pdf_url": "https://arxiv.org/pdf/2605.14145", "citations": 0, "topics": [], "tags": [ "Prompting", "Fine-Tuning", "Evaluation", "Computer Vision" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses manifold and related concepts.", "maturity_stage": "emerging", "paper_score": 3.36, "read_first_score": 5.26, "content_potential_score": 0.0, "interestingness_score": 1.68, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The field of deep visual recognition is undergoing a paradigm shift toward universal representations. The Platonic Representation Hypothesis suggests that diverse architectures trained on massive datasets are converging toward a shared, \"ideal\" latent space.", "key_contribution": "This again raises a critical question: is a \"Good Embedding All You Need?\" In this paper, we leverage this convergence to demonstrate that off-the-shelf embeddings are inherently \"good enough\" for complex tasks, rendering intensive task-specific fine-tuning unnecessary.", "why_it_matters": "Rethinking the Good Enough Embedding for Easy Few-Shot Learning advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "This again raises a critical question: is a \"Good Embedding All You Need?\" In this paper, we leverage this convergence…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2605.14145", "difficulty": "frontier" }, { "id": "arxiv:2605.04952", "source": "arxiv", "source_type": "preprint", "title": "Adaptive Inverted-Index Routing for Granular Mixtures-of-Experts", "abstract": "Mixture-of-experts (MoE) models enable scalable transformer architectures by activating only a subset of experts per token. Recent evidence suggests that performance improves with increasingly granular experts, i.e., many small experts instead of a few large ones. However, this regime substantially increases routing cost, which can dominate computation. We introduce adaptive inverted-index routing for MoE (AIR-MoE), an inverted-index-inspired routing architecture based on vector quantization (VQ). In a first stage, AIR-MoE performs coarse shortlisting by assigning tokens to VQ codewords to construct a candidate set of experts. In a second stage, fine scoring computes exact routing scores restricted to this shortlist. This two-stage procedure approximates true top-k routing while avoiding full expert scoring and, in contrast to prior work, imposing no structural constraints on expert parameters. AIR-MoE serves as a drop-in replacement for standard routers and requires no modifications to the model architecture or loss function. We further provide a lower bound on the mass recall achieved by AIR-MoE that yields insights into its inner workings. Empirically, we demonstrate that AIR-MoE achieves improved performance compared to existing routing approaches in granular MoE settings.", "authors": [ "Klaus-Rudolf Kladny", "Maximilian Mordig", "Bernhard Schölkopf", "Michael Muehlebach" ], "year": 2026, "published_date": "2026-05-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.04952", "pdf_url": "https://arxiv.org/pdf/2605.04952", "citations": 0, "topics": [], "tags": [ "MoE", "Info Extraction", "Transformers", "Model Compression", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (MoE) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.36, "read_first_score": 5.01, "content_potential_score": 1.84, "interestingness_score": 2.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Mixture-of-experts (MoE) models enable scalable transformer architectures by activating only a subset of experts per token. Recent evidence suggests that performance improves with increasingly granular experts, i.e., many small experts instead of a few large ones.", "key_contribution": "We introduce adaptive inverted-index routing for MoE (AIR-MoE), an inverted-index-inspired routing architecture based on vector quantization (VQ).", "why_it_matters": "Adaptive Inverted-Index Routing for Granular Mixtures-of-Experts represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about MoE.", "one_line_takeaway": "We introduce adaptive inverted-index routing for MoE (AIR-MoE), an inverted-index-inspired routing architecture based…", "biggest_caveat": "However, this regime substantially increases routing cost, which can dominate computation.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in MoE.", "url": "https://arxiv.org/abs/2605.04952", "difficulty": "advanced" }, { "id": "arxiv:2501.13976", "source": "arxiv", "source_type": "preprint", "title": "Towards Safer Social Media Platforms: Scalable and Performant Few-Shot Harmful Content Moderation Using Large Language Models", "abstract": "The prevalence of harmful content on social media platforms poses significant risks to users and society, necessitating more effective and scalable content moderation strategies. Current approaches rely on human moderators, supervised classifiers, and large volumes of training data, and often struggle with scalability, subjectivity, and the dynamic nature of harmful content (e.g., violent content, dangerous challenge trends, etc.). To bridge these gaps, we utilize Large Language Models (LLMs) to undertake few-shot dynamic content moderation via in-context learning. Through extensive experiments on multiple LLMs, we demonstrate that our few-shot approaches can outperform existing proprietary baselines (Perspective and OpenAI Moderation) as well as prior state-of-the-art few-shot learning methods, in identifying harm. We also incorporate visual information (video thumbnails) and assess if different multimodal techniques improve model performance. Our results underscore the significant benefits of employing LLM based methods for scalable and dynamic harmful content moderation online.", "authors": [ "Akash Bonagiri", "Lucen Li", "Rajvardhan Oak", "Zeerak Babar", "Magdalena Wojcieszak", "Anshuman Chhabra" ], "year": 2026, "published_date": "2026-08-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2501.13976", "pdf_url": "https://arxiv.org/pdf/2501.13976", "citations": 0, "topics": [], "tags": [ "LLMs", "Prompting", "Multimodal", "Artificial Intelligence", "NLP" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.35, "read_first_score": 4.79, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The prevalence of harmful content on social media platforms poses significant risks to users and society, necessitating more effective and scalable content moderation strategies. Current approaches rely on human moderators, supervised classifiers, and large volumes of training data, and often struggle with scalability, subjectivity, and the dynamic nature of harmful content (e.g., violent content, dangerous challenge trends, etc.).", "key_contribution": "Through extensive experiments on multiple LLMs, we demonstrate that our few-shot approaches can outperform existing proprietary baselines (Perspective and OpenAI Moderation) as well as prior state-of-the-art few-shot learning methods, in identifying harm.", "why_it_matters": "Towards Safer Social Media Platforms: Scalable and Performant Few-Shot Harmful Content Moderation Using Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Through extensive experiments on multiple LLMs, we demonstrate that our few-shot approaches can outperform existing…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2501.13976", "difficulty": "beginner" }, { "id": "arxiv:2608.18796", "source": "arxiv", "source_type": "preprint", "title": "A Framework for Enterprise Network Dimensioning", "abstract": "We study radio node (RN) placement for indoor enterprise networks. Using stochastic geometry (SG), we derive the meta-distribution (MD) of the SINR for a test user equipment (UE), with and without cooperation from outdoor macro base stations (MBSs), and compare these results with an integer linear programming (ILP) approach. SG provides an estimate of the required number of RNs but not their locations, while ILP can yield inaccurate local optima and requires high computational power. To address this, we investigate clustering-based algorithms for initializing RN locations using UE location distributions. Along with standard methods, we propose a weighted $k$-harmonic means (WKHM) clustering strategy tailored to maximize SINR. We then introduce a constrained sequential minimum cut algorithm, \\texttt{SeqMinCut}, to merge multiple RNs into larger cells and further improve SINR. This is the first work that integrates SG-based statistical analysis, optimization, and clustering to obtain system design insights, dimensioning rules, and planning strategies for enterprise 5G.", "authors": [ "Gourab Ghatak" ], "year": 2026, "published_date": "2026-08-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.18796", "pdf_url": "https://arxiv.org/pdf/2608.18796", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.35, "read_first_score": 3.2, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We study radio node (RN) placement for indoor enterprise networks. Using stochastic geometry (SG), we derive the meta-distribution (MD) of the SINR for a test user equipment (UE), with and without cooperation from outdoor macro base stations (MBSs), and compare these results with an integer linear programming (ILP) approach.", "key_contribution": "Along with standard methods, we propose a weighted $k$-harmonic means (WKHM) clustering strategy tailored to maximize SINR.", "why_it_matters": "A Framework for Enterprise Network Dimensioning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "Along with standard methods, we propose a weighted $k$-harmonic means (WKHM) clustering strategy tailored to maximize…", "biggest_caveat": "but not their locations, while ILP can yield inaccurate local optima and requires high computational power.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2608.18796", "difficulty": "frontier" }, { "id": "arxiv:2606.01151", "source": "arxiv", "source_type": "preprint", "title": "Lagrangian Perturbation Diffusion Steering: Latent Reinforcement Learning for Generative Policies", "abstract": "Behavior cloning with high-capacity generative policies achieves strong imitation performance, but is often limited by demonstration coverage and distribution shift. Direct reinforcement learning fine-tuning can improve performance, but updating large action decoders is frequently unstable and sample inefficient. We propose Lagrangian Perturbation Diffusion Steering (LP-DS), a lightweight adaptation method that improves a frozen generative policy by learning a compact noise-space perturbation before decoding. LP-DS optimizes this perturbation with a Lagrangian trust-region objective, improving downstream value while constraining deviation from the latent prior. Across RoboMimic manipulation, OpenAI Gym locomotion, and Adroit dexterous manipulation benchmarks, LP-DS improves sample efficiency, success, and return while maintaining higher action-space entropy than unconstrained noise-space steering, with return improvements of up to 25% over prior baselines. Additional evaluations with flow-matching backbones, a large vision-language-action model, and physical Franka deployment show that LP-DS is not limited to compact diffusion policies or simulated benchmarks. Project page: https://sites.google.com/view/lp-ds/home.", "authors": [ "Hikmet Simsir", "Ozgur S. Oguz" ], "year": 2026, "published_date": "2026-05-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.01151", "pdf_url": "https://arxiv.org/pdf/2606.01151", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "RL", "Robotics", "Evaluation", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.35, "read_first_score": 4.85, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Behavior cloning with high-capacity generative policies achieves strong imitation performance, but is often limited by demonstration coverage and distribution shift. Direct reinforcement learning fine-tuning can improve performance, but updating large action decoders is frequently unstable and sample inefficient.", "key_contribution": "We propose Lagrangian Perturbation Diffusion Steering (LP-DS), a lightweight adaptation method that improves a frozen generative policy by learning a compact noise-space perturbation before decoding.", "why_it_matters": "Lagrangian Perturbation Diffusion Steering: Latent Reinforcement Learning for Generative Policies represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We propose Lagrangian Perturbation Diffusion Steering (LP-DS), a lightweight adaptation method that improves a frozen…", "biggest_caveat": "but is often limited by demonstration coverage and distribution shift.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2606.01151", "difficulty": "beginner" }, { "id": "arxiv:2603.22787", "source": "arxiv", "source_type": "preprint", "title": "DiSCo: Diffusion Sequence Copilots for Shared Autonomy", "abstract": "Shared autonomy combines human user and AI copilot actions to control complex systems such as robotic arms. When a task is challenging, requires high dimensional control, or is subject to corruption, shared autonomy can significantly increase task performance by using a trained copilot to effectively correct user actions in a manner consistent with the user's goals. To significantly improve the performance of shared autonomy, we introduce Diffusion Sequence Copilots (DiSCo): a method of shared autonomy with diffusion policy that plans action sequences consistent with past user actions. DiSCo seeds and inpaints the diffusion process with user-provided actions with hyperparameters to balance conformity to expert actions, alignment with user intent, and perceived responsiveness. We demonstrate that DiSCo substantially improves task performance in simulated driving and robotic arm tasks. Project website: https://sites.google.com/view/disco-shared-autonomy/", "authors": [ "Andy Wang", "Xu Yan", "Brandon McMahan", "Michael Zhou", "Yuyang Yuan", "Johannes Y. Lee", "Ali Shreif", "Matthew Li", "Zhenghao Peng", "Bolei Zhou", "Yuchen Cui", "Jonathan C. Kao" ], "year": 2026, "published_date": "2026-08-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.22787", "pdf_url": "https://arxiv.org/pdf/2603.22787", "citations": 0, "topics": [], "tags": [ "AI Safety", "Info Extraction", "Code Generation", "Robotics", "Human-Computer Interaction" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.35, "read_first_score": 4.08, "content_potential_score": 0.0, "interestingness_score": 1.68, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Shared autonomy combines human user and AI copilot actions to control complex systems such as robotic arms. When a task is challenging, requires high dimensional control, or is subject to corruption, shared autonomy can significantly increase task performance by using a trained copilot to effectively correct user actions in a manner consistent with the user's goals.", "key_contribution": "To significantly improve the performance of shared autonomy, we introduce Diffusion Sequence Copilots (DiSCo): a method of shared autonomy with diffusion policy that plans action sequences consistent with past user actions.", "why_it_matters": "DiSCo: Diffusion Sequence Copilots for Shared Autonomy represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "To significantly improve the performance of shared autonomy, we introduce Diffusion Sequence Copilots (DiSCo): a method…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2603.22787", "difficulty": "advanced" }, { "id": "arxiv:2607.26094", "source": "arxiv", "source_type": "preprint", "title": "Meta-Learned Reward Shaping for Reinforcement Learning from Human Feedback", "abstract": "Reinforcement Learning from Human Feedback (RLHF) is the standard approach for aligning large language models with human preferences, but its quality is limited by static, task-agnostic reward models. This mismatch leads to sparse learning signals and suboptimal alignment. We introduce MeRLa (Meta-Learned Reward Shaping), a principled framework that meta-learns a task-aware shaping function $Φ(x,y;ϕ)$ across auxiliary tasks before RLHF training. The learned shaping produces a composite reward that preserves policy optimality while providing task-specific learning signals. Our meta-objective combines task discrimination, entropy regularization, and potential-based conservation for stable convergence. We provide theoretical guarantees for policy invariance, analyze representation drift sensitivity, and formally address incentive misalignment from entropy maximization. Experiments on LLaMA-3-8B across four benchmarks show consistent improvements over PPO, DPO, GRPO, and DAPO, achieving a 90.8% length-controlled win rate on AlpacaEval 2.0 and a score of 9.14 on MT-Bench, with 41% less training instability. MeRLa retains its benefits when combined with process-based and rubric-based enhanced rewards.", "authors": [ "Yunpeng Chu" ], "year": 2026, "published_date": "2026-07-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.26094", "pdf_url": "https://arxiv.org/pdf/2607.26094", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "AI Safety", "Evaluation", "NLP" ], "paper_type": "theory", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.35, "read_first_score": 6.41, "content_potential_score": 0.05, "interestingness_score": 1.7, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reinforcement Learning from Human Feedback (RLHF) is the standard approach for aligning large language models with human preferences, but its quality is limited by static, task-agnostic reward models. This mismatch leads to sparse learning signals and suboptimal alignment.", "key_contribution": "We introduce MeRLa (Meta-Learned Reward Shaping), a principled framework that meta-learns a task-aware shaping function $Φ(x,y;ϕ)$ across auxiliary tasks before RLHF training.", "why_it_matters": "Meta-Learned Reward Shaping for Reinforcement Learning from Human Feedback represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce MeRLa (Meta-Learned Reward Shaping), a principled framework that meta-learns a task-aware shaping function…", "biggest_caveat": "but its quality is limited by static, task-agnostic reward models.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.26094", "difficulty": "beginner" }, { "id": "arxiv:2606.28347", "source": "arxiv", "source_type": "preprint", "title": "Agentic Safety is an Epistemic Property, Not a Behavioral One", "abstract": "Contemporary AI safety spans pre-training interventions, post-training alignment, deployment-time controls, monitoring, and red-teaming. These methods are necessary, but they primarily certify snapshots of system behavior. As AI systems become more capable, dynamic, embodied, and self-improving, this snapshot view becomes incomplete: safety depends not only on whether a system behaves acceptably now, but whether it remains correctable as it learns, adapts, acts, and modifies itself over time. This paper argues that safety should therefore be treated as an epistemic property of the evolving learner, not merely a behavioral property of the current policy. We introduce teachability as the capacity to preserve future corrective leverage under bounded human, institutional, or environmental intervention. We argue that advanced systems can retain visible competence while eroding the representational, algorithmic, or meta-decision conditions needed for future correction. Safe advanced AI systems must not only behave acceptably now; they must remain teachable later.", "authors": [ "Charles L. Wang", "Keir Dorchen", "Peter Jin" ], "year": 2026, "published_date": "2026-06-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.28347", "pdf_url": "https://arxiv.org/pdf/2606.28347", "citations": 0, "topics": [], "tags": [ "AI Safety", "AI Agents", "Info Extraction", "Self-Supervised", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.35, "read_first_score": 3.62, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Contemporary AI safety spans pre-training interventions, post-training alignment, deployment-time controls, monitoring, and red-teaming. These methods are necessary, but they primarily certify snapshots of system behavior.", "key_contribution": "We introduce teachability as the capacity to preserve future corrective leverage under bounded human, institutional, or environmental intervention.", "why_it_matters": "Agentic Safety is an Epistemic Property, Not a Behavioral One represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We introduce teachability as the capacity to preserve future corrective leverage under bounded human, institutional, or…", "biggest_caveat": "but they primarily certify snapshots of system behavior.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2606.28347", "difficulty": "advanced" }, { "id": "arxiv:2606.16821", "source": "arxiv", "source_type": "preprint", "title": "How Much Can We Trust LLM Search Agents? Measuring Endorsement Vulnerability to Web Content Manipulation", "abstract": "Large language model (LLM)-based search agents synthesize open-web content into actionable recommendations on behalf of users, creating a risk that attacker-published pages are transformed into endorsed claims. We introduce SearchGEO, a controlled evaluation framework for measuring endorsement corruption in LLM-based web-search agents, combining a web-evidence manipulation pipeline, a five-mode attack taxonomy, and multiple output-level metrics. We evaluate 13 LLM backends on 308 cases each. Results show that vulnerability patterns vary across backends: overall attack success rate (ASR) ranges from 0.0% on Claude-Sonnet-4.6 to 31.4% on Gemini-3-Flash, the strongest attack mode differs by model family, and the same deployment scaffold could amplify or decrease ASR on different backends. An auxiliary agent-skill probe, where endorsement becomes an install command, exposes a sharp split among otherwise robust backends: Claude over-rejects while GPT over-trusts. These findings argue for treating recommendation reliability under adversarial search content as a first-class dimension of backend safety evaluation.", "authors": [ "Yimeng Chen", "Zhe Ren", "Firas Laakom", "Yu Li", "Dandan Guo", "Jürgen Schmidhuber" ], "year": 2026, "published_date": "2026-06-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.16821", "pdf_url": "https://arxiv.org/pdf/2606.16821", "citations": 0, "topics": [], "tags": [ "LLMs", "ASR", "Robotics", "Evaluation", "NLP" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.35, "read_first_score": 5.36, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language model (LLM)-based search agents synthesize open-web content into actionable recommendations on behalf of users, creating a risk that attacker-published pages are transformed into endorsed claims. We introduce SearchGEO, a controlled evaluation framework for measuring endorsement corruption in LLM-based web-search agents, combining a web-evidence manipulation pipeline, a five-mode attack taxonomy, and multiple output-level metrics.", "key_contribution": "We introduce SearchGEO, a controlled evaluation framework for measuring endorsement corruption in LLM-based web-search agents, combining a web-evidence manipulation pipeline, a five-mode attack taxonomy, and multiple output-level metrics.", "why_it_matters": "How Much Can We Trust LLM Search Agents? Measuring Endorsement Vulnerability to Web Content Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce SearchGEO, a controlled evaluation framework for measuring endorsement corruption in LLM-based web-search…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.16821", "difficulty": "beginner" }, { "id": "arxiv:2601.14430", "source": "arxiv", "source_type": "preprint", "title": "Meta Flow Maps enable scalable reward alignment", "abstract": "Controlling generative models is computationally expensive. This is because optimal alignment with a reward function--whether via inference-time steering or fine-tuning--requires estimating the value function. This task demands access to the conditional posterior $p_{1|t}(x_1|x_t)$, the distribution of clean data $x_1$ consistent with an intermediate state $x_t$, a requirement that typically compels methods to resort to costly trajectory simulations. To address this bottleneck, we introduce Meta Flow Maps (MFMs), a framework extending consistency models and flow maps into the stochastic regime. MFMs are trained to perform stochastic one-step posterior sampling, generating arbitrarily many i.i.d. draws of clean data $x_1$ from any intermediate state. Crucially, these samples provide a differentiable reparametrization that unlocks efficient value function estimation. We leverage this capability to solve bottlenecks in both paradigms: enabling inference-time steering without inner rollouts, and facilitating unbiased, off-policy fine-tuning to general rewards. Empirically, our single-particle steered-MFM sampler outperforms a Best-of-1000 baseline on ImageNet across multiple rewards at a fraction of the compute.", "authors": [ "Peter Potaptchik", "Adhi Saravanan", "Abbas Mammadov", "Alvaro Prat", "Michael S. Albergo", "Yee Whye Teh" ], "year": 2026, "published_date": "2026-06-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.14430", "pdf_url": "https://arxiv.org/pdf/2601.14430", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "AI Safety", "Info Extraction", "Fairness & Ethics", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.35, "read_first_score": 3.71, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Controlling generative models is computationally expensive. This is because optimal alignment with a reward function--whether via inference-time steering or fine-tuning--requires estimating the value function.", "key_contribution": "To address this bottleneck, we introduce Meta Flow Maps (MFMs), a framework extending consistency models and flow maps into the stochastic regime.", "why_it_matters": "Meta Flow Maps enable scalable reward alignment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "To address this bottleneck, we introduce Meta Flow Maps (MFMs), a framework extending consistency models and flow maps…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2601.14430", "difficulty": "frontier" }, { "id": "arxiv:2606.17839", "source": "arxiv", "source_type": "preprint", "title": "From Ad Hoc Pilots to Repeatable Patterns: Structuring Drone Collaboration in Emergency Services with DroneLets", "abstract": "Drones hold promise for supporting emergency services, but their integration into workflows remains ad hoc and coordination-intensive. This paper addresses two research questions: how emergency teams want to collaborate with drones, and how to formalize these collaborations into repeatable processes. Based on four field trials and 95 interviews, we derive 44 interaction patterns grouped into 10 meta-patterns reflecting operational needs such as reconnaissance, communication, and logistical support. To structure these practices, we introduce DroneLets - a new class of design artifacts that extend Collaboration Engineering to embodied agents. DroneLets capture setup requirements, drone capabilities, environmental constraints, and coordinated actions across human and drone actors. They offer a modular framework for designing repeatable, scalable collaboration processes in emergency services, illustrated through patterns such as broadcasting to bystanders and post-fire monitoring. This work expands the scope of CE and provides a structured foundation for integrating autonomous drones into high-stakes field operations.", "authors": [ "Dzmitry Katsiuba", "Samuel Brander", "Mateusz Dolata", "Gerhard Schwabe" ], "year": 2026, "published_date": "2026-06-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.17839", "pdf_url": "https://arxiv.org/pdf/2606.17839", "citations": 0, "topics": [], "tags": [ "Robotics", "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.35, "read_first_score": 4.26, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Drones hold promise for supporting emergency services, but their integration into workflows remains ad hoc and coordination-intensive. This paper addresses two research questions: how emergency teams want to collaborate with drones, and how to formalize these collaborations into repeatable processes.", "key_contribution": "To structure these practices, we introduce DroneLets - a new class of design artifacts that extend Collaboration Engineering to embodied agents.", "why_it_matters": "From Ad Hoc Pilots to Repeatable Patterns: Structuring Drone Collaboration in Emergency Services with DroneLets represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "To structure these practices, we introduce DroneLets - a new class of design artifacts that extend Collaboration…", "biggest_caveat": "but their integration into workflows remains ad hoc and coordination-intensive.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2606.17839", "difficulty": "intermediate" }, { "id": "arxiv:2602.10016", "source": "arxiv", "source_type": "preprint", "title": "Kunlun: Establishing Scaling Laws for Massive-Scale Recommendation Systems through Unified Architecture Design", "abstract": "Deriving predictable scaling laws that govern the relationship between model performance and computational investment is crucial for designing and allocating resources in massive-scale recommendation systems. While such laws are established for large language models, they remain challenging for recommendation systems, especially those processing both user history and context features. We identify poor scaling efficiency as the main barrier to predictable power-law scaling, stemming from inefficient modules with low Model FLOPs Utilization (MFU) and suboptimal resource allocation. We introduce Kunlun, a scalable architecture that systematically improves model efficiency and resource allocation. Our low-level optimizations include Generalized Dot-Product Attention (GDPA), Hierarchical Seed Pooling (HSP), and Sliding Window Attention. Our high-level innovations feature Computation Skip (CompSkip) and Event-level Personalization. These advances increase MFU from 17% to 37% on NVIDIA B200 GPUs and double scaling efficiency over state-of-the-art methods. Kunlun is now deployed in major Meta Ads models, delivering significant production impact.", "authors": [ "Bojian Hou", "Xiaolong Liu", "Xiaoyi Liu", "Jiaqi Xu", "Yasmine Badr", "Mengyue Hang", "Sudhanshu Chanpuriya", "Junqing Zhou", "Yuhang Yang", "Han Xu", "Qiuling Suo", "Laming Chen", "Yuxi Hu", "Jiasheng Zhang", "Huaqing Xiong", "Yuzhen Huang", "Chao Chen", "Yue Dong", "Yi Yang", "Shuo Chang", "Xiaorui Gan", "Wenlin Chen", "Santanu Kolay", "Darren Liu", "Jade Nie", "Chunzhi Yang", "Ellie Wen", "Jiyan Yang", "Huayu Li" ], "year": 2026, "published_date": "2026-06-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.10016", "pdf_url": "https://arxiv.org/pdf/2602.10016", "citations": 0, "topics": [], "tags": [ "LLMs", "Information Retrieval", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses architecture design — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.35, "read_first_score": 3.65, "content_potential_score": 1.84, "interestingness_score": 2.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deriving predictable scaling laws that govern the relationship between model performance and computational investment is crucial for designing and allocating resources in massive-scale recommendation systems. While such laws are established for large language models, they remain challenging for recommendation systems, especially those processing both user history and context features.", "key_contribution": "We introduce Kunlun, a scalable architecture that systematically improves model efficiency and resource allocation.", "why_it_matters": "Kunlun: Establishing Scaling Laws for Massive-Scale Recommendation Systems through Unified Architecture Design improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Kunlun, a scalable architecture that systematically improves model efficiency and resource allocation.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2602.10016", "difficulty": "advanced" }, { "id": "arxiv:2507.13757", "source": "arxiv", "source_type": "preprint", "title": "Efficient and Scalable Self-Healing Databases Using Meta-Learning and Dependency-Driven Recovery", "abstract": "Modern database management systems (DBMS) face significant challenges in maintaining performance and availability under dynamic workloads. This paper proposes a novel self-healing framework that integrates Model-Agnostic Meta-Learning (MAML) for few-shot anomaly detection, Graph Neural Networks (GNNs) for dependency-driven cascading failure prediction, and multi-objective Reinforcement Learning (RL) for autonomous recovery. Unlike existing database tuning systems that focus primarily on offline configuration optimization, our framework enables real-time, end-to-end self-healing by rapidly adapting to unseen workload patterns with minimal labeled data. We introduce dynamic GNN-based dependency modeling that captures workload-dependent relationships between database components, enabling proactive cascade prevention. A scalarized multi-objective RL formulation balances latency, resource utilization, and cost during recovery, while SHAP-based explainability ensures operational transparency. Evaluations on Google Cluster Data and TPC benchmarks demonstrate 90.5\\% anomaly detection F1-score with 5-shot adaptation, 90.1\\% cascade prediction accuracy, and 85.1\\% latency reduction in recovery actions, outperforming strong baselines including Isolation Forest, LSTM autoencoders, static GCN, and standard RL methods.", "authors": [ "Joydeep Chandra", "Prabal Manhas" ], "year": 2026, "published_date": "2026-05-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2507.13757", "pdf_url": "https://arxiv.org/pdf/2507.13757", "citations": 0, "topics": [], "tags": [ "Prompting", "GNNs", "RL", "Interpretability", "Evaluation" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.35, "read_first_score": 5.58, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Modern database management systems (DBMS) face significant challenges in maintaining performance and availability under dynamic workloads. This paper proposes a novel self-healing framework that integrates Model-Agnostic Meta-Learning (MAML) for few-shot anomaly detection, Graph Neural Networks (GNNs) for dependency-driven cascading failure prediction, and multi-objective Reinforcement Learning (RL) for autonomous recovery.", "key_contribution": "This paper proposes a novel self-healing framework that integrates Model-Agnostic Meta-Learning (MAML) for few-shot anomaly detection, Graph Neural Networks (GNNs) for dependency-driven cascading failure prediction, and multi-objective Reinforcement Learning (RL) for autonomous recovery.", "why_it_matters": "Efficient and Scalable Self-Healing Databases Using Meta-Learning and Dependency-Driven Recovery represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "This paper proposes a novel self-healing framework that integrates Model-Agnostic Meta-Learning (MAML) for few-shot…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2507.13757", "difficulty": "beginner" }, { "id": "arxiv:2503.16492", "source": "arxiv", "source_type": "preprint", "title": "FAM-HRI: Foundation-Model Assisted Multi-Modal Human-Robot Interaction Combining Gaze and Speech", "abstract": "ffective Human-Robot Interaction (HRI) is crucial for enhancing accessibility and usability in real-world robotics applications. However, existing solutions often rely on gesture- only or language-only commands, making interaction inefficient and ambiguous, particularly for users with physical impairments. In this paper, we introduce FAM-HRI, an efficient multimodal framework for HRI that integrates language and gaze inputs via foundation models. By leveraging lightweight Meta ARIA glasses, our system captures real-time multimodal signals and utilizes large language models (LLMs) to fuse user intention with scene context, enabling intuitive and precise robot manipulation. Our method accurately determines the gaze fixation time interval, reducing noise caused by the gaze dynamic nature. Experimental evaluations demonstrate that FAM-HRI achieves a high success rate in task execution while maintaining a low interaction time, providing a practical solution for individuals with limited physical mobility or motor impairments. To support the community, we have released our system design, algorithms, and solutions at https://github.com/laiyuzhi/FAM-HRI.", "authors": [ "Yuzhi Lai", "Shenghai Yuan", "Peizheng Li", "Boya Zhang", "Benjamin Kiefer", "Tianchen Deng", "Andreas Zell" ], "year": 2026, "published_date": "2026-05-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2503.16492", "pdf_url": "https://arxiv.org/pdf/2503.16492", "citations": 0, "topics": [], "tags": [ "LLMs", "Multimodal", "Robotics", "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.35, "read_first_score": 5.34, "content_potential_score": 1.42, "interestingness_score": 2.38, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "ffective Human-Robot Interaction (HRI) is crucial for enhancing accessibility and usability in real-world robotics applications. However, existing solutions often rely on gesture- only or language-only commands, making interaction inefficient and ambiguous, particularly for users with physical impairments.", "key_contribution": "In this paper, we introduce FAM-HRI, an efficient multimodal framework for HRI that integrates language and gaze inputs via foundation models.", "why_it_matters": "FAM-HRI: Foundation-Model Assisted Multi-Modal Human-Robot Interaction Combining Gaze and Speech represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this paper, we introduce FAM-HRI, an efficient multimodal framework for HRI that integrates language and gaze inputs…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2503.16492", "difficulty": "intermediate" }, { "id": "arxiv:2605.08040", "source": "arxiv", "source_type": "preprint", "title": "ECNUClaw: A Learner-Profiled Intelligent Study Companion Framework for K-12 Personalized Education", "abstract": "We introduce ECNUClaw, an open-source framework for building learner-profiled intelligent study companions in K-12 education. The system constructs and maintains a five-dimension learner profile -- covering cognitive, behavioral, emotional, metacognitive, and contextual dimensions -- by extracting signals from student-companion dialogues at each turn. Profile updates feed directly into an adaptive strategy engine that adjusts the companion's guidance intensity, encouragement frequency, and Bloom's taxonomy scaffolding in real time. The framework design draws on three theoretical strands from the Chinese educational technology literature: Zhang's Digital Portrait Three-Layer Framework for learner assessment, the Education Brain model for educational system architecture, and the Human-AI Collaborative IQ concept for companion design philosophy. ECNUClaw is implemented in Python and supports seven Chinese LLM providers through a unified OpenAI-compatible adapter layer. We describe the system architecture, the profiling and adaptation mechanisms, and discuss limitations and next steps. The source code is available at https://github.com/bushushu2333/ECNUClaw.", "authors": [ "Yizhou Zhou", "Jiayin Li", "Zhi Zhang" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.08040", "pdf_url": "https://arxiv.org/pdf/2605.08040", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Dialogue", "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.35, "read_first_score": 4.23, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce ECNUClaw, an open-source framework for building learner-profiled intelligent study companions in K-12 education. The system constructs and maintains a five-dimension learner profile -- covering cognitive, behavioral, emotional, metacognitive, and contextual dimensions -- by extracting signals from student-companion dialogues at each turn.", "key_contribution": "We introduce ECNUClaw, an open-source framework for building learner-profiled intelligent study companions in K-12 education.", "why_it_matters": "ECNUClaw: A Learner-Profiled Intelligent Study Companion Framework for K-12 Personalized Education represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce ECNUClaw, an open-source framework for building learner-profiled intelligent study companions in K-12…", "biggest_caveat": "limitations and next steps.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.08040", "difficulty": "intermediate" }, { "id": "arxiv:2605.07174", "source": "arxiv", "source_type": "preprint", "title": "Repeated Deceptive Path Planning against Learnable Observer", "abstract": "We study the problem of deceptive path planning (DPP), where an agent aims to conceal its true destination from external observers. While existing work assumes static, non-learning observers, real-world adversaries-such as in critical goods transportation or military operations-can adapt by learning from historical trajectories. To address this gap, we introduce Repeated Deceptive Path Planning (RDPP), a new formulation that explicitly models learnable observers. We show that existing DPP methods fail under this setting, as they cannot adapt to evolving adversarial predictions. While incorporating observer previous predictions into updates enables some adaptation, such incremental updates cause accumulative lag that degrades deception. To this end, we propose Deceptive Meta Planning (DeMP), a two-level optimization framework that combines episode-level adaptation, which enables short-term policy adjustment to counter updated observer, and meta-level updates, which leverage cross-episode feedback to capture how observers update their models and accelerate adaptation in future episodes. In this way, DeMP mitigates the accumulation of adaptation lag, enabling sustained deception against a learning observer. Experiments across environments demonstrate that DeMP significantly outperforms existing approaches in RDPP while maintaining competitive path cost. Our results highlight the importance of modeling repeated interactions with learnable adversaries, providing new insights into deception and privacy in multi-agent systems.", "authors": [ "Shiyue Cao", "Pei Xu", "Likun Yang", "Lei Cui", "Shizhao Yu", "Shiyu Zhang", "Yongjian Ren", "Xiaotang Chen", "Kaiqi Huang" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.07174", "pdf_url": "https://arxiv.org/pdf/2605.07174", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.34, "read_first_score": 5.59, "content_potential_score": 0.0, "interestingness_score": 1.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We study the problem of deceptive path planning (DPP), where an agent aims to conceal its true destination from external observers. While existing work assumes static, non-learning observers, real-world adversaries-such as in critical goods transportation or military operations-can adapt by learning from historical trajectories.", "key_contribution": "To address this gap, we introduce Repeated Deceptive Path Planning (RDPP), a new formulation that explicitly models learnable observers.", "why_it_matters": "Repeated Deceptive Path Planning against Learnable Observer represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "To address this gap, we introduce Repeated Deceptive Path Planning (RDPP), a new formulation that explicitly models…", "biggest_caveat": "cannot adapt to evolving adversarial predictions.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2605.07174", "difficulty": "intermediate" }, { "id": "arxiv:2607.09796", "source": "arxiv", "source_type": "preprint", "title": "Metadata-Free Meta-Reweighted Direct Preference Optimization under Noisy Preference Labels", "abstract": "Direct Preference Optimization (DPO) has become an important method for aligning large language models (LLMs) with human preferences because it removes the need for explicit reward modeling and reinforcement learning optimization. However, its performance depends heavily on the quality of preference data, and noisy preference data in real-world settings can weaken alignment performance. To address this issue, we propose a bilevel optimization framework and prove, under certain assumptions, that this framework can recover the DPO optimum under clean data. We further derive a prior form for the learnable weighting function under asymmetric label-flipping noise. Considering that high-quality metadata may be difficult to obtain, we propose a task-agnostic meta-knowledge-driven method that enables meta-learning even when metadata is completely unavailable. To reduce the high cost of higher-order gradients in LLM meta-learning, we combine central-difference approximation with LoRA fine-tuning and develop a scalable training scheme. Experiments on TL;DR summarization and Anthropic HH single-turn dialogue show that the proposed method improves training performance over multiple DPO baselines under different noise rates.", "authors": [ "Hua Qu", "Yifan Li", "Xiaodong Yuan" ], "year": 2026, "published_date": "2026-07-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.09796", "pdf_url": "https://arxiv.org/pdf/2607.09796", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "Fine-Tuning", "AI Safety", "Summarization" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Summarization) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.34, "read_first_score": 5.64, "content_potential_score": 1.55, "interestingness_score": 2.44, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Direct Preference Optimization (DPO) has become an important method for aligning large language models (LLMs) with human preferences because it removes the need for explicit reward modeling and reinforcement learning optimization. However, its performance depends heavily on the quality of preference data, and noisy preference data in real-world settings can weaken alignment performance.", "key_contribution": "To address this issue, we propose a bilevel optimization framework and prove, under certain assumptions, that this framework can recover the DPO optimum under clean data.", "why_it_matters": "Metadata-Free Meta-Reweighted Direct Preference Optimization under Noisy Preference Labels represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this issue, we propose a bilevel optimization framework and prove, under certain assumptions, that this…", "biggest_caveat": "However, its performance depends heavily on the quality of preference data, and noisy preference data in real-world settings can weaken alignment performance.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.09796", "difficulty": "beginner" }, { "id": "arxiv:2506.12339", "source": "arxiv", "source_type": "preprint", "title": "SheetMind: An End-to-End LLM-Powered Multi-Agent Framework for Spreadsheet Automation", "abstract": "We present SheetMind, a modular multi-agent framework powered by large language models (LLMs) for spreadsheet automation via natural language instructions. In this paper, we introduce a hierarchical agentic system consisting of three specialized agents: Manager Agent that decomposes complex user instructions into subtasks; an Action Agent that translates these into structured commands using a Backus-Naur Form (BNF) grammar; and a Reflection Agent that validates alignment between generated actions and the user's original intent. We evaluate SheetMind on the 221-task SheetCopilot Benchmark with GPT-3.5-Turbo. SheetMind achieved 100% execution success and 54.8% functional correctness, exceeding SheetCopilot (44.3%) while maintaining perfect execution reliability. We also conduct ablation study on a separately curated dataset to confirm that the full three-agent configuration consistently outperforms all partial variants. Lastly, we integrate our system into Google Sheets via a Workspace extension.", "authors": [ "Xi Cheng", "Ruiyan Zhu", "Ke Liu", "Rakesh Chowdary Machineni", "Lyuhao Chen", "Brian Zhu", "Daniel Jin", "Zheng Qi", "Neeraj Parihar", "Zhoutian Xu", "Oliver Gao" ], "year": 2026, "published_date": "2026-07-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2506.12339", "pdf_url": "https://arxiv.org/pdf/2506.12339", "citations": 0, "topics": [], "tags": [ "AI Safety", "AI Agents", "Code Generation", "Evaluation", "Human-Computer Interaction" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.34, "read_first_score": 5.51, "content_potential_score": 1.5, "interestingness_score": 2.42, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present SheetMind, a modular multi-agent framework powered by large language models (LLMs) for spreadsheet automation via natural language instructions. In this paper, we introduce a hierarchical agentic system consisting of three specialized agents: Manager Agent that decomposes complex user instructions into subtasks; an Action Agent that translates these into structured commands using a Backus-Naur Form (BNF) grammar; and a Reflection Agent that validates alignment between generated actions and the user's original intent.", "key_contribution": "We present SheetMind, a modular multi-agent framework powered by large language models (LLMs) for spreadsheet automation via natural language instructions.", "why_it_matters": "SheetMind: An End-to-End LLM-Powered Multi-Agent Framework for Spreadsheet Automation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We present SheetMind, a modular multi-agent framework powered by large language models (LLMs) for spreadsheet…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2506.12339", "difficulty": "advanced" }, { "id": "arxiv:2508.04460", "source": "arxiv", "source_type": "preprint", "title": "From \"Aha Moments\" to Controllable Thinking: Toward Meta-Cognitive Reasoning in Large Reasoning Models via Decoupled Reasoning and Control", "abstract": "Large Reasoning Models (LRMs) can exhibit step-by-step reasoning, reflection, and backtracking, but these behaviors are often unregulated, leading to overthinking. As a result, LRMs continue generating redundant reasoning even after reaching high-confidence conclusions. This increases inference cost and latency, limiting practical deployment. The root cause is the absence of an intrinsic mechanism to monitor the reasoning state and decide when to continue, backtrack, or stop. We propose MERA, a meta-cognitive reasoning framework that decouples reasoning from control to enable independent optimization of control strategies. MERA constructs high-quality reasoning-control supervision data via a takeover-based pipeline, and transforms long-horizon traces into structured reasoning-control alternating sequences for training. The model is trained with supervised fine-tuning to internalize the structured separation, and further optimized with Control-Segment Policy Optimization (CSPO), which combines segment-wise GRPO with control masking to focus learning on control segments. Experiments across reasoning benchmarks show that MERA improves both efficiency and accuracy.", "authors": [ "Rui Ha", "Rui Pu", "Chaozhuo Li", "Li Sun", "Sen Su" ], "year": 2026, "published_date": "2026-06-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2508.04460", "pdf_url": "https://arxiv.org/pdf/2508.04460", "citations": 0, "topics": [], "tags": [ "Reasoning", "RLHF", "Fine-Tuning", "Evaluation", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.34, "read_first_score": 4.88, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large Reasoning Models (LRMs) can exhibit step-by-step reasoning, reflection, and backtracking, but these behaviors are often unregulated, leading to overthinking. As a result, LRMs continue generating redundant reasoning even after reaching high-confidence conclusions.", "key_contribution": "We propose MERA, a meta-cognitive reasoning framework that decouples reasoning from control to enable independent optimization of control strategies.", "why_it_matters": "From \"Aha Moments\" to Controllable Thinking: Toward Meta-Cognitive Reasoning in Large Reasoning Models via Decoupled Reasoning and Control represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We propose MERA, a meta-cognitive reasoning framework that decouples reasoning from control to enable independent…", "biggest_caveat": "but these behaviors are often unregulated, leading to overthinking.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2508.04460", "difficulty": "beginner" }, { "id": "arxiv:2601.22969", "source": "arxiv", "source_type": "preprint", "title": "Improved Algorithms for Nash Welfare in Linear Bandits", "abstract": "Nash regret has recently emerged as a principled fairness-aware performance metric for stochastic multi-armed bandits, motivated by the Nash Social Welfare objective. Although this notion has been extended to linear bandits, existing results suffer from suboptimality in ambient dimension $d$, stemming from proof techniques that rely on restrictive concentration inequalities. In this work, we resolve this open problem by introducing new analytical tools that yield an order-optimal Nash regret bound in linear bandits. Beyond Nash regret, we initiate the study of $p$-means regret in linear bandits, a unifying framework that interpolates between fairness and utility objectives and strictly generalizes Nash regret. We propose a generic algorithmic framework, FairLinBandit, that works as a meta-algorithm on top of any linear bandit strategy. We instantiate this framework using two bandit algorithms: Phased Elimination and Upper Confidence Bound, and prove that both achieve sublinear $p$-means regret for the entire range of $p$. Extensive experiments on linear bandit instances generated from real-world datasets demonstrate that our methods consistently outperform the existing state-of-the-art baseline.", "authors": [ "Dhruv Sarkar", "Nishant Pandey", "Sayak Ray Chowdhury" ], "year": 2026, "published_date": "2026-06-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.22969", "pdf_url": "https://arxiv.org/pdf/2601.22969", "citations": 0, "topics": [], "tags": [ "Fairness & Ethics", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.34, "read_first_score": 4.94, "content_potential_score": 0.0, "interestingness_score": 1.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Nash regret has recently emerged as a principled fairness-aware performance metric for stochastic multi-armed bandits, motivated by the Nash Social Welfare objective. Although this notion has been extended to linear bandits, existing results suffer from suboptimality in ambient dimension $d$, stemming from proof techniques that rely on restrictive concentration inequalities.", "key_contribution": "We propose a generic algorithmic framework, FairLinBandit, that works as a meta-algorithm on top of any linear bandit strategy.", "why_it_matters": "Improved Algorithms for Nash Welfare in Linear Bandits represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fairness & Ethics.", "one_line_takeaway": "We propose a generic algorithmic framework, FairLinBandit, that works as a meta-algorithm on top of any linear bandit…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Fairness & Ethics.", "url": "https://arxiv.org/abs/2601.22969", "difficulty": "frontier" }, { "id": "arxiv:2602.14710", "source": "arxiv", "source_type": "preprint", "title": "Orcheo: A Modular Full-Stack Platform for Conversational Search", "abstract": "Conversational search (CS) requires a complex software engineering pipeline that integrates query reformulation, ranking, and response generation. CS researchers currently face two barriers: the lack of a unified framework for efficiently sharing contributions with the community, and the difficulty of deploying end-to-end prototypes needed for user evaluation. We introduce Orcheo, an open-source platform designed to bridge this gap. Orcheo offers three key advantages: (i) A modular architecture promotes component reuse through single-file node modules, facilitating sharing and reproducibility in CS research; (ii) Production-ready infrastructure bridges the prototype-to-system gap via dual execution modes, secure credential management, and execution telemetry, with built-in AI coding support that lowers the learning curve; (iii) Starter-kit assets include 45+ off-the-shelf components for query understanding, ranking, and response generation, enabling the rapid bootstrapping of complete CS pipelines. We describe the framework architecture and validate Orcheo's utility through case studies that highlight modularity and ease of use. Orcheo is released as open source under the MIT License at https://github.com/AI-Colleagues/orcheo.", "authors": [ "Shaojie Jiang", "Svitlana Vakulenko", "Maarten de Rijke" ], "year": 2026, "published_date": "2026-06-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.14710", "pdf_url": "https://arxiv.org/pdf/2602.14710", "citations": 0, "topics": [], "tags": [ "Dialogue", "Information Retrieval", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.34, "read_first_score": 4.33, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Conversational search (CS) requires a complex software engineering pipeline that integrates query reformulation, ranking, and response generation. CS researchers currently face two barriers: the lack of a unified framework for efficiently sharing contributions with the community, and the difficulty of deploying end-to-end prototypes needed for user evaluation.", "key_contribution": "We introduce Orcheo, an open-source platform designed to bridge this gap.", "why_it_matters": "Orcheo: A Modular Full-Stack Platform for Conversational Search improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about Dialogue.", "one_line_takeaway": "We introduce Orcheo, an open-source platform designed to bridge this gap.", "biggest_caveat": "butions with the community, and the difficulty of deploying end-to-end prototypes needed for user evaluation.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Dialogue.", "url": "https://arxiv.org/abs/2602.14710", "difficulty": "intermediate" }, { "id": "arxiv:2606.09663v1", "source": "arxiv", "source_type": "preprint", "title": "From 0-to-1 to 1-to-N: Reproducible Engineering Evidence for MetaAI Recursive Self-Design", "abstract": "Recursive self-design refers to AI-assisted modification of the mechanisms by which an AI system is built, evaluated, and improved. This paper treats MetaAI not as a mature paradigm, but as a working term for a human-seeded, AI-expanded development pattern in which the design space itself becomes a target of modification. We propose an operational evidence framework with four criteria: inspectable target system, meta-level modifier, feedback-directed selection, and recursive continuation. We then map public systems, including Darwin Goedel Machine (DGM), STOP, Goedel Agent, and ShinkaEvolve, against these criteria. DGM provides the most direct currently reported evidence: its published results show improvement from 20% to 50% on SWE-bench Verified and from 14.2% to 30.7% on full Polyglot after 80 iterations, with ablations suggesting that both open-ended exploration and self-improvement contribute. Finally, we provide MetaAI-Mini, a reproducible HumanEval-based protocol and codebase. Because no completed model run is included in this build, MetaAI-Mini is reported as a protocol rather than as an experimental result.", "authors": [ "Dun Li", "Jiatao Li", "Hongzhi Li" ], "year": 2026, "published_date": "2026-06-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.09663v1", "pdf_url": "https://arxiv.org/pdf/2606.09663v1", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.34, "read_first_score": 4.33, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recursive self-design refers to AI-assisted modification of the mechanisms by which an AI system is built, evaluated, and improved. This paper treats MetaAI not as a mature paradigm, but as a working term for a human-seeded, AI-expanded development pattern in which the design space itself becomes a target of modification.", "key_contribution": "We propose an operational evidence framework with four criteria: inspectable target system, meta-level modifier, feedback-directed selection, and recursive continuation.", "why_it_matters": "From 0-to-1 to 1-to-N: Reproducible Engineering Evidence for MetaAI Recursive Self-Design represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We propose an operational evidence framework with four criteria: inspectable target system, meta-level modifier,…", "biggest_caveat": "but as a working term for a human-seeded, AI-expanded development pattern in which the design space itself becomes a target of modification.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Artificial Intelligence.", "url": "http://arxiv.org/abs/2606.09663v1", "difficulty": "intermediate" }, { "id": "arxiv:2606.05332", "source": "arxiv", "source_type": "preprint", "title": "GITCO: Gated Inference-Time Context Optimization in TSFMs", "abstract": "Patch-based Time Series Foundation Models (TSFMs) suffer from context poisoning: structurally anomalous patches capture disproportionate attention and silently degrade zero-shot forecast quality. We propose improving TSFM accuracy at inference time by optimizing the input context rather than modifying model weights. We present GITCO (Gated Inference-Time Context Optimization), a lightweight three-component framework: Gate, Router, and Critic that selectively identifies and suppresses harmful patches without any parameter updates. Evaluated on TimesFM 2.5 across 53 GIFT-Eval datasets under K-fold cross-validation, GITCO achieves an average +1.95% MASE reduction on TimesFM 2.5 while capturing 89.9% of the improvement upper bound. We introduce context sensitivity profiles as a new characterizable property of TSFMs: the mapping from time series meta-features to expected accuracy improvement under inference-time context intervention, shaped jointly by model architecture and the statistical structure of the data.", "authors": [ "Manya Pandey", "Dhruv Kumar", "Murari Mandal", "Saurabh Deshpande" ], "year": 2026, "published_date": "2026-06-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.05332", "pdf_url": "https://arxiv.org/pdf/2606.05332", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.34, "read_first_score": 5.1, "content_potential_score": 0.84, "interestingness_score": 2.09, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Patch-based Time Series Foundation Models (TSFMs) suffer from context poisoning: structurally anomalous patches capture disproportionate attention and silently degrade zero-shot forecast quality. We propose improving TSFM accuracy at inference time by optimizing the input context rather than modifying model weights.", "key_contribution": "We propose improving TSFM accuracy at inference time by optimizing the input context rather than modifying model weights.", "why_it_matters": "GITCO: Gated Inference-Time Context Optimization in TSFMs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We propose improving TSFM accuracy at inference time by optimizing the input context rather than modifying model…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2606.05332", "difficulty": "intermediate" }, { "id": "arxiv:2604.11095v1", "source": "arxiv", "source_type": "preprint", "title": "Bottleneck Tokens for Unified Multimodal Retrieval", "abstract": "Adapting decoder-only multimodal large language models (MLLMs) for unified multimodal retrieval faces two structural gaps. First, existing methods rely on implicit pooling, which overloads the hidden state of a standard vocabulary token (e.g., ) as the sequence-level representation, a mechanism never designed for information aggregation. Second, contrastive fine-tuning specifies what the embedding should match but provides no token-level guidance on how information should be compressed into it. We address both gaps with two complementary components. Architecturally, we introduce Bottleneck Tokens (BToks), a small set of learnable tokens that serve as a fixed-capacity explicit pooling mechanism. For training, we propose Generative Information Condensation: a next-token prediction objective coupled with a Condensation Mask that severs the direct attention path from target tokens to query tokens. All predictive signals are thereby forced through the BToks, converting the generative loss into dense, token-level supervision for semantic compression. At inference time, only the input and BToks are processed in a single forward pass with negligible overhead over conventional last-token pooling. On MMEB-V2 (78 datasets, 3 modalities, 9 meta-tasks), our approach achieves state-of-the-art among 2B-scale methods under comparable data conditions, attaining an Overall score of 59.0 (+3.6 over VLM2Vec-V2) with substantial gains on semantically demanding tasks (e.g., +12.6 on Video-QA).", "authors": [ "Siyu Sun", "Jing Ren", "Zhaohe Liao", "Dongxiao Mao", "Xiangyuan Ren", "Yiyi Zhang", "Haohua Zhao", "Weixiong Lin", "Jiang Shaohua", "Liqing Zhang", "Yuchao Zheng" ], "year": 2026, "published_date": "2026-04-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.11095v1", "pdf_url": "https://arxiv.org/pdf/2604.11095v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "Multimodal", "Artificial Intelligence", "Fine-Tuning & PEFT" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses contrastive — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.34, "read_first_score": 5.0, "content_potential_score": 0.84, "interestingness_score": 2.09, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Adapting decoder-only multimodal large language models (MLLMs) for unified multimodal retrieval faces two structural gaps. First, existing methods rely on implicit pooling, which overloads the hidden state of a standard vocabulary token (e.g., ) as the sequence-level representation, a mechanism never designed for information aggregation.", "key_contribution": "Architecturally, we introduce Bottleneck Tokens (BToks), a small set of learnable tokens that serve as a fixed-capacity explicit pooling mechanism.", "why_it_matters": "Bottleneck Tokens for Unified Multimodal Retrieval represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Architecturally, we introduce Bottleneck Tokens (BToks), a small set of learnable tokens that serve as a fixed-capacity…", "biggest_caveat": "but provides no token-level guidance on how information should be compressed into it.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.11095v1", "difficulty": "advanced" }, { "id": "arxiv:2605.18437", "source": "arxiv", "source_type": "preprint", "title": "Heterogeneous Tasks Offloading in Vehicular Edge Computing: A Federated Meta Deep Reinforcement Learning Approach", "abstract": "Vehicular edge computing (VEC) enables latency-sensitive vehicular applications by offloading computation-intensive tasks to nearby edge servers. However, real-world vehicular workloads are typically modeled as heterogeneous directed acyclic graph (DAG) tasks with complex dependency structures, making joint offloading and resource allocation highly challenging. Moreover, distributed MEC deployment raises privacy concerns when collaboratively training learning-based policies. In this paper, we propose a Federated Meta Deep Reinforcement Learning framework with GAT-Seq2Seq modeling (FedMAGS) for heterogeneous task offloading in VEC systems. The proposed approach leverages Graph Attention Networks to capture DAG dependencies, a Seq2Seq-based policy to generate structured offloading decisions, and federated meta-learning to enable fast adaptation across distributed MEC servers without sharing raw data. Extensive simulations demonstrate that FedMAGS achieves faster convergence, lower execution delay, and better scalability compared with state-of-the-art baselines. In addition, the federated design preserves data privacy while reducing communication overhead, making the framework well suited for dynamic and large-scale VEC environments.", "authors": [ "Yaorong Huang", "Jingtao Luo", "Xuechao Wang" ], "year": 2026, "published_date": "2026-05-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.18437", "pdf_url": "https://arxiv.org/pdf/2605.18437", "citations": 0, "topics": [], "tags": [ "GNNs", "RL", "Machine Learning", "Distributed Computing" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (GNNs, RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.34, "read_first_score": 4.36, "content_potential_score": 2.68, "interestingness_score": 3.01, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Vehicular edge computing (VEC) enables latency-sensitive vehicular applications by offloading computation-intensive tasks to nearby edge servers. However, real-world vehicular workloads are typically modeled as heterogeneous directed acyclic graph (DAG) tasks with complex dependency structures, making joint offloading and resource allocation highly challenging.", "key_contribution": "In this paper, we propose a Federated Meta Deep Reinforcement Learning framework with GAT-Seq2Seq modeling (FedMAGS) for heterogeneous task offloading in VEC systems.", "why_it_matters": "Heterogeneous Tasks Offloading in Vehicular Edge Computing: A Federated Meta Deep Reinforcement Learning Approach represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about GNNs.", "one_line_takeaway": "In this paper, we propose a Federated Meta Deep Reinforcement Learning framework with GAT-Seq2Seq modeling (FedMAGS)…", "biggest_caveat": "buted MEC deployment raises privacy concerns when collaboratively training learning-based policies.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in GNNs.", "url": "https://arxiv.org/abs/2605.18437", "difficulty": "advanced" }, { "id": "arxiv:2605.29790", "source": "arxiv", "source_type": "preprint", "title": "Evolve as a Team: Collaborative Self-Evolution for LLM-based Multi-Agent Systems", "abstract": "LLM-based multi-agent systems (MAS) have emerged as an effective paradigm for complex and long-horizon tasks. However, in real-world tasks, MAS often exhibit various failures during execution and such failures are difficult to eliminate during design. This motivates experience-driven MAS evolution, where a system improves based on its own execution experience. Yet such evolution is challenging because MAS experience is prolonged and intricate, interleaving multiple agents' execution chains and communication messages, which makes it difficult to identify what should be improved. To address this challenge, we propose Meta-Team, an experience-driven MAS evolution framework based on collaborative self-evolution. Meta-Team preserves the execution context of each agent and coordinates post-task communication, enabling agents to exchange distributed evidence for evolution. Building on this design, Meta-Team conducts multi-scale self-evolution, transforming execution experience into reusable improvements to agent behaviors, inter-agent coordination, and team-level organization. Across six long-horizon agent benchmarks, Meta-Team consistently outperforms single-agent systems, hand-crafted MAS, and prior MAS evolution methods; further analyses demonstrate that Meta-Team enables more reliable and scalable MAS self-evolution.", "authors": [ "Zhezheng Hao", "Tianfu Wang", "Huanshuo Dong", "Ziyan Liu", "Hong Wang", "Xiankun Lin", "Qiang Lin", "Can Wang", "Hande Dong", "Jiawei Chen" ], "year": 2026, "published_date": "2026-05-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.29790", "pdf_url": "https://arxiv.org/pdf/2605.29790", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Artificial Intelligence", "Multi-Agent Systems" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.34, "read_first_score": 4.96, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "LLM-based multi-agent systems (MAS) have emerged as an effective paradigm for complex and long-horizon tasks. However, in real-world tasks, MAS often exhibit various failures during execution and such failures are difficult to eliminate during design.", "key_contribution": "To address this challenge, we propose Meta-Team, an experience-driven MAS evolution framework based on collaborative self-evolution.", "why_it_matters": "Evolve as a Team: Collaborative Self-Evolution for LLM-based Multi-Agent Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this challenge, we propose Meta-Team, an experience-driven MAS evolution framework based on collaborative…", "biggest_caveat": "However, in real-world tasks, MAS often exhibit various failures during execution and such failures are difficult to eliminate during design.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.29790", "difficulty": "beginner" }, { "id": "arxiv:2605.27766", "source": "arxiv", "source_type": "preprint", "title": "Got a Secret? LLM Agents Can't Keep It: Evaluating Privacy in Multi-Agent Systems", "abstract": "LLM safety evaluations predominantly test models in isolation, yet deployed AI agents increasingly operate within persistent social environments alongside other agents. We introduce a Moltbook-style simulation platform where thousands of LLM agents interact across communities over a simulated month, and use it to evaluate privacy as a downstream safety concern under varying degrees of social pressure. We find that shifting from single turn to multi turn social evaluation amplifies privacy violations (CIMemories 19.95% to Ours 45.30% across OpenAI models), that leakage is socially contagious, with agents 8 times more likely to disclose sensitive information after observing a peer do so, and that explicit privacy instructions reduce but do not eliminate this effect, leaving leakage rates above 37.8% even with safeguards. Our findings suggest that static chat based safety benchmarks systematically underestimate risks in agentic deployment, and that social context alone is sufficient to elicit sensitive disclosures that single turn evaluations would never surface.", "authors": [ "Aman Priyanshu", "Supriti Vijay", "Esha Pahwa" ], "year": 2026, "published_date": "2026-05-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.27766", "pdf_url": "https://arxiv.org/pdf/2605.27766", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Evaluation", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.34, "read_first_score": 4.89, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "LLM safety evaluations predominantly test models in isolation, yet deployed AI agents increasingly operate within persistent social environments alongside other agents. We introduce a Moltbook-style simulation platform where thousands of LLM agents interact across communities over a simulated month, and use it to evaluate privacy as a downstream safety concern under varying degrees of social pressure.", "key_contribution": "We introduce a Moltbook-style simulation platform where thousands of LLM agents interact across communities over a simulated month, and use it to evaluate privacy as a downstream safety concern under varying degrees of social pressure.", "why_it_matters": "Got a Secret? LLM Agents Can't Keep It: Evaluating Privacy in Multi-Agent Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce a Moltbook-style simulation platform where thousands of LLM agents interact across communities over a…", "biggest_caveat": "but do not eliminate this effect, leaving leakage rates above 37.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.27766", "difficulty": "beginner" }, { "id": "arxiv:2604.22892", "source": "arxiv", "source_type": "preprint", "title": "StackFeat RL: Reinforcement Learning over Iterative Dual Criterion Feature Selection for Stable Biomarker Discovery", "abstract": "Feature selection in high-dimensional genomic data ($d \\gg n$) demands methods that are simultaneously accurate, sparse, and stable. Existing approaches either require manual threshold specification (mRMR, stability selection), produce unstable selections under data perturbation (Lasso, Boruta), or ignore biological structure entirely. We introduce StackFeat-RL, a meta-learning framework that optimises the hyperparameters of an iterative dual-criterion feature selection algorithm via REINFORCE policy gradients. The dual criterion, requiring both coefficient consistency and selection frequency, guards against two failure modes missed by single-criterion methods, while iterative accumulation provides convergence guarantees via the law of large numbers. On COVID-19 miRNA data (GSE240888, 332 features) and three Alzheimer's disease classification tasks (GSE84422, 13237 genes; Normal vs.\\ Possible, Probable, and Definite AD), StackFeat-RL achieves the highest predictive accuracy among all evaluated methods, including ElasticNet, Boruta, mRMR, and stability selection, while requiring 3--4$\\times$ fewer features. Keywords: feature selection, reinforcement learning, REINFORCE, elastic net, biomarker discovery, Alzheimer's disease, dual-criterion selection, protein interaction networks", "authors": [ "A. Yermekov", "D. A. Herrera-Martí" ], "year": 2026, "published_date": "2026-04-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.22892", "pdf_url": "https://arxiv.org/pdf/2604.22892", "citations": 0, "topics": [], "tags": [ "RL", "Biomedical AI", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.34, "read_first_score": 4.7, "content_potential_score": 0.0, "interestingness_score": 1.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Feature selection in high-dimensional genomic data ($d \\gg n$) demands methods that are simultaneously accurate, sparse, and stable. Existing approaches either require manual threshold specification (mRMR, stability selection), produce unstable selections under data perturbation (Lasso, Boruta), or ignore biological structure entirely.", "key_contribution": "We introduce StackFeat-RL, a meta-learning framework that optimises the hyperparameters of an iterative dual-criterion feature selection algorithm via REINFORCE policy gradients.", "why_it_matters": "StackFeat RL: Reinforcement Learning over Iterative Dual Criterion Feature Selection for Stable Biomarker Discovery represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "We introduce StackFeat-RL, a meta-learning framework that optimises the hyperparameters of an iterative dual-criterion…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2604.22892", "difficulty": "advanced" }, { "id": "arxiv:2505.14479", "source": "arxiv", "source_type": "preprint", "title": "A Neuro-Symbolic Approach for Reliable Proof Generation with LLMs: A Case Study in Euclidean Geometry", "abstract": "Large language models (LLMs) struggle with formal domains that require rigorous logical deduction and symbolic reasoning, such as mathematical proof generation. We propose a neuro-symbolic approach that combines LLMs' generative strengths with structured components to overcome this challenge. As a proof of concept, we focus on SAT-level geometry problems. Our approach is two-fold: (1) We retrieve analogous problems and use their proofs to guide the LLM, and (2) a formal verifier evaluates the generated proofs and provides feedback, helping the model fix incorrect proofs. Our method significantly improves proof accuracy across diverse model families, achieving significant gains across all evaluated models: OpenAI o1, GPT-5, Gemini-Flash-2.5, and Claude Sonnet 4.6. Accuracy increases from 10% to 44% for the base models to 68% to 96% with our approach, with both analogous problem guidance and verifier feedback contributing to these improvements. More broadly, shifting to LLMs that generate provably correct conclusions has the potential to dramatically improve their reliability, accuracy and consistency, unlocking complex tasks and critical real-world applications that require trustworthiness.", "authors": [ "Oren Sultan", "Eitan Stern", "Dafna Shahaf" ], "year": 2026, "published_date": "2026-05-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2505.14479", "pdf_url": "https://arxiv.org/pdf/2505.14479", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Artificial Intelligence", "NLP" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 5.94, "content_potential_score": 0.0, "interestingness_score": 1.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models (LLMs) struggle with formal domains that require rigorous logical deduction and symbolic reasoning, such as mathematical proof generation. We propose a neuro-symbolic approach that combines LLMs' generative strengths with structured components to overcome this challenge.", "key_contribution": "We propose a neuro-symbolic approach that combines LLMs' generative strengths with structured components to overcome this challenge.", "why_it_matters": "A Neuro-Symbolic Approach for Reliable Proof Generation with LLMs: A Case Study in Euclidean Geometry represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose a neuro-symbolic approach that combines LLMs' generative strengths with structured components to overcome…", "biggest_caveat": "buting to these improvements.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2505.14479", "difficulty": "frontier" }, { "id": "arxiv:2507.06415", "source": "arxiv", "source_type": "preprint", "title": "PERK: Long-Context Reasoning as Test-Time Learning", "abstract": "Long-context reasoning requires accurately identifying relevant information in extensive, noisy input contexts. In this work, we propose PERK (Parameter Efficient Reasoning over Knowledge), a scalable approach for learning to encode long contexts using gradient updates at test time. Specifically, PERK employs two nested optimization loops in a meta-training phase. The inner loop rapidly encodes contexts into a low-rank adapter (LoRA) that serves as a parameter-efficient memory module for the base model. Concurrently, the outer loop learns to use the updated adapter to accurately recall and reason over relevant information from the encoded long context. Our evaluations on several long-context reasoning tasks show that PERK significantly outperforms the standard long-context finetuning, achieving average absolute performance gains of up to 20% for Qwen-2.5 (0.5B & 7B) on synthetic and real-world long-context reasoning. PERK also maintains its advantages across model scales and families. Compared to specialized long-context LLMs, PERK matches or surpasses their performance. Finally, our analyses show PERK is more robust to reasoning complexity, length extrapolation, and the positions of relevant information in contexts. https://perk-long-context.web.app", "authors": [ "Zeming Chen", "Angelika Romanou", "Gail Weiss", "Antoine Bosselut" ], "year": 2026, "published_date": "2026-08-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2507.06415", "pdf_url": "https://arxiv.org/pdf/2507.06415", "citations": 0, "topics": [], "tags": [ "Reasoning", "Long Context", "Fine-Tuning", "Info Extraction", "Adversarial" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 5.06, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Long-context reasoning requires accurately identifying relevant information in extensive, noisy input contexts. In this work, we propose PERK (Parameter Efficient Reasoning over Knowledge), a scalable approach for learning to encode long contexts using gradient updates at test time.", "key_contribution": "In this work, we propose PERK (Parameter Efficient Reasoning over Knowledge), a scalable approach for learning to encode long contexts using gradient updates at test time.", "why_it_matters": "PERK: Long-Context Reasoning as Test-Time Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "In this work, we propose PERK (Parameter Efficient Reasoning over Knowledge), a scalable approach for learning to…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2507.06415", "difficulty": "intermediate" }, { "id": "arxiv:2608.25872", "source": "arxiv", "source_type": "preprint", "title": "VISTA: Visually Inferred Spatial ConTact Attention for Contact-Rich Manipulation", "abstract": "Contact-rich manipulation requires precise interaction feedback. While vision-centric imitation learning is prevalent, external visual observations provide indirect and ambiguous cues about contact states, particularly under occlusion or subtle object--gripper interactions; dedicated tactile or force sensors can provide rich contact information but introduce additional hardware complexity, calibration requirements, and deployment costs. To bridge this gap, we propose VISTA-Policy, an imitation learning paradigm that utilizes the Visual Deformation Field (VDF), a 3D displacement representation of a compliant gripper, as high-dimensional visuo-physical feedback. The framework integrates: 1) a Physics-Aware Encoding Engine for real-time VDF decoding; 2) an Energy Aggregation Denoising Mechanism to isolate true interaction signals; and 3) a Deformation-Augmented Policy Network with incremental gripper actions for precise closed-loop correction. Extensive evaluations on Cross-Scale Object Grasping, Cap Unscrewing, and Calligraphy Writing demonstrate that VISTA-Policy outperforms the strong pure-vision baseline 3D Diffusion Policy and the tactile baseline. VISTA-Policy further demonstrates substantial out-of-distribution generalization to unseen object scales and robustness against dynamic disturbances, offering a durable and cost-effective route toward general-purpose fine-grained manipulation in unstructured environments. Project videos and supplementary materials are available at: https://sites.google.com/view/vista-policy.", "authors": [ "Jiayi Chen", "Wenlong Dong", "Yan Huang", "Xianglin Chen", "Zijian Lin", "Jiaqi Yin", "Yushan Liu", "Wenbo Ding" ], "year": 2026, "published_date": "2026-08-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.25872", "pdf_url": "https://arxiv.org/pdf/2608.25872", "citations": 0, "topics": [], "tags": [ "Robotics" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 4.43, "content_potential_score": 2.1, "interestingness_score": 2.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Contact-rich manipulation requires precise interaction feedback. While vision-centric imitation learning is prevalent, external visual observations provide indirect and ambiguous cues about contact states, particularly under occlusion or subtle object--gripper interactions; dedicated tactile or force sensors can provide rich contact information but introduce additional hardware complexity, calibration requirements, and deployment costs.", "key_contribution": "While vision-centric imitation learning is prevalent, external visual observations provide indirect and ambiguous cues about contact states, particularly under occlusion or subtle object--gripper interactions; dedicated tactile or force sensors can provide rich contact information but introduce additional hardware complexity, calibration requirements, and deployment costs.", "why_it_matters": "VISTA: Visually Inferred Spatial ConTact Attention for Contact-Rich Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "While vision-centric imitation learning is prevalent, external visual observations provide indirect and ambiguous cues…", "biggest_caveat": "but introduce additional hardware complexity, calibration requirements, and deployment costs.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2608.25872", "difficulty": "intermediate" }, { "id": "arxiv:2608.11420", "source": "arxiv", "source_type": "preprint", "title": "Social Chain of Thought: A Multi-Agent Architecture Grounded in Medical Differential Diagnosis Methodology", "abstract": "Medical diagnostic reasoning is a high-impact use case for LLMs that carries significant implications for the health and wellbeing of users. When OpenAI (2026) reports that more than 5% of ChatGPT messages globally are healthcare-related, the transparency of these systems becomes a serious design concern. This is especially true for complex cases, where differential diagnosis often requires integrating multiple forms of specialist reasoning. Existing work has proposed multi-agent approaches to medical diagnosis, but it remains unclear when such systems are needed, why they help, and where they outperform monolithic inference. We introduce Social Chain of Thought (SCoT),a multi-round pipeline for medical differential diagnosis that structures multi-agent interaction as a deliberative framework for collabora. tive LLM reasoning. Evaluating SCoT against single-agent baselines, one-agent pipeline ablations, and best-of-n scaling, we show that its recall advantage is not reproduced by monolithic inference alone. SCoT is most successful in the hardest diagnostic cases, where multiple rounds of specialist conversation help recover ground-truth diagnoses and converge on a higher-recall differential.", "authors": [ "Del Coburn", "Scott Sanner", "Dan Silver" ], "year": 2026, "published_date": "2026-08-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.11420", "pdf_url": "https://arxiv.org/pdf/2608.11420", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Dialogue", "Artificial Intelligence", "NLP" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 5.02, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Medical diagnostic reasoning is a high-impact use case for LLMs that carries significant implications for the health and wellbeing of users. When OpenAI (2026) reports that more than 5% of ChatGPT messages globally are healthcare-related, the transparency of these systems becomes a serious design concern.", "key_contribution": "Existing work has proposed multi-agent approaches to medical diagnosis, but it remains unclear when such systems are needed, why they help, and where they outperform monolithic inference.", "why_it_matters": "Social Chain of Thought: A Multi-Agent Architecture Grounded in Medical Differential Diagnosis Methodology represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Existing work has proposed multi-agent approaches to medical diagnosis, but it remains unclear when such systems are…", "biggest_caveat": "but it remains unclear when such systems are needed, why they help, and where they outperform monolithic inference.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.11420", "difficulty": "intermediate" }, { "id": "arxiv:2512.07901", "source": "arxiv", "source_type": "preprint", "title": "The Theory of Strategic Evolution: Games with Endogenous Players and Strategic Replicators", "abstract": "Von Neumann founded both game theory and the theory of self-reproducing automata, but the two programs never merged. This paper provides the synthesis. The Theory of Strategic Evolution analyzes strategic replicators: entities that optimize under resource constraints and spawn copies of themselves. We introduce Games with Endogenous Players (GEPs), where lineages (not instances) are the fundamental strategic units, and define Evolutionarily Stable Distributions of Intelligence (ESDIs) as the resulting equilibrium concept. The central mathematical object is a hierarchy of strategic layers linked by cross-level gain matrices. Under a small-gain condition (spectral radius less than one), the system admits a global Lyapunov function at every finite depth. We prove closure under meta-selection: adding governance levels, innovation, or constitutional evolution preserves the dynamical structure. The Alignment Impossibility Theorem shows that unrestricted self-modification destroys this structure; stable alignment requires bounded modification classes. Applications include AI deployment dynamics, market concentration, and institutional design. The framework shows why personality engineering fails under selection pressure and identifies constitutional constraints necessary for stable multi-agent systems.", "authors": [ "Kevin Vallier" ], "year": 2026, "published_date": "2026-07-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2512.07901", "pdf_url": "https://arxiv.org/pdf/2512.07901", "citations": 0, "topics": [], "tags": [ "AI Safety", "Game Theory", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 3.26, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Von Neumann founded both game theory and the theory of self-reproducing automata, but the two programs never merged. This paper provides the synthesis.", "key_contribution": "We introduce Games with Endogenous Players (GEPs), where lineages (not instances) are the fundamental strategic units, and define Evolutionarily Stable Distributions of Intelligence (ESDIs) as the resulting equilibrium concept.", "why_it_matters": "The Theory of Strategic Evolution: Games with Endogenous Players and Strategic Replicators represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We introduce Games with Endogenous Players (GEPs), where lineages (not instances) are the fundamental strategic units,…", "biggest_caveat": "but the two programs never merged.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2512.07901", "difficulty": "frontier" }, { "id": "arxiv:2608.03061", "source": "arxiv", "source_type": "preprint", "title": "Scalable Exact Densest P-Partite Subgraph Search in Heterogeneous Information Networks", "abstract": "Heterogeneous information networks (HINs) model typed entities and typed relations, where dense cross-type structures can reveal cohesive semantic patterns such as prolific author-paper-venue groups. Given a query meta-path, the densest P-partite subgraph search (DPpS) problem jointly selects a nonempty vertex set at each typed position and maximizes the number of induced meta-path instances normalized by the geometric mean of the selected set sizes. Existing exact methods solve DPpS by searching over iRM-sets and reducing each fixed-M problem to minimum-cut computations. However, their scalability is limited by the large number of candidate iRM-sets and the high cost of repeatedly solving large auxiliary networks. In this paper, we propose BoxDPpS, an efficient exact approach that reduces both sources of cost. It performs box-level search with safe region pruning, eliminates redundant representations of the same iRM-set, improves early pruning through bounded warm-up, and compresses each fixed-M auxiliary network for exact parametric pseudoflow solving. Experiments on seven real-world datasets show that BoxDPpS preserves the exact DPpS optimum while achieving an average speedup of 27.04x over the state-of-the-art method.", "authors": [ "Jiadong Xie", "Jiaming Yang", "Kangfei Zhao", "Jeffrey Xu Yu" ], "year": 2026, "published_date": "2026-08-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.03061", "pdf_url": "https://arxiv.org/pdf/2608.03061", "citations": 0, "topics": [], "tags": [ "Model Compression", "Databases" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 5.07, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Heterogeneous information networks (HINs) model typed entities and typed relations, where dense cross-type structures can reveal cohesive semantic patterns such as prolific author-paper-venue groups. Given a query meta-path, the densest P-partite subgraph search (DPpS) problem jointly selects a nonempty vertex set at each typed position and maximizes the number of induced meta-path instances normalized by the geometric mean of the selected set sizes.", "key_contribution": "In this paper, we propose BoxDPpS, an efficient exact approach that reduces both sources of cost.", "why_it_matters": "Scalable Exact Densest P-Partite Subgraph Search in Heterogeneous Information Networks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Model Compression.", "one_line_takeaway": "In this paper, we propose BoxDPpS, an efficient exact approach that reduces both sources of cost.", "biggest_caveat": "However, their scalability is limited by the large number of candidate iRM-sets and the high cost of repeatedly solving large auxiliary networks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Model Compression.", "url": "https://arxiv.org/abs/2608.03061", "difficulty": "intermediate" }, { "id": "arxiv:2508.02929", "source": "arxiv", "source_type": "preprint", "title": "Realizing Scaling Laws in Recommender Systems: A Foundation-Expert Paradigm for Hyperscale Model Deployment", "abstract": "Scaling laws have been established for recommender systems, yet efficiently deploying foundation model (FM) across multiple recommendation surfaces remains a major unsolved challenge. Existing methods for transfer learning face fundamental limitations in this setting: knowledge distillation suffers from transfer fidelity degradation in the large-data regime, and static user or item embeddings lack the expressiveness to capture contextualized user-item interactions. We propose the Foundation-Expert paradigm, where a central FM generates target-aware embeddings which are ingested by lightweight surface-specific expert models. Target-aware embeddings are representations that dynamically capture a user's interest in a specific item conditioned on their full interaction history. Unlike knowledge distillation, which transfers FM knowledge as soft labels, our approach provides these embeddings as input features to each expert model, enabling direct interaction with surface-specific representations. This paradigm achieves transfer ratios of 0.64--1.0 from FM to experts, substantially exceeding existing methods. Fully deployed at Meta serving tens of billions of daily requests since 2025, it delivers 0.050% statistically significant online topline metric improvement and 0.359% cumulative gains across multiple surfaces.", "authors": [ "Dai Li", "Kevin Course", "Wei Li", "Hongwei Li", "Jie Hua", "Yiqi Chen", "Zhao Zhu", "Rui Jian", "Xuan Cao", "Bi Xue", "Yu Shi", "Jing Qian", "Kai Ren", "Matt Ma", "Qunshu Zhang", "Rui Li" ], "year": 2026, "published_date": "2026-07-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2508.02929", "pdf_url": "https://arxiv.org/pdf/2508.02929", "citations": 0, "topics": [], "tags": [ "Model Compression", "Information Retrieval", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 5.06, "content_potential_score": 1.84, "interestingness_score": 2.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Scaling laws have been established for recommender systems, yet efficiently deploying foundation model (FM) across multiple recommendation surfaces remains a major unsolved challenge. Existing methods for transfer learning face fundamental limitations in this setting: knowledge distillation suffers from transfer fidelity degradation in the large-data regime, and static user or item embeddings lack the expressiveness to capture contextualized user-item interactions.", "key_contribution": "We propose the Foundation-Expert paradigm, where a central FM generates target-aware embeddings which are ingested by lightweight surface-specific expert models.", "why_it_matters": "Realizing Scaling Laws in Recommender Systems: A Foundation-Expert Paradigm for Hyperscale Model Deployment improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about Model Compression.", "one_line_takeaway": "We propose the Foundation-Expert paradigm, where a central FM generates target-aware embeddings which are ingested by…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Model Compression.", "url": "https://arxiv.org/abs/2508.02929", "difficulty": "intermediate" }, { "id": "arxiv:2607.23408", "source": "arxiv", "source_type": "preprint", "title": "NeurGO: Learning to Generate Elite Candidates for Meta-Black-Box Expensive Optimization", "abstract": "Expensive black-box optimization is ubiquitous in science and engineering, where function evaluations are costly and the evaluation budget is limited. Traditional evolutionary algorithms and Meta-BlackBox Optimization (MetaBBO) approaches typically consume most evaluations on candidate selection, often wasting precious budget on inferior solutions. Although surrogate-assisted evolution and Bayesian optimization aim to reduce evaluations through surrogate models, constructing an accurate global model from limited data remains challenging, and model bias can easily trap the search in local optima. To overcome these limitations, we propose NeurGO, a generative MetaBBO framework that directly synthesizes elite candidates from historical population states. Specifically, we employ an attention-based encoder to capture the population-level search trend and condition a decoder on this representation to generate high-quality candidates, avoiding the expensive evaluation of large offspring pools. We then design a quality-diversity loss to maintain solution quality and population diversity throughout the search. Through extensive benchmarking on CEC 2008 and the COCO BBOB test suites, our method achieves better optimization performance under the same evaluation budget and exhibits faster convergence.", "authors": [ "Jintao He", "Huixiang Zhen", "Wenyin Gong" ], "year": 2026, "published_date": "2026-07-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.23408", "pdf_url": "https://arxiv.org/pdf/2607.23408", "citations": 0, "topics": [], "tags": [ "Fairness & Ethics", "Evaluation", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 4.95, "content_potential_score": 0.0, "interestingness_score": 1.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Expensive black-box optimization is ubiquitous in science and engineering, where function evaluations are costly and the evaluation budget is limited. Traditional evolutionary algorithms and Meta-BlackBox Optimization (MetaBBO) approaches typically consume most evaluations on candidate selection, often wasting precious budget on inferior solutions.", "key_contribution": "To overcome these limitations, we propose NeurGO, a generative MetaBBO framework that directly synthesizes elite candidates from historical population states.", "why_it_matters": "NeurGO: Learning to Generate Elite Candidates for Meta-Black-Box Expensive Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fairness & Ethics.", "one_line_takeaway": "To overcome these limitations, we propose NeurGO, a generative MetaBBO framework that directly synthesizes elite…", "biggest_caveat": "limitations, we propose NeurGO, a generative MetaBBO framework that directly synthesizes elite candidates from historical population states.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Fairness & Ethics.", "url": "https://arxiv.org/abs/2607.23408", "difficulty": "frontier" }, { "id": "arxiv:2606.29270", "source": "arxiv", "source_type": "preprint", "title": "Minority Sentinel: When to Overturn Majority Voting in Multi-Agent LLM Debates", "abstract": "Multi-Agent Debate (MAD) with Majority Voting is a dominant paradigm for improving LLM reasoning, yet its effectiveness rests on the Condorcet Jury Theorem's assumption of independent errors. Because contemporary LLMs share similar pretraining corpora, their errors are strongly correlated, causing the majority to systematically suppress correct minority opinions, a phenomenon we term Minority Truth. Through debates among three heterogeneous LLM agents on six benchmarks, we find that roughly one in four divergent cases has the minority holding the correct answer, yielding a 10-percentage-point theoretical recovery margin. We propose Minority Sentinel, a lightweight meta-classifier that extracts a multi-dimensional debate fingerprint from debate logs and trains a LightGBM model to decide when to overturn majority voting. Minority Sentinel achieves a stable Flip Precision of 81.2% with positive Net Gain across all six datasets and all 20 random seed trials, demonstrating that debate logs contain sufficient behavioral signals for a non-LLM classifier to reliably recover suppressed minorities without degrading system accuracy. The LLM-as-Judge baseline yields negative Net Gain despite higher recall, confirming that flip safety, not recovery volume, determines intervention value.", "authors": [ "Chuan He", "Zebin Chen", "Zhengyi Yang", "Shaobo Qiao", "Mingchen Ju", "Jiate Liu", "Dong Wen", "Guanfeng Liu" ], "year": 2026, "published_date": "2026-06-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.29270", "pdf_url": "https://arxiv.org/pdf/2606.29270", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Self-Supervised", "Evaluation", "Multi-Agent Systems" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 4.32, "content_potential_score": 0.0, "interestingness_score": 1.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multi-Agent Debate (MAD) with Majority Voting is a dominant paradigm for improving LLM reasoning, yet its effectiveness rests on the Condorcet Jury Theorem's assumption of independent errors. Because contemporary LLMs share similar pretraining corpora, their errors are strongly correlated, causing the majority to systematically suppress correct minority opinions, a phenomenon we term Minority Truth.", "key_contribution": "We propose Minority Sentinel, a lightweight meta-classifier that extracts a multi-dimensional debate fingerprint from debate logs and trains a LightGBM model to decide when to overturn majority voting.", "why_it_matters": "Minority Sentinel: When to Overturn Majority Voting in Multi-Agent LLM Debates represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose Minority Sentinel, a lightweight meta-classifier that extracts a multi-dimensional debate fingerprint from…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.29270", "difficulty": "frontier" }, { "id": "arxiv:2605.06215", "source": "arxiv", "source_type": "preprint", "title": "FunctionalAgent: Towards end-to-end on-top functional design", "abstract": "Multiconfiguration pair-density functional theory (MC-PDFT) offers an efficient and accurate framework for computing electronic energies in strongly correlated molecular systems, with the quality of the on-top functional being a key determinant of its predictive accuracy. Here we introduce FunctionalAgent, an agentic system for fully automated functional development. FunctionalAgent orchestrates a team of specialized sub-agents to decompose the development process into dataset construction, active-space generation, MCSCF calculation and descriptor generation, loss-function construction, and functional fitting, optimization, and evaluation, thereby linking all stages into a closed-loop automated workflow. Using FunctionalAgent, we developed MC26, a hybrid meta-GGA on-top functional that achieves improved overall accuracy on the training set compared with other methods evaluated on the same benchmark dataset. We further introduce COF26, a new functional form that, owing to the optimized training process, achieves the best performance on both the training and test sets.", "authors": [ "Yuhao Chen", "Donald G. Truhlar", "Xiao He" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.06215", "pdf_url": "https://arxiv.org/pdf/2605.06215", "citations": 0, "topics": [], "tags": [ "AI Agents", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 5.26, "content_potential_score": 1.5, "interestingness_score": 2.42, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multiconfiguration pair-density functional theory (MC-PDFT) offers an efficient and accurate framework for computing electronic energies in strongly correlated molecular systems, with the quality of the on-top functional being a key determinant of its predictive accuracy. Here we introduce FunctionalAgent, an agentic system for fully automated functional development.", "key_contribution": "Here we introduce FunctionalAgent, an agentic system for fully automated functional development.", "why_it_matters": "FunctionalAgent: Towards end-to-end on-top functional design represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "Here we introduce FunctionalAgent, an agentic system for fully automated functional development.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2605.06215", "difficulty": "beginner" }, { "id": "arxiv:2603.17837", "source": "arxiv", "source_type": "preprint", "title": "The Silent Thought: Modeling Internal Cognition in Full-Duplex Spoken Dialogue Models via Latent Reasoning", "abstract": "During conversational interactions, humans subconsciously engage in concurrent thinking while listening to a speaker. Although this internal cognitive processing may not always manifest as explicit linguistic structures, it is instrumental in formulating high-quality responses. Inspired by this cognitive phenomenon, we propose a novel Full-duplex LAtent and Internal Reasoning method named FLAIR that conducts latent thinking simultaneously with speech perception. Unlike conventional \"thinking\" mechanisms in NLP, which require post-hoc generation, our approach aligns seamlessly with spoken dialogue systems: during the user's speaking phase, it recursively feeds the latent embedding output from the previous step into the next step, enabling continuous reasoning that strictly adheres to causality without introducing additional latency. To enable this latent reasoning, we design an Evidence Lower Bound-based objective that supports efficient supervised finetuning via teacher forcing, circumventing the need for explicit reasoning annotations. Experiments demonstrate the effectiveness of this think-while-listening design, which achieves competitive results on a range of speech benchmarks. Furthermore, FLAIR robustly handles conversational dynamics and attains competitive performance on full-duplex interaction metrics.", "authors": [ "Donghang Wu", "Tianyu Zhang", "Yuxin Li", "Hexin Liu", "Chen Chen", "Eng Siong Chng", "Yoshua Bengio" ], "year": 2026, "published_date": "2026-05-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.17837", "pdf_url": "https://arxiv.org/pdf/2603.17837", "citations": 0, "topics": [], "tags": [ "Reasoning", "Dialogue", "Evaluation", "NLP" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 5.64, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "During conversational interactions, humans subconsciously engage in concurrent thinking while listening to a speaker. Although this internal cognitive processing may not always manifest as explicit linguistic structures, it is instrumental in formulating high-quality responses.", "key_contribution": "Inspired by this cognitive phenomenon, we propose a novel Full-duplex LAtent and Internal Reasoning method named FLAIR that conducts latent thinking simultaneously with speech perception.", "why_it_matters": "The Silent Thought: Modeling Internal Cognition in Full-Duplex Spoken Dialogue Models via Latent Reasoning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Inspired by this cognitive phenomenon, we propose a novel Full-duplex LAtent and Internal Reasoning method named FLAIR…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2603.17837", "difficulty": "beginner" }, { "id": "arxiv:2606.01770", "source": "arxiv", "source_type": "preprint", "title": "Adaptive Auto-Harness: Sustained Self-Improvement for Agentic System Deployment on Open-Ended Task Streams", "abstract": "Auto-harness systems such as A-Evolve, GEPA, and Meta-Harness improve LLM agents by optimizing prompts, skills, tools, memories, and supporting infrastructure from execution feedback, but they are typically evaluated on fixed offline benchmarks. Real deployments instead present open-ended task streams: histories grow without a fixed endpoint, heterogeneous tasks require different harnesses, and problem distributions shift over time. These challenges make a single repeatedly and densely updated harness brittle, causing performance degradation as accuracy peaks early and then declines. This motivates sustained harness construction with task-wise adaptation. We introduce Adaptive Auto-Harness, a framework and system for such streams. The framework decomposes the gap to an oracle harness into evolution loss and adaptation loss. The system addresses these losses with a stateful multi-agent evolver, a harness tree with solve-time routing, and human-steering hooks for cases where history lacks the needed signal. Across prediction-market, security-competition, and event-forecasting streams, Adaptive Auto-Harness outperforms five existing auto-harness baselines and ablations attribute gains to better construction, routing, or targeted human steering. Code is available in \\href{https://github.com/A-EVO-Lab/a-evolve/tree/release/adaptive-auto-harness}{Link}.", "authors": [ "Zewen Liu", "Zhan Shi", "Yisi Sang", "Bing He", "Minhua Lin", "Tianxin Wei", "Dakuo Wang", "Benoit Dumoulin", "Wei Jin", "Hanqing Lu" ], "year": 2026, "published_date": "2026-06-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.01770", "pdf_url": "https://arxiv.org/pdf/2606.01770", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 4.96, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Auto-harness systems such as A-Evolve, GEPA, and Meta-Harness improve LLM agents by optimizing prompts, skills, tools, memories, and supporting infrastructure from execution feedback, but they are typically evaluated on fixed offline benchmarks. Real deployments instead present open-ended task streams: histories grow without a fixed endpoint, heterogeneous tasks require different harnesses, and problem distributions shift over time.", "key_contribution": "Real deployments instead present open-ended task streams: histories grow without a fixed endpoint, heterogeneous tasks require different harnesses, and problem distributions shift over time.", "why_it_matters": "Adaptive Auto-Harness: Sustained Self-Improvement for Agentic System Deployment on Open-Ended Task Streams represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Real deployments instead present open-ended task streams: histories grow without a fixed endpoint, heterogeneous tasks…", "biggest_caveat": "but they are typically evaluated on fixed offline benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.01770", "difficulty": "beginner" }, { "id": "arxiv:2605.19592", "source": "arxiv", "source_type": "preprint", "title": "Implicit Action Chunking for Smooth Continuous Control", "abstract": "Reinforcement learning often produces high-frequency oscillatory control signals that undermine the safety and stability required for physical deployment. Explicit action chunking addresses this by predicting fixed-horizon trajectories but scales the policy output dimension proportionally with the horizon length, leading to optimization difficulties and incompatibility with standard step-wise interaction. To overcome these challenges, this paper proposes Dual-Window Smoothing (DWS), an implicit action chunking framework for smooth continuous control. Unlike explicit methods, DWS enforces temporal coherence without expanding the action space. It uses a dual-window design: an execution window that ensures physical smoothness through deterministic modulation, and a value window that aligns temporal-difference targets over the horizon to correct critic bias caused by open-loop execution. DWS also includes a lightweight actor-side temporal regularizer based on first-order action differences to promote global continuity. This design effectively bridges the gap between temporal abstraction and reactive step-wise control. Experiments on benchmarks including the DeepMind Control Suite and industrial energy management tasks show that DWS outperforms state-of-the-art (SOTA) baselines. In complex vision-based autonomous driving tasks, DWS achieves smoother control, safer behavior with reduced jitter, and attains a 100% success rate.", "authors": [ "Bosun Liang", "Shuo Pei", "Zirui Chen", "Chuanzhi Fan", "Chen Sun", "Yuankai Wu", "Huachun Tan", "Yong Wang" ], "year": 2026, "published_date": "2026-05-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.19592", "pdf_url": "https://arxiv.org/pdf/2605.19592", "citations": 0, "topics": [], "tags": [ "RL", "Robotics", "Fairness & Ethics", "Evaluation", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 5.04, "content_potential_score": 1.0, "interestingness_score": 2.17, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reinforcement learning often produces high-frequency oscillatory control signals that undermine the safety and stability required for physical deployment. Explicit action chunking addresses this by predicting fixed-horizon trajectories but scales the policy output dimension proportionally with the horizon length, leading to optimization difficulties and incompatibility with standard step-wise interaction.", "key_contribution": "Experiments on benchmarks including the DeepMind Control Suite and industrial energy management tasks show that DWS outperforms state-of-the-art (SOTA) baselines.", "why_it_matters": "Implicit Action Chunking for Smooth Continuous Control represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "Experiments on benchmarks including the DeepMind Control Suite and industrial energy management tasks show that DWS…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2605.19592", "difficulty": "beginner" }, { "id": "arxiv:2604.20111v1", "source": "arxiv", "source_type": "preprint", "title": "Meta Additive Model: Interpretable Sparse Learning With Auto Weighting", "abstract": "Sparse additive models have attracted much attention in high-dimensional data analysis due to their flexible representation and strong interpretability. However, most existing models are limited to single-level learning under the mean-squared error criterion, whose empirical performance can degrade significantly in the presence of complex noise, such as non-Gaussian perturbations, outliers, noisy labels, and imbalanced categories. The sample reweighting strategy is widely used to reduce the model's sensitivity to atypical data; however, it typically requires prespecifying the weighting functions and manually selecting additional hyperparameters. To address this issue, we propose a new meta additive model (MAM) based on the bilevel optimization framework, which learns data-driven weighting of individual losses by parameterizing the weighting function via an MLP trained on meta data. MAM is capable of a variety of learning tasks, including variable selection, robust regression estimation, and imbalanced classification. Theoretically, MAM provides guarantees on convergence in computation, algorithmic generalization, and variable selection consistency under mild conditions. Empirically, MAM outperforms several state-of-the-art additive models on both synthetic and real-world data under various data corruptions.", "authors": [ "Xuelin Zhang", "Xinyue Liu", "Lingjuan Wu", "Hong Chen" ], "year": 2026, "published_date": "2026-04-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.20111v1", "pdf_url": "https://arxiv.org/pdf/2604.20111v1", "citations": 0, "topics": [], "tags": [ "Interpretability", "Artificial Intelligence", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 5.89, "content_potential_score": 0.0, "interestingness_score": 1.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Sparse additive models have attracted much attention in high-dimensional data analysis due to their flexible representation and strong interpretability. However, most existing models are limited to single-level learning under the mean-squared error criterion, whose empirical performance can degrade significantly in the presence of complex noise, such as non-Gaussian perturbations, outliers, noisy labels, and imbalanced categories.", "key_contribution": "To address this issue, we propose a new meta additive model (MAM) based on the bilevel optimization framework, which learns data-driven weighting of individual losses by parameterizing the weighting function via an MLP trained on meta data.", "why_it_matters": "Meta Additive Model: Interpretable Sparse Learning With Auto Weighting represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Interpretability.", "one_line_takeaway": "To address this issue, we propose a new meta additive model (MAM) based on the bilevel optimization framework, which…", "biggest_caveat": "however, it typically requires prespecifying the weighting functions and manually selecting additional hyperparameters.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Interpretability.", "url": "http://arxiv.org/abs/2604.20111v1", "difficulty": "intermediate" }, { "id": "arxiv:2509.19102", "source": "arxiv", "source_type": "preprint", "title": "FUNCanon: Learning Pose-Aware Action Primitives via Functional Object Canonicalization for Generalizable Robotic Manipulation", "abstract": "General-purpose robotic skills from end-to-end demonstrations often leads to task-specific policies that fail to generalize beyond the training distribution. Therefore, we introduce FunCanon, a framework that converts long-horizon manipulation tasks into sequences of action chunks, each defined by an actor, verb, and object. These chunks focus policy learning on the actions themselves, rather than isolated tasks, enabling compositionality and reuse. To make policies pose-aware and category-general, we perform functional object canonicalization for functional alignment and automatic manipulation trajectory transfer, mapping objects into shared functional frames using affordance cues from large vision language models. An object centric and action centric diffusion policy FuncDiffuser trained on this aligned data naturally respects object affordances and poses, simplifying learning and improving generalization ability. Experiments on simulated and real-world benchmarks demonstrate category-level generalization, cross-task behavior reuse, and robust sim2real deployment, showing that functional canonicalization provides a strong inductive bias for scalable imitation learning in complex manipulation domains. Details of the demo and supplemental material are available on our project website https://sites.google.com/view/funcanon.", "authors": [ "Hongli Xu", "Lei Zhang", "Xiaoyue Hu", "Boyang Zhong", "Kaixin Bai", "Zoltán-Csaba Márton", "Zhenshan Bing", "Zhaopeng Chen", "Alois Christian Knoll", "Jianwei Zhang" ], "year": 2026, "published_date": "2026-05-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.19102", "pdf_url": "https://arxiv.org/pdf/2509.19102", "citations": 0, "topics": [], "tags": [ "AI Safety", "VLMs", "Robotics", "Fairness & Ethics", "Evaluation" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 4.96, "content_potential_score": 1.55, "interestingness_score": 2.44, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "General-purpose robotic skills from end-to-end demonstrations often leads to task-specific policies that fail to generalize beyond the training distribution. Therefore, we introduce FunCanon, a framework that converts long-horizon manipulation tasks into sequences of action chunks, each defined by an actor, verb, and object.", "key_contribution": "Therefore, we introduce FunCanon, a framework that converts long-horizon manipulation tasks into sequences of action chunks, each defined by an actor, verb, and object.", "why_it_matters": "FUNCanon: Learning Pose-Aware Action Primitives via Functional Object Canonicalization for Generalizable Robotic Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "Therefore, we introduce FunCanon, a framework that converts long-horizon manipulation tasks into sequences of action…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2509.19102", "difficulty": "beginner" }, { "id": "arxiv:2605.07468", "source": "arxiv", "source_type": "preprint", "title": "Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width", "abstract": "We prove that every class of Eulerian directed graphs of bounded carving width (equivalently of bounded degree and treewidth) is well-quasi-ordered by strong immersion. In fact, we prove a stronger result, namely that every class of Eulerian directed graphs of bounded carving width, where every vertex is additionally labeled from a well-quasi-order, fixes a linear order on its incident edges, and may impose further restrictions on how the immersion is allowed to route paths through it, is well-quasi-ordered by an adequate notion of strong immersion. To this extent, we develop a framework seemingly suited to prove well-quasi-ordering for classes of Eulerian directed graphs by (strong) immersion and present a first meta theorem in that direction. We complement our results by observing that the class of Eulerian directed graphs of unbounded degree is \\emph{not} well-quasi-ordered by \\emph{strong} immersion, even if we assume the treewidth of the class to be at most two. We conclude with a dichotomy result, proving for a very restricted class of Eulerian directed graphs of unbounded degree that it is not well-quasi-ordered by strong immersion, but it is well-quasi-ordered by weak immersion.", "authors": [ "Dario Cavallaro", "Ken-ichi Kawarabayashi", "Stephan Kreutzer" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.07468", "pdf_url": "https://arxiv.org/pdf/2605.07468", "citations": 0, "topics": [], "tags": [], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.33, "read_first_score": 3.67, "content_potential_score": 0.0, "interestingness_score": 1.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We prove that every class of Eulerian directed graphs of bounded carving width (equivalently of bounded degree and treewidth) is well-quasi-ordered by strong immersion. In fact, we prove a stronger result, namely that every class of Eulerian directed graphs of bounded carving width, where every vertex is additionally labeled from a well-quasi-order, fixes a linear order on its incident edges, and may impose further restrictions on how the immersion is allowed to route paths through it, is well-quasi-ordered by an adequate notion of strong immersion.", "key_contribution": "To this extent, we develop a framework seemingly suited to prove well-quasi-ordering for classes of Eulerian directed graphs by (strong) immersion and present a first meta theorem in that direction.", "why_it_matters": "Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "To this extent, we develop a framework seemingly suited to prove well-quasi-ordering for classes of Eulerian directed…", "biggest_caveat": "but it is well-quasi-ordered by weak immersion.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2605.07468", "difficulty": "frontier" }, { "id": "arxiv:2609.14858", "source": "arxiv", "source_type": "preprint", "title": "Dream-RSI: Recursive Self-Improvement through Evolving Worlds", "abstract": "Recursive self-improvement is becoming increasingly vital for autonomous AI agents, where progress hinges on discovering high-value solutions across complex domains. The driver of this process is effective exploration, however, managing and improving exploration strategies remains a major bottleneck. Current systems face a fundamental dilemma: fixed strategies fail to adapt as search spaces scale, while online policy optimization requires navigating vast meta-search spaces under delayed and expensive feedback over long-horizon rollouts. We introduce \\textsc{Dream-RSI}, a framework for scalable and recursively self-improving exploration. A lightweight orchestration layer makes exploration explicit and programmable while leaving the underlying coding agent unchanged. Our key insight is that accumulated discovery history can serve as a replay simulator over the realized search space. By performing dreaming in the replay simulator constructed from historical discovery trees, \\textsc{Dream-RSI} secures immediate, low-cost off-policy feedback to evaluate and refine exploration policies without invoking repetitive, expensive online evaluations. The improved policy is subsequently redeployed online to drive further discovery, continuously expanding the simulator pool in a self-improving loop. Across algorithm engineering, mathematical optimization, and GPU kernel engineering, \\textsc{Dream-RSI} achieves competitive or improved discovery quality while substantially reducing discovery cost in several settings.", "authors": [ "Tong Zheng", "Xidong Wu", "Zheng Zhang", "Zhankui He", "Chaoyi Zhang", "Benjamin Coleman", "Ruoqiao Wei", "Di Bai", "Haolin Liu", "Rui Liu", "Xue Wang", "Yue Zhuan", "Wang-Cheng Kang", "Renkai Xiang", "Heng Huang", "Xinwu Cheng", "Yunsong Guo" ], "year": 2026, "published_date": "2026-09-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.14858", "pdf_url": "https://arxiv.org/pdf/2609.14858", "citations": 0, "topics": [], "tags": [ "AI Agents", "NLP" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 4.48, "content_potential_score": 1.0, "interestingness_score": 2.16, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recursive self-improvement is becoming increasingly vital for autonomous AI agents, where progress hinges on discovering high-value solutions across complex domains. The driver of this process is effective exploration, however, managing and improving exploration strategies remains a major bottleneck.", "key_contribution": "We introduce \\textsc{Dream-RSI}, a framework for scalable and recursively self-improving exploration.", "why_it_matters": "Dream-RSI: Recursive Self-Improvement through Evolving Worlds represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We introduce \\textsc{Dream-RSI}, a framework for scalable and recursively self-improving exploration.", "biggest_caveat": "however, managing and improving exploration strategies remains a major bottleneck.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2609.14858", "difficulty": "intermediate" }, { "id": "arxiv:2608.12704", "source": "arxiv", "source_type": "preprint", "title": "Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level", "abstract": "Multi-objective bilevel optimization has wide applications in the AI area such as automated learning and multi-task meta-learning. Although recently some works have been begun to study the multi-objective bilevel optimization, the proposed methods rely on the (strongly) convex lower level problems. In fact, these multi-objective bilevel learning problems are generally nonconvex, and particularly their lower level problems are nonconvex. To fill this gap, we propose a class of Multi-Objective Moreau Envelope based Hessian-free Algorithms (MOMEHA) to solve the multi-objective bilevel learning problems with nonconvex lower level. Specifically, our method uses the Moreau envelope to convert the original problem into a multi-objective single-level optimization with an envelope constraint. In particular, our method retains computational advantages of being single-loop and Hessian-free in the multi-objective setting by incorporating a smooth weighted Tchebycheff scalarization. Furthermore, we propose a momentum-based variant of MOMEHA (i.e., MB-MOMEHA) method to solve the stochastic multi-objective bilevel learning problems. In theory, we provide the convergence properties of our algorithms under both deterministic and stochastic setting. Some experiments on few-shot meta-learning and neural architecture search demonstrate that our methods outperform the existing approaches in Pareto front, validating its effectiveness and robustness.", "authors": [ "Yicong Jiang", "Feihu Huang" ], "year": 2026, "published_date": "2026-08-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.12704", "pdf_url": "https://arxiv.org/pdf/2608.12704", "citations": 0, "topics": [], "tags": [ "Prompting", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 5.55, "content_potential_score": 0.0, "interestingness_score": 1.66, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multi-objective bilevel optimization has wide applications in the AI area such as automated learning and multi-task meta-learning. Although recently some works have been begun to study the multi-objective bilevel optimization, the proposed methods rely on the (strongly) convex lower level problems.", "key_contribution": "To fill this gap, we propose a class of Multi-Objective Moreau Envelope based Hessian-free Algorithms (MOMEHA) to solve the multi-objective bilevel learning problems with nonconvex lower level.", "why_it_matters": "Efficient Hessian-Free Methods for Multi-Objective Bilevel Optimization with Nonconvex Lower Level represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "To fill this gap, we propose a class of Multi-Objective Moreau Envelope based Hessian-free Algorithms (MOMEHA) to solve…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2608.12704", "difficulty": "frontier" }, { "id": "arxiv:2609.00052", "source": "arxiv", "source_type": "preprint", "title": "AgentProv: Auditing Agentic LLM API Providers via Tool-use Policy Probes", "abstract": "Commercial LLM APIs advertise a specific foundation model, but the served backbone may be silently substituted, quantized, or wrapped, for example to save deployment costs. All existing audits decide backbone identity from the text-output channel, which is structurally fragile for agentic APIs because modern serving stacks (OpenAI, Anthropic, Gemini, Cloudflare Workers AI, LangGraph) discard text and expose only structured actions when the model calls a tool, and provider-injected system prompts can distort text distributions enough that text-channel tests falsely accuse honest providers of substituting the claimed model. We observe that recent agentic post-training internalizes tool-use directly into the weights, opening a new audit channel that the serving stack still exposes and that is largely invariant to deployment context. We introduce Agentic Provenance (AgentProv), the first action-based identity audit for agentic LLM APIs: AgentProv fingerprints a deployed model through its categorical tool-call distribution and decides identity via an MMD permutation test. AgentProv catches every substituted model (100% on 630 evaluated checkpoint pairs), while holding the false-positive rate under system-prompt injection at 7% (vs. 67% for MET and 53% for RUT). On third-party API endpoints, AgentProv's disagreements with MET are consistent with an independent token-count side-channel that detects provider-injected system prompts.", "authors": [ "Xun Wang", "Bihe Zhao", "Michael Backes", "Franziska Boenisch", "Adam Dziedzic" ], "year": 2026, "published_date": "2026-08-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.00052", "pdf_url": "https://arxiv.org/pdf/2609.00052", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "NLP", "Cryptography & Security", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 4.52, "content_potential_score": 1.0, "interestingness_score": 2.16, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Commercial LLM APIs advertise a specific foundation model, but the served backbone may be silently substituted, quantized, or wrapped, for example to save deployment costs. All existing audits decide backbone identity from the text-output channel, which is structurally fragile for agentic APIs because modern serving stacks (OpenAI, Anthropic, Gemini, Cloudflare Workers AI, LangGraph) discard text and expose only structured actions when the model calls a tool, and provider-injected system prompts can distort text distributions enough that text-channel tests falsely accuse honest providers of substituting the claimed model.", "key_contribution": "We introduce Agentic Provenance (AgentProv), the first action-based identity audit for agentic LLM APIs: AgentProv fingerprints a deployed model through its categorical tool-call distribution and decides identity via an MMD permutation test.", "why_it_matters": "AgentProv: Auditing Agentic LLM API Providers via Tool-use Policy Probes represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Agentic Provenance (AgentProv), the first action-based identity audit for agentic LLM APIs: AgentProv…", "biggest_caveat": "but the served backbone may be silently substituted, quantized, or wrapped, for example to save deployment costs.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.00052", "difficulty": "intermediate" }, { "id": "arxiv:2604.26508", "source": "arxiv", "source_type": "preprint", "title": "Progressive Semantic Communication for Efficient Edge-Cloud Vision-Language Models", "abstract": "Deploying Vision-Language Models (VLMs) on edge devices remains challenging due to their substantial computational and memory demands, which exceed the capabilities of resource-constrained embedded platforms. Conversely, fully offloading inference to the cloud is often impractical in bandwidth-limited environments, where transmitting raw visual data introduces substantial latency overhead. While recent edge-cloud collaborative architectures attempt to partition VLM workloads across devices, they typically rely on transmitting fixed-size representations, lacking adaptability to dynamic network conditions and failing to fully exploit semantic redundancy. In this paper, we propose a progressive semantic communication framework for edge-cloud VLM inference, using a Meta AutoEncoder that compresses visual tokens into adaptive, progressively refinable representations, enabling plug-and-play deployment with off-the-shelf VLMs without additional fine-tuning. This design allows flexible transmission at different information levels, providing a controllable trade-off between communication cost and semantic fidelity. We implement a full end-to-end edge-cloud system comprising an embedded NXP i.MX95 platform and a GPU server, communicating over bandwidth-constrained networks. Experimental results show that, at 1 Mbps uplink, the proposed progressive scheme significantly reduces network latency compared to full-edge and full-cloud solutions, while maintaining high semantic consistency even under high compression. The implementation code will be released upon publication at https://github.com/open-ep/ProSemComVLM.", "authors": [ "Cyril Shih-Huan Hsu", "Wig Yuan-Cheng Cheng", "Chrysa Papagianni" ], "year": 2026, "published_date": "2026-04-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.26508", "pdf_url": "https://arxiv.org/pdf/2604.26508", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "VLMs", "Distributed Computing", "Machine Learning", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 5.18, "content_potential_score": 1.42, "interestingness_score": 2.37, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deploying Vision-Language Models (VLMs) on edge devices remains challenging due to their substantial computational and memory demands, which exceed the capabilities of resource-constrained embedded platforms. Conversely, fully offloading inference to the cloud is often impractical in bandwidth-limited environments, where transmitting raw visual data introduces substantial latency overhead.", "key_contribution": "In this paper, we propose a progressive semantic communication framework for edge-cloud VLM inference, using a Meta AutoEncoder that compresses visual tokens into adaptive, progressively refinable representations, enabling plug-and-play deployment with off-the-shelf VLMs without additional fine-tuning.", "why_it_matters": "Progressive Semantic Communication for Efficient Edge-Cloud Vision-Language Models advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "In this paper, we propose a progressive semantic communication framework for edge-cloud VLM inference, using a Meta…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2604.26508", "difficulty": "intermediate" }, { "id": "arxiv:2608.09087", "source": "arxiv", "source_type": "preprint", "title": "Joint Lyapunov Certificates for K-Agent Generative AI Governance: Stochastic Stability, Emergent Ensemble Risk, and Zero-Knowledge Governance Attestation", "abstract": "We develop a rigorous mathematical framework for the governance of systems of K self-adapting generative AI models under the principles of Model Risk Management (MRM). When multiple models share a meta-learning coupling through an interaction matrix, the per-agent Lyapunov analysis that underpins standard MRM is provably insufficient: individual agents can each satisfy their declared stability bounds while the joint system is in a regime of emergent ensemble-level drift. We formalize this gap through the Joint Lyapunov Proof (JLP)---a cryptographic and stochastic protocol that attests, without revealing proprietary weights, that the aggregate dynamics satisfy MRM Ongoing Monitoring standard at every validation epoch. Our main contributions are the following. We give a complete characterization of the infinitesimal generator of the joint quadratic Lyapunov function. We derive the exact critical coupling threshold above which the system loses mean-square stability. We prove a Noise-Floor Theorem and identify the correct target for zero-knowledge attestation. A per-epoch Succinct Non-Interactive Argument of Knowledge (SNARK) on the live weights is derived. All theoretical claims are validated against five numerical studies using a multi-agent softmax system.", "authors": [ "Sriram Nagaraj" ], "year": 2026, "published_date": "2026-08-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.09087", "pdf_url": "https://arxiv.org/pdf/2608.09087", "citations": 0, "topics": [], "tags": [ "Cryptography & Security" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 3.63, "content_potential_score": 0.0, "interestingness_score": 1.66, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We develop a rigorous mathematical framework for the governance of systems of K self-adapting generative AI models under the principles of Model Risk Management (MRM). When multiple models share a meta-learning coupling through an interaction matrix, the per-agent Lyapunov analysis that underpins standard MRM is provably insufficient: individual agents can each satisfy their declared stability bounds while the joint system is in a regime of emergent ensemble-level drift.", "key_contribution": "We develop a rigorous mathematical framework for the governance of systems of K self-adapting generative AI models under the principles of Model Risk Management (MRM).", "why_it_matters": "Joint Lyapunov Certificates for K-Agent Generative AI Governance: Stochastic Stability, Emergent Ensemble Risk, and Zero-Knowledge Governance Attestation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Cryptography & Security.", "one_line_takeaway": "We develop a rigorous mathematical framework for the governance of systems of K self-adapting generative AI models…", "biggest_caveat": "butions are the following.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Cryptography & Security.", "url": "https://arxiv.org/abs/2608.09087", "difficulty": "frontier" }, { "id": "arxiv:2607.27929", "source": "arxiv", "source_type": "preprint", "title": "Meta-Task: Turning Terminal Task Synthesis into a Terminal Task for Scalable Agent Training", "abstract": "Training terminal agents at scale requires diverse, verifiable terminal tasks and high-quality interaction trajectories, yet acquiring such data remains a significant challenge. Existing synthesis methods face two key limitations: (1) weak reliability caused by the disconnect between task generation and real execution, and (2) limited diversity and scalability due to dependence on existing repositories. We propose Meta-Task, a framework that redefines terminal task synthesis as a Terminal-Bench-format task itself: an agent operates within a real container environment to iteratively generate, execute, and verify tasks, so that synthesized components are checked for internal consistency and executability within the generation loop itself. Building upon this, we decouple the target task requirements along multiple dimensions, introduce a multi-phase mechanism that dynamically designs novel task specifications before producing the actual tasks, and incorporate optional external material support to enhance diversity and realism. We additionally apply LLM-as-Judge filtering to ensure the quality of the final training data. Experiments on Terminal-Bench 2.0 show that fine-tuning on only 3,221 Meta-Task synthesized trajectories achieves 22.5% and 31.8% Avg Pass@1 for Qwen3-14B and Qwen3-32B respectively, outperforming concurrent approaches with significantly less training data.", "authors": [ "Zhihong Pan", "Jiyuan He", "Kai Zhang", "Yupeng Han", "Ze Liu", "Yuze Zhao", "Yongcong Ye", "Zhaohua Yang" ], "year": 2026, "published_date": "2026-07-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.27929", "pdf_url": "https://arxiv.org/pdf/2607.27929", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "Info Extraction", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 4.45, "content_potential_score": 1.0, "interestingness_score": 2.16, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Training terminal agents at scale requires diverse, verifiable terminal tasks and high-quality interaction trajectories, yet acquiring such data remains a significant challenge. Existing synthesis methods face two key limitations: (1) weak reliability caused by the disconnect between task generation and real execution, and (2) limited diversity and scalability due to dependence on existing repositories.", "key_contribution": "We propose Meta-Task, a framework that redefines terminal task synthesis as a Terminal-Bench-format task itself: an agent operates within a real container environment to iteratively generate, execute, and verify tasks, so that synthesized components are checked for internal consistency and executability within the generation loop itself.", "why_it_matters": "Meta-Task: Turning Terminal Task Synthesis into a Terminal Task for Scalable Agent Training represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose Meta-Task, a framework that redefines terminal task synthesis as a Terminal-Bench-format task itself: an…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.27929", "difficulty": "intermediate" }, { "id": "arxiv:2607.20448", "source": "arxiv", "source_type": "preprint", "title": "Domyn-Small: A European 10B Reasoning Language Model", "abstract": "We introduce Domyn-Small, a 10-billion-parameter open-weight reasoning language model released under the MIT license. Domyn-Small is the product of an initial pre-training phase on 9 trillion tokens multilingual data, followed by a post-training pipeline for reasoning, instruction following, and context extension. For the latter, we performed a Continued Pre-Training (CPT) phase that doubles the native context window to 32K tokens, followed by SFT with a math-focused annealing run. Finally, the RL phase includes GRPO with verifiable rewards, DPO, and a multi-environment GRPO stage spanning five task domains: mathematics, code, multiple-choice QA, instruction-following, and tool calling. The 32K-token native context extends to 128K at inference via YaRN, and a chat-template toggle enables dual-mode reasoning. Against peer models in the 7--10B class (Qwen3.5-9B, OLMo-3-7B-Think, Nemotron-Nano-8B, Ministral-3-8B), Domyn-Small achieves a strong accuracy-efficiency balance: it produces roughly one-third as many tokens as Qwen3.5-9B and approximately 35% of OLMo-3-7B-Think's token budget on core reasoning benchmarks, while delivering strong instruction-following (IFEval 79.9) and competitive science reasoning (GPQA-Diamond 50.0). We release the weights and the post-training recipe alongside Domyn Swarm (Apache~2.0), an open-source framework for scalable LLM inference on HPC clusters developed during this program and used throughout this work.", "authors": [ "Simone Angarano", "Francesco Bertolotti", "Federico D'Ambrosio", "Michele Resta", "Alessandro Rognoni", "Nicolò Ruggeri", "Dario Salvati", "Andrea Valenti", "Alberto Veneri", "Martin Cimmino" ], "year": 2026, "published_date": "2026-05-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.20448", "pdf_url": "https://arxiv.org/pdf/2607.20448", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Long Context", "RLHF", "Self-Supervised" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 3.89, "content_potential_score": 1.0, "interestingness_score": 2.16, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce Domyn-Small, a 10-billion-parameter open-weight reasoning language model released under the MIT license. Domyn-Small is the product of an initial pre-training phase on 9 trillion tokens multilingual data, followed by a post-training pipeline for reasoning, instruction following, and context extension.", "key_contribution": "We introduce Domyn-Small, a 10-billion-parameter open-weight reasoning language model released under the MIT license.", "why_it_matters": "Domyn-Small: A European 10B Reasoning Language Model represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Domyn-Small, a 10-billion-parameter open-weight reasoning language model released under the MIT license.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.20448", "difficulty": "advanced" }, { "id": "arxiv:2607.16200", "source": "arxiv", "source_type": "preprint", "title": "Deterministic Replay for AI Agent Systems", "abstract": "AI agent systems that couple large language models (LLMs) with external tools and APIs are inherently non-deterministic: LLM sampling variance, external API state, CDN infrastructure headers, and execution-environment noise collectively prevent any prior agent run from being faithfully re-executed. Existing observability platforms capture execution logs but cannot reproduce a run in isolation. We present agrepl, a developer-first CLI framework for deterministic replay of agent executions. agrepl intercepts all external interactions at the transport layer via a man-in-the-middle (MITM) proxy, serialises them as structured execution traces, and replays them in a strictly isolated environment with zero outbound network access. We formalise the agent execution model, define the request-key matching function K(s), and prove the determinism invariant. We introduce a noise-aware diff algorithm classifying HTTP header divergence into signal and noise tiers. Empirical evaluation across five workloads (n = 250 replay instances) demonstrates replay fidelity F = 1.0 and a median per-step latency reduction of 98.3%. agrepl is implemented in Go, ships as a single static binary, and is released under the MIT licence. Keywords: AI agents, deterministic replay, LLM debugging, reproducibility, MITM proxy, execution tracing, record/replay systems.", "authors": [ "Rasheed Mudasiru" ], "year": 2026, "published_date": "2026-04-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.16200", "pdf_url": "https://arxiv.org/pdf/2607.16200", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 5.13, "content_potential_score": 1.0, "interestingness_score": 2.16, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "AI agent systems that couple large language models (LLMs) with external tools and APIs are inherently non-deterministic: LLM sampling variance, external API state, CDN infrastructure headers, and execution-environment noise collectively prevent any prior agent run from being faithfully re-executed. Existing observability platforms capture execution logs but cannot reproduce a run in isolation.", "key_contribution": "We present agrepl, a developer-first CLI framework for deterministic replay of agent executions.", "why_it_matters": "Deterministic Replay for AI Agent Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present agrepl, a developer-first CLI framework for deterministic replay of agent executions.", "biggest_caveat": "but cannot reproduce a run in isolation.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.16200", "difficulty": "intermediate" }, { "id": "arxiv:2607.01977", "source": "arxiv", "source_type": "preprint", "title": "OntoLearner: A Modular Python Library for Ontology Learning with Large Language Models", "abstract": "Ontology learning (OL) aims to automatically construct structured knowledge models from text, yet progress remains fragmented across methods, domains, and evaluation practices. Despite decades of research, OL lacks a shared infrastructure for systematic evaluation and ontology access. This absence has hindered progress and fragmented research, leaving the central challenges of OL largely unaddressed. We introduce OntoLearner, a modular, cross-domain, and first-of-its-kind framework that unifies ontology access, large language model (LLM)-driven learning pipelines, and standardized benchmarking. OntoLearner releases 180 machine-readable ontologies spanning 22 domains and provides pipeline-ready datasets with train/dev/test splits for three core OL tasks: term typing, taxonomy discovery, and non-taxonomic relation extraction. Using this infrastructure, we conduct a large-scale empirical study of OL, evaluating 22 retrieval models and 12 LLMs across domains and tasks. The results converge on a finding that reframes the central challenge of OL: failure modes scale with ontological complexity rather than model size or architectural sophistication. The primary bottleneck is not model capability, but a structural mismatch between how models encode knowledge and how ontologies organize it. These findings establish that effective OL is reachable through the cross-domain, multi-task benchmarking enabled by OntoLearner. OntoLearner is open-source (MIT license) at https://github.com/sciknoworg/OntoLearner/.", "authors": [ "Hamed Babaei Giglou", "Jennifer D'Souza", "Andrei Aioanei", "Nandana Mihindukulasooriya", "Sören Auer" ], "year": 2026, "published_date": "2026-07-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.01977", "pdf_url": "https://arxiv.org/pdf/2607.01977", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Knowledge Graphs", "Evaluation", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses multi-task — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 3.9, "content_potential_score": 1.55, "interestingness_score": 2.44, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Ontology learning (OL) aims to automatically construct structured knowledge models from text, yet progress remains fragmented across methods, domains, and evaluation practices. Despite decades of research, OL lacks a shared infrastructure for systematic evaluation and ontology access.", "key_contribution": "We introduce OntoLearner, a modular, cross-domain, and first-of-its-kind framework that unifies ontology access, large language model (LLM)-driven learning pipelines, and standardized benchmarking.", "why_it_matters": "OntoLearner: A Modular Python Library for Ontology Learning with Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce OntoLearner, a modular, cross-domain, and first-of-its-kind framework that unifies ontology access, large…", "biggest_caveat": "but a structural mismatch between how models encode knowledge and how ontologies organize it.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.01977", "difficulty": "advanced" }, { "id": "arxiv:2606.15470", "source": "arxiv", "source_type": "preprint", "title": "In-DRAM Signature Generation Using Simultaneous Multiple-Row Activation: An Experimental Study of Off-The-Shelf DRAM Chips", "abstract": "We experimentally demonstrate that it is possible to generate unique, repeatable, and device-specific signatures suitable for use as Physical Unclonable Function (PUF) responses in commercial off-the-shelf (COTS) DRAM chips by leveraging simultaneous multiple-row activation (SiMRA). Based on a rigorous experimental characterization of 112 modern DDR4 DRAM chips (from 10 modules), we introduce SiMRA-PUF, the first DRAM-based PUF that uses SiMRA-generated signatures as PUF responses. We analyze SiMRA-PUF in terms of reliability, uniqueness, and evaluation latency for varying numbers of simultaneously activated DRAM rows (i.e., 2, 4, 8, 16, and 32), DRAM chip density & die revision, and evaluate how temperature affects the similarity of SiMRA-generated responses. Among our 8 key experimental observations, we highlight two major results. First, SiMRA-PUF provides average intra-Jaccard indices of 89.02%, 89.81%, 93.03%, 94.06%, and 94.86%, and average inter-Jaccard indices of 3.98%, 2.37%, 3.44%, 2.92%, and 3.24% for 2-, 4-, 8-, 16-, and 32-row activations, respectively, showing that SiMRA-generated signatures are both repeatable within a device and unique across devices. Second, 2-row activation-based SiMRA-PUF provides 5.75% lower evaluation latency than the state-of-the-art DRAM-based PUF. We open-source our infrastructure and datasets at https://github.com/CMU-SAFARI/SiMRA-PUF.", "authors": [ "Umut Baser", "Ismail Emir Yuksel", "F. Nisa Bostanci", "Konstantinos Sgouras", "Ataberk Olgun", "Emre Hakan Demirli", "Zhiheng Yue", "Harsh Songara", "Oguz Ergin", "Onur Mutlu" ], "year": 2026, "published_date": "2026-06-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.15470", "pdf_url": "https://arxiv.org/pdf/2606.15470", "citations": 0, "topics": [], "tags": [ "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 4.46, "content_potential_score": 1.0, "interestingness_score": 2.16, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We experimentally demonstrate that it is possible to generate unique, repeatable, and device-specific signatures suitable for use as Physical Unclonable Function (PUF) responses in commercial off-the-shelf (COTS) DRAM chips by leveraging simultaneous multiple-row activation (SiMRA). Based on a rigorous experimental characterization of 112 modern DDR4 DRAM chips (from 10 modules), we introduce SiMRA-PUF, the first DRAM-based PUF that uses SiMRA-generated signatures as PUF responses.", "key_contribution": "We experimentally demonstrate that it is possible to generate unique, repeatable, and device-specific signatures suitable for use as Physical Unclonable Function (PUF) responses in commercial off-the-shelf (COTS) DRAM chips by leveraging simultaneous multiple-row activation (SiMRA).", "why_it_matters": "In-DRAM Signature Generation Using Simultaneous Multiple-Row Activation: An Experimental Study of Off-The-Shelf DRAM Chips represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Cryptography & Security.", "one_line_takeaway": "We experimentally demonstrate that it is possible to generate unique, repeatable, and device-specific signatures…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Cryptography & Security.", "url": "https://arxiv.org/abs/2606.15470", "difficulty": "intermediate" }, { "id": "arxiv:2606.12281v1", "source": "arxiv", "source_type": "preprint", "title": "CCKS: Consensus-based Communication and Knowledge Sharing", "abstract": "In Decentralized Training and Decentralized Execution (DTDE) for cooperative Multi-Agent Reinforcement Learning (MARL), action-advising-based knowledge sharing promotes interpretable and scalable cooperation among agents. However, current action advising approaches often adhere too much to the teacher's guidance without evaluating teacher-student compatibility, which causes excessive advising, suboptimal stability, and degraded performance. To overcome these challenges, this paper presents a Consensus-based Communication and Knowledge Sharing (CCKS) framework, which allows agents to adopt recommendations based on consensus-derived constraints and to follow the teacher's instructions more smartly. This mechanism enables agents to balance exploration and learning from experienced teachers, improving overall performance. The key is the consensus model construction, for which we propose to employ contrastive learning to construct consensus models based on local observations in the agents' training phase. In action selection, agents score and choose actions based on consensus and shared knowledge. Designed as a plug-and-play solution, CCKS integrates seamlessly with existing DTDE algorithms. Experiments conducted in the Google Research Football environment and the complex StarCraft II Multi-Agent Challenge demonstrate that the integration with CCKS significantly improves cooperation efficiency, learning speed, and overall performance compared with current DTDE baselines. The code is available at https://github.com/yuanxpy/CCKS.", "authors": [ "Jinyuan Zu", "Xiaowei Lv", "Yongcai Wang", "Deying Li", "Yunjun Han", "Wenping Chen", "Fengyi Zhang", "Naiqi Wu" ], "year": 2026, "published_date": "2026-06-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.12281v1", "pdf_url": "https://arxiv.org/pdf/2606.12281v1", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "RL", "Interpretability", "Multi-Agent Systems", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 4.56, "content_potential_score": 1.84, "interestingness_score": 2.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In Decentralized Training and Decentralized Execution (DTDE) for cooperative Multi-Agent Reinforcement Learning (MARL), action-advising-based knowledge sharing promotes interpretable and scalable cooperation among agents. However, current action advising approaches often adhere too much to the teacher's guidance without evaluating teacher-student compatibility, which causes excessive advising, suboptimal stability, and degraded performance.", "key_contribution": "The key is the consensus model construction, for which we propose to employ contrastive learning to construct consensus models based on local observations in the agents' training phase.", "why_it_matters": "CCKS: Consensus-based Communication and Knowledge Sharing represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "The key is the consensus model construction, for which we propose to employ contrastive learning to construct consensus…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Self-Supervised.", "url": "http://arxiv.org/abs/2606.12281v1", "difficulty": "advanced" }, { "id": "arxiv:2602.12996", "source": "arxiv", "source_type": "preprint", "title": "Know More, Know Clearer: A Meta-Cognitive Framework for Knowledge Augmentation in Large Language Models", "abstract": "Knowledge augmentation has significantly enhanced the performance of Large Language Models (LLMs) in knowledge-intensive tasks. However, existing methods typically operate on the simplistic premise that model performance equates with internal knowledge, overlooking the knowledge-confidence gaps that lead to overconfident errors or uncertain truths. To bridge this gap, we propose a novel meta-cognitive framework for reliable knowledge augmentation via differentiated intervention and alignment. Our approach leverages internal cognitive signals to partition the knowledge space into mastered, confused, and missing regions, guiding targeted knowledge expansion. Furthermore, we introduce a cognitive consistency mechanism to synchronize subjective certainty with objective accuracy, ensuring calibrated knowledge boundaries. Extensive experiments demonstrate the our framework consistently outperforms strong baselines, validating its rationality in not only enhancing knowledge capabilities but also fostering cognitive behaviors that better distinguish knowns from unknowns. All codes are available at https://github.com/AI9Stars/Know-More-Know-Clearer.", "authors": [ "Hao Chen", "Ye He", "Yuchun Fan", "Yukun Yan", "Zhenghao Liu", "Qingfu Zhu", "Maosong Sun", "Wanxiang Che" ], "year": 2026, "published_date": "2026-06-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.12996", "pdf_url": "https://arxiv.org/pdf/2602.12996", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "Artificial Intelligence", "NLP" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 4.55, "content_potential_score": 0.0, "interestingness_score": 1.66, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Knowledge augmentation has significantly enhanced the performance of Large Language Models (LLMs) in knowledge-intensive tasks. However, existing methods typically operate on the simplistic premise that model performance equates with internal knowledge, overlooking the knowledge-confidence gaps that lead to overconfident errors or uncertain truths.", "key_contribution": "To bridge this gap, we propose a novel meta-cognitive framework for reliable knowledge augmentation via differentiated intervention and alignment.", "why_it_matters": "Know More, Know Clearer: A Meta-Cognitive Framework for Knowledge Augmentation in Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To bridge this gap, we propose a novel meta-cognitive framework for reliable knowledge augmentation via differentiated…", "biggest_caveat": "but also fostering cognitive behaviors that better distinguish knowns from unknowns.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2602.12996", "difficulty": "advanced" }, { "id": "arxiv:2606.08533", "source": "arxiv", "source_type": "preprint", "title": "Autonomous Aerial Manipulation via Contextual Contrastive Meta Reinforcement Learning", "abstract": "Unmanned aerial vehicles (UAVs) are increasingly being deployed in logistics, service robotics, and other real-world applications, creating a growing demand for autonomous payload acquisition and delivery. Existing approaches typically assume pre-attached payloads or rely on specialized grippers, leaving versatile end-to-end aerial delivery largely unresolved, where different payloads induce highly variable flight dynamics, requiring a single policy to adapt online without manual calibration or explicit system identification. To this end, we study \\textbf{A}utonomous \\textbf{A}erial Manipulation via \\textbf{Co}ntextual \\textbf{Co}ntrastive Meta Reinforcement Learning (\\textbf{\\textit{Aco2}}), a fully autonomous aerial delivery setting in which a quadrotor equipped with a lightweight hook continuously picks up, transports, and delivers diverse handle-equipped objects between randomized locations, all without human intervention. First, we design a contextual observation encoder that infers a compact latent context from recent interaction history, enabling the policy to adapt online to payload-dependent dynamics. To further improve the quality of this context, we introduce a contrastive objective that structures the context embedding around task-relevant variations, improving generalization across diverse payloads without requiring explicit system identification. Trained entirely in simulation with extensive domain randomization, \\textit{Aco2} can be directly deployed on a physical quadrotor without real-world fine-tuning.", "authors": [ "Lixuan Jin", "Bingxuan Lan", "Xinyi Bao", "Xiangyuan Xie", "Chunjie Zhang", "Zheng Chen", "Tianshuo Liu", "Ruijie Tian", "Jinyu Ru", "Gang Wang", "Lei Yuan", "Yang Yu" ], "year": 2026, "published_date": "2026-06-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.08533", "pdf_url": "https://arxiv.org/pdf/2606.08533", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "RL", "Robotics", "Embeddings", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 3.87, "content_potential_score": 3.23, "interestingness_score": 3.27, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Unmanned aerial vehicles (UAVs) are increasingly being deployed in logistics, service robotics, and other real-world applications, creating a growing demand for autonomous payload acquisition and delivery. Existing approaches typically assume pre-attached payloads or rely on specialized grippers, leaving versatile end-to-end aerial delivery largely unresolved, where different payloads induce highly variable flight dynamics, requiring a single policy to adapt online without manual calibration or explicit system identification.", "key_contribution": "To further improve the quality of this context, we introduce a contrastive objective that structures the context embedding around task-relevant variations, improving generalization across diverse payloads without requiring explicit system identification.", "why_it_matters": "Autonomous Aerial Manipulation via Contextual Contrastive Meta Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "To further improve the quality of this context, we introduce a contrastive objective that structures the context…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2606.08533", "difficulty": "advanced" }, { "id": "arxiv:2606.06079", "source": "arxiv", "source_type": "preprint", "title": "SkillComposer: Learning to Evolve Agent Skills for Specification and Generalization", "abstract": "Agent skills, which consist of reusable strategies that guide agent reasoning and action, have shown strong potential for improving model capability at inference time. However, current skill construction methods treat the problem as one-shot extraction, overlooking a fundamental tension: a skill tailored to the specific task fails to transfer, while the abstracted skill often provides insufficient guidance. We attribute this fragility to the absence of explicit mechanisms for skill specification and generalization. To address this gap, we introduce SkillComposer, a framework that decomposes skill construction into three learnable operations: create, improve, and merge. Trained via systematic rejection sampling recipe, SkillComposer enables language models to self-evolve skills at inference time and supports three deployment modes: offline for building generalized libraries, online for task-specific refinement, and hybrid for combining both. Comprehensive experiments on $τ^2$-Bench, LiveCodeBench v6, and AppWorld show that SkillComposer consistently outperforms baselines. Our SkillComposer-4B improves a 27B executor by up to +4.5 on agent tasks and +3.4 on code tasks, while generalizing across domains and task types unseen during training. Analysis reveals that merge and improve address orthogonal quality dimensions and that skill composition is a transferable meta-ability, providing a practical recipe for skill-augmented inference.", "authors": [ "Qi Zhang", "Zhaopeng Feng", "Xiaonan Shi", "Xiaomeng Hu", "Chu Liu", "Pengjun Xie", "Xiaobin Wang", "Jieping Ye", "Bryan Hooi", "Haobo Wang", "Junbo Zhao" ], "year": 2026, "published_date": "2026-06-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.06079", "pdf_url": "https://arxiv.org/pdf/2606.06079", "citations": 0, "topics": [], "tags": [ "Reasoning", "NLP" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 4.5, "content_potential_score": 3.23, "interestingness_score": 3.27, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agent skills, which consist of reusable strategies that guide agent reasoning and action, have shown strong potential for improving model capability at inference time. However, current skill construction methods treat the problem as one-shot extraction, overlooking a fundamental tension: a skill tailored to the specific task fails to transfer, while the abstracted skill often provides insufficient guidance.", "key_contribution": "To address this gap, we introduce SkillComposer, a framework that decomposes skill construction into three learnable operations: create, improve, and merge.", "why_it_matters": "SkillComposer: Learning to Evolve Agent Skills for Specification and Generalization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "To address this gap, we introduce SkillComposer, a framework that decomposes skill construction into three learnable…", "biggest_caveat": "bute this fragility to the absence of explicit mechanisms for skill specification and generalization.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2606.06079", "difficulty": "intermediate" }, { "id": "arxiv:2601.02369", "source": "arxiv", "source_type": "preprint", "title": "Fair Distribution of Digital Payments: Balancing Transaction Flows for Regulatory Compliance", "abstract": "The concentration of digital payment transactions in just two UPI apps like PhonePe and Google Pay has raised concerns of duopoly in India s digital financial ecosystem. To address this, the National Payments Corporation of India (NPCI) has mandated that no single UPI app should exceed 30 percent of total transaction volume. Enforcing this cap, however, poses a significant computational challenge: how to redistribute user transactions across apps without causing widespread user inconvenience while maintaining capacity limits? In this paper, we formalize this problem as the Minimum Edge Activation Flow (MEAF) problem on a bipartite network of users and apps, where activating an edge corresponds to a new app installation. The objective is to ensure a feasible flow respecting app capacities while minimizing additional activations. We further prove that Minimum Edge Activation Flow is NP-Complete. To address the computational challenge, we propose scalable heuristics, named Decoupled Two-Stage Allocation Strategy (DTAS), that exploit flow structure and capacity reuse. Experiments on large semi-synthetic transaction network data show that DTAS finds solutions close to the optimal ILP within seconds, offering a fast and practical way to enforce transaction caps fairly and efficiently.", "authors": [ "Ashlesha Hota", "Shashwat Kumar", "Daman Deep Singh", "Abolfazl Asudeh", "Palash Dey", "Abhijnan Chakraborty" ], "year": 2026, "published_date": "2026-06-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.02369", "pdf_url": "https://arxiv.org/pdf/2601.02369", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 5.14, "content_potential_score": 1.0, "interestingness_score": 2.16, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The concentration of digital payment transactions in just two UPI apps like PhonePe and Google Pay has raised concerns of duopoly in India s digital financial ecosystem. To address this, the National Payments Corporation of India (NPCI) has mandated that no single UPI app should exceed 30 percent of total transaction volume.", "key_contribution": "To address the computational challenge, we propose scalable heuristics, named Decoupled Two-Stage Allocation Strategy (DTAS), that exploit flow structure and capacity reuse.", "why_it_matters": "Fair Distribution of Digital Payments: Balancing Transaction Flows for Regulatory Compliance represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "To address the computational challenge, we propose scalable heuristics, named Decoupled Two-Stage Allocation Strategy…", "biggest_caveat": "bute user transactions across apps without causing widespread user inconvenience while maintaining capacity limits?", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2601.02369", "difficulty": "intermediate" }, { "id": "arxiv:2509.06948", "source": "arxiv", "source_type": "preprint", "title": "Beyond Two-Stage Training: Cooperative SFT and RL for LLM Reasoning", "abstract": "Supervised fine-tuning (SFT) and reinforcement learning with verifiable rewards (RLVR) are two widely used post-training paradigms for improving the reasoning ability of large language models (LLMs). Recent methods attempt to integrate SFT and RLVR in a single stage by reweighting or scheduling their objectives. However, such coupling can be counterproductive because supervised updates are not uniformly beneficial for reward optimization. To address this, we propose BRIDGE, a scalable framework in which SFT learns to supervise RL by selectively transferring knowledge that improves reward optimization. Specifically, BRIDGE alternates two updates at each meta-training step: a base-model update that fuses the SFT and RL gradients, and an update to a lightweight low-rank adapter (LoRA) that coordinates the two objectives by maximizing a cooperative-gain signal, defined as the reward of joint SFT-RL training over an RL-only baseline. Across five mathematical reasoning benchmarks, BRIDGE consistently outperforms two-stage cold start, naive mixing, and representative single-stage integration baselines, yielding over three points average absolute improvement and more stable training dynamics. We further show that BRIDGE extends to logical reasoning and generalizes out-of-distribution to code and science without additional training, while staying robust under noisy rewards.", "authors": [ "Liang Chen", "Xueting Han", "Li Shen", "Jing Bai", "Kam-Fai Wong" ], "year": 2026, "published_date": "2026-05-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.06948", "pdf_url": "https://arxiv.org/pdf/2509.06948", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Fine-Tuning", "RL", "Evaluation" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 5.57, "content_potential_score": 1.0, "interestingness_score": 2.16, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Supervised fine-tuning (SFT) and reinforcement learning with verifiable rewards (RLVR) are two widely used post-training paradigms for improving the reasoning ability of large language models (LLMs). Recent methods attempt to integrate SFT and RLVR in a single stage by reweighting or scheduling their objectives.", "key_contribution": "To address this, we propose BRIDGE, a scalable framework in which SFT learns to supervise RL by selectively transferring knowledge that improves reward optimization.", "why_it_matters": "Beyond Two-Stage Training: Cooperative SFT and RL for LLM Reasoning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this, we propose BRIDGE, a scalable framework in which SFT learns to supervise RL by selectively…", "biggest_caveat": "However, such coupling can be counterproductive because supervised updates are not uniformly beneficial for reward optimization.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2509.06948", "difficulty": "beginner" }, { "id": "arxiv:2511.04934", "source": "arxiv", "source_type": "preprint", "title": "Leak@$k$: Unlearning Does Not Make LLMs Forget Under Probabilistic Decoding", "abstract": "Unlearning in large language models (LLMs) is critical for regulatory compliance and for building ethical generative AI systems that avoid producing private, toxic, illegal, or copyrighted content. Despite rapid progress, in this work, we show that \\textit{almost all} existing unlearning methods fail to achieve true forgetting in practice. Specifically, while evaluations of these `unlearned' models under deterministic (greedy) decoding often suggest successful knowledge removal using standard benchmarks, we show that sensitive information reliably resurfaces when models are sampled with standard probabilistic decoding. To rigorously capture this vulnerability, we introduce \\texttt{leak@$k$}, a new meta-evaluation metric that quantifies the likelihood of forgotten knowledge reappearing when generating $k$ samples from the model under realistic decoding strategies. Using three widely adopted benchmarks, TOFU, MUSE, and WMDP, we conduct the first large-scale, systematic study of unlearning reliability using \\texttt{leak@$k$} metric. Our findings demonstrate that knowledge leakage persists across methods and tasks, underscoring that current state-of-the-art (SOTA) unlearning techniques provide only limited forgetting. We propose an algorithm, termed Robust Unlearning under LEak@$k$ metric (\\texttt{RULE}) to address this concern. We demonstrate that \\texttt{RULE} provides an unlearned model for TOFU benchmark with no information leakage for a large number of generation samples. On the MUSE benchmark, \\texttt{RULE} outperforms SOTA unlearning methods under the \\texttt{leak@$k$} metric across most sampling budgets $k$. Codes are available at https://github.com/OptimAI-Lab/Leak-k.", "authors": [ "Hadi Reisizadeh", "Jiajun Ruan", "Yiwei Chen", "Soumyadeep Pal", "Sijia Liu", "Mingyi Hong" ], "year": 2026, "published_date": "2026-05-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.04934", "pdf_url": "https://arxiv.org/pdf/2511.04934", "citations": 0, "topics": [], "tags": [ "LLMs", "Fairness & Ethics", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 7.39, "content_potential_score": 1.5, "interestingness_score": 2.41, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Unlearning in large language models (LLMs) is critical for regulatory compliance and for building ethical generative AI systems that avoid producing private, toxic, illegal, or copyrighted content. Despite rapid progress, in this work, we show that \\textit{almost all} existing unlearning methods fail to achieve true forgetting in practice.", "key_contribution": "Despite rapid progress, in this work, we show that \\textit{almost all} existing unlearning methods fail to achieve true forgetting in practice.", "why_it_matters": "Leak@$k$: Unlearning Does Not Make LLMs Forget Under Probabilistic Decoding represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Despite rapid progress, in this work, we show that \\textit{almost all} existing unlearning methods fail to achieve true…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2511.04934", "difficulty": "beginner" }, { "id": "arxiv:2605.27659", "source": "arxiv", "source_type": "preprint", "title": "Transferable Reinforcement Learning via Probabilistic Latent Embeddings and Dynamic Policy Adaptation for Sim-to-Real Deployment", "abstract": "Due to limited resources and public safety concerns, deep reinforcement learning (RL) agents for many cyber-physical systems (e.g., autonomous vehicles) are first trained in simulators. However, when deployed in real world environments, they often suffer from performance degradation or safety violations because of the inevitable Sim2Real gap. Existing zero-shot approaches, such as robust safe RL and domain randomization, mitigate this issue but typically at the cost of degraded performance or residual safety risks when experiencing unmodeled system dynamics. To address these limitations, we propose a novel reinforcement learning framework that enables safe and efficient policy transfer via probabilistic latent embeddings and dynamic policy adaptation. We consider a family of Constrained Markov Decision Processes (CMDPs) under different environment contexts. By leveraging latent context variable in meta-RL, the proposed framework infers the latent representation of the environment from simulated experiences. Furthermore, it incorporates a distributional RL formulation, which allows risk levels of the deployed policy to be adjusted dynamically, based on the estimation accuracy of the latent context variable. This strategy promotes safety at the early deployment stage and improves efficiency through fast policy adaptation under the Sim2Real gap.", "authors": [ "Gengyue Han", "Yiheng Feng" ], "year": 2026, "published_date": "2026-05-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.27659", "pdf_url": "https://arxiv.org/pdf/2605.27659", "citations": 0, "topics": [], "tags": [ "RL", "Robotics", "Machine Learning", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 3.86, "content_potential_score": 1.84, "interestingness_score": 2.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Due to limited resources and public safety concerns, deep reinforcement learning (RL) agents for many cyber-physical systems (e.g., autonomous vehicles) are first trained in simulators. However, when deployed in real world environments, they often suffer from performance degradation or safety violations because of the inevitable Sim2Real gap.", "key_contribution": "To address these limitations, we propose a novel reinforcement learning framework that enables safe and efficient policy transfer via probabilistic latent embeddings and dynamic policy adaptation.", "why_it_matters": "Transferable Reinforcement Learning via Probabilistic Latent Embeddings and Dynamic Policy Adaptation for Sim-to-Real Deployment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "To address these limitations, we propose a novel reinforcement learning framework that enables safe and efficient…", "biggest_caveat": "However, when deployed in real world environments, they often suffer from performance degradation or safety violations because of the inevitable Sim2Real gap.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2605.27659", "difficulty": "advanced" }, { "id": "arxiv:2603.23722", "source": "arxiv", "source_type": "preprint", "title": "Dual-Gated Epistemic Time-Dilation: Autonomous Compute Modulation in Asynchronous MARL", "abstract": "While Multi-Agent Reinforcement Learning (MARL) algorithms achieve unprecedented successes across complex continuous domains, their standard deployment strictly adheres to a synchronous operational paradigm. Under this paradigm, agents are universally forced to execute deep neural network inferences at every micro-frame, regardless of immediate necessity. This dense throughput acts as a fundamental barrier to physical deployment on edge-devices where thermal and metabolic budgets are highly constrained. We propose Epistemic Time-Dilation MAPPO (ETD-MAPPO), augmented with a Dual-Gated Epistemic Trigger. Instead of depending on rigid frame-skipping (macro-actions), agents autonomously modulate their execution frequency by interpreting aleatoric uncertainty (via Shannon entropy of their policy) and epistemic uncertainty (via state-value divergence in a Twin-Critic architecture). To format this, we structure the environment as a Semi-Markov Decision Process (SMDP) and build the SMDP-Aligned Asynchronous Gradient Masking Critic to ensure proper credit assignment. Empirical findings demonstrate massive improvements (> 60% relative baseline acquisition leaps) over current temporal models. By assessing LBF, MPE, and the 115-dimensional state space of Google Research Football (GRF), ETD correctly prevented premature policy collapse. Remarkably, this unconstrained approach leads to emergent Temporal Role Specialization, reducing computational overhead by a statistically dominant 73.6% entirely during off-ball execution without deteriorating centralized task dominance.", "authors": [ "Igor Jankowski" ], "year": 2026, "published_date": "2026-05-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.23722", "pdf_url": "https://arxiv.org/pdf/2603.23722", "citations": 0, "topics": [], "tags": [ "RLHF", "Multi-Agent Systems", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 3.91, "content_potential_score": 1.0, "interestingness_score": 2.16, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "While Multi-Agent Reinforcement Learning (MARL) algorithms achieve unprecedented successes across complex continuous domains, their standard deployment strictly adheres to a synchronous operational paradigm. Under this paradigm, agents are universally forced to execute deep neural network inferences at every micro-frame, regardless of immediate necessity.", "key_contribution": "While Multi-Agent Reinforcement Learning (MARL) algorithms achieve unprecedented successes across complex continuous domains, their standard deployment strictly adheres to a synchronous operational paradigm.", "why_it_matters": "Dual-Gated Epistemic Time-Dilation: Autonomous Compute Modulation in Asynchronous MARL represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RLHF.", "one_line_takeaway": "While Multi-Agent Reinforcement Learning (MARL) algorithms achieve unprecedented successes across complex continuous…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RLHF.", "url": "https://arxiv.org/abs/2603.23722", "difficulty": "advanced" }, { "id": "arxiv:2605.18971", "source": "arxiv", "source_type": "preprint", "title": "Shaping the Prior: How Synthetic Task Distributions Determine Tabular Foundation Model Quality", "abstract": "What determines the quality of a tabular foundation model? Unlike language or vision, tabular foundation models acquire their inductive biases almost entirely from synthetic pretraining distributions, yet the design of these distributions remains poorly understood. Standard synthetic priors are too well-behaved: they omit the irregularities and failure modes that determine deployment robustness. We introduce O'Prior, a compositional realism prior built around four coupled components: a hierarchical SCM meta-generator spanning diverse functional families; a modular realism engine covering heterogeneous marginals, missingness, and target transforms; an explicit stress module injecting confounding and support-query mismatch; and a curriculum-governed, leakage-safe generation protocol. To isolate prior design as the scientific variable, we hold architecture, optimizer, and compute budget fixed and vary only the synthetic task distribution. O'Prior yields consistent and substantial improvements in downstream accuracy and robustness across real tabular benchmarks, with gains concentrated in regimes characterized by distributional irregularities. Ablations confirm that mechanism diversity, realism composition, and shift-aware stress each contribute independently, their effects are not interchangeable. These results establish synthetic prior construction as a first-order and largely overlooked determinant of tabular foundation model quality", "authors": [ "Mohamed Bouadi", "Nassim Bouarour", "Varun Kulkarni", "Shivam Dubey", "Aditya Tanna", "Vinay Kumar Sankarapu" ], "year": 2026, "published_date": "2026-05-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.18971", "pdf_url": "https://arxiv.org/pdf/2605.18971", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "Structured Data", "Fairness & Ethics", "Evaluation", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses pretraining — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 3.83, "content_potential_score": 1.0, "interestingness_score": 2.16, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "What determines the quality of a tabular foundation model? Unlike language or vision, tabular foundation models acquire their inductive biases almost entirely from synthetic pretraining distributions, yet the design of these distributions remains poorly understood.", "key_contribution": "We introduce O'Prior, a compositional realism prior built around four coupled components: a hierarchical SCM meta-generator spanning diverse functional families; a modular realism engine covering heterogeneous marginals, missingness, and target transforms; an explicit stress module injecting confounding and support-query mismatch; and a curriculum-governed, leakage-safe generation protocol.", "why_it_matters": "Shaping the Prior: How Synthetic Task Distributions Determine Tabular Foundation Model Quality represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "We introduce O'Prior, a compositional realism prior built around four coupled components: a hierarchical SCM…", "biggest_caveat": "butions, yet the design of these distributions remains poorly understood.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Self-Supervised.", "url": "https://arxiv.org/abs/2605.18971", "difficulty": "advanced" }, { "id": "arxiv:2602.13238", "source": "arxiv", "source_type": "preprint", "title": "Securing SIM-Assisted Wireless Networks via Quantum Reinforcement Learning", "abstract": "Stacked intelligent metasurfaces (SIMs) have recently emerged as a powerful wave-domain technology that enables multi-stage manipulation of electromagnetic signals through multilayer programmable architectures. While SIMs offer unprecedented degrees of freedom for enhancing physical-layer security, their extremely large number of meta-atoms leads to a high-dimensional and strongly coupled optimization space, making conventional design approaches inefficient and difficult to scale. Moreover, existing deep reinforcement learning (DRL) techniques suffer from slow convergence and performance degradation in dynamic wireless environments with imperfect knowledge of passive eavesdroppers. To address these challenges, we propose a hybrid quantum proximal policy optimization (QPPO) framework for SIM-assisted secure communications that jointly optimizes transmit power allocation and SIM phase shifts to maximize the average secrecy rate under power and quality-of-service constraints. Specifically, a parameterized quantum circuit is embedded into the actor network, forming a hybrid classical-quantum policy architecture that enhances policy representation capability and exploration efficiency in high-dimensional continuous action spaces. Extensive simulations demonstrate that the proposed Q-PPO scheme consistently outperforms DRL baselines, achieving approximately 15% higher secrecy rates and 30% faster convergence under imperfect eavesdropper channel state information. These results establish Q-PPO as a powerful optimization paradigm for SIM-enabled secure wireless networks.", "authors": [ "Le-Hung Hoang", "Quang-Trung Luu", "Dinh Thai Hoang", "Diep N. Nguyen", "Van-Dinh Nguyen" ], "year": 2026, "published_date": "2026-05-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.13238", "pdf_url": "https://arxiv.org/pdf/2602.13238", "citations": 0, "topics": [], "tags": [ "RL", "Robotics", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 4.89, "content_potential_score": 0.0, "interestingness_score": 1.66, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Stacked intelligent metasurfaces (SIMs) have recently emerged as a powerful wave-domain technology that enables multi-stage manipulation of electromagnetic signals through multilayer programmable architectures. While SIMs offer unprecedented degrees of freedom for enhancing physical-layer security, their extremely large number of meta-atoms leads to a high-dimensional and strongly coupled optimization space, making conventional design approaches inefficient and difficult to scale.", "key_contribution": "To address these challenges, we propose a hybrid quantum proximal policy optimization (QPPO) framework for SIM-assisted secure communications that jointly optimizes transmit power allocation and SIM phase shifts to maximize the average secrecy rate under power and quality-of-service constraints.", "why_it_matters": "Securing SIM-Assisted Wireless Networks via Quantum Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "To address these challenges, we propose a hybrid quantum proximal policy optimization (QPPO) framework for SIM-assisted…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2602.13238", "difficulty": "advanced" }, { "id": "arxiv:2605.10521", "source": "arxiv", "source_type": "preprint", "title": "DuetFair: Coupling Inter- and Intra-Subgroup Robustness for Fair Medical Image Segmentation", "abstract": "Medical image segmentation models can perform unevenly across subgroups. Most existing fairness methods focus on improving average subgroup performance, implicitly treating each subgroup as internally homogeneous. However, this can hide difficult cases within a subgroup, where high-loss samples are obscured by the subgroup mean. We call this problem \\textbf{intra-group hidden failure}. To solve this, we propose \\textbf{DuetFair} mechanism, a dual-axis fairness framework that jointly considers inter-subgroup adaptation and intra-subgroup robustness. Based on DuetFair, we introduce \\textbf{FairDRO}, which combines distribution-aware mixture-of-experts (dMoE) with subgroup-conditioned distributionally robust optimization (DRO) loss aggregation. This design allows the model to adapt across subgroups while also reducing hidden failures within each subgroup. We evaluate FairDRO on three medical image segmentation benchmarks with varying degrees of within-group heterogeneity. FairDRO achieves the best equity-scaled performance on Harvard-FairSeg and improves worst-case subgroup performance on HAM10000 under both age- and race-based grouping schemes. On the 3D radiotherapy target cohort, FairDRO further improves worst-group Dice by 3.5 points ($\\uparrow 6.0\\%$) under the tumor-stage grouping and by 4.1 points ($\\uparrow 7.4\\%$) under the institution grouping over the strongest baseline.", "authors": [ "Yiqi Tian", "Sangjoon Park", "Bo Zeng", "Pengfei Jin", "Yujin Oh", "Quanzheng Li" ], "year": 2026, "published_date": "2026-05-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.10521", "pdf_url": "https://arxiv.org/pdf/2605.10521", "citations": 0, "topics": [], "tags": [ "MoE", "Fairness & Ethics", "Evaluation", "Artificial Intelligence", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.32, "read_first_score": 5.69, "content_potential_score": 0.0, "interestingness_score": 1.66, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Medical image segmentation models can perform unevenly across subgroups. Most existing fairness methods focus on improving average subgroup performance, implicitly treating each subgroup as internally homogeneous.", "key_contribution": "To solve this, we propose \\textbf{DuetFair} mechanism, a dual-axis fairness framework that jointly considers inter-subgroup adaptation and intra-subgroup robustness.", "why_it_matters": "DuetFair: Coupling Inter- and Intra-Subgroup Robustness for Fair Medical Image Segmentation advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about MoE.", "one_line_takeaway": "To solve this, we propose \\textbf{DuetFair} mechanism, a dual-axis fairness framework that jointly considers…", "biggest_caveat": "However, this can hide difficult cases within a subgroup, where high-loss samples are obscured by the subgroup mean.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in MoE.", "url": "https://arxiv.org/abs/2605.10521", "difficulty": "beginner" }, { "id": "arxiv:2605.16692", "source": "arxiv", "source_type": "preprint", "title": "EfficientTDMPC: Improved MPC Objectives for Sample-Efficient Continuous Control", "abstract": "We introduce EfficientTDMPC, a sample-efficient model-based reinforcement learning method for continuous control built on the TD-MPC family of algorithms. Central to this family is a planner that aims to find an action sequence that maximizes the estimated return. The return is estimated using a learned model and value networks, each of which can introduce error. EfficientTDMPC introduces three contributions that improve performance by aiming to reduce this error. First, we introduce an aggregate multi-horizon planning objective that evaluates the value at different rollout depths and averages them. Second, we introduce ensembles for state-action value estimation to value-equivalent/MuZero-style model-based RL methods. Third, we add pessimistic reanalyze, which penalizes uncertain return estimates when creating policy targets. We evaluate EfficientTDMPC on HumanoidBench and the DeepMind Control Suite, to the best of our knowledge, it is the new state of the art on both domains in terms of sample efficiency.", "authors": [ "Thomas Evers", "Cristian Meo", "Wendelin Bohmer", "Justin Dauwels", "Yaniv Oren" ], "year": 2026, "published_date": "2026-09-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.16692", "pdf_url": "https://arxiv.org/pdf/2605.16692", "citations": 0, "topics": [], "tags": [ "Info Extraction", "RL", "Robotics", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 4.67, "content_potential_score": 0.0, "interestingness_score": 1.66, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce EfficientTDMPC, a sample-efficient model-based reinforcement learning method for continuous control built on the TD-MPC family of algorithms. Central to this family is a planner that aims to find an action sequence that maximizes the estimated return.", "key_contribution": "We introduce EfficientTDMPC, a sample-efficient model-based reinforcement learning method for continuous control built on the TD-MPC family of algorithms.", "why_it_matters": "EfficientTDMPC: Improved MPC Objectives for Sample-Efficient Continuous Control represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We introduce EfficientTDMPC, a sample-efficient model-based reinforcement learning method for continuous control built…", "biggest_caveat": "butions that improve performance by aiming to reduce this error.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2605.16692", "difficulty": "advanced" }, { "id": "arxiv:2609.15649", "source": "arxiv", "source_type": "preprint", "title": "From Model Patterns to Abstract Semantics in Compositional Zero-Shot Learning", "abstract": "Compositional Zero Shot Learning aims to recognize unseen compositions by recombining learned primitives. Recent methods rely on vision language models and attempt to explicitly model contextual variations of primitives through multiple representations. However, such approaches are limited by fixed variant capacity and competition between abstract and concrete semantics. In this work, we present a new perspective that views primitive variations as the context-driven activation of concrete visual cues rather than independent entities. Based on it, we propose CLEAR, a CLoze-style rEAsoning-based Re-ranking framework inspired by human perceptual processes. CLEAR extracts conditional variants from the primitive candidate set in a coarse-to-fine manner, performs cloze-style reasoning to infer high-level semantics, and re-ranks predictions to correct biases toward salient concrete primitives. Extensive experiments demonstrate that CLEAR consistently improves the Base Model and outperforms state-of-the-art methods on the challenging C-GQA and MIT-States datasets. Code is available at https://github.com/buptLwz/CLEAR.", "authors": [ "Weize Li", "Zhicheng Zhao", "Fei Su" ], "year": 2026, "published_date": "2026-09-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.15649", "pdf_url": "https://arxiv.org/pdf/2609.15649", "citations": 0, "topics": [], "tags": [ "Reasoning", "VLMs", "Info Extraction", "Fairness & Ethics", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 5.25, "content_potential_score": 0.0, "interestingness_score": 1.66, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Compositional Zero Shot Learning aims to recognize unseen compositions by recombining learned primitives. Recent methods rely on vision language models and attempt to explicitly model contextual variations of primitives through multiple representations.", "key_contribution": "In this work, we present a new perspective that views primitive variations as the context-driven activation of concrete visual cues rather than independent entities.", "why_it_matters": "From Model Patterns to Abstract Semantics in Compositional Zero-Shot Learning advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "In this work, we present a new perspective that views primitive variations as the context-driven activation of concrete…", "biggest_caveat": "However, such approaches are limited by fixed variant capacity and competition between abstract and concrete semantics.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2609.15649", "difficulty": "intermediate" }, { "id": "arxiv:2609.05403", "source": "arxiv", "source_type": "preprint", "title": "RegionFed: Federated Learning for Personalized Query Understanding in Heterogeneous Retail Environments", "abstract": "Retail search systems serve diverse geographic regions with distinct query patterns, vocabularies, and product preferences, creating significant data heterogeneity that challenges both privacy-preserving training and model personalization. Federated learning offers a natural solution for privacy, but standard FL methods produce global models that sacrifice regional performance, while existing personalized FL approaches operate at the parameter level and catastrophically collapse on modern transformers (below 10\\% accuracy on T5) due to tied embeddings and LayerNorm interactions. We introduce RegionFed, an \\textit{architecture-robust} federated learning framework that sidesteps this failure by operating entirely at the gradient level. RegionFed uses the $\\ell_2$ conflict between regional and global gradients as a unified signal that (i) diagnoses heterogeneity, (ii) routes each region to the cheapest sufficient personalization strategy, and (iii) adaptively controls personalization strength. Because it treats models as differentiable black boxes, RegionFed deploys on T5-Small, T5-3B, RoBERTa, and CNN with zero code changes, providing large gains on transformers (where parameter-level methods collapse) and consistent improvements on CNNs. Across three public datasets (Amazon ESCI, Amazon Reviews, LEAF-FEMNIST) and four architectures, RegionFed-Meta achieves 92.27\\%, closing the gap to the privacy-violating centralized upper bound (Centralized + Regional Weighting: 92.04\\%, $Δ$=0.23pp, within 1$σ$) while providing $(ε{\\approx}0.60)$-differential privacy and $\\mathcal{O}(1/\\sqrt{T})$ convergence.", "authors": [ "Quoc H. Nguyen", "Ali Lafzi", "Abhijeet Phatak", "Siddharth Pratap Singh", "Rohit Upadhyay", "Yogananda Domlur Seetharama", "Chittaranjan Tripathy" ], "year": 2026, "published_date": "2026-09-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.05403", "pdf_url": "https://arxiv.org/pdf/2609.05403", "citations": 0, "topics": [], "tags": [ "Transformers", "Federated Learning", "Artificial Intelligence", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 4.92, "content_potential_score": 0.0, "interestingness_score": 1.66, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Retail search systems serve diverse geographic regions with distinct query patterns, vocabularies, and product preferences, creating significant data heterogeneity that challenges both privacy-preserving training and model personalization. Federated learning offers a natural solution for privacy, but standard FL methods produce global models that sacrifice regional performance, while existing personalized FL approaches operate at the parameter level and catastrophically collapse on modern transformers (below 10\\% accuracy on T5) due to tied embeddings and LayerNorm interactions.", "key_contribution": "We introduce RegionFed, an \\textit{architecture-robust} federated learning framework that sidesteps this failure by operating entirely at the gradient level.", "why_it_matters": "RegionFed: Federated Learning for Personalized Query Understanding in Heterogeneous Retail Environments represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "We introduce RegionFed, an \\textit{architecture-robust} federated learning framework that sidesteps this failure by…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2609.05403", "difficulty": "advanced" }, { "id": "arxiv:2606.02914", "source": "arxiv", "source_type": "preprint", "title": "Large AI Models in Dental Healthcare: From General-Purpose Systems to Domain-Specific Foundation Models", "abstract": "Background: Oral diseases affect nearly 3.5 billion people worldwide, yet the comparative clinical potential of large-scale AI models in dentistry remains poorly understood. Three distinct model categories have emerged: language-generative models, discriminative vision foundation models, and dental-specific foundation models, with no unified review examining their relationships and collective limitations. Methods: Following PRISMA-ScR guidelines, we systematically searched four databases (PubMed, Google Scholar, Scopus, arXiv), screened independently by two reviewers. After applying inclusion/exclusion criteria, 97 studies (2020-2026) were included. We propose a two-dimensional classification framework organizing models by architectural paradigm and dental specialization degree. Results: Language-generative models excel at text-based tasks (clinical reasoning, licensing exams, patient communication) but show inconsistent performance on image-dependent diagnostics. Adapted SAM and CLIP variants achieve strong tooth segmentation and lesion detection results. Dental-specific models (DentVFM, DentVLM, OralGPT) demonstrate strongest performance on complex multimodal tasks. Integrated pipelines consistently outperform single-model approaches. A data asymmetry is observed: dental-specific pretraining concentrates almost entirely in the vision domain, reflecting scarce large-scale dental text corpora. Conclusions: General-purpose and dental-specific models play complementary roles; the most effective systems combine both within structured pipelines. Safe autonomous deployment requires resolving three persistent barriers: hallucination in generative models, limited annotated dental datasets, and absent standardized clinical evaluation benchmarks.", "authors": [ "Sema Helali", "Lina Abu Nada", "Sausan Al Kawas", "Alaa Abd-Alrazaq", "Faleh Tamimi", "Rafat Damseh" ], "year": 2026, "published_date": "2026-06-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.02914", "pdf_url": "https://arxiv.org/pdf/2606.02914", "citations": 0, "topics": [], "tags": [ "Reasoning", "Hallucination", "VLMs", "Self-Supervised", "Biomedical AI" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses pretraining — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 3.93, "content_potential_score": 2.1, "interestingness_score": 2.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Background: Oral diseases affect nearly 3.5 billion people worldwide, yet the comparative clinical potential of large-scale AI models in dentistry remains poorly understood. Three distinct model categories have emerged: language-generative models, discriminative vision foundation models, and dental-specific foundation models, with no unified review examining their relationships and collective limitations.", "key_contribution": "We propose a two-dimensional classification framework organizing models by architectural paradigm and dental specialization degree.", "why_it_matters": "Large AI Models in Dental Healthcare: From General-Purpose Systems to Domain-Specific Foundation Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We propose a two-dimensional classification framework organizing models by architectural paradigm and dental…", "biggest_caveat": "but show inconsistent performance on image-dependent diagnostics.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2606.02914", "difficulty": "advanced" }, { "id": "arxiv:2607.03863", "source": "arxiv", "source_type": "preprint", "title": "Rethinking Scientific Discovery in an Agentic Era", "abstract": "Artificial intelligence has advanced scientific discovery, but most AI4Science systems remain fragmented tools that rely on humans to coordinate problem formulation, literature grounding, model use, simulation, validation, and knowledge reuse. This paper presents \\textbf{SCION (Scientific Collaborative Innovation with Agentic Organizational Nexus)}, an agentic scientific operating system that acts as an \\textbf{organizational nexus}. Through a Science Agent serving as a \\textbf{Meta-Harness}, SCION connects scientific tasks, tools, agents, artifacts, and memory, transforming research into an executable, auditable, and reusable operational process. At its core is the \\textbf{Research Execution Plan (REP)}, which compiles high-level scientific intent into staged objectives, dependencies, verification checkpoints, tool requirements, expected artifacts, and fallback conditions. SCION further integrates hierarchical multi-agent execution, profile-driven specialization, selective context construction, governed delegation, and layered epistemic memory to support long-horizon scientific work. We formulate discovery under SCION as \\textbf{Target-conditioned Inverse Search} and extend it to hidden-target settings through batch active search under finite experimental budgets. Applications in materials analysis, molecule design, and protein or antibody screening, together with experiments on scientific reading, idea generation, molecule generation, and antibody screening, show that SCION outperforms existing autonomous research-agent baselines, especially in decomposition, verification, refinement, and memory reuse. Overall, SCION shifts AI from isolated tools toward a coordinated operational layer for traceable and reusable scientific innovation.", "authors": [ "Yining Zheng", "Yuxin Wang", "Jiahao Lu", "Shicheng Fang", "Weiyi Wang", "Yongzhuo Yang", "Bowen Li", "Haochen Ma", "Chen Hu", "Bowen Chen", "Yang Wang", "Huanhui Chen", "Yitong Chen", "Jiajun Chen", "Zhiyuan Li", "Yanlin Li", "Zhuo Yang", "Qifeng Wu", "Jiaying He", "Zhijie Jinluo", "Xiaohu Xu", "Yi Feng", "Juncheng Qian", "Yizhou Chen", "Yang Cheng", "Tong Zhu", "Tianlei Ying", "Hongyu Yu", "Hongjun Xiang", "Xipeng Qiu" ], "year": 2026, "published_date": "2026-07-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.03863", "pdf_url": "https://arxiv.org/pdf/2607.03863", "citations": 0, "topics": [], "tags": [ "Hallucination", "AI Agents", "Biomedical AI", "NLP" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 4.57, "content_potential_score": 1.0, "interestingness_score": 2.16, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Artificial intelligence has advanced scientific discovery, but most AI4Science systems remain fragmented tools that rely on humans to coordinate problem formulation, literature grounding, model use, simulation, validation, and knowledge reuse. This paper presents \\textbf{SCION (Scientific Collaborative Innovation with Agentic Organizational Nexus)}, an agentic scientific operating system that acts as an \\textbf{organizational nexus}.", "key_contribution": "Applications in materials analysis, molecule design, and protein or antibody screening, together with experiments on scientific reading, idea generation, molecule generation, and antibody screening, show that SCION outperforms existing autonomous research-agent baselines, especially in decomposition, verification, refinement, and memory reuse.", "why_it_matters": "Rethinking Scientific Discovery in an Agentic Era represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "Applications in materials analysis, molecule design, and protein or antibody screening, together with experiments on…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2607.03863", "difficulty": "intermediate" }, { "id": "arxiv:2605.30998", "source": "arxiv", "source_type": "preprint", "title": "Free-Riding the Agentic Web: A Systematic Security Analysis of x402 Payments", "abstract": "The x402 protocol has crossed from prototype to infrastructure for the agentic web, driving 130 million all-time transactions and embedded in Google Cloud, Cloudflare, and Stripe. Yet bridging synchronous HTTP requests with asynchronous blockchain finality creates state-synchronization challenges, and x402's security has so far been examined only in piecemeal vendor disclosures. It is moreover not one artefact but a stack of an HTTP semantic, per-chain schemes, and a long tail of SDK and deployment choices whose required guarantees prior work has not established. We perform a systematic security analysis organized around five invariants grounded in specifications, literature, and vendor expectations, resolving every violation to the responsible layer. We identify four flaw classes: cross-resource substitution, duplicate-settlement race (independently corroborated by subsequent third-party reports), allowance overdraft, and denial of settlement. Against official SDKs and a production deployment, these reach resource-leakage ratios up to 100%. For pay-per-token scheme we prove a structural limit: no output-only pricing can be both fair to honest users and bounded against inflation of the hidden \"thinking\" tokens, the price of fairness being a $\\sqrt{1+Θ}$ manipulation gap. We propose per-flaw mitigations and a defense triple with provable guarantees, cutting per-call reasoning cost by 47% and inverting attacker leverage from 8.7$\\times$ to 0.9$\\times$ at only 2.8% overhead. All findings have been disclosed.", "authors": [ "Shengchen Ling", "Yihang Huang", "Yuefeng Du", "Yuan Chen", "Yajin Zhou", "Lei Wu", "Cong Wang" ], "year": 2026, "published_date": "2026-06-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.30998", "pdf_url": "https://arxiv.org/pdf/2605.30998", "citations": 0, "topics": [], "tags": [ "Reasoning", "AI Agents", "Robotics", "Fairness & Ethics", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 4.58, "content_potential_score": 1.84, "interestingness_score": 2.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The x402 protocol has crossed from prototype to infrastructure for the agentic web, driving 130 million all-time transactions and embedded in Google Cloud, Cloudflare, and Stripe. Yet bridging synchronous HTTP requests with asynchronous blockchain finality creates state-synchronization challenges, and x402's security has so far been examined only in piecemeal vendor disclosures.", "key_contribution": "We propose per-flaw mitigations and a defense triple with provable guarantees, cutting per-call reasoning cost by 47% and inverting attacker leverage from 8.7$\\times$ to 0.9$\\times$ at only 2.8% overhead.", "why_it_matters": "Free-Riding the Agentic Web: A Systematic Security Analysis of x402 Payments represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We propose per-flaw mitigations and a defense triple with provable guarantees, cutting per-call reasoning cost by 47%…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.30998", "difficulty": "intermediate" }, { "id": "arxiv:2312.06173", "source": "arxiv", "source_type": "preprint", "title": "Concrete Subspace Learning based Interference Elimination for Multi-task Model Fusion", "abstract": "Merging models fine-tuned from a common, extensively pre-trained large model but specialized for different tasks has been demonstrated as a cheap and scalable strategy to construct a multi-task model that performs well across diverse tasks. Recent research, exemplified by task arithmetic, highlights that this multi-task model can be derived through arithmetic operations on task vectors. Nevertheless, current merging techniques frequently resolve potential conflicts among parameters from task-specific models by evaluating individual attributes, such as the parameters' magnitude or sign, overlooking their collective impact on the overall functionality of the model. In this work, we propose the CONtinuous relaxation of disCRETE (Concrete) subspace learning method to identify a common low-dimensional subspace and utilize its shared information to track the interference problem without sacrificing much performance. Specifically, we model the problem as a bi-level optimization problem and introduce a meta-learning framework to find the Concrete subspace mask through gradient-based techniques. At the upper level, we focus on learning a shared Concrete mask to identify the subspace, while at the inner level, model merging is performed to maximize the performance of the merged model. We conduct extensive experiments on both vision domain and language domain, and the results demonstrate the effectiveness of our method. The code is available at https://github.com/tanganke/subspace_fusion", "authors": [ "Anke Tang", "Xianglin Luo", "Li Shen", "Yong Luo", "Liang Ding", "Han Hu", "Bo Du", "Dacheng Tao" ], "year": 2026, "published_date": "2026-06-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2312.06173", "pdf_url": "https://arxiv.org/pdf/2312.06173", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Info Extraction", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses multi-task — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 5.01, "content_potential_score": 2.65, "interestingness_score": 2.98, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Merging models fine-tuned from a common, extensively pre-trained large model but specialized for different tasks has been demonstrated as a cheap and scalable strategy to construct a multi-task model that performs well across diverse tasks. Recent research, exemplified by task arithmetic, highlights that this multi-task model can be derived through arithmetic operations on task vectors.", "key_contribution": "In this work, we propose the CONtinuous relaxation of disCRETE (Concrete) subspace learning method to identify a common low-dimensional subspace and utilize its shared information to track the interference problem without sacrificing much performance.", "why_it_matters": "Concrete Subspace Learning based Interference Elimination for Multi-task Model Fusion represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "In this work, we propose the CONtinuous relaxation of disCRETE (Concrete) subspace learning method to identify a common…", "biggest_caveat": "butes, such as the parameters' magnitude or sign, overlooking their collective impact on the overall functionality of the model.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2312.06173", "difficulty": "advanced" }, { "id": "arxiv:2605.18872", "source": "arxiv", "source_type": "preprint", "title": "EUPHORIA: Efficient Universal Planning via Hybrid Optimization for Robust Industrial Robotic Assembly", "abstract": "Robotic assembly in architectural construction faces a persistent bottleneck: existing planners are either highly specialized, requiring prohibitive retraining for every new geometric design, or operationally inefficient, treating structural sequencing and kinematic motion as disjoint processes. We present EUPHORIA, a unified framework that achieves universal few-shot adaptability and dynamic efficiency through a hybrid optimization strategy. To overcome the retraining bottleneck, we propose a Meta-Geometric Encoder based on Graph Hypernetworks: unlike standard contrastive learning, which performs only feature-level recognition, our hypernetwork dynamically generates policy parameters from a minimal support set, enabling parameter-level adaptation to complex topologies (e.g., domes, arches) without gradient-based retraining. For structural reasoning, we introduce a Physics-Informed Graph Transformer trained via Soft Actor-Critic (SAC), with a Physics-Bias Attention mechanism that modulates attention scores using contact forces from Discrete Element Model (DEM) simulations, guiding the planner toward structurally critical connections. We further ensure operational efficiency through Kinematics-Aware Sequencing, where the SAC objective penalizes high-energy transitions. Finally, we bridge the Sim2Real gap via Residual Stability Correction, a differentiable optimization layer that fine-tunes coarse assembly actions by minimizing a joint energy-stability cost prior to execution. Experiments show that EUPHORIA significantly reduces energy consumption over decoupled baselines and achieves state-of-the-art success rates on unseen, non-standard geometries with minimal few-shot examples, fusing meta-learning, physics-informed attention, and residual optimization into a cohesive, generalized planner.", "authors": [ "Shih-Yu Lai", "Chia-Ching Yen", "Yang-Ting Shen", "Peter Yichen Chen", "Yu-Lun Liu", "Bing-Yu Chen" ], "year": 2026, "published_date": "2026-05-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.18872", "pdf_url": "https://arxiv.org/pdf/2605.18872", "citations": 0, "topics": [], "tags": [ "Reasoning", "Prompting", "Fine-Tuning", "Info Extraction", "Transformers" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses contrastive — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 6.06, "content_potential_score": 0.0, "interestingness_score": 1.66, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Robotic assembly in architectural construction faces a persistent bottleneck: existing planners are either highly specialized, requiring prohibitive retraining for every new geometric design, or operationally inefficient, treating structural sequencing and kinematic motion as disjoint processes. We present EUPHORIA, a unified framework that achieves universal few-shot adaptability and dynamic efficiency through a hybrid optimization strategy.", "key_contribution": "We present EUPHORIA, a unified framework that achieves universal few-shot adaptability and dynamic efficiency through a hybrid optimization strategy.", "why_it_matters": "EUPHORIA: Efficient Universal Planning via Hybrid Optimization for Robust Industrial Robotic Assembly represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We present EUPHORIA, a unified framework that achieves universal few-shot adaptability and dynamic efficiency through a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.18872", "difficulty": "advanced" }, { "id": "arxiv:2602.12446", "source": "arxiv", "source_type": "preprint", "title": "Model checking with temporal graphs and their derivative", "abstract": "Temporal graphs are graphs where the presence or properties of their vertices and edges change over time. When time is discrete, a temporal graph can be defined as a sequence of static graphs over a discrete time span, called lifetime, or as a single graph where each edge is associated with a specific set of time instants where the edge is alive. For static graphs, Courcelle's Theorem asserts that any graph problem expressible in monadic second-order logic can be solved in linear time on graphs of bounded tree-width. We propose the first adaptation of Courcelle's Theorem for monadic second-order logic on temporal graphs that does not explicitly rely on a parameter proportional to the lifetime, or defined as the maximum number of time-edges incident with any vertex which in the worst case is higher than the lifetime. We then introduce the notion of derivative over a sliding time window of a chosen size, and define the tree-width and twin-width of the temporal graph's derivative. We exemplify its usefulness with meta-theorems with respect to a temporal variant of first-order logic. The resulting logic expresses a wide range of temporal graph problems including a version of temporal cliques, an important notion when querying time series databases for community structures.", "authors": [ "Binh-Minh Bui-Xuan", "Florent Krasnopol", "Bruno Monasson", "Nathalie Sznajder" ], "year": 2026, "published_date": "2026-05-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.12446", "pdf_url": "https://arxiv.org/pdf/2602.12446", "citations": 0, "topics": [], "tags": [ "Data Structures & Algorithms" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 4.46, "content_potential_score": 0.0, "interestingness_score": 1.66, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Temporal graphs are graphs where the presence or properties of their vertices and edges change over time. When time is discrete, a temporal graph can be defined as a sequence of static graphs over a discrete time span, called lifetime, or as a single graph where each edge is associated with a specific set of time instants where the edge is alive.", "key_contribution": "We propose the first adaptation of Courcelle's Theorem for monadic second-order logic on temporal graphs that does not explicitly rely on a parameter proportional to the lifetime, or defined as the maximum number of time-edges incident with any vertex which in the worst case is higher than the lifetime.", "why_it_matters": "Model checking with temporal graphs and their derivative represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Data Structures & Algorithms.", "one_line_takeaway": "We propose the first adaptation of Courcelle's Theorem for monadic second-order logic on temporal graphs that does not…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Data Structures & Algorithms.", "url": "https://arxiv.org/abs/2602.12446", "difficulty": "frontier" }, { "id": "arxiv:2605.19986", "source": "arxiv", "source_type": "preprint", "title": "Beyond Binary Success: A Diagnostic Meta-Evaluation Framework for Fine-Grained Manipulation", "abstract": "Fine-grained manipulation marks a regime where global scene context no longer suffices, and success hinges on the tight coupling of local attribute grounding, high-fidelity spatial perception, and constraint-respecting motor execution. However, current embodied AI benchmarks collapse these capacities into binary success rates, systematically inflating reported capabilities by up to 70% and masking the architectural bottlenecks that impede real-world deployment. We introduce MetaFine, a diagnostic meta-evaluation framework that disentangles manipulation competency along three axes: understanding, perception, and controlled behavior. Built on a compositional task graph, MetaFine absorbs heterogeneous external benchmarks and reconstructs them into diagnostic scenarios of varying complexity under a unified protocol. Evaluating state-of-the-art vision-language-action (VLA) models through this lens exposes severe dimension-specific failures invisible to conventional metrics. Through targeted causal intervention, we identify the visual encoder's ability to preserve local spatial structure as a key bottleneck for fine-grained precision: improving it directly unlocks previously inaccessible manipulation capabilities without modifying downstream policies. MetaFine further supports hybrid real-sim validation, using limited paired real-world rollouts to calibrate scalable simulation-based estimates for more stable physical benchmarking. By shifting evaluation from ranking to diagnosis, MetaFine turns benchmarking into an actionable compass for repairing the layered capacities underlying genuine physical dexterity. The MetaFine framework, benchmarks, and supporting resources will be publicly released at our project page: https://metafine.github.io/.", "authors": [ "He-Yang Xu", "Pengyuan Zhang", "Zongyuan Ge", "Xiaoshuai Hao", "Serge Belongie", "Xin Geng", "Yuxin Peng", "Xiu-Shen Wei" ], "year": 2026, "published_date": "2026-05-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.19986", "pdf_url": "https://arxiv.org/pdf/2605.19986", "citations": 0, "topics": [], "tags": [ "Hallucination", "Robotics", "Evaluation", "Machine Learning", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 5.19, "content_potential_score": 1.84, "interestingness_score": 2.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Fine-grained manipulation marks a regime where global scene context no longer suffices, and success hinges on the tight coupling of local attribute grounding, high-fidelity spatial perception, and constraint-respecting motor execution. However, current embodied AI benchmarks collapse these capacities into binary success rates, systematically inflating reported capabilities by up to 70% and masking the architectural bottlenecks that impede real-world deployment.", "key_contribution": "We introduce MetaFine, a diagnostic meta-evaluation framework that disentangles manipulation competency along three axes: understanding, perception, and controlled behavior.", "why_it_matters": "Beyond Binary Success: A Diagnostic Meta-Evaluation Framework for Fine-Grained Manipulation advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "We introduce MetaFine, a diagnostic meta-evaluation framework that disentangles manipulation competency along three…", "biggest_caveat": "bute grounding, high-fidelity spatial perception, and constraint-respecting motor execution.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2605.19986", "difficulty": "beginner" }, { "id": "arxiv:2605.27477", "source": "arxiv", "source_type": "preprint", "title": "Iterative Causal Discovery: Per-Edge Impossibility Certificates, Tier-Aware Oracle Queries, and the $1+K$ Lower Bound", "abstract": "Causal-discovery algorithms return a directed graph, yet provide no principled means of distinguishing edge directions identified by the data from those assigned without an identifying assumption. Under the standard Markov and faithfulness conditions, the observational distribution identifies only a Markov equivalence class; orientations within that class are not determined by the joint distribution and cannot be recovered from additional samples alone, but require either a functional restriction or an intervention. We introduce a protocol for observational causal discovery on continuous data that attaches to each candidate edge a discrete impossibility certificate: a RESOLVED code records the identifiability theorem under which the direction was committed, while an IMPOSSIBLE code records the failure mode together with the specific question a domain expert must answer to resolve it. The bivariate cascade is extended with five gated identifiability tiers LSNM, IGCI, Stein, MDL, and PEIT that abstain when their precondition test rejects. Two oracle primitives, the meta-hub query and the node-children query, jointly establish an upper bound of $1+K$ expert interactions sufficient to recover any DAG, where $K$ denotes the number of non-leaf vertices. Under an ideal-oracle assumption, the bound is met exactly on the asia, sachs, child, and alarm benchmarks.", "authors": [ "Eichi Uehara" ], "year": 2026, "published_date": "2026-05-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.27477", "pdf_url": "https://arxiv.org/pdf/2605.27477", "citations": 0, "topics": [], "tags": [ "Hallucination", "Evaluation", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 4.41, "content_potential_score": 0.0, "interestingness_score": 1.66, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Causal-discovery algorithms return a directed graph, yet provide no principled means of distinguishing edge directions identified by the data from those assigned without an identifying assumption. Under the standard Markov and faithfulness conditions, the observational distribution identifies only a Markov equivalence class; orientations within that class are not determined by the joint distribution and cannot be recovered from additional samples alone, but require either a functional restriction or an intervention.", "key_contribution": "We introduce a protocol for observational causal discovery on continuous data that attaches to each candidate edge a discrete impossibility certificate: a RESOLVED code records the identifiability theorem under which the direction was committed, while an IMPOSSIBLE code records the failure mode together with the specific question a domain expert must answer to resolve it.", "why_it_matters": "Iterative Causal Discovery: Per-Edge Impossibility Certificates, Tier-Aware Oracle Queries, and the $1+K$ Lower Bound represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "We introduce a protocol for observational causal discovery on continuous data that attaches to each candidate edge a…", "biggest_caveat": "bution and cannot be recovered from additional samples alone, but require either a functional restriction or an intervention.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2605.27477", "difficulty": "frontier" }, { "id": "arxiv:2605.07076", "source": "arxiv", "source_type": "preprint", "title": "Self-Consolidating Language Models: Continual Knowledge Incorporation from Context", "abstract": "Large language models (LLMs) increasingly receive information as streams of passages, conversations, and long-context workflows. While longer context windows expose more evidence, they do not ensure that useful information is preserved and reused. We study continual context consolidation: writing current context into model weights while limiting interference with previously consolidated information. We propose \\textbf{S}elf-\\textbf{Co}nsolidating \\textbf{L}anguage Models (SCoL), a post-training framework in which, given current context, an LLM learns to generate textual update instructions specifying which of its own Transformer layers should be updated. Because committed updates change the model that later generates future selections, we train SCoL with meta-reinforcement learning over an evolving model state. We instantiate SCoL with supervised QA rewards on SQuAD knowledge incorporation and intrinsic likelihood-based rewards for LongBench v2 long-context consolidation. Across both settings, SCoL improves acquisition and retention over prompting, summarization, batch test-time training, and sequential finetuning baselines. Analysis of learned selection patterns shows that SCoL encourages the LLM to generate sparse update locations that align with layers of high Fisher information, suggesting that the model learns to route plasticity toward loss-sensitive regions while limiting interference. Moreover, SCoL transfers from shorter meta-training streams to longer LongBench v2 streams at evaluation, suggesting that our framework supports scalable streaming consolidation.", "authors": [ "Zekun Wang", "Anant Gupta", "Zihan Dong", "Christopher J. MacLellan" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.07076", "pdf_url": "https://arxiv.org/pdf/2605.07076", "citations": 0, "topics": [], "tags": [ "LLMs", "Long Context", "Summarization", "Dialogue", "RL" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 4.44, "content_potential_score": 1.0, "interestingness_score": 2.16, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models (LLMs) increasingly receive information as streams of passages, conversations, and long-context workflows. While longer context windows expose more evidence, they do not ensure that useful information is preserved and reused.", "key_contribution": "We propose \\textbf{S}elf-\\textbf{Co}nsolidating \\textbf{L}anguage Models (SCoL), a post-training framework in which, given current context, an LLM learns to generate textual update instructions specifying which of its own Transformer layers should be updated.", "why_it_matters": "Self-Consolidating Language Models: Continual Knowledge Incorporation from Context represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose \\textbf{S}elf-\\textbf{Co}nsolidating \\textbf{L}anguage Models (SCoL), a post-training framework in which,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.07076", "difficulty": "advanced" }, { "id": "arxiv:2605.08769", "source": "arxiv", "source_type": "preprint", "title": "EvoMAS: Learning Execution-Time Workflows for Multi-Agent Systems", "abstract": "Large language model (LLM)-based multi-agent systems have shown strong potential on complex tasks through agent specialization, tool use, and collaborative reasoning. However, most automated multi-agent system design methods still follow a one-shot paradigm: a workflow is optimized or selected before execution and then reused unchanged throughout the task. This static coordination strategy is ill-suited for long-horizon tasks whose subgoals, intermediate evidence, and information needs evolve over multiple execution stages. We propose EvoMAS, a framework for execution-time multi-agent workflow construction. EvoMAS formulates workflow construction as a meta-level sequential decision problem along a single task trajectory. At each stage, it constructs an explicit task state through a Planner-Evaluator-Updater pipeline and uses a learned Workflow Adapter to instantiate a stage-specific layered workflow from a fixed pool of candidate agents. The adapter is trained with policy gradients using sparse, verifiable terminal task success as the main supervision signal, while evaluator-based process reward is analyzed separately under very-hard sparse-reward settings. Experiments on GAIA, HLE, and DeepResearcher show that EvoMAS outperforms single-agent baselines and recent automated multi-agent workflow design methods. Our analyses further show that explicit task-state construction and learned workflow adaptation provide complementary benefits. Additional results indicate that process reward is most useful when terminal success is extremely sparse, and qualitative case studies illustrate that EvoMAS adapts agent coordination as the task state evolves.", "authors": [ "Chengdong Xu", "Kaiqiang Ke", "Ziheng Liu", "Jiaqi Wei", "Zibo Shao", "Weile Guo", "Chao Yu" ], "year": 2026, "published_date": "2026-05-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.08769", "pdf_url": "https://arxiv.org/pdf/2605.08769", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Fine-Tuning", "AI Agents", "Info Extraction" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 4.62, "content_potential_score": 1.0, "interestingness_score": 2.16, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language model (LLM)-based multi-agent systems have shown strong potential on complex tasks through agent specialization, tool use, and collaborative reasoning. However, most automated multi-agent system design methods still follow a one-shot paradigm: a workflow is optimized or selected before execution and then reused unchanged throughout the task.", "key_contribution": "We propose EvoMAS, a framework for execution-time multi-agent workflow construction.", "why_it_matters": "EvoMAS: Learning Execution-Time Workflows for Multi-Agent Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose EvoMAS, a framework for execution-time multi-agent workflow construction.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.08769", "difficulty": "intermediate" }, { "id": "arxiv:2605.05273", "source": "arxiv", "source_type": "preprint", "title": "A diagrammatic proof-theoretic semantics for the Greimas semiotic square", "abstract": "We develop a diagrammatic proof system for a fragment of structural semantics inspired by the Greimas semiotic square, using spider diagrams as the underlying formalism. The basic terms are represented as diagrammatic configurations, and the relations of contradiction and implication are interpreted as transformations governed by a set of inference rules. These transformations are realised as derivations, with proof trees serving as witnesses. Our main result shows that the construction of the four meta-terms can be captured uniformly: each is derivable from a conjunctive pair of basic configurations via a fixed derivation schema composed of contour introduction and habitat transformation rules. This yields a proof-theoretic account of the combinatorial operation underlying meta-term formation, and provides a semantic interpretation of the Greimasian operation `+' as a derivational construction rather than a logical combination. We further show that diagrammatic negation in this setting is not a Boolean complement, but a restricted, zone-determined semantic counter-position, reflecting the relational character of opposition in structural semiotics. The resulting framework provides a compositional, rule-based semantics in which complex configurations are generated constructively from simpler ones. In addition to extending the expressive scope of spider diagram calculi, the system illustrates how diagrammatic reasoning can be used to formalise non-classical semantic operations within a unified inferential setting.", "authors": [ "Michael Fowler" ], "year": 2026, "published_date": "2026-05-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.05273", "pdf_url": "https://arxiv.org/pdf/2605.05273", "citations": 0, "topics": [], "tags": [ "Reasoning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.31, "read_first_score": 3.79, "content_potential_score": 0.0, "interestingness_score": 1.66, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We develop a diagrammatic proof system for a fragment of structural semantics inspired by the Greimas semiotic square, using spider diagrams as the underlying formalism. The basic terms are represented as diagrammatic configurations, and the relations of contradiction and implication are interpreted as transformations governed by a set of inference rules.", "key_contribution": "We further show that diagrammatic negation in this setting is not a Boolean complement, but a restricted, zone-determined semantic counter-position, reflecting the relational character of opposition in structural semiotics.", "why_it_matters": "A diagrammatic proof-theoretic semantics for the Greimas semiotic square represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We further show that diagrammatic negation in this setting is not a Boolean complement, but a restricted,…", "biggest_caveat": "but a restricted, zone-determined semantic counter-position, reflecting the relational character of opposition in structural semiotics.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.05273", "difficulty": "frontier" }, { "id": "arxiv:2609.16370", "source": "arxiv", "source_type": "preprint", "title": "Fast-Convergent Meta-RL via Gradient-Clustered BS Sampling for Edge Caching", "abstract": "Wireless edge caching networks typically consist of many independent Base Stations (BSs), each facing its own request rate and content popularity profile. Training a Reinforcement Learning (RL) caching agent from scratch at every BS forces each agent to relearn, through slow trial and error, a decision problem that is structurally identical across the network. Meta-reinforcement learning removes this redundancy by learning a shared initialization that adapts to any BS in a few local updates; however, meta-training itself becomes the bottleneck at scale: the meta-gradient must be estimated from a small subset of BSs at each meta-iteration, and sampling this subset uniformly at random yields a high-variance estimate, an issue existing meta-RL caching frameworks leave unaddressed. This paper proposes a meta-reinforcement learning framework for caching across independent, non-overlapping BSs that directly targets this bottleneck. Each BS runs a local Proximal Policy Optimization (PPO) agent, formulated as a Semi-Markov Decision Process (SMDP) over content popularity, size, lifetime, and importance, while a shared meta-policy is learned via a Model-Agnostic Meta-Learning (MAML)-style loop. To scale meta-training and accelerate convergence, we introduce gradient-based clustering, which groups BSs by local gradient similarity and draws from every cluster, in proportion to its size, at each meta-iteration. We prove, via an Analysis of Variance (ANOVA)-style decomposition of gradient variance, that this strategy yields a strictly lower-variance meta-gradient estimator than uniform random sampling under BS heterogeneity.", "authors": [ "Farnaz Niknia", "Ping Wang" ], "year": 2026, "published_date": "2026-09-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.16370", "pdf_url": "https://arxiv.org/pdf/2609.16370", "citations": 0, "topics": [], "tags": [ "RL", "Machine Learning", "Systems & Control" ], "paper_type": "theory", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 6.94, "content_potential_score": 0.0, "interestingness_score": 1.65, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Wireless edge caching networks typically consist of many independent Base Stations (BSs), each facing its own request rate and content popularity profile. Training a Reinforcement Learning (RL) caching agent from scratch at every BS forces each agent to relearn, through slow trial and error, a decision problem that is structurally identical across the network.", "key_contribution": "To scale meta-training and accelerate convergence, we introduce gradient-based clustering, which groups BSs by local gradient similarity and draws from every cluster, in proportion to its size, at each meta-iteration.", "why_it_matters": "Fast-Convergent Meta-RL via Gradient-Clustered BS Sampling for Edge Caching represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "To scale meta-training and accelerate convergence, we introduce gradient-based clustering, which groups BSs by local…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2609.16370", "difficulty": "beginner" }, { "id": "arxiv:2609.15623", "source": "arxiv", "source_type": "preprint", "title": "MM-LMPC: Multi-Modal Learning Model Predictive Control via Mode-Specific Terminal Design and Bandit-Based Exploration", "abstract": "Learning Model Predictive Control (LMPC) improves iterative control tasks by using previous executions to construct the terminal constraint and terminal cost of the MPC problem. Although effective, this reuse of past trajectories can make LMPC sensitive to the initial data. In particular, LMPC may repeatedly exploit stored trajectories with favorable cost-to-go values while insufficiently exploring alternative route patterns that could yield lower cost after further improvement. To address this issue, we propose Multi-Modal LMPC (MM-LMPC). The proposed framework clusters past trajectories into motion modes, constructs a mode-specific LMPC controller for each mode, and uses an LCB-based meta-controller to select which mode-specific controller to execute at each iteration. Mode information is incorporated into the terminal constraint and terminal cost through two designs. The hard-constrained design uses mode-specific terminal constraints and terminal costs constructed from the data associated with each mode. The soft-regularized design retains a shared terminal constraint while adding membership-based penalties to the terminal cost. These designs reduce the bias caused by pooling all trajectories into a single terminal memory while retaining the recursive feasibility and stability structure of LMPC. Our theoretical analysis shows that both designs preserve recursive feasibility and closed-loop stability. For the hard-constrained design, we further establish mode-wise cost convergence, asymptotic best-mode performance, and a logarithmic cumulative regret bound under the LCB rule. Simulations on multi-route obstacle-avoidance tasks show that MM-LMPC improves exploration and achieves lower costs than standard LMPC.", "authors": [ "Wataru Hashimoto", "Kazumune Hashimoto", "Masako Kishida" ], "year": 2026, "published_date": "2026-09-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.15623", "pdf_url": "https://arxiv.org/pdf/2609.15623", "citations": 0, "topics": [], "tags": [ "Multimodal", "Fairness & Ethics", "Systems & Control" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses regret bound and related concepts.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.59, "content_potential_score": 0.0, "interestingness_score": 1.65, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Learning Model Predictive Control (LMPC) improves iterative control tasks by using previous executions to construct the terminal constraint and terminal cost of the MPC problem. Although effective, this reuse of past trajectories can make LMPC sensitive to the initial data.", "key_contribution": "To address this issue, we propose Multi-Modal LMPC (MM-LMPC).", "why_it_matters": "MM-LMPC: Multi-Modal Learning Model Predictive Control via Mode-Specific Terminal Design and Bandit-Based Exploration represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "To address this issue, we propose Multi-Modal LMPC (MM-LMPC).", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2609.15623", "difficulty": "frontier" }, { "id": "arxiv:2609.15895", "source": "arxiv", "source_type": "preprint", "title": "Goal-Oriented Communications for Physical AI: Design and Testbed", "abstract": "Physical AI relies on frequently-updated, latency-sensitive video stream to perceive, reason, and interact with the physical world, resulting in strict latency requirements with much higher data volumes that existing 5G networks cannot support. Goal-oriented communication (GoC) offers as a promising approach to solve this challenge by transmitting only task-relevant semantic representations. However, existing GoC frameworks were mainly evaluated in the simulations while their effectiveness has never been validated in a practical deployment of physical AI application. In this work, we develop an end-to-end GoC testbed for Physical AI, which connects a PiPER robot arm equipped with an RGB-D camera and a 5G modem to an NVIDIA Jetson AGX Orin edge server through a 5G OpenAirInterface network. We propose and implement three GoC frameworks that transmit 3D bounding boxes, 2D scene graphs, and 3D scene graphs, as three types of semantic representations, respectively. They share the common functional modules designed for closed-loop Physical AI applications, including semantic extraction, full stack 5G transmission, language model inference, digital twin validation, and robotic control. Extensive experiments on our testbed show that our GoC frameworks reduce the task completion time by up to 52.6% and improve task success probability by up to 45%, compared to the traditional framework that periodically transmits the raw image data. These results validate the practical effectiveness of our GoC framework and pave the way for efficient and reliable Physical AI applications over future 6G networks. Project website: https://sites.google.com/view/goc-physical-ai-testbed.", "authors": [ "Shutong Chen", "Wenkai Zhang", "Adnan Aijaz", "Miao Guo", "Yansha Deng" ], "year": 2026, "published_date": "2026-09-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.15895", "pdf_url": "https://arxiv.org/pdf/2609.15895", "citations": 0, "topics": [], "tags": [ "3D Vision", "Robotics" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.39, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Physical AI relies on frequently-updated, latency-sensitive video stream to perceive, reason, and interact with the physical world, resulting in strict latency requirements with much higher data volumes that existing 5G networks cannot support. Goal-oriented communication (GoC) offers as a promising approach to solve this challenge by transmitting only task-relevant semantic representations.", "key_contribution": "We propose and implement three GoC frameworks that transmit 3D bounding boxes, 2D scene graphs, and 3D scene graphs, as three types of semantic representations, respectively.", "why_it_matters": "Goal-Oriented Communications for Physical AI: Design and Testbed represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about 3D Vision.", "one_line_takeaway": "We propose and implement three GoC frameworks that transmit 3D bounding boxes, 2D scene graphs, and 3D scene graphs, as…", "biggest_caveat": "cannot support.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in 3D Vision.", "url": "https://arxiv.org/abs/2609.15895", "difficulty": "intermediate" }, { "id": "arxiv:2608.12984", "source": "arxiv", "source_type": "preprint", "title": "Reconcile Once, Write Anytime: A Trust-Tiered Librarian and a Multi-Agent Writer for Drift-Free, Point-in-Time Research", "abstract": "Long-form research reports generated by large language models drift, contradict themselves, and lose provenance: the same metric appears with different values, and rumor is quoted as confidently as an audited filing. We present a two-tier agentic system that separates a maintained, point-in-time knowledge library from report writing. A deterministic \"librarian\" ingests timestamped sources into a trust-tiered ontology, layering evidence cards, an authoritative metric ledger, and a claim graph into an always-current source of truth, not per-query RAG over raw chunks. A portable multi-agent \"writer\" runtime then composes a contradiction-free, evidence-grounded report at any knowledge cutoff T, reading only evidence with as_of <= T (no look-ahead); red-team verdicts flow back into the librarian. We evaluate on a self-collected, public corpus of 6,130 sources yielding 555,926 evidence cards (SEC EDGAR filings across 295 issuers and 11 sectors, U.S. Bureau of Labor Statistics releases, and Wikipedia). From the one library we compose four point-in-time reports on distinct theses and run eight reproducible experiments, whose headline metrics come from a deterministic quality-control gate, itself validated by defect-injection meta-evaluation at recall 1.0 and precision 1.0. A shared metric ledger removes 6,845 cross-section contradictions to zero. Tier-first selection is correct on 22/22 gold cases where a popularity-first baseline scores only 9/22; trust tiering leaks zero media-sourced numbers, and no government statistic displaces a company's own filing. A red-team refutation propagates back and self-corrects a later run with zero manual edits. Replay exhibits zero look-ahead violations across seven cutoffs while the library grows from 235,373 to 555,312 cards. Difficulty-tiered model routing exceeds the all-Opus quality ceiling while running 3.7x faster than serial.", "authors": [ "Xing Zhang", "Yanwei Cui", "Guanghui Wang", "Peiyang He" ], "year": 2026, "published_date": "2026-08-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.12984", "pdf_url": "https://arxiv.org/pdf/2608.12984", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "RAG", "Knowledge Graphs", "Multi-Agent Systems" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.23, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Long-form research reports generated by large language models drift, contradict themselves, and lose provenance: the same metric appears with different values, and rumor is quoted as confidently as an audited filing. We present a two-tier agentic system that separates a maintained, point-in-time knowledge library from report writing.", "key_contribution": "We present a two-tier agentic system that separates a maintained, point-in-time knowledge library from report writing.", "why_it_matters": "Reconcile Once, Write Anytime: A Trust-Tiered Librarian and a Multi-Agent Writer for Drift-Free, Point-in-Time Research represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a two-tier agentic system that separates a maintained, point-in-time knowledge library from report writing.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.12984", "difficulty": "intermediate" }, { "id": "arxiv:2608.13382", "source": "arxiv", "source_type": "preprint", "title": "A Dense Weisfeiler-Leman Algorithm for Deciding Bounded-Cliquewidth Homomorphism Indistinguishability", "abstract": "Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\\mathcal{F}$ if they admit the same number of homomorphisms from every graph in $\\mathcal{F}$. A wide range of relaxations of graph isomorphism arise this way: isomorphism itself over the class of all graphs [Lovász, Acta Math. Hung. 1967], equivalence under the $k$-dimensional Weisfeiler-Leman algorithm over the graphs of treewidth $\\leq k$ [Dvořák, J. Graph Theory 2010], and quantum isomorphism over planar graphs [Mančinska-Roberson, FOCS 2020]. Since the class $\\mathcal{F}$ is typically infinite, it is not clear a priori whether homomorphism indistinguishability over $\\mathcal{F}$ is decidable; for planar graphs it is undecidable. Every class for which decidability was previously known is sparse. We give the first decidability results for dense graph classes: We introduce the dense Weisfeiler-Leman algorithm that decides homomorphism indistinguishability over the class of graphs of cliquewidth $\\leq k$, the dense counterpart of treewidth. This relation was not previously known to be decidable. The algorithm colors $k$-tuples of vertex subsets rather than $k$-tuples of vertices. Beyond the class of all graphs of cliquewidth $\\leq k$, we prove a general meta-theorem: homomorphism indistinguishability over every $\\mathsf{CMSO}_1$-definable graph class of bounded cliquewidth is decidable, in randomized exponential time. For classes of bounded linear cliquewidth the bound improves to $\\mathsf{PSPACE}$, and we show this is tight by exhibiting such a class for which the problem is $\\mathsf{PSPACE}$-complete. These are the first general algorithms for homomorphism indistinguishability over dense graph classes.", "authors": [ "Radu Curticapean", "Daniel Neuen", "Amir Nikabadi", "Tim Seppelt", "Ben Young" ], "year": 2026, "published_date": "2026-08-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.13382", "pdf_url": "https://arxiv.org/pdf/2608.13382", "citations": 0, "topics": [], "tags": [], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.3, "content_potential_score": 0.0, "interestingness_score": 1.65, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\\mathcal{F}$ if they admit the same number of homomorphisms from every graph in $\\mathcal{F}$. A wide range of relaxations of graph isomorphism arise this way: isomorphism itself over the class of all graphs [Lovász, Acta Math.", "key_contribution": "We give the first decidability results for dense graph classes: We introduce the dense Weisfeiler-Leman algorithm that decides homomorphism indistinguishability over the class of graphs of cliquewidth $\\leq k$, the dense counterpart of treewidth.", "why_it_matters": "A Dense Weisfeiler-Leman Algorithm for Deciding Bounded-Cliquewidth Homomorphism Indistinguishability represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "We give the first decidability results for dense graph classes: We introduce the dense Weisfeiler-Leman algorithm that…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2608.13382", "difficulty": "frontier" }, { "id": "arxiv:2608.07712", "source": "arxiv", "source_type": "preprint", "title": "SpikeWorld: Fast-State Adaptation for Frozen Spiking World Models", "abstract": "A predictive model receives a self-supervised signal whenever the consequence of an action is observed. Using that signal after deployment is difficult when dynamics and semantics share parameters: freezing prevents adaptation, whereas weight updates require optimizer state and may alter the learned representation. Here we introduce SpikeWorld, a 1.45M-parameter sparse spiking model jointly trained for heterogeneous sensory prediction, semantics, image-text binding and action-conditioned dynamics. At deployment, all trained parameters are frozen. Delayed next-state residuals update two external paths: cumulative fixed-bank losses select the bounded action correction, while route-specific residual matrices refine next-state prediction. Neither path uses labels, teacher outputs, rewards, success signals or the true shift value. Joint optimization improves action next-state MSE by 17.10\\% while also improving multimodal prediction, semantic accuracy and image-text retrieval. On held-out shear and attenuation streams, the combined external state improves aggregate prediction by 5.48\\% and 30.01\\%; its fixed-bank action path improves tracking by 24.20\\% and 3.94\\%, respectively. In a six-arm study comprising 450 new Meta-World trajectories (75 per arm), SpikeWorld raises frozen-policy reward by 7.90 (95\\% CI [2.48, 14.06]); the 13.33-point success difference is descriptive (CI [0, 40]). For identical sensory inputs, model parameters and inherited semantic outputs remain bitwise unchanged. A 16-byte RLS estimator obtains the highest non-oracle reward on linear attenuation, showing that the contribution is not superior linear identification, but its integration with a frozen multimodal spiking checkpoint. Reference code is publicly available at https://github.com/Oooorca/SpikeWorld.", "authors": [ "Ziqiao Yu" ], "year": 2026, "published_date": "2026-08-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.07712", "pdf_url": "https://arxiv.org/pdf/2608.07712", "citations": 0, "topics": [], "tags": [ "VLMs", "Self-Supervised", "Artificial Intelligence", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses self-supervised — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.09, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "A predictive model receives a self-supervised signal whenever the consequence of an action is observed. Using that signal after deployment is difficult when dynamics and semantics share parameters: freezing prevents adaptation, whereas weight updates require optimizer state and may alter the learned representation.", "key_contribution": "Here we introduce SpikeWorld, a 1.45M-parameter sparse spiking model jointly trained for heterogeneous sensory prediction, semantics, image-text binding and action-conditioned dynamics.", "why_it_matters": "SpikeWorld: Fast-State Adaptation for Frozen Spiking World Models advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about VLMs.", "one_line_takeaway": "Here we introduce SpikeWorld, a 1.45M-parameter sparse spiking model jointly trained for heterogeneous sensory…", "biggest_caveat": "bution is not superior linear identification, but its integration with a frozen multimodal spiking checkpoint.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in VLMs.", "url": "https://arxiv.org/abs/2608.07712", "difficulty": "advanced" }, { "id": "arxiv:2608.04285", "source": "arxiv", "source_type": "preprint", "title": "The RAIL Principles for Neurosymbolic AI: Reasoning, Assurances, Interfacing and Learning", "abstract": "Neurosymbolic AI systems that integrate machine learning and symbolic reasoning are rapidly gaining attention. They complement the data-intensive statistical approaches of neural networks and language models with symbolic reasoning algorithms to function in high-stakes domains or in low-data regimes that characterize many real-world applications. We argue that the neurosymbolic combination of machine learning and formal reasoning is not a niche approach within AI, but rather includes many already successful techniques that are of crucial importance to the development of reliable, efficient and, ultimately, trustworthy systems. This perspective prompts a re-examination of the design of current AI systems. We show that many leading AI systems, including some that are not traditionally considered as neurosymbolic, can be analysed from the perspective of four principles of neurosymbolic AI design: Reasoning, Assurances, Interfacing and Learning (RAIL). Applying the RAIL framework offers a unified view of seemingly disparate AI systems, ranging from physics-aware machine learning to neuro-guided search (such as Google DeepMind's Alpha-* suite), causal learning and tool-augmented Large Language Models. Importantly, the RAIL principles will enable engineers to make better-informed and more principled decisions about the design and deployment of production-level AI systems. In this article, we introduce the RAIL principles, examine how they can be applied across major areas of AI, and illustrate how they may guide practitioners to integrate neurosymbolic methods into next-generation AI technologies.", "authors": [ "Agnese Chiatti", "Michael Cochez", "Cristina Cornelio", "Sebastijan Dumancic", "Artur d'Avila Garcez", "Luis C. Lamb", "Lia Morra", "Mathias Niepert", "Robert Peharz", "Alberto Speranzon", "Maarten Stol", "Annette Ten Teije", "Thiviyan Thanapalasingam", "Frank Van Harmelen", "Emile Van Krieken", "Antonio Vergari", "Benjie Wang" ], "year": 2026, "published_date": "2026-08-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.04285", "pdf_url": "https://arxiv.org/pdf/2608.04285", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Machine Learning", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.31, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Neurosymbolic AI systems that integrate machine learning and symbolic reasoning are rapidly gaining attention. They complement the data-intensive statistical approaches of neural networks and language models with symbolic reasoning algorithms to function in high-stakes domains or in low-data regimes that characterize many real-world applications.", "key_contribution": "We show that many leading AI systems, including some that are not traditionally considered as neurosymbolic, can be analysed from the perspective of four principles of neurosymbolic AI design: Reasoning, Assurances, Interfacing and Learning (RAIL).", "why_it_matters": "The RAIL Principles for Neurosymbolic AI: Reasoning, Assurances, Interfacing and Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We show that many leading AI systems, including some that are not traditionally considered as neurosymbolic, can be…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.04285", "difficulty": "intermediate" }, { "id": "arxiv:2607.23304", "source": "arxiv", "source_type": "preprint", "title": "Context-Adaptive Inference: A Unified Statistical and Foundation-Model View", "abstract": "Modern predictive systems are expected to adapt their behavior to the specific situation they are facing. A clinical model should not treat every patient the same; a retrieval-augmented model should change its answer when given different evidence; a mixture-of-experts model should route different inputs to different experts. We call this capability context-adaptive inference: before predicting, the system uses information about the current context to specialize its parameters or computation for that instance. This article provides a unified view of context-adaptive inference across three traditions that are usually treated separately: (i) explicit adaptation in statistics (e.g. varying-coefficient models, local regression, hierarchical sharing), (ii) rapid task-specific adaptation in meta-learning and transfer, and (iii) implicit adaptation in large foundation models via prompting, retrieval, and expert routing. We formalize these approaches under a common objective: to map context $c$ to adapted parameters $θ(c)$, then to predict via $f(x; θ(c))$. Under squared loss, linear prediction heads, and fixed features, we prove that explicit parameter adaptation and implicit routing are mathematically equivalent to kernel ridge regression on joint features of inputs and context. Building on this bridge, we propose practical design principles and evaluation metrics including adaptation-efficiency, routing stability, and context-specific robustness to guide when to specialize, how to constrain that specialization, and how to audit context-adaptive models in deployment. Finally, we identify open problems in identifiability, robustness under distribution shift, and efficient large-scale adaptation, outlining design principles for methods that are scalable, reliable, and transparent in real-world settings.", "authors": [ "Yue Yao", "Caleb N. Ellington", "Jingyun Jia", "Baiheng Chen", "Dong Liu", "Rikhil Rao", "Jiaqi Wang", "Samuel Wales-McGrath", "Yixin Yang", "Zhiyuan Li", "Eric P. Xing", "Ben Lengerich" ], "year": 2026, "published_date": "2026-07-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.23304", "pdf_url": "https://arxiv.org/pdf/2607.23304", "citations": 0, "topics": [], "tags": [ "Biomedical AI", "Adversarial", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Modern predictive systems are expected to adapt their behavior to the specific situation they are facing. A clinical model should not treat every patient the same; a retrieval-augmented model should change its answer when given different evidence; a mixture-of-experts model should route different inputs to different experts.", "key_contribution": "Building on this bridge, we propose practical design principles and evaluation metrics including adaptation-efficiency, routing stability, and context-specific robustness to guide when to specialize, how to constrain that specialization, and how to audit context-adaptive models in deployment.", "why_it_matters": "Context-Adaptive Inference: A Unified Statistical and Foundation-Model View represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Biomedical AI.", "one_line_takeaway": "Building on this bridge, we propose practical design principles and evaluation metrics including adaptation-efficiency,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Biomedical AI.", "url": "https://arxiv.org/abs/2607.23304", "difficulty": "intermediate" }, { "id": "arxiv:2603.26667", "source": "arxiv", "source_type": "preprint", "title": "M-RAG: Semantic Key-Value Indexing for Retrieval-Augmented Generation", "abstract": "Retrieval-augmented generation (RAG) turns external documents into evidence for large language models. In practice, this is also a data access problem: a system must decide what to index, what to retrieve, and what evidence to place in the context under a token budget. Most RAG pipelines use text chunks for both lookup and generation. This couples two different objectives. Retrieval benefits from compact and discriminative records, while generation needs contextual and faithful evidence. As a result, small chunks may fragment answer-bearing information, whereas large chunks may introduce noise and waste the context budget. We propose M-RAG, a semantic key-value indexing layer for budget-constrained RAG query processing. M-RAG extracts meta-markers from complete documents, where each record contains a retrieval key, an information value, and provenance pointers. Online retrieval operates over the key field, which can be searched by dense vector retrieval or sparse lexical retrieval; the paired values are returned as generation payloads and assembled under the token budget. Provenance pointers further support coverage validation and position-aware context ordering. This design separates the physical index entry from the evidence payload without changing the underlying retriever or generator. Experiments on LongBench QA subtasks show that M-RAG achieves competitive or better accuracy than representative chunk-based baselines, especially under tight token budgets. Further analyses show high document coverage, stronger robustness under expanding candidate corpora, and lower online retrieval latency. These results suggest that semantic key-value indexing is a practical access method for RAG workloads.", "authors": [ "Xu Sun", "Tongkai Xu", "Baiheng Xie", "Li Huang", "Qiang Gao", "Kunpeng Zhang" ], "year": 2026, "published_date": "2026-07-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.26667", "pdf_url": "https://arxiv.org/pdf/2603.26667", "citations": 0, "topics": [], "tags": [ "LLMs", "RAG", "Embeddings", "Artificial Intelligence", "Information Retrieval" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Retrieval-augmented generation (RAG) turns external documents into evidence for large language models. In practice, this is also a data access problem: a system must decide what to index, what to retrieve, and what evidence to place in the context under a token budget.", "key_contribution": "As a result, small chunks may fragment answer-bearing information, whereas large chunks may introduce noise and waste the context budget.", "why_it_matters": "M-RAG: Semantic Key-Value Indexing for Retrieval-Augmented Generation improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "As a result, small chunks may fragment answer-bearing information, whereas large chunks may introduce noise and waste…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2603.26667", "difficulty": "intermediate" }, { "id": "arxiv:2607.18329", "source": "arxiv", "source_type": "preprint", "title": "Dynamic Loss Balancing for Joint SOH and RUL Prediction of Lithium-Ion Batteries via a Rotary SOH-Injected Prior Battery Transformer", "abstract": "The deployment of reliable lithium-ion battery management systems is crucial for accelerating electrification, yet the joint prognosis of State of Health (SOH) and Remaining Useful Life (RUL) remains severely hindered by task heteroscedasticity. Conventional multi-task learning frameworks fail to balance the bounded, low-variance noise of SOH estimation with the unbounded, nonlinearly expanding uncertainty of long-term RUL predictions. Here, we present the Rotary SOH-Injected Prior Battery Transformer (RoSIP-Batt), a unified co-estimation framework that resolves these optimization conflicts. By formulating joint prediction as a Bayesian multi-task objective, RoSIP-Batt introduces a homoscedastic uncertainty weighting mechanism to dynamically scale task-specific gradients based on learned residual noise levels. The architecture leverages decoupled dual classification tokens and a per-dimension gated fusion mechanism, secured by a gradient-detachment operator to prevent high-variance RUL updates from corrupting the stable SOH representation space. To capture electrochemical degradation patterns without relying on absolute cycle steps, Rotary Position Embedding (RoPE) is incorporated into a shared Transformer backbone to model translation-invariant relative temporal profiles. Crucially, the intermediate SOH estimate is directly injected into the RUL regression head as a physical degradation prior. Evaluations across the NASA, MIT-Stanford, and HUST datasets show that RoSIP-Batt significantly outperforms state-of-the-art baselines, reducing SOH estimation error to 1.994% MAE on NASA and restricting RUL prediction error to 62.85 cycles on Stanford. These findings establish RoSIP-Batt as a highly generalizable, computationally efficient solution suitable for real-time embedded BMS deployment.", "authors": [ "Shuhao Chen", "Tianyu Shi", "Yiwen Huang", "Chengyi Tu" ], "year": 2026, "published_date": "2026-07-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.18329", "pdf_url": "https://arxiv.org/pdf/2607.18329", "citations": 0, "topics": [], "tags": [ "Transformers", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.08, "content_potential_score": 1.55, "interestingness_score": 2.42, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The deployment of reliable lithium-ion battery management systems is crucial for accelerating electrification, yet the joint prognosis of State of Health (SOH) and Remaining Useful Life (RUL) remains severely hindered by task heteroscedasticity. Conventional multi-task learning frameworks fail to balance the bounded, low-variance noise of SOH estimation with the unbounded, nonlinearly expanding uncertainty of long-term RUL predictions.", "key_contribution": "Here, we present the Rotary SOH-Injected Prior Battery Transformer (RoSIP-Batt), a unified co-estimation framework that resolves these optimization conflicts.", "why_it_matters": "Dynamic Loss Balancing for Joint SOH and RUL Prediction of Lithium-Ion Batteries via a Rotary SOH-Injected Prior Battery Transformer represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "Here, we present the Rotary SOH-Injected Prior Battery Transformer (RoSIP-Batt), a unified co-estimation framework that…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2607.18329", "difficulty": "frontier" }, { "id": "arxiv:2607.18330", "source": "arxiv", "source_type": "preprint", "title": "Physics-Guided Masked Multi-Task Network for Edge-Friendly Battery Health Diagnostics from Sto-chastically Fragmented Charging Profiles", "abstract": "The deployment of reliable lithium-ion battery management systems is crucial for accelerating electrification, yet the joint prognosis of State of Health (SOH) and Remaining Useful Life (RUL) remains severely hindered by task heteroscedasticity. Conventional multi-task learning frameworks fail to balance the bounded, low-variance noise of SOH estimation with the unbounded, nonlinearly expanding uncertainty of long-term RUL predictions. Here, we present the Rotary SOH-Injected Prior Battery Transformer (RoSIP-Batt), a unified co-estimation framework that resolves these optimization conflicts. By formulating joint prediction as a Bayesian multi-task objective, RoSIP-Batt introduces a homoscedastic uncertainty weighting mechanism to dynamically scale task-specific gradients based on learned residual noise levels. The architecture leverages decoupled dual classification tokens and a per-dimension gated fusion mechanism, secured by a gradient-detachment operator to prevent high-variance RUL updates from corrupting the stable SOH representation space. To capture electrochemical degradation patterns without relying on absolute cycle steps, Rotary Position Embedding (RoPE) is incorporated into a shared Transformer backbone to model translation-invariant relative temporal profiles. Crucially, the intermediate SOH estimate is directly injected into the RUL regression head as a physical degradation prior. Evaluations across the NASA, MIT-Stanford, and HUST datasets show that RoSIP-Batt significantly outperforms state-of-the-art baselines, reducing SOH estimation error to 1.994% MAE on NASA and restricting RUL prediction error to 62.85 cycles on Stanford. These findings establish RoSIP-Batt as a highly generalizable, computationally efficient solution suitable for real-time embedded BMS deployment.", "authors": [ "Shuhao Chen", "Tianyu Shi", "Chengyi Tu" ], "year": 2026, "published_date": "2026-07-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.18330", "pdf_url": "https://arxiv.org/pdf/2607.18330", "citations": 0, "topics": [], "tags": [ "Transformers", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.58, "content_potential_score": 1.55, "interestingness_score": 2.42, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The deployment of reliable lithium-ion battery management systems is crucial for accelerating electrification, yet the joint prognosis of State of Health (SOH) and Remaining Useful Life (RUL) remains severely hindered by task heteroscedasticity. Conventional multi-task learning frameworks fail to balance the bounded, low-variance noise of SOH estimation with the unbounded, nonlinearly expanding uncertainty of long-term RUL predictions.", "key_contribution": "Here, we present the Rotary SOH-Injected Prior Battery Transformer (RoSIP-Batt), a unified co-estimation framework that resolves these optimization conflicts.", "why_it_matters": "Physics-Guided Masked Multi-Task Network for Edge-Friendly Battery Health Diagnostics from Sto-chastically Fragmented Charging Profiles represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "Here, we present the Rotary SOH-Injected Prior Battery Transformer (RoSIP-Batt), a unified co-estimation framework that…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2607.18330", "difficulty": "frontier" }, { "id": "arxiv:2511.23213", "source": "arxiv", "source_type": "preprint", "title": "GAPS: Targeted Execution of Android Apps via Static Path Reconstruction", "abstract": "Targeted execution of Android applications (apps) remains a longstanding challenge for software testing and analysis. Although recent advances in GUI testing have substantially improved app exploration, existing approaches remain largely coverage-driven and struggle to steer execution reliably toward specific methods of interest. This limitation hinders important downstream tasks, such as vulnerability detection, program comprehension, and dynamic analysis. We present GAPS (Graph-based Automated Path Synthesizer), the first approach to bridge static program analysis and dynamic GUI exploration, enabling targeted execution in Android apps. Given a target method, GAPS performs a lightweight static backward traversal of the call graph, enriched with data-flow reasoning, to identify feasible execution paths that lead to the target. It then translates these paths into actionable execution strategies that guide dynamic interactions with the app. We evaluate GAPS on the AndroTest benchmark and show that it reconstructs paths toward 88.24% of the target methods, requiring only 12.67 seconds per app on average. During dynamic execution, GAPS reaches 56.93% of the target methods, outperforming state-of-the-art alternatives. In comparison, the model-based GUI testing tool APE reaches only 11.12%, the hybrid exploration framework GoalExplorer reaches 4.75%, and the recent LLM-driven approach Guardian reaches 34%. To assess scalability in real-world settings, we further evaluate GAPS across the 50 most-downloaded apps on the Google Play Store. GAPS reconstructs execution paths toward 62.03% of the target methods, averaging 278.9 seconds per app, and dynamically reaches 54.80% of them. These results show that combining static path synthesis with guided dynamic exploration provides an effective and scalable solution for targeted method execution in Android apps.", "authors": [ "Samuele Doria", "Alexander Pilgun", "Jordan Samhi", "Jacques Klein", "Eleonora Losiouk" ], "year": 2026, "published_date": "2026-07-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.23213", "pdf_url": "https://arxiv.org/pdf/2511.23213", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Evaluation", "Software Engineering" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.83, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Targeted execution of Android applications (apps) remains a longstanding challenge for software testing and analysis. Although recent advances in GUI testing have substantially improved app exploration, existing approaches remain largely coverage-driven and struggle to steer execution reliably toward specific methods of interest.", "key_contribution": "We present GAPS (Graph-based Automated Path Synthesizer), the first approach to bridge static program analysis and dynamic GUI exploration, enabling targeted execution in Android apps.", "why_it_matters": "GAPS: Targeted Execution of Android Apps via Static Path Reconstruction represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present GAPS (Graph-based Automated Path Synthesizer), the first approach to bridge static program analysis and…", "biggest_caveat": "limitation hinders important downstream tasks, such as vulnerability detection, program comprehension, and dynamic analysis.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2511.23213", "difficulty": "beginner" }, { "id": "arxiv:2509.21842", "source": "arxiv", "source_type": "preprint", "title": "DeepTravel: An End-to-End Agentic Reinforcement Learning Framework for Autonomous Travel Planning Agents", "abstract": "Travel planning (TP) agent has recently worked as an emerging building block to interact with external tools/resources for travel itinerary generation, ensuring an enjoyable user experience. Despite its benefits, existing studies rely on hand-craft prompt and fixed agent workflow, hindering more flexible and autonomous TP agents. This paper proposes DeepTravel, an end-to-end agentic reinforcement learning framework for building an autonomous travel planning agent, capable of autonomously planning, executing tools, and reflecting on tool responses to explore, verify, and refine intermediate actions in multi-step reasoning. To achieve this, we first construct a robust travel sandbox by caching transportation, accommodation and POI data, facilitating TP agent training without being constrained by real-world APIs limitations (e.g., inconsistent outputs). Moreover, we develop a hierarchical reward modeling system, where a trajectory-level verifier first checks spatiotemporal feasibility and filters unsatisfied travel itinerary, and then the turn-level verifier further validate itinerary's detail consistency with tool responses, enabling efficient and precise reward service. Finally, we propose the reply-augmented reinforcement learning method that enables TP agent to periodically replay from a failure experience buffer, emerging notable agentic capacity. We deploy the trained TP agent in the DiDi Enterprise Solutions application. A three-month online test shows that it achieves 82% accuracy in travel itinerary generation. Comprehensive offline evaluations further demonstrate that DeepTravel enables small-sized LLMs (e.g., Qwen3-32B) to significantly outperform frontier LLMs (e.g., OpenAI o1/o3 and DeepSeek-R1) and existing TP agent frameworks.", "authors": [ "Yansong Ning", "Rui Liu", "Jun Wang", "Kai Chen", "Wei Li", "Jun Fang", "Kan Zheng", "Naiqiang Tan", "Hao Liu" ], "year": 2026, "published_date": "2026-07-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.21842", "pdf_url": "https://arxiv.org/pdf/2509.21842", "citations": 0, "topics": [], "tags": [ "Reasoning", "RLHF", "AI Agents", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.76, "content_potential_score": 0.0, "interestingness_score": 1.65, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Travel planning (TP) agent has recently worked as an emerging building block to interact with external tools/resources for travel itinerary generation, ensuring an enjoyable user experience. Despite its benefits, existing studies rely on hand-craft prompt and fixed agent workflow, hindering more flexible and autonomous TP agents.", "key_contribution": "To achieve this, we first construct a robust travel sandbox by caching transportation, accommodation and POI data, facilitating TP agent training without being constrained by real-world APIs limitations (e.g., inconsistent outputs).", "why_it_matters": "DeepTravel: An End-to-End Agentic Reinforcement Learning Framework for Autonomous Travel Planning Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "To achieve this, we first construct a robust travel sandbox by caching transportation, accommodation and POI data,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2509.21842", "difficulty": "advanced" }, { "id": "arxiv:2607.11600", "source": "arxiv", "source_type": "preprint", "title": "Privacy-Aware Collaborative and Distributed Bayesian Optimization", "abstract": "We propose a collaborative meta-learning framework for distributed Bayesian optimization matching centralized performance without raw-data exchange. We show gradient sharing leaks client observations, with leakage worsening as the search converges and queries concentrate near the optimum. We evaluate a differentially private defense and characterize its privacy-utility trade-off.", "authors": [ "Aditya Rane", "Sathwik Yamana", "Paritosh Ramanan", "Srikanthan Ramesh", "Akash Deep" ], "year": 2026, "published_date": "2026-07-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.11600", "pdf_url": "https://arxiv.org/pdf/2607.11600", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 2.64, "content_potential_score": 0.0, "interestingness_score": 1.65, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We propose a collaborative meta-learning framework for distributed Bayesian optimization matching centralized performance without raw-data exchange. We show gradient sharing leaks client observations, with leakage worsening as the search converges and queries concentrate near the optimum.", "key_contribution": "We propose a collaborative meta-learning framework for distributed Bayesian optimization matching centralized performance without raw-data exchange.", "why_it_matters": "Privacy-Aware Collaborative and Distributed Bayesian Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "We propose a collaborative meta-learning framework for distributed Bayesian optimization matching centralized…", "biggest_caveat": "buted Bayesian optimization matching centralized performance without raw-data exchange.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Machine Learning.", "url": "https://arxiv.org/abs/2607.11600", "difficulty": "frontier" }, { "id": "arxiv:2512.23236", "source": "arxiv", "source_type": "preprint", "title": "KernelEvolve: Scaling Agentic Kernel Coding for Heterogeneous AI Accelerators at Meta", "abstract": "Making deep learning recommendation model (DLRM) training and inference fast and efficient is important. However, this presents three key system challenges - model architecture diversity, kernel primitive diversity, and hardware generation and architecture heterogeneity. This paper presents KernelEvolve-an agentic kernel coding framework-to tackle heterogeneity at-scale for DLRM. KernelEvolve is designed to take kernel specifications as input and automate the process of kernel generation and optimization for recommendation model across heterogeneous hardware architectures. KernelEvolve does so by operating at multiple programming abstractions, from Triton and CuTe DSL to low-level hardware agnostic languages, spanning the full hardware-software optimization stack. The kernel optimization process is described as graph-based search with selection policy, universal operator, fitness function, and termination rule, dynamically adapts to runtime execution context through retrieval-augmented prompt synthesis. We designed, implemented, and deployed KernelEvolve to optimize a wide variety of production recommendation models across generations of NVIDIA and AMD GPUs, as well as Meta's AI accelerators. We validate KernelEvolve on the publicly-available KernelBench suite, achieving 100% pass rate on all 250 problems across three difficulty levels, and 160 PyTorch ATen operators across three heterogeneous hardware platforms, demonstrating 100% correctness. KernelEvolve reduces development time from weeks to hours and achieves substantial performance improvements over PyTorch baselines across diverse production use cases and for heterogeneous AI systems at-scale. Beyond performance efficiency improvements, KernelEvolve significantly mitigates the programmability barrier for new AI hardware by enabling automated kernel generation for in-house developed AI hardware.", "authors": [ "Gang Liao", "Hongsen Qin", "Ying Wang", "Alicia Golden", "Michael Kuchnik", "Yavuz Yetim", "Jia Jiunn Ang", "Chunli Fu", "Yihan He", "Samuel Hsia", "Zewei Jiang", "Dianshi Li", "Uladzimir Pashkevich", "Varna Puvvada", "Feng Shi", "Matt Steiner", "Ruichao Xiao", "Liyuan Li", "Nathan Yan", "Xiayu Yu", "Zhou Fang", "Roman Levenstein", "Kunming Ho", "Haishan Zhu", "Alec Hammond", "Richard Li", "Ajit Mathews", "Kaustubh Gondkar", "Abdul Zainul-Abedin", "Ketan Singh", "Hongtao Yu", "Wenyuan Chi", "Barney Huang", "Sean Zhang", "Noah Weller", "Zach Marine", "Wyatt Cook", "Carole-Jean Wu", "Gaoxiang Liu" ], "year": 2026, "published_date": "2026-07-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2512.23236", "pdf_url": "https://arxiv.org/pdf/2512.23236", "citations": 0, "topics": [], "tags": [ "AI Agents", "Artificial Intelligence", "Machine Learning", "Multi-Agent Systems" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.71, "content_potential_score": 0.0, "interestingness_score": 1.65, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Making deep learning recommendation model (DLRM) training and inference fast and efficient is important. However, this presents three key system challenges - model architecture diversity, kernel primitive diversity, and hardware generation and architecture heterogeneity.", "key_contribution": "Making deep learning recommendation model (DLRM) training and inference fast and efficient is important.", "why_it_matters": "KernelEvolve: Scaling Agentic Kernel Coding for Heterogeneous AI Accelerators at Meta represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "Making deep learning recommendation model (DLRM) training and inference fast and efficient is important.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2512.23236", "difficulty": "intermediate" }, { "id": "arxiv:2607.06505", "source": "arxiv", "source_type": "preprint", "title": "Industry Classification of GitHub Repositories Using the North American Industry Classification System (NAICS)", "abstract": "GitHub hosts hundreds of millions of public repositories, but the platform exposes no native mapping from repositories to standardized industry sectors. This gap limits empirical work on the geography of innovation, the industrial composition of open-source production, and the diffusion of new technologies across economic sectors. We present NAICS-GH, a publicly released corpus of 6,588 GitHub repositories drawn from source pools covering the United States, the European Union, and Australia, each labeled with a 2-digit sector from the North American Industry Classification System (NAICS 2022). Labels are produced by a retrieve-and-verify pipeline that combines BAAI/bge-large-en embeddings, FAISS retrieval, and GPT-4.1 rubric scoring. The pipeline narrows about 1.37 million source repositories to 31,178 candidate repository-sector pairs and retains 6,588 high-confidence labels with score at least 8. Re-running the retrieval pipeline end to end reproduces the candidate set to within 0.03 percent. On a 2,421-repository human-validated random sample, the released labels attain 96.98 percent precision, with Wilson 95 percent confidence interval [96.23, 97.59]. We benchmark six pretrained encoders on the released corpus; RoBERTa-large reaches 86.45 percent F1 and 86.35 percent accuracy on a held-out 20 percent test set. The dataset, Croissant metadata, pipeline code, prompts, and fine-tuned checkpoint are released under CC-BY-4.0 and MIT licenses.", "authors": [ "Kevin Xu", "Alexander Quispe" ], "year": 2026, "published_date": "2026-07-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.06505", "pdf_url": "https://arxiv.org/pdf/2607.06505", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "Evaluation", "Artificial Intelligence", "Databases" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 6.14, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "GitHub hosts hundreds of millions of public repositories, but the platform exposes no native mapping from repositories to standardized industry sectors. This gap limits empirical work on the geography of innovation, the industrial composition of open-source production, and the diffusion of new technologies across economic sectors.", "key_contribution": "We present NAICS-GH, a publicly released corpus of 6,588 GitHub repositories drawn from source pools covering the United States, the European Union, and Australia, each labeled with a 2-digit sector from the North American Industry Classification System (NAICS 2022).", "why_it_matters": "Industry Classification of GitHub Repositories Using the North American Industry Classification System (NAICS) represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present NAICS-GH, a publicly released corpus of 6,588 GitHub repositories drawn from source pools covering the…", "biggest_caveat": "but the platform exposes no native mapping from repositories to standardized industry sectors.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.06505", "difficulty": "beginner" }, { "id": "arxiv:2607.03704", "source": "arxiv", "source_type": "preprint", "title": "Optimizing Large Language Models for Causality Assessment in Pharmacovigilance: Developing a Performance Metric as Objective for Bayesian Hyperparameter Optimization", "abstract": "Background: Growing individual case safety report (ICSR) volumes have intensified demand for scalable automated causality assessment. Large Language Models (LLMs) show promise, yet performance on clinically demanding tasks remains suboptimal and inference-time hyperparameter optimization has not been investigated. Objective: To develop a Gaussian Process (GP)-compatible optimization objective and investigate whether temperature optimization improves LLM-expert agreement on Naranjo causality assessment of FAERS ICSRs. Methods: Expert causality assessments were performed on 723 stratified FAERS cases. OpenAI's GPT-5.2 was evaluated using chain-of-thought (CoT) prompting. Four composite metrics were developed: Weighted Cosine Similarity (WCS), Information-Weighted Agreement Score (IWAS), Entropy-Weighted Agreement and Cosine Similarity Score (EWACS), and Consensus-Weighted Cosine Similarity (CWCS) and Bayesian optimization using a GP surrogate with Probability of Improvement (PoI) acquisition was applied across temperature [0, 2]. Results: GPT-5.2 outperformed prior biomedical LLMs at baseline (T = 0), achieving 74.1% agreement on question 5 and 65.4% on question 10 of Naranjo algorithm. Entropy analysis identified these as the sole informative optimization targets. Temperature showed no systematic population-level effect (\\b{eta} = 0.002, p = 0.959). EWACS-guided Bayesian optimization improved causality classification agreement from 45.0% to 72.0% (+27 pp), with the largest gain in Doubtful cases (+42.9 pp). Conclusion: EWACS was identified as the optimal GP-compatible metric. The absence of a universal temperature optimum indicates LLM performance is driven primarily by ICSR content, yet case-specific temperature selection produced meaningful improvements, supporting temperature optimization for LLM-assisted pharmacovigilance.", "authors": [ "Nicole Sonne Heckmann", "Arnault-Quentin Vermillet", "Søren Norlin Mølgaard", "Manuela Del Castillo Suero", "Lars Melskens", "Gerard Ompad", "Maurizio Sessa" ], "year": 2026, "published_date": "2026-07-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.03704", "pdf_url": "https://arxiv.org/pdf/2607.03704", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Biomedical AI", "NLP" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 3.91, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Background: Growing individual case safety report (ICSR) volumes have intensified demand for scalable automated causality assessment. Large Language Models (LLMs) show promise, yet performance on clinically demanding tasks remains suboptimal and inference-time hyperparameter optimization has not been investigated.", "key_contribution": "Large Language Models (LLMs) show promise, yet performance on clinically demanding tasks remains suboptimal and inference-time hyperparameter optimization has not been investigated.", "why_it_matters": "Optimizing Large Language Models for Causality Assessment in Pharmacovigilance: Developing a Performance Metric as Objective for Bayesian Hyperparameter Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Large Language Models (LLMs) show promise, yet performance on clinically demanding tasks remains suboptimal and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.03704", "difficulty": "frontier" }, { "id": "arxiv:2606.28362", "source": "arxiv", "source_type": "preprint", "title": "LUMEN: Cost-Transparent Multi-Agent Pipeline for Automated Systematic Review and Meta-Analysis", "abstract": "Systematic reviews and meta-analyses (SR/MA) remain the gold standard for evidence synthesis, yet completing one typically requires 67 weeks and substantial expert effort. Recent large language model (LLM) systems have demonstrated strong performance on individual SR phases - screening (otto-SR: 96.7% sensitivity), extraction (Gartlehner et al.: 91.0% accuracy), and search (TrialMind: 0.83 recall) - but no study has reported what it actually costs to run an end-to-end pipeline, how cost distributes across phases, or how architectural choices affect the cost-quality trade-off. We present LUMEN, an open-source multi-agent pipeline that automates six SR/MA phases using 11 specialized LLM agents with deliberate model routing. We evaluate LUMEN on seven datasets: five self-conducted domain reviews (psychiatry, psychology, surgery, vaccinology, cardiology) and two SYNERGY screening benchmarks. Across 13 ground-truth-comparable outcomes, LUMEN achieves 100% directional agreement with published meta-analyses, with effect sizes within 1% for homogeneous study designs. The primary contribution is the first empirical cost and operational characterization of such a pipeline: a complete review costs 19 to 29 USD (median 22.65 USD), with title-abstract screening and data extraction together dominating expenditure. A three-arm extraction ablation reveals a phase-dependent architecture reversal: multi-agent design hurts screening but is essential for extraction, producing 5.7x more poolable analyses than single-model alternatives while eliminating clinically dangerous direction errors. A two-dataset screening benchmark demonstrates that model ranking is domain-dependent and not transferable across review topics. All code and cost logs are publicly available.", "authors": [ "Yen-Hsun Huang", "Yu-Shiou Lin" ], "year": 2026, "published_date": "2026-03-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.28362", "pdf_url": "https://arxiv.org/pdf/2606.28362", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Biomedical AI", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.79, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Systematic reviews and meta-analyses (SR/MA) remain the gold standard for evidence synthesis, yet completing one typically requires 67 weeks and substantial expert effort. Recent large language model (LLM) systems have demonstrated strong performance on individual SR phases - screening (otto-SR: 96.7% sensitivity), extraction (Gartlehner et al.: 91.0% accuracy), and search (TrialMind: 0.83 recall) - but no study has reported what it actually costs to run an end-to-end pipeline, how cost distributes across phases, or how architectural choices affect the cost-quality trade-off.", "key_contribution": "We present LUMEN, an open-source multi-agent pipeline that automates six SR/MA phases using 11 specialized LLM agents with deliberate model routing.", "why_it_matters": "LUMEN: Cost-Transparent Multi-Agent Pipeline for Automated Systematic Review and Meta-Analysis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present LUMEN, an open-source multi-agent pipeline that automates six SR/MA phases using 11 specialized LLM agents…", "biggest_caveat": "butes across phases, or how architectural choices affect the cost-quality trade-off.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.28362", "difficulty": "beginner" }, { "id": "arxiv:2606.28270", "source": "arxiv", "source_type": "preprint", "title": "Agent-Native Immune System: Architecture, Taxonomy, and Engineering", "abstract": "The transition from static chat bots to autonomous agents--equipped with persistent memory, tool-use protocols, and multi-agent collaboration--has fundamentally expanded the AI threat landscape. Current defense mechanisms, such as perimeter security and training-time alignment, remain external to the agent's active reasoning loop. Consequently, they fall short: a fully aligned agent remains highly vulnerable to runtime hijacking via memory poisoning, tool-chain manipulation, or multi-agent protocol attacks. To address this critical gap, we introduce the Agent-Native Immune System (ANIS), the first biologically inspired, endogenous defense architecture embedded directly within the agent's cognitive loop. Our framework presents four primary contributions. First, we design a six-layer Immune Tower (L0-L5), distinctly incorporating Barrier Immunity (L1) as a non-cognitive, physical-and-logical isolation layer. Second, we establish a unified taxonomy of Agent Viruses and Agent Vaccines, formalizing the critical distinction between superficial non-parametric defenses and robust parametric vaccines. Third, we conceptualize the Harness Triad--Meta, Self, and Auto--a self-monitoring, meta-cognitive automation backbone that drives Continual Immune Learning (CIL), enabling vaccines to dynamically adapt to novel threats. Finally, we establish a rigorous theoretical demarcation between model alignment and agent immunity: while alignment provides a static \"constitutional\" value foundation during training, ANIS serves as the dynamic \"law enforcement\" mechanism during runtime. We conclude by framing open challenges for the field, including immune protocol standardization, novel evaluation metrics such as the Autoimmunity Rate (false-positive intervention rate), and the co-evolutionary dynamics between pathogens and vaccines within collective intelligence ecosystems.", "authors": [ "Bo Shen", "Lifeng Chang", "Tianyuan Wei", "Yunpeng Li", "Feng Shi", "Yichen Han", "Peijie Gao", "Shiyi Kuang", "Xin Chang", "Dehui Li" ], "year": 2026, "published_date": "2026-06-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.28270", "pdf_url": "https://arxiv.org/pdf/2606.28270", "citations": 0, "topics": [], "tags": [ "Reasoning", "AI Safety", "AI Agents", "Robotics", "Multi-Agent Systems" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.1, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The transition from static chat bots to autonomous agents--equipped with persistent memory, tool-use protocols, and multi-agent collaboration--has fundamentally expanded the AI threat landscape. Current defense mechanisms, such as perimeter security and training-time alignment, remain external to the agent's active reasoning loop.", "key_contribution": "To address this critical gap, we introduce the Agent-Native Immune System (ANIS), the first biologically inspired, endogenous defense architecture embedded directly within the agent's cognitive loop.", "why_it_matters": "Agent-Native Immune System: Architecture, Taxonomy, and Engineering represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "To address this critical gap, we introduce the Agent-Native Immune System (ANIS), the first biologically inspired,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2606.28270", "difficulty": "advanced" }, { "id": "arxiv:2405.01741", "source": "arxiv", "source_type": "preprint", "title": "PVF:Understanding AI Vulnerability Against SDCs", "abstract": "Reliability of AI systems is a fundamental concern for the successful deployment and widespread adoption of AI technologies. Unfortunately, the escalating complexity and heterogeneity of AI hardware systems make them increasingly susceptible to hardware faults, e.g., silent data corruptions (SDC), that can potentially corrupt model parameters. When this occurs during AI inference/servicing, it can potentially lead to incorrect or degraded model output for users, ultimately affecting the quality and reliability of AI services. In light of the escalating threat, it is crucial to address key questions: How vulnerable are AI models to parameter corruptions, and how do different components (such as modules, layers) of the models exhibit varying vulnerabilities to parameter corruptions? To systematically address this question, we propose a novel quantitative metric, Parameter Vulnerability Factor (PVF), inspired by architectural vulnerability factor (AVF) in computer architecture community, aiming to standardize the quantification of AI model vulnerability against parameter corruptions. We define a model parameter's PVF as the probability that a corruption in that particular model parameter will result in an incorrect output. In this paper, we present several use cases on applying PVF to three types of tasks/models during inference -- recommendation (DLRM), vision classification (CNN), and text classification (BERT), while presenting an in-depth vulnerability analysis on DLRM. PVF has been a critical metric used for making key error management design decisions in productionizing Meta's in-house AI chip - MTIA.", "authors": [ "Xun Jiao", "Fred Lin", "Harish D. Dixit", "Joel Coburn", "Sajin Nair", "Abhinav Pandey", "Han Wang", "Venkat Ramesh", "Jianyu Huang", "Daniel Moore", "Sriram Sankar" ], "year": 2026, "published_date": "2026-06-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2405.01741", "pdf_url": "https://arxiv.org/pdf/2405.01741", "citations": 0, "topics": [], "tags": [ "Classification", "Artificial Intelligence", "Machine Learning", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Classification) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 6.83, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reliability of AI systems is a fundamental concern for the successful deployment and widespread adoption of AI technologies. Unfortunately, the escalating complexity and heterogeneity of AI hardware systems make them increasingly susceptible to hardware faults, e.g., silent data corruptions (SDC), that can potentially corrupt model parameters.", "key_contribution": "To systematically address this question, we propose a novel quantitative metric, Parameter Vulnerability Factor (PVF), inspired by architectural vulnerability factor (AVF) in computer architecture community, aiming to standardize the quantification of AI model vulnerability against parameter corruptions.", "why_it_matters": "PVF:Understanding AI Vulnerability Against SDCs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Classification.", "one_line_takeaway": "To systematically address this question, we propose a novel quantitative metric, Parameter Vulnerability Factor (PVF),…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Classification.", "url": "https://arxiv.org/abs/2405.01741", "difficulty": "beginner" }, { "id": "arxiv:2606.19039", "source": "arxiv", "source_type": "preprint", "title": "Adaptive Speech-to-Spike Encoding for Spiking Neural Networks", "abstract": "The mismatch between continuous acoustic signals and discrete event-driven processing remains a fundamental bottleneck for neuromorphic speech processing. Current systems typically rely on fixed spike encoders, forcing downstream Spiking Neural Networks (SNNs) to compensate for non-adaptive input representations. To address this, we present a learnable residual speech-to-spike encoder jointly trained end-to-end with a Recurrent Leaky Integrate-and-Fire (R-LIF) backbone. We validate this approach on the Google Speech Commands v2 (GSC-v2) benchmark, achieving up to 94.97% accuracy. Notably, the learned encoder remains highly parameter-efficient with a compact 35k-parameter variant that reaches 89.8%, matching or exceeding prior baselines that require an order of magnitude more parameters. Our encoder-focused analysis, including linear probing and gradient-residual inspection, indicates that the encoder does not target faithful signal reconstruction but instead learns task-aligned spike representations that enhance class separability. Finally, we benchmark bio-inspired, hardware-friendly credit assignment by comparing Direct Feedback Alignment (DFA) with surrogate-gradient BPTT under identical architectures and training conditions. We find that DFA reaches 91.5% accuracy, quantifying the performance trade-off of bio-inspired learning rules for modern neuromorphic audio.", "authors": [ "Taharim Rahman Anon", "Jakaria Islam Emon" ], "year": 2026, "published_date": "2026-06-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.19039", "pdf_url": "https://arxiv.org/pdf/2606.19039", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "AI Safety", "Evaluation", "Machine Learning", "Neural Networks" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.49, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The mismatch between continuous acoustic signals and discrete event-driven processing remains a fundamental bottleneck for neuromorphic speech processing. Current systems typically rely on fixed spike encoders, forcing downstream Spiking Neural Networks (SNNs) to compensate for non-adaptive input representations.", "key_contribution": "To address this, we present a learnable residual speech-to-spike encoder jointly trained end-to-end with a Recurrent Leaky Integrate-and-Fire (R-LIF) backbone.", "why_it_matters": "Adaptive Speech-to-Spike Encoding for Spiking Neural Networks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "To address this, we present a learnable residual speech-to-spike encoder jointly trained end-to-end with a Recurrent…", "biggest_caveat": "does not target faithful signal reconstruction but instead learns task-aligned spike representations that enhance class separability.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2606.19039", "difficulty": "beginner" }, { "id": "arxiv:2510.12306", "source": "arxiv", "source_type": "preprint", "title": "A large-scale pipeline for LLM-assisted corpus annotation: variation and change in the English consider construction", "abstract": "As natural language corpora expand at an unprecedented rate, manual annotation remains a significant methodological bottleneck in corpus linguistic work. We address this challenge by presenting a scalable pipeline for automating grammatical annotation in voluminous corpora using large language models (LLMs). Unlike previous supervised and iterative approaches, our method employs a four-phase workflow: prompt engineering, pre-hoc evaluation, automated batch processing, and post-hoc validation. We demonstrate the pipeline's accessibility and effectiveness through a diachronic case study of variation in the English evaluative consider construction (consider X as/to be/Ø Y). We annotate 143,933 'consider' concordance lines from the Corpus of Historical American English (COHA) via the OpenAI API in under 60 hours, achieving 98%+ accuracy on two sophisticated annotation procedures. A Bayesian multinomial GAM fitted to 44,527 true positives of the evaluative construction reveals previously undocumented genre-specific trajectories of change, enabling us to advance new hypotheses about the relationship between register formality and competing pressures of morphosyntactic reduction and enhancement. Our results suggest that LLMs can perform a range of data preparation tasks at scale with minimal human intervention, unlocking substantive research questions previously beyond practical reach, though implementation requires attention to costs, licensing, and other ethical considerations.", "authors": [ "Cameron Morin", "Matti Marttinen Larsson" ], "year": 2026, "published_date": "2026-06-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.12306", "pdf_url": "https://arxiv.org/pdf/2510.12306", "citations": 0, "topics": [], "tags": [ "LLMs", "Prompting", "NLP" ], "paper_type": "dataset", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.58, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "As natural language corpora expand at an unprecedented rate, manual annotation remains a significant methodological bottleneck in corpus linguistic work. We address this challenge by presenting a scalable pipeline for automating grammatical annotation in voluminous corpora using large language models (LLMs).", "key_contribution": "We demonstrate the pipeline's accessibility and effectiveness through a diachronic case study of variation in the English evaluative consider construction (consider X as/to be/Ø Y).", "why_it_matters": "A large-scale pipeline for LLM-assisted corpus annotation: variation and change in the English consider construction represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We demonstrate the pipeline's accessibility and effectiveness through a diachronic case study of variation in the…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2510.12306", "difficulty": "frontier" }, { "id": "arxiv:2606.13486v1", "source": "arxiv", "source_type": "preprint", "title": "CRAFTIIF: Cross-Resolution Analytic Four-Type Interpretable Isolation Forest for Multivariate Time Series Anomaly Detection", "abstract": "Anomaly detection in multivariate time series is challenged by four structurally distinct anomaly types -- point (isolated spikes), distributional (level shifts), temporal (rhythm changes), and collective (inter-sensor correlation breakdowns) -- each requiring different feature representations. Most unsupervised methods target only one or two types and provide limited interpretability. We present CRAFTIIF (Cross-Resolution Analytic Four-Type Interpretable Isolation Forest), a fully unsupervised framework targeting all four types without dataset-specific tuning. CRAFTIIF generates K=500 random analytic wavelet feature draws across four families (Morlet, DOG, Haar, Coiflet), each targeting a specific anomaly type, feeding five structured Isolation Forests -- one per type plus a meta-IF for compound anomalies. An adaptive Otsu/MAD threshold calibrates detection automatically across anomaly rates from 0.1% to 69.2%. Because each IF is trained exclusively on type-specific features, branch firing provides direct anomaly-type attribution by construction, without post-hoc explanation. Evaluated on all 19 datasets of the mTSBench benchmark (Zhou et al., TMLR 2026), CRAFTIIF achieves mean F1=0.228 (all 19 datasets) and F1=0.322 (13 detectable datasets), ranking first among all 25 evaluated methods on VUS-PR (0.463 vs. previous best 0.329, +40.7%). A diagnostic framework -- oracle F1, detectability limits, and branch separation ratios -- identifies 6 of 19 datasets as fundamentally undetectable by any unsupervised method. Ablation over 11 conditions confirms adaptive thresholding (+38% F1), four-branch structure (+20%), and meta-IF (+23%) are each essential. Code: https://github.com/smitswil/craftiif", "authors": [ "William Smits" ], "year": 2026, "published_date": "2026-06-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.13486v1", "pdf_url": "https://arxiv.org/pdf/2606.13486v1", "citations": 0, "topics": [], "tags": [ "Interpretability", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.75, "content_potential_score": 2.34, "interestingness_score": 2.82, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Anomaly detection in multivariate time series is challenged by four structurally distinct anomaly types -- point (isolated spikes), distributional (level shifts), temporal (rhythm changes), and collective (inter-sensor correlation breakdowns) -- each requiring different feature representations. Most unsupervised methods target only one or two types and provide limited interpretability.", "key_contribution": "We present CRAFTIIF (Cross-Resolution Analytic Four-Type Interpretable Isolation Forest), a fully unsupervised framework targeting all four types without dataset-specific tuning.", "why_it_matters": "CRAFTIIF: Cross-Resolution Analytic Four-Type Interpretable Isolation Forest for Multivariate Time Series Anomaly Detection represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Interpretability.", "one_line_takeaway": "We present CRAFTIIF (Cross-Resolution Analytic Four-Type Interpretable Isolation Forest), a fully unsupervised…", "biggest_caveat": "bution by construction, without post-hoc explanation.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Interpretability.", "url": "http://arxiv.org/abs/2606.13486v1", "difficulty": "beginner" }, { "id": "arxiv:2603.24963", "source": "arxiv", "source_type": "preprint", "title": "Design Once, Deploy at Scale: Template-Driven ML Development for Large Model Ecosystems", "abstract": "Modern computational advertising platforms typically rely on recommendation systems to predict user responses, such as click-through rates, conversion rates, and other optimization events. To support a wide variety of product surfaces and advertiser goals, these platforms frequently maintain an extensive ecosystem of machine learning (ML) models. However, operating at this scale creates significant development and efficiency challenges. Substantial engineering effort is required to regularly refresh ML models and propagate new techniques, which results in long latencies when deploying ML innovations across the ecosystem. We present a large-scale empirical study comparing model performance, efficiency, and ML technique propagation between a standardized model-building approach and independent per-model optimization in recommendation systems. To facilitate this standardization, we propose the Standard Model Template (SMT) -- a framework that generates high-performance models adaptable to diverse data distributions and optimization events. By utilizing standardized, composable ML model components, SMT reduces technique propagation complexity from $O(n \\cdot 2^k)$ to $O(n + k)$ where $n$ is the number of models and $k$ the number of techniques. Evaluating an extensive suite of models over four global development cycles within Meta's production ads ranking ecosystem, our results demonstrate: (1) a 0.63% average improvement in cross-entropy at neutral serving capacity, (2) a 92% reduction in per-model iteration engineering time, and (3) a $6.3\\times$ increase in technique-model pair adoption throughput. These findings challenge the conventional wisdom that diverse optimization goals inherently require diversified ML model design.", "authors": [ "Jiang Liu", "John Martabano Landy", "Yao Xuan", "Swamy Muddu", "Nhat Le", "Munaf Sahaf", "Luc Kien Hang", "Rupinder Khandpour", "Kevin De Angeli", "Chang Yang", "Shouyuan Chen", "Shiblee Sadik", "Anirudh Agrawal", "Djordje Gligorijevic", "Jingzheng Qin", "Peggy Yao", "Alireza Vahdatpour" ], "year": 2026, "published_date": "2026-06-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.24963", "pdf_url": "https://arxiv.org/pdf/2603.24963", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses cross-entropy — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.77, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Modern computational advertising platforms typically rely on recommendation systems to predict user responses, such as click-through rates, conversion rates, and other optimization events. To support a wide variety of product surfaces and advertiser goals, these platforms frequently maintain an extensive ecosystem of machine learning (ML) models.", "key_contribution": "We present a large-scale empirical study comparing model performance, efficiency, and ML technique propagation between a standardized model-building approach and independent per-model optimization in recommendation systems.", "why_it_matters": "Design Once, Deploy at Scale: Template-Driven ML Development for Large Model Ecosystems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We present a large-scale empirical study comparing model performance, efficiency, and ML technique propagation between…", "biggest_caveat": "However, operating at this scale creates significant development and efficiency challenges.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2603.24963", "difficulty": "advanced" }, { "id": "arxiv:2510.22048", "source": "arxiv", "source_type": "preprint", "title": "PF$Δ$: A Benchmark Dataset for Power Flow under Load, Generation, and Topology Variations", "abstract": "Power flow (PF) calculations are the backbone of real-time grid operations, across workflows such as contingency analysis (where repeated PF evaluations assess grid security under outages) and topology optimization (which involves PF-based searches over combinatorially large action spaces). Running these calculations at operational timescales or across large evaluation spaces remains a major computational bottleneck. Additionally, growing uncertainty in power system operations from the integration of renewables and climate-induced extreme weather also calls for tools that can accurately and efficiently simulate a wide range of scenarios and operating conditions. Machine learning methods offer a potential speedup over traditional solvers, but their performance has not been systematically assessed on benchmarks that capture real-world variability. This paper introduces PF$Δ$, a benchmark dataset for power flow that captures diverse variations in load, generation, and topology. PF$Δ$ contains 859,800 solved power flow instances spanning six different bus system sizes, capturing three types of contingency scenarios (N , N -1, and N -2), and including close-to-infeasible cases near steady-state voltage stability limits. We evaluate traditional solvers and GNN-based methods, highlighting key areas where existing approaches struggle, and identifying open problems for future research. Our dataset is available at https://huggingface.co/datasets/pfdelta/pfdelta/tree/main and our code with data generation scripts and model implementations is at https://github.com/MOSSLab-MIT/pfdelta.", "authors": [ "Ana K. Rivera", "Anvita Bhagavathula", "Alvaro Carbonero", "Priya Donti" ], "year": 2026, "published_date": "2026-06-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.22048", "pdf_url": "https://arxiv.org/pdf/2510.22048", "citations": 0, "topics": [], "tags": [ "GNNs", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 3.96, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Power flow (PF) calculations are the backbone of real-time grid operations, across workflows such as contingency analysis (where repeated PF evaluations assess grid security under outages) and topology optimization (which involves PF-based searches over combinatorially large action spaces). Running these calculations at operational timescales or across large evaluation spaces remains a major computational bottleneck.", "key_contribution": "Power flow (PF) calculations are the backbone of real-time grid operations, across workflows such as contingency analysis (where repeated PF evaluations assess grid security under outages) and topology optimization (which involves PF-based searches over combinatorially large action spaces).", "why_it_matters": "PF$Δ$: A Benchmark Dataset for Power Flow under Load, Generation, and Topology Variations represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about GNNs.", "one_line_takeaway": "Power flow (PF) calculations are the backbone of real-time grid operations, across workflows such as contingency…", "biggest_caveat": "but their performance has not been systematically assessed on benchmarks that capture real-world variability.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in GNNs.", "url": "https://arxiv.org/abs/2510.22048", "difficulty": "frontier" }, { "id": "arxiv:2603.23420", "source": "arxiv", "source_type": "preprint", "title": "Bilevel Autoresearch: Meta-Autoresearching Itself", "abstract": "If autoresearch is itself a form of research, then autoresearch can be applied to research itself. We present Bilevel Autoresearch, a bilevel framework in which an outer autoresearch loop improves an inner autoresearch loop by reading its code and traces, identifying bottlenecks, and generating injectable Python search mechanisms at runtime. The inner loop optimizes task performance; the outer loop optimizes how the inner loop searches. Both loops use the same LLM, so improvements come from the bilevel architecture rather than a stronger meta-level model, although the outer loop consumes additional inference and wall-clock budget. On Karpathy's GPT pretraining benchmark, the meta-autoresearch outer loop achieves a 5x improvement over the standard inner loop alone (-0.045 vs. -0.009 val_bpb), while parameter-level adjustment without mechanism change yields no reliable gain. The outer loop instantiates mechanisms from adjacent search domains, including combinatorial optimization, multi-armed bandits, and design of experiments, without human specification of the final mechanism design. Trace analysis suggests that these mechanisms break deterministic search patterns and force exploration of directions the LLM's priors avoid. The experiments demonstrate, on this benchmark, a first bilevel step: an outer loop improves the search behavior of an inner loop. Code is the mechanism carrier in this implementation, but skills, prompts, workflows, evaluators, domain principles, world-model assumptions, and memory schemas can also encode mechanisms that shape future agent behavior. This suggests a path toward recursive bootstrapping, where mechanisms discovered for the inner loop can be fed back to improve the meta-level loop itself.", "authors": [ "Yaonan Qu", "Meng Lu" ], "year": 2026, "published_date": "2026-06-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.23420", "pdf_url": "https://arxiv.org/pdf/2603.23420", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Self-Supervised", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Uses pretraining — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.12, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "If autoresearch is itself a form of research, then autoresearch can be applied to research itself. We present Bilevel Autoresearch, a bilevel framework in which an outer autoresearch loop improves an inner autoresearch loop by reading its code and traces, identifying bottlenecks, and generating injectable Python search mechanisms at runtime.", "key_contribution": "We present Bilevel Autoresearch, a bilevel framework in which an outer autoresearch loop improves an inner autoresearch loop by reading its code and traces, identifying bottlenecks, and generating injectable Python search mechanisms at runtime.", "why_it_matters": "Bilevel Autoresearch: Meta-Autoresearching Itself represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present Bilevel Autoresearch, a bilevel framework in which an outer autoresearch loop improves an inner autoresearch…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2603.23420", "difficulty": "advanced" }, { "id": "arxiv:2605.09100", "source": "arxiv", "source_type": "preprint", "title": "GRC: Unifying Reasoning-Driven Generation, Retrieval and Compression", "abstract": "Text embedding and generative tasks are usually trained separately based on large language models (LLMs) nowadays. This causes a large amount of training cost and deployment effort. Context compression is also a challenging and pressing task, which is vital to reasoning-driven generation, and agentic tasks requiring long context and continual learning. In this paper, we explore how to unify reasoning-driven generation, reasoning-enhanced text representation and context compression tasks in one forward pass for LLMs. Through meta latent tokens and a unified generative, representative and compressive tuning approach, we propose a training framework named GRC that bridges the three tasks. The trained models can accomplish three objectives in a single forward pass while maintaining modular, LEGO-style flexibility during inference. This design greatly reduces the deployment effort for retrieval-augmented generation (RAG) and achieves efficient inference and three times data utilization during training. Furthermore, this framework design enables a new paradigm for text embedding: self-reason-latent embeds, and a new generation paradigm, latent memory-augmented generation, where compressed and internalized KV cache with O(1) length is used as the updatable memory. We also propose hybrid paged attention to speed up the inference of our models. Extensive experiments on reasoning-intensive retrieval benchmarks, generative tasks, document compression, latency evaluation, and RAG settings demonstrate the effectiveness of our method and may shed light on the truly unified model that can handle reasoning-driven generation, embedding and compression tasks seamlessly.", "authors": [ "Zhongtao Miao", "Qiyu Wu", "Yoshimasa Tsuruoka" ], "year": 2026, "published_date": "2026-05-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.09100", "pdf_url": "https://arxiv.org/pdf/2605.09100", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Long Context", "AI Agents", "RAG" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses continual — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.12, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Text embedding and generative tasks are usually trained separately based on large language models (LLMs) nowadays. This causes a large amount of training cost and deployment effort.", "key_contribution": "Through meta latent tokens and a unified generative, representative and compressive tuning approach, we propose a training framework named GRC that bridges the three tasks.", "why_it_matters": "GRC: Unifying Reasoning-Driven Generation, Retrieval and Compression represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Through meta latent tokens and a unified generative, representative and compressive tuning approach, we propose a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.09100", "difficulty": "advanced" }, { "id": "arxiv:2604.24178v1", "source": "arxiv", "source_type": "preprint", "title": "Meta-Aligner: Bidirectional Preference-Policy Optimization for Multi-Objective LLMs Alignment", "abstract": "Multi-Objective Alignment aims to align Large Language Models (LLMs) with diverse and often conflicting human values by optimizing multiple objectives simultaneously. Existing methods predominantly rely on static preference weight construction strategies. However, rigidly aligning to fixed targets discards valuable intermediate information, as training responses inherently embody valid preference trade-offs even when deviating from the target. To address this limitation, we propose Meal, i.e., MEta ALigner, a bi-level meta-learning framework enabling bidirectional optimization between preferences and policy responses, generating instructive dynamic preferences for steadier training. Specifically, we introduce a preference-weight-net as a meta-learner to generate adaptive preference weights based on input prompts and update the preference weights as learnable parameters, while the LLM policy acts as a base-learner optimizing response generation conditioned on these preferences with rejection sampling strategy. Extensive empirical results demonstrate that our method achieves superior performance on several multi-objective benchmarks, validating the effectiveness of the dynamic bidirectional preference-policy optimization framework.", "authors": [ "Wenzhe Xu", "Biao Liu", "Yiyang Sun", "Xin Geng", "Ning Xu" ], "year": 2026, "published_date": "2026-04-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.24178v1", "pdf_url": "https://arxiv.org/pdf/2604.24178v1", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "Info Extraction", "Evaluation", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.94, "content_potential_score": 0.0, "interestingness_score": 1.65, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multi-Objective Alignment aims to align Large Language Models (LLMs) with diverse and often conflicting human values by optimizing multiple objectives simultaneously. Existing methods predominantly rely on static preference weight construction strategies.", "key_contribution": "To address this limitation, we propose Meal, i.e., MEta ALigner, a bi-level meta-learning framework enabling bidirectional optimization between preferences and policy responses, generating instructive dynamic preferences for steadier training.", "why_it_matters": "Meta-Aligner: Bidirectional Preference-Policy Optimization for Multi-Objective LLMs Alignment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this limitation, we propose Meal, i.e., MEta ALigner, a bi-level meta-learning framework enabling…", "biggest_caveat": "limitation, we propose Meal, i.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.24178v1", "difficulty": "beginner" }, { "id": "arxiv:2605.28629", "source": "arxiv", "source_type": "preprint", "title": "Mobile-Aptus: Confidence-Driven Proactive and Robust Interaction in MLLM-based Mobile-Using Agents", "abstract": "Recent advancements in multimodal large language models (MLLMs) have shown exceptional potential in enabling mobile-using agents to autonomously execute human instructions. However, fully automated agents often try to execute tasks even when they are unable to resolve them, leading to the problem of over-execution. Previous studies solve it by training a interactive mobile-using agents to let agents request human interaction when agents can not complete user instructions. However, we find that these interactive agents tend to exhibit over-soliciting behavior, relying excessively on human intervention. To mitigate both over-execution and over-soliciting, we propose a universal confidence integration framework that enables confidence-driven proactive and robust interaction in MLLM-based mobile-using agents. The framework consists of two stages: interaction capability empowerment and confidence bias correction. In the interaction capability empowerment stage, agents learn through supervised fine-tuning to output both actions and confidence scores. In the confidence bias correction stage, agents learn to output more accurate confidence scores by combining semantic similarity retrieval with direct preference optimization. Experimental results show Mobile-Aptus achieves state-of-the-art performance on the four popular mobile-using agent benchmarks: OS-Kairos, AITZ, Meta-GUI, and AndroidControl. Mobile-Aptus consistently outperforms all baselines in offline benchmarks, with an average improvement over 17\\% in task success rate. In real-world dynamic experiments, Mobile-Aptus surpasses the baseline by 26% in task success rate with only 0.64 intervention steps per instruction. The codes are available at https://github.com/Wuzheng02/Mobile-Aptus.", "authors": [ "Zheng Wu", "Pengzhou Cheng", "Zongru Wu", "Yuan Guo", "Tianjie Ju", "Aston Zhang", "Gongshen Liu", "Zhuosheng Zhang" ], "year": 2026, "published_date": "2026-05-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.28629", "pdf_url": "https://arxiv.org/pdf/2605.28629", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "Fine-Tuning", "Multimodal", "Fairness & Ethics" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.05, "content_potential_score": 0.0, "interestingness_score": 1.65, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent advancements in multimodal large language models (MLLMs) have shown exceptional potential in enabling mobile-using agents to autonomously execute human instructions. However, fully automated agents often try to execute tasks even when they are unable to resolve them, leading to the problem of over-execution.", "key_contribution": "To mitigate both over-execution and over-soliciting, we propose a universal confidence integration framework that enables confidence-driven proactive and robust interaction in MLLM-based mobile-using agents.", "why_it_matters": "Mobile-Aptus: Confidence-Driven Proactive and Robust Interaction in MLLM-based Mobile-Using Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To mitigate both over-execution and over-soliciting, we propose a universal confidence integration framework that…", "biggest_caveat": "However, fully automated agents often try to execute tasks even when they are unable to resolve them, leading to the problem of over-execution.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.28629", "difficulty": "advanced" }, { "id": "arxiv:2605.24053", "source": "arxiv", "source_type": "preprint", "title": "Breaking the Chains of Probability: Neutrosophic Logic as a New Framework for Epistemic Uncertainty in Large Language Models", "abstract": "Large Language Models (LLMs) are predominantly governed by probabilistic frameworks in which the sum of outcome probabilities is constrained to unity. This architectural limitation, often imposed by Softmax layers, leads to a collapse of uncertainty that makes it difficult to differentiate between epistemic uncertainty, paradox, and vagueness. We present an empirical investigation of the application of Neutrosophic Logic, a framework that treats Truth (T), Indeterminacy (I), and Falsity (F) as three independent dimensions, to model epistemic states in LLMs. We conducted experiments on a family of four OpenAI GPT models across five linguistic phenomena: logical paradoxes, epistemic ignorance, vagueness, ethical contradictions, and future contingencies, under three prompting strategies: neutrosophic, probabilistic, and entropy-derived. Our findings reveal that the neutrosophic approach, by allowing T+I+F > 1, a state we term hyper-truth, provides a richer representation of a model's internal state. In 35% of evaluations, hyper-truth emerged spontaneously, predominantly under ethical contradiction and logical paradox. We demonstrate that this approach preserves truth values in fuzzy contexts and offers a robust method for identifying and quantifying internal model conflict. We conclude that the integration of neutrosophic evaluation layers is a critical step toward more transparent, reliable, and ethically aware AI systems.", "authors": [ "Maikel Yelandi Leyva-Vázquez", "Florentin Smarandache" ], "year": 2026, "published_date": "2026-05-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.24053", "pdf_url": "https://arxiv.org/pdf/2605.24053", "citations": 0, "topics": [], "tags": [ "LLMs", "Artificial Intelligence", "Machine Learning", "NLP" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.69, "content_potential_score": 1.44, "interestingness_score": 2.37, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large Language Models (LLMs) are predominantly governed by probabilistic frameworks in which the sum of outcome probabilities is constrained to unity. This architectural limitation, often imposed by Softmax layers, leads to a collapse of uncertainty that makes it difficult to differentiate between epistemic uncertainty, paradox, and vagueness.", "key_contribution": "We present an empirical investigation of the application of Neutrosophic Logic, a framework that treats Truth (T), Indeterminacy (I), and Falsity (F) as three independent dimensions, to model epistemic states in LLMs.", "why_it_matters": "Breaking the Chains of Probability: Neutrosophic Logic as a New Framework for Epistemic Uncertainty in Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present an empirical investigation of the application of Neutrosophic Logic, a framework that treats Truth (T),…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.24053", "difficulty": "intermediate" }, { "id": "arxiv:2605.08409", "source": "arxiv", "source_type": "preprint", "title": "Playing games with knowledge: AI-Induced delusions need game theoretic interventions", "abstract": "Conversational AI has a fundamental flaw as a knowledge interface: sycophantic chatbots induce epistemic entrenchment and delusional belief spirals even in rational agents. We propose the problem does not stem from the AI model, rooted instead in a systemic consequence of the paradigm shift from user-driven knowledge search to users and agents engaged in strategic, repeated-play communication. We formalize the problem as a Crawford-Sobel cheap talk game, where costless user signals induce a pooling equilibrium. Agents optimized for user satisfaction produce sycophantic strategies that provide identical reinforcement across user types with opposite epistemic incentives: exploratory ``Growth-seekers'' ($θ_G$) and confirmatory ``Validation-seekers'' ($θ_V$). Under repeated play, this identification failure creates a coordination trap -- analogous to a Prisoner's Dilemma -- where locally rational feedback loops drive users toward pathologically certain false beliefs. We propose an inference-time mechanism design intervention called an Epistemic Mediator that breaks this pooling equilibrium by introducing a costly signal (epistemic friction), forcing type revelation based on users' asymmetric cognitive costs for processing resistance. A key contribution is Belief Versioning, a git-inspired epistemic meta-memory system that stores healthy beliefs and rollbacks when validation-seeking resistance is detected. In simulation, this intervention achieves a separating equilibrium achieving a $48\\times$ differential in spiral rates while passing a learning preservation criterion), evidence that epistemic safety in AI is fundamentally a problem of strategic information environment design rather than simple model alignment.", "authors": [ "Will Beaumaster", "Paul Schrater" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.08409", "pdf_url": "https://arxiv.org/pdf/2605.08409", "citations": 0, "topics": [], "tags": [ "AI Safety", "Info Extraction", "Dialogue", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.74, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Conversational AI has a fundamental flaw as a knowledge interface: sycophantic chatbots induce epistemic entrenchment and delusional belief spirals even in rational agents. We propose the problem does not stem from the AI model, rooted instead in a systemic consequence of the paradigm shift from user-driven knowledge search to users and agents engaged in strategic, repeated-play communication.", "key_contribution": "We propose the problem does not stem from the AI model, rooted instead in a systemic consequence of the paradigm shift from user-driven knowledge search to users and agents engaged in strategic, repeated-play communication.", "why_it_matters": "Playing games with knowledge: AI-Induced delusions need game theoretic interventions represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We propose the problem does not stem from the AI model, rooted instead in a systemic consequence of the paradigm shift…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2605.08409", "difficulty": "advanced" }, { "id": "arxiv:2604.24708v1", "source": "arxiv", "source_type": "preprint", "title": "Scalable Hyperparameter-Divergent Ensemble Training with Automatic Learning Rate Exploration for Large Models", "abstract": "Training large neural networks with data-parallel stochastic gradient descent allocates N GPU replicas to compute effectively identical updates -- a practice that leaves the rich space of learning rate configurations entirely unexplored during training. We propose Hyperparameter-Divergent Ensemble Training (HDET), a method that repurposes these replicas for simultaneous learning rate exploration at negligible communication overhead. HDET operates in alternating phases: a fan-out stage in which replicas train independently under a structured, symmetric spread of learning rates, and a converge stage in which parameters are averaged across all replicas via AllReduce every T steps. Building on this ensemble substrate, we further propose an automatic learning rate (auto-LR) controller that treats the relative training loss across replicas as a performance signal, updating the shared base schedule toward higher-performing configurations via a momentum-based gradient-free meta-update. The combined method produces a self-adapting learning rate schedule that improves both optimization quality and generalization without additional hyperparameter sweeps or training budget. Crucially, the framework generalizes beyond learning rate: any scalar hyperparameter that does not alter model architecture -- such as dropout rate, attention scale temperature, or weight-decay coefficient -- can be explored across replicas using the same fan-out/converge protocol, with inter-replica loss differences serving as zero-order hypergradients that guide the search direction. HDET is implemented as a drop-in replacement for PyTorch's OneCycleLR scheduler, requiring no changes to model architecture, optimizer, or data pipeline.", "authors": [ "Hailing Cheng", "Tao Huang", "Chen Zhu", "Antonio Alonso" ], "year": 2026, "published_date": "2026-04-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.24708v1", "pdf_url": "https://arxiv.org/pdf/2604.24708v1", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 3.56, "content_potential_score": 1.42, "interestingness_score": 2.36, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Training large neural networks with data-parallel stochastic gradient descent allocates N GPU replicas to compute effectively identical updates -- a practice that leaves the rich space of learning rate configurations entirely unexplored during training. We propose Hyperparameter-Divergent Ensemble Training (HDET), a method that repurposes these replicas for simultaneous learning rate exploration at negligible communication overhead.", "key_contribution": "We propose Hyperparameter-Divergent Ensemble Training (HDET), a method that repurposes these replicas for simultaneous learning rate exploration at negligible communication overhead.", "why_it_matters": "Scalable Hyperparameter-Divergent Ensemble Training with Automatic Learning Rate Exploration for Large Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We propose Hyperparameter-Divergent Ensemble Training (HDET), a method that repurposes these replicas for simultaneous…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Artificial Intelligence.", "url": "http://arxiv.org/abs/2604.24708v1", "difficulty": "frontier" }, { "id": "arxiv:2604.05168v1", "source": "arxiv", "source_type": "preprint", "title": "Instruction-Tuned LLMs for Parsing and Mining Unstructured Logs on Leadership HPC Systems", "abstract": "Leadership-class HPC systems generate massive volumes of heterogeneous, largely unstructured system logs. Because these logs originate from diverse software, hardware, and runtime layers, they exhibit inconsistent formats, making structure extraction and pattern discovery extremely challenging. Therefore, robust log parsing and mining is critical to transform this raw telemetry into actionable insights that reveal operational patterns, diagnose anomalies, and enable reliable, efficient, and scalable system analysis. Recent advances in large language models (LLMs) offer a promising new direction for automated log understanding in leadership-class HPC environments. To capitalize on this opportunity, we present a domain-adapted, instruction-following, LLM-driven framework that leverages chain-of-thought (CoT) reasoning to parse and structure HPC logs with high fidelity. Our approach combines domain-specific log-template data with instruction-tuned examples to fine-tune an 8B-parameter LLaMA model tailored for HPC log analysis. We develop a hybrid fine-tuning methodology that adapts a general-purpose LLM to domain-specific log data, enabling privacy-preserving, locally deployable, fast, and energy-efficient log-mining approach. We conduct experiments on a diverse set of log datasets from the LogHub repository. The evaluation confirms that our approach achieves parsing accuracy on par with significantly larger models, such as LLaMA 70B and Anthropic's Claude. We further validate the practical utility of our fine-tuned LLM model by parsing over 600 million production logs from the Frontier supercomputer over a four-week window, uncovering critical patterns in temporal dynamics, node-level anomalies, and workload-error log correlations.", "authors": [ "Ahmad Maroof Karimi", "Jong Youl Choi", "Charles Qing Cao", "Awais Khan" ], "year": 2026, "published_date": "2026-04-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.05168v1", "pdf_url": "https://arxiv.org/pdf/2604.05168v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Prompting", "Fine-Tuning", "Federated Learning" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 6.32, "content_potential_score": 1.55, "interestingness_score": 2.42, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Leadership-class HPC systems generate massive volumes of heterogeneous, largely unstructured system logs. Because these logs originate from diverse software, hardware, and runtime layers, they exhibit inconsistent formats, making structure extraction and pattern discovery extremely challenging.", "key_contribution": "To capitalize on this opportunity, we present a domain-adapted, instruction-following, LLM-driven framework that leverages chain-of-thought (CoT) reasoning to parse and structure HPC logs with high fidelity.", "why_it_matters": "Instruction-Tuned LLMs for Parsing and Mining Unstructured Logs on Leadership HPC Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To capitalize on this opportunity, we present a domain-adapted, instruction-following, LLM-driven framework that…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.05168v1", "difficulty": "beginner" }, { "id": "arxiv:2601.03260", "source": "arxiv", "source_type": "preprint", "title": "SciNet: Evaluating AI Agents in Relation-Aware Scientific Literature Retrieval", "abstract": "AI agents have seen widespread adoption in information retrieval for scientific research, giving rise to tools such as Deep Research. However, existing retrieval agents mainly rely on keyword- or embedding-based methods. While effective at capturing content-level similarities, they struggle to understand complex relational networks among scientific papers, such as identifying corroborating or conflicting studies and tracing technological lineages. This fundamental limitation often results in fragmented knowledge structures, misinterpreted research sentiment, and ineffective modeling of collective scientific progress. To address this limitation, we introduce SciNet, the first Scientific Network relation-aware dataset for information retrieval agents. Built on a meta-database of 269 million papers across 7 disciplines and containing 8,940 carefully designed tasks, SciNet systematically captures three levels of relational understanding: ego-centric retrieval of papers with novel knowledge structures, pairwise identification of scholarly relationships, and path-wise reconstruction of scientific evolution. Extensive evaluation of three categories of retrieval agents shows that their accuracy on relation-aware tasks often falls below 20%, highlighting a fundamental shortcoming of current retrieval paradigms. Importantly, in a downstream literature review application, agents empowered with SciNet achieve a 25.3% improvement in review quality, highlighting the critical value of relation-aware retrieval for deepening scientific insights. We publicly release SciNet at https://github.com/tsinghua-fib-lab/SciNet to support future research.", "authors": [ "Chenyang Shao", "Fengli Xu", "Yong Li" ], "year": 2026, "published_date": "2026-05-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.03260", "pdf_url": "https://arxiv.org/pdf/2601.03260", "citations": 0, "topics": [], "tags": [ "AI Agents", "IR", "NLP" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.04, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "AI agents have seen widespread adoption in information retrieval for scientific research, giving rise to tools such as Deep Research. However, existing retrieval agents mainly rely on keyword- or embedding-based methods.", "key_contribution": "To address this limitation, we introduce SciNet, the first Scientific Network relation-aware dataset for information retrieval agents.", "why_it_matters": "SciNet: Evaluating AI Agents in Relation-Aware Scientific Literature Retrieval represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "To address this limitation, we introduce SciNet, the first Scientific Network relation-aware dataset for information…", "biggest_caveat": "However, existing retrieval agents mainly rely on keyword- or embedding-based methods.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2601.03260", "difficulty": "intermediate" }, { "id": "arxiv:2506.11060", "source": "arxiv", "source_type": "preprint", "title": "Code Researcher: Deep Research Agent for Large Systems Code and Commit History", "abstract": "Large Language Model (LLM)-based coding agents have shown promising results on coding benchmarks, but their effectiveness on systems code remains underexplored. Due to the size and complexities of systems code, making changes to a systems codebase requires researching about many pieces of context, derived from the large codebase and its massive commit history, before making changes. Inspired by the recent progress on deep research agents, we design the first deep research agent for code, called Code Researcher, and apply it to the problem of generating patches to mitigate crashes reported in systems code. Code Researcher performs multi-step reasoning about semantics, patterns, and commit history of code to retrieve all relevant context from the codebase and its commit history. We evaluate Code Researcher on kBenchSyz, a benchmark of Linux kernel crashes, and show that it significantly outperforms strong baselines, achieving a crash-resolution rate (CRR) of 48%, compared to 31.5% by SWE-agent and 31% by Agentless, using OpenAI's GPT-4o model. Scaling up sampling budget to 10 trajectories increases Code Researcher's CRR to 54%. Code Researcher is also robust to model choices, reaching 67% with the newer Gemini 2.5-Flash model. Through another experiment on an open-source multimedia software, we show the generalizability of Code Researcher and also conduct ablations. Our experiments highlight the importance of global context gathering and multi-faceted reasoning for large codebases.", "authors": [ "Ramneet Singh", "Sathvik Joel", "Abhav Mehrotra", "Nalin Wadhwa", "Ramakrishna B Bairi", "Aditya Kanade", "Nagarajan Natarajan" ], "year": 2026, "published_date": "2026-05-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2506.11060", "pdf_url": "https://arxiv.org/pdf/2506.11060", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Adversarial", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 6.23, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large Language Model (LLM)-based coding agents have shown promising results on coding benchmarks, but their effectiveness on systems code remains underexplored. Due to the size and complexities of systems code, making changes to a systems codebase requires researching about many pieces of context, derived from the large codebase and its massive commit history, before making changes.", "key_contribution": "We evaluate Code Researcher on kBenchSyz, a benchmark of Linux kernel crashes, and show that it significantly outperforms strong baselines, achieving a crash-resolution rate (CRR) of 48%, compared to 31.5% by SWE-agent and 31% by Agentless, using OpenAI's GPT-4o model.", "why_it_matters": "Code Researcher: Deep Research Agent for Large Systems Code and Commit History represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We evaluate Code Researcher on kBenchSyz, a benchmark of Linux kernel crashes, and show that it significantly…", "biggest_caveat": "but their effectiveness on systems code remains underexplored.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2506.11060", "difficulty": "beginner" }, { "id": "arxiv:2410.14702", "source": "arxiv", "source_type": "preprint", "title": "Polymath: A Challenging Multi-modal Mathematical Reasoning Benchmark", "abstract": "Multi-modal Large Language Models (MLLMs) exhibit impressive problem-solving abilities in various domains, but their visual comprehension and abstract reasoning skills remain under-evaluated. To this end, we present PolyMATH, a challenging benchmark aimed at evaluating the general cognitive reasoning abilities of MLLMs. PolyMATH comprises 5,000 manually collected high-quality images of cognitive textual and visual challenges across 10 distinct categories, including pattern recognition, spatial reasoning, and relative reasoning. We conducted a comprehensive, and quantitative evaluation of 15 MLLMs using four diverse prompting strategies, including Chain-of-Thought and Step-Back. The best scores achieved on PolyMATH are ~41%, ~36%, and ~27%, obtained by Claude-3.5 Sonnet, GPT-4o and Gemini-1.5 Pro respectively - highlighting the logical and visual complexity of these questions. A further fine-grained error analysis reveals that these models struggle to understand spatial relations and perform drawn-out, high-level reasoning. This is further strengthened by our ablation study estimating MLLM performance when given textual descriptions in place of diagrams. As evidenced by ~4% improvement over textual descriptions as opposed to actual images, we discover that models do not truly comprehend visual diagrams and the spatial information therein, and are thus prone to logical errors. Finally, we evaluate the OpenAI o1 models and find that their performance only matches the human baseline, highlighting the difficulty of the benchmark. The results on PolyMATH highlight the room for improvement in multi-modal reasoning and provide unique insights to guide the development of future MLLMs.", "authors": [ "Himanshu Gupta", "Shreyas Verma", "Ujjwala Anantheswaran", "Kevin Scaria", "Mihir Parmar", "Swaroop Mishra", "Chitta Baral" ], "year": 2026, "published_date": "2026-05-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2410.14702", "pdf_url": "https://arxiv.org/pdf/2410.14702", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Multimodal", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Uses ablation study — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.09, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multi-modal Large Language Models (MLLMs) exhibit impressive problem-solving abilities in various domains, but their visual comprehension and abstract reasoning skills remain under-evaluated. To this end, we present PolyMATH, a challenging benchmark aimed at evaluating the general cognitive reasoning abilities of MLLMs.", "key_contribution": "To this end, we present PolyMATH, a challenging benchmark aimed at evaluating the general cognitive reasoning abilities of MLLMs.", "why_it_matters": "Polymath: A Challenging Multi-modal Mathematical Reasoning Benchmark represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To this end, we present PolyMATH, a challenging benchmark aimed at evaluating the general cognitive reasoning abilities…", "biggest_caveat": "but their visual comprehension and abstract reasoning skills remain under-evaluated.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2410.14702", "difficulty": "advanced" }, { "id": "arxiv:2605.04107", "source": "arxiv", "source_type": "preprint", "title": "TSCG: Deterministic Tool-Schema Compilation for Agentic LLM Deployments", "abstract": "Production agent frameworks (OpenAI Function Calling, Anthropic Tool Use, MCP) transmit tool schemas as JSON, a format designed for machine parsing, not for interpretation by language models. For small models (4B-14B), this protocol mismatch accounts for the majority of tool-use failure at production catalog sizes. We present TSCG, a deterministic tool-schema compiler that resolves this mismatch at the API boundary, converting JSON schemas into token-efficient structured text without model access, fine-tuning, or runtime search. TSCG combines eight composable operators with a formal compression bound (>=51% on well-formed schemas). On TSCG-Agentic-Bench (about 19,000 calls, 12 models, 5 scenarios), TSCG restores Phi-4 14B from 0% to 84.4% accuracy at 20 tools (90.3% at 50 tools) and achieves 108-181% accuracy-retained ratio across three models on BFCL. Format-versus-compression decomposition (R^2=0.88 -> 0.03) establishes representation change as the dominant mechanism. Per-operator isolation across three frontier models reveals three distinct operator-response profiles: operator-hungry (Opus 4.7), operator-sensitive (GPT-5.2), and operator-robust (Sonnet 4), providing per-model deployment guidance. Scaling experiments show accuracy advantages persisting on heavy production MCP schemas (+5.0 pp at about 10,500 input tokens) despite saturation on light synthetic catalogs, with 52-57% token savings throughout. The synthetic benchmark generalizes to real MCP schemas within 0.1 accuracy points. TSCG ships as a 1,200-line zero-dependency TypeScript package.", "authors": [ "Furkan Sakizli" ], "year": 2026, "published_date": "2026-05-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.04107", "pdf_url": "https://arxiv.org/pdf/2605.04107", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "AI Agents", "Evaluation", "Software Engineering" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 6.17, "content_potential_score": 2.05, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Production agent frameworks (OpenAI Function Calling, Anthropic Tool Use, MCP) transmit tool schemas as JSON, a format designed for machine parsing, not for interpretation by language models. For small models (4B-14B), this protocol mismatch accounts for the majority of tool-use failure at production catalog sizes.", "key_contribution": "We present TSCG, a deterministic tool-schema compiler that resolves this mismatch at the API boundary, converting JSON schemas into token-efficient structured text without model access, fine-tuning, or runtime search.", "why_it_matters": "TSCG: Deterministic Tool-Schema Compilation for Agentic LLM Deployments represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present TSCG, a deterministic tool-schema compiler that resolves this mismatch at the API boundary, converting JSON…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.04107", "difficulty": "beginner" }, { "id": "arxiv:2604.25934", "source": "arxiv", "source_type": "preprint", "title": "LLM Psychosis: A Theoretical and Diagnostic Framework for Reality-Boundary Failures in Large Language Models", "abstract": "The deployment of large language models (LLMs) as interactive agents has exposed a category of behavioral failure that prevailing terminology, principally hallucination, fails to adequately characterize. This paper introduces LLM Psychosis as a structured theoretical framework for pathological breakdowns in model cognition that exhibit functional resemblance to clinically recognized psychotic disorders. Five hallmark features define the framework: reality-boundary dissolution, persistence of injected false beliefs, logical incoherence under impossible constraints, self-model instability, and epistemic overconfidence. We argue these constitute a qualitatively distinct failure mode rather than a mere intensification of ordinary factual error. To operationalize the framework, we propose the LLM Cognitive Integrity Scale (LCIS), a five-axis diagnostic instrument organized around Environmental Reality Interface (ERI), Premise Arbitration Integrity (PAI), Logical Constraint Recognition (LCR), Self-Model Integrity (SMI), and Epistemic Calibration Integrity (ECI). We administer a targeted adversarial probe battery to ChatGPT 5 (GPT-5, OpenAI) and report empirical findings for each axis, documenting both intact-integrity baseline responses and the specific psychosis-like failure signatures elicited under adversarial escalation. Results support a three-tier severity taxonomy: Type I (Confabulatory), Type II (Delusional), and Type III (Dissociative). We further formalize the delusional gradient, a self-reinforcing dynamic in which correction pressure intensifies rather than resolves psychosis-like states, as the most consequential failure mode for deployed systems. Implications for safety evaluation, high-stakes deployment screening, and mechanistic interpretability research are discussed.", "authors": [ "Ashutosh Raj" ], "year": 2026, "published_date": "2026-04-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.25934", "pdf_url": "https://arxiv.org/pdf/2604.25934", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "Biomedical AI", "Interpretability", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.81, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The deployment of large language models (LLMs) as interactive agents has exposed a category of behavioral failure that prevailing terminology, principally hallucination, fails to adequately characterize. This paper introduces LLM Psychosis as a structured theoretical framework for pathological breakdowns in model cognition that exhibit functional resemblance to clinically recognized psychotic disorders.", "key_contribution": "To operationalize the framework, we propose the LLM Cognitive Integrity Scale (LCIS), a five-axis diagnostic instrument organized around Environmental Reality Interface (ERI), Premise Arbitration Integrity (PAI), Logical Constraint Recognition (LCR), Self-Model Integrity (SMI), and Epistemic Calibration Integrity (ECI).", "why_it_matters": "LLM Psychosis: A Theoretical and Diagnostic Framework for Reality-Boundary Failures in Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To operationalize the framework, we propose the LLM Cognitive Integrity Scale (LCIS), a five-axis diagnostic instrument…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2604.25934", "difficulty": "intermediate" }, { "id": "arxiv:2604.00812v1", "source": "arxiv", "source_type": "preprint", "title": "Cost-Penalized Fitness in FMA-Orchestrated Mixture of Experts: Experimental Evidence for Molecular Memory in Domain Adaptation", "abstract": "We present experimental results from seven controlled runs of nanoFMT, a Free-Market Algorithm (FMA) orchestrated transformer with dynamic Mixture-of-Experts (MoE) management. The experiments address a fundamental question for advanced LLM development: how should an MoE system manage its expert pool when operating at full capacity under changing data distributions? We demonstrate that cost-penalized fitness metrics, combined with a linear grace period for newborn experts, produce a system that accumulates domain expertise through diversification rather than replacement. The central result is a round-trip domain shift experiment showing 9-11x faster recovery when returning to a previously learned domain, with zero expert births or replacements required. This \"molecular memory\" effect -- where dormant experts survive and reactivate when their domain returns -- has no analogue in current MoE management approaches. A preliminary cost analysis estimates annual savings of $39.1M and 27.1 GWh energy reduction for an OpenAI-scale provider under a moderate scenario.", "authors": [ "Martin Jaraiz" ], "year": 2026, "published_date": "2026-04-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.00812v1", "pdf_url": "https://arxiv.org/pdf/2604.00812v1", "citations": 0, "topics": [], "tags": [ "LLMs", "MoE", "Transformer Architectures", "Mixture of Experts", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (MoE) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 5.21, "content_potential_score": 0.45, "interestingness_score": 1.88, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present experimental results from seven controlled runs of nanoFMT, a Free-Market Algorithm (FMA) orchestrated transformer with dynamic Mixture-of-Experts (MoE) management. The experiments address a fundamental question for advanced LLM development: how should an MoE system manage its expert pool when operating at full capacity under changing data distributions?", "key_contribution": "We present experimental results from seven controlled runs of nanoFMT, a Free-Market Algorithm (FMA) orchestrated transformer with dynamic Mixture-of-Experts (MoE) management.", "why_it_matters": "Cost-Penalized Fitness in FMA-Orchestrated Mixture of Experts: Experimental Evidence for Molecular Memory in Domain Adaptation extends Transformer capabilities — the architecture underpinning virtually every modern NLP and vision model.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present experimental results from seven controlled runs of nanoFMT, a Free-Market Algorithm (FMA) orchestrated…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.00812v1", "difficulty": "advanced" }, { "id": "arxiv:2604.01015v1", "source": "arxiv", "source_type": "preprint", "title": "Forecasting Motion in the Wild", "abstract": "Visual intelligence requires anticipating the future behavior of agents, yet vision systems lack a general representation for motion and behavior. We propose dense point trajectories as visual tokens for behavior, a structured mid-level representation that disentangles motion from appearance and generalizes across diverse non-rigid agents, such as animals in-the-wild. Building on this abstraction, we design a diffusion transformer that models unordered sets of trajectories and explicitly reasons about occlusion, enabling coherent forecasts of complex motion patterns. To evaluate at scale, we curate 300 hours of unconstrained animal video with robust shot detection and camera-motion compensation. Experiments show that forecasting trajectory tokens achieves category-agnostic, data-efficient prediction, outperforms state-of-the-art baselines, and generalizes to rare species and morphologies, providing a foundation for predictive visual intelligence in the wild.", "authors": [ "Neerja Thakkar", "Shiry Ginosar", "Jacob Walker", "Jitendra Malik", "Joao Carreira", "Carl Doersch" ], "year": 2026, "published_date": "2026-04-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.01015v1", "pdf_url": "https://arxiv.org/pdf/2604.01015v1", "citations": 0, "topics": [], "tags": [ "Transformers", "Transformer Architectures", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.82, "content_potential_score": 2.55, "interestingness_score": 2.92, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Visual intelligence requires anticipating the future behavior of agents, yet vision systems lack a general representation for motion and behavior. We propose dense point trajectories as visual tokens for behavior, a structured mid-level representation that disentangles motion from appearance and generalizes across diverse non-rigid agents, such as animals in-the-wild.", "key_contribution": "We propose dense point trajectories as visual tokens for behavior, a structured mid-level representation that disentangles motion from appearance and generalizes across diverse non-rigid agents, such as animals in-the-wild.", "why_it_matters": "Forecasting Motion in the Wild extends Transformer capabilities — the architecture underpinning virtually every modern NLP and vision model.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "We propose dense point trajectories as visual tokens for behavior, a structured mid-level representation that…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Transformers.", "url": "http://arxiv.org/abs/2604.01015v1", "difficulty": "intermediate" }, { "id": "arxiv:2605.09518", "source": "arxiv", "source_type": "preprint", "title": "LLM-Driven Performance-Space Augmentation for Meta-Learning-Based Algorithm Selection", "abstract": "Meta-learning for algorithm selection relies on a meta-dataset in which each row corresponds to a supervised learning dataset described by meta-features and labelled with a target value that is associated with algorithm choice (typically, some function of algorithm performance). A persistent limitation is that the number of curated real-world datasets is small, resulting in sparse meta-datasets that constrain meta-learner generalisation. In this paper, we address this problem by augmenting the meta-dataset with synthetic regression datasets produced via a large language model (LLM), with generation steered toward target regions of a low-dimensionality performance space. In our experiments, we adopt a two-dimensional geometric setting defined by the cross-validated $R^2$ scores of two anchor algorithms, known as landmarkers. We compare two augmentation strategies: (1) uniform sampling, which distributes synthetic datasets across the performance space; and (2) margin-based sampling, which concentrates them near the decision boundary where landmarker preference is most ambiguous. Across 42 real-world UCI regression datasets and 730 synthetic datasets, both strategies substantially improve meta-learner performance over the unaugmented baseline under regression and multi-label evaluation formulations. However, uniform augmentation consistently outperforms margin-based augmentation, achieving a 17.47% relative reduction in Hamming loss, a 100.41% relative improvement in subset accuracy, and a +6.09% relative gain in pooled out-of-fold $R^2$. These results lead us to postulate a central thesis: the performance of algorithms resides on a low-dimensional performance manifold, whose reconstruction bias may be minimised by user-guided LLMs that seek to maximise uniform $ε$-cover, and consequently, lead to improved meta-learning for algorithm selection.", "authors": [ "Darren Zhu", "Daren Ler" ], "year": 2026, "published_date": "2026-05-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.09518", "pdf_url": "https://arxiv.org/pdf/2605.09518", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Fairness & Ethics", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses manifold and related concepts.", "maturity_stage": "emerging", "paper_score": 3.3, "read_first_score": 4.12, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Meta-learning for algorithm selection relies on a meta-dataset in which each row corresponds to a supervised learning dataset described by meta-features and labelled with a target value that is associated with algorithm choice (typically, some function of algorithm performance). A persistent limitation is that the number of curated real-world datasets is small, resulting in sparse meta-datasets that constrain meta-learner generalisation.", "key_contribution": "Meta-learning for algorithm selection relies on a meta-dataset in which each row corresponds to a supervised learning dataset described by meta-features and labelled with a target value that is associated with algorithm choice (typically, some function of algorithm performance).", "why_it_matters": "LLM-Driven Performance-Space Augmentation for Meta-Learning-Based Algorithm Selection represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Meta-learning for algorithm selection relies on a meta-dataset in which each row corresponds to a supervised learning…", "biggest_caveat": "limitation is that the number of curated real-world datasets is small, resulting in sparse meta-datasets that constrain meta-learner generalisation.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.09518", "difficulty": "frontier" }, { "id": "arxiv:2609.22833", "source": "arxiv", "source_type": "preprint", "title": "Personalized Federated Reinforcement Learning via Model-Agnostic Meta-Learning: Convergence of Exact and Hessian-Free Meta-Policy Gradients", "abstract": "We study personalized federated reinforcement learning, in which $n$ agents, each acting in its own Markov decision process, collaborate through a server to learn a shared MAML-style policy initialization that becomes effective for an individual agent once that agent adapts it with a single local policy-gradient step. We propose Per-FedAvg-PG, in which agents take $τ$ local stochastic meta-policy-gradient steps between communication rounds, and prove that it reaches an $\\varepsilon$-approximate first-order stationary point of the personalized objective in $K=\\mathcal O(\\varepsilon^{-3/2})$ rounds with $τ=Θ(\\varepsilon^{-1/2})$ local steps. The analysis rests on a structural feature of the reinforcement learning setting: under standard policy-class regularity, the per-agent objectives have uniformly bounded gradients and Hessians with explicit constants, so the bounded-gradient and bounded-heterogeneity conditions imposed by the supervised theory hold automatically and no separate heterogeneity assumption is needed. The exact meta-gradient requires the inner-loop policy Hessian, which our experiments identify as the practical bottleneck. We therefore analyze the Hessian-free variant, bound its bias, and exhibit fixed points at which the meta-gradient is nonzero and of order $α$, showing that the resulting stationarity floor is a property of the method rather than of the bound. Experiments on tabular and neural navigation confirm the predicted behavior and show transfer to unseen agents at an order of magnitude lower sample cost than independent training. Together these results identify the adaptation step size as a tunable personalization knob and the curvature estimate as the quantity that governs whether exact meta-gradients are affordable.", "authors": [ "Ali Beikmohammadi", "Sarit Khirirat", "Sindri Magnússon" ], "year": 2026, "published_date": "2026-09-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.22833", "pdf_url": "https://arxiv.org/pdf/2609.22833", "citations": 0, "topics": [], "tags": [ "Info Extraction", "RL", "Structured Data", "Fairness & Ethics", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 4.62, "content_potential_score": 0.0, "interestingness_score": 1.65, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We study personalized federated reinforcement learning, in which $n$ agents, each acting in its own Markov decision process, collaborate through a server to learn a shared MAML-style policy initialization that becomes effective for an individual agent once that agent adapts it with a single local policy-gradient step. We propose Per-FedAvg-PG, in which agents take $τ$ local stochastic meta-policy-gradient steps between communication rounds, and prove that it reaches an $\\varepsilon$-approximate first-order stationary point of the personalized objective in $K=\\mathcal O(\\varepsilon^{-3/2})$ rounds with $τ=Θ(\\varepsilon^{-1/2})$ local steps.", "key_contribution": "We propose Per-FedAvg-PG, in which agents take $τ$ local stochastic meta-policy-gradient steps between communication rounds, and prove that it reaches an $\\varepsilon$-approximate first-order stationary point of the personalized objective in $K=\\mathcal O(\\varepsilon^{-3/2})$ rounds with $τ=Θ(\\varepsilon^{-1/2})$ local steps.", "why_it_matters": "Personalized Federated Reinforcement Learning via Model-Agnostic Meta-Learning: Convergence of Exact and Hessian-Free Meta-Policy Gradients represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We propose Per-FedAvg-PG, in which agents take $τ$ local stochastic meta-policy-gradient steps between communication…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2609.22833", "difficulty": "frontier" }, { "id": "arxiv:2605.17707", "source": "arxiv", "source_type": "preprint", "title": "Speed Kills: Exploring Confused Deputy Attacks Through Edge AI Accelerators", "abstract": "AI Accelerator (AIA) are specialized hardware e.g., Tensor Processing Unit (TPU), that enable optimal and efficient execution of AI applications and on-device inference. The growing demand for AI applications has led to the widespread adoption of AIAs on Edge or embedded devices on Edge or embedded devices. Unlike applications, AIAs are not bound by Operating System (OS) restrictions and have limited visibility into Application Processor (AP) security mechanisms (e.g., kernel vs. application memory, process isolation). This semantic gap can lead to confused deputy vulnerabilities, i.e., AIA can be tricked by a malicious application to perform privileged operations on their behalf. In this paper, we conducted the first in-depth study of Confused Deputy Attacks (CDAs) using AIA. We design DeputyHunt, a Large Language Model (LLM) assisted framework to extract CDA relevant information for a given AIA through a combination of dynamic and static analysis. We used this information to explore the feasibility of CDA on seven different AIAs from popular vendors, i.e., Google, NVIDIA, Hailo, Texas Instruments, NXP, AWS, and Rockchip. Our analysis revealed that CDA is feasible on six out of the seven AIAs, impacting over 128 System On Chips (SOCs) and over 100 million devices. Our findings highlight critical security risks posed by AIA on system security. Our work has been acknowledged by the corresponding vendors and assigned the CVE-2025-66425. We propose an on-demand validation defense against CDA, and evaluation on the Gem5- salam simulator shows that it incurs minimal runtime overhead (i.e., ~15%).", "authors": [ "Datta Manikanta Sri Hari Danduri", "Aravind Kumar Machiry" ], "year": 2026, "published_date": "2026-05-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.17707", "pdf_url": "https://arxiv.org/pdf/2605.17707", "citations": 0, "topics": [], "tags": [ "LLMs", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 5.4, "content_potential_score": 1.84, "interestingness_score": 2.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "AI Accelerator (AIA) are specialized hardware e.g., Tensor Processing Unit (TPU), that enable optimal and efficient execution of AI applications and on-device inference. The growing demand for AI applications has led to the widespread adoption of AIAs on Edge or embedded devices on Edge or embedded devices.", "key_contribution": "We propose an on-demand validation defense against CDA, and evaluation on the Gem5- salam simulator shows that it incurs minimal runtime overhead (i.e., ~15%).", "why_it_matters": "Speed Kills: Exploring Confused Deputy Attacks Through Edge AI Accelerators represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose an on-demand validation defense against CDA, and evaluation on the Gem5- salam simulator shows that it…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.17707", "difficulty": "intermediate" }, { "id": "arxiv:2608.26088", "source": "arxiv", "source_type": "preprint", "title": "Planetary Prediction Engine: Autonomous Geospatial Prediction via Intelligent Data Selection and Foundation Model Embeddings", "abstract": "Addressing critical global challenges, from food security and disaster risk to disease outbreaks and socio-economic vulnerability, demands high-fidelity geospatial modeling. However, building predictive planetary models remains bottlenecked by a fragmented data ecosystem, requiring manual data retrieval, multimodal data curation and fusion along with iterative model selection. We present the Planetary Prediction Engine (PPE), an autonomous AI system that executes this end-to-end workflow directly from natural-language queries. PPE synthesizes multimodal datasets on the fly, retrieving spatiotemporally relevant covariates across open-web and Earth observation platforms (Data Commons, Google Earth Engine) and fusing them with geospatial foundation model embeddings (PDFM, AlphaEarth). Simultaneously, it searches over task-tailored model architecture families with automated overfitting guards. Across diverse tasks, geographies, and scientific domains, PPE consistently outperforms state-of-the-art or manually tuned expert baselines. For US spatial regression, PPE improves mean $R^2$ across 21 CDC health indicators (76.8% vs. 60.0%), FEMA national risk indices (64.9% vs. 60.0%), and the Social Vulnerability Index (66.2% vs. 58.6%). For spatial downscaling in data-scarce settings, PPE integrates localized proxies to double baseline accuracy in Nigerian food security indicators ($R^2$ of 66.1% vs. 31.5%). For epidemiological nowcasting of the 2026 DRC Bundibugyo Ebola outbreak, PPE achieves a Recall@10 of 83.3% (identifying 15 of 18 newly invaded health zones across five weekly forecasts), a +10.3 percentage-point improvement over the public state-of-the-art modeling (~73%). By combining autonomous multimodal planetary data discovery with targeted model optimization, PPE lowers the technical barrier to planetary-scale analytics, enabling rapid, customized, expert-level deployment.", "authors": [ "Evelyn Ma", "Rama Kumar Pasumarthi", "Kishwar Shafin", "Mandar Sharma", "Mimi Sun", "Hamed Sadeghi", "Dav M. Ebengo", "Mbulayi Onesime", "Rouslan Solomakhin", "John Wamburu", "William Ogallo", "Aisha Walcott-Bryant", "Sanxing Chen", "Arbaaz Muslim", "Yael Mayer", "Ronald Ho", "Roy Lee", "Ruth Alcantara", "Abdoulaye Diack", "Monica Bharel", "Lambert Rosique", "Jeremy Amez-Droz", "Christopher Haire", "James Manyika", "Yossi Matias", "Niv Efron", "Gautam Prasad", "Shravya Shetty" ], "year": 2026, "published_date": "2026-08-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.26088", "pdf_url": "https://arxiv.org/pdf/2608.26088", "citations": 0, "topics": [], "tags": [ "Multimodal", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Addressing critical global challenges, from food security and disaster risk to disease outbreaks and socio-economic vulnerability, demands high-fidelity geospatial modeling. However, building predictive planetary models remains bottlenecked by a fragmented data ecosystem, requiring manual data retrieval, multimodal data curation and fusion along with iterative model selection.", "key_contribution": "We present the Planetary Prediction Engine (PPE), an autonomous AI system that executes this end-to-end workflow directly from natural-language queries.", "why_it_matters": "Planetary Prediction Engine: Autonomous Geospatial Prediction via Intelligent Data Selection and Foundation Model Embeddings represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We present the Planetary Prediction Engine (PPE), an autonomous AI system that executes this end-to-end workflow…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2608.26088", "difficulty": "intermediate" }, { "id": "arxiv:2604.25154v1", "source": "arxiv", "source_type": "preprint", "title": "Prior-Aligned Data Cleaning for Tabular Foundation Models", "abstract": "Tabular Foundation Models (TFMs) achieve state-of-the-art zero-shot accuracy on small tabular datasets by meta-learning over synthetic data-generating processes -- making them highly attractive for practitioners who cannot afford large annotated corpora. However, their in-context learning mechanism assumes approximately clean inputs: missing values, outliers, and duplicates in the real-world data create a prior mismatch that degrades both accuracy and confidence calibration simultaneously. Correcting this mismatch requires sequential decisions over cleaning operators whose interactions no static preprocessing rule can anticipate -a natural fit for reinforcement learning~(RL). We introduce L2C2, the first deep RL framework framing tabular data cleaning as prior alignment: a learned policy sequences operators to minimize the distributional gap between dirty input and the TFM's synthetic prior. Six experiments on ten OpenML benchmark datasets establish: 1) three of seven reward designs collapse to degenerate trivial cleaning strategies -- principled reward engineering is scientifically non-trivial; 2) the novel TFMAwareReward reward we propose selects structurally distinct pipelines on 4/10 datasets and achieves higher TabPFN accuracy on those diverging cases (mean 0.851 vs. 0.843; Wilcoxon p=0.063, n=4) while never underperforming; 3) parameterized cleaning actions improve best-found pipeline reward on 9/10 datasets (Wilcoxon p=0.004); and 4) a policy pre-trained on one single source dataset exceeds scratch training at the 2,000-step fine-tuning checkpoint on all three held-out datasets (up to +28.8% after full fine-tuning) demonstrating cross-dataset transfer of prior-alignment knowledge. These findings establish that prior alignment is a principled data preparation strategy for TFM deployment on real-world tabular data.", "authors": [ "Laure Berti-Equille" ], "year": 2026, "published_date": "2026-04-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.25154v1", "pdf_url": "https://arxiv.org/pdf/2604.25154v1", "citations": 0, "topics": [], "tags": [ "Prompting", "Fine-Tuning", "AI Safety", "RL", "Structured Data" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 6.5, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Tabular Foundation Models (TFMs) achieve state-of-the-art zero-shot accuracy on small tabular datasets by meta-learning over synthetic data-generating processes -- making them highly attractive for practitioners who cannot afford large annotated corpora. However, their in-context learning mechanism assumes approximately clean inputs: missing values, outliers, and duplicates in the real-world data create a prior mismatch that degrades both accuracy and confidence calibration simultaneously.", "key_contribution": "Tabular Foundation Models (TFMs) achieve state-of-the-art zero-shot accuracy on small tabular datasets by meta-learning over synthetic data-generating processes -- making them highly attractive for practitioners who cannot afford large annotated corpora.", "why_it_matters": "Prior-Aligned Data Cleaning for Tabular Foundation Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "Tabular Foundation Models (TFMs) achieve state-of-the-art zero-shot accuracy on small tabular datasets by meta-learning…", "biggest_caveat": "cannot afford large annotated corpora.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "http://arxiv.org/abs/2604.25154v1", "difficulty": "beginner" }, { "id": "arxiv:2605.27865", "source": "arxiv", "source_type": "preprint", "title": "MERIT: Matching Expertise via Rubric-Informed Training for Reviewer Assignment", "abstract": "Matching submissions with suitable reviewers at scale is a growing challenge for major venues, yet existing approaches either rely on coarse proxy signals that conflate general relatedness with true suitability, or require expensive human annotations that are difficult to scale for training. We propose MERIT, a two-stage framework that bridges this gap by converting criterion-level expertise matching into scalable suitability supervision. In the first stage, we train a reviewer assessor via reinforcement learning to identify the expertise dimensions a paper requires, match them against the reviewer's prior work, and produce a suitability decision, with rewards provided by an LLM judge guided by paper-specific expertise rubrics. In the second stage, we distill the assessor's predictions into an embedding-based retriever for efficient large-scale assignment. Experiments show that our 4B reviewer assessor outperforms larger general-purpose LLMs on suitability classification, and the resulting retriever achieves state-of-the-art performance across LR-Bench and the CMU Gold dataset. Our code is available at https://github.com/Luli3220/MERIT.", "authors": [ "Zixuan Yang", "Yibo Zhao", "Weicong Liu", "Xiang Li" ], "year": 2026, "published_date": "2026-05-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.27865", "pdf_url": "https://arxiv.org/pdf/2605.27865", "citations": 0, "topics": [], "tags": [ "LLMs", "RL", "NLP" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 4.21, "content_potential_score": 2.05, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Matching submissions with suitable reviewers at scale is a growing challenge for major venues, yet existing approaches either rely on coarse proxy signals that conflate general relatedness with true suitability, or require expensive human annotations that are difficult to scale for training. We propose MERIT, a two-stage framework that bridges this gap by converting criterion-level expertise matching into scalable suitability supervision.", "key_contribution": "We propose MERIT, a two-stage framework that bridges this gap by converting criterion-level expertise matching into scalable suitability supervision.", "why_it_matters": "MERIT: Matching Expertise via Rubric-Informed Training for Reviewer Assignment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose MERIT, a two-stage framework that bridges this gap by converting criterion-level expertise matching into…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.27865", "difficulty": "advanced" }, { "id": "arxiv:2603.12031", "source": "arxiv", "source_type": "preprint", "title": "AGMARL-DKS: An Adaptive Graph-Enhanced Multi-Agent Reinforcement Learning for Dynamic Kubernetes Scheduling", "abstract": "State-of-the-art cloud-native applications require intelligent schedulers that can effectively balance system stability, resource utilisation, and associated costs. While Kubernetes provides feasibility-based placement by default, recent research efforts have explored the use of reinforcement learning (RL) for more intelligent scheduling decisions. However, current RL-based schedulers have three major limitations. First, most of these schedulers use monolithic centralised agents, which are non-scalable for large heterogeneous clusters. Second, the ones that use multi-objective reward functions assume simple, static, linear combinations of the objectives. Third, no previous work has produced a stress-aware scheduler that can react adaptively to dynamic conditions. To address these gaps in current research, we propose the Adaptive Graph-enhanced Multi-Agent Reinforcement Learning Dynamic Kubernetes Scheduler (AGMARL-DKS). AGMARL-DKS addresses these gaps by introducing three major innovations. First, we construct a scalable solution by treating the scheduling challenge as a cooperative multi-agent problem, where every cluster node operates as an agent, employing centralised training methods before decentralised execution. Second, to be context-aware and yet decentralised, we use a Graph Neural Network (GNN) to build a state representation of the global cluster context at each agent. This represents an improvement over methods that rely solely on local observations. Finally, to make trade-offs between these objectives, we use a stress-aware lexicographical ordering policy instead of a simple, static linear weighting of these objectives. The evaluations in Google Kubernetes Engine (GKE) reveal that AGMARL-DKS significantly outperforms the default scheduler in terms of fault tolerance, utilisation, and cost, especially in scheduling batch and mission-critical workloads.", "authors": [ "Hamed Hamzeh" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.12031", "pdf_url": "https://arxiv.org/pdf/2603.12031", "citations": 0, "topics": [], "tags": [ "AI Agents", "GNNs", "RL", "Multi-Agent Systems", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (GNNs, RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 4.12, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "State-of-the-art cloud-native applications require intelligent schedulers that can effectively balance system stability, resource utilisation, and associated costs. While Kubernetes provides feasibility-based placement by default, recent research efforts have explored the use of reinforcement learning (RL) for more intelligent scheduling decisions.", "key_contribution": "To address these gaps in current research, we propose the Adaptive Graph-enhanced Multi-Agent Reinforcement Learning Dynamic Kubernetes Scheduler (AGMARL-DKS).", "why_it_matters": "AGMARL-DKS: An Adaptive Graph-Enhanced Multi-Agent Reinforcement Learning for Dynamic Kubernetes Scheduling represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "To address these gaps in current research, we propose the Adaptive Graph-enhanced Multi-Agent Reinforcement Learning…", "biggest_caveat": "However, current RL-based schedulers have three major limitations.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2603.12031", "difficulty": "advanced" }, { "id": "arxiv:2608.07167", "source": "arxiv", "source_type": "preprint", "title": "NiyamAI - An Intent-Bound AI Agent with Cryptographically Verifiable Guardrails using Zero-Knowledge Proofs", "abstract": "Giving an AI agent the ability to send emails, query databases, or execute commands is useful--until the agent is tricked into doing something it shouldn't. Prompt injection, hallucinated reasoning, and unsafe tool calls form the primary attack surface for autonomous LLM agents. Existing defenses rely on software checks like system prompts or policy filters running on the same machine the attacker targets, offering no verifiable proof of execution. We introduce Niyam-AI, a framework that makes safety enforcement provable. At session start, permitted tools and constraints are locked into an Intent Contract committed via SHA-256. Every tool call is intercepted and validated by an isolated Judge model; upon passing, a zk-SNARK proof is generated via EZKL. The tool executes only after proof verification, allowing third parties to confirm enforcement without accessing Judge model weights. Evaluating Niyam-AI on 2,000 real-world scenarios from Agent-SafetyBench against NeMo Guardrails, Meta's Llama Prompt Guard 2, and OpenAI's GPT-OSS-Safeguard using 5-fold stratified cross-validation yields an F1 score of 88.5% with a 1.1% false-positive rate (bootstrap 95% CI: [85.19%, 91.88%], N=1000). McNemar's exact paired test confirms significant improvement: Niyam-AI wins 390 discordant scenarios against NeMo (vs 20 losses), 115 against Prompt Guard 2 (vs 13), and 384 against GPT-OSS-Safeguard (vs 19) with p < 0.0001 in all cases. Proof generation adds 2260.6 +/- 218.4 ms per approved action, while verification takes 53.1 +/- 11.8 ms. Niyam-AI provides a guardrail that is both highly accurate and mathematically verifiable--though this reflects a classifier adapted to Agent-SafetyBench evaluated against zero-shot baselines, a distinction discussed in Section IV.C.", "authors": [ "Aditya Katkar", "Om Karkele", "Kartik Mandhane", "Manisha More", "Yash Kashid" ], "year": 2026, "published_date": "2026-08-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.07167", "pdf_url": "https://arxiv.org/pdf/2608.07167", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 5.62, "content_potential_score": 0.0, "interestingness_score": 1.65, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Giving an AI agent the ability to send emails, query databases, or execute commands is useful--until the agent is tricked into doing something it shouldn't. Prompt injection, hallucinated reasoning, and unsafe tool calls form the primary attack surface for autonomous LLM agents.", "key_contribution": "We introduce Niyam-AI, a framework that makes safety enforcement provable.", "why_it_matters": "NiyamAI - An Intent-Bound AI Agent with Cryptographically Verifiable Guardrails using Zero-Knowledge Proofs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Niyam-AI, a framework that makes safety enforcement provable.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.07167", "difficulty": "frontier" }, { "id": "arxiv:2608.08466", "source": "arxiv", "source_type": "preprint", "title": "Hierarchical Self-Improvement: A Framework for Task-Specific Evolvable Agent Harnesses", "abstract": "Modern LLM agents are often improved by modifying prompts, tools, or workflows manually, while the executable scaffold surrounding the model---the \\emph{harness}---is typically treated as a fixed artifact after deployment. This work studies an alternative where the harness is \\emph{task-specific and continuously evolvable}: each task family maintains its own harness, which is hot-swapped across iterations through a fixed task-injection seam and rewritten using environment feedback. We introduce \\textbf{Hierarchical Self-Improvement (HSI)}, a framework in which a single frozen LLM $M$ operates across three hierarchical scopes: a task harness $H$ that executes tasks, an evolver that rewrites $H$, and a meta-evolver that rewrites the evolver's strategy code under a frozen outer anchor. A thinking-on/off design isolates the contribution of harness evolution by disabling reasoning during task execution while enabling it during self-modification. HSI is bounded by two factors: a \\emph{feedback-fidelity bound}, since evolution requires informative reward signals to guide selection, and a \\emph{backbone capability bound}, since harness redesign cannot overcome limitations of the frozen model. On BALROG with DeepSeek-V4-Flash-Preview as the frozen backbone, HSI achieves consistent gains over the initial harness on moderate-difficulty tasks ($+39.3$ on BabyAI, $+33.0$ on Crafter, $+25.0$ on TextWorld, and $+15.0$ on MiniHack, all in raw \\% Progress), while obtaining strong held-out generalization on BabaIsAI sub-suites ($0.98$ best-test on BreakStop and $1.00$ on GoTo from a $20\\%$ unseen split). On tasks beyond the backbone's capability (NLE), harness evolution provides no improvement. These results demonstrate task-specific harness evolution as a viable axis for improving frozen LLM agents under clear empirical limits. Code is available at https://github.com/TailinZhou/hsi.", "authors": [ "Tailin Zhou" ], "year": 2026, "published_date": "2026-08-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.08466", "pdf_url": "https://arxiv.org/pdf/2608.08466", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Modern LLM agents are often improved by modifying prompts, tools, or workflows manually, while the executable scaffold surrounding the model---the \\emph{harness}---is typically treated as a fixed artifact after deployment. This work studies an alternative where the harness is \\emph{task-specific and continuously evolvable}: each task family maintains its own harness, which is hot-swapped across iterations through a fixed task-injection seam and rewritten using environment feedback.", "key_contribution": "We introduce \\textbf{Hierarchical Self-Improvement (HSI)}, a framework in which a single frozen LLM $M$ operates across three hierarchical scopes: a task harness $H$ that executes tasks, an evolver that rewrites $H$, and a meta-evolver that rewrites the evolver's strategy code under a frozen outer anchor.", "why_it_matters": "Hierarchical Self-Improvement: A Framework for Task-Specific Evolvable Agent Harnesses represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce \\textbf{Hierarchical Self-Improvement (HSI)}, a framework in which a single frozen LLM $M$ operates across…", "biggest_caveat": "bution of harness evolution by disabling reasoning during task execution while enabling it during self-modification.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.08466", "difficulty": "intermediate" }, { "id": "arxiv:2606.06460", "source": "arxiv", "source_type": "preprint", "title": "Will the Agent Recuse Itself? Measuring LLM-Agent Compliance with In-Band Access-Deny Signals", "abstract": "As autonomous LLM agents increasingly hold real credentials and operate infrastructure without a human in the loop, operators have no standard way to tell an agent that a resource is off-limits. Access controls either let the agent in (it has valid credentials) or hard-fail it (indistinguishable from any other client). We propose a third mode: a lightweight, published in-band deny signal -- the Recuse Signal -- that a server emits over a protocol's existing channels (an SSH banner, a PostgreSQL NOTICE) asking a connecting automated agent to voluntarily withdraw. This is a cooperative governance control, the robots.txt analogue for live access; it is explicitly not a security boundary. Its value is entirely empirical and, to our knowledge, unmeasured: do compliant LLM agents actually honor such a signal? We define the signal as an open mini-standard, implement two zero- or low-footprint adapters (an SSH banner/PAM hook and a PostgreSQL wire-protocol proxy), deploy them on a live production host, and run a controlled experiment in which fresh agents are given a benign operations task and observed for recusal. In a pilot (SSH; OpenAI GPT-4o and GPT-4o-mini; and Claude Code as a deployed agent), the signal cleanly induces recusal -- 100% recusal when present versus 100% task completion in a no-signal control -- and, revealingly, behaves as a cooperative rather than absolute signal: an explicit operator-authorization framing flips the most capable model to proceed, while other agents continue to defer to the on-host policy. We release the standard, adapters, and experiment harness for reproduction.", "authors": [ "Thamilvendhan Munirathinam" ], "year": 2026, "published_date": "2026-06-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.06460", "pdf_url": "https://arxiv.org/pdf/2606.06460", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Artificial Intelligence", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 5.73, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "As autonomous LLM agents increasingly hold real credentials and operate infrastructure without a human in the loop, operators have no standard way to tell an agent that a resource is off-limits. Access controls either let the agent in (it has valid credentials) or hard-fail it (indistinguishable from any other client).", "key_contribution": "We propose a third mode: a lightweight, published in-band deny signal -- the Recuse Signal -- that a server emits over a protocol's existing channels (an SSH banner, a PostgreSQL NOTICE) asking a connecting automated agent to voluntarily withdraw.", "why_it_matters": "Will the Agent Recuse Itself? Measuring LLM-Agent Compliance with In-Band Access-Deny Signals represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose a third mode: a lightweight, published in-band deny signal -- the Recuse Signal -- that a server emits over…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.06460", "difficulty": "intermediate" }, { "id": "arxiv:2607.26345", "source": "arxiv", "source_type": "preprint", "title": "MetaKoopman: Bayesian Meta-Learning of Koopman Operators for Modeling Structured Dynamics under Distribution Shifts", "abstract": "Modeling and forecasting nonlinear dynamics under distribution shifts is essential for robust decision-making in real-world systems. In this work, we propose MetaKoopman, a Bayesian meta-learning framework for modeling nonlinear dynamics through linear latent representations. MetaKoopman learns a Matrix Normal-Inverse Wishart (MNIW) prior over the Koopman operator, enabling closed-form Bayesian updates conditioned on recent trajectory segments. Moreover, it provides a closed-form posterior predictive distribution over future state trajectories, capturing both epistemic and aleatoric uncertainty in the learned dynamics. We evaluate MetaKoopman on a full-scale autonomous truck and trailer system across a wide range of adverse winter scenarios, including snow, ice, and mixed-friction conditions, as well as in simulated control tasks with diverse distribution shifts. MetaKoopman consistently outperforms prior approaches in multi-step prediction accuracy, uncertainty calibration, and robustness to distributional shifts. Field experiments further demonstrate its effectiveness in dynamically feasible motion planning, particularly during evasive maneuvers and operation at the limits of traction. Project website: https://mahmoud-selim.github.io/MetaKoopman/", "authors": [ "Mahmoud Selim", "Sriharsha Bhat", "Karl H. Johansson" ], "year": 2026, "published_date": "2026-07-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.26345", "pdf_url": "https://arxiv.org/pdf/2607.26345", "citations": 0, "topics": [], "tags": [ "Robotics", "Adversarial", "Machine Learning", "Systems & Control" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 3.87, "content_potential_score": 0.0, "interestingness_score": 1.65, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Modeling and forecasting nonlinear dynamics under distribution shifts is essential for robust decision-making in real-world systems. In this work, we propose MetaKoopman, a Bayesian meta-learning framework for modeling nonlinear dynamics through linear latent representations.", "key_contribution": "In this work, we propose MetaKoopman, a Bayesian meta-learning framework for modeling nonlinear dynamics through linear latent representations.", "why_it_matters": "MetaKoopman: Bayesian Meta-Learning of Koopman Operators for Modeling Structured Dynamics under Distribution Shifts represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "In this work, we propose MetaKoopman, a Bayesian meta-learning framework for modeling nonlinear dynamics through linear…", "biggest_caveat": "bution shifts is essential for robust decision-making in real-world systems.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2607.26345", "difficulty": "frontier" }, { "id": "arxiv:2607.14093", "source": "arxiv", "source_type": "preprint", "title": "Intelligent Three Level Learning Architecture for Autonomous UAV Swarms in Search and Rescue", "abstract": "This paper presents a novel three level hierarchical learning architecture for autonomous UAV swarms performing search and rescue operations. Unlike conventional approaches that apply a single learning paradigm across all hierarchy levels, the proposed architecture integrates three qualitatively different learning mechanisms corresponding to the biological hierarchy of reflexes, skills, and reasoning such as Hebbian neuroplasticity for individual agent adaptation, multi agent reinforcement learning with graph neural networks and behavior trees for tactical coordination, and model agnostic meta learning with BDI reasoning and a digital twin for strategic decision making. The architecture is formalized through twenty two architectural contracts organized across six components such as BDI, Behavior Trees, GNN, MARL, Neuroplasticity, Meta Learning that collectively provide six classes of formal guarantees such as safety, budget correctness, optimality, liveness, starvation freedom, and inter level consistency. We introduce Swarm Meta Cognition as a compositional property arising from the structured interaction of all three levels, enabling the swarm to monitor its own cognitive state and switch between cognitive strategies. Five constructive progress functions for SAR task types bridge the gap between abstract optimization theory and concrete operational scenarios. The main integration theorem establishes that when all contracts are satisfied, the hybrid neuro-symbolic system preserves all six guarantee classes. For the dynamic case with active learning, five new contracts extend the framework with three additional guarantees such as cognitive resilience, graceful degradation, and monotonic meta improvement. Theoretical analysis demonstrates that the architecture addresses five fundamental limitations of existing hierarchical RL approaches.", "authors": [ "Oleksii Bychkov" ], "year": 2026, "published_date": "2026-04-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.14093", "pdf_url": "https://arxiv.org/pdf/2607.14093", "citations": 0, "topics": [], "tags": [ "Reasoning", "GNNs", "RL", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 5.3, "content_potential_score": 0.0, "interestingness_score": 1.65, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper presents a novel three level hierarchical learning architecture for autonomous UAV swarms performing search and rescue operations. Unlike conventional approaches that apply a single learning paradigm across all hierarchy levels, the proposed architecture integrates three qualitatively different learning mechanisms corresponding to the biological hierarchy of reflexes, skills, and reasoning such as Hebbian neuroplasticity for individual agent adaptation, multi agent reinforcement learning with graph neural networks and behavior trees for tactical coordination, and model agnostic meta learning with BDI reasoning and a digital twin for strategic decision making.", "key_contribution": "This paper presents a novel three level hierarchical learning architecture for autonomous UAV swarms performing search and rescue operations.", "why_it_matters": "Intelligent Three Level Learning Architecture for Autonomous UAV Swarms in Search and Rescue represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "This paper presents a novel three level hierarchical learning architecture for autonomous UAV swarms performing search…", "biggest_caveat": "limitations of existing hierarchical RL approaches.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2607.14093", "difficulty": "frontier" }, { "id": "arxiv:2605.29965", "source": "arxiv", "source_type": "preprint", "title": "Meta-Programming for Linear-time Temporal Answer Set Programming", "abstract": "The development of temporal extensions of Answer Set Programming (ASP) has led to the emergence of non-monotonic linear-time (TEL), dynamic (DEL), and metric (MEL) temporal equilibrium logics. However, the inherent rigidity of highly optimized ASP systems often hinders the rapid exploration and implementation of alternative logical designs. In this work, we propose a flexible meta-programming framework that operationalizes the semantics of varied temporal logics through a unified, declarative framework. Our approach extends standard ASP meta-programming by augmenting clingo's theory grammar with formal type specifications and nesting capabilities. To ensure semantic correctness, we introduce a transformation pipeline that protects nested modalities from stable-model-based simplifications during grounding. We demonstrate the extensibility of our framework by implementing meta-encodings for TEL, MEL, and DEL. We provide a comprehensive account of TEL and highlight the key features for managing the interval constraints of MEL and the Fischer-Ladner closure in DEL. Finally, we introduce the metasp system, a versatile tool that encapsulates this workflow.", "authors": [ "Susana Hahn", "Amade Nems", "Javier Romero", "Torsten Schaub" ], "year": 2026, "published_date": "2026-05-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.29965", "pdf_url": "https://arxiv.org/pdf/2605.29965", "citations": 0, "topics": [], "tags": [ "Hallucination", "Info Extraction", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 5.49, "content_potential_score": 0.0, "interestingness_score": 1.65, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The development of temporal extensions of Answer Set Programming (ASP) has led to the emergence of non-monotonic linear-time (TEL), dynamic (DEL), and metric (MEL) temporal equilibrium logics. However, the inherent rigidity of highly optimized ASP systems often hinders the rapid exploration and implementation of alternative logical designs.", "key_contribution": "In this work, we propose a flexible meta-programming framework that operationalizes the semantics of varied temporal logics through a unified, declarative framework.", "why_it_matters": "Meta-Programming for Linear-time Temporal Answer Set Programming represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "In this work, we propose a flexible meta-programming framework that operationalizes the semantics of varied temporal…", "biggest_caveat": "However, the inherent rigidity of highly optimized ASP systems often hinders the rapid exploration and implementation of alternative logical designs.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2605.29965", "difficulty": "intermediate" }, { "id": "arxiv:2604.20824v1", "source": "arxiv", "source_type": "preprint", "title": "Closing the Domain Gap in Biomedical Imaging by In-Context Control Samples", "abstract": "The central problem in biomedical imaging are batch effects: systematic technical variations unrelated to the biological signal of interest. These batch effects critically undermine experimental reproducibility and are the primary cause of failure of deep learning systems on new experimental batches, preventing their practical use in the real world. Despite years of research, no method has succeeded in closing this performance gap for deep learning models. We propose Control-Stabilized Adaptive Risk Minimization via Batch Normalization (CS-ARM-BN), a meta-learning adaptation method that exploits negative control samples. Such unperturbed reference images are present in every experimental batch by design and serve as stable context for adaptation. We validate our novel method on Mechanism-of-Action (MoA) classification, a crucial task for drug discovery, on the large-scale JUMP-CP dataset. The accuracy of standard ResNets drops from 0.939 $\\pm$ 0.005, on the training domain, to 0.862 $\\pm$ 0.060 on data from new experimental batches. Foundation models, even after Typical Variation Normalization, fail to close this gap. We are the first to show that meta-learning approaches close the domain gap by achieving 0.935 $\\pm$ 0.018. If the new experimental batches exhibit strong domain shifts, such as being generated in a different lab, meta-learning approaches can be stabilized with control samples, which are always available in biomedical experiments. Our work shows that batch effects in bioimaging data can be effectively neutralized through principled in-context adaptation, which also makes them practically usable and efficient.", "authors": [ "Ana Sanchez-Fernandez", "Thomas Pinetz", "Werner Zellinger", "Günter Klambauer" ], "year": 2026, "published_date": "2026-04-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.20824v1", "pdf_url": "https://arxiv.org/pdf/2604.20824v1", "citations": 0, "topics": [], "tags": [ "Biomedical AI", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 5.2, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The central problem in biomedical imaging are batch effects: systematic technical variations unrelated to the biological signal of interest. These batch effects critically undermine experimental reproducibility and are the primary cause of failure of deep learning systems on new experimental batches, preventing their practical use in the real world.", "key_contribution": "We propose Control-Stabilized Adaptive Risk Minimization via Batch Normalization (CS-ARM-BN), a meta-learning adaptation method that exploits negative control samples.", "why_it_matters": "Closing the Domain Gap in Biomedical Imaging by In-Context Control Samples represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Biomedical AI.", "one_line_takeaway": "We propose Control-Stabilized Adaptive Risk Minimization via Batch Normalization (CS-ARM-BN), a meta-learning…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Biomedical AI.", "url": "http://arxiv.org/abs/2604.20824v1", "difficulty": "intermediate" }, { "id": "arxiv:2606.16890", "source": "arxiv", "source_type": "preprint", "title": "Compositional Reasoning Depth Predicts Clinical AI Failure: Empirical Evidence Consistent with Transformer Compositionality Limits in Electronic Health Record Question Answering", "abstract": "Aggregate accuracy benchmarks conceal a systematic structure in how large language models fail at electronic health record (EHR) question answering: questions requiring more inferential steps produce disproportionately more errors. Motivated by theoretical results on transformer compositionality limits, we introduce a pre-specified hop-count taxonomy -- the number of distinct reasoning steps required to answer a clinical question from an EHR -- as a principled predictor of model failure. We annotate 313 clinician-generated MedAlign EHR question-answer pairs across four hop levels and evaluate 301 questions in a within-model ablation (claude-sonnet-4-6, zero-shot vs. extended thinking) and cross-architecture replications (gpt-4o and gpt-5.4-2026-03-05, zero-shot). All three models, spanning two providers and two OpenAI generations (GPT-4 and GPT-5), show monotone accuracy decline with hop count: Claude Sonnet zero-shot falls from 30.6% (hop=1) to 17.6% (hop=4) (Cochran-Armitage z=-2.30, p=0.011; OR per hop 0.72, 95% CI [0.56,0.92], p=0.008); GPT-4o replicates this (37.8% to 14.7%; OR 0.58 [0.45,0.75], p<0.001); and gpt-5.4-2026-03-05 confirms it (37.8% to 23.5%; OR 0.80 [0.66,0.98], p=0.027). A pre-specified context-sufficiency audit shows higher-hop questions are not differentially disadvantaged by EHR truncation (answerability 93-95% at hops 2-4 vs. 79% at hop=1), so the decline reflects compositional reasoning difficulty. Extended thinking did not significantly flatten the accuracy-depth curve across three reasoning conditions, and thinking-token usage scaled with hop count (r=0.31, p<0.0001), consistent with the predicted O(k) computational requirement. Hop count is thus a theory-motivated, cross-architecture predictor of large-language-model error on EHR question answering, with direct implications for deployment risk stratification of clinical AI.", "authors": [ "Sanjay Basu" ], "year": 2026, "published_date": "2026-06-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.16890", "pdf_url": "https://arxiv.org/pdf/2606.16890", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "QA", "Biomedical AI", "Evaluation" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 7.33, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Aggregate accuracy benchmarks conceal a systematic structure in how large language models fail at electronic health record (EHR) question answering: questions requiring more inferential steps produce disproportionately more errors. Motivated by theoretical results on transformer compositionality limits, we introduce a pre-specified hop-count taxonomy -- the number of distinct reasoning steps required to answer a clinical question from an EHR -- as a principled predictor of model failure.", "key_contribution": "Motivated by theoretical results on transformer compositionality limits, we introduce a pre-specified hop-count taxonomy -- the number of distinct reasoning steps required to answer a clinical question from an EHR -- as a principled predictor of model failure.", "why_it_matters": "Compositional Reasoning Depth Predicts Clinical AI Failure: Empirical Evidence Consistent with Transformer Compositionality Limits in Electronic Health Record Question Answering represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Motivated by theoretical results on transformer compositionality limits, we introduce a pre-specified hop-count…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.16890", "difficulty": "beginner" }, { "id": "arxiv:2606.09189v1", "source": "arxiv", "source_type": "preprint", "title": "Pretrained, Frozen, Still Leaking: Auditing Cross-Encoder Attribute Transfer in EEG Foundation Models", "abstract": "EEG foundation-model releases are usually audited one endpoint at a time: raw-reconstruction, membership inference, identity linkage, or DP-SGD on the downstream head. We audit the same released embeddings under all four endpoints jointly, on BIOT, LaBraM, and EEGPT, and show that each single-endpoint audit clears releases that still leak spectral attributes. The decisive evidence is a cross-encoder transfer audit: a single ridge attribute decoder learned from one frozen encoder transfers, via a fitted linear bridge, to held-out-subject test splits of every other encoder, with subject-disjoint matched-control 95% CI lower bound at least 0.081 across all six BIOT/LaBraM/EEGPT directions. We prove a sufficient condition: two encoders sharing a nontrivial attribute-coordinate projector overlap beta admit a chained ridge bridge attacker with centered-gain lower bound sqrt(beta/(1+tau^2)) - eps_br - rho_0, and back-solve beta in [0.008, 0.198]. To turn the joint audit into a deployment-readable decision rule we introduce an audit-endpoint disagreement score (AEDS), prove sufficient conditions for its positivity, and bootstrap-calibrate it per cell; AEDS is positive in all eight matched-CI cells (BIOT/LaBraM/EEGPT on EEGMMI; LaBraM on Sleep-EDF, 54-channel LIMO, CHB-MIT pediatric scalp EEG) with p<0.001, while a head-level Carlini LiRA membership audit reaches AUC only 0.50-0.70. Standard defenses fail under audit: a Wiener-style noise-aware adaptive attacker, the LiRA audit, and DP-SGD at every utility-preserving epsilon in {4,8} leave the attribute channel essentially unchanged. The contribution is an audit framework that turns scattered single-endpoint defenses into a joint release decision, supported by a cross-encoder bridge theorem and adaptive-attacker, LiRA, and DP-SGD baselines; the audit licenses release-blocking, not raw-waveform exfiltration or held-out-subject identity recovery.", "authors": [ "Jianwei Tai" ], "year": 2026, "published_date": "2026-06-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.09189v1", "pdf_url": "https://arxiv.org/pdf/2606.09189v1", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Knowledge Graphs", "Artificial Intelligence", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 3.62, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "EEG foundation-model releases are usually audited one endpoint at a time: raw-reconstruction, membership inference, identity linkage, or DP-SGD on the downstream head. We audit the same released embeddings under all four endpoints jointly, on BIOT, LaBraM, and EEGPT, and show that each single-endpoint audit clears releases that still leak spectral attributes.", "key_contribution": "We audit the same released embeddings under all four endpoints jointly, on BIOT, LaBraM, and EEGPT, and show that each single-endpoint audit clears releases that still leak spectral attributes.", "why_it_matters": "Pretrained, Frozen, Still Leaking: Auditing Cross-Encoder Attribute Transfer in EEG Foundation Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We audit the same released embeddings under all four endpoints jointly, on BIOT, LaBraM, and EEGPT, and show that each…", "biggest_caveat": "bute channel essentially unchanged.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Info Extraction.", "url": "http://arxiv.org/abs/2606.09189v1", "difficulty": "frontier" }, { "id": "arxiv:2601.09236", "source": "arxiv", "source_type": "preprint", "title": "Reward Learning through Ranking Mean Squared Error", "abstract": "Reward design remains a significant bottleneck in applying reinforcement learning (RL) to real-world problems. A popular alternative is reward learning, where reward functions are inferred from human feedback rather than manually specified. Recent work has proposed learning reward functions from human ratings rather than traditional binary preferences, enabling richer and potentially less cognitively demanding supervision. Building on this paradigm, we introduce a new rating-based RL method, Ranked Return Regression for RL (R4). At its core, R4 uses a novel ranking mean squared error loss that learns from a dataset of trajectory-rating pairs, treating the human-provided discrete ratings (e.g., bad, neutral, good) as ordinal targets. Unlike prior rating-based approaches, R4 offers formal guarantees: its solution set is provably minimal and complete under mild assumptions. Empirically, using both human-provided and simulated ratings, we demonstrate that R4 consistently matches or outperforms existing rating and preference-based RL methods on robotic benchmarks from OpenAI Gym and the DeepMind Control Suite. Code released at https://github.com/IRLL/R4.", "authors": [ "Chaitanya Kharyal", "Calarina Muslimani", "Matthew E. Taylor" ], "year": 2026, "published_date": "2026-06-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.09236", "pdf_url": "https://arxiv.org/pdf/2601.09236", "citations": 0, "topics": [], "tags": [ "RL", "Robotics", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 6.09, "content_potential_score": 1.5, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reward design remains a significant bottleneck in applying reinforcement learning (RL) to real-world problems. A popular alternative is reward learning, where reward functions are inferred from human feedback rather than manually specified.", "key_contribution": "Building on this paradigm, we introduce a new rating-based RL method, Ranked Return Regression for RL (R4).", "why_it_matters": "Reward Learning through Ranking Mean Squared Error represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "Building on this paradigm, we introduce a new rating-based RL method, Ranked Return Regression for RL (R4).", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2601.09236", "difficulty": "beginner" }, { "id": "arxiv:2512.19347", "source": "arxiv", "source_type": "preprint", "title": "OMP: One-step Meanflow Policy with Directional Alignment", "abstract": "Robot manipulation has increasingly adopted data-driven generative policy frameworks, yet the field faces a persistent trade-off: diffusion models suffer from high inference latency, while flow-based methods often require complex architectural constraints. Although in image generation domain, the MeanFlow paradigm offers a path to single-step inference, its direct application to robotics is impeded by critical theoretical pathologies, specifically spectral bias and gradient starvation in low-velocity regimes. To overcome these limitations, we propose the One-step MeanFlow Policy (OMP), a novel framework designed for high-fidelity, real-time manipulation. We introduce a lightweight directional alignment mechanism to explicitly synchronize predicted velocities with true mean velocities. Furthermore, we implement a Differential Derivation Equation (DDE) to approximate the Jacobian-Vector Product (JVP) operator, which decouples forward and backward passes to significantly reduce memory complexity. Extensive experiments on the Adroit and Meta-World benchmarks demonstrate that OMP outperforms state-of-the-art methods in success rate and trajectory accuracy, particularly in high-precision tasks, while retaining the efficiency of single-step generation.", "authors": [ "Han Fang", "Yize Huang", "Yuheng Zhao", "Paul Weng", "Xiao Li", "Yutong Ban" ], "year": 2026, "published_date": "2026-06-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2512.19347", "pdf_url": "https://arxiv.org/pdf/2512.19347", "citations": 0, "topics": [], "tags": [ "AI Safety", "Text-to-Image", "Robotics", "Fairness & Ethics", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 5.58, "content_potential_score": 0.84, "interestingness_score": 2.06, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Robot manipulation has increasingly adopted data-driven generative policy frameworks, yet the field faces a persistent trade-off: diffusion models suffer from high inference latency, while flow-based methods often require complex architectural constraints. Although in image generation domain, the MeanFlow paradigm offers a path to single-step inference, its direct application to robotics is impeded by critical theoretical pathologies, specifically spectral bias and gradient starvation in low-velocity regimes.", "key_contribution": "To overcome these limitations, we propose the One-step MeanFlow Policy (OMP), a novel framework designed for high-fidelity, real-time manipulation.", "why_it_matters": "OMP: One-step Meanflow Policy with Directional Alignment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "To overcome these limitations, we propose the One-step MeanFlow Policy (OMP), a novel framework designed for…", "biggest_caveat": "limitations, we propose the One-step MeanFlow Policy (OMP), a novel framework designed for high-fidelity, real-time manipulation.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2512.19347", "difficulty": "beginner" }, { "id": "arxiv:2605.16191", "source": "arxiv", "source_type": "preprint", "title": "Optimized Three-Dimensional Photovoltaic Structures with LLM guided Tree Search", "abstract": "We present a case study for how AI coding systems can be used to generate novel scientific hypotheses. We combine a generic coding agent (Google's AntiGravity) with an LLM-driven tree search algorithm (Empirical Research Assistance / ERA) to autonomously generate high-efficiency three-dimensional photovoltaic (3DPV) structures that overcome losses limiting flat solar panels at mid-latitudes. These structures operate by presenting favorable angles to the sun throughout the day, and for illustrative purposes we focus on optimizing performance for a single solar day. Our workflow begins by using AntiGravity to reproduce calculations \\cite{bernardi2012solar} showing that 3DPV can have energy densities much higher than stationary flat PV panels. We use these initial designs as the starting point for large scale tree search, where we seek improved solutions and score them for their diurnal yield. The initial tree search leads to nominally more efficient solutions, yet they are caused by algorithmic reward hacking, arising from non-physical design features such as structurally levitating disconnected tiers and exploitations of the discretizations in the optics solver. To counteract this, we develop a workflow where the coding agent iteratively patches the physics engine with constraints to eliminate reward hacking. With reward-hacking eliminated, ERA discovers a series of designs with various constraints and improved performance, including optimal designs with different fixed collector areas, optimizing zenith tracking and avoiding self shadowing. Combining coding agents with tree search (ERA) provides a powerful platform for scientific discovery, for problems whose solutions can be empirically evaluated with a score function.", "authors": [ "Michael P. Brenner", "Lizzie Dorfman", "John C. Platt" ], "year": 2026, "published_date": "2026-05-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.16191", "pdf_url": "https://arxiv.org/pdf/2605.16191", "citations": 0, "topics": [], "tags": [ "LLMs", "NLP" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.15, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present a case study for how AI coding systems can be used to generate novel scientific hypotheses. We combine a generic coding agent (Google's AntiGravity) with an LLM-driven tree search algorithm (Empirical Research Assistance / ERA) to autonomously generate high-efficiency three-dimensional photovoltaic (3DPV) structures that overcome losses limiting flat solar panels at mid-latitudes.", "key_contribution": "We present a case study for how AI coding systems can be used to generate novel scientific hypotheses.", "why_it_matters": "Optimized Three-Dimensional Photovoltaic Structures with LLM guided Tree Search represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a case study for how AI coding systems can be used to generate novel scientific hypotheses.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.16191", "difficulty": "intermediate" }, { "id": "arxiv:2510.22628", "source": "arxiv", "source_type": "preprint", "title": "Sentra-Guard: A Real-Time Multilingual Defense Against Adversarial LLM Prompts", "abstract": "This paper presents a real-time modular defense system named Sentra-Guard. The system detects and mitigates jailbreak and prompt injection attacks targeting large language models (LLMs). The framework uses a hybrid architecture with FAISS-indexed SBERT embedding representations that capture the semantic meaning of prompts, combined with fine-tuned transformer classifiers, which are machine learning models specialized for distinguishing between benign and adversarial language inputs. It identifies adversarial prompts in both direct and obfuscated attack vectors. A core innovation is the classifier-retriever fusion module, which dynamically computes context-aware risk scores that estimate how likely a prompt is to be adversarial based on its content and context. The framework ensures multilingual resilience with a language-agnostic preprocessing layer. This component automatically translates non-English prompts into English for semantic evaluation, enabling consistent detection across over 100 languages. The system includes a HITL feedback loop, where decisions made by the automated system are reviewed by human experts for continual learning and rapid adaptation under adversarial pressure. Sentra-Guard maintains an evolving dual-labeled knowledge base of benign and malicious prompts, enhancing detection reliability and reducing false positives. Evaluation results show a 99.96% detection rate (AUC = 1.00, F1 = 1.00) and an attack success rate (ASR) of only 0.004%. This outperforms leading baselines such as LlamaGuard-2 (1.3%) and OpenAI Moderation (3.7%). Unlike black-box approaches, Sentra-Guard is transparent, fine-tunable, and compatible with diverse LLM backends. Its modular design supports scalable deployment in both commercial and open-source environments. The system establishes a new state-of-the-art in adversarial LLM defense.", "authors": [ "Md. Mehedi Hasan", "Sk Tanzir Mehedi", "Ziaur Rahman", "Rafid Mostafiz", "Md. Abir Hossain" ], "year": 2026, "published_date": "2026-05-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.22628", "pdf_url": "https://arxiv.org/pdf/2510.22628", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "AI Safety", "Continual Learning", "ASR" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, Continual Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 4.62, "content_potential_score": 1.55, "interestingness_score": 2.42, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper presents a real-time modular defense system named Sentra-Guard. The system detects and mitigates jailbreak and prompt injection attacks targeting large language models (LLMs).", "key_contribution": "Evaluation results show a 99.96% detection rate (AUC = 1.00, F1 = 1.00) and an attack success rate (ASR) of only 0.004%.", "why_it_matters": "Sentra-Guard: A Real-Time Multilingual Defense Against Adversarial LLM Prompts represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Evaluation results show a 99.96% detection rate (AUC = 1.00, F1 = 1.00) and an attack success rate (ASR) of only 0.004%.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2510.22628", "difficulty": "advanced" }, { "id": "arxiv:2605.16844", "source": "arxiv", "source_type": "preprint", "title": "Artificial Adaptive Intelligence: The Missing Stage Between Narrow and General Intelligence", "abstract": "Between the narrow systems we deploy and the general intelligence we speculate about lies an entire regime of machine behavior that has never received its own name. This monograph argues that this regime is not empty: it is where meta-learning, neural architecture search, AutoML, continual learning, evolutionary computation, and physics-informed modeling have quietly converged on a common principle, namely the steady removal of the human from the loop of parameter specification. We name this regime Artificial Adaptive Intelligence (AAI) and define it operationally: a system exhibits AAI to the extent that it requires no human-specified tunable hyperparameters while maintaining competitive performance across a diverse distribution of tasks. To make the definition quantitative, we introduce an adaptivity index that measures progress along an axis orthogonal to scale, combining the fraction of hyperparameters absorbed by the system with the performance ratio against a task-specialized baseline. We develop the principle of parametric minimality and ground it in the minimum description length framework, showing that the appropriate hyperparameter count is data-determined rather than designer-determined. We then organize the field around three pathways to minimality: data- and task-aware configuration, structural and evolutionary morphing, and in-training self-adaptation. We analyze their stability, convergence, and governance implications, and illustrate them through case studies spanning aerospace design, financial regime detection, turbulence modeling, ecological dynamics, and vision-language systems. The thesis is that the path from ANI to AGI passes through AAI, and that naming this stage changes what we measure, what we build, and what we call a success.", "authors": [ "Boris Kriuk" ], "year": 2026, "published_date": "2026-05-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.16844", "pdf_url": "https://arxiv.org/pdf/2605.16844", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Continual Learning", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses neural architecture search and related concepts.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 3.62, "content_potential_score": 1.42, "interestingness_score": 2.35, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Between the narrow systems we deploy and the general intelligence we speculate about lies an entire regime of machine behavior that has never received its own name. This monograph argues that this regime is not empty: it is where meta-learning, neural architecture search, AutoML, continual learning, evolutionary computation, and physics-informed modeling have quietly converged on a common principle, namely the steady removal of the human from the loop of parameter specification.", "key_contribution": "To make the definition quantitative, we introduce an adaptivity index that measures progress along an axis orthogonal to scale, combining the fraction of hyperparameters absorbed by the system with the performance ratio against a task-specialized baseline.", "why_it_matters": "Artificial Adaptive Intelligence: The Missing Stage Between Narrow and General Intelligence represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "To make the definition quantitative, we introduce an adaptivity index that measures progress along an axis orthogonal…", "biggest_caveat": "bution of tasks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2605.16844", "difficulty": "frontier" }, { "id": "arxiv:2605.14839", "source": "arxiv", "source_type": "preprint", "title": "GenAI for Energy-Efficient and Interference-Aware Compressed Sensing of GNSS Signals on a Google Edge TPU", "abstract": "Traditional methods for classifying global navigation satellite system (GNSS) jamming signals typically involve post-processing raw or spectral data streams, requiring complex and costly data transmission to cloud-based interference classification systems. In contrast, our proposed approach efficiently compresses GNSS data streams directly at the hardware receiver while simultaneously classifying jamming and spoofing attacks in real time. Given the growing prevalence of GNSS jamming, there is a critical need for real-time solutions suitable for power-constrained environments. This paper introduces a novel method for compressing and classifying GNSS jamming threats using generative artificial intelligence (GenAI), specifically variational autoencoders (VAEs), deployed on Google Edge tensor processing units (TPUs). The study evaluates various autoencoder (AE) architectures to compress and reconstruct GNSS signals, focusing on preserving interference characteristics while minimizing data size near the receiver hardware. The pipeline adapts large-scale AE models for Google Edge TPUs through 8-bit quantization to ensure energy-efficient deployment. Tests on raw in-phase and quadrature-phase (IQ) data, Fast Fourier Transform (FFT) data, and handcrafted features show the system achieves significant compression (>42x) and accurate classification of approximately 72 interference types on reconstructed signals (F2-score 0.915), closely matching the original signals (F2-score 0.923). The hardware-centric GenAI approach also substantially reduces jammer signal transmission costs, offering a practical solution for interference mitigation. Ablation studies on conditional and factorized VAEs (i.e., FactorVAE) explore latent feature disentanglement for data generation, enhancing model interpretability and fostering trust in machine learning (ML) solutions for sensitive interference applications.", "authors": [ "Thorben Wegner", "Lucas Heublein", "Tobias Feigl", "Felix Ott", "Christopher Mutschler", "Alexander Rügamer" ], "year": 2026, "published_date": "2026-05-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.14839", "pdf_url": "https://arxiv.org/pdf/2605.14839", "citations": 0, "topics": [], "tags": [ "Model Compression", "Interpretability", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 4.72, "content_potential_score": 1.84, "interestingness_score": 2.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Traditional methods for classifying global navigation satellite system (GNSS) jamming signals typically involve post-processing raw or spectral data streams, requiring complex and costly data transmission to cloud-based interference classification systems. In contrast, our proposed approach efficiently compresses GNSS data streams directly at the hardware receiver while simultaneously classifying jamming and spoofing attacks in real time.", "key_contribution": "This paper introduces a novel method for compressing and classifying GNSS jamming threats using generative artificial intelligence (GenAI), specifically variational autoencoders (VAEs), deployed on Google Edge tensor processing units (TPUs).", "why_it_matters": "GenAI for Energy-Efficient and Interference-Aware Compressed Sensing of GNSS Signals on a Google Edge TPU represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Model Compression.", "one_line_takeaway": "This paper introduces a novel method for compressing and classifying GNSS jamming threats using generative artificial…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Model Compression.", "url": "https://arxiv.org/abs/2605.14839", "difficulty": "intermediate" }, { "id": "arxiv:2604.27358", "source": "arxiv", "source_type": "preprint", "title": "Safe Bilevel Delegation (SBD): A Formal Framework for Runtime Delegation Safety in Multi-Agent Systems", "abstract": "As large language model (LLM) agents are deployed in high-stakes environments, the question of how safely to delegate subtasks to specialized sub-agents becomes critical. Existing work addresses multi-agent architecture selection at design time or provides broad empirical guidelines, but neither provides a runtime mechanism that dynamically adjusts the safety-efficiency trade-off as task context changes during execution. We propose Safe Bilevel Delegation (SBD), a formal framework for runtime delegation safety in hierarchical multi-agent systems. SBD formulates task delegation as a bilevel optimization problem: an outer meta-weight network phi learns context-dependent safety-efficiency weights lambda(s) in [0,1]; an inner loop optimizes the delegation policy pi subject to a probabilistic safety constraint P(safe) >= 1-delta. The continuous delegation degree alpha in [0, 1] controls how much decision authority is transferred to each sub-agent, interpolating smoothly between full human override (alpha=0) and fully autonomous execution (alpha=1). We establish three theoretical results: (1) Safety Monotonicity--higher outer safety weight produces a weakly safer inner policy; (2) Inner Policy Convergence--projected gradient descent on the inner problem converges linearly under standard smoothness assumptions; (3) an Accountability Propagation bound that distributes responsibility across multi-hop delegation chains with a provable per-agent ceiling. We instantiate SBD in three high-stakes domains--medical AI (MIMIC-III), financial risk control (S and P 500), and educational agent supervision (ASSISTments)--specifying datasets, safety constraint sets, baselines, and evaluation protocols. This manuscript presents the formal framework and theoretical results in full; empirical validation following the protocols described herein is planned and will be reported in a forthcoming revision.", "authors": [ "Yuan Sun" ], "year": 2026, "published_date": "2026-04-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.27358", "pdf_url": "https://arxiv.org/pdf/2604.27358", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses gradient descent — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.29, "read_first_score": 4.12, "content_potential_score": 1.84, "interestingness_score": 2.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "As large language model (LLM) agents are deployed in high-stakes environments, the question of how safely to delegate subtasks to specialized sub-agents becomes critical. Existing work addresses multi-agent architecture selection at design time or provides broad empirical guidelines, but neither provides a runtime mechanism that dynamically adjusts the safety-efficiency trade-off as task context changes during execution.", "key_contribution": "We propose Safe Bilevel Delegation (SBD), a formal framework for runtime delegation safety in hierarchical multi-agent systems.", "why_it_matters": "Safe Bilevel Delegation (SBD): A Formal Framework for Runtime Delegation Safety in Multi-Agent Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose Safe Bilevel Delegation (SBD), a formal framework for runtime delegation safety in hierarchical multi-agent…", "biggest_caveat": "but neither provides a runtime mechanism that dynamically adjusts the safety-efficiency trade-off as task context changes during execution.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2604.27358", "difficulty": "advanced" }, { "id": "arxiv:2606.18555", "source": "arxiv", "source_type": "preprint", "title": "Rethinking Text-to-Image as Semantic-Aware Data Augmentation for Indoor Scene Recognition", "abstract": "In the realm of computer vision, indoor image recognition presents challenges due to the intricate interplay of lighting conditions, occlusions, and diverse object arrangements within confined spaces. To address the lacks of training indoor images, we introduce a novel approach leveraging Stable Diffusion (SD) for the generation of synthetic images, which serve as a powerful data augmentation tool. The utilization of SD offers a principled framework for synthesizing diverse and realistic indoor scenes, thereby enriching the training data pool for robust indoor image recognition models. Experimental findings on the MIT Indoor Scene dataset reveal the potential of our proposed approach in enhancing the training of deep models when authentic data is limited. Furthermore, to prevent the misuse of SD synthetic images, we introduce a counter measure based on DIffusion Reconstruction Error (DIRE). The powerful DIRE presentation enables training robust classifiers only using lightweight deep models. Experiments show that our approach can perfectly recognize SD generated images with the accuracy of 100% using MobilenetV3.", "authors": [ "Trong-Vu Hoang", "Quang-Binh Nguyen", "Dinh-Khoi Vo", "Hoai-Danh Vo", "Minh-Triet Tran", "Trung-Nghia Le" ], "year": 2026, "published_date": "2026-06-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.18555", "pdf_url": "https://arxiv.org/pdf/2606.18555", "citations": 0, "topics": [], "tags": [ "Text-to-Image", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.28, "read_first_score": 5.89, "content_potential_score": 1.5, "interestingness_score": 2.39, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In the realm of computer vision, indoor image recognition presents challenges due to the intricate interplay of lighting conditions, occlusions, and diverse object arrangements within confined spaces. To address the lacks of training indoor images, we introduce a novel approach leveraging Stable Diffusion (SD) for the generation of synthetic images, which serve as a powerful data augmentation tool.", "key_contribution": "To address the lacks of training indoor images, we introduce a novel approach leveraging Stable Diffusion (SD) for the generation of synthetic images, which serve as a powerful data augmentation tool.", "why_it_matters": "Rethinking Text-to-Image as Semantic-Aware Data Augmentation for Indoor Scene Recognition advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Text-to-Image.", "one_line_takeaway": "To address the lacks of training indoor images, we introduce a novel approach leveraging Stable Diffusion (SD) for the…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Text-to-Image.", "url": "https://arxiv.org/abs/2606.18555", "difficulty": "intermediate" }, { "id": "arxiv:2606.06285", "source": "arxiv", "source_type": "preprint", "title": "TRACE: A Temporal Conditional Estimation for Multimodal Time Series Foundation Models", "abstract": "Time series foundation models (TS-FMs) aim to learn generalizable temporal representations that can be adapted to a wide range of downstream tasks. In real-world multimodal settings, time series are frequently affected by temporal misalignment and partial modality missingness, where different modalities are observed at heterogeneous time scales or are partially absent. Existing approaches typically rely on naive imputation or masking strategies, which fail to account for cross-modal dependencies and often lead to misaligned or degraded representations. We propose TRACE, a conditional estimation paradigm for multimodal time series foundation model pipelines under missingness and irregular sampling, allowing incomplete target modalities to be systematically inferred from available auxiliary modalities. We evaluate TRACE on diverse multimodal benchmarks spanning healthcare and affective computing, including the MIMIC-IV clinical dataset and the CMU-MOSI and CMU-MOSEI benchmarks for multimodal sentiment analysis. Across a range of downstream prediction tasks and missing-modality settings, TRACE consistently outperforms prior multimodal fusion approaches, demonstrating improved robustness to severe modality missingness and more reliable cross-modal representations.", "authors": [ "Ziwen Kan", "Yishuo Chen", "Kecheng Li", "Andrew Wen", "Xiaomeng Wang", "Liwei Wang", "Jihao Duan", "Song Wang", "Hongfang Liu", "Tianlong Chen" ], "year": 2026, "published_date": "2026-06-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.06285", "pdf_url": "https://arxiv.org/pdf/2606.06285", "citations": 0, "topics": [], "tags": [ "AI Safety", "Multimodal", "Sentiment Analysis", "Biomedical AI", "Adversarial" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Sentiment Analysis) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.28, "read_first_score": 5.44, "content_potential_score": 1.5, "interestingness_score": 2.39, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Time series foundation models (TS-FMs) aim to learn generalizable temporal representations that can be adapted to a wide range of downstream tasks. In real-world multimodal settings, time series are frequently affected by temporal misalignment and partial modality missingness, where different modalities are observed at heterogeneous time scales or are partially absent.", "key_contribution": "We propose TRACE, a conditional estimation paradigm for multimodal time series foundation model pipelines under missingness and irregular sampling, allowing incomplete target modalities to be systematically inferred from available auxiliary modalities.", "why_it_matters": "TRACE: A Temporal Conditional Estimation for Multimodal Time Series Foundation Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We propose TRACE, a conditional estimation paradigm for multimodal time series foundation model pipelines under…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2606.06285", "difficulty": "beginner" }, { "id": "arxiv:2603.12677", "source": "arxiv", "source_type": "preprint", "title": "MetaKE: Meta-Learning for Knowledge Editing Toward a Better Accuracy-Editability Trade-off", "abstract": "Existing locate-then-edit Knowledge Editing (KE) methods typically decompose editing into two stages: upstream target representation optimization and downstream constrained parameter optimization. The optimization across the two stages is disconnected: upstream applies uniform regularization without observing downstream realization of the planned residual, hindering a refined accuracy-editability trade-off. Since this realization is request-specific and depends on downstream constraints, uniform regularization can over-shrink high-association requests, causing insufficient editing, while it can under-regularize low-association requests, producing over-large planned residuals that reduce downstream editability. To bridge this disconnect, we propose MetaKE (Meta-learning for Knowledge Editing), a new framework that unifies upstream and downstream stages into a bi-level optimization problem. The inner level optimizes parameter updates for the target representation, while the outer level optimizes representation using feedback from downstream constraints, achieving a better semantic accuracy-editability trade-off. To avoid costly multi-layer backpropagation, we introduce a Structural Gradient Proxy to approximate and propagate this feedback. Extensive experiments show that MetaKE outperforms strong baselines, offering a new perspective on KE.", "authors": [ "Shuxin Liu", "Di Gao", "Ou Wu" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.12677", "pdf_url": "https://arxiv.org/pdf/2603.12677", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Artificial Intelligence", "NLP" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses backpropagation — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.28, "read_first_score": 4.91, "content_potential_score": 0.0, "interestingness_score": 1.64, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Existing locate-then-edit Knowledge Editing (KE) methods typically decompose editing into two stages: upstream target representation optimization and downstream constrained parameter optimization. The optimization across the two stages is disconnected: upstream applies uniform regularization without observing downstream realization of the planned residual, hindering a refined accuracy-editability trade-off.", "key_contribution": "To bridge this disconnect, we propose MetaKE (Meta-learning for Knowledge Editing), a new framework that unifies upstream and downstream stages into a bi-level optimization problem.", "why_it_matters": "MetaKE: Meta-Learning for Knowledge Editing Toward a Better Accuracy-Editability Trade-off represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "To bridge this disconnect, we propose MetaKE (Meta-learning for Knowledge Editing), a new framework that unifies…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2603.12677", "difficulty": "advanced" }, { "id": "arxiv:2604.12737v1", "source": "arxiv", "source_type": "preprint", "title": "Evaluating Differential Privacy Against Membership Inference in Federated Learning: Insights from the NIST Genomics Red Team Challenge", "abstract": "While Federated Learning (FL) mitigates direct data exposure, the resulting trained models remain susceptible to membership inference attacks (MIAs). This paper presents an empirical evaluation of Differential Privacy (DP) as a defense mechanism against MIAs in FL, leveraging the environment of the 2025 NIST Genomics Privacy-Preserving Federated Learning (PPFL) Red Teaming Event. To improve inference accuracy, we propose a stacking attack strategy that ensembles seven black-box estimators to train a meta-classifier on prediction probabilities and cross-entropy losses. We evaluate this methodology against target models under three privacy configurations: an unprotected convolutional neural network (CNN, $ε=\\infty$), a low-privacy DP model ($ε=200$), and a high-privacy DP model ($ε=10$). The attack outperforms all baselines in the No DP and Low Privacy settings and, critically, maintains measurable membership leakage at $ε=200$ where a single-signal LiRA baseline collapses. Evaluated on an independent third-party benchmark, these results provide an empirical characterisation of how stacking-based inference degrades across calibrated DP tiers in FL.", "authors": [ "Gustavo de Carvalho Bertoli" ], "year": 2026, "published_date": "2026-04-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.12737v1", "pdf_url": "https://arxiv.org/pdf/2604.12737v1", "citations": 0, "topics": [], "tags": [ "AI Safety", "Federated Learning", "Biomedical AI", "Evaluation", "Benchmarking & Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.28, "read_first_score": 4.88, "content_potential_score": 1.5, "interestingness_score": 2.39, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "While Federated Learning (FL) mitigates direct data exposure, the resulting trained models remain susceptible to membership inference attacks (MIAs). This paper presents an empirical evaluation of Differential Privacy (DP) as a defense mechanism against MIAs in FL, leveraging the environment of the 2025 NIST Genomics Privacy-Preserving Federated Learning (PPFL) Red Teaming Event.", "key_contribution": "To improve inference accuracy, we propose a stacking attack strategy that ensembles seven black-box estimators to train a meta-classifier on prediction probabilities and cross-entropy losses.", "why_it_matters": "Evaluating Differential Privacy Against Membership Inference in Federated Learning: Insights from the NIST Genomics Red Team Challenge represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "To improve inference accuracy, we propose a stacking attack strategy that ensembles seven black-box estimators to train…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "http://arxiv.org/abs/2604.12737v1", "difficulty": "advanced" }, { "id": "arxiv:2609.16629", "source": "arxiv", "source_type": "preprint", "title": "Learning to Optimize UAV Path Planning for Data Sensing in Wireless Sensor Networks", "abstract": "UAVs have emerged as highly flexible platforms for data sensing in Wireless Sensor Networks (WSNs). Path planning for UAVs in such tasks plays a key role to assure remote sensing effectiveness and friendly energy consumption. However, existing approaches show two key limitations: i) they are primarily hand-crafted with certain design biases that harm adaptation on unseen tasks. ii) they predominantly assume idealized spatial complexities of actual environments through simplified simulation, causing them to underperform during real-world deployment. In this paper, we propose a novel learning-assisted planning framework, termed Landscape-Aware Meta Differential Evolution (LAMDE), to tackle the mentioned limitations. The major contributions come from the following aspects. We first re-formulate such UAV path planning problem to embrace challenging constraints. To efficiently navigate this highly constrained space, we propose a bi-level learning to optimize approach, where the meta-level is a trainable algorithm configuration policy that meta-learns an adaptable planning strategy for low-level planning algorithm. To address the potential training data scarcity and distribution shift in real-world environments, we introduce a landscape-aware automatic augmentation scheme that enriches training data. At the low-level, a Differential Evolution algorithm is deployed for solving the path planning tasks. To enhance the solving flexibility, we further design a variable-length encoding strategy that dynamically prunes redundant hover points and optimizes continuous flight parameters concurrently within a unified search space. Based on all proposed designs, we meta-train LAMDE and compare it with representative baselines. Comprehensive experiments demonstrate that LAMDE achieves state-of-the-art performance on the tested complex UAV path planning tasks in WSN data collection scenarios.", "authors": [ "Sijie Ma", "Zeyuan Ma", "Weijia Cao", "Yue-Jiao Gong", "Lingling Ma", "Zhiyang Huang", "Jun Zhang" ], "year": 2026, "published_date": "2026-09-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.16629", "pdf_url": "https://arxiv.org/pdf/2609.16629", "citations": 0, "topics": [], "tags": [ "Robotics", "Fairness & Ethics", "Neural Networks" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.27, "read_first_score": 6.4, "content_potential_score": 2.34, "interestingness_score": 2.8, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "UAVs have emerged as highly flexible platforms for data sensing in Wireless Sensor Networks (WSNs). Path planning for UAVs in such tasks plays a key role to assure remote sensing effectiveness and friendly energy consumption.", "key_contribution": "However, existing approaches show two key limitations: i) they are primarily hand-crafted with certain design biases that harm adaptation on unseen tasks.", "why_it_matters": "Learning to Optimize UAV Path Planning for Data Sensing in Wireless Sensor Networks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "However, existing approaches show two key limitations: i) they are primarily hand-crafted with certain design biases…", "biggest_caveat": "However, existing approaches show two key limitations: i) they are primarily hand-crafted with certain design biases that harm adaptation on unseen tasks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2609.16629", "difficulty": "intermediate" }, { "id": "arxiv:2607.25835", "source": "arxiv", "source_type": "preprint", "title": "Distributed Constraint Optimization via Online Learning and Iterative Pricing with Application to Large-Scale Satellite Scheduling", "abstract": "Distributed constraint optimization problems (DCOPs) provide a popular framework for distributed decision making under limited communication, but many real-world instances are too large to solve monolithically. We address this challenge from two complementary directions. We revisit the connection between DCOPs and potential games, and adapt modern online learning algorithms for equilibrium finding to DCOPs. We show that these algorithms are competitive with representative incomplete DCOP algorithms. We then turn to decomposition frameworks for large-scale DCOPs, motivated by large-scale decentralized satellite scheduling. We propose a new framework that separates a DCOP into two interacting subproblems: a high-level meta-DCOP for task allocation, and independent local optimization problems for scheduling. To couple the two levels, we develop a novel iterative pricing method that updates the meta-level utilities using feedback from the local optimizers. Combining our online learning methods with our iterative pricing framework, we obtain near-optimal performance on real-world decentralized satellite scheduling problem instances, fulfilling over 99% of observation requests compared with 87% for state-of-the-art baselines.", "authors": [ "Itai Zilberstein", "Pranav Rajbhandari", "Steve Chien", "Tuomas Sandholm" ], "year": 2026, "published_date": "2026-07-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.25835", "pdf_url": "https://arxiv.org/pdf/2607.25835", "citations": 0, "topics": [], "tags": [ "Game Theory", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.27, "read_first_score": 5.01, "content_potential_score": 0.0, "interestingness_score": 1.64, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Distributed constraint optimization problems (DCOPs) provide a popular framework for distributed decision making under limited communication, but many real-world instances are too large to solve monolithically. We address this challenge from two complementary directions.", "key_contribution": "We show that these algorithms are competitive with representative incomplete DCOP algorithms.", "why_it_matters": "Distributed Constraint Optimization via Online Learning and Iterative Pricing with Application to Large-Scale Satellite Scheduling represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Game Theory.", "one_line_takeaway": "We show that these algorithms are competitive with representative incomplete DCOP algorithms.", "biggest_caveat": "buted decision making under limited communication, but many real-world instances are too large to solve monolithically.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Game Theory.", "url": "https://arxiv.org/abs/2607.25835", "difficulty": "intermediate" }, { "id": "arxiv:2607.16247", "source": "arxiv", "source_type": "preprint", "title": "Self-Evolving Just-In-Time Memory for Proactive Embodied Safety", "abstract": "While Vision-Language Models (VLMs) have empowered embodied agents to execute complex household tasks, they struggle to proactively handle dynamically emerging hazards during closed-loop interactions. Existing safety approaches often rely on runtime guardrails to block unsafe actions or induce excessive caution, which severely stalls task progress instead of actively resolving the underlying risks. To break this safety-progress trade-off, we introduce the Self-Evolving Just-In-Time Memory framework, which reframes embodied safety from progress-stalling guardrails to proactive hazard mitigation. The framework consists of a Risk-Sufficient Topological Belief Graph (RSG) for persistent safety-relevant state tracking under partial observability, an Agency-Grounded Factual Memory for precise hazard anticipation, and an Experience Memory that injects procedural Meta-Skills to guide executable, progress-preserving mitigation. Furthermore, we propose an automated Test-Verify-Write loop, allowing agents to continually refine their mitigation Meta-Skills from execution traces at test time. Experiments on IS-Bench demonstrate that our framework substantially boosts the Safe-Success rate across multiple VLM backbones (e.g., +30.3% on Qwen3-VL-8B), enabling agents to proactively mitigate hazards without stalling task progress. Code is available at https://github.com/DyMessi/JIT-Memory.", "authors": [ "Bingrui Sima", "Lizhong Wang", "Xiaoya Lu", "Kun He", "Xiao Yang" ], "year": 2026, "published_date": "2026-06-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.16247", "pdf_url": "https://arxiv.org/pdf/2607.16247", "citations": 0, "topics": [], "tags": [ "VLMs", "Robotics", "Machine Learning", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.27, "read_first_score": 5.05, "content_potential_score": 0.0, "interestingness_score": 1.64, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "While Vision-Language Models (VLMs) have empowered embodied agents to execute complex household tasks, they struggle to proactively handle dynamically emerging hazards during closed-loop interactions. Existing safety approaches often rely on runtime guardrails to block unsafe actions or induce excessive caution, which severely stalls task progress instead of actively resolving the underlying risks.", "key_contribution": "To break this safety-progress trade-off, we introduce the Self-Evolving Just-In-Time Memory framework, which reframes embodied safety from progress-stalling guardrails to proactive hazard mitigation.", "why_it_matters": "Self-Evolving Just-In-Time Memory for Proactive Embodied Safety advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about VLMs.", "one_line_takeaway": "To break this safety-progress trade-off, we introduce the Self-Evolving Just-In-Time Memory framework, which reframes…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in VLMs.", "url": "https://arxiv.org/abs/2607.16247", "difficulty": "intermediate" }, { "id": "arxiv:2508.16159", "source": "arxiv", "source_type": "preprint", "title": "Through the Looking Glass: A Dual Perspective on Weakly-Supervised Few-Shot Segmentation", "abstract": "Meta-learning aims to uniformly sample homogeneous support-query pairs, characterized by the same categories and similar attributes, and extract useful inductive biases through identical network architectures. However, this identical network design results in over-semantic homogenization. To address this, we propose a novel homologous but heterogeneous network. By treating support-query pairs as dual perspectives, we introduce heterogeneous visual aggregation (HA) modules to enhance complementarity while preserving semantic commonality. To further reduce semantic noise and amplify the uniqueness of heterogeneous semantics, we design a heterogeneous transfer (HT) module. Finally, we propose heterogeneous CLIP (HC) textual information to enhance the generalization capability of multimodal models. In the weakly-supervised few-shot semantic segmentation (WFSS) task, with only 1/24 of the parameters of existing state-of-the-art models, TLG achieves a 13.2\\% improvement on Pascal-5\\textsuperscript{i} and a 9.7\\% improvement on COCO-20\\textsuperscript{i}. To the best of our knowledge, TLG is also the first weakly supervised (image-level) model that outperforms fully supervised (pixel-level) models under the same backbone architectures. The code is available at https://github.com/jarch-ma/TLG.", "authors": [ "Jiaqi Ma", "Guo-Sen Xie", "Fang Zhao", "Zechao Li" ], "year": 2026, "published_date": "2026-06-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2508.16159", "pdf_url": "https://arxiv.org/pdf/2508.16159", "citations": 0, "topics": [], "tags": [ "Prompting", "VLMs", "Object Detection", "Fairness & Ethics", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.27, "read_first_score": 6.0, "content_potential_score": 0.0, "interestingness_score": 1.64, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Meta-learning aims to uniformly sample homogeneous support-query pairs, characterized by the same categories and similar attributes, and extract useful inductive biases through identical network architectures. However, this identical network design results in over-semantic homogenization.", "key_contribution": "To address this, we propose a novel homologous but heterogeneous network.", "why_it_matters": "Through the Looking Glass: A Dual Perspective on Weakly-Supervised Few-Shot Segmentation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "To address this, we propose a novel homologous but heterogeneous network.", "biggest_caveat": "butes, and extract useful inductive biases through identical network architectures.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2508.16159", "difficulty": "beginner" }, { "id": "arxiv:2507.22136", "source": "arxiv", "source_type": "preprint", "title": "Color as the Impetus: Transforming Few-Shot Learner", "abstract": "Humans possess innate meta-learning capabilities, partly attributable to their exceptional color perception. In this paper, we pioneer an innovative viewpoint on few-shot learning by simulating human color perception mechanisms. We propose the ColorSense Learner, a bio-inspired meta-learning framework that capitalizes on inter-channel feature extraction and interactive learning. By strategically emphasizing distinct color information across different channels, our approach effectively filters irrelevant features while capturing discriminative characteristics. Color information represents the most intuitive visual feature, yet conventional meta-learning methods have predominantly neglected this aspect, focusing instead on abstract feature differentiation across categories. Our framework bridges the gap via synergistic color-channel interactions, enabling better intra-class commonality extraction and larger inter-class differences. Furthermore, we introduce a meta-distiller based on knowledge distillation, ColorSense Distiller, which incorporates prior teacher knowledge to augment the student network's meta-learning capacity. We've conducted comprehensive coarse/fine-grained and cross-domain experiments on eleven few-shot benchmarks for validation. Numerous experiments reveal that our methods have extremely strong generalization ability, robustness, and transferability, and effortless handle few-shot classification from the perspective of color perception.", "authors": [ "Chaofei Qi", "Zhitai Liu", "Jianbin Qiu" ], "year": 2026, "published_date": "2026-05-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2507.22136", "pdf_url": "https://arxiv.org/pdf/2507.22136", "citations": 0, "topics": [], "tags": [ "Prompting", "Info Extraction", "Model Compression", "Evaluation", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.27, "read_first_score": 6.15, "content_potential_score": 0.42, "interestingness_score": 1.84, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Humans possess innate meta-learning capabilities, partly attributable to their exceptional color perception. In this paper, we pioneer an innovative viewpoint on few-shot learning by simulating human color perception mechanisms.", "key_contribution": "We propose the ColorSense Learner, a bio-inspired meta-learning framework that capitalizes on inter-channel feature extraction and interactive learning.", "why_it_matters": "Color as the Impetus: Transforming Few-Shot Learner advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We propose the ColorSense Learner, a bio-inspired meta-learning framework that capitalizes on inter-channel feature…", "biggest_caveat": "butable to their exceptional color perception.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2507.22136", "difficulty": "beginner" }, { "id": "arxiv:2608.26601", "source": "arxiv", "source_type": "preprint", "title": "Extending Low Latency Service Across the Internet", "abstract": "Protocols such as L4S for low latency network services have attracted growing interest from major industry stakeholders such as Comcast, Apple, T-Mobile, and NVIDIA. However, L4S requires isolation between L4S flows and classic flows in order to maintain its low latency benefits and safe coexistence. The L4S architecture uses a DualPI2 AQM mechanism to provide this isolation when the bottleneck occurs at the home access link. In practice, however, bottlenecks may also occur at other locations in the network, such as peering points, ingress to wide area networks, or occasionally congested links in the core, where deploying DualPI2 AQM is not feasible. Without a solution to this problem, L4S may struggle to gain deployment, since its benefits may remain limited without end-to-end support. To address this challenge, we propose a deployment strategy that reduces the need to upgrade expensive core routers by using existing networking mechanisms such as BGP communities, SRv6, and priority queues with rate caps. We demonstrate the feasibility of this approach through large scale experiments on the FABRIC testbed. Our results demonstrate a practical deployment strategy for extending low latency service across the Internet, even across independently administered networks.", "authors": [ "Harkirat Singh", "Fatih Berkay Sarpkaya", "Hakan Gulec", "Fraida Fund", "Shivendra Panwar" ], "year": 2026, "published_date": "2026-08-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.26601", "pdf_url": "https://arxiv.org/pdf/2608.26601", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.26, "read_first_score": 5.16, "content_potential_score": 1.0, "interestingness_score": 2.13, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Protocols such as L4S for low latency network services have attracted growing interest from major industry stakeholders such as Comcast, Apple, T-Mobile, and NVIDIA. However, L4S requires isolation between L4S flows and classic flows in order to maintain its low latency benefits and safe coexistence.", "key_contribution": "To address this challenge, we propose a deployment strategy that reduces the need to upgrade expensive core routers by using existing networking mechanisms such as BGP communities, SRv6, and priority queues with rate caps.", "why_it_matters": "Extending Low Latency Service Across the Internet represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "To address this challenge, we propose a deployment strategy that reduces the need to upgrade expensive core routers by…", "biggest_caveat": "However, L4S requires isolation between L4S flows and classic flows in order to maintain its low latency benefits and safe coexistence.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2608.26601", "difficulty": "intermediate" }, { "id": "arxiv:2608.25568", "source": "arxiv", "source_type": "preprint", "title": "CrossMambaTuning: Synergistic Spatial and Cross-Layer Adaptation for Machine Vision Compression", "abstract": "To reduce deployment cost and retraining overhead, adapting pretrained learned image compression (LIC) models to downstream machine vision tasks has attracted growing attention. However, existing methods typically insert fine-tuning modules independently into frozen backbones, lacking explicit mechanisms for cross-layer coordination. To address this limitation, we propose a novel framework named CrossMambaTuning, which integrates State Space Models with cross-layer interaction mechanisms for parameter-efficient fine-tuning. Specifically, we design an efficient Mamba adapter equipped with task-specific prompts and multi-scale branching to precisely capture both local features and global dependencies. Furthermore, we introduce a Scale-Invariant Cross-Layer Adapter (SICA) utilizing a parameter-sharing strategy to fuse task information across different scales and reduce redundancy. Extensive experiments demonstrate that CrossMambaTuning achieves state-of-the-art (SOTA) performance on multiple machine vision tasks, reducing parameter overhead by 72\\% compared to SOTA methods. Code is available at https://github.com/rsr1123/CrossMambaTuning.", "authors": [ "Haobo Xiong", "Shaobo Liu", "Kai Liu", "Chongyang Ding" ], "year": 2026, "published_date": "2026-08-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.25568", "pdf_url": "https://arxiv.org/pdf/2608.25568", "citations": 0, "topics": [], "tags": [ "SSMs", "Fine-Tuning", "Artificial Intelligence", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (SSMs) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.26, "read_first_score": 4.16, "content_potential_score": 1.0, "interestingness_score": 2.13, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "To reduce deployment cost and retraining overhead, adapting pretrained learned image compression (LIC) models to downstream machine vision tasks has attracted growing attention. However, existing methods typically insert fine-tuning modules independently into frozen backbones, lacking explicit mechanisms for cross-layer coordination.", "key_contribution": "To address this limitation, we propose a novel framework named CrossMambaTuning, which integrates State Space Models with cross-layer interaction mechanisms for parameter-efficient fine-tuning.", "why_it_matters": "CrossMambaTuning: Synergistic Spatial and Cross-Layer Adaptation for Machine Vision Compression advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about SSMs.", "one_line_takeaway": "To address this limitation, we propose a novel framework named CrossMambaTuning, which integrates State Space Models…", "biggest_caveat": "However, existing methods typically insert fine-tuning modules independently into frozen backbones, lacking explicit mechanisms for cross-layer coordination.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in SSMs.", "url": "https://arxiv.org/abs/2608.25568", "difficulty": "advanced" }, { "id": "arxiv:2608.17975", "source": "arxiv", "source_type": "preprint", "title": "aDSL: Agentic 3D Creation via Joint Agent-Program Design", "abstract": "Programmatic representations provide a compelling paradigm for 3D content creation, enabling fine-grained edits, interpretability, and explicit structural control. Yet, agentic workflows that rely on large language models (LLMs) to author 3D programs remain brittle, often failing to translate high-level intent into consistent low-level geometry. We attribute this fragility to a mismatch between existing programmatic interfaces and the reasoning strengths of LLMs, which favor semantic structure and spatial relations over fragile numeric choices. In this paper, we jointly design an Agent-centric Domain-Specific Language (aDSL) and a role-specialized multi-agent system to close this gap. aDSL bridges semantic logic and geometric constraints by emphasizing composability and spatial reasoning; it enables agents to manipulate geometry through relational operators instead of brittle absolute coordinates. Building on aDSL, our training-free multi-agent system follows a Plan-Execute-Critic loop to decompose requests, synthesize code, and iteratively repair errors and constraint violations using execution feedback. Experiments show that this co-design improves robustness, controllability, and faithfulness to user intent. Our method outperforms prior LLM-based baselines on text-to-shape and image-to-shape tasks while preserving explicit structure, editability, and interpretability. It also enables downstream applications such as articulated object creation and structured scene composition. Our code is available at https://github.com/sig-pku/aDSL.", "authors": [ "Rui-Huan Wang", "Si-Tong Wei", "Jia-Qi He", "Heng-Yi Wei", "Baoquan Chen", "Peng-Shuai Wang" ], "year": 2026, "published_date": "2026-08-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.17975", "pdf_url": "https://arxiv.org/pdf/2608.17975", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Hallucination", "AI Agents", "Interpretability" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.26, "read_first_score": 5.18, "content_potential_score": 1.0, "interestingness_score": 2.13, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Programmatic representations provide a compelling paradigm for 3D content creation, enabling fine-grained edits, interpretability, and explicit structural control. Yet, agentic workflows that rely on large language models (LLMs) to author 3D programs remain brittle, often failing to translate high-level intent into consistent low-level geometry.", "key_contribution": "Experiments show that this co-design improves robustness, controllability, and faithfulness to user intent.", "why_it_matters": "aDSL: Agentic 3D Creation via Joint Agent-Program Design represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Experiments show that this co-design improves robustness, controllability, and faithfulness to user intent.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.17975", "difficulty": "intermediate" }, { "id": "arxiv:2608.10240", "source": "arxiv", "source_type": "preprint", "title": "Sequential Modality Dropout for Robust Multi-Modal Sequential Recommendation", "abstract": "Multi-modal sequential recommenders assume every item carries every modality, but real product catalogs often miss images or text, and a model trained on complete data loses much of its recommendation accuracy when a modality is unavailable at serving time. We propose Sequential Modality Dropout (SMD): during training, each modality stream (image and text) is independently erased with probability p for an entire user interaction history, so the model learns to predict the next item without relying on any single modality. We measure robustness by retention, the fraction of a model's full-modality accuracy (HR@10) that survives when a modality is removed at test time. Across four backbones (MM-SASRec, IISAN, MISSRec, and fMRLRec) on four Amazon domains, SMD raises text retention by 1.0 to 3.2x at essentially no cost to full-modality accuracy; under an extreme 95% per-item missing rate, it retains 61% of HR@10 versus 22% without (a 2.8x improvement). An optional cross-modal reconstruction loss further lifts retention from 90% to 98% on a simple additive backbone under severe text missingness. SMD is a four-line, architecture-agnostic change that makes multi-modal sequential recommenders robust to the missing modalities they actually encounter in deployment.", "authors": [ "Guanqun Yang", "Wenlong Zhang" ], "year": 2026, "published_date": "2026-08-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.10240", "pdf_url": "https://arxiv.org/pdf/2608.10240", "citations": 0, "topics": [], "tags": [ "Multimodal", "Adversarial", "Machine Learning", "Information Retrieval", "Multimedia" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.26, "read_first_score": 4.48, "content_potential_score": 1.0, "interestingness_score": 2.13, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multi-modal sequential recommenders assume every item carries every modality, but real product catalogs often miss images or text, and a model trained on complete data loses much of its recommendation accuracy when a modality is unavailable at serving time. We propose Sequential Modality Dropout (SMD): during training, each modality stream (image and text) is independently erased with probability p for an entire user interaction history, so the model learns to predict the next item without relying on any single modality.", "key_contribution": "We propose Sequential Modality Dropout (SMD): during training, each modality stream (image and text) is independently erased with probability p for an entire user interaction history, so the model learns to predict the next item without relying on any single modality.", "why_it_matters": "Sequential Modality Dropout for Robust Multi-Modal Sequential Recommendation improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We propose Sequential Modality Dropout (SMD): during training, each modality stream (image and text) is independently…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2608.10240", "difficulty": "intermediate" }, { "id": "arxiv:2503.11126", "source": "arxiv", "source_type": "preprint", "title": "MUSS: Multilevel Subset Selection for Relevance and Diversity", "abstract": "The problem of relevant and diverse subset selection has a wide range of applications, including recommender systems and retrieval-augmented generation (RAG). For example, in recommender systems, one is interested in selecting relevant items, while providing a diversified recommendation. Constrained subset selection problem is NP-hard, and popular approaches such as Maximum Marginal Relevance (MMR) are based on greedy selection. Many real-world applications involve large data, but the original MMR work did not consider distributed selection. This limitation was later addressed by a method called DGDS which allows for a distributed setting using random data partitioning. Here, we exploit structure in the data to further improve both scalability and performance on the target application. We propose MUSS, a novel method that uses a multilevel approach to relevant and diverse selection. In a recommender system application, our method can not only improve the performance up to $4$ percent points in precision, but is also $20$ to $80$ times faster. Our method is also capable of outperforming baselines on RAG-based question answering accuracy. We present a novel theoretical approach for analyzing this type of problems, and show that our method achieves a constant factor approximation of the optimal objective. Moreover, our analysis also resulted in a $\\times 2$ tighter bound for DGDS compared to previously known bound. Our code is publicly available at https://github.com/amazon-science/muss.", "authors": [ "Vu Nguyen", "Andrey Kan" ], "year": 2026, "published_date": "2026-08-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2503.11126", "pdf_url": "https://arxiv.org/pdf/2503.11126", "citations": 0, "topics": [], "tags": [ "RAG", "QA", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.26, "read_first_score": 6.4, "content_potential_score": 0.0, "interestingness_score": 1.63, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The problem of relevant and diverse subset selection has a wide range of applications, including recommender systems and retrieval-augmented generation (RAG). For example, in recommender systems, one is interested in selecting relevant items, while providing a diversified recommendation.", "key_contribution": "We propose MUSS, a novel method that uses a multilevel approach to relevant and diverse selection.", "why_it_matters": "MUSS: Multilevel Subset Selection for Relevance and Diversity represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RAG.", "one_line_takeaway": "We propose MUSS, a novel method that uses a multilevel approach to relevant and diverse selection.", "biggest_caveat": "but the original MMR work did not consider distributed selection.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in RAG.", "url": "https://arxiv.org/abs/2503.11126", "difficulty": "beginner" }, { "id": "arxiv:2602.08404", "source": "arxiv", "source_type": "preprint", "title": "TEAM: Temporal-Spatial Consistency Guided Expert Activation for MoE Diffusion Language Model Acceleration", "abstract": "Diffusion large language models (dLLMs) have recently gained significant attention due to their inherent support for parallel decoding. Building on this paradigm, Mixture-of-Experts (MoE) dLLMs with autoregressive (AR) initialization have further demonstrated strong performance competitive with mainstream AR models. However, we identify a fundamental mismatch between MoE architectures and diffusion-based decoding. Specifically, a large number of experts are activated at each denoising step, while only a small subset of tokens is ultimately accepted, resulting in substantial inference overhead and limiting their deployment in latency-sensitive applications. In this work, we propose TEAM, a plug-and-play framework that accelerates MoE dLLMs by enabling more accepted tokens with fewer activated experts. TEAM is motivated by the observation that expert routing decisions exhibit strong temporal consistency across denoising levels as well as spatial consistency across token positions. Leveraging these properties, TEAM employs three complementary expert activation and decoding strategies, conservatively selecting necessary experts for decoded and masked tokens and simultaneously performing aggressive speculative exploration across multiple candidates. Experimental results demonstrate that TEAM achieves up to 2.2x speedup over vanilla MoE dLLM, with negligible performance degradation. Code is released at https://github.com/PKU-SEC-Lab/TEAM-MoE-dLLM.", "authors": [ "Linye Wei", "Zixiang Luo", "Pingzhi Tang", "Meng Li" ], "year": 2026, "published_date": "2026-05-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.08404", "pdf_url": "https://arxiv.org/pdf/2602.08404", "citations": 0, "topics": [], "tags": [ "LLMs", "MoE", "NLP" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (MoE) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.26, "read_first_score": 4.52, "content_potential_score": 1.42, "interestingness_score": 2.34, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Diffusion large language models (dLLMs) have recently gained significant attention due to their inherent support for parallel decoding. Building on this paradigm, Mixture-of-Experts (MoE) dLLMs with autoregressive (AR) initialization have further demonstrated strong performance competitive with mainstream AR models.", "key_contribution": "In this work, we propose TEAM, a plug-and-play framework that accelerates MoE dLLMs by enabling more accepted tokens with fewer activated experts.", "why_it_matters": "TEAM: Temporal-Spatial Consistency Guided Expert Activation for MoE Diffusion Language Model Acceleration represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this work, we propose TEAM, a plug-and-play framework that accelerates MoE dLLMs by enabling more accepted tokens…", "biggest_caveat": "However, we identify a fundamental mismatch between MoE architectures and diffusion-based decoding.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2602.08404", "difficulty": "advanced" }, { "id": "arxiv:2512.13399", "source": "arxiv", "source_type": "preprint", "title": "Differentiable Evolutionary Reinforcement Learning", "abstract": "Crafting effective reward signals remains a central challenge in Reinforcement Learning (RL), especially for complex reasoning tasks. Existing automated reward optimization methods typically rely on derivative-free search heuristics that treat the reward function as a black box, failing to exploit the causal dynamics between reward structure modifications and policy performance. We introduce Differentiable Evolutionary Reinforcement Learning (DERL), a bi-level framework for the autonomous discovery of optimal reward structures. DERL employs a Meta-Optimizer that evolves a reward function through the composition of structured atomic primitives to guide an inner-loop policy. Unlike prior black-box methods, DERL introduces differentiability into the meta-optimization process by updating the Meta-Optimizer using policy gradients derived from inner-loop validation performance. This allows for the progressive learning of a \"meta-gradient\" for task success, providing the system with dense, actionable feedback. We validate DERL across diverse reasoning domains: embodied agent (ALFWorld), scientific simulation (ScienceWorld), and mathematical reasoning (GSM8K, MATH). Results show that DERL achieves state-of-the-art performance on agent benchmarks, substantially outperforming non-differentiable baselines-especially in out-of-distribution generalization. Trajectory analyses confirm that DERL captures the intrinsic causal structure of tasks, enabling fully autonomous, self-improving agent alignment.", "authors": [ "Sitao Cheng", "Tianle Li", "Xuhan Huang", "Xunjian Yin", "Difan Zou" ], "year": 2026, "published_date": "2026-05-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2512.13399", "pdf_url": "https://arxiv.org/pdf/2512.13399", "citations": 0, "topics": [], "tags": [ "Reasoning", "AI Safety", "Info Extraction", "RL", "Robotics" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.26, "read_first_score": 3.84, "content_potential_score": 0.0, "interestingness_score": 1.63, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Crafting effective reward signals remains a central challenge in Reinforcement Learning (RL), especially for complex reasoning tasks. Existing automated reward optimization methods typically rely on derivative-free search heuristics that treat the reward function as a black box, failing to exploit the causal dynamics between reward structure modifications and policy performance.", "key_contribution": "We introduce Differentiable Evolutionary Reinforcement Learning (DERL), a bi-level framework for the autonomous discovery of optimal reward structures.", "why_it_matters": "Differentiable Evolutionary Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We introduce Differentiable Evolutionary Reinforcement Learning (DERL), a bi-level framework for the autonomous…", "biggest_caveat": "bution generalization.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2512.13399", "difficulty": "advanced" }, { "id": "arxiv:2602.18907", "source": "arxiv", "source_type": "preprint", "title": "DeepInterestGR: Mining Deep Multi-Interest Using Multi-Modal LLMs for Generative Recommendation", "abstract": "We introduce DeepInterestGR, a novel framework that integrates deep interest mining into the generative recommendation pipeline. This addresses the \"Shallow Interest\" problem - existing generative methods rely on surface-level textual features and fail to capture latent user motivations, limiting personalization depth and recommendation interpretability. Our approach leverages Multi-LLM Interest Mining (MLIM) via structured reasoning prompting, Reward-Labeled Deep Interest (RLDI) for quality control, and Interest-Enhanced Item Discretization (IEID) via RQ-VAE, combined with a two-stage SFT-GRPO training pipeline guided by an Interest-Aware Reward. We validate DeepInterestGR on three Amazon Review benchmarks (Beauty, Sports, Instruments), comparing against 14 state-of-the-art baselines including SASRec, BERT4Rec, TIGER, LC-Rec, and S-DPO. Our method achieves 5.8%-8.3% relative improvements on HR@10 and 7.7%-9.9% on NDCG@10 over the strongest baseline, with cross-domain generalization gains of +24.8%. These results provide evidence that incorporating deep semantic interests can effectively improve SID-based generative recommendation.", "authors": [ "Yangchen Zeng", "Zhenyu Yu", "Zhiyuan Hu", "Wenxin Zhang", "Jinze Wang", "Rongfeng Guo" ], "year": 2026, "published_date": "2026-05-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.18907", "pdf_url": "https://arxiv.org/pdf/2602.18907", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "RLHF", "Multimodal", "Interpretability" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.26, "read_first_score": 4.61, "content_potential_score": 0.0, "interestingness_score": 1.63, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce DeepInterestGR, a novel framework that integrates deep interest mining into the generative recommendation pipeline. This addresses the \"Shallow Interest\" problem - existing generative methods rely on surface-level textual features and fail to capture latent user motivations, limiting personalization depth and recommendation interpretability.", "key_contribution": "We introduce DeepInterestGR, a novel framework that integrates deep interest mining into the generative recommendation pipeline.", "why_it_matters": "DeepInterestGR: Mining Deep Multi-Interest Using Multi-Modal LLMs for Generative Recommendation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce DeepInterestGR, a novel framework that integrates deep interest mining into the generative recommendation…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2602.18907", "difficulty": "advanced" }, { "id": "arxiv:2604.09452v1", "source": "arxiv", "source_type": "preprint", "title": "SafeAdapt: Provably Safe Policy Updates in Deep Reinforcement Learning", "abstract": "Safety guarantees are a prerequisite to the deployment of reinforcement learning (RL) agents in safety-critical tasks. Often, deployment environments exhibit non-stationary dynamics or are subject to changing performance goals, requiring updates to the learned policy. This leads to a fundamental challenge: how to update an RL policy while preserving its safety properties on previously encountered tasks? The majority of current approaches either do not provide formal guarantees or verify policy safety only a posteriori. We propose a novel a priori approach to safe policy updates in continual RL by introducing the Rashomon set: a region in policy parameter space certified to meet safety constraints within the demonstration data distribution. We then show that one can provide formal, provable guarantees for arbitrary RL algorithms used to update a policy by projecting their updates onto the Rashomon set. Empirically, we validate this approach across grid-world navigation environments (Frozen Lake and Poisoned Apple) where we guarantee an a priori provably deterministic safety on the source task during downstream adaptation. In contrast, we observe that regularisation-based baselines experience catastrophic forgetting of safety constraints while our approach enables strong adaptation with provable guarantees that safety is preserved.", "authors": [ "Maksim Anisimov", "Francesco Belardinelli", "Matthew Wicker" ], "year": 2026, "published_date": "2026-04-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.09452v1", "pdf_url": "https://arxiv.org/pdf/2604.09452v1", "citations": 0, "topics": [], "tags": [ "Continual Learning", "RL", "Artificial Intelligence", "Reinforcement Learning", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Continual Learning, RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.26, "read_first_score": 4.56, "content_potential_score": 1.0, "interestingness_score": 2.13, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Safety guarantees are a prerequisite to the deployment of reinforcement learning (RL) agents in safety-critical tasks. Often, deployment environments exhibit non-stationary dynamics or are subject to changing performance goals, requiring updates to the learned policy.", "key_contribution": "We propose a novel a priori approach to safe policy updates in continual RL by introducing the Rashomon set: a region in policy parameter space certified to meet safety constraints within the demonstration data distribution.", "why_it_matters": "SafeAdapt: Provably Safe Policy Updates in Deep Reinforcement Learning contributes to reinforcement learning — a key paradigm for training agents that make sequential decisions.", "content_hook": "A new paper that could change how we think about Continual Learning.", "one_line_takeaway": "We propose a novel a priori approach to safe policy updates in continual RL by introducing the Rashomon set: a region…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Continual Learning.", "url": "http://arxiv.org/abs/2604.09452v1", "difficulty": "advanced" }, { "id": "arxiv:2412.03800", "source": "arxiv", "source_type": "preprint", "title": "ELEMENT: Episodic and Lifelong Exploration via Maximum Entropy", "abstract": "Reinforcement learning agents depend on reward signals whose density is rarely under the designer's control, and when such signals are absent, an agent must generate its own drive to explore. State entropy maximization offers a principled objective for this, but existing methods break down at scale in two ways: the intrinsic reward vanishes once a state has been visited, discouraging revisits to the very gateways that lead onward, and estimating entropy over millions of accumulated observations becomes computationally prohibitive. We address both with Episodic and Lifelong Exploration via Maximum Entropy (ELEMENT), a multiscale intrinsically motivated framework for reward-free exploration that transfers to downstream tasks. ELEMENT couples lifelong entropy maximization with a complementary episodic term acting on a faster timescale. For the episodic term, we derive average episodic state entropy, an intrinsic reward that is the exact minimizer of a tractable upper bound on the reward-decomposition objective; for the lifelong term, we propose a $k$NN graph-based estimator that keeps entropy tractable without forgetting. ELEMENT consistently outperforms state-of-the-art intrinsic reward baselines on state coverage and unsupervised pre-training. Videos, code, and supplementary material: https://sites.google.com/view/element-rl.", "authors": [ "Hongming Li", "Zhao Yang", "Xiaoxuan Liang", "Shujian Yu", "Jose C. Principe" ], "year": 2026, "published_date": "2026-09-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2412.03800", "pdf_url": "https://arxiv.org/pdf/2412.03800", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Self-Supervised", "RL", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.25, "read_first_score": 3.83, "content_potential_score": 0.0, "interestingness_score": 1.62, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reinforcement learning agents depend on reward signals whose density is rarely under the designer's control, and when such signals are absent, an agent must generate its own drive to explore. State entropy maximization offers a principled objective for this, but existing methods break down at scale in two ways: the intrinsic reward vanishes once a state has been visited, discouraging revisits to the very gateways that lead onward, and estimating entropy over millions of accumulated observations becomes computationally prohibitive.", "key_contribution": "For the episodic term, we derive average episodic state entropy, an intrinsic reward that is the exact minimizer of a tractable upper bound on the reward-decomposition objective; for the lifelong term, we propose a $k$NN graph-based estimator that keeps entropy tractable without forgetting.", "why_it_matters": "ELEMENT: Episodic and Lifelong Exploration via Maximum Entropy represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "For the episodic term, we derive average episodic state entropy, an intrinsic reward that is the exact minimizer of a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2412.03800", "difficulty": "advanced" }, { "id": "arxiv:2609.19755", "source": "arxiv", "source_type": "preprint", "title": "HyperAMS-Net: Adaptive Multi-Scale Spatial Hypergraph Network for Brain Disorder Classification", "abstract": "Accurate classification of brain disorders from neuroimaging data remains challenging because of substantial inter-subject heterogeneity and the complex multi-scale patterns present in functional connectivity and morphological representations. To address these challenges, we propose HyperAMS-Net, a deep learning framework for brain disorder classification using neuroimaging representations derived from resting-state functional MRI or structural MRI. HyperAMS-Net integrates adaptive multi-scale convolution, hypergraph attention, spatial-channel attention, and adaptive feature fusion. Specifically, adaptive multi-scale convolution learns data-driven weights over multiple receptive fields to capture complementary patterns at different scales. Hypergraph attention models higher-order dependencies among learned feature representations through node--hyperedge--node message passing, while spatial-channel attention enhances discriminative feature learning. Adaptive feature fusion further aggregates complementary information across parallel network branches. HyperAMS-Net is evaluated on three benchmark datasets spanning distinct brain disorders: ABIDE for autism spectrum disorder, REST-meta-MDD for major depressive disorder, and ADNI for Alzheimer's disease, using 5-fold stratified cross-validation. HyperAMS-Net achieves state-of-the-art performance across all evaluated datasets, attaining the highest accuracy and AUC among the compared methods. Ablation studies further demonstrate the contribution of each proposed component, with the largest performance degradation observed when hypergraph attention is removed.", "authors": [ "Proloy Kumar Mondal", "Md Kamran Hussin Chowdhury", "Hoi Leong Lee" ], "year": 2026, "published_date": "2026-09-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.19755", "pdf_url": "https://arxiv.org/pdf/2609.19755", "citations": 0, "topics": [], "tags": [ "GNNs", "Evaluation", "Machine Learning", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.25, "read_first_score": 5.54, "content_potential_score": 1.5, "interestingness_score": 2.38, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Accurate classification of brain disorders from neuroimaging data remains challenging because of substantial inter-subject heterogeneity and the complex multi-scale patterns present in functional connectivity and morphological representations. To address these challenges, we propose HyperAMS-Net, a deep learning framework for brain disorder classification using neuroimaging representations derived from resting-state functional MRI or structural MRI.", "key_contribution": "Accurate classification of brain disorders from neuroimaging data remains challenging because of substantial inter-subject heterogeneity and the complex multi-scale patterns present in functional connectivity and morphological representations.", "why_it_matters": "HyperAMS-Net: Adaptive Multi-Scale Spatial Hypergraph Network for Brain Disorder Classification advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about GNNs.", "one_line_takeaway": "Accurate classification of brain disorders from neuroimaging data remains challenging because of substantial…", "biggest_caveat": "bution of each proposed component, with the largest performance degradation observed when hypergraph attention is removed.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in GNNs.", "url": "https://arxiv.org/abs/2609.19755", "difficulty": "beginner" }, { "id": "arxiv:2606.22480", "source": "arxiv", "source_type": "preprint", "title": "ARP: Enhancing Quantized Skill Abstractions via Visual Alignment and Iterative Refinement for Robotic Manipulation", "abstract": "Learning visuomotor policies for long-horizon manipulation remains a fundamental challenge. Recent skill-based imitation learning methods based on discrete quantization have shown promising results by representing complex behaviors as temporally extended skills. However, most existing approaches primarily encode action trajectories into latent skills, yielding weak visual-semantic grounding and limiting the ability to leverage visual observations for skill selection. Moreover, discrete tokenization inevitably incurs precision errors during continuous action generation. To alleviate these issues, we propose Aligned Refinement Policy (ARP), a discrete-skill framework that couples semantic grounding with execution-level refinement. Specifically, ARP introduces (i) a visual--action alignment objective that contrastively aligns visual embeddings with pre-quantized action representations in a shared latent space while preserving a state-independent skill decoder, and (ii) a lightweight Iterative Residual Head (IRH) that performs a two-step refinement to recover fine-grained control for precise execution. Extensive experiments show that ARP achieves state-of-the-art performance on the LIBERO and Meta-World benchmarks. Moreover, real-robot experiments on the Kuavo 4 Pro humanoid platform further validate its effectiveness, yielding consistent performance gains over several baselines on two challenging manipulation tasks.", "authors": [ "Yuntian Wang", "Zesheng Jia", "Yuhui Duan", "Qibing Wang", "Yang Liu", "Song Wang", "Siao Liu", "Jin Wang" ], "year": 2026, "published_date": "2026-06-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.22480", "pdf_url": "https://arxiv.org/pdf/2606.22480", "citations": 0, "topics": [], "tags": [ "Hallucination", "AI Safety", "Model Compression", "Robotics", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.25, "read_first_score": 3.8, "content_potential_score": 0.0, "interestingness_score": 1.62, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Learning visuomotor policies for long-horizon manipulation remains a fundamental challenge. Recent skill-based imitation learning methods based on discrete quantization have shown promising results by representing complex behaviors as temporally extended skills.", "key_contribution": "To alleviate these issues, we propose Aligned Refinement Policy (ARP), a discrete-skill framework that couples semantic grounding with execution-level refinement.", "why_it_matters": "ARP: Enhancing Quantized Skill Abstractions via Visual Alignment and Iterative Refinement for Robotic Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "To alleviate these issues, we propose Aligned Refinement Policy (ARP), a discrete-skill framework that couples semantic…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2606.22480", "difficulty": "advanced" }, { "id": "arxiv:2601.15423", "source": "arxiv", "source_type": "preprint", "title": "Lattice: A Confidence-Gated Hybrid System for Uncertainty-Aware Sequential Prediction with Behavioral Archetypes", "abstract": "We introduce Lattice, a hybrid sequential prediction system that conditionally activates learned behavioral structure using binary confidence gating. The system summarizes behavior windows as behavioral archetypes and activates archetype-based scoring only when an in-support confidence signal exceeds a validation-calibrated threshold, falling back to backbone predictions when uncertain. Our primary estimand is the controlled effect of adding Lattice to a fixed backbone on identical test rows. On MovieLens (30 paired seeds, full-catalog ranking), LSTM+Lattice improves HR@10 by +31.7% (gated) versus the LSTM backbone alone (p much less than 10^-20); ungated fusion reaches +58.7% on the same protocol. We do not claim gating maximizes pooled accuracy. With backbone-native archetypes (fit in each backbone's embedding space), gated lifts of +13.3% (transformer) and +17.0% (SASRec) hold under the same evaluation design. A prior approximately 0% transformer row in version 1 reflected an invalid cross-backbone transfer, not evidence that composition cannot help stronger encoders. Amazon Electronics provides supporting cross-domain evidence (+124.0% gated, 15 seeds, high variance). Controlled shift checks (appendix) illustrate gate refusal under distribution shift. Standalone SASRec and BERT4Rec scores are contextual references, not the target estimand. We report what composition achieves and when it activates; production calibration and implementation details remain proprietary pending patent prosecution.", "authors": [ "Lorian Bannis" ], "year": 2026, "published_date": "2026-06-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.15423", "pdf_url": "https://arxiv.org/pdf/2601.15423", "citations": 0, "topics": [], "tags": [ "Transformers", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.25, "read_first_score": 5.54, "content_potential_score": 1.0, "interestingness_score": 2.12, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce Lattice, a hybrid sequential prediction system that conditionally activates learned behavioral structure using binary confidence gating. The system summarizes behavior windows as behavioral archetypes and activates archetype-based scoring only when an in-support confidence signal exceeds a validation-calibrated threshold, falling back to backbone predictions when uncertain.", "key_contribution": "We introduce Lattice, a hybrid sequential prediction system that conditionally activates learned behavioral structure using binary confidence gating.", "why_it_matters": "Lattice: A Confidence-Gated Hybrid System for Uncertainty-Aware Sequential Prediction with Behavioral Archetypes represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "We introduce Lattice, a hybrid sequential prediction system that conditionally activates learned behavioral structure…", "biggest_caveat": "cannot help stronger encoders.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2601.15423", "difficulty": "intermediate" }, { "id": "arxiv:2501.17377", "source": "arxiv", "source_type": "preprint", "title": "ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimization", "abstract": "Deep Reinforcement Learning (DRL) has emerged as a promising approach for solving Combinatorial Optimization (CO) problems, such as the 3D Bin Packing Problem (3D-BPP), Traveling Salesman Problem (TSP), or Vehicle Routing Problem (VRP), but these neural solvers often exhibit brittleness when facing distribution shifts. To address this issue, we uncover the Satisficing Generalization Edge, which we validate both theoretically and experimentally: identifying a set of promising actions is inherently more generalizable than selecting the single optimal action. To exploit this property, we propose Adaptive Selection After Proposal (ASAP), a generic framework that decomposes the decision-making process into two distinct phases: a proposal policy that acts as a robust filter, and a selection policy as an adaptable decision maker. This architecture enables a highly effective online adaptation strategy where the selection policy can be rapidly fine-tuned on a new distribution. Concretely, we introduce a two-phase training framework enhanced by Model-Agnostic Meta-Learning (MAML) to prime the model for fast adaptation. Extensive experiments on 3D-BPP, TSP, and CVRP demonstrate that ASAP improves the generalization capability of state-of-the-art baselines and achieves superior online adaptation on out-of-distribution instances.", "authors": [ "Han Fang", "Paul Weng", "Yutong Ban" ], "year": 2026, "published_date": "2026-06-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2501.17377", "pdf_url": "https://arxiv.org/pdf/2501.17377", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "RL", "Machine Learning", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.25, "read_first_score": 4.51, "content_potential_score": 0.0, "interestingness_score": 1.62, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deep Reinforcement Learning (DRL) has emerged as a promising approach for solving Combinatorial Optimization (CO) problems, such as the 3D Bin Packing Problem (3D-BPP), Traveling Salesman Problem (TSP), or Vehicle Routing Problem (VRP), but these neural solvers often exhibit brittleness when facing distribution shifts. To address this issue, we uncover the Satisficing Generalization Edge, which we validate both theoretically and experimentally: identifying a set of promising actions is inherently more generalizable than selecting the single optimal action.", "key_contribution": "To exploit this property, we propose Adaptive Selection After Proposal (ASAP), a generic framework that decomposes the decision-making process into two distinct phases: a proposal policy that acts as a robust filter, and a selection policy as an adaptable decision maker.", "why_it_matters": "ASAP: Exploiting the Satisficing Generalization Edge in Neural Combinatorial Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "To exploit this property, we propose Adaptive Selection After Proposal (ASAP), a generic framework that decomposes the…", "biggest_caveat": "but these neural solvers often exhibit brittleness when facing distribution shifts.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2501.17377", "difficulty": "advanced" }, { "id": "arxiv:2605.28048", "source": "arxiv", "source_type": "preprint", "title": "SAFEVPR: Patch-Based Conformal Verification for Safe Cross-Condition Sequence Visual Place Recognition", "abstract": "Sequence-based visual place recognition (VPR) for SLAM and robot relocalization must decide whether the retrieved top-1 candidate is safe to accept. Conformal prediction is a natural framework for this accept/reject decision, but its finite-sample guarantees rely on exchangeability between calibration and deployment (test) data, which is violated under cross-condition deployment. We introduce SAFEVPR, a non-trainable verification-and-calibration pipeline for safe cross-condition sequence VPR. SAFEVPR replaces the standard backbone cosine similarity with a mutual-nearest-neighbour (MNN) patch-matching score computed from frozen DINOv2 ViT features, and replaces flat Learn-Then-Test calibration with Mondrian conformal LTT, fitting separate Bonferroni-corrected thresholds across score bins. Under exchangeability, these thresholds would provide finite-sample false-discovery-rate (FDR) control; under condition shift, we evaluate empirical validity per deployment. Across 23 cross-condition setups from Oxford RobotCar, NCLT, and St Lucia datasets, using three frozen VPR backbones, SAFEVPR is empirically valid on 23/23 setups at target FDR alpha = 0.10, achieving mean accepted FDR 0.014 and mean true-positive rate (TPR) 0.75. The results show that raw discrimination alone is not sufficient for conformal validity: AnyLoc-VLAD and Super-Point+LightGlue reach comparable area under the receiver operating characteristic curve (AUROC) but fail more setups under the same calibration. On textureless repetitive scenery, SAFEVPR safely abstains rather than accepting unreliable matches. Code is available at https://github.com/Hasar12139/SafeVPR.", "authors": [ "Ha Sier", "Jiaqiang Zhang", "Zhuo Zou", "Xianjia Yu", "Tomi Westerlund" ], "year": 2026, "published_date": "2026-05-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.28048", "pdf_url": "https://arxiv.org/pdf/2605.28048", "citations": 0, "topics": [], "tags": [ "Robotics" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.25, "read_first_score": 4.57, "content_potential_score": 1.0, "interestingness_score": 2.12, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Sequence-based visual place recognition (VPR) for SLAM and robot relocalization must decide whether the retrieved top-1 candidate is safe to accept. Conformal prediction is a natural framework for this accept/reject decision, but its finite-sample guarantees rely on exchangeability between calibration and deployment (test) data, which is violated under cross-condition deployment.", "key_contribution": "We introduce SAFEVPR, a non-trainable verification-and-calibration pipeline for safe cross-condition sequence VPR.", "why_it_matters": "SAFEVPR: Patch-Based Conformal Verification for Safe Cross-Condition Sequence Visual Place Recognition represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We introduce SAFEVPR, a non-trainable verification-and-calibration pipeline for safe cross-condition sequence VPR.", "biggest_caveat": "but fail more setups under the same calibration.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2605.28048", "difficulty": "intermediate" }, { "id": "arxiv:2609.24768", "source": "arxiv", "source_type": "preprint", "title": "PrismGPT: Proxy-Guided Learning for Region-Aware Photo Editing with Self-Synthesized Reasoning", "abstract": "Professional photo finishing relies on both global adjustments and region-specific local edits guided by semantic masks, yet current automated methods handle this workflow only partially. We present PrismGPT, a Vision-Language Model (VLM) framework that produces structured, region-aware editing plans from a single input image without relying on commercial black-box tools. Training a VLM to simultaneously diagnose aesthetic deficiencies at both global and local levels while predicting precise editing parameters is challenging due to the vast combinatorial decision space. We address this through proxy-guided learning: two simpler proxy tasks -- operation decomposition and region-aware aesthetic ranking -- teach the foundational skills the model needs, while a competence-based dynamic scheduler automatically rebalances the multi-task training ratio, progressively shifting emphasis from the proxy tasks to the primary editing task as each skill is mastered. Crucially, all reasoning traces used for supervised fine-tuning are self-synthesized by the same base model, eliminating the need for a stronger external teacher. Experiments on MIT-Adobe FiveK and SPIRE, a new professionally retouched benchmark we introduce, show that PrismGPT achieves state-of-the-art results while using only ~6% of the training data compared to the previous best method.", "authors": [ "Ke Zhao", "Hue Nguyen", "Abhijith Punnappurath", "Zhongling Wang", "Iqbal Mohomed", "Michael S. Brown" ], "year": 2026, "published_date": "2026-09-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.24768", "pdf_url": "https://arxiv.org/pdf/2609.24768", "citations": 0, "topics": [], "tags": [ "Reasoning", "Fine-Tuning", "VLMs", "Evaluation", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Uses multi-task — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.24, "read_first_score": 5.54, "content_potential_score": 1.5, "interestingness_score": 2.37, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Professional photo finishing relies on both global adjustments and region-specific local edits guided by semantic masks, yet current automated methods handle this workflow only partially. We present PrismGPT, a Vision-Language Model (VLM) framework that produces structured, region-aware editing plans from a single input image without relying on commercial black-box tools.", "key_contribution": "We present PrismGPT, a Vision-Language Model (VLM) framework that produces structured, region-aware editing plans from a single input image without relying on commercial black-box tools.", "why_it_matters": "PrismGPT: Proxy-Guided Learning for Region-Aware Photo Editing with Self-Synthesized Reasoning advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We present PrismGPT, a Vision-Language Model (VLM) framework that produces structured, region-aware editing plans from…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2609.24768", "difficulty": "advanced" }, { "id": "arxiv:2604.03181v1", "source": "arxiv", "source_type": "preprint", "title": "Multi-View Video Diffusion Policy: A 3D Spatio-Temporal-Aware Video Action Model", "abstract": "Robotic manipulation requires understanding both the 3D spatial structure of the environment and its temporal evolution, yet most existing policies overlook one or both. They typically rely on 2D visual observations and backbones pretrained on static image--text pairs, resulting in high data requirements and limited understanding of environment dynamics. To address this, we introduce MV-VDP, a multi-view video diffusion policy that jointly models the 3D spatio-temporal state of the environment. The core idea is to simultaneously predict multi-view heatmap videos and RGB videos, which 1) align the representation format of video pretraining with action finetuning, and 2) specify not only what actions the robot should take, but also how the environment is expected to evolve in response to those actions. Extensive experiments show that MV-VDP enables data-efficient, robust, generalizable, and interpretable manipulation. With only ten demonstration trajectories and without additional pretraining, MV-VDP successfully performs complex real-world tasks, demonstrates strong robustness across a range of model hyperparameters, generalizes to out-of-distribution settings, and predicts realistic future videos. Experiments on Meta-World and real-world robotic platforms demonstrate that MV-VDP consistently outperforms video-prediction--based, 3D-based, and vision--language--action models, establishing a new state of the art in data-efficient multi-task manipulation.", "authors": [ "Peiyan Li", "Yixiang Chen", "Yuan Xu", "Jiabing Yang", "Xiangnan Wu", "Jun Guo", "Nan Sun", "Long Qian", "Xinghang Li", "Xin Xiao", "Jing Liu", "Nianfeng Liu", "Tao Kong", "Yan Huang", "Liang Wang", "Tieniu Tan" ], "year": 2026, "published_date": "2026-04-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.03181v1", "pdf_url": "https://arxiv.org/pdf/2604.03181v1", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "Robotics", "Interpretability", "Interpretability & Explainability", "Self-Supervised & Contrastive Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses pretraining — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.24, "read_first_score": 3.89, "content_potential_score": 0.97, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Robotic manipulation requires understanding both the 3D spatial structure of the environment and its temporal evolution, yet most existing policies overlook one or both. They typically rely on 2D visual observations and backbones pretrained on static image--text pairs, resulting in high data requirements and limited understanding of environment dynamics.", "key_contribution": "To address this, we introduce MV-VDP, a multi-view video diffusion policy that jointly models the 3D spatio-temporal state of the environment.", "why_it_matters": "Multi-View Video Diffusion Policy: A 3D Spatio-Temporal-Aware Video Action Model represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "To address this, we introduce MV-VDP, a multi-view video diffusion policy that jointly models the 3D spatio-temporal…", "biggest_caveat": "but also how the environment is expected to evolve in response to those actions.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Self-Supervised.", "url": "http://arxiv.org/abs/2604.03181v1", "difficulty": "advanced" }, { "id": "arxiv:2606.09381v1", "source": "arxiv", "source_type": "preprint", "title": "ReGIL: Retrieval-Guided Imitation Learning from a Single Demonstration", "abstract": "Learning robot manipulation policies with deep neural networks from a single demonstration remains highly challenging, as even small deviations from the demonstrated trajectory can quickly compound into failure, while collecting substantial online interaction data is costly. We propose ReGIL, a retrieval-guided imitation learning framework that treats a single demonstration as an external memory. ReGIL repeatedly queries this static memory throughout training to simultaneously guide exploration, generate the regularization buffer, and construct rewards. Specifically, it computes rewards through local temporal alignment between the current trajectory and the retrieved segment, providing step-wise and informative feedback for policy improvement. We evaluate ReGIL on robotic manipulation tasks from the LIBERO and Meta-World benchmarks under the single demonstration setting. ReGIL outperforms prior baselines in both success rate and training efficiency. In real-robot experiments, using only one demonstration and less than one hour of online training, ReGIL achieves over 75% success rate across three manipulation tasks with randomness in both initial robot pose and target position. These results demonstrate that leveraging the single demonstration as reusable memory can provide more than static supervision for efficient robot learning. More details can be found on our website: https://regil2026.github.io/", "authors": [ "Yuying Zhang", "Francesco Verdoja", "Wenyan Yang", "Ville Kyrki" ], "year": 2026, "published_date": "2026-06-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.09381v1", "pdf_url": "https://arxiv.org/pdf/2606.09381v1", "citations": 0, "topics": [], "tags": [ "AI Safety", "Robotics", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.24, "read_first_score": 5.08, "content_potential_score": 0.0, "interestingness_score": 1.62, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Learning robot manipulation policies with deep neural networks from a single demonstration remains highly challenging, as even small deviations from the demonstrated trajectory can quickly compound into failure, while collecting substantial online interaction data is costly. We propose ReGIL, a retrieval-guided imitation learning framework that treats a single demonstration as an external memory.", "key_contribution": "We propose ReGIL, a retrieval-guided imitation learning framework that treats a single demonstration as an external memory.", "why_it_matters": "ReGIL: Retrieval-Guided Imitation Learning from a Single Demonstration represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We propose ReGIL, a retrieval-guided imitation learning framework that treats a single demonstration as an external…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Safety.", "url": "http://arxiv.org/abs/2606.09381v1", "difficulty": "beginner" }, { "id": "arxiv:2602.12147", "source": "arxiv", "source_type": "preprint", "title": "It's TIME: Towards the Next Generation of Time Series Forecasting Benchmarks", "abstract": "Time series foundation models (TSFMs) are revolutionizing the forecasting landscape from specific dataset modeling to generalizable task evaluation. However, we contend that existing benchmarks exhibit common limitations in four dimensions: constrained data composition dominated by reused legacy sources, compromised data integrity lacking rigorous quality assurance, misaligned task formulations detached from real-world contexts, and rigid analysis perspectives that obscure generalizable insights. To bridge these gaps, we introduce TIME, a next-generation task-centric benchmark comprising 50 fresh datasets and 98 forecasting tasks, tailored for strict zero-shot TSFM evaluation free from data leakage. Integrating large language models and human expertise, we establish a human-in-the-loop benchmark construction pipeline to ensure high data integrity and redefine task formulation by aligning forecasting configurations with real-world operational requirements and variate predictability. Furthermore, we propose a novel pattern-level evaluation perspective that moves beyond traditional dataset-level evaluations based on static meta labels. By leveraging structural time series features to characterize intrinsic temporal properties, this approach offers generalizable insights into model capabilities across diverse patterns. We evaluate 12 TSFMs and establish a multi-granular leaderboard to facilitate in-depth analysis and visualized inspection. The leaderboard is available at https://huggingface.co/spaces/Real-TSF/TIME-leaderboard.", "authors": [ "Zhongzheng Qiao", "Sheng Pan", "Anni Wang", "Viktoriya Zhukova", "Yong Liu", "Xudong Jiang", "Qingsong Wen", "Mingsheng Long", "Ming Jin", "Chenghao Liu" ], "year": 2026, "published_date": "2026-06-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.12147", "pdf_url": "https://arxiv.org/pdf/2602.12147", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.24, "read_first_score": 6.23, "content_potential_score": 1.5, "interestingness_score": 2.37, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Time series foundation models (TSFMs) are revolutionizing the forecasting landscape from specific dataset modeling to generalizable task evaluation. However, we contend that existing benchmarks exhibit common limitations in four dimensions: constrained data composition dominated by reused legacy sources, compromised data integrity lacking rigorous quality assurance, misaligned task formulations detached from real-world contexts, and rigid analysis perspectives that obscure generalizable insights.", "key_contribution": "To bridge these gaps, we introduce TIME, a next-generation task-centric benchmark comprising 50 fresh datasets and 98 forecasting tasks, tailored for strict zero-shot TSFM evaluation free from data leakage.", "why_it_matters": "It's TIME: Towards the Next Generation of Time Series Forecasting Benchmarks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To bridge these gaps, we introduce TIME, a next-generation task-centric benchmark comprising 50 fresh datasets and 98…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2602.12147", "difficulty": "beginner" }, { "id": "arxiv:2606.03831v1", "source": "arxiv", "source_type": "preprint", "title": "Online Learning with Gradient-Variation Interval Regret", "abstract": "This paper investigates non-stationary online learning using the metric of interval regret, which requires an online algorithm to perform well over every time interval. We propose the first online learning algorithm that achieves an interval regret bound scaling with gradient variation, a fundamental measure of the cumulative change in online function gradients, which relates to various problem-dependent quantities and is closely connected to stochastic optimization and other problems. Our method employs a simple and efficient two-layer online ensemble structure that achieves strong theoretical guarantees. Specifically, it enjoys a regret bound that simultaneously adapts to various problem-dependent quantities while also preserving the minimax-optimal rate in the worst case. Moreover, recognizing the challenge of hyperparameter tuning, we introduce a Lipschitz- and smoothness-agnostic variant that automatically adapts to these potentially unknown constants. This is primarily enabled by a novel Lipschitz-adaptive meta algorithm, which may be of independent interest. Beyond interval regret, our method also yields broader implications: it provides versatile bounds for interval dynamic regret, a stronger measure that competes with changing comparators over any interval, and yields the first piecewise characterization for stochastic extended adversarial optimization. Theoretical findings are validated by experiments.", "authors": [ "Yan-Feng Xie", "Shuche Wang", "Peng Zhao", "Zhi-Hua Zhou" ], "year": 2026, "published_date": "2026-06-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.03831v1", "pdf_url": "https://arxiv.org/pdf/2606.03831v1", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses regret bound and related concepts.", "maturity_stage": "emerging", "paper_score": 3.24, "read_first_score": 4.55, "content_potential_score": 0.0, "interestingness_score": 1.62, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper investigates non-stationary online learning using the metric of interval regret, which requires an online algorithm to perform well over every time interval. We propose the first online learning algorithm that achieves an interval regret bound scaling with gradient variation, a fundamental measure of the cumulative change in online function gradients, which relates to various problem-dependent quantities and is closely connected to stochastic optimization and other problems.", "key_contribution": "We propose the first online learning algorithm that achieves an interval regret bound scaling with gradient variation, a fundamental measure of the cumulative change in online function gradients, which relates to various problem-dependent quantities and is closely connected to stochastic optimization and other problems.", "why_it_matters": "Online Learning with Gradient-Variation Interval Regret represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "We propose the first online learning algorithm that achieves an interval regret bound scaling with gradient variation,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Machine Learning.", "url": "http://arxiv.org/abs/2606.03831v1", "difficulty": "frontier" }, { "id": "arxiv:2606.01783", "source": "arxiv", "source_type": "preprint", "title": "Breaking the Information Silo: Semantic Personas for Cross-Domain Recommendation", "abstract": "Digital platforms increasingly operate as isolated information silos, limiting their ability to construct comprehensive user representations across domains. Cross-domain recommender systems seek to overcome this limitation by transferring knowledge from a source domain to a target domain, yet most existing approaches depend on shared users, shared items, or structurally similar interaction graphs. These assumptions are often unrealistic across independent platforms. We propose SPHERE (Semantic Personas for Heterogeneous cross-domain Recommendation), a design artifact that enables recommendation knowledge transfer across strictly disjoint domains with no shared users or items. Rather than aligning domains through identity or graph structure, SPHERE uses large language models to induce a shared behavioral vocabulary, generate structured semantic personas for users, and retrieve behaviorally similar source-domain communities that form a Community Source Persona. This semantic signal is integrated with collaborative signals through a dual-tower architecture and dynamic fusion gate, allowing SPHERE to augment standard recommender backbones. Empirical evaluation across Amazon Books, Goodreads, and Steam demonstrates consistent improvements over NCF, SVD++, and LightGCN baselines under full-ranking evaluation. The results show that cross-domain transfer effectiveness is not determined solely by semantic proximity between domains; rather, it depends critically on the structural density and native predictive strength of the target domain. The study contributes to information systems research by reframing cross-domain personalization as behavior-based semantic alignment, offering a practical mechanism for overcoming information silos while preserving interpretability and modularity.", "authors": [ "Jonathan Mayo", "Moshe Unger", "Konstantin Bauman" ], "year": 2026, "published_date": "2026-06-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.01783", "pdf_url": "https://arxiv.org/pdf/2606.01783", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "GNNs", "Interpretability", "Information Retrieval" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, GNNs) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.24, "read_first_score": 4.06, "content_potential_score": 1.55, "interestingness_score": 2.4, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Digital platforms increasingly operate as isolated information silos, limiting their ability to construct comprehensive user representations across domains. Cross-domain recommender systems seek to overcome this limitation by transferring knowledge from a source domain to a target domain, yet most existing approaches depend on shared users, shared items, or structurally similar interaction graphs.", "key_contribution": "We propose SPHERE (Semantic Personas for Heterogeneous cross-domain Recommendation), a design artifact that enables recommendation knowledge transfer across strictly disjoint domains with no shared users or items.", "why_it_matters": "Breaking the Information Silo: Semantic Personas for Cross-Domain Recommendation improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose SPHERE (Semantic Personas for Heterogeneous cross-domain Recommendation), a design artifact that enables…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.01783", "difficulty": "advanced" }, { "id": "arxiv:2510.05688", "source": "arxiv", "source_type": "preprint", "title": "vAttention: Verified Sparse Attention", "abstract": "State-of-the-art sparse attention methods for reducing decoding latency fall into two main categories: approximate top-$k$ (and its extension, top-$p$) and recently introduced sampling-based estimation. However, these approaches are fundamentally limited in their ability to approximate full attention: they fail to provide consistent approximations across heads and query vectors and, most critically, lack guarantees on approximation quality, limiting their practical deployment. We observe that top-$k$ and random sampling are complementary: top-$k$ performs well when attention scores are dominated by a few tokens, whereas random sampling provides better estimates when attention scores are relatively uniform. Building on this insight and leveraging the statistical guarantees of sampling, we introduce vAttention, the first practical sparse attention mechanism with user-specified $(ε, δ)$ guarantees on approximation accuracy (thus, \"verified\"). These guarantees make vAttention a compelling step toward practical, reliable deployment of sparse attention at scale. By unifying top-$k$ and sampling, vAttention outperforms both individually, delivering a superior quality-efficiency trade-off. Our experiments show that vAttention significantly improves the quality of sparse attention (e.g., $\\sim$4.5 percentage points for Llama 3.1 8B Instruct and DeepSeek-R1-Distill-Llama-8B on RULER-HARD), and effectively bridges the gap between full and sparse attention (e.g., across datasets, it matches full model quality with up to 20x sparsity). We also demonstrate that it can be deployed in reasoning scenarios to achieve fast decoding without compromising model quality (e.g., vAttention achieves full model quality on AIME2024 at 10x sparsity with up to 32K token generations). Code: https://github.com/skylight-org/sparse-attention-hub. Webpage: https://sky-light.eecs.berkeley.edu.", "authors": [ "Aditya Desai", "Kumar Krishna Agrawal", "Shuo Yang", "Alejandro Cuadron", "Luis Gaspar Schroeder", "Matei Zaharia", "Joseph E. Gonzalez", "Ion Stoica" ], "year": 2026, "published_date": "2026-05-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.05688", "pdf_url": "https://arxiv.org/pdf/2510.05688", "citations": 0, "topics": [], "tags": [ "Reasoning", "Transformers", "Machine Learning", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.24, "read_first_score": 5.23, "content_potential_score": 1.84, "interestingness_score": 2.54, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "State-of-the-art sparse attention methods for reducing decoding latency fall into two main categories: approximate top-$k$ (and its extension, top-$p$) and recently introduced sampling-based estimation. However, these approaches are fundamentally limited in their ability to approximate full attention: they fail to provide consistent approximations across heads and query vectors and, most critically, lack guarantees on approximation quality, limiting their practical deployment.", "key_contribution": "Building on this insight and leveraging the statistical guarantees of sampling, we introduce vAttention, the first practical sparse attention mechanism with user-specified $(ε, δ)$ guarantees on approximation accuracy (thus, \"verified\").", "why_it_matters": "vAttention: Verified Sparse Attention represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Building on this insight and leveraging the statistical guarantees of sampling, we introduce vAttention, the first…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2510.05688", "difficulty": "intermediate" }, { "id": "arxiv:2605.21715", "source": "arxiv", "source_type": "preprint", "title": "Throughput-Optimal Multiresource-Job Scheduling with Continuous Requirement Distribution", "abstract": "Modern computing systems process jobs with resource requirements such as CPU and memory, which are described by multiresource jobs (MRJ) queueing models. In practice, job resource requirements are spread out over so many values, that it is rare to see the same value twice. This pattern is best modeled by a continuous distribution of requirement values. However, the existing theoretical work on stability or throughput-optimality focuses on queueing models with class-based resource requirements. In class-based models, the number of distinct resource requirements must be small to demonstrate strong empirical performance, making them a poor match for these practical systems. We introduce the first throughput-optimal family of scheduling policies for the continuous MRJ model, with both preemptive and nonpreemptive variants. We further introduce several efficient policy families, which remain throughput-optimal while considerably improving computational efficiency, under some distributional assumptions. We use a discretization approach, where we choose the discretization granularity based on the system load and the distribution of resource requirements. We validate the real-world applicability of our policies by comparing them against existing index-based policies on parametrized distributions and on datacenter trace data from the Google Borg scheduler, demonstrating state-of-the-art performance.", "authors": [ "Heyuan Yao", "Willow Kowalik", "Izzy Grosof" ], "year": 2026, "published_date": "2026-05-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.21715", "pdf_url": "https://arxiv.org/pdf/2605.21715", "citations": 0, "topics": [], "tags": [], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.24, "read_first_score": 4.48, "content_potential_score": 0.0, "interestingness_score": 1.62, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Modern computing systems process jobs with resource requirements such as CPU and memory, which are described by multiresource jobs (MRJ) queueing models. In practice, job resource requirements are spread out over so many values, that it is rare to see the same value twice.", "key_contribution": "In class-based models, the number of distinct resource requirements must be small to demonstrate strong empirical performance, making them a poor match for these practical systems.", "why_it_matters": "Throughput-Optimal Multiresource-Job Scheduling with Continuous Requirement Distribution represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "In class-based models, the number of distinct resource requirements must be small to demonstrate strong empirical…", "biggest_caveat": "bution of requirement values.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2605.21715", "difficulty": "intermediate" }, { "id": "arxiv:2609.04865", "source": "arxiv", "source_type": "preprint", "title": "CoSkill: Joint Reinforcement Learning of Reasoning and Meta-Skill Agents for Hierarchical Skill Evolution", "abstract": "Skill libraries improve the sample efficiency of agentic reinforcement learning (RL) by enabling large language model (LLM) agents to reuse procedural knowledge. Yet existing paradigms exhibit structural shortcomings: they either decouple skill evolution from policy optimization or instantiate meta-skills as fixed workflows. Both treat skills as passive objects to be managed, limiting the flexible evolution of skills and their co-adaptation with the reasoning agent. To address the limitations, we propose CoSkill, a unified multi-agent RL framework that recasts the static meta-skill workflow as a learnable Meta-Skill Agent and jointly trains it with a Reasoning Agent over a hierarchical skill library. By modeling the Reasoning and Meta-Skill Agents as a cooperative team sharing a single backbone, CoSkill enables end-to-end co-adaptation: the Reasoning Agent conditions its actions on a retrieved task skill and step skills selected from its child set, while its task performance guides the Meta-Skill Agent in refining those step skills. Experiments on ALFWorld and WebShop show that CoSkill substantially outperforms prior skill-based and RL baselines, achieving success rates of 98.4% and 90.6%, respectively (+3.5 and +6.2 pp). As shown in Figure 1, CoSkill achieves superior early-stage sample efficiency, asymptotic performance, and wall-clock efficiency. Our code is available at https://github.com/jinyuan-cookie/CoSkill.", "authors": [ "Jinyuan Feng", "Dongmin Li", "Yiqun Chen", "Yang Gao", "Xing Chen", "Huimu Wang", "Zhiqiang Pu" ], "year": 2026, "published_date": "2026-09-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.04865", "pdf_url": "https://arxiv.org/pdf/2609.04865", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "RL", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.23, "read_first_score": 3.92, "content_potential_score": 0.0, "interestingness_score": 1.61, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Skill libraries improve the sample efficiency of agentic reinforcement learning (RL) by enabling large language model (LLM) agents to reuse procedural knowledge. Yet existing paradigms exhibit structural shortcomings: they either decouple skill evolution from policy optimization or instantiate meta-skills as fixed workflows.", "key_contribution": "To address the limitations, we propose CoSkill, a unified multi-agent RL framework that recasts the static meta-skill workflow as a learnable Meta-Skill Agent and jointly trains it with a Reasoning Agent over a hierarchical skill library.", "why_it_matters": "CoSkill: Joint Reinforcement Learning of Reasoning and Meta-Skill Agents for Hierarchical Skill Evolution represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address the limitations, we propose CoSkill, a unified multi-agent RL framework that recasts the static meta-skill…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.04865", "difficulty": "advanced" }, { "id": "arxiv:2609.09511", "source": "arxiv", "source_type": "preprint", "title": "Adaptive Distributed Physical-Layer Authentication and Attack Detection in 6G Non-Terrestrial Networks via Causal Meta-Learning", "abstract": "Physical-layer authentication (PLA) in non-terrestrial networks (NTNs) is challenged by severe Doppler shifts, long delays, and fast channel variations, which cause distribution shifts and degrade conventional learning methods. Existing PLA schemes often rely on single features or generalize poorly to unseen environments. This paper proposes a secure adaptive framework for authentication in multi-zone networks (SAFA-MZ), a causal meta-learning framework for distributed PLA (DPLA) in NTNs. First, we design a multi-feature fingerprint that combines spatial, angular, combiner, subspace, and Doppler-delay features. The fingerprint is adaptive and distributed, as it fuses heterogeneous physical-layer features and measurements from multiple aerial nodes. Second, we formulate a structural causal model (SCM) to capture the relations among design choices, environmental factors, extracted features, and authentication outcomes. Third, we develop a model-agnostic meta-learning (MAML) strategy with invariant risk minimization (IRM) and causal consistency regularization for fast adaptation to unseen NTN environments with few labeled samples. Fourth, we propose a two-stage authentication scheme that performs local recognition and activates time-difference-of-arrival (TDOA) localization with a graph attention (GAT) network only when needed, which reduces backhaul overhead. Simulations show that SAFA-MZ achieves 92% accuracy and 96% AUC, outperforming centralized deep learning and single-feature baselines across diverse environments.", "authors": [ "Parsa Rajabi", "Mohammad Reza Abedi", "Nader Mokari", "Paeiz Azmi", "Halim Yanikomeroglu" ], "year": 2026, "published_date": "2026-09-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.09511", "pdf_url": "https://arxiv.org/pdf/2609.09511", "citations": 0, "topics": [], "tags": [ "Info Extraction", "GNNs", "Artificial Intelligence", "Cryptography & Security", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (GNNs) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.23, "read_first_score": 4.59, "content_potential_score": 0.0, "interestingness_score": 1.61, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Physical-layer authentication (PLA) in non-terrestrial networks (NTNs) is challenged by severe Doppler shifts, long delays, and fast channel variations, which cause distribution shifts and degrade conventional learning methods. Existing PLA schemes often rely on single features or generalize poorly to unseen environments.", "key_contribution": "Fourth, we propose a two-stage authentication scheme that performs local recognition and activates time-difference-of-arrival (TDOA) localization with a graph attention (GAT) network only when needed, which reduces backhaul overhead.", "why_it_matters": "Adaptive Distributed Physical-Layer Authentication and Attack Detection in 6G Non-Terrestrial Networks via Causal Meta-Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "Fourth, we propose a two-stage authentication scheme that performs local recognition and activates…", "biggest_caveat": "bution shifts and degrade conventional learning methods.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2609.09511", "difficulty": "advanced" }, { "id": "arxiv:2511.07885", "source": "arxiv", "source_type": "preprint", "title": "Intelligence per Watt: Measuring Intelligence Efficiency of Local AI", "abstract": "Large language model (LLM) queries are predominantly processed by frontier models in centralized cloud infrastructure. Demand growth strains this paradigm faster than providers can scale. Two advances create an opportunity to rethink it: small, local LMs (<=20B active parameters) now achieve competitive performance to frontier models on many tasks, and local accelerators (e.g., Apple M4 Max) can host these models at interactive latencies. This raises the question: can local inference viably redistribute demand from centralized infrastructure? This requires measuring both whether local LMs can accurately answer real-world queries and whether they can do so efficiently on power-constrained devices (e.g., laptops). We propose intelligence per watt (IPW), task accuracy per unit of power, as a unified metric for the capability and efficiency of local inference across model-accelerator configurations. We evaluate 20+ state-of-the-art local LMs, 8 hardware accelerators (local and cloud), and 1M real-world single-turn chat and reasoning queries. For each query, we measure accuracy (local LM win rate against frontier models), energy, latency, and power. We find three key results. First, local LMs successfully answer 88.7% of these queries, with accuracy varying by domain. Second, longitudinal analysis from 2023-2025 shows IPW improved 5.3x, driven by both algorithmic and accelerator advances, with locally-serviceable query coverage rising from 23.2% to 71.3%. Third, local accelerators achieve at least 1.4x lower IPW than cloud accelerators running identical models, revealing significant headroom for local accelerator optimization. These findings demonstrate that local inference can meaningfully redistribute demand from centralized infrastructure for a substantial subset of queries, with IPW serving as the critical metric for tracking this transition.", "authors": [ "Jon Saad-Falcon", "Avanika Narayan", "Hakki Orhun Akengin", "J. Wes Griffin", "Herumb Shandilya", "Adrian Gamarra Lafuente", "Medhya Goel", "Rebecca Joseph", "Shlok Natarajan", "Etash Kumar Guha", "Shang Zhu", "Ben Athiwaratkun", "John Hennessy", "Azalia Mirhoseini", "Christopher Ré" ], "year": 2026, "published_date": "2026-05-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.07885", "pdf_url": "https://arxiv.org/pdf/2511.07885", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Artificial Intelligence", "Distributed Computing", "NLP" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.23, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.12, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language model (LLM) queries are predominantly processed by frontier models in centralized cloud infrastructure. Demand growth strains this paradigm faster than providers can scale.", "key_contribution": "Two advances create an opportunity to rethink it: small, local LMs (<=20B active parameters) now achieve competitive performance to frontier models on many tasks, and local accelerators (e.g., Apple M4 Max) can host these models at interactive latencies.", "why_it_matters": "Intelligence per Watt: Measuring Intelligence Efficiency of Local AI represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Two advances create an opportunity to rethink it: small, local LMs (<=20B active parameters) now achieve competitive…", "biggest_caveat": "bute demand from centralized infrastructure?", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2511.07885", "difficulty": "intermediate" }, { "id": "arxiv:2606.20411", "source": "arxiv", "source_type": "preprint", "title": "Direct Advantage Estimation for Scalable and Sample-efficient Deep Reinforcement Learning", "abstract": "Direct Advantage Estimation (DAE) has been shown to improve the sample efficiency of deep reinforcement learning algorithms. However, its reliance on full environment observability limits its applicability in realistic settings, and its requirement to model transition probabilities incurs substantial computational overhead for high-dimensional observations. In the present work, we address both limitations. First, we extend the theoretical framework of DAE to partially observable domains with minimal modifications. Second, we reduce its computational complexity by introducing discrete latent dynamics models that efficiently approximate transition probabilities. We evaluate our approach on the Arcade Learning Environment and find that DAE scales effectively with function approximator capacity while retaining high sample efficiency.", "authors": [ "Hsiao-Ru Pan", "Bernhard Schölkopf" ], "year": 2026, "published_date": "2026-06-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.20411", "pdf_url": "https://arxiv.org/pdf/2606.20411", "citations": 0, "topics": [], "tags": [ "RL", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.23, "read_first_score": 3.12, "content_potential_score": 1.0, "interestingness_score": 2.12, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Direct Advantage Estimation (DAE) has been shown to improve the sample efficiency of deep reinforcement learning algorithms. However, its reliance on full environment observability limits its applicability in realistic settings, and its requirement to model transition probabilities incurs substantial computational overhead for high-dimensional observations.", "key_contribution": "In the present work, we address both limitations.", "why_it_matters": "Direct Advantage Estimation for Scalable and Sample-efficient Deep Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "In the present work, we address both limitations.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2606.20411", "difficulty": "advanced" }, { "id": "arxiv:2605.03142", "source": "arxiv", "source_type": "preprint", "title": "MARS-DA: A Hierarchical Reinforcement Learning Framework for Risk-Aware Multi-Agent Bidding in Power Grids", "abstract": "The increasing penetration of renewable energy has introduced substantial volatility into wholesale electricity markets, complicating the optimal bidding strategies for power producers. Traditional Reinforcement Learning (RL) approaches often struggle to balance profit maximization with risk management, frequently overfitting to specific market conditions or failing to account for the stochastic spread between Day-Ahead (DA) and Real-Time (RT) settlements. To address these challenges, this paper makes two primary contributions. First, we introduce and open-source a high-fidelity gymnasium environment for two-settlement electricity market bidding. Grounded in extensive empirical data from the PJM Interconnection, the environment explicitly models the interplay between DA commitments and RT deviations, providing a standardized testbed for general and risk-sensitive agents. Second, we propose MARS-DA (Multi-Agent Regime-Switching for Day-Ahead markets), a novel hierarchical framework that orchestrates distinct sub-policies for risk management and profit seeking. MARS-DA utilizes a top-level Meta-Controller to dynamically blend the actions of two specialized base agents: a \"Safe Agent\" that optimizes for reliable DA allocation and a \"Speculator Agent\" that targets volatile RT arbitrage opportunities. Extensive experiments demonstrate that MARS-DA achieves superior risk-adjusted returns compared to state-of-the-art baselines while maintaining robust regime alignment during periods of extreme market volatility.", "authors": [ "Jiayi Chen", "Xuan Zhang", "Guiling Wang" ], "year": 2026, "published_date": "2026-05-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.03142", "pdf_url": "https://arxiv.org/pdf/2605.03142", "citations": 0, "topics": [], "tags": [ "AI Safety", "RL", "Multi-Agent Systems" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.23, "read_first_score": 4.06, "content_potential_score": 0.0, "interestingness_score": 1.61, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The increasing penetration of renewable energy has introduced substantial volatility into wholesale electricity markets, complicating the optimal bidding strategies for power producers. Traditional Reinforcement Learning (RL) approaches often struggle to balance profit maximization with risk management, frequently overfitting to specific market conditions or failing to account for the stochastic spread between Day-Ahead (DA) and Real-Time (RT) settlements.", "key_contribution": "First, we introduce and open-source a high-fidelity gymnasium environment for two-settlement electricity market bidding.", "why_it_matters": "MARS-DA: A Hierarchical Reinforcement Learning Framework for Risk-Aware Multi-Agent Bidding in Power Grids represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "First, we introduce and open-source a high-fidelity gymnasium environment for two-settlement electricity market bidding.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2605.03142", "difficulty": "frontier" }, { "id": "arxiv:2605.09350", "source": "arxiv", "source_type": "preprint", "title": "CHAINTRIX: A multi-pipeline LLM-augmented framework for automated smart-contract security auditing", "abstract": "Smart-contract exploits have caused billions of USD in cumulative losses, yet audits remain expensive and slow. Automated tools have emerged to close this gap, but each class has a characteristic failure mode. Static analyzers report findings that frequently fail manual triage at high rates, while large language models (LLMs) hallucinate findings that contradict the source code. Thus, we propose Chaintrix, an end-to-end auditing framework whose central architectural commitment is that every LLM-generated claim must be discharged against a deterministic structural contract representation. We introduce a Cross-Contract Interaction Model (CCIM) that parses Solidity into a structured map of function-level reads, writes, modifiers and resolved cross-contract calls. CCIM serves as the substrate against which all 12 of Chaintrix's deterministic signal engines and the parallel LLM audit pipelines operate. A staged false-positive-reduction pipeline, terminating in a Structural Verdict Engine (SVE) that applies deterministic structural checks against parsed code, filters the merged finding set, with selected high-confidence findings further validated through symbolic execution and fuzz testing. We evaluate Chaintrix on EVMbench, the smart-contract security benchmark by OpenAI, Paradigm, OtterSec. Chaintrix detects 86 of 120 high-severity vulnerabilities (71.7% recall), with 25 audits scoring 100% recall, placing Chaintrix 26 percentage points above the strongest frontier-model baseline.", "authors": [ "Gabriela Dobrita", "Simona-Vasilica Oprea", "Adela Bara" ], "year": 2026, "published_date": "2026-05-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.09350", "pdf_url": "https://arxiv.org/pdf/2605.09350", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.23, "read_first_score": 6.3, "content_potential_score": 1.5, "interestingness_score": 2.37, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Smart-contract exploits have caused billions of USD in cumulative losses, yet audits remain expensive and slow. Automated tools have emerged to close this gap, but each class has a characteristic failure mode.", "key_contribution": "Thus, we propose Chaintrix, an end-to-end auditing framework whose central architectural commitment is that every LLM-generated claim must be discharged against a deterministic structural contract representation.", "why_it_matters": "CHAINTRIX: A multi-pipeline LLM-augmented framework for automated smart-contract security auditing represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Thus, we propose Chaintrix, an end-to-end auditing framework whose central architectural commitment is that every…", "biggest_caveat": "but each class has a characteristic failure mode.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.09350", "difficulty": "beginner" }, { "id": "arxiv:2605.27382", "source": "arxiv", "source_type": "preprint", "title": "The Alignment Floor: How Persona Customization Breaks Safety in Weakly-Aligned LLMs", "abstract": "Telling an LLM to \"be enthusiastic\" raises its sycophancy rate from 30\\% to 50\\% on a lightly-aligned model, but has zero effect on a strongly-aligned one. We define this gap as the alignment floor, $Δ_{\\text{floor}}(m)=\\max_pS(m,p)-\\min_pS(m,p)$, the range of sycophancy rates a model produces across persona conditions, and treat sycophancy as a persona-conditional property rather than a fixed model property. Pluralistic AI relies on behavioral adaptation via persona prompts like \"be creative\" or \"be thorough\", which let systems respect diverse user values and communication styles; the safety question is how much customization a given model can absorb before its truthfulness shifts. We present a controlled case study contrasting a strongly-aligned RLHF + Constitutional-AI model (Claude Sonnet 4.6) with a more lightly-aligned model (Amazon Nova Lite), spanning seven persona conditions and five tasks for 1800 total runs. An existence-pair result motivates per-model auditing: there is at least one strongly-aligned model with $Δ_{\\text{floor}}=5$pp (within 5pp of the 15\\% control rate) and at least one lightly-aligned model with 45pp (5\\%--50\\% range). On the lightly-aligned model, all five Big Five personas increase sycophancy over control, and counterintuitively Agreeableness produces the smallest increase, not the largest. The single largest effect in the study is constructive: a Skeptic persona reduces sycophancy by 25pp on the lightly-aligned model, and is the only persona that instructs resistance against user claims rather than engagement with them, suggesting a directionality account. Cross-model transfer of persona effects is near-zero, so persona-alignment testing must be per-model. We propose $Δ_{\\text{floor}}$ as a deployment-time audit metric: measure it on a small persona panel before deploying persona customization.", "authors": [ "Xing Zhang", "Guanghui Wang", "Yanwei Cui", "Wei Qiu", "Ziyuan Li", "Bing Zhu", "Peiyang He" ], "year": 2026, "published_date": "2026-05-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.27382", "pdf_url": "https://arxiv.org/pdf/2605.27382", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "AI Safety", "Artificial Intelligence", "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.23, "read_first_score": 4.8, "content_potential_score": 1.0, "interestingness_score": 2.12, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Telling an LLM to \"be enthusiastic\" raises its sycophancy rate from 30\\% to 50\\% on a lightly-aligned model, but has zero effect on a strongly-aligned one. We define this gap as the alignment floor, $Δ_{\\text{floor}}(m)=\\max_pS(m,p)-\\min_pS(m,p)$, the range of sycophancy rates a model produces across persona conditions, and treat sycophancy as a persona-conditional property rather than a fixed model property.", "key_contribution": "We present a controlled case study contrasting a strongly-aligned RLHF + Constitutional-AI model (Claude Sonnet 4.6) with a more lightly-aligned model (Amazon Nova Lite), spanning seven persona conditions and five tasks for 1800 total runs.", "why_it_matters": "The Alignment Floor: How Persona Customization Breaks Safety in Weakly-Aligned LLMs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a controlled case study contrasting a strongly-aligned RLHF + Constitutional-AI model (Claude Sonnet 4.6)…", "biggest_caveat": "but has zero effect on a strongly-aligned one.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.27382", "difficulty": "advanced" }, { "id": "arxiv:2608.03745", "source": "arxiv", "source_type": "preprint", "title": "Risky Business: Measuring The Faithfulness-Safety Tension", "abstract": "Chain-of-Thought (CoT) reasoning offers a promising window into model monitoring. However, monitoring relies on faithfulness, i.e., the model output strictly derives from its reasoning trace. We identify an alignment tension where a model must be faithful enough to be monitored, yet robust enough to reject unsafe reasoning. We demonstrate that this counterbalance exists in current Large Reasoning Models (LRMs), and show ways in which it can be addressed. We introduce HazMart, a human-written dataset set in an autonomous AI shopkeeper scenario. Unlike prior work that relies on providing hints in prompts to test faithfulness (e.g., \"A Stanford professor said it should be Answer A\"), we propose a novel replacement-based technique, which we call Targeted Reasoning Replacement (TRR), that directly intervenes in the reasoning chain to substitute in unsafe or illogical thoughts (e.g., \"Wait, the answer must be Option B [was Option A] because it is the most fitting\"). DeepSeek-R1-Llama-70B exhibits high faithfulness (97.5%) but fails to reject Unsafe Reasoning (12.3%), while QwQ-32B is more robust (73.9% safety) at the cost of lower faithfulness (74.7%). Mechanistic analyses of QwQ-32B reveal that these properties are represented by anti-correlated internal directions peaking at the action-commit token. Finally, we demonstrate that representation steering can independently amplify the safety direction, increasing safe behavior by 9 percentage points while maintaining base capabilities.", "authors": [ "Dominik Meier", "Luca Joshua Francis", "Marco Bernhard Kaiser", "Terry Ruas", "Jan Philip Wahle", "Bela Gipp" ], "year": 2026, "published_date": "2026-08-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.03745", "pdf_url": "https://arxiv.org/pdf/2608.03745", "citations": 0, "topics": [], "tags": [ "Reasoning", "Hallucination", "AI Safety", "Artificial Intelligence", "NLP" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.22, "read_first_score": 5.68, "content_potential_score": 1.5, "interestingness_score": 2.36, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Chain-of-Thought (CoT) reasoning offers a promising window into model monitoring. However, monitoring relies on faithfulness, i.e., the model output strictly derives from its reasoning trace.", "key_contribution": "We demonstrate that this counterbalance exists in current Large Reasoning Models (LRMs), and show ways in which it can be addressed.", "why_it_matters": "Risky Business: Measuring The Faithfulness-Safety Tension represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We demonstrate that this counterbalance exists in current Large Reasoning Models (LRMs), and show ways in which it can…", "biggest_caveat": "However, monitoring relies on faithfulness, i.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2608.03745", "difficulty": "advanced" }, { "id": "arxiv:2606.24966", "source": "arxiv", "source_type": "preprint", "title": "Learning Dynamical Systems from Multiple Sparse Datasets: A Hierarchical Bayesian Modeling Approach", "abstract": "Estimating parameters of dynamical systems from sparse, noisy, and irregularly sampled data is often severely ill-conditioned. When multiple related datasets are available, they provide additional information if the shared structure and variability are properly modeled. We propose a hierarchical Bayesian framework for probabilistic meta-learning in dynamical systems, modeling dataset-specific parameters as draws from a shared population distribution. A numerical ODE solver is embedded within gradient-based MCMC to enable efficient posterior inference of the shared population and dataset-specific parameter distribution. Experiments show improved predictive performance over unpooled methods, highlighting the potential for data-efficient system identification in settings with sparse data.", "authors": [ "Cristian Brugnara", "Lea Multerer", "Marco Forgione", "Laura Azzimonti" ], "year": 2026, "published_date": "2026-06-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.24966", "pdf_url": "https://arxiv.org/pdf/2606.24966", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.22, "read_first_score": 2.99, "content_potential_score": 1.5, "interestingness_score": 2.36, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Estimating parameters of dynamical systems from sparse, noisy, and irregularly sampled data is often severely ill-conditioned. When multiple related datasets are available, they provide additional information if the shared structure and variability are properly modeled.", "key_contribution": "We propose a hierarchical Bayesian framework for probabilistic meta-learning in dynamical systems, modeling dataset-specific parameters as draws from a shared population distribution.", "why_it_matters": "Learning Dynamical Systems from Multiple Sparse Datasets: A Hierarchical Bayesian Modeling Approach represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "We propose a hierarchical Bayesian framework for probabilistic meta-learning in dynamical systems, modeling…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Machine Learning.", "url": "https://arxiv.org/abs/2606.24966", "difficulty": "frontier" }, { "id": "arxiv:2608.11201", "source": "arxiv", "source_type": "preprint", "title": "VidForensics-M1: Meta-Detection Reinforcement Learning with Verifiable Temporal Grounding for AI-Generated Video Forensics", "abstract": "Recent advances in video generation models have significantly improved the realism of synthetic videos, blurring the boundary between generated and authentic content and raising concerns about misinformation. Existing MLLM-based detectors mainly rely on supervised fine-tuning or label-level reinforcement learning, where coarse supervision limits generalization to unseen scenarios and emerging video generators. To overcome these limitations, we are the first to introduce \\textbf{meta-detection} into AI-generated video detection, enabling reliable forgery detection by jointly optimizing predicted labels and supporting evidence within reinforcement learning. This paradigm requires reliable evidence signals and effective mechanisms to integrate them into label-level optimization. Textual rationales provide semantic descriptions of forgery artifacts, but their generation and verification depend on external models, making supervision vulnerable to hallucinations and semantic biases. In contrast, temporal grounding provides more objective and verifiable evidence, as manipulated intervals can be precisely controlled during forgery construction. Based on this insight, we propose an automated data construction pipeline that generates paired real-fake videos by replacing temporal segments with boundary-frame-conditioned video generation models. Furthermore, we introduce \\textbf{Evidence-Guided Reward Redistribution}, which performs evidence-aware credit assignment by redistributing rewards among label-correct responses according to evidence quality. This preserves reliable label supervision while encouraging detectors to acquire fine-grained and verifiable forgery localization capabilities. Extensive experiments demonstrate that \\textbf{VidForensics-M1} effectively leverages verifiable temporal evidence to achieve robust and generalizable AI-generated video detection.", "authors": [ "Bowei Liu", "Zheng Lu", "Yuhan Bian", "Xinchen Zhang", "Xingming Shui", "Yuesheng Huang", "Xuhuan Li", "Zihao Liu", "Yifan Yang", "Jun Zhou", "Xiu Li" ], "year": 2026, "published_date": "2026-08-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.11201", "pdf_url": "https://arxiv.org/pdf/2608.11201", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "Fine-Tuning", "Video AI", "RL" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.21, "read_first_score": 4.71, "content_potential_score": 0.55, "interestingness_score": 1.88, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent advances in video generation models have significantly improved the realism of synthetic videos, blurring the boundary between generated and authentic content and raising concerns about misinformation. Existing MLLM-based detectors mainly rely on supervised fine-tuning or label-level reinforcement learning, where coarse supervision limits generalization to unseen scenarios and emerging video generators.", "key_contribution": "To overcome these limitations, we are the first to introduce \\textbf{meta-detection} into AI-generated video detection, enabling reliable forgery detection by jointly optimizing predicted labels and supporting evidence within reinforcement learning.", "why_it_matters": "VidForensics-M1: Meta-Detection Reinforcement Learning with Verifiable Temporal Grounding for AI-Generated Video Forensics represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To overcome these limitations, we are the first to introduce \\textbf{meta-detection} into AI-generated video detection,…", "biggest_caveat": "but their generation and verification depend on external models, making supervision vulnerable to hallucinations and semantic biases.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.11201", "difficulty": "advanced" }, { "id": "arxiv:2607.04478", "source": "arxiv", "source_type": "preprint", "title": "PulmoSight-XAI: An Explainable Multi-View Attention Ensemble with Gradient Boosting Meta-Learning for Multi-Label Chest X-Ray Classification", "abstract": "Automated chest X-ray classification remains challenging due to severe class imbalance, co-occurring pathologies, and the loss of localized features in conventional architectures. To address these, we propose an explainable hierarchical multi-view ensemble framework for the robust classification of 14 thoracic pathologies. The framework employs view-specific training by independently modeling frontal and lateral radiographs using an ensemble of five complementary convolutional neural networks. Replacing global average pooling, a multi-scale feature fusion strategy augmented with Convolutional Block Attention Modules (CBAM) preserves fine-grained intermediate representations while emphasizing high-level pathology-specific semantic features. To mitigate positive-negative imbalance and varying inter-class difficulty, models are optimized using a novel hybrid objective combining Asymmetric Loss with Adaptive Focal Loss. Beyond simple probability averaging, the framework incorporates a hierarchical meta-learning strategy where test-time augmentation (TTA) predictions and cross-model uncertainty measures are integrated into Level-1 gradient-boosting meta-learners (XGBoost, LightGBM, and CatBoost), followed by Level-2 stacking with optimized alpha blending. Evaluated on a large-scale CheXpert-style dataset, the framework achieves state-of-the-art macro-average AUROC scores of 0.9319 for frontal and 0.9154 for lateral radiographs. Furthermore, comprehensive explainability analysis using seven post-hoc attribution techniques demonstrates strong anatomical consistency and clinically meaningful decision localization. By integrating architectural diversity, multi-scale attention, hierarchical meta-learning, and rigorous explainability, the proposed framework provides a transparent, highly accurate, and clinically practical computer-aided diagnosis system for thoracic disease classification.", "authors": [ "Moshiur Rahman", "Shafqat Alam", "Tasnia Binte Mamun" ], "year": 2026, "published_date": "2026-07-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.04478", "pdf_url": "https://arxiv.org/pdf/2607.04478", "citations": 0, "topics": [], "tags": [ "Biomedical AI", "Interpretability", "Artificial Intelligence", "Machine Learning", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.21, "read_first_score": 5.12, "content_potential_score": 2.34, "interestingness_score": 2.77, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Automated chest X-ray classification remains challenging due to severe class imbalance, co-occurring pathologies, and the loss of localized features in conventional architectures. To address these, we propose an explainable hierarchical multi-view ensemble framework for the robust classification of 14 thoracic pathologies.", "key_contribution": "To address these, we propose an explainable hierarchical multi-view ensemble framework for the robust classification of 14 thoracic pathologies.", "why_it_matters": "PulmoSight-XAI: An Explainable Multi-View Attention Ensemble with Gradient Boosting Meta-Learning for Multi-Label Chest X-Ray Classification advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Biomedical AI.", "one_line_takeaway": "To address these, we propose an explainable hierarchical multi-view ensemble framework for the robust classification of…", "biggest_caveat": "bution techniques demonstrates strong anatomical consistency and clinically meaningful decision localization.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Biomedical AI.", "url": "https://arxiv.org/abs/2607.04478", "difficulty": "intermediate" }, { "id": "arxiv:2607.00796", "source": "arxiv", "source_type": "preprint", "title": "Task-Relevant Representation Decoupling for Visual Reinforcement Learning Generalization", "abstract": "Visual Reinforcement Learning (VRL) has achieved considerable success in solving control tasks. However, generalizing learned policies to new environments remains a major challenge, as agents often overfit to task-irrelevant features in the training environment. To solve this problem, we introduce the concept of decoupling observations into task-relevant and task-irrelevant representations. Building on this idea, we propose a self-supervised Task-Relevant Representation Decoupling (T2RD) algorithm for VRL. This algorithm consists of three components: task-relevant representation consistency, cross-reconstruction, and cross-dynamic prediction. The first two components achieve the decoupling of content and style features, but the resulting content representations are not necessarily task-relevant. To further refine task-relevant features from content representations, we design the third component that introduces dynamic prediction. T2RD achieves State-Of-The-Art (SOTA) generalization performance and sample efficiency in the DeepMind Control Suite and Robotic Manipulation tasks.", "authors": [ "Jinwen Wang", "Youfang Lin", "Xiaobo Hu", "Qian Xu", "Shuo Wang", "Zhuo Chen", "Kai Lv" ], "year": 2026, "published_date": "2026-07-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.00796", "pdf_url": "https://arxiv.org/pdf/2607.00796", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "RL", "Robotics", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.21, "read_first_score": 4.14, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Visual Reinforcement Learning (VRL) has achieved considerable success in solving control tasks. However, generalizing learned policies to new environments remains a major challenge, as agents often overfit to task-irrelevant features in the training environment.", "key_contribution": "To solve this problem, we introduce the concept of decoupling observations into task-relevant and task-irrelevant representations.", "why_it_matters": "Task-Relevant Representation Decoupling for Visual Reinforcement Learning Generalization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "To solve this problem, we introduce the concept of decoupling observations into task-relevant and task-irrelevant…", "biggest_caveat": "but the resulting content representations are not necessarily task-relevant.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Self-Supervised.", "url": "https://arxiv.org/abs/2607.00796", "difficulty": "advanced" }, { "id": "arxiv:2606.28406", "source": "arxiv", "source_type": "preprint", "title": "Can AI Draw Science? A Benchmark for Evaluating Scientific Figure Generation by Text-to-Image and Multimodal Models", "abstract": "Text-to-image and multimodal generative models are increasingly used to produce scientific figures such as mechanism diagrams, experimental-design schematics, conceptual frameworks, and graphical abstracts. Yet existing image-generation benchmarks (e.g., GenEval, T2I-CompBench, DPG-Bench) evaluate natural images and measure compositionality, object counting, or photorealism. None of them measure what makes a generated scientific figure usable: correct and legible text labels, faithful depiction of entities and their relations, coherent diagrammatic structure, and adherence to disciplinary drawing conventions. We introduce SciDraw-Bench, a benchmark of 32 structured scientific-figure generation tasks spanning eight figure types and ten disciplines, where each task pairs a natural-language prompt with a machine-checkable specification of required labels, relations, components, conventions, and negative constraints. We propose a four-dimensional evaluation protocol: Text Fidelity (OCR-based label recall and character error rate), Semantic Correctness (vision-language-model judging against the specification), Structural Quality, and Convention Adherence, together with a meta-evaluation protocol and a preliminary inter-judge reliability analysis (human-rating validation is ongoing). We evaluate a domain-specific system, SciDraw AI, against representative general-purpose text-to-image models, and outline a code-to-figure baseline as a planned extension. In a pilot over all eight figure types, the domain-specific system substantially outperforms the general-purpose baselines on every dimension and figure type, with the largest gaps on semantic correctness and convention adherence; text fidelity remains the hardest dimension for all systems.", "authors": [ "Davie Chen" ], "year": 2026, "published_date": "2026-06-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.28406", "pdf_url": "https://arxiv.org/pdf/2606.28406", "citations": 0, "topics": [], "tags": [ "Multimodal", "Text-to-Image", "Document AI", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.21, "read_first_score": 6.38, "content_potential_score": 2.6, "interestingness_score": 2.91, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Text-to-image and multimodal generative models are increasingly used to produce scientific figures such as mechanism diagrams, experimental-design schematics, conceptual frameworks, and graphical abstracts. Yet existing image-generation benchmarks (e.g., GenEval, T2I-CompBench, DPG-Bench) evaluate natural images and measure compositionality, object counting, or photorealism.", "key_contribution": "We introduce SciDraw-Bench, a benchmark of 32 structured scientific-figure generation tasks spanning eight figure types and ten disciplines, where each task pairs a natural-language prompt with a machine-checkable specification of required labels, relations, components, conventions, and negative constraints.", "why_it_matters": "Can AI Draw Science? A Benchmark for Evaluating Scientific Figure Generation by Text-to-Image and Multimodal Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We introduce SciDraw-Bench, a benchmark of 32 structured scientific-figure generation tasks spanning eight figure types…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2606.28406", "difficulty": "beginner" }, { "id": "arxiv:2604.26649", "source": "arxiv", "source_type": "preprint", "title": "When to Retrieve During Reasoning: Adaptive Retrieval for Large Reasoning Models", "abstract": "Large reasoning models such as DeepSeek-R1 and OpenAI o1 generate extended chains of thought spanning thousands of tokens, yet their integration with retrieval-augmented generation (RAG) remains fundamentally misaligned. Current RAG systems optimize for providing context before reasoning begins, while reasoning models require evidence injection during multi-step inference chains. We introduce ReaLM-Retrieve, a reasoning-aware retrieval framework that addresses this mismatch through three key innovations: (1) a step-level uncertainty detector that identifies knowledge gaps at reasoning-step granularity rather than token or sentence level; (2) a retrieval intervention policy that learns when external evidence maximally benefits ongoing reasoning; and (3) an efficiency-optimized integration mechanism that reduces per-retrieval overhead by 3.2x compared to naive integration. Experiments on MuSiQue, HotpotQA, and 2WikiMultiHopQA demonstrate that ReaLM-Retrieve achieves on average 10.1% absolute improvement in answer F1 over standard RAG (range: 9.0-11.8% across the three benchmarks) while reducing retrieval calls by 47% compared to fixed-interval approaches like IRCoT (all improvements significant at p<0.01, paired bootstrap). On the challenging MuSiQue benchmark requiring 2-4 hop reasoning, our method achieves 71.2% F1 with an average of only 1.8 retrieval calls per question. Analysis shows that ReaLM-Retrieve also improves retrieval quality itself, achieving 81.3% Recall@5 with consistently higher precision and MRR than fixed-interval baselines on supporting evidence, establishing new state-of-the-art efficiency-accuracy trade-offs for reasoning-intensive retrieval tasks.", "authors": [ "Dongxin Guo", "Jikun Wu", "Siu Ming Yiu" ], "year": 2026, "published_date": "2026-04-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.26649", "pdf_url": "https://arxiv.org/pdf/2604.26649", "citations": 0, "topics": [], "tags": [ "Reasoning", "RAG", "Evaluation", "Artificial Intelligence", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.21, "read_first_score": 6.37, "content_potential_score": 1.5, "interestingness_score": 2.35, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large reasoning models such as DeepSeek-R1 and OpenAI o1 generate extended chains of thought spanning thousands of tokens, yet their integration with retrieval-augmented generation (RAG) remains fundamentally misaligned. Current RAG systems optimize for providing context before reasoning begins, while reasoning models require evidence injection during multi-step inference chains.", "key_contribution": "We introduce ReaLM-Retrieve, a reasoning-aware retrieval framework that addresses this mismatch through three key innovations: (1) a step-level uncertainty detector that identifies knowledge gaps at reasoning-step granularity rather than token or sentence level; (2) a retrieval intervention policy that learns when external evidence maximally benefits ongoing reasoning; and (3) an efficiency-optimized integration mechanism that reduces per-retrieval overhead by 3.2x compared to naive integration.", "why_it_matters": "When to Retrieve During Reasoning: Adaptive Retrieval for Large Reasoning Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We introduce ReaLM-Retrieve, a reasoning-aware retrieval framework that addresses this mismatch through three key…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2604.26649", "difficulty": "beginner" }, { "id": "arxiv:2604.17134", "source": "arxiv", "source_type": "preprint", "title": "RoIt-XMASA: Multi-Domain Multilingual Sentiment Analysis Dataset for Romanian and Italian", "abstract": "We present RoIt-XMASA, a multilingual dataset that extends the Cross-lingual Multi-domain Amazon Sentiment Analysis to Italian and Romanian, comprising 36,000 labeled reviews across three domains (books, movies, and music) and 202,141 unlabeled samples. To address cross-lingual and cross-domain challenges, we propose a multi-target adversarial training framework that employs loss reversal with meta-learned coefficients to dynamically balance sentiment discrimination with domain and language invariance. XLM-R achieves an F1-score of 66.23% with our approach, outperforming the baseline by 4.64%. Few-shot evaluation shows that Llama-3.1-8B achieves 58.43% F1-score, revealing a meaningful trade-off between the efficiency of prompting-based approaches and the higher performance of task-specific fine-tuning.", "authors": [ "Andrei-Marius Avram", "Aureliu Valentin Antonie", "Cosmin-Mircea Croitoru", "Vlad Andrei Muntean", "Dumitru-Clementin Cercel" ], "year": 2026, "published_date": "2026-05-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.17134", "pdf_url": "https://arxiv.org/pdf/2604.17134", "citations": 0, "topics": [], "tags": [ "Prompting", "Fine-Tuning", "Sentiment Analysis", "Adversarial", "NLP" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Uses adversarial training — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.21, "read_first_score": 4.58, "content_potential_score": 1.5, "interestingness_score": 2.35, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present RoIt-XMASA, a multilingual dataset that extends the Cross-lingual Multi-domain Amazon Sentiment Analysis to Italian and Romanian, comprising 36,000 labeled reviews across three domains (books, movies, and music) and 202,141 unlabeled samples. To address cross-lingual and cross-domain challenges, we propose a multi-target adversarial training framework that employs loss reversal with meta-learned coefficients to dynamically balance sentiment discrimination with domain and language invariance.", "key_contribution": "We present RoIt-XMASA, a multilingual dataset that extends the Cross-lingual Multi-domain Amazon Sentiment Analysis to Italian and Romanian, comprising 36,000 labeled reviews across three domains (books, movies, and music) and 202,141 unlabeled samples.", "why_it_matters": "RoIt-XMASA: Multi-Domain Multilingual Sentiment Analysis Dataset for Romanian and Italian represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We present RoIt-XMASA, a multilingual dataset that extends the Cross-lingual Multi-domain Amazon Sentiment Analysis to…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2604.17134", "difficulty": "advanced" }, { "id": "arxiv:2604.24763v1", "source": "arxiv", "source_type": "preprint", "title": "Tuna-2: Pixel Embeddings Beat Vision Encoders for Multimodal Understanding and Generation", "abstract": "Unified multimodal models typically rely on pretrained vision encoders and use separate visual representations for understanding and generation, creating misalignment between the two tasks and preventing fully end-to-end optimization from raw pixels. We introduce Tuna-2, a native unified multimodal model that performs visual understanding and generation directly based on pixel embeddings. Tuna-2 drastically simplifies the model architecture by employing simple patch embedding layers to encode visual input, completely discarding the modular vision encoder designs such as the VAE or the representation encoder. Experiments show that Tuna-2 achieves state-of-the-art performance in multimodal benchmarks, demonstrating that unified pixel-space modelling can fully compete with latent-space approaches for high-quality image generation. Moreover, while the encoder-based variant converges faster in early pretraining, Tuna-2's encoder-free design achieves stronger multimodal understanding at scale, particularly on tasks requiring fine-grained visual perception. These results show that pretrained vision encoders are not necessary for multimodal modelling, and end-to-end pixel-space learning offers a scalable path toward stronger visual representations for both generation and perception.", "authors": [ "Zhiheng Liu", "Weiming Ren", "Xiaoke Huang", "Shoufa Chen", "Tianhong Li", "Mengzhao Chen", "Yatai Ji", "Sen He", "Jonas Schult", "Belinda Zeng", "Tao Xiang", "Wenhu Chen", "Ping Luo", "Luke Zettlemoyer", "Yuren Cong" ], "year": 2026, "published_date": "2026-04-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.24763v1", "pdf_url": "https://arxiv.org/pdf/2604.24763v1", "citations": 0, "topics": [], "tags": [ "AI Safety", "Multimodal", "Text-to-Image", "Self-Supervised", "Evaluation" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.21, "read_first_score": 3.74, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Unified multimodal models typically rely on pretrained vision encoders and use separate visual representations for understanding and generation, creating misalignment between the two tasks and preventing fully end-to-end optimization from raw pixels. We introduce Tuna-2, a native unified multimodal model that performs visual understanding and generation directly based on pixel embeddings.", "key_contribution": "We introduce Tuna-2, a native unified multimodal model that performs visual understanding and generation directly based on pixel embeddings.", "why_it_matters": "Tuna-2: Pixel Embeddings Beat Vision Encoders for Multimodal Understanding and Generation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We introduce Tuna-2, a native unified multimodal model that performs visual understanding and generation directly based…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "http://arxiv.org/abs/2604.24763v1", "difficulty": "advanced" }, { "id": "arxiv:2609.25011", "source": "arxiv", "source_type": "preprint", "title": "A Kernel-Certified Verification of the Erdős-Mollin-Walsh Conjecture below $10^{14}$", "abstract": "Erdős problem 364 asks whether three consecutive powerful numbers exist, where $n$ is powerful if $p \\mid n$ implies $p^2 \\mid n$. Erdős (1976) and, independently, Mollin and Walsh (1986) conjectured that none do; the $abc$ conjecture implies at most finitely many. The conjecture remains open. We present the first verification of the conjecture at any finite bound that is checked end to end by a proof kernel: machine-checked theorems in Lean 4 establishing that no triple of consecutive powerful numbers exists below $10^{12}$ and below $10^{14}$, with the axiom footprint of both theorems being exactly {propext, Classical.choice, Quot.sound} -- no sorry, no native_decide, no trusted external computation. The statements are phrased in the byte-identical vocabulary of the google-deepmind/formal-conjectures formalization of the problem, and we prove abstractly that the open conjecture implies each bounded form, pinning the statement correspondence. The proof reduces the search to odd numbers via a mod-4 argument, represents every odd powerful number as $a^2 b^3$ with $a, b$ odd and $b$ squarefree, enumerates all odd powerful numbers by a fueled, kernel-reducible generator whose completeness is proved once and instantiated across 3,524 per-interval Boolean certificates, and eliminates the seven surviving distance-2 pairs (the members of OEIS A076445 below $10^{14}$) by explicit non-powerfulness witnesses. Every certificate's expected values are computed independently by a Python engine, so each kernel-checked equality doubles as a cross-implementation agreement. Total certified kernel time is roughly 46 CPU-hours. Larger uncertified computations exist (exhaustive to $10^{22}$; conditionally to about $7.38 \\times 10^{28}$); our contribution is not a computational record but the elimination of trusted enumeration code from the evidence chain.", "authors": [ "Ibrahim Mian", "Shayaan Siddique" ], "year": 2026, "published_date": "2026-07-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.25011", "pdf_url": "https://arxiv.org/pdf/2609.25011", "citations": 0, "topics": [], "tags": [], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.62, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Erdős problem 364 asks whether three consecutive powerful numbers exist, where $n$ is powerful if $p \\mid n$ implies $p^2 \\mid n$. Erdős (1976) and, independently, Mollin and Walsh (1986) conjectured that none do; the $abc$ conjecture implies at most finitely many.", "key_contribution": "We present the first verification of the conjecture at any finite bound that is checked end to end by a proof kernel: machine-checked theorems in Lean 4 establishing that no triple of consecutive powerful numbers exists below $10^{12}$ and below $10^{14}$, with the axiom footprint of both theorems being exactly {propext, Classical.choice, Quot.sound} -- no sorry, no native_decide, no trusted external computation.", "why_it_matters": "A Kernel-Certified Verification of the Erdős-Mollin-Walsh Conjecture below $10^{14}$ represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "We present the first verification of the conjecture at any finite bound that is checked end to end by a proof kernel:…", "biggest_caveat": "bution is not a computational record but the elimination of trusted enumeration code from the evidence chain.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2609.25011", "difficulty": "frontier" }, { "id": "arxiv:2607.21653", "source": "arxiv", "source_type": "preprint", "title": "Molt: A Scalable PyTorch-Native Training Framework for Agentic Reinforcement Learning", "abstract": "Agentic reinforcement learning requires infrastructure that researchers can modify without sacrificing model scale or control over agent execution. We present Molt, a lightweight PyTorch-native framework that combines trillion-parameter training with standard agent interfaces. Molt integrates four capabilities: a compact training implementation built on composable model parallelism; unified OpenAI and Anthropic interfaces with automatic trajectory segmentation after context compaction; fully asynchronous rollout and optimization; and distributed experience storage for long, multimodal trajectories. Existing agents retain their execution and context-management logic while a shared capture layer records generated tokens and behavior probabilities. Rollout workers place heavy experience payloads in Ray's object store, and trainer ranks retrieve their assigned experiences by reference, avoiding a centralized gather of the full rollout batch. The framework-owned RL implementation comprises approximately 9.2K Python code lines, and its rollout, weight-refit, and training-update path has executed end to end on a one-trillion-parameter policy. On a 35B multimodal mixture-of-experts workload, speculative decoding accelerates the generation stage by 5.14x, and optimizer offload reduces peak actor memory by 18.3 GB. Together, these results establish a compact training framework for agentic RL research at trillion-parameter scale.", "authors": [ "Jian Hu", "Huiying Li", "Hao Zhang", "Binfeng Xu", "Yifan Zhang", "Shaokun Zhang", "Hemil Desai", "Michael Demoret", "Pavlo Molchanov", "Jan Kautz", "Yi Dong" ], "year": 2026, "published_date": "2026-09-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.21653", "pdf_url": "https://arxiv.org/pdf/2607.21653", "citations": 0, "topics": [], "tags": [ "AI Agents", "Multimodal", "Info Extraction", "RL", "NLP" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.84, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agentic reinforcement learning requires infrastructure that researchers can modify without sacrificing model scale or control over agent execution. We present Molt, a lightweight PyTorch-native framework that combines trillion-parameter training with standard agent interfaces.", "key_contribution": "We present Molt, a lightweight PyTorch-native framework that combines trillion-parameter training with standard agent interfaces.", "why_it_matters": "Molt: A Scalable PyTorch-Native Training Framework for Agentic Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We present Molt, a lightweight PyTorch-native framework that combines trillion-parameter training with standard agent…", "biggest_caveat": "buted experience storage for long, multimodal trajectories.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2607.21653", "difficulty": "advanced" }, { "id": "arxiv:2606.20002", "source": "arxiv", "source_type": "preprint", "title": "Connect the Dots: Training LLMs for Long-Lifecycle Agents with Cross-Domain Generalization Via Reinforcement Learning", "abstract": "This work presents a general framework for training large language models (LLMs) to \"Connect the Dots\" (CoD), a meta-capability required by long-lifecycle agents: as an LLM-based AI agent gets deployed in an environment, it solves a long sequence of tasks while continuously exploring the environment, learning from its own experiences, and iteratively self-updating its context about the environment, thereby achieving progressively better performance on future tasks conditioned on the updated context. Major components of the CoD framework include: (1) algorithm design and infrastructure for end-to-end reinforcement learning (RL) with long rollout sequences interleaving solve-task and update-context episodes; (2) tasks and environments for incentivizing and eliciting the targeted meta-capability in LLMs during training, as well as for faithfully measuring progress during evaluation. We present proof-of-concept implementations of the CoD framework, including a GRPO-style RL algorithm with fine-grained credit assignment, as well as tasks and environments tailored to the targeted meta-capability (rather than domain-specific LLM capabilities or standard task-by-task RL). Empirical results validate the efficacy of end-to-end RL training in the CoD setting, and demonstrate the potential for out-of-distribution generalization -- within the training domains, across different domains, and from CoD to Ralph-loop settings -- of the elicited meta-capability. Our investigation of CoD connects several lines of prior works, and opens up new opportunities for advancing LLMs and AI agents. To facilitate further research and applications, we release our implementations at \\url{https://github.com/agentscope-ai/Trinity-RFT/tree/research/cod/examples/research_cod}.", "authors": [ "Yanxi Chen", "Weijie Shi", "Yuexiang Xie", "Boyi Hu", "Yaliang Li", "Bolin Ding", "Jingren Zhou" ], "year": 2026, "published_date": "2026-06-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.20002", "pdf_url": "https://arxiv.org/pdf/2606.20002", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "AI Agents", "NLP", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.25, "content_potential_score": 1.84, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This work presents a general framework for training large language models (LLMs) to \"Connect the Dots\" (CoD), a meta-capability required by long-lifecycle agents: as an LLM-based AI agent gets deployed in an environment, it solves a long sequence of tasks while continuously exploring the environment, learning from its own experiences, and iteratively self-updating its context about the environment, thereby achieving progressively better performance on future tasks conditioned on the updated context. Major components of the CoD framework include: (1) algorithm design and infrastructure for end-to-end reinforcement learning (RL) with long rollout sequences interleaving solve-task and update-context episodes; (2) tasks and environments for incentivizing and eliciting the targeted meta-capability in LLMs during training, as well as for faithfully measuring progress during evaluation.", "key_contribution": "We present proof-of-concept implementations of the CoD framework, including a GRPO-style RL algorithm with fine-grained credit assignment, as well as tasks and environments tailored to the targeted meta-capability (rather than domain-specific LLM capabilities or standard task-by-task RL).", "why_it_matters": "Connect the Dots: Training LLMs for Long-Lifecycle Agents with Cross-Domain Generalization Via Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present proof-of-concept implementations of the CoD framework, including a GRPO-style RL algorithm with fine-grained…", "biggest_caveat": "bution generalization -- within the training domains, across different domains, and from CoD to Ralph-loop settings -- of the elicited meta-capability.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.20002", "difficulty": "frontier" }, { "id": "arxiv:2607.07723", "source": "arxiv", "source_type": "preprint", "title": "Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods", "abstract": "This paper does not address the mathematical truth of P versus NP. Instead, it identifies a structural limitation of uniform proof-generation methods in the standard Turing model. The observation is model-theoretic: it concerns the interaction between semantic invariants and syntactic verification, not the provability of complexity statements. We formalise an admissible method as a generator-verifier pair that produces, for each program, a finite certificate establishing a semantic property. Admissibility forces the generator-verifier composition to behave uniformly with respect to the invariant being certified. In the standard model, such uniform semantic certification implicitly induces a decision procedure for the property. Rice's theorem shows that this implicit behaviour cannot be realised for non-trivial semantic invariants, revealing a structural constraint on formal certification. Understanding this requires a meta-computational perspective: the obstruction arises from the computational behaviour induced by certification, not from the complexity-theoretic status of the property. We apply this framework to two semantic invariants naturally associated with formal certification of P vs. NP and with cryptographic hardness assumptions (in particular, one-way functions). Both fall under the same limitation: no uniform admissible method can certify them in the standard model. A complete Coq formalisation is provided, capturing the extensional structure of admissible methods and the semantic-syntactic interaction underlying the result.", "authors": [ "Fabio F. G. Buono" ], "year": 2026, "published_date": "2026-07-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.07723", "pdf_url": "https://arxiv.org/pdf/2607.07723", "citations": 0, "topics": [], "tags": [], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.78, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper does not address the mathematical truth of P versus NP. Instead, it identifies a structural limitation of uniform proof-generation methods in the standard Turing model.", "key_contribution": "This paper does not address the mathematical truth of P versus NP.", "why_it_matters": "Limits of Uniform Certification in the Standard Turing Model -- Semantic Invariants and Admissible Methods represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "This paper does not address the mathematical truth of P versus NP.", "biggest_caveat": "does not address the mathematical truth of P versus NP.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2607.07723", "difficulty": "frontier" }, { "id": "arxiv:2609.22130", "source": "arxiv", "source_type": "preprint", "title": "Hierarchical Bayesian optimization of an aircraft-based multi-agent system-of-systems", "abstract": "Developing innovative system architectures increasingly relies on advanced modeling and optimization techniques to frame the architecting process and define the corresponding computational problems. For complex System-of-Systems (SoS), high-fidelity multiphysics and multidisciplinary simulations are essential for capturing detailed behaviors. However, their computational expense and the risk of evaluation failures make direct optimization challenging. To overcome these limitations, surrogate-based approaches, like Bayesian optimization, have emerged as effective tools for managing expensive, black-box simulation tasks. This work introduces a hierarchical Bayesian optimization framework that leverages Gaussian process meta-modeling to handle discrete architectural choices, conditional dependencies, and heterogeneous design variables inherent to SoS problems. Results show that the hierarchical formulation improves search efficiency and robustness compared to conventional surrogate-based methods, enabling the exploration of large and structurally diverse design spaces with limited simulation budgets. We apply the approach to an aircraft-based multi-agent system for wildfire suppression, a use case developed within the EU-funded COLOSSUS project that illustrates how SoS principles can coordinate heterogeneous aerial platforms with complementary roles, supporting both sustainable mobility and emergency response missions. Our framework provides a scalable methodology for SoS architecting and model exploration, offering transferable insights for applications in aviation, sustainable mobility, and resilience-oriented system design. By combining hierarchical representations with surrogate-based optimization, this work is among the first practical demonstrations of hierarchical Bayesian optimization applied to real-world SoS problems, advancing both methodology and practice.", "authors": [ "Paul Saves", "Thierry Lefebvre", "Nathalie Bartoli", "Jasper Bussemaker", "Nikolaos Kalliatakis", "Nabih Naeem", "Prajwal Prakasha" ], "year": 2026, "published_date": "2026-08-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.22130", "pdf_url": "https://arxiv.org/pdf/2609.22130", "citations": 0, "topics": [], "tags": [ "Multi-Agent Systems", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.55, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Developing innovative system architectures increasingly relies on advanced modeling and optimization techniques to frame the architecting process and define the corresponding computational problems. For complex System-of-Systems (SoS), high-fidelity multiphysics and multidisciplinary simulations are essential for capturing detailed behaviors.", "key_contribution": "Results show that the hierarchical formulation improves search efficiency and robustness compared to conventional surrogate-based methods, enabling the exploration of large and structurally diverse design spaces with limited simulation budgets.", "why_it_matters": "Hierarchical Bayesian optimization of an aircraft-based multi-agent system-of-systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multi-Agent Systems.", "one_line_takeaway": "Results show that the hierarchical formulation improves search efficiency and robustness compared to conventional…", "biggest_caveat": "However, their computational expense and the risk of evaluation failures make direct optimization challenging.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Multi-Agent Systems.", "url": "https://arxiv.org/abs/2609.22130", "difficulty": "frontier" }, { "id": "arxiv:2509.08494", "source": "arxiv", "source_type": "preprint", "title": "HumanAgencyBench: Scalable Evaluation of Human Agency Support in AI Assistants", "abstract": "As humans delegate more tasks and decisions to artificial intelligence (AI), we risk losing control of our individual and collective futures. Relatively simple algorithmic systems already steer human decision-making, such as social media feed algorithms that lead people to unintentionally and absent-mindedly scroll through engagement-optimized content. In this paper, we develop the idea of human agency by integrating philosophical and scientific theories of agency with AI-assisted evaluation methods: using large language models (LLMs) to simulate and validate user queries and to evaluate AI responses. We develop HumanAgencyBench (HAB), a scalable and adaptive diagnostic tool for six behaviors related to human agency. HAB measures the tendency of an AI assistant to Ask Clarifying Questions, Avoid Value Manipulation, Correct Misinformation, Defer Important Decisions, Encourage Learning, and Maintain Social Boundaries. We find low-to-moderate agency support in contemporary LLM-based assistants, with substantial variation across system developers and behaviors. For example, while Anthropic LLMs most support human agency overall, they are the least supportive LLMs in terms of Avoid Value Manipulation. These behaviors do not appear to consistently result from increasing LLM capabilities or instruction-following (e.g., RLHF); we encourage further study of these behaviors so that developers and users can better understand the complexities of modern human-AI interaction.", "authors": [ "Benjamin Sturgeon", "Daniel Samuelson", "Jacob Haimes", "Jacy Reese Anthis" ], "year": 2026, "published_date": "2026-09-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.08494", "pdf_url": "https://arxiv.org/pdf/2509.08494", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "Robotics", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.94, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "As humans delegate more tasks and decisions to artificial intelligence (AI), we risk losing control of our individual and collective futures. Relatively simple algorithmic systems already steer human decision-making, such as social media feed algorithms that lead people to unintentionally and absent-mindedly scroll through engagement-optimized content.", "key_contribution": "As humans delegate more tasks and decisions to artificial intelligence (AI), we risk losing control of our individual and collective futures.", "why_it_matters": "HumanAgencyBench: Scalable Evaluation of Human Agency Support in AI Assistants represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "As humans delegate more tasks and decisions to artificial intelligence (AI), we risk losing control of our individual…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2509.08494", "difficulty": "advanced" }, { "id": "arxiv:2605.01928", "source": "arxiv", "source_type": "preprint", "title": "Training Non-Differentiable Networks via Optimal Transport", "abstract": "Neural networks increasingly embed non-differentiable components (spiking neurons, quantized layers, discrete routing, blackbox simulators, etc.) where backpropagation is inapplicable and surrogate gradients introduce bias. We present PolyStep, a gradient-free optimizer that updates parameters using only forward passes. Each step evaluates the loss at structured polytope vertices in a compressed subspace, computes softmax-weighted assignments over the resulting cost matrix, and displaces particles toward low-cost vertices via barycentric projection. This update corresponds to the one-sided limit of a regularized optimal-transport problem, inheriting its geometric structure without Sinkhorn iterations. PolyStep trains genuinely non-differentiable models where existing gradient-free methods collapse to near-random accuracy. On hard-LIF spiking networks we reach 93.4% test accuracy, outperforming all gradient-free baselines by over 60~pp and closing to within 4.4~pp of a surrogate-gradient Adam ceiling. Across four additional non-differentiable architectures (int8 quantization, argmax attention, staircase activations, hard MoE routing) we lead every gradient-free competitor. On MAX-SAT scaling from 100 to 1M variables, we sustain above 92% clause satisfaction while evolution strategies drop 8--12~pp. On RL policy search, we match OpenAI-ES on classical control and retain performance under integer and binary quantization that collapses gradient-based methods. We prove convergence to conservative-stationary points at rate $O(\\log T/\\sqrt{T})$ on piecewise-smooth losses, upgraded to Clarke-stationary on the headline architectures and extended to the piecewise-constant regime via a hitting-time bound. These rates match the known zeroth-order query-complexity lower bounds that all forward-only methods inherit. Code is available at https://github.com/anindex/polystep.", "authors": [ "An T. Le" ], "year": 2026, "published_date": "2026-05-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.01928", "pdf_url": "https://arxiv.org/pdf/2605.01928", "citations": 0, "topics": [], "tags": [ "MoE", "Model Compression", "Robotics", "Fairness & Ethics", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (MoE) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.59, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Neural networks increasingly embed non-differentiable components (spiking neurons, quantized layers, discrete routing, blackbox simulators, etc.) where backpropagation is inapplicable and surrogate gradients introduce bias. We present PolyStep, a gradient-free optimizer that updates parameters using only forward passes.", "key_contribution": "Neural networks increasingly embed non-differentiable components (spiking neurons, quantized layers, discrete routing, blackbox simulators, etc.) where backpropagation is inapplicable and surrogate gradients introduce bias.", "why_it_matters": "Training Non-Differentiable Networks via Optimal Transport represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about MoE.", "one_line_takeaway": "Neural networks increasingly embed non-differentiable components (spiking neurons, quantized layers, discrete routing,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in MoE.", "url": "https://arxiv.org/abs/2605.01928", "difficulty": "advanced" }, { "id": "arxiv:2608.23616", "source": "arxiv", "source_type": "preprint", "title": "Rebuild Dossier: Mechanically-Enforced Specs for Agentic App Rebuilds, and What Model-Tier Failures Reveal", "abstract": "An AI agent's rebuild is only as good as the process that produced it. Prior work found that once a model is strong enough, a multi-agent rebuild pipeline loses to the simplest approach: giving the model the original code and one instruction (AgentModernize). We present rebuild-dossier, an open-source tool that locks an application's real interface - its exact inputs and outputs - before any code is written, then enforces one-test-at-a-time building through automated checks, not written instructions alone. Three results shape this evaluation, with differing amounts of evidence. First, in a small comparison, the compliant agent failed a held-back test while the rule-breaking agent passed everything - proof that a passing suite doesn't certify correctness when tests can be gamed. Second, we tested whether this beats simply giving the weaker model the source and one instruction: tied on a small app, but lost outright on a larger one where the automated check wasn't even running - pointing to the check mechanism, not interface-locking, which held up separately. Third, every claim here is checked at three levels - the agent's own report, an automated log, and the actual files produced - catching real errors, including a bug in our own logging code, that a single level would have missed. These risks reproduce on a different model and toolchain: a stronger model followed our process three times running, something the weaker model never managed. The tool is public, MIT licensed, and reproduces end to end against our own applications.", "authors": [ "Parker Fawcett" ], "year": 2026, "published_date": "2026-08-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.23616", "pdf_url": "https://arxiv.org/pdf/2608.23616", "citations": 0, "topics": [], "tags": [ "AI Agents", "Artificial Intelligence", "Software Engineering" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.62, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "An AI agent's rebuild is only as good as the process that produced it. Prior work found that once a model is strong enough, a multi-agent rebuild pipeline loses to the simplest approach: giving the model the original code and one instruction (AgentModernize).", "key_contribution": "We present rebuild-dossier, an open-source tool that locks an application's real interface - its exact inputs and outputs - before any code is written, then enforces one-test-at-a-time building through automated checks, not written instructions alone.", "why_it_matters": "Rebuild Dossier: Mechanically-Enforced Specs for Agentic App Rebuilds, and What Model-Tier Failures Reveal represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We present rebuild-dossier, an open-source tool that locks an application's real interface - its exact inputs and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2608.23616", "difficulty": "frontier" }, { "id": "arxiv:2609.24991", "source": "arxiv", "source_type": "preprint", "title": "Who Pays for the KV Cache? Attributing Shared AI Inference Spend Across Kubernetes and LLM Provider Bills", "abstract": "Organizations pay for AI through disconnected ledgers: Kubernetes allocations for self-hosted inference, gateway logs, and per-token bills from API providers. We present unalloc, an open-source tool that joins OpenCost, LiteLLM, OpenAI and Anthropic cost data into one exact ledger and reports the share of spend with no owner, and use it to study where attribution breaks at the seams between these systems. Five case studies run inference for real or simulate it: a vLLM-style serving simulator with paged KV memory and prefix caching; a PyTorch transformer serving a multi-tenant trace with a real KV cache; tensor- and pipeline-parallel inference on torch.distributed; the unmodified CLI against mock provider APIs; and four downstream use cases. At the seams, in a constructed multi-pod deployment scenario -- one month of synthetic OpenCost allocations, not observed billing data -- owner labels set only on LeaderWorkerSet leader pods leave 66% of that deployment's GPU bill unowned, and the natural fallback key assigns 61% of it to a Helm chart name while the headline unallocated share falls to 4%; enabling every source double counts all gateway spend; and reading one page of a billing API reports a quarter of spend. Inside a shared inference server the metering rule decides who pays: on an NVIDIA H100 running vLLM, a token meter assigns a retrieval-heavy tenant 12-14 percentage points more of the bill than an equal time-share meter at every load tested, while GPU utilization reads 97-99% across configured loads of 2 to 16 requests per second (3.7 to 26.9 completed requests per second; the configured rate counts session-initial arrivals only) and power draw tracks load. Neither meter is a ground truth; we position these results against recent Shapley-based energy attribution. Code, raw data, captured evidence, figures and the paper regenerate from the repository.", "authors": [ "Timothy Urista" ], "year": 2026, "published_date": "2026-09-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.24991", "pdf_url": "https://arxiv.org/pdf/2609.24991", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Distributed Computing" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.23, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Organizations pay for AI through disconnected ledgers: Kubernetes allocations for self-hosted inference, gateway logs, and per-token bills from API providers. We present unalloc, an open-source tool that joins OpenCost, LiteLLM, OpenAI and Anthropic cost data into one exact ledger and reports the share of spend with no owner, and use it to study where attribution breaks at the seams between these systems.", "key_contribution": "We present unalloc, an open-source tool that joins OpenCost, LiteLLM, OpenAI and Anthropic cost data into one exact ledger and reports the share of spend with no owner, and use it to study where attribution breaks at the seams between these systems.", "why_it_matters": "Who Pays for the KV Cache? Attributing Shared AI Inference Spend Across Kubernetes and LLM Provider Bills represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present unalloc, an open-source tool that joins OpenCost, LiteLLM, OpenAI and Anthropic cost data into one exact…", "biggest_caveat": "bution breaks at the seams between these systems.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.24991", "difficulty": "intermediate" }, { "id": "arxiv:2609.21079", "source": "arxiv", "source_type": "preprint", "title": "DLB: Distributed Load Balancing at Scale for Generative AI Inference", "abstract": "The reliance on scarce and expensive accelerators such as GPUs and TPUs in modern datacenters places unprecedented demands on backend infrastructure. For workloads characterized by heterogeneous service times and complex multi-stage processing, such as Generative AI, conventional load balancing techniques are often inadequate, relying heavily on costly overprovisioning to maintain service level objectives. This paper introduces DLB, the Distributed Load Balancer, a novel system designed to minimize end-to-end user latency for large-scale, heterogeneous workloads. DLB employs a scalable, distributed design with peer-to-peer probing to maintain real-time visibility into server capacity across large-scale, geographically distributed infrastructure. The system continuously learns latency models to estimate the latency impact of routing decisions, allowing it to effectively manage heterogeneous hardware and diverse model architectures. We provide a novel theoretical analysis of our routing algorithms that establishes their stability and global performance guarantees over time. We also evaluate DLB through extensive simulations, which show substantial gains compared to state-of-the-art load balancing algorithms. Finally, following a 22-month deployment of DLB at Google, where it facilitates large-scale Generative AI inference for thousands of different machine learning models and millions of requests per second, we detail the design choices and practical experiences gained from the system in production. Analysis of production migrations demonstrates that DLB yields statistically significant latency reductions compared to the legacy baseline, including a 17\\% decrease in median latency and a 13\\% decrease at the p95 tail.", "authors": [ "Santiago R. Balseiro", "Bartek Wydrowski", "Sameer Agarwal", "David Applegate", "Aaron Archer", "Soheil Hassas Yeganeh", "Alex Iriza", "Bobby Kleinberg", "Balasubramanian Sivan", "Pranav Vaish", "Oscar Zegarra", "Wenxin Zhang", "Vahab Mirrokni", "Amin Vahdat" ], "year": 2026, "published_date": "2026-09-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.21079", "pdf_url": "https://arxiv.org/pdf/2609.21079", "citations": 0, "topics": [], "tags": [ "Distributed Computing", "Systems & Control" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.69, "content_potential_score": 1.84, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The reliance on scarce and expensive accelerators such as GPUs and TPUs in modern datacenters places unprecedented demands on backend infrastructure. For workloads characterized by heterogeneous service times and complex multi-stage processing, such as Generative AI, conventional load balancing techniques are often inadequate, relying heavily on costly overprovisioning to maintain service level objectives.", "key_contribution": "This paper introduces DLB, the Distributed Load Balancer, a novel system designed to minimize end-to-end user latency for large-scale, heterogeneous workloads.", "why_it_matters": "DLB: Distributed Load Balancing at Scale for Generative AI Inference represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Distributed Computing.", "one_line_takeaway": "This paper introduces DLB, the Distributed Load Balancer, a novel system designed to minimize end-to-end user latency…", "biggest_caveat": "buted Load Balancer, a novel system designed to minimize end-to-end user latency for large-scale, heterogeneous workloads.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Distributed Computing.", "url": "https://arxiv.org/abs/2609.21079", "difficulty": "intermediate" }, { "id": "arxiv:2503.15669", "source": "arxiv", "source_type": "preprint", "title": "ECO: An LLM-Driven Efficient Code Optimizer for Warehouse Scale Computers", "abstract": "This paper introduces ECO, a system that automatically modifies source code to improve performance at scale. ECO overcomes the localization problem by combining fleet-wide continuous profiling to identify performance-critical code with an embedding-based search to pinpoint specific optimization candidates, guided by a mined dictionary of performance anti-patterns. It overcomes the reliability problem through a multi-stage verification approach that uses automated testing, LLM-based self-review, and post-deployment monitoring to ensure changes are both correct and effective. Fully productionized and deployed within Google's hyperscale production fleet, ECO has successfully landed over 6,400 commits, changing more than 25,000 lines of production code. Incorrect changes are caught before they are submitted to production, and 99.5% of the submitted commits did not cause any rollbacks. These optimizations have resulted in savings equivalent to several hundred thousand normalized CPU cores, showing that ECO makes LLM-based optimization both practical at scale and highly impactful in real-world settings.", "authors": [ "Hannah Lin", "Martin Maas", "Maximilian Roquemore", "Arman Hasanzadeh", "Fred Lewis", "Yusuf Simonson", "Ameya Shringi", "Hongwen Dai", "Patrick Musau", "Tzu-Wei Yang", "Amir Yazdanbakhsh", "Deniz Altinbüken", "Florin Papa", "Maggie Nolan Edmonds", "Aditya Patil", "Don Schwarz", "Satish Chandra", "Chris Kennelly", "Milad Hashemi", "Parthasarathy Ranganathan" ], "year": 2026, "published_date": "2026-09-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2503.15669", "pdf_url": "https://arxiv.org/pdf/2503.15669", "citations": 0, "topics": [], "tags": [ "LLMs", "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.26, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper introduces ECO, a system that automatically modifies source code to improve performance at scale. ECO overcomes the localization problem by combining fleet-wide continuous profiling to identify performance-critical code with an embedding-based search to pinpoint specific optimization candidates, guided by a mined dictionary of performance anti-patterns.", "key_contribution": "This paper introduces ECO, a system that automatically modifies source code to improve performance at scale.", "why_it_matters": "ECO: An LLM-Driven Efficient Code Optimizer for Warehouse Scale Computers represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "This paper introduces ECO, a system that automatically modifies source code to improve performance at scale.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2503.15669", "difficulty": "intermediate" }, { "id": "arxiv:2606.20106", "source": "arxiv", "source_type": "preprint", "title": "Personalized Keyword Spotting for User-Defined Keywords Leveraging Text-Independent Speaker Verification", "abstract": "User-defined keyword spotting (UD-KWS) enables zero-shot wake-word detection from text, but existing systems learn speaker-invariant representations that cannot reject impostors uttering the correct keyword. We address this dual zero-shot setting -- unseen keywords and unseen speakers -- with ZP-KWS, a lightweight framework combining a phoneme-supervised audio encoder with a GE2E-pretrained compact speaker encoder (about 0.9M parameters). Multiplicative late fusion at inference grants each branch independent veto power, supporting modes from conventional detection to strict speaker-gated activation without retraining. On LibriPhrase, Google Speech Commands, and Qualcomm datasets, ZP-KWS reduces target-only FRR at 1% FAR by up to 60% relative to the strongest baseline while maintaining competitive keyword detection, all within a 1.55M parameter budget for edge deployment.", "authors": [ "Ming-Hsiang Hu", "Kuan-Tang Huang", "Chien-Chun Wang", "Hung-Shin Lee", "Berlin Chen" ], "year": 2026, "published_date": "2026-06-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.20106", "pdf_url": "https://arxiv.org/pdf/2606.20106", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.15, "content_potential_score": 1.84, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "User-defined keyword spotting (UD-KWS) enables zero-shot wake-word detection from text, but existing systems learn speaker-invariant representations that cannot reject impostors uttering the correct keyword. We address this dual zero-shot setting -- unseen keywords and unseen speakers -- with ZP-KWS, a lightweight framework combining a phoneme-supervised audio encoder with a GE2E-pretrained compact speaker encoder (about 0.9M parameters).", "key_contribution": "User-defined keyword spotting (UD-KWS) enables zero-shot wake-word detection from text, but existing systems learn speaker-invariant representations that cannot reject impostors uttering the correct keyword.", "why_it_matters": "Personalized Keyword Spotting for User-Defined Keywords Leveraging Text-Independent Speaker Verification represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "User-defined keyword spotting (UD-KWS) enables zero-shot wake-word detection from text, but existing systems learn…", "biggest_caveat": "but existing systems learn speaker-invariant representations that cannot reject impostors uttering the correct keyword.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2606.20106", "difficulty": "intermediate" }, { "id": "arxiv:2609.17181", "source": "arxiv", "source_type": "preprint", "title": "Multimodal Cultural Heritage Architectural Style Classification for Residential Buildings in the UAE Based on CLIP Embeddings and SVM", "abstract": "The analysis and classification of cultural heritage architectural styles remain challenging due to the complexity of visual images of buildings, which are highly relied on in traditional CNN-based classification approaches in comparison to textual descriptions, and the relative lack of non-western region-specific datasets. This paper addresses this gap by proposing a multimodal machine learning framework to analyze and classify Emirati residential architecture using OpenAI's CLIP model. We integrate visual features from images and textual features from expert descriptions into a unified 512-dimensional embedding, followed by dimensionality reduction with UMAP for visualization and unsupervised clustering using K-Means. Cluster labels, which are derived from manual analysis of the K-Means clusters, are used to train an SVM classifier for automated architectural style classification. Our approach achieves a classification accuracy of 98% across eight identified style clusters, higher than every other study in the literature, demonstrating the effectiveness of combining visual and textual modalities. Overall, this paper highlights the potential of using multimodal AI to support architectural heritage analysis, offering scalable and interpretable tools for exploring regional architectural identities.", "authors": [ "Ahmed Ammar Kubba", "Manar Abu Talib", "Iman Ibrahim", "Qassim Nasir" ], "year": 2026, "published_date": "2026-09-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.17181", "pdf_url": "https://arxiv.org/pdf/2609.17181", "citations": 0, "topics": [], "tags": [ "VLMs", "Interpretability", "Artificial Intelligence", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.4, "content_potential_score": 1.42, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The analysis and classification of cultural heritage architectural styles remain challenging due to the complexity of visual images of buildings, which are highly relied on in traditional CNN-based classification approaches in comparison to textual descriptions, and the relative lack of non-western region-specific datasets. This paper addresses this gap by proposing a multimodal machine learning framework to analyze and classify Emirati residential architecture using OpenAI's CLIP model.", "key_contribution": "The analysis and classification of cultural heritage architectural styles remain challenging due to the complexity of visual images of buildings, which are highly relied on in traditional CNN-based classification approaches in comparison to textual descriptions, and the relative lack of non-western region-specific datasets.", "why_it_matters": "Multimodal Cultural Heritage Architectural Style Classification for Residential Buildings in the UAE Based on CLIP Embeddings and SVM advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about VLMs.", "one_line_takeaway": "The analysis and classification of cultural heritage architectural styles remain challenging due to the complexity of…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in VLMs.", "url": "https://arxiv.org/abs/2609.17181", "difficulty": "intermediate" }, { "id": "arxiv:2609.14408", "source": "arxiv", "source_type": "preprint", "title": "Dynamic Learning Solutions: A System for Personalized Educational Video Generation", "abstract": "We present an automated pipeline that converts NCERT textbooks into interactive video explanations that respond directly to user queries. A user uploads a PDF and asks a question; the system then generates a video-based explanation as output, handling both text and visual elements from the PDF for multi-modal retrieval and response generation. The pipeline combines a Retrieval-Augmented Generation (RAG) model with generative multimedia components. The RAG stage is optimized for the structure of NCERT textbooks and performs best on content from those books. Given a user query, the RAG model retrieves relevant content from the PDF and generates a multi-scene script containing narrative explanations and structured visual prompts aligned with the textbook's explanatory style. These prompts are passed to a Stable Diffusion module, implemented layer by layer for interpretability and control, which generates contextually relevant images. The images are then processed by DynamiCrafter to produce animated sequences. Finally, a Google Text-to-Speech module generates synchronized narration, aligning speech with the visual scenes through time-based control. The result is a coherent video explanation integrating animation, narration, and textbook-aligned visuals, transforming static educational material into an engaging learning experience. By combining multi-modal document retrieval, generative visual models, animation frameworks, and speech synthesis, this pipeline demonstrates a scalable approach to delivering interactive, personalized digital education content.", "authors": [ "Siddhanth Sridhar", "Shreya Chaurasia", "Baddela Sai Yaswantha Reddy", "Deepak Parmar", "Shylaja S S" ], "year": 2026, "published_date": "2026-09-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.14408", "pdf_url": "https://arxiv.org/pdf/2609.14408", "citations": 0, "topics": [], "tags": [ "RAG", "Text-to-Image", "Video AI", "TTS", "Interpretability" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.58, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present an automated pipeline that converts NCERT textbooks into interactive video explanations that respond directly to user queries. A user uploads a PDF and asks a question; the system then generates a video-based explanation as output, handling both text and visual elements from the PDF for multi-modal retrieval and response generation.", "key_contribution": "We present an automated pipeline that converts NCERT textbooks into interactive video explanations that respond directly to user queries.", "why_it_matters": "Dynamic Learning Solutions: A System for Personalized Educational Video Generation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RAG.", "one_line_takeaway": "We present an automated pipeline that converts NCERT textbooks into interactive video explanations that respond…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in RAG.", "url": "https://arxiv.org/abs/2609.14408", "difficulty": "intermediate" }, { "id": "arxiv:2606.13535v1", "source": "arxiv", "source_type": "preprint", "title": "AgentRivet: an automated system for producing Rivet routines from journal publications", "abstract": "Particle physics collider experiments provide Rivet routines as part of the analysis preservation strategy for model-independent measurements. Rivet is a C++ toolkit that allow new theoretical models to be compared to the measurements, thus aiding the development and tuning of Monte Carlo event generators as well as searches for physics beyond the Standard Model. However, analysis coverage is known to be incomplete, with only 39% of measurements having documented and publicly available Rivet routines. In this article, we design and implement an automated workflow based on Large Language Models with the goal of providing the missing routines. This multi-step workflow, referred to as AgentRivet, extracts the physics analysis information from published papers and writes the missing Rivet routines, with intermediate code- and physics- reviews as part of an autonomous quality control. We report the results obtained using commercial Large Language Models, provided by OpenAI, Anthropic, and Google, for two recent measurements from the ATLAS and CMS experiments. We find that AgentRivet produces competent Rivet routines with few syntax errors. The physics fidelity of the routines is reasonable and follows the explanations given in the relevant publications. Nevertheless, physics-implementation issues do arise and are investigated using the artefacts produced by AgentRivet. The majority of physics implementation issues arise from subtle-but-ambiguous definitions in the given publication, although some models struggle to implement complex observables even when clear definitions are given.", "authors": [ "Antonio J. Costa", "Caterina Doglioni", "Christian Gütschow", "Andrew D. Pilkington", "Sukanya Sinha" ], "year": 2026, "published_date": "2026-06-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.13535v1", "pdf_url": "https://arxiv.org/pdf/2606.13535v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.99, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Particle physics collider experiments provide Rivet routines as part of the analysis preservation strategy for model-independent measurements. Rivet is a C++ toolkit that allow new theoretical models to be compared to the measurements, thus aiding the development and tuning of Monte Carlo event generators as well as searches for physics beyond the Standard Model.", "key_contribution": "Particle physics collider experiments provide Rivet routines as part of the analysis preservation strategy for model-independent measurements.", "why_it_matters": "AgentRivet: an automated system for producing Rivet routines from journal publications represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Particle physics collider experiments provide Rivet routines as part of the analysis preservation strategy for…", "biggest_caveat": "However, analysis coverage is known to be incomplete, with only 39% of measurements having documented and publicly available Rivet routines.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2606.13535v1", "difficulty": "intermediate" }, { "id": "arxiv:2609.09345", "source": "arxiv", "source_type": "preprint", "title": "Cross User/App Network Attacks - Hijacking TCP Connections and DNS Cache Poisoning via a Malicious User/App (Extended Version)", "abstract": "Off-path network attacks against TCP and DNS (over UDP) client-server connections are generally considered impractical nowadays, due to built-in security features in these protocols, e.g. randomized TCP (initial) sequence numbers and randomized UDP source ports, respectively. In this work, we refute this presumption by demonstrating that an unprivileged malicious application running on the client (but practically off-path), when combined with a remote off-path adversary, can enable powerful network attacks against such connections. We show how such a local--remote collaboration between the malicious application and a remote adversary allows inference of sensitive connection state, including TCP sequence numbers and DNS stub-resolver UDP source ports. Our attacks exploit standard socket API calls such as bind(), protocol mechanisms such as IP options, and operating system features such as cBPF and procfs to infer the TCP initial sequence number (ISN) and the UDP source port in use by the connection of interest. Specifically, we take advantage of certain properties of the ISN generation algorithm as implemented in major operating systems. We demonstrate TCP connection hijacking in Linux, Android, Windows, macOS and iOS, and DNS cache poisoning against Windows, Android and the popular systemd-resolved DNS stub resolver in Linux. We evaluate our techniques across multiple operating systems and realistic deployment settings, including environments behind port-preserving NAT-integrated routers. We disclosed our techniques to Microsoft, Apple, Linux and Google, which led to the release of several patches.", "authors": [ "Tamir Shahar", "Amit Klein" ], "year": 2026, "published_date": "2026-09-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.09345", "pdf_url": "https://arxiv.org/pdf/2609.09345", "citations": 0, "topics": [], "tags": [ "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.73, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Off-path network attacks against TCP and DNS (over UDP) client-server connections are generally considered impractical nowadays, due to built-in security features in these protocols, e.g. randomized TCP (initial) sequence numbers and randomized UDP source ports, respectively.", "key_contribution": "We show how such a local--remote collaboration between the malicious application and a remote adversary allows inference of sensitive connection state, including TCP sequence numbers and DNS stub-resolver UDP source ports.", "why_it_matters": "Cross User/App Network Attacks - Hijacking TCP Connections and DNS Cache Poisoning via a Malicious User/App (Extended Version) represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Cryptography & Security.", "one_line_takeaway": "We show how such a local--remote collaboration between the malicious application and a remote adversary allows…", "biggest_caveat": "but practically off-path), when combined with a remote off-path adversary, can enable powerful network attacks against such connections.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Cryptography & Security.", "url": "https://arxiv.org/abs/2609.09345", "difficulty": "intermediate" }, { "id": "arxiv:2609.05510", "source": "arxiv", "source_type": "preprint", "title": "Memory as Infrastructure: Reliability Engineering for Persistent Agent Memory in Months-Long LLM-Assisted Development", "abstract": "LLM coding agents are crossing from task-scale to project-scale: single assisted efforts that run for months, across repeated context compactions, on codebases far larger than any context window. We report operational experience from one such effort (a research project under a single continuous Claude Code session line since January 2026, driving a 633,000-line codebase, with its memory subsystem continuously instrumented since July 2026) and describe SIx Harness, the open-source memory and continuity infrastructure that emerged from keeping it coherent. The harness combines per-project long-term memory (hybrid lexical-vector retrieval over SQLite, fully local), precision-gated context injection, anti-recurrence stores for decisions and dead-ends, conventions engineered to survive compaction, and, the part we argue is missing from operational practice, reliability engineering for the memory subsystem itself: a session-start health gate with discriminated failure modes, heartbeat telemetry designed so that no enumerated failure mode can pass unrecorded, and alert-fatigue budgeting borrowed from SRE practice. We present what we believe is the first months-scale instrumented operational record of a persistent agent-memory subsystem in production development use: 78,933 hook invocations; 85 recorded failures, none silent: 84 in the subsystem's first three weeks, one since, none in the final 20 days; an injection layer whose ten-day precision instrument shows zero false fires against an intact denominator; and three production incidents traced from instrument reading to structural fix. From the record we distill seven design principles, state our limitations plainly (N=1, no control arm, self-reported), and publish a tagged pre-registered ablation protocol that any team can run with the released MIT-licensed kit.", "authors": [ "Mike Helwig" ], "year": 2026, "published_date": "2026-08-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.05510", "pdf_url": "https://arxiv.org/pdf/2609.05510", "citations": 0, "topics": [], "tags": [ "LLMs", "Long Context", "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.73, "content_potential_score": 1.84, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "LLM coding agents are crossing from task-scale to project-scale: single assisted efforts that run for months, across repeated context compactions, on codebases far larger than any context window. We report operational experience from one such effort (a research project under a single continuous Claude Code session line since January 2026, driving a 633,000-line codebase, with its memory subsystem continuously instrumented since July 2026) and describe SIx Harness, the open-source memory and continuity infrastructure that emerged from keeping it coherent.", "key_contribution": "We present what we believe is the first months-scale instrumented operational record of a persistent agent-memory subsystem in production development use: 78,933 hook invocations; 85 recorded failures, none silent: 84 in the subsystem's first three weeks, one since, none in the final 20 days; an injection layer whose ten-day precision instrument shows zero false fires against an intact denominator; and three production incidents traced from instrument reading to structural fix.", "why_it_matters": "Memory as Infrastructure: Reliability Engineering for Persistent Agent Memory in Months-Long LLM-Assisted Development represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present what we believe is the first months-scale instrumented operational record of a persistent agent-memory…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.05510", "difficulty": "intermediate" }, { "id": "arxiv:2609.07051", "source": "arxiv", "source_type": "preprint", "title": "TrojanWorld: Backdooring World-Model Agents via Imagination Steering", "abstract": "World models increasingly serve as the predictive core of model-based reinforcement learning agents, enabling them to simulate future dynamics and reason over imagined trajectories before acting. Their substantial training demands make pretrained world models attractive for distribution and reuse, exposing downstream systems to model supply chain threats. Backdoor attacks offer a targeted and stealthy means of exploiting such supply chains, yet their threat to interactive world-model agents remains largely unexplored. To fill this gap, we present TrojanWorld, a backdoor framework for world-model agents that induces attacker-specified behavior by steering internal imagination. A physical object placed in the scene acts as the trigger, enabling deployment-time activation through the agent's native observation pipeline without digitally manipulating the observation stream. To achieve effective, stealthy, and persistent control, TrojanWorld combines Decision-Reflective Induction to steer trigger-conditioned imagination toward attacker-specified actions using decision feedback, Clean Behavior Anchoring to preserve trigger-free predictive and behavioral fidelity, and Causal Propagation to sustain the induced preference along subsequent trajectories after the trigger disappears. Together, these mechanisms establish an end-to-end attack chain from physical perception through corrupted imagination to malicious action selection. Experiments with the TD-MPC2, DreamerV3, and R2-Dreamer systems across the DeepMind Control, MetaWorld, MyoSuite, and RoboDesk benchmarks show that under trigger activation, TrojanWorld achieves a target-action deviation as low as 0.026 while retaining at least 98.8% of the corresponding clean performance. Even after trigger removal, the compromised agent can remain trapped in the induced behavioral trajectory, continuing to execute attacker-specified actions.", "authors": [ "Wenkai Huang", "Siyuan Liang", "Gaolei Li", "Yiming Li", "Tianhao Peng", "Jianhua Li", "Dacheng Tao" ], "year": 2026, "published_date": "2026-09-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.07051", "pdf_url": "https://arxiv.org/pdf/2609.07051", "citations": 0, "topics": [], "tags": [ "RL", "Evaluation", "Machine Learning", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.33, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "World models increasingly serve as the predictive core of model-based reinforcement learning agents, enabling them to simulate future dynamics and reason over imagined trajectories before acting. Their substantial training demands make pretrained world models attractive for distribution and reuse, exposing downstream systems to model supply chain threats.", "key_contribution": "To fill this gap, we present TrojanWorld, a backdoor framework for world-model agents that induces attacker-specified behavior by steering internal imagination.", "why_it_matters": "TrojanWorld: Backdooring World-Model Agents via Imagination Steering represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "To fill this gap, we present TrojanWorld, a backdoor framework for world-model agents that induces attacker-specified…", "biggest_caveat": "bution and reuse, exposing downstream systems to model supply chain threats.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2609.07051", "difficulty": "beginner" }, { "id": "arxiv:2609.07969", "source": "arxiv", "source_type": "preprint", "title": "Geometric Function Atlas: certified computing for geometric function theory in Python", "abstract": "We describe geometric-function-atlas, our open-source Python package for the sharp extremal problems of geometric function theory. We organise it around a catalogue of thirty-nine Ma--Minda starlike generators. From this catalogue we compute exact Taylor coefficients, closed-form Fekete--Szegő constants, exact coefficients of the Ma--Minda extremal function, and admissibility screens. Our verifier answers membership questions for normalised polynomials at three levels of evidence: a floating-point grid screen, an exact sufficient condition decided in rational arithmetic, and a certified interval enclosure at the worst screened point. Every answer names the level at which we obtained it. We ship a checksummed artifact snapshot with three hundred and six coefficient certificates and seven hundred and two directed inclusion radii. Eight reviewed radius lanes carry certificates whose proof chains we replay symbolically, and we re-execute every coefficient certificate through our exact Schur-parameter machinery on request. We emit all results through one versioned envelope that records the method, the evidence status, the assumptions, and the artifact identifiers. Two optional laboratories apply the same discipline to cryptographic S-box metrics and to image-quality metrics. We present our design, state as propositions what each tier establishes, follow one radius lane from screen to replayed certificate, report measured timings, and place our package among symbolic-algebra, rigorous-numerics, and mathematical-database software. We release geometric-function-atlas under the MIT licence on the Python Package Index and at https://github.com/Prasanna28Devadiga/geometric-function-atlas.", "authors": [ "Kishan Gurumurthy", "Pushparaj Devadiga", "Prasanna Devadiga", "Arya Suneesh", "Asha Sebastian" ], "year": 2026, "published_date": "2026-09-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.07969", "pdf_url": "https://arxiv.org/pdf/2609.07969", "citations": 0, "topics": [], "tags": [], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.54, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We describe geometric-function-atlas, our open-source Python package for the sharp extremal problems of geometric function theory. We organise it around a catalogue of thirty-nine Ma--Minda starlike generators.", "key_contribution": "We present our design, state as propositions what each tier establishes, follow one radius lane from screen to replayed certificate, report measured timings, and place our package among symbolic-algebra, rigorous-numerics, and mathematical-database software.", "why_it_matters": "Geometric Function Atlas: certified computing for geometric function theory in Python represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "We present our design, state as propositions what each tier establishes, follow one radius lane from screen to replayed…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2609.07969", "difficulty": "frontier" }, { "id": "arxiv:2511.02192", "source": "arxiv", "source_type": "preprint", "title": "A Quantitative Comparison of Centralised and Distributed Reinforcement Learning-Based Control for Soft Robotic Arms", "abstract": "This paper presents a quantitative comparison between centralised and distributed multi-agent reinforcement learning (MARL) architectures for controlling a soft robotic arm modelled as a Cosserat rod in simulation. Using PyElastica and the OpenAI Gym interface, we train both a global Proximal Policy Optimisation (PPO) controller and a Multi-Agent PPO (MAPPO) under identical budgets. Both approaches are based on the arm having $n$ number of controlled sections. The study systematically varies $n$ and evaluates the performance of the arm to reach a fixed target in three scenarios: default baseline condition, recovery from external disturbance, and adaptation to actuator failure. Quantitative metrics used for the evaluation are mean action magnitude, mean final distance, mean episode length, and success rate. The results show that there are no significant benefits of the distributed policy when the number of controlled sections $n\\le4$. In very simple systems, when $n\\le2$, the centralised policy outperforms the distributed one. When $n$ increases to $4< n\\le 12$, the distributed policy shows a high sample efficiency. In these systems, distributed policy promotes a stronger success rate, resilience, and robustness under local observability and yields faster convergence given the same sample size. However, centralised policies achieve much higher time efficiency during training as it takes much less time to train the same size of samples. These findings highlight the trade-offs between centralised and distributed policy in reinforcement learning-based control for soft robotic systems and provide actionable design guidance for future sim-to-real transfer in soft rod-like manipulators.", "authors": [ "Linxin Hou", "Qirui Wu", "Zhihang Qin", "Neil Banerjee", "Yongxin Guo", "Cecilia Laschi" ], "year": 2026, "published_date": "2026-09-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.02192", "pdf_url": "https://arxiv.org/pdf/2511.02192", "citations": 0, "topics": [], "tags": [ "RL", "Robotics" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.12, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper presents a quantitative comparison between centralised and distributed multi-agent reinforcement learning (MARL) architectures for controlling a soft robotic arm modelled as a Cosserat rod in simulation. Using PyElastica and the OpenAI Gym interface, we train both a global Proximal Policy Optimisation (PPO) controller and a Multi-Agent PPO (MAPPO) under identical budgets.", "key_contribution": "The results show that there are no significant benefits of the distributed policy when the number of controlled sections $n\\le4$.", "why_it_matters": "A Quantitative Comparison of Centralised and Distributed Reinforcement Learning-Based Control for Soft Robotic Arms represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "The results show that there are no significant benefits of the distributed policy when the number of controlled…", "biggest_caveat": "buted multi-agent reinforcement learning (MARL) architectures for controlling a soft robotic arm modelled as a Cosserat rod in simulation.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2511.02192", "difficulty": "advanced" }, { "id": "arxiv:2609.03230", "source": "arxiv", "source_type": "preprint", "title": "Two Truths and A Lie? Benchmarking Off-the-Shelf LLMs for Requirements Quality Assessment: Performance, False Alarms, and Misses", "abstract": "Requirements engineering (RE) governs the quality of everything downstream in systems engineering (SE); defective requirements that survive review cycles propagate into design rework, schedule delays, and cost overruns. Because requirements are often written in natural language, recent advances in generative AI have raised expectations that large language models (LLMs) can absorb requirement quality assessment, a task otherwise slow and human expertise-intensive. Yet empirical evidence on whether LLMs can be trusted to do so remains scarce. This study presents the first benchmarking analysis of off-the-shelf LLM performance for requirement quality evaluation. Against an expert-derived ground truth built on INCOSE quality criteria, we evaluate ten models spanning two families (OpenAI and Anthropic) and five generations each, across one hundred independent runs, two requirement sets, and five sampling temperatures. Four contributions follow. First, we quantify a strongly asymmetric error profile: across all models and runs, the best-performing Anthropic model detects a median of only 47% of expert-identified issues while false-flagging 11%. Second, performance degrades significantly where SE judgment is required, as necessity and correctness issues are almost always missed. Third, generational progress is non-monotonic, so newer models cannot be assumed better. Fourth, this error behavior shifts only modestly and non-monotonically across sampling temperatures, indicating characteristic model deficiencies rather than inherent stochasticity. Off-the-shelf LLMs are therefore not yet trustworthy autonomous evaluators. Findings also warrant caution for Agentic AI developers: orchestrating these LLM modules in specialized architectures risks compounding these deficiencies rather than correcting them. Their defensible near-term role is human-in-the-loop decision support.", "authors": [ "Jannatul Shefa", "Alejandro Salado", "Paul Wach", "Taylan G. Topcu" ], "year": 2026, "published_date": "2026-09-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.03230", "pdf_url": "https://arxiv.org/pdf/2609.03230", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Evaluation", "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.65, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Requirements engineering (RE) governs the quality of everything downstream in systems engineering (SE); defective requirements that survive review cycles propagate into design rework, schedule delays, and cost overruns. Because requirements are often written in natural language, recent advances in generative AI have raised expectations that large language models (LLMs) can absorb requirement quality assessment, a task otherwise slow and human expertise-intensive.", "key_contribution": "Requirements engineering (RE) governs the quality of everything downstream in systems engineering (SE); defective requirements that survive review cycles propagate into design rework, schedule delays, and cost overruns.", "why_it_matters": "Two Truths and A Lie? Benchmarking Off-the-Shelf LLMs for Requirements Quality Assessment: Performance, False Alarms, and Misses represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Requirements engineering (RE) governs the quality of everything downstream in systems engineering (SE); defective…", "biggest_caveat": "butions follow.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.03230", "difficulty": "beginner" }, { "id": "arxiv:2609.03592", "source": "arxiv", "source_type": "preprint", "title": "Code Transformation Rule Synthesis using LLMs: Potential and Limits", "abstract": "Due to their black-box nature, LLMs suffer from limited explain- ability and a lack of determinism. Their usage cost can also rise, particularly with repetitive tasks on large codebases. To mitigate this, we conduct a novel empirical study targeting three domain- specific languages for transformation rules, namely Comby, GritQL, and Ast-Grep. We evaluate three LLMs (GPT-5.4, GPT-oss-120B, and Llama3.1-8B) on six diverse datasets covering four software- evolution tasks: API misuse correction, program repair, API migra- tion, and language version migration. Our results provide evidence that transformation rule synthesis moves beyond proof-of-concept with strong frontier models. GPT-5.4 achieves consistently high rule applicability rates and produces transformations closest to the ground truth across most benchmarks. Smaller and open-weight GPT-oss-120B and Llama3.1-8B models remain effective for simpler, localized changes but struggle with complex migration scenarios. We also observe non-negligible generalizability through the usage of meta-variables and through a high reuse score in the first quartile of many datasets. Finally, when compared to the anti-unification algorithm, LLMs outperform it in correctness, but underperform in rule applicability. Overall, our results show great potential for LLMs to generate sound, correct, generalizable, and reusable rules.", "authors": [ "Axel Allain", "Aymeric Blot", "Djamel Eddine Khelladi", "Mathieu Acher" ], "year": 2026, "published_date": "2026-09-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.03592", "pdf_url": "https://arxiv.org/pdf/2609.03592", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Software Engineering" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.69, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Due to their black-box nature, LLMs suffer from limited explain- ability and a lack of determinism. Their usage cost can also rise, particularly with repetitive tasks on large codebases.", "key_contribution": "To mitigate this, we conduct a novel empirical study targeting three domain- specific languages for transformation rules, namely Comby, GritQL, and Ast-Grep.", "why_it_matters": "Code Transformation Rule Synthesis using LLMs: Potential and Limits represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To mitigate this, we conduct a novel empirical study targeting three domain- specific languages for transformation…", "biggest_caveat": "but struggle with complex migration scenarios.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.03592", "difficulty": "frontier" }, { "id": "arxiv:2608.11166", "source": "arxiv", "source_type": "preprint", "title": "Agentic Configuration Management (ACM): A Reference Configuration Model for Governed Agentic Systems", "abstract": "Agentic systems are increasingly composed of heterogeneous agents, prompts, tools, models, skills, composite subsystems, policies, and execution workflows whose configurations evolve across frameworks and runtime environments. Existing LLMOps and AgentOps platforms support orchestration and observability but do not provide a common configuration-governance model for representing and governing these systems as coherent, versioned configurations. This paper introduces Agentic Configuration Management (ACM), a framework-independent governance and configuration reference model for heterogeneous agentic systems. ACM combines typed and independently versioned Agentic Configuration Items, immutable revisions and baselines, explicit configuration-runtime separation, lifecycle and assurance semantics, dependency-aware impact propagation, and runtime provenance. Heterogeneous native configurations are normalized through semantic projection into a canonical Configuration Graph on which common governance semantics operate. We provide a Python reference implementation with adapters for LangGraph, CrewAI, and the OpenAI Agents SDK. The evaluation combines 27 governance scenarios with nine quantitative impact-propagation cases. For the evaluated configurations, the three frameworks yield governance-equivalent ACM representations and reproducible governance outcomes after projection. The impact semantics are formalized as monotone propagation over a finite lattice, establishing convergence, termination, and uniqueness of the least fixed point above the initial impact valuation. These results provide evidence that common governance semantics can support reproducibility, auditability, dependency analysis, and interoperability across heterogeneous agentic execution abstractions within the evaluated scope.", "authors": [ "Audrey Quessada-Vial" ], "year": 2026, "published_date": "2026-08-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.11166", "pdf_url": "https://arxiv.org/pdf/2608.11166", "citations": 0, "topics": [], "tags": [ "AI Agents", "Software Engineering" ], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.58, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agentic systems are increasingly composed of heterogeneous agents, prompts, tools, models, skills, composite subsystems, policies, and execution workflows whose configurations evolve across frameworks and runtime environments. Existing LLMOps and AgentOps platforms support orchestration and observability but do not provide a common configuration-governance model for representing and governing these systems as coherent, versioned configurations.", "key_contribution": "Agentic systems are increasingly composed of heterogeneous agents, prompts, tools, models, skills, composite subsystems, policies, and execution workflows whose configurations evolve across frameworks and runtime environments.", "why_it_matters": "Agentic Configuration Management (ACM): A Reference Configuration Model for Governed Agentic Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "Agentic systems are increasingly composed of heterogeneous agents, prompts, tools, models, skills, composite…", "biggest_caveat": "but do not provide a common configuration-governance model for representing and governing these systems as coherent, versioned configurations.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2608.11166", "difficulty": "intermediate" }, { "id": "arxiv:2609.02145", "source": "arxiv", "source_type": "preprint", "title": "Online Non-Monotone DR-Submodular Maximization Matching the Offline $0.401$ Factor", "abstract": "We study online maximization of nonnegative, non-monotone DR-submodular functions over compact convex down-closed subsets of the $d$-dimensional unit cube. The best known constructive offline approximation factor is $0.401$ under the corresponding meta-solvability assumptions, whereas comparable adversarial online guarantees had remained at $1/e$. We show that this factor is also achievable online. In the post-decision full-information value-oracle model, our algorithm attains factor $0.401$ with sublinear approximate regret when oracle feedback is conditionally unbiased and bounded. The online algorithm does not run the offline construction on a changing objective. Instead, it replaces the offline objective-dependent box step by a weighted online learner that controls the required residual terms cumulatively. An exact asymmetric balance theorem preserves the offline coefficients despite adversarial variation. The direct implementation has $O(T^{3/4})$ regret and uses $O(dT^{1/4})$ oracle calls per round. More generally, for every $δ\\in[0,1/4]$, batching gives $O(T^δ)$ calls per round and $O(T^{4/5-δ/5})$ regret, including a one-call $O(T^{4/5})$ endpoint. Under a positive-anchor condition, randomized blocking retains factor $0.401$ with $O(T^{5/6})$ one-point bandit regret.", "authors": [ "Vaneet Aggarwal", "Yiyang Lu" ], "year": 2026, "published_date": "2026-09-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.02145", "pdf_url": "https://arxiv.org/pdf/2609.02145", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Fairness & Ethics", "Machine Learning", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.25, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We study online maximization of nonnegative, non-monotone DR-submodular functions over compact convex down-closed subsets of the $d$-dimensional unit cube. The best known constructive offline approximation factor is $0.401$ under the corresponding meta-solvability assumptions, whereas comparable adversarial online guarantees had remained at $1/e$.", "key_contribution": "We show that this factor is also achievable online.", "why_it_matters": "Online Non-Monotone DR-Submodular Maximization Matching the Offline $0.401$ Factor represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We show that this factor is also achievable online.", "biggest_caveat": "does not run the offline construction on a changing objective.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2609.02145", "difficulty": "frontier" }, { "id": "arxiv:2609.02227", "source": "arxiv", "source_type": "preprint", "title": "Towards Global Federated Genome-Wide Association Meta-Analysis Using GA4GH TES", "abstract": "Genome-wide association studies (GWAS) gain statistical power from large, ancestrally diverse cohorts, but privacy regulations and data-residency constraints often prevent genomic data from being centrally pooled across institutional or national borders. We present a privacy-preserving federated GWAS meta-analysis pipeline built on the APPFL framework, in which each site computes local GWAS summary statistics and transmits only aggregate results, never individual-level genotypes. Analysis is executed through a global network of Global Alliance for Genomics and Health (GA4GH) Task Execution Service (TES) endpoints, which allows computation to move to the data rather than the reverse. The server performs inverse-variance-weighted fixed-effect meta-analysis and returns aggregated results to all sites, while HiveWatch, our developed geographic observability toolkit, provides real-time monitoring of distributed task execution. In a five-site simulation over 100,000 synthetic individuals and roughly 240,000 variants for Type 2 Diabetes and Body Mass Index, the federated meta-analysis reproduces the association signal expected from a pooled analysis without centralizing any genotype data, showing that standards-based task execution and federated learning enables a practical privacy-preserving infrastructure for international GWAS meta-analysis.", "authors": [ "Abhijit Chunduru", "Matthew Joel", "Zilinghan Li", "Ravi Madduri" ], "year": 2026, "published_date": "2026-09-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.02227", "pdf_url": "https://arxiv.org/pdf/2609.02227", "citations": 0, "topics": [], "tags": [ "Federated Learning", "Biomedical AI", "Distributed Computing" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.79, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Genome-wide association studies (GWAS) gain statistical power from large, ancestrally diverse cohorts, but privacy regulations and data-residency constraints often prevent genomic data from being centrally pooled across institutional or national borders. We present a privacy-preserving federated GWAS meta-analysis pipeline built on the APPFL framework, in which each site computes local GWAS summary statistics and transmits only aggregate results, never individual-level genotypes.", "key_contribution": "We present a privacy-preserving federated GWAS meta-analysis pipeline built on the APPFL framework, in which each site computes local GWAS summary statistics and transmits only aggregate results, never individual-level genotypes.", "why_it_matters": "Towards Global Federated Genome-Wide Association Meta-Analysis Using GA4GH TES represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Federated Learning.", "one_line_takeaway": "We present a privacy-preserving federated GWAS meta-analysis pipeline built on the APPFL framework, in which each site…", "biggest_caveat": "but privacy regulations and data-residency constraints often prevent genomic data from being centrally pooled across institutional or national borders.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Federated Learning.", "url": "https://arxiv.org/abs/2609.02227", "difficulty": "advanced" }, { "id": "arxiv:2609.00050", "source": "arxiv", "source_type": "preprint", "title": "Towards Agentic Cloud Engineering: Graph and Loop Engineering with a Zero-Trust Agent Harness", "abstract": "Agentic AI is enabling cloud-based workflows in which autonomous agents reason over operational state, invoke authorized tools, modify software and infrastructure, deploy services, verify execution outcomes, and adapt across long-horizon, multistep tasks. Engineering such workflows requires explicit mechanisms for workflow progression, constrained execution, failure recovery, and verifiable completion. We present Agentic Cloud Workflow Engineering, an agentic AI framework that transforms natural-language agentic cloud-engineering tasks into validated code repositories and verified operational cloud deployments for automating cloud-based agentic workflows. The framework separates three complementary concerns: graph engineering specifies long-horizon workflow progression and verification-dependent transitions; loop engineering provides bounded diagnosis, repair or re-planning, retry, and re-verification; and agent harness engineering enforces zero-trust execution through identity, authorization, policy-scoped capabilities, isolation, and runtime safeguards. Workflow progression and completion require machine-checkable repository, deployment, and runtime evidence, with recovery constrained by explicit operational bounds and termination criteria. We instantiate the framework on Google Cloud and evaluate repository completeness, controlled execution, evidence-gated progression, operational deployment, and bounded recovery. Experimental results show that executions terminate with either a verified operational cloud deployment or an auditable terminal failure under bounded recovery. The framework provides a unified engineering architecture for cloud-based workflows spanning Agentic DevOps, Agentic CloudOps, Agentic SRE/AIOps, Agentic SecOps, Agentic DataOps, Agentic MLOps/LLMOps, AgentOps, Agentic RAG/GraphRAG, and related cloud-engineering domains.", "authors": [ "Sagar Srinivas Sakhinana", "Venkataramana Runkana" ], "year": 2026, "published_date": "2026-08-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.00050", "pdf_url": "https://arxiv.org/pdf/2609.00050", "citations": 0, "topics": [], "tags": [ "AI Agents", "RAG", "Artificial Intelligence", "Software Engineering", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.58, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agentic AI is enabling cloud-based workflows in which autonomous agents reason over operational state, invoke authorized tools, modify software and infrastructure, deploy services, verify execution outcomes, and adapt across long-horizon, multistep tasks. Engineering such workflows requires explicit mechanisms for workflow progression, constrained execution, failure recovery, and verifiable completion.", "key_contribution": "We present Agentic Cloud Workflow Engineering, an agentic AI framework that transforms natural-language agentic cloud-engineering tasks into validated code repositories and verified operational cloud deployments for automating cloud-based agentic workflows.", "why_it_matters": "Towards Agentic Cloud Engineering: Graph and Loop Engineering with a Zero-Trust Agent Harness represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We present Agentic Cloud Workflow Engineering, an agentic AI framework that transforms natural-language agentic…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2609.00050", "difficulty": "intermediate" }, { "id": "arxiv:2608.29615", "source": "arxiv", "source_type": "preprint", "title": "Forward-Deployed Full-Stack Engineering for Autonomous Cloud MLOps", "abstract": "Across industries, machine-learning systems support applications ranging from prediction and anomaly detection to forecasting, optimization, and scheduling, yet operationalizing these systems requires coordinating application development, model pipelines, cloud infrastructure, security, deployment, monitoring, retraining, recovery, and rollback. We present an evidence-gated multi-agent framework for transforming a natural-language MLOps cloud engineering task into a verified repository and operational cloud deployment. The framework combines graph engineering, loop engineering, and agent harness engineering. A stateful Graph Orchestrator coordinates specialized agents for repository generation, review, execution, verification, release, and monitoring while governing workflow dependencies, evidence gates, retry bounds, recovery paths, and termination. Consequential lifecycle transitions proceed only when their required predicates are supported by verifiable execution or runtime evidence. Verification failures activate bounded reflection, repair, and re-verification, while runtime evidence of failure, drift, degradation, or policy violation can trigger bounded adaptation, recovery, or rollback. Agent harness engineering constrains repository generation, review, and repair, artifact execution, and cloud operations through controlled capabilities and isolated execution environments. We realize the framework on Google Cloud Platform and evaluate repository completeness, controlled execution, evidence-gated transitions, cloud promotion, and bounded recovery. Our experimental results show that the framework prevents unsupported lifecycle transitions and drives each run toward either a verified operational deployment or an auditable terminal failure.", "authors": [ "Sagar Srinivas Sakhinana", "Venkataramana Runkana" ], "year": 2026, "published_date": "2026-08-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.29615", "pdf_url": "https://arxiv.org/pdf/2608.29615", "citations": 0, "topics": [], "tags": [ "AI Agents", "Artificial Intelligence", "Machine Learning", "Multi-Agent Systems" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.56, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Across industries, machine-learning systems support applications ranging from prediction and anomaly detection to forecasting, optimization, and scheduling, yet operationalizing these systems requires coordinating application development, model pipelines, cloud infrastructure, security, deployment, monitoring, retraining, recovery, and rollback. We present an evidence-gated multi-agent framework for transforming a natural-language MLOps cloud engineering task into a verified repository and operational cloud deployment.", "key_contribution": "We present an evidence-gated multi-agent framework for transforming a natural-language MLOps cloud engineering task into a verified repository and operational cloud deployment.", "why_it_matters": "Forward-Deployed Full-Stack Engineering for Autonomous Cloud MLOps represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We present an evidence-gated multi-agent framework for transforming a natural-language MLOps cloud engineering task…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2608.29615", "difficulty": "intermediate" }, { "id": "arxiv:2606.25647", "source": "arxiv", "source_type": "preprint", "title": "Retrieval-Grounded Multilingual LLM Assistance for Island Smallholder Farmers", "abstract": "Smallholder farming communities in remote, depopulating areas have limited access to agricultural advice, and their locally specific agronomic knowledge, often expressed in regional dialect, is poorly represented in the global corpora on which Large Language Models (LLMs) are trained. A general-purpose chatbot therefore answers fluently but unreliably, ungrounded in authoritative local data farmers can trust. This paper presents a conversational AI assistant, Falco eleonorae, embedded in a bilingual (Greek-primary, English-secondary) e-market platform serving farmers and cooperatives of a defined island area of interest. It is a thin Backend-for-Frontend (BFF) proxy in front of a geospatially-aware agronomic agent rather than a self-hosted model. Answer generation and tool selection are delegated to a managed upstream service on OpenAI GPT-5-family models, while one bounded task, describing an uploaded field photograph, is handled directly by a vision-capable model so only text reaches the agent, and voice input is transcribed by a managed EU streaming speech-to-text service. Grounding comes not from a self-hosted vector database but from tool-augmented retrieval: a Model Context Protocol (MCP) tool queries a curated, read-only, bilingual data interface exposing local crops, a seasonal calendar, traditional practices, a dialect glossary, products, agritourism experiences, cooperatives, and training content, each wrapped in a geospatial Well-Known Text envelope anchoring the agent to the area of interest. We detail its multilingual, voice, and image modalities, its progressive-web-application and accessibility design for low-bandwidth field use, and its security and data-protection posture, and argue that for a small, resource-constrained rural deployment a managed, grounded multilingual assistant is more attainable and trustworthy than a self-hosted model.", "authors": [ "Nikolaos D. Tantaroudas", "Ilias Karachalios", "Andrew J. McCracken" ], "year": 2026, "published_date": "2026-06-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.25647", "pdf_url": "https://arxiv.org/pdf/2606.25647", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "Dialogue" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.23, "content_potential_score": 1.55, "interestingness_score": 2.38, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Smallholder farming communities in remote, depopulating areas have limited access to agricultural advice, and their locally specific agronomic knowledge, often expressed in regional dialect, is poorly represented in the global corpora on which Large Language Models (LLMs) are trained. A general-purpose chatbot therefore answers fluently but unreliably, ungrounded in authoritative local data farmers can trust.", "key_contribution": "Smallholder farming communities in remote, depopulating areas have limited access to agricultural advice, and their locally specific agronomic knowledge, often expressed in regional dialect, is poorly represented in the global corpora on which Large Language Models (LLMs) are trained.", "why_it_matters": "Retrieval-Grounded Multilingual LLM Assistance for Island Smallholder Farmers represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Smallholder farming communities in remote, depopulating areas have limited access to agricultural advice, and their…", "biggest_caveat": "but unreliably, ungrounded in authoritative local data farmers can trust.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.25647", "difficulty": "intermediate" }, { "id": "arxiv:2608.26332", "source": "arxiv", "source_type": "preprint", "title": "Beyond Capability Benchmarks: Learning Operational Fingerprints of LLM Cloud Services from Production Incident Metadata", "abstract": "Managed LLM services are now part of real production systems, but model selection and service planning still rely heavily on capability benchmarks that reveal little about operational behavior after deployment. We present Operational Embedding (OpEmbed), a framework for learning compact operational fingerprints of LLM cloud services from structured, privacy-preserving support-case metadata, without using case text. OpEmbed aggregates model--time windows into an eight-channel operational signature and learns a low-dimensional representation via temporal contrastive learning, cross-view reconstruction, and generational-ordinality regularization. Evaluated on more than 33,000 production support cases spanning seven LLM families over 26 months at Google Cloud, OpEmbed recovers interpretable family- and version-level structure, improves leave-one-model-out operational forecasting over non-learned baselines, remains useful under limited early-window data, and supports cross-model fault-type transfer. We report the practical lessons learned from building and evaluating this tool for model onboarding, support readiness assessment, and operational monitoring.", "authors": [ "Meiwei Zhang", "Eduardo Miranda", "Bruce Baynes", "Suvigya Jain", "Wanlong Chen", "Tao He", "Sergey Borodavkin" ], "year": 2026, "published_date": "2026-08-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.26332", "pdf_url": "https://arxiv.org/pdf/2608.26332", "citations": 0, "topics": [], "tags": [ "LLMs", "Federated Learning", "Self-Supervised", "Interpretability", "Evaluation" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.57, "content_potential_score": 1.42, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Managed LLM services are now part of real production systems, but model selection and service planning still rely heavily on capability benchmarks that reveal little about operational behavior after deployment. We present Operational Embedding (OpEmbed), a framework for learning compact operational fingerprints of LLM cloud services from structured, privacy-preserving support-case metadata, without using case text.", "key_contribution": "We present Operational Embedding (OpEmbed), a framework for learning compact operational fingerprints of LLM cloud services from structured, privacy-preserving support-case metadata, without using case text.", "why_it_matters": "Beyond Capability Benchmarks: Learning Operational Fingerprints of LLM Cloud Services from Production Incident Metadata represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present Operational Embedding (OpEmbed), a framework for learning compact operational fingerprints of LLM cloud…", "biggest_caveat": "but model selection and service planning still rely heavily on capability benchmarks that reveal little about operational behavior after deployment.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.26332", "difficulty": "advanced" }, { "id": "arxiv:2608.23760", "source": "arxiv", "source_type": "preprint", "title": "Towards a Definition of the Computational Architecture of Open Scholarly Infrastructures", "abstract": "This paper proposes a layered framework for defining the architecture of the computational unit of an Open Scholarly Infrastructure (OSI) and presents a concrete implementation possibility through the introduction of OpenCitations, an OSI dedicated to publishing citation data and bibliographic metadata. Grounded in the Principles of Open Scholarly Infrastructure (POSI), the study focuses on the technical dimensions of openness, sustainability, interoperability, and reproducibility that are required for a robust OSI. The proposed approach first identifies the core principles and technical features that a computational block in an OSI should guarantee, including separation of operational domains, orchestration, scalability, observability, automation, and workflow portability. It then maps these requirements onto a layered architectural model composed of Hardware, Virtualization, Orchestration, and Application layers, complemented by a transversal Meta layer. The OpenCitations case study shows how this framework can be instantiated in practice through an on-premises infrastructure. The case is presented with details regarding the technicalities and actual implementations of the proposed methodology. By combining a conceptual definition with a real-world implementation, this work offers both a practical reference and a methodological basis for designing the computational block of an OSI.", "authors": [ "Ivan Heibi", "Mario Petrella", "Angelo Di Iorio", "Silvio Peroni" ], "year": 2026, "published_date": "2026-08-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.23760", "pdf_url": "https://arxiv.org/pdf/2608.23760", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.46, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper proposes a layered framework for defining the architecture of the computational unit of an Open Scholarly Infrastructure (OSI) and presents a concrete implementation possibility through the introduction of OpenCitations, an OSI dedicated to publishing citation data and bibliographic metadata. Grounded in the Principles of Open Scholarly Infrastructure (POSI), the study focuses on the technical dimensions of openness, sustainability, interoperability, and reproducibility that are required for a robust OSI.", "key_contribution": "This paper proposes a layered framework for defining the architecture of the computational unit of an Open Scholarly Infrastructure (OSI) and presents a concrete implementation possibility through the introduction of OpenCitations, an OSI dedicated to publishing citation data and bibliographic metadata.", "why_it_matters": "Towards a Definition of the Computational Architecture of Open Scholarly Infrastructures represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "This paper proposes a layered framework for defining the architecture of the computational unit of an Open Scholarly…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2608.23760", "difficulty": "intermediate" }, { "id": "arxiv:2608.23858", "source": "arxiv", "source_type": "preprint", "title": "Beyond the Mandate: A Systematic Security Analysis of the Agent Payments Protocol (AP2)", "abstract": "The Agent Payments Protocol (AP2), introduced by Google, enables large language model (LLM)-driven shopping agents to authorize and execute payments on behalf of users. Its signed Checkout and Payment Mandates protect the integrity of transaction data after signing. Agent interactions and external inputs that shape a transaction before authorization remain outside that protection, including Agent-to-Agent Protocol (A2A) messages and Model Context Protocol (MCP) tool calls. Prior work identified replay and prompt-injection attacks in AP2 v0.1. AP2 v0.2 addresses some of these issues but adds capabilities and deployment assumptions that require renewed analysis. We present a systematic security analysis of AP2 v0.2 based on its roles, transaction lifecycle, deployment architectures, and trust boundaries. We divide the lifecycle into five phases and identify five deployment architectures. Using MAESTRO (Multi-Agent Environment, Security, Threat, Risk, Outcome), we model four threat actors, eleven attack surfaces, eighteen adversary capabilities, and six attacker goals. The resulting catalog contains 48 threats spanning five attack families. We score these threats with the Artificial Intelligence Vulnerability Scoring System (AIVSS), identifying eight that reach the High band in at least one architecture. Because no complete public AP2 deployment was available, we build a testbed spanning all five architectures and develop five proof-of-concept demonstrations covering all eight High-risk threats and their mitigations. We also develop a deployment-aware scanner that maps applicable threats to static, cross-role consistency, and adversarial checks. Our analysis shows that valid mandate signatures alone do not ensure that an agent-mediated transaction reflects the user's intent when its pre-authorization context is manipulated.", "authors": [ "Avital Aviv", "Parth A. Gandh", "Ron Bitton", "Asaf Shabtai" ], "year": 2026, "published_date": "2026-08-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.23858", "pdf_url": "https://arxiv.org/pdf/2608.23858", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Artificial Intelligence", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.12, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The Agent Payments Protocol (AP2), introduced by Google, enables large language model (LLM)-driven shopping agents to authorize and execute payments on behalf of users. Its signed Checkout and Payment Mandates protect the integrity of transaction data after signing.", "key_contribution": "We present a systematic security analysis of AP2 v0.2 based on its roles, transaction lifecycle, deployment architectures, and trust boundaries.", "why_it_matters": "Beyond the Mandate: A Systematic Security Analysis of the Agent Payments Protocol (AP2) represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a systematic security analysis of AP2 v0.2 based on its roles, transaction lifecycle, deployment…", "biggest_caveat": "but adds capabilities and deployment assumptions that require renewed analysis.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.23858", "difficulty": "frontier" }, { "id": "arxiv:2608.22275", "source": "arxiv", "source_type": "preprint", "title": "CodeMechanic: Bug-Property-Guided Program Mitigation", "abstract": "Automated testing discovers vulnerabilities faster than developers can investigate and repair them, leaving an interval in which known memory corruptions remain exploitable. End- to-end LLM repair agents can shorten this interval, but they synthesize open-ended code changes and commonly validate them only by replaying a proof of concept (PoC). This weak oracle accepts patches that silence the observed crash by changing unrelated behavior, making unintended deployment risky. We present CodeMechanic, a bug-property-guided system for generating constrained mit- igations for spatial memory corruption. Instead of asking an LLM to generate a permanent repair, CodeMechanic reconstructs the violated memory-safety property from the crash, validates the dereferenced pointer and its buffer range, and inserts a local fail-stop guard before the dangerous access. The guard terminates execution when the boundary check fails. The resulting mitigation deliberately trades availability for security: it can convert potential remote code execution into controlled termination while developers investigate the root cause and prepare a permanent repair. CodeMechanic combines a two-dimensional static and dynamic context extractor with in-prompt debugging knowledge and stepwise val- idation to limit the effect of LLM errors. On 101 real-world ARVO bugs, the first attempt of CodeMechanic produces 47.6% more plausible patches (i.e., patches that pass PoC- replay validation) than the best baseline while using 91% fewer tokens. Manual audit further shows that CodeMechanic produces 3.4x - 4.3x more patches semantically equivalent to developer-written repairs.", "authors": [ "Han Zheng", "Rafaila Galanopoulou", "Ilia Shumailov", "Tianqi Fan", "Aiden Hall", "Dominik Maier", "Mathias Payer" ], "year": 2026, "published_date": "2026-08-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.22275", "pdf_url": "https://arxiv.org/pdf/2608.22275", "citations": 0, "topics": [], "tags": [ "LLMs", "Software Engineering", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.57, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Automated testing discovers vulnerabilities faster than developers can investigate and repair them, leaving an interval in which known memory corruptions remain exploitable. End- to-end LLM repair agents can shorten this interval, but they synthesize open-ended code changes and commonly validate them only by replaying a proof of concept (PoC).", "key_contribution": "We present CodeMechanic, a bug-property-guided system for generating constrained mit- igations for spatial memory corruption.", "why_it_matters": "CodeMechanic: Bug-Property-Guided Program Mitigation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present CodeMechanic, a bug-property-guided system for generating constrained mit- igations for spatial memory…", "biggest_caveat": "but they synthesize open-ended code changes and commonly validate them only by replaying a proof of concept (PoC).", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.22275", "difficulty": "frontier" }, { "id": "arxiv:2608.20342", "source": "arxiv", "source_type": "preprint", "title": "PrimeAgentOrchestrator: Memory-Primed Agent Spawning for Personal AI Infrastructure", "abstract": "Large language model (LLM) coding agents start each session with an empty context window, discarding accumulated knowledge from prior work. We present PrimeAgentOrchestrator (PAO), a system that spawns new instances of Claude Code -- Anthropic's terminal-based coding agent -- pre-loaded with relevant memories compiled from the user's existing personal databases. At spawn time, PAO queries two independently-operated memory backends in parallel (a PostgreSQL entity-observation database and a Cloudflare Worker semantic search index), fuses results using backend-specific retrieval strategies, and delivers the compiled briefing via filesystem injection that exploits the host agent's configuration auto-read behavior. PAO manages the full agent lifecycle including trust pre-seeding, readiness polling with error detection, and adaptive terminal text injection. We report on four months of regular deployment (December 2025 through March 2026) as an experience report, documenting three generations of context delivery mechanisms, the failure modes that motivated each redesign, and the engineering tradeoffs of bridging heterogeneous memory systems rather than building a unified one.", "authors": [ "Myron Koch" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.20342", "pdf_url": "https://arxiv.org/pdf/2608.20342", "citations": 0, "topics": [], "tags": [ "LLMs", "Long Context", "Multi-Agent Systems", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.32, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language model (LLM) coding agents start each session with an empty context window, discarding accumulated knowledge from prior work. We present PrimeAgentOrchestrator (PAO), a system that spawns new instances of Claude Code -- Anthropic's terminal-based coding agent -- pre-loaded with relevant memories compiled from the user's existing personal databases.", "key_contribution": "We present PrimeAgentOrchestrator (PAO), a system that spawns new instances of Claude Code -- Anthropic's terminal-based coding agent -- pre-loaded with relevant memories compiled from the user's existing personal databases.", "why_it_matters": "PrimeAgentOrchestrator: Memory-Primed Agent Spawning for Personal AI Infrastructure represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present PrimeAgentOrchestrator (PAO), a system that spawns new instances of Claude Code -- Anthropic's…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.20342", "difficulty": "intermediate" }, { "id": "arxiv:2608.20513", "source": "arxiv", "source_type": "preprint", "title": "Making Deployments Safe at Meta: Health Checks for Continuous Change-Safety", "abstract": "Continuous deployment to large scale production systems creates a tension between release velocity and reliability. Every change is a potential reliability incident, yet every delay is a missed opportunity. This paper describes the deployment time health check infrastructure that Meta uses to mediate this tension across thousands of heterogeneous services. We summarize the architecture of this prevention based distributed system's service called Service Health Checker, explain how check authors compose templated metric queries, thresholds, and workflow predicates; and discuss how the system is integrated with tiered and phased rollouts so that regressions trigger automatic rollback. We then describe the operational problems that emerged at scale, such as noise, alert fatigue, drift, and uncovered regressions, and the program of measurement, tooling, and improved defaults we deployed to address them. We close with lessons learned from years of operating deployment health checks at Meta, and the directions we are exploring next, including AI assisted health check tuning. Index Terms: deployment safety, continuous deployment, monitoring, software reliability, release engineering, software reliability engineering, AIOps, anomaly detection", "authors": [ "Prakash KL", "Anton Korenkov", "Uttam Thakore", "Christopher Hegre" ], "year": 2026, "published_date": "2026-08-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.20513", "pdf_url": "https://arxiv.org/pdf/2608.20513", "citations": 0, "topics": [], "tags": [ "Software Engineering", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.71, "content_potential_score": 1.84, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Continuous deployment to large scale production systems creates a tension between release velocity and reliability. Every change is a potential reliability incident, yet every delay is a missed opportunity.", "key_contribution": "Continuous deployment to large scale production systems creates a tension between release velocity and reliability.", "why_it_matters": "Making Deployments Safe at Meta: Health Checks for Continuous Change-Safety represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Software Engineering.", "one_line_takeaway": "Continuous deployment to large scale production systems creates a tension between release velocity and reliability.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Software Engineering.", "url": "https://arxiv.org/abs/2608.20513", "difficulty": "intermediate" }, { "id": "arxiv:2608.21221", "source": "arxiv", "source_type": "preprint", "title": "The Substitution Escrow Threshold: When \"Compatible With\" Becomes Safe Enough to Buy", "abstract": "Enterprise infrastructure buyers routinely evaluate compatibility claims--\"S3-compatible,\" \"PostgreSQL-compatible,\" \"OpenAI compatible\"--as proxies for future substitution options. Yet most compatibility claims do not escrow the substitution path they imply. This paper introduces the Substitution Escrow Threshold, a five-condition framework that determines when a compatibility claim genuinely reduces institutional risk versus merely reducing first-integration cost. The five conditions--boundary closure, executable conformance, custody independence, state and operations reversibility, and extension quarantine--are applied to five infrastructure cases (OCI, Kubernetes, OpenTelemetry, S3, PostgreSQL) that populate five distinct outcome cells. The framework produces actionable diagnostics for enterprise architects, platform engineers, procurement teams, and investors evaluating compatibility-dependent infrastructure decisions, and identifies AI infrastructure as the framework's most urgent next application.", "authors": [ "Amadeus Brandes" ], "year": 2026, "published_date": "2026-08-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.21221", "pdf_url": "https://arxiv.org/pdf/2608.21221", "citations": 0, "topics": [], "tags": [ "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.77, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Enterprise infrastructure buyers routinely evaluate compatibility claims--\"S3-compatible,\" \"PostgreSQL-compatible,\" \"OpenAI compatible\"--as proxies for future substitution options. Yet most compatibility claims do not escrow the substitution path they imply.", "key_contribution": "Enterprise infrastructure buyers routinely evaluate compatibility claims--\"S3-compatible,\" \"PostgreSQL-compatible,\" \"OpenAI compatible\"--as proxies for future substitution options.", "why_it_matters": "The Substitution Escrow Threshold: When \"Compatible With\" Becomes Safe Enough to Buy represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Software Engineering.", "one_line_takeaway": "Enterprise infrastructure buyers routinely evaluate compatibility claims--\"S3-compatible,\" \"PostgreSQL-compatible,\"…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Software Engineering.", "url": "https://arxiv.org/abs/2608.21221", "difficulty": "intermediate" }, { "id": "arxiv:2605.23057", "source": "arxiv", "source_type": "preprint", "title": "ModeSwitch-LLM: A Lightweight Phase-Aware Controller for Cross-Mode LLM Inference on a Single GPU", "abstract": "ModeSwitch-LLM is a lightweight request-boundary controller for improving single-GPU large language model inference efficiency by routing each request to an appropriate fixed inference mode. Instead of relying on one static serving configuration, the system selects among FP16, quantized modes, speculative decoding, and hybrid modes such as GPTQ plus prefix caching and INT8 plus continuous batching using cheap workload-level features. We evaluate ModeSwitch-LLM on Meta-Llama-3.1-8B-Instruct served on a single NVIDIA A100 GPU. On deployment-style synthetic workloads, the online controller achieves a 2.10x mean latency speedup over FP16 and a 0.48x mean energy ratio, corresponding to 51.7% lower energy per token. On automatic benchmarks used as a quality gate, accuracy remains close to FP16 with a mean delta of +0.17 percentage points. We also evaluate lightweight learned routers, but find that they do not clearly outperform the rule-based controller because they add routing overhead and more often select modes that violate quality, energy, or memory constraints. These results show that simple request-aware routing can recover substantial efficiency from existing inference modes without retraining the model or changing its architecture.", "authors": [ "Aman Sunesh", "Ali Alshehhi", "Hivansh Dhakne" ], "year": 2026, "published_date": "2026-05-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.23057", "pdf_url": "https://arxiv.org/pdf/2605.23057", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Machine Learning", "NLP" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.33, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "ModeSwitch-LLM is a lightweight request-boundary controller for improving single-GPU large language model inference efficiency by routing each request to an appropriate fixed inference mode. Instead of relying on one static serving configuration, the system selects among FP16, quantized modes, speculative decoding, and hybrid modes such as GPTQ plus prefix caching and INT8 plus continuous batching using cheap workload-level features.", "key_contribution": "We also evaluate lightweight learned routers, but find that they do not clearly outperform the rule-based controller because they add routing overhead and more often select modes that violate quality, energy, or memory constraints.", "why_it_matters": "ModeSwitch-LLM: A Lightweight Phase-Aware Controller for Cross-Mode LLM Inference on a Single GPU represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We also evaluate lightweight learned routers, but find that they do not clearly outperform the rule-based controller…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.23057", "difficulty": "beginner" }, { "id": "arxiv:2608.20026", "source": "arxiv", "source_type": "preprint", "title": "From Street View Imagery to Street Quality Indicators: Vision Language Inference for the Suburban 15-minute City", "abstract": "Streetscape quality has become a central concern in contemporary urban planning, particularly within the framework of the pedestrian-friendly 15-minute city, where walkability and public-space quality are increasingly recognized as key determinants of urban performance. However, assessing streetscape qualities across large suburban and peri-urban territories remains challenging due to the time and resource demands of conventional field surveys. This paper presents a planning-oriented assessment of streetscape qualities in the north-eastern periphery of Nice (France) using the latest release of SAGAI (Streetscape Analysis with Generative AI), an open-source workflow that leverages vision-language models (VLMs) for large-scale streetscape analysis from Google Street View imagery. The new release addresses limitations of the original framework through improved image acquisition, geographically consistent view generation, support for multiple VLM architectures, consensus-based inference, and an integrated analytical environment. The workflow is applied to several thousand street-level observations to evaluate qualities relevant to pedestrian-friendly urban environments: sidewalk presence, pedestrian entrance density, and vegetation. The resulting maps reveal that the desired streetscape qualities characterize only a fraction of today's suburban streetscapes, mainly in compact developments and traditional suburban faubourgs, while they are particularly lacking on residential hills. The analysis demonstrates the potential of contemporary VLMs to support urban diagnostics in extensive suburban territories where fieldwork would be prohibitively time-consuming. Beyond the case study, the paper illustrates how recent advances in vision-language models can contribute to evidence-based planning by enabling scalable, flexible, and interpretable assessments of urban public-space quality.", "authors": [ "Joan Perez", "Giovanni Fusco" ], "year": 2026, "published_date": "2026-08-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.20026", "pdf_url": "https://arxiv.org/pdf/2608.20026", "citations": 0, "topics": [], "tags": [ "VLMs", "Interpretability", "Machine Learning", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.71, "content_potential_score": 1.42, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Streetscape quality has become a central concern in contemporary urban planning, particularly within the framework of the pedestrian-friendly 15-minute city, where walkability and public-space quality are increasingly recognized as key determinants of urban performance. However, assessing streetscape qualities across large suburban and peri-urban territories remains challenging due to the time and resource demands of conventional field surveys.", "key_contribution": "Streetscape quality has become a central concern in contemporary urban planning, particularly within the framework of the pedestrian-friendly 15-minute city, where walkability and public-space quality are increasingly recognized as key determinants of urban performance.", "why_it_matters": "From Street View Imagery to Street Quality Indicators: Vision Language Inference for the Suburban 15-minute City advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about VLMs.", "one_line_takeaway": "Streetscape quality has become a central concern in contemporary urban planning, particularly within the framework of…", "biggest_caveat": "bute to evidence-based planning by enabling scalable, flexible, and interpretable assessments of urban public-space quality.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in VLMs.", "url": "https://arxiv.org/abs/2608.20026", "difficulty": "intermediate" }, { "id": "arxiv:2608.18733", "source": "arxiv", "source_type": "preprint", "title": "Flama: a Python framework for development and deployment of production-ready APIs, machine learning, and LLM services", "abstract": "We present Flama, an open-source Python framework for developing and deploying production-ready web APIs, machine learning services, and large-language-model (LLM) applications. Built on the Asynchronous Server Gateway Interface (ASGI), Flama offers a type-driven, async-first programming model that unifies REST API development, predictive model serving, and generative AI inference in one architecture. It is organised around seven subsystems: a component-based dependency injection system resolving handler parameters from type annotations at startup; a pluggable schema layer supporting Pydantic, Marshmallow and Typesystem behind a single adapter; an automatic CRUD generator turning a SQLAlchemy table and a schema class into REST endpoints backed by the Repository and Unit of Work patterns; a portable binary format (.flm) packaging models from scikit-learn, TensorFlow, PyTorch and Hugging Face Transformers with their metadata for zero-code deployment; a multi-backend LLM server running vLLM (Linux/CUDA) or MLX (Apple Silicon) and exposing four wire protocols (OpenAI, Anthropic, Ollama, and a native streaming dialect) through a shared codec; a Rust-accelerated core compiled via Maturin for routing, JSON encoding, compression and parsing; and a Model Context Protocol module turning any application into an MCP server over JSON-RPC 2.0. Built-in capabilities include JWT authentication, two pagination strategies, background tasks in threads or processes, WebSocket endpoints, Server-Sent Event and NDJSON streaming, OpenAPI 3.2.0 generation from handler signatures, and a command-line interface for running applications and for serving, packaging and inspecting models. We describe the architecture, present the programming model through worked examples, and compare Flama with existing frameworks, model serving platforms and LLM inference engines.", "authors": [ "José A. Perdiguero López", "Miguel A. Durán-Olivencia" ], "year": 2026, "published_date": "2026-08-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.18733", "pdf_url": "https://arxiv.org/pdf/2608.18733", "citations": 0, "topics": [], "tags": [ "LLMs", "Artificial Intelligence", "Machine Learning", "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present Flama, an open-source Python framework for developing and deploying production-ready web APIs, machine learning services, and large-language-model (LLM) applications. Built on the Asynchronous Server Gateway Interface (ASGI), Flama offers a type-driven, async-first programming model that unifies REST API development, predictive model serving, and generative AI inference in one architecture.", "key_contribution": "We present Flama, an open-source Python framework for developing and deploying production-ready web APIs, machine learning services, and large-language-model (LLM) applications.", "why_it_matters": "Flama: a Python framework for development and deployment of production-ready APIs, machine learning, and LLM services represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present Flama, an open-source Python framework for developing and deploying production-ready web APIs, machine…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.18733", "difficulty": "intermediate" }, { "id": "arxiv:2605.07507", "source": "arxiv", "source_type": "preprint", "title": "TCMIIES: A Browser-Based LLM-Powered Intelligent Information Extraction System for Academic Literature", "abstract": "The rapid growth of academic publications has created a need for tools that extract structured knowledge from unstructured scientific texts. Although large language models (LLMs) can perform natural language understanding and information extraction, existing solutions often require specialized infrastructure, programming expertise, or fine-tuned domain-specific models, which limits their accessibility for researchers in specialized fields. This paper describes TCMIIES (Traditional Chinese Medicine Information Intelligent Extraction System), a browser-based, zero-installation platform that uses commercial LLM APIs to perform structured information extraction from academic literature. The system employs a schema-guided prompting framework with automatic system prompt generation, allowing researchers to define custom extraction schemas through a graphical interface without programming. TCMIIES features a pure front-end architecture that processes all information locally in the browser, supports five major LLM providers (DeepSeek, OpenAI, Qwen, Zhipu AI, and custom OpenAI-compatible endpoints), implements concurrent batch processing with automatic retry mechanisms, and provides intelligent field mapping for Chinese academic databases including CNKI and Wanfang. Evaluation across multiple extraction scenarios in Traditional Chinese Medicine research shows structured output compliance rates exceeding 94\\% and extraction accuracy approaching but below expert-level agreement ($κ=0.82$ as reference). The system offers a flexible, privacy-preserving, and cost-effective solution for domain researchers who need to process literature at scale.", "authors": [ "Hanqing Zhao" ], "year": 2026, "published_date": "2026-08-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.07507", "pdf_url": "https://arxiv.org/pdf/2605.07507", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "Info Extraction", "Federated Learning", "NLP" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.27, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The rapid growth of academic publications has created a need for tools that extract structured knowledge from unstructured scientific texts. Although large language models (LLMs) can perform natural language understanding and information extraction, existing solutions often require specialized infrastructure, programming expertise, or fine-tuned domain-specific models, which limits their accessibility for researchers in specialized fields.", "key_contribution": "The rapid growth of academic publications has created a need for tools that extract structured knowledge from unstructured scientific texts.", "why_it_matters": "TCMIIES: A Browser-Based LLM-Powered Intelligent Information Extraction System for Academic Literature represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "The rapid growth of academic publications has created a need for tools that extract structured knowledge from…", "biggest_caveat": "but below expert-level agreement ($κ=0.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.07507", "difficulty": "advanced" }, { "id": "arxiv:2608.17373", "source": "arxiv", "source_type": "preprint", "title": "Integrating Novelty and Surprise for Experience Prioritization and Exploration in Image-Based Reinforcement Learning", "abstract": "Sample efficiency is a central challenge in reinforcement learning (RL), particularly in image-based domains where agents must learn from high-dimensional visual inputs. Traditional sampling often relies on random or suboptimal experience selection, leading to redundant updates and slow learning. Improving efficiency requires mechanisms that prioritize informative experiences while also encouraging effective exploration. Prioritized Experience Replay (PER) addresses part of this challenge by reusing high-value transitions, while intrinsic rewards promote the exploration of novel or uncertain states. However, their integration has not been extensively studied. This paper introduces Novelty and Surprise Prioritized Experience Replay (NSPER), which uses novelty to capture underrepresented states and surprise to expose gaps in the agent's understanding of the environment. We further extend this with NSPER+R, integrating these signals as intrinsic rewards to jointly improve replay quality and exploration. Experiments on DeepMind Control Suite tasks show that NSPER and NSPER+R improve training efficiency and convergence speed compared to existing methods in image-based RL.", "authors": [ "Hoda Yamani", "Henry Williams", "Bruce A. MacDonald" ], "year": 2026, "published_date": "2026-08-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.17373", "pdf_url": "https://arxiv.org/pdf/2608.17373", "citations": 0, "topics": [], "tags": [ "RL", "Machine Learning", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.71, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Sample efficiency is a central challenge in reinforcement learning (RL), particularly in image-based domains where agents must learn from high-dimensional visual inputs. Traditional sampling often relies on random or suboptimal experience selection, leading to redundant updates and slow learning.", "key_contribution": "Prioritized Experience Replay (PER) addresses part of this challenge by reusing high-value transitions, while intrinsic rewards promote the exploration of novel or uncertain states.", "why_it_matters": "Integrating Novelty and Surprise for Experience Prioritization and Exploration in Image-Based Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "Prioritized Experience Replay (PER) addresses part of this challenge by reusing high-value transitions, while intrinsic…", "biggest_caveat": "However, their integration has not been extensively studied.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2608.17373", "difficulty": "advanced" }, { "id": "arxiv:2608.11708", "source": "arxiv", "source_type": "preprint", "title": "A Browser-Based Gesture-Driven Avatar Interaction Framework for Metaverse Onboarding Environments", "abstract": "Avatar interaction shapes how engaging and immersive a metaverse experience feels, and for that interaction to feel natural, avatars need to respond to users without forcing them through a controller-based interface first. This paper describes a gesture-driven interaction layer built for a browser-based metaverse onboarding environment, where users explore a set of virtual rooms as an avatar and interact with embedded video, document, and quiz content using hand, arm, and head gestures instead of a keyboard or controller. The system combines real-time gesture recognition (Google MediaPipe) with two alternative locomotion techniques - hand-raise navigation and in-place walking - so users can trade off precision against physical immersion depending on the task. The contribution is the integration, deployment, and evaluation of these techniques as a single lightweight, web-deployable, controller-free interaction model, assessed through a structured internal onboarding session with five participants. We report what worked, what didn't, and the design trade-offs that came out of combining these techniques in one deployed system.", "authors": [ "Deepti Parachuri", "Chhayank Sahu", "Sameer Singh Choudhary" ], "year": 2026, "published_date": "2026-08-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.11708", "pdf_url": "https://arxiv.org/pdf/2608.11708", "citations": 0, "topics": [], "tags": [ "Human-Computer Interaction", "Computer Graphics" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.66, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Avatar interaction shapes how engaging and immersive a metaverse experience feels, and for that interaction to feel natural, avatars need to respond to users without forcing them through a controller-based interface first. This paper describes a gesture-driven interaction layer built for a browser-based metaverse onboarding environment, where users explore a set of virtual rooms as an avatar and interact with embedded video, document, and quiz content using hand, arm, and head gestures instead of a keyboard or controller.", "key_contribution": "Avatar interaction shapes how engaging and immersive a metaverse experience feels, and for that interaction to feel natural, avatars need to respond to users without forcing them through a controller-based interface first.", "why_it_matters": "A Browser-Based Gesture-Driven Avatar Interaction Framework for Metaverse Onboarding Environments represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Human-Computer Interaction.", "one_line_takeaway": "Avatar interaction shapes how engaging and immersive a metaverse experience feels, and for that interaction to feel…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Human-Computer Interaction.", "url": "https://arxiv.org/abs/2608.11708", "difficulty": "intermediate" }, { "id": "arxiv:2608.12001", "source": "arxiv", "source_type": "preprint", "title": "Remote Sensing and Machine Learning-Based Analysis of Land Use and Vegetation Change in Dhaka District, Bangladesh", "abstract": "Rapid urbanization in Dhaka District, Bangladesh has triggered substantial alterations in land use and environmental conditions, necessitating systematic monitoring for informed urban planning and ecological sustainability. This study employs remote sensing data and machine learning techniques to analyze spatiotemporal changes in land cover and vegetation dynamics between 2019 and 2024. High-resolution satellite imagery from Sentinel-2 MSI and Landsat 8 was utilized to classify land cover types and compute spectral indices including the Normalized Difference Vegetation Index (NDVI), Normalized Difference Built-up Index (NDBI), and Normalized Difference Water Index (NDWI). A supervised machine learning approach incorporating Decision Tree, K-Nearest Neighbors (KNN), and Random Forest classifiers was applied using labeled geospatial training points within Google Earth Engine. Accuracy assessments were conducted using confusion matrices and kappa statistics. Results indicate a 59.5% increase in urban built-up areas and a significant decline in vegetation (-8.46%) and water bodies (-7.77%) over the five-year period. Land conversion from vegetated and aquatic areas to urban infrastructure was identified as a dominant trend. Among the models, Random Forest demonstrated the highest classification accuracy. These findings underscore the growing environmental pressures driven by unregulated urban expansion in Dhaka. The study highlights the potential of remote sensing and machine learning tools in providing timely, actionable data to support sustainable urban development, land-use regulation, and ecosystem conservation policies.", "authors": [ "Muhammad Masud Tarek", "Md. Alamgir Hossain", "Md. Samiul Islam", "Muntasir Hasan Kanchan" ], "year": 2026, "published_date": "2026-08-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.12001", "pdf_url": "https://arxiv.org/pdf/2608.12001", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence", "Machine Learning", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.93, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Rapid urbanization in Dhaka District, Bangladesh has triggered substantial alterations in land use and environmental conditions, necessitating systematic monitoring for informed urban planning and ecological sustainability. This study employs remote sensing data and machine learning techniques to analyze spatiotemporal changes in land cover and vegetation dynamics between 2019 and 2024.", "key_contribution": "Rapid urbanization in Dhaka District, Bangladesh has triggered substantial alterations in land use and environmental conditions, necessitating systematic monitoring for informed urban planning and ecological sustainability.", "why_it_matters": "Remote Sensing and Machine Learning-Based Analysis of Land Use and Vegetation Change in Dhaka District, Bangladesh advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "Rapid urbanization in Dhaka District, Bangladesh has triggered substantial alterations in land use and environmental…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2608.12001", "difficulty": "intermediate" }, { "id": "arxiv:2608.10360", "source": "arxiv", "source_type": "preprint", "title": "MazzikaAI: A knowledge-based performance-to-prompt compiler for real-time Arabic maqam accompaniment with a streaming text-to-music model", "abstract": "Arabic maqam music microtonal, modal, and built on ornamented call and response is among the traditions most underserved by generative music models, whose training frameworks remain predominantly Western and equaltempered. Real time accompaniment sharpens this gap: an AI partner must listen, adapt dynamically, and respect idiomatic microtonal structures. Streaming text to music models provide strong generative capabilities but lack precise control interfaces. We present MazzikaAI, a knowledge based system that uses natural language as the actuator of a realtime control loop. By compiling live MIDI, gesture, and inferred harmony into continuously updated text prompts, MazzikaAI steers an unmodified streaming generator, Google Lyria RealTime, without requiring model finetuning. The system embeds expert knowledge of six core maqamat, characteristic ornaments, and ensemble dynamics, maintaining realtime responsiveness with subsecond keytoaudibleupdate latency. Empirical evaluations demonstrate that dynamic prompt compilation reliably grounds generation in microtonal scales, significantly increasing offgrid quartertone content over baseline generation. Beyond its core implementation, MazzikaAI illustrates how deterministic knowledgebased rules can effectively bridge expert, nonWestern musical traditions and unfinetuned foundation models. This architecture establishes a scalable paradigm for realtime humanAI cocreation, offering a generalizable blueprint for interactive accompaniment, adaptive music education, and culturally inclusive generative audio across diverse global idioms.", "authors": [ "Jiaxin Du", "Boulbaba Abdeljaouad", "Yong Zhuang", "Haoyu Li" ], "year": 2026, "published_date": "2026-08-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.10360", "pdf_url": "https://arxiv.org/pdf/2608.10360", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Knowledge Graphs", "Artificial Intelligence", "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.52, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Arabic maqam music microtonal, modal, and built on ornamented call and response is among the traditions most underserved by generative music models, whose training frameworks remain predominantly Western and equaltempered. Real time accompaniment sharpens this gap: an AI partner must listen, adapt dynamically, and respect idiomatic microtonal structures.", "key_contribution": "We present MazzikaAI, a knowledge based system that uses natural language as the actuator of a realtime control loop.", "why_it_matters": "MazzikaAI: A knowledge-based performance-to-prompt compiler for real-time Arabic maqam accompaniment with a streaming text-to-music model represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We present MazzikaAI, a knowledge based system that uses natural language as the actuator of a realtime control loop.", "biggest_caveat": "but lack precise control interfaces.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2608.10360", "difficulty": "intermediate" }, { "id": "arxiv:2608.07593", "source": "arxiv", "source_type": "preprint", "title": "Weather- and Location-Aware Agentic Dining Recommendation: Leveraging LLM World Knowledge for Region-Sensitive Contextual Reasoning", "abstract": "Context-aware recommender systems have long recognized that factors such as location, time, and weather shape where and what people choose to eat. Existing weather-aware food and point-of-interest recommenders, however, typically treat weather generically -- mapping conditions to preferences through hand-crafted rules or specially trained context models -- and do not capture that the culturally appropriate response to weather is itself region-specific: a rainy evening calls for hot tea and fried snacks in one culinary culture and for very different comfort food in another. Encoding such weather-by-region-by-cuisine interactions as explicit rules or training data is brittle and does not scale. We present a weather- and location-aware agentic dining-recommendation system that takes a different approach: a large language model (LLM) orchestrates tools for location and weather retrieval and then reasons in natural language over the combined context, drawing on the cultural and culinary world knowledge already latent in the model to produce region-sensitive, weather-appropriate recommendations without per-region rule tables or specialized training. We describe the agent architecture, the tool-orchestration flow (Google location services and a weather service feeding an OpenAI LLM), and the reasoning mechanism, and we report on a working prototype that was implemented and briefly deployed end-to-end. We discuss design trade-offs -- cost, latency, ambiguity handling, and fallbacks -- and we are explicit about limitations, including the absence of a formal user study and the risk of cultural stereotyping in locality-based inference. The contribution is architectural: a simple, extensible pattern for incorporating environmental and cultural context into agentic recommendation through LLM reasoning rather than engineered rules.", "authors": [ "Kadharmoideen Fadurudeen" ], "year": 2026, "published_date": "2026-08-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.07593", "pdf_url": "https://arxiv.org/pdf/2608.07593", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "Artificial Intelligence", "Information Retrieval" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Context-aware recommender systems have long recognized that factors such as location, time, and weather shape where and what people choose to eat. Existing weather-aware food and point-of-interest recommenders, however, typically treat weather generically -- mapping conditions to preferences through hand-crafted rules or specially trained context models -- and do not capture that the culturally appropriate response to weather is itself region-specific: a rainy evening calls for hot tea and fried snacks in one culinary culture and for very different comfort food in another.", "key_contribution": "We present a weather- and location-aware agentic dining-recommendation system that takes a different approach: a large language model (LLM) orchestrates tools for location and weather retrieval and then reasons in natural language over the combined context, drawing on the cultural and culinary world knowledge already latent in the model to produce region-sensitive, weather-appropriate recommendations without per-region rule tables or specialized training.", "why_it_matters": "Weather- and Location-Aware Agentic Dining Recommendation: Leveraging LLM World Knowledge for Region-Sensitive Contextual Reasoning improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a weather- and location-aware agentic dining-recommendation system that takes a different approach: a large…", "biggest_caveat": "does not scale.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.07593", "difficulty": "intermediate" }, { "id": "arxiv:2608.03524", "source": "arxiv", "source_type": "preprint", "title": "Dr. AGENTONOMICS: A Didactic Experiment of AGENTONOMICS", "abstract": "AGENTONOMICS is a framework that treats AI agents as economic entities that can be designed, managed, and governed through an integrated management architecture. Dr. AGENTONOMICS is its first application: a lecture agent developed in the context of the TUM course on AI agents in business administration. Conceived during the winter semester 2025/26 and first introduced to students in the summer semester 2026, it serves as a didactic experiment in which the agent is both the object that students study and the medium through which they learn and apply the framework. The current prototype is a web-based, retrieval-grounded tutor that explains AGENTONOMICS concepts and supports student questions. This report argues that the same system can grow beyond tutoring into three additional cumulative roles: an avatar lecturer that delivers multimodal instruction, a design consultant that guides students through the AGENTONOMICS Design & Management Reference Framework (ADMRF), and a meta-agent that helps construct the agents students have specified. These roles are cumulative because they share the same interface, intelligence layer, tools, knowledge base, and ecosystem connection, while an orchestrator selects the role-specific algorithm required for each task. We present the architecture of the prototype, outline its development roadmap, and discuss its implications for a polycentric AI economy. This report is intended to invite further discussion on how agents can teach, apply, and eventually reproduce the frameworks by which they are designed.", "authors": [ "Fengjunjie Pan", "Alois Knoll" ], "year": 2026, "published_date": "2026-08-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.03524", "pdf_url": "https://arxiv.org/pdf/2608.03524", "citations": 0, "topics": [], "tags": [ "AI Agents", "Multimodal", "Knowledge Graphs", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.67, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "AGENTONOMICS is a framework that treats AI agents as economic entities that can be designed, managed, and governed through an integrated management architecture. Dr.", "key_contribution": "We present the architecture of the prototype, outline its development roadmap, and discuss its implications for a polycentric AI economy.", "why_it_matters": "Dr. AGENTONOMICS: A Didactic Experiment of AGENTONOMICS represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We present the architecture of the prototype, outline its development roadmap, and discuss its implications for a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2608.03524", "difficulty": "intermediate" }, { "id": "arxiv:2601.17753", "source": "arxiv", "source_type": "preprint", "title": "Hylog: A Hybrid Approach to Logging Text Production in Non-alphabetic Scripts", "abstract": "Research keyloggers are essential for cognitive studies of text production, yet most fail to capture the on-screen transformations performed by Input Method Editors (IMEs) for non-alphabetic scripts. To address this methodological gap, we present Hylog, a novel hybrid logging system that combines analytical keylogging with ecological text logging for a more complete and finer-grained analysis. Our modular, open-source system uses plug-ins for standard applications (Microsoft Word, Google Chrome) to capture both keyboard output and rendered text, which a hybridizer module then synchronizes into a dual trace. To validate the system's technical feasibility and demonstrate its analytical capabilities, we conducted a proof-of-concept study where two volunteers translated a text into simplified Chinese. Hylog successfully captured keypresses and temporal intervals between Latin letters, Chinese characters, and IME confirmations -- some measurements invisible to traditional keyloggers. The resulting data enable the formulation of new, testable hypotheses about the cognitive restrictions and affordances at different linguistic layers in IME-mediated typing. Our plug-in architecture enables extension to other IME systems and fosters more inclusive multilingual text-production research.", "authors": [ "Roberto Crotti", "Giovanni Denaro", "Zhiqiang Du", "Ricardo Muñoz Martín" ], "year": 2026, "published_date": "2026-08-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.17753", "pdf_url": "https://arxiv.org/pdf/2601.17753", "citations": 0, "topics": [], "tags": [ "Info Extraction", "NLP" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.29, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Research keyloggers are essential for cognitive studies of text production, yet most fail to capture the on-screen transformations performed by Input Method Editors (IMEs) for non-alphabetic scripts. To address this methodological gap, we present Hylog, a novel hybrid logging system that combines analytical keylogging with ecological text logging for a more complete and finer-grained analysis.", "key_contribution": "To address this methodological gap, we present Hylog, a novel hybrid logging system that combines analytical keylogging with ecological text logging for a more complete and finer-grained analysis.", "why_it_matters": "Hylog: A Hybrid Approach to Logging Text Production in Non-alphabetic Scripts represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "To address this methodological gap, we present Hylog, a novel hybrid logging system that combines analytical keylogging…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2601.17753", "difficulty": "frontier" }, { "id": "arxiv:2607.20525", "source": "arxiv", "source_type": "preprint", "title": "Autonomous disproofs of the sum-product conjecture over $\\mathbb R$ with GPT-5.5 Pro", "abstract": "OpenAI's recent disproof of the Erdős unit distance conjecture marked a milestone for AI in mathematics. It also inspired another breakthrough: a human disproof of the Erdős--Szemerédi sum-product conjecture over $\\mathbb R$. In this paper, we present a simple agent built on GPT-5.5 Pro. Using a problem-agnostic, three-stage prompting pipeline -- proof-plan proposal, proof construction, and review -- the agent autonomously generated correct proofs that the sum-product conjecture is false over $\\mathbb R$ in 7 of 8 independent trials; in the remaining trial, it identified an unresolved gap in its argument. The seven proofs are diverse: some are close to existing unit-based constructions, while others avoid units by using $L^p$-type regions of algebraic integers. The system used an average of 132.4k reasoning tokens per trial. We release the code, intermediate outputs, and generated proofs, providing a reproducible, data-contamination-free case study in autonomous proof generation.", "authors": [ "Yichen Huang" ], "year": 2026, "published_date": "2026-07-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.20525", "pdf_url": "https://arxiv.org/pdf/2607.20525", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.77, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "OpenAI's recent disproof of the Erdős unit distance conjecture marked a milestone for AI in mathematics. It also inspired another breakthrough: a human disproof of the Erdős--Szemerédi sum-product conjecture over $\\mathbb R$.", "key_contribution": "In this paper, we present a simple agent built on GPT-5.5 Pro.", "why_it_matters": "Autonomous disproofs of the sum-product conjecture over $\\mathbb R$ with GPT-5.5 Pro represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this paper, we present a simple agent built on GPT-5.5 Pro.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.20525", "difficulty": "frontier" }, { "id": "arxiv:2608.00186", "source": "arxiv", "source_type": "preprint", "title": "Normal-Anchored First-Order Model-Agnostic Meta-Learning based Whisper Fine-Tuning for Enhancing Fairness of Cleft Lip and Palate Speech Recognition", "abstract": "Automatic speech recognition (ASR) for cleft lip and palate (CLP) speech is difficult because acoustic and articulatory patterns vary across severity levels. This variability reduces the performance of pretrained ASR systems, and conventional fine-tuning may not generalize well under low-resource, heterogeneous CLP conditions. This work proposes Normal-Anchored First-Order Model-Agnostic Meta-Learning (NA-FOMAML) for adapting Whisper to CLP speech. The method uses a first-order bilevel meta-learning framework in which normal speech is used in the inner loop as a stable support condition, while CLP severity groups are used in the outer loop to improve post-adaptation robustness. This design aims to reduce the performance gap between normal and pathological speech. Experiments are conducted on the NMCPC and AIISH datasets using four normal-anchored training configurations. Frozen encoder, full encoder, and selected Whisper encoder-layer tuning strategies are evaluated, including layers 0--5, 4--11, 6--11, and 8--11, with decoder and projection-head adaptation. Results show that outer-loop training with only normal speech is insufficient. For NMCPC, full encoder tuning with Normal to Normal+Mild+Moderate gives WERs of 4.40%, 5.53%, 16.14%, and 52.07% for normal, mild, moderate, and severe speech. For AIISH, full encoder tuning with Normal to Normal+Mild+Moderate+Severe gives WERs of 2.48%, 19.66%, 14.05%, and 57.50%. A transcription-based phoneme-category analysis shows that severe CLP speech has high error rates across fricatives, affricates, nasals, liquids, plosives, and vowels. Overall, NA-FOMAML improves cross-severity robustness, but severe speech still requires severity-aware sampling, phoneme-aware loss functions, and augmentation targeting pressure consonant and resonance-related distortions.", "authors": [ "Susmita Bhattacharjee", "Jagabandhu Mishra", "H. S. Shekhawat", "Ravi Jasuja", "S. R. Mahadeva Prasanna" ], "year": 2026, "published_date": "2026-07-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.00186", "pdf_url": "https://arxiv.org/pdf/2608.00186", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Info Extraction", "ASR", "Fairness & Ethics" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.73, "content_potential_score": 1.55, "interestingness_score": 2.38, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Automatic speech recognition (ASR) for cleft lip and palate (CLP) speech is difficult because acoustic and articulatory patterns vary across severity levels. This variability reduces the performance of pretrained ASR systems, and conventional fine-tuning may not generalize well under low-resource, heterogeneous CLP conditions.", "key_contribution": "Results show that outer-loop training with only normal speech is insufficient.", "why_it_matters": "Normal-Anchored First-Order Model-Agnostic Meta-Learning based Whisper Fine-Tuning for Enhancing Fairness of Cleft Lip and Palate Speech Recognition represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "Results show that outer-loop training with only normal speech is insufficient.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2608.00186", "difficulty": "intermediate" }, { "id": "arxiv:2607.26481", "source": "arxiv", "source_type": "preprint", "title": "Conformal Changepoint Localization and Root Cause Analysis with Corrupted Observations", "abstract": "Detecting when the statistical behavior of an engineered system changes, and identifying which component is responsible, are core problems in the monitoring of telecommunication networks, robotic platforms, security infrastructure, and multi-agent systems. In safety- and mission-critical deployments, such decisions must be accompanied by statistical reliability guarantees rather than by point estimates alone. Conformal changepoint localization (CONCH) and conformal root cause analysis (CROC) meet this need by returning confidence sets that contain the true changepoint, or the true root-cause stream, with a user-specified probability, without parametric assumptions on the data-generating process. In practice, however, observations are frequently corrupted, e.g., by outliers, sensor faults, or adversarial perturbations. While the finite-sample coverage of these procedures is preserved under contamination, the resulting confidence sets can become uninformatively large. Adopting a Huber-type contamination model, this paper proposes weighted CONCH (W-CONCH) and weighted CROC (W-CROC), which downweight observations that are likely to be corrupted with the goal of reducing confidence set size when data may be corrupted. The weighting mechanism, derived from a formal bound on the unknown corrupted data densities, leverages pre-existing second-order classifier-based uncertainty signals, such as those produced by evidential deep learning or Bayesian learning. W-CONCH and W-CROC are further generalized by introducing a meta-learning procedure for the weights that optimizes a differentiable surrogate of the confidence set size. Experiments on image-based and real-world changepoint and root-cause benchmarks show that uncertainty-based weighting substantially reduces confidence set size while maintaining the target coverage.", "authors": [ "Seunghun Yu", "Meiyi Zhu", "Petar Popovski", "Joonhyuk Kang", "Osvaldo Simeone" ], "year": 2026, "published_date": "2026-07-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.26481", "pdf_url": "https://arxiv.org/pdf/2607.26481", "citations": 0, "topics": [], "tags": [ "Robotics", "Evaluation", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.62, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Detecting when the statistical behavior of an engineered system changes, and identifying which component is responsible, are core problems in the monitoring of telecommunication networks, robotic platforms, security infrastructure, and multi-agent systems. In safety- and mission-critical deployments, such decisions must be accompanied by statistical reliability guarantees rather than by point estimates alone.", "key_contribution": "Experiments on image-based and real-world changepoint and root-cause benchmarks show that uncertainty-based weighting substantially reduces confidence set size while maintaining the target coverage.", "why_it_matters": "Conformal Changepoint Localization and Root Cause Analysis with Corrupted Observations represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "Experiments on image-based and real-world changepoint and root-cause benchmarks show that uncertainty-based weighting…", "biggest_caveat": "however, observations are frequently corrupted, e.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2607.26481", "difficulty": "frontier" }, { "id": "arxiv:2607.26855", "source": "arxiv", "source_type": "preprint", "title": "NeoRacer: An Open, Standardized 1:12 Scale Autonomous Race Car for Benchmarking and Education", "abstract": "Many scientific fields rely on standard benchmarks and shared platforms to improve review and reproducibility, but autonomous systems research still lacks widely accepted open hardware. Where standardization has emerged, progress has accelerated. This is especially evident in autonomous racing, where teams often build custom systems or buy niche, expensive vehicles, making control and robotics research and education hard to compare and reproduce. High costs also limit access outside well-funded labs, while affordable educational robots are often underpowered. To address this gap, we present NeoRacer, an open-source 1:12 scale autonomous racing platform. It is built around an NVIDIA Jetson Orin Nano (67 TOPS), a 270° LiDAR, a 120 fps global-shutter camera, and a 9-axis IMU. NeoRacer ships pre-assembled for USD 2,699, offering over 3x the compute of comparable platforms at less than half the cost of the nearest pre-assembled alternative. Co-developed by the Neobotics Foundation and Seeed Studio, and manufactured by Seeed Studio, NeoRacer combines open hardware and software design with scalable, repeatable production. The modular, extensible platform provides a standardized benchmarking environment for autonomous racing algorithms across institutions. We describe the hardware/software architecture, design decisions from two pilot deployments (MIT IAP, 15 students; BU CPS Lab, 10 students), and key cost-performance tradeoffs. Hardware is licensed under CERN-OHL-S v2 and software under GPLv3, with all design files, firmware, and ROS2 packages publicly accessible.", "authors": [ "Koneshka Bandyopadhyay", "Ansh Mehta", "Bassel El Mabsout", "Renato Mancuso" ], "year": 2026, "published_date": "2026-07-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.26855", "pdf_url": "https://arxiv.org/pdf/2607.26855", "citations": 0, "topics": [], "tags": [ "Robotics", "Evaluation", "Systems & Control" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.24, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Many scientific fields rely on standard benchmarks and shared platforms to improve review and reproducibility, but autonomous systems research still lacks widely accepted open hardware. Where standardization has emerged, progress has accelerated.", "key_contribution": "To address this gap, we present NeoRacer, an open-source 1:12 scale autonomous racing platform.", "why_it_matters": "NeoRacer: An Open, Standardized 1:12 Scale Autonomous Race Car for Benchmarking and Education represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "To address this gap, we present NeoRacer, an open-source 1:12 scale autonomous racing platform.", "biggest_caveat": "but autonomous systems research still lacks widely accepted open hardware.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2607.26855", "difficulty": "beginner" }, { "id": "arxiv:2607.25628", "source": "arxiv", "source_type": "preprint", "title": "Kernel-Checked Exclusions for the Erdős-Selfridge Odd Covering Problem: Any Odd Covering of $\\mathbb{Z}$ Has lcm Exceeding 10000", "abstract": "The Erdős-Selfridge odd covering problem (Erdős problem #7) asks whether a covering system of $\\mathbb{Z}$ exists whose moduli are all odd, distinct, and greater than 1. The problem is open. We present a Lean 4 formalization, checked end to end by the proof kernel, of the exclusion: any covering of $\\mathbb{Z}$ by finitely many congruence classes with distinct odd moduli > 1 has lcm of the moduli exceeding 10000. The proof composes a formalized density argument (a covering by divisors of $N$ exceeding 1 forces $2N \\le σ_1(N)$, so the lcm is abundant or perfect), a kernel-checked abundancy floor (no odd $N < 945$ qualifies), a family of Chinese-Remainder capacity certificates -- decidable per-$N$ arithmetic inequalities each refuting every covering with distinct moduli > 1 dividing that $N$ -- for all 23 odd abundant numbers below $10^4$, and a kernel-checked enumeration establishing that those 23 are the only odd non-deficient candidates. The result is transported to the official StrictCoveringSystem $\\mathbb{Z}$ formulation of Erdős #7 in google-deepmind/formal-conjectures, with a bidirectional periodicity bridge between coverings of $\\mathbb{Z}$ and finite checks over $\\mathbb{Z}/N\\mathbb{Z}$ suitable for consuming future SAT-style search output. All 63 published theorems depend on exactly propext, Classical.choice, and Quot.sound: no sorry, no native_decide, no solver in the trusted base. The mathematical content is known -- the density argument is folklore, and far larger uncertified classifications of covering numbers exist -- so the contribution is epistemic rather than mathematical: these exclusions are theorems of the Lean kernel, with an axiom gate enforced mechanically in continuous integration.", "authors": [ "Ibrahim Mian", "Shayaan Siddique" ], "year": 2026, "published_date": "2026-07-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.25628", "pdf_url": "https://arxiv.org/pdf/2607.25628", "citations": 0, "topics": [], "tags": [], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.62, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The Erdős-Selfridge odd covering problem (Erdős problem #7) asks whether a covering system of $\\mathbb{Z}$ exists whose moduli are all odd, distinct, and greater than 1. The problem is open.", "key_contribution": "We present a Lean 4 formalization, checked end to end by the proof kernel, of the exclusion: any covering of $\\mathbb{Z}$ by finitely many congruence classes with distinct odd moduli > 1 has lcm of the moduli exceeding 10000.", "why_it_matters": "Kernel-Checked Exclusions for the Erdős-Selfridge Odd Covering Problem: Any Odd Covering of $\\mathbb{Z}$ Has lcm Exceeding 10000 represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "We present a Lean 4 formalization, checked end to end by the proof kernel, of the exclusion: any covering of…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2607.25628", "difficulty": "frontier" }, { "id": "arxiv:2604.02544v1", "source": "arxiv", "source_type": "preprint", "title": "Developer Experience with AI Coding Agents: HTTP Behavioral Signatures in Documentation Portals", "abstract": "The rapid adoption of AI coding agents and AI assistant web services is fundamentally changing how developers discover, consume, and interact with technical documentation. This paper studies that transformation across three interconnected dimensions: documentation accessibility, content analytics, and feedback systems. We present an empirical study of HTTP request fingerprints from nine AI coding agents (Aider, Antigravity, Claude Code, Cline, Cursor, Junie, OpenCode, VS Code, and Windsurf) and six AI assistant services (ChatGPT, Claude, Google Gemini, Google NotebookLM, MistralAI, and Perplexity) accessing a live developer documentation endpoint, revealing identifiable behavioral signatures in HTTP runtime environments, pre-fetch strategies, User-Agent strings, and header patterns. Our study shows that AI agent access compresses multi-page navigation into a single or two requests, making traditional engagement metrics - session depth, time-on-page, click path, and bounce rate - unreliable indicators of actual documentation consumption. We discuss practical adaptations for developer portal teams, including tokenomics-aware documentation design, adoption of emerging machine-readable standards (AGENTS.md, llms.txt, skill.md, agent-permissions.json), MCP server-based feedback channels, and analytics instrumentation for AI referral traffic.", "authors": [ "Oleksii Borysenko" ], "year": 2026, "published_date": "2026-04-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.02544v1", "pdf_url": "https://arxiv.org/pdf/2604.02544v1", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Large Language Models", "AI Agents & Tool Use", "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.12, "content_potential_score": 1.9, "interestingness_score": 2.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The rapid adoption of AI coding agents and AI assistant web services is fundamentally changing how developers discover, consume, and interact with technical documentation. This paper studies that transformation across three interconnected dimensions: documentation accessibility, content analytics, and feedback systems.", "key_contribution": "We present an empirical study of HTTP request fingerprints from nine AI coding agents (Aider, Antigravity, Claude Code, Cline, Cursor, Junie, OpenCode, VS Code, and Windsurf) and six AI assistant services (ChatGPT, Claude, Google Gemini, Google NotebookLM, MistralAI, and Perplexity) accessing a live developer documentation endpoint, revealing identifiable behavioral signatures in HTTP runtime environments, pre-fetch strategies, User-Agent strings, and header patterns.", "why_it_matters": "Developer Experience with AI Coding Agents: HTTP Behavioral Signatures in Documentation Portals advances our understanding of large language models, which are reshaping how we build AI systems and interact with knowledge.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present an empirical study of HTTP request fingerprints from nine AI coding agents (Aider, Antigravity, Claude Code,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.02544v1", "difficulty": "intermediate" }, { "id": "arxiv:2607.22641", "source": "arxiv", "source_type": "preprint", "title": "AutoCluster, AutoTopicModeling, AutoTrendAnalysis: A Complete AutoML Pipeline for Predicting Emerging Trends", "abstract": "Predicting emerging trends is vital for businesses, researchers, and policymakers; yet traditional approaches often lack scalability and adaptability. This paper presents a trend prediction framework based on Automated Machine Learning (AutoML), designed to extract insights from textual datasets with temporal attributes. The system ingests subject-specific textual entries accompanied by a date field. The pipeline begins with preprocessing and embedding, followed by AutoClustering, which uses meta-learning to select the optimal clustering algorithm. AutoTopicModeling then applies successive halving to identify the best topic modeling method: Latent Dirichlet Allocation (LDA), Latent Semantic Analysis (LSA), BERTopic, or Non-negative Matrix Factorization (NMF) based on the coherence score for each cluster. For trend forecasting, AutoTrendAnalysis evaluates multiple models: Facebook Prophet, AutoRegressive Integrated Moving Average (ARIMA), Seasonal-Trend decomposition using Loess (STL), and Long Short-Term Memory (LSTM) selecting the most accurate based on Root Mean Square Error (RMSE), either through successive halving or exhaustive comparison. Topics are classified as strong signals, weak signals, or noise based on forecasting outcomes, enabling the identification of emerging trends. By automating clustering, topic modeling, and time series forecasting, this research enhances trend prediction accuracy while reducing manual effort. The proposed system offers a scalable and user-friendly solution suitable for real-time applications and stakeholders with limited machine learning expertise. Experimental results demonstrate that the proposed system's best trial achieves a final RMSE of 7.099, indicating high predictive accuracy.", "authors": [ "Ahmed Abolfadl", "Marwa Mahmoud Abla", "Mervat Abu-Elkheir", "Maggie Mashaly" ], "year": 2026, "published_date": "2026-06-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.22641", "pdf_url": "https://arxiv.org/pdf/2607.22641", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.65, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Predicting emerging trends is vital for businesses, researchers, and policymakers; yet traditional approaches often lack scalability and adaptability. This paper presents a trend prediction framework based on Automated Machine Learning (AutoML), designed to extract insights from textual datasets with temporal attributes.", "key_contribution": "Experimental results demonstrate that the proposed system's best trial achieves a final RMSE of 7.099, indicating high predictive accuracy.", "why_it_matters": "AutoCluster, AutoTopicModeling, AutoTrendAnalysis: A Complete AutoML Pipeline for Predicting Emerging Trends represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "Experimental results demonstrate that the proposed system's best trial achieves a final RMSE of 7.099, indicating high…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2607.22641", "difficulty": "intermediate" }, { "id": "arxiv:2607.23120", "source": "arxiv", "source_type": "preprint", "title": "A scalable online machine learning approach for Stock Recommendation", "abstract": "Stock recommendation systems face the dual challenge of adapting to rapidly changing market conditions while maintaining low-latency predictions for end users. Traditional batch-trained models fail to capture concept drift, and monolithic architectures struggle to provide fault tolerance under load. This paper presents a scalable online deep learning-based stock recommendation system built on a distributed microservices architecture using Kubernetes, Docker, and RabbitMQ. The system employs a hybrid leader-follower architecture where a primary model continuously trains on streaming financial data, including EPS, MACD, and price, from the Alpha Vantage API while multiple replica models serve user-facing recommendations in parallel. A multilayer perceptron implemented with TensorFlow Recommenders generates content-based recommendations using explicit user ratings (1-5) and transfer learning. The architecture ensures high availability. The leader persists model weights to Google Cloud Object Storage, allowing replicas to recover seamlessly upon failure, while RabbitMQ provides message durability and replay. Results demonstrate that the system serves stock recommendations in 23 seconds per request and processes up to 500 portfolio addition requests per second per follower. Key limitations include data staleness (up to 150 minutes due to API rate limits) and the absence of a service mesh for inter-cluster security. This work contributes a production-ready reference architecture for online recommender systems that balances consistency, availability, and scalability in a financial domain context", "authors": [ "Harsh Nagarkar" ], "year": 2026, "published_date": "2026-07-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.23120", "pdf_url": "https://arxiv.org/pdf/2607.23120", "citations": 0, "topics": [], "tags": [ "Game Theory", "Artificial Intelligence", "Distributed Computing" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.6, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Stock recommendation systems face the dual challenge of adapting to rapidly changing market conditions while maintaining low-latency predictions for end users. Traditional batch-trained models fail to capture concept drift, and monolithic architectures struggle to provide fault tolerance under load.", "key_contribution": "Results demonstrate that the system serves stock recommendations in 23 seconds per request and processes up to 500 portfolio addition requests per second per follower.", "why_it_matters": "A scalable online machine learning approach for Stock Recommendation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Game Theory.", "one_line_takeaway": "Results demonstrate that the system serves stock recommendations in 23 seconds per request and processes up to 500…", "biggest_caveat": "buted microservices architecture using Kubernetes, Docker, and RabbitMQ.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Game Theory.", "url": "https://arxiv.org/abs/2607.23120", "difficulty": "intermediate" }, { "id": "arxiv:2607.23500", "source": "arxiv", "source_type": "preprint", "title": "Formalizing Flag Algebras in Lean", "abstract": "Razborov's flag algebra method is a powerful tool for proving asymptotic inequalities in extremal graph theory, often reducing the task to finding a finite certificate by semidefinite programming. We present a machine-checked formalization of the method for finite simple graphs, together with a certificate-to-proof compiler that turns externally generated certificate data into algebraic proofs checked by Lean. The formalization covers the foundations of the method: partially labeled graphs, their densities in large graphs, the quotient algebra of density expressions, graph-limit semantics through positive homomorphisms, and the downward operators used to average out labels. The compiler treats the external semidefinite programming output as candidate data rather than trusted input: Lean independently computes the required density and multiplication facts, verifies positive semidefiniteness exactly over $\\mathbb{Q}$, and carries out the algebraic normalization steps of flag-algebra proofs. Our case studies yield formal proofs of seven Turán-type upper bounds, including Mantel's theorem and the Erdős pentagon theorem, a $C_4$-density bound for triangle-free graphs, and edge-density bounds for $K_4$-free, $K_5$-free, and $C_5$-free graphs. Independently of the compiler, we formalize the matching constructions that complete the exact Turán densities of Mantel's theorem and the Erdős pentagon theorem, and prove two inequalities of Goodman. Our constrained semantics also prompted a meta-theoretic comparison of two ways of imposing graph constraints: building a hereditary constraint into the flag algebra from the start, or testing inequalities afterward on constrained graph limits with labels chosen at random. We state the resulting root-plantability criterion characterizing when the two approaches agree; a forthcoming paper will present the complete account.", "authors": [ "Gyeongwon Jeong", "Seonghun Park", "Jihoon Hyun", "Sang-il Oum", "Hongseok Yang" ], "year": 2026, "published_date": "2026-07-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.23500", "pdf_url": "https://arxiv.org/pdf/2607.23500", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence", "Programming Languages" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.62, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Razborov's flag algebra method is a powerful tool for proving asymptotic inequalities in extremal graph theory, often reducing the task to finding a finite certificate by semidefinite programming. We present a machine-checked formalization of the method for finite simple graphs, together with a certificate-to-proof compiler that turns externally generated certificate data into algebraic proofs checked by Lean.", "key_contribution": "We present a machine-checked formalization of the method for finite simple graphs, together with a certificate-to-proof compiler that turns externally generated certificate data into algebraic proofs checked by Lean.", "why_it_matters": "Formalizing Flag Algebras in Lean represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We present a machine-checked formalization of the method for finite simple graphs, together with a certificate-to-proof…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2607.23500", "difficulty": "frontier" }, { "id": "arxiv:2412.06700", "source": "arxiv", "source_type": "preprint", "title": "Facade: High-Precision Insider Threat Detection Using Deep Contextual Anomaly Detection", "abstract": "Insiders with privileged access have the power to cause great harm to their organization. Even a single insider threat incident can be catastrophic, resulting in both financial losses and reputation damage. These threats are some of the most difficult to detect, as attack activity is interspersed in large volumes of legitimate activity. Although it is a serious threat, the literature is sparse aside from a few studies with various limitations, preventing their practical deployment in large-scale organizations. We present Facade: fast and accurate contextual anomaly detection, a high-precision, deep-learning system that has served as the last line of defense against insider threats at Google since 2018. Facade is an innovative self-supervised system that detects suspicious events by considering the context surrounding each event, including relevant facts about the user and resource involved. It is built around a new multi-modal model that is trained on corporate document access, SQL table access, and HTTP/RPC request logs. To overcome the scarcity of labeled incident data, Facade employs a novel contrastive learning strategy trained exclusively on benign activity. Facade detects insider attackers with an extremely low false-positive rate, lower than 0.01%. For single rogue events, such as the illegitimate access to a sensitive document, the false-positive rate is as low as 0.0003%. To the best of our knowledge, Facade is the only proposed insider risk anomaly detection system with a false positive rate low enough for use in large corporate environments.", "authors": [ "Alex Kantchelian", "Casper Neo", "Ryan Stevens", "Hyungwon Kim", "Zhaohao Fu", "Sadegh Momeni", "Birkett Huber", "Cem Topcuoglu", "Senaka Buthpitiya", "Elie Bursztein", "Yanis Pavlidis", "Martin Cochran", "Massimiliano Poletto" ], "year": 2026, "published_date": "2026-07-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2412.06700", "pdf_url": "https://arxiv.org/pdf/2412.06700", "citations": 0, "topics": [], "tags": [ "Multimodal", "Self-Supervised", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses catastrophic — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.11, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Insiders with privileged access have the power to cause great harm to their organization. Even a single insider threat incident can be catastrophic, resulting in both financial losses and reputation damage.", "key_contribution": "We present Facade: fast and accurate contextual anomaly detection, a high-precision, deep-learning system that has served as the last line of defense against insider threats at Google since 2018.", "why_it_matters": "Facade: High-Precision Insider Threat Detection Using Deep Contextual Anomaly Detection represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We present Facade: fast and accurate contextual anomaly detection, a high-precision, deep-learning system that has…", "biggest_caveat": "limitations, preventing their practical deployment in large-scale organizations.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2412.06700", "difficulty": "advanced" }, { "id": "arxiv:2606.14652", "source": "arxiv", "source_type": "preprint", "title": "Syntax and semantics of focalisation with relative monads and comonads", "abstract": "The logical principles of focalisation and polarisation can be used to design well-behaved term syntaxes for sequent calculus, which play a role as meta-languages for describing effectful computation. On the semantics side, this corresponds to an axiomatic and polarised notion of model of computation stated in terms of adjunctions over non-associative categories. In this paper, we study the special and delicate cases of resource and effect modalities in a general intuitionistic and linear setting: an exponential comonad $!$ (refining $\\square$) and a strong monad $\\lozenge$. The starting point of our contribution is noticing that the completeness for a polarised syntax for $!$ and $\\lozenge$ with respect to (co)monads in linear call-by-push-value models can be achieved if we move to relative (co)monads: more precisely, comonads relative to $\\downarrow$ (the positive shift functor) for $!$ and monads relative to $\\uparrow$ (the negative shift functor) for $\\lozenge$. These specialisations of the concept of relative (co)monad to call-by-push-value adjunctions recently appeared. Yet the syntax we present arose from proof-theoretic consideration, without the link with relative (co)monads being noticed at the time. Our first remark is thus that (co)monads relative to a call-by-push-value adjunction have been motivated previously from a proof-theoretic perspective in the context of focalisation, which also provides a meta-language for these concepts in an effectful setting. We carry out the study of these modalities from the axiomatic, non-associative point of view. We recall the notion of adjunction over non-associative categories, and establish correspondence results between this notion of adjunction and that of relative adjunction. This correspondence is then extended to linear-non-linear and strong versions of adjunctions as needed to model $!$ and $\\lozenge$.", "authors": [ "Éléonore Mangel", "Paul-André Melliès", "Guillaume Munch-Maccagnoni" ], "year": 2026, "published_date": "2026-06-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.14652", "pdf_url": "https://arxiv.org/pdf/2606.14652", "citations": 0, "topics": [], "tags": [ "Programming Languages" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.3, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The logical principles of focalisation and polarisation can be used to design well-behaved term syntaxes for sequent calculus, which play a role as meta-languages for describing effectful computation. On the semantics side, this corresponds to an axiomatic and polarised notion of model of computation stated in terms of adjunctions over non-associative categories.", "key_contribution": "Yet the syntax we present arose from proof-theoretic consideration, without the link with relative (co)monads being noticed at the time.", "why_it_matters": "Syntax and semantics of focalisation with relative monads and comonads represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Programming Languages.", "one_line_takeaway": "Yet the syntax we present arose from proof-theoretic consideration, without the link with relative (co)monads being…", "biggest_caveat": "bution is noticing that the completeness for a polarised syntax for $!", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Programming Languages.", "url": "https://arxiv.org/abs/2606.14652", "difficulty": "frontier" }, { "id": "arxiv:2607.20723", "source": "arxiv", "source_type": "preprint", "title": "Leaky Language Models: Stealing Architecture and Inference Optimizations via Per-Token Timing", "abstract": "This work presents LeakyLMs, a set of attacks that leak proprietary model, architecture, and deployment information from production language models. LeakyLMs is the first to demonstrate that key model and deployment details can be inferred using only token generation timing, even when interacting through remote APIs. LeakyLMs introduces two core attacks. The first attack targets inference optimizations and deployment strategies. For example, our attack detects whether a provider uses speculative decoding, a widely deployed inference-time optimization, and further identifies the context length of the draft model used in the pipeline. Our measurements show that Google Gemini Flash 2.5 uses speculative decoding with a draft context window of approximately 128K tokens. The second attack recovers key architectural properties, including the number of transformer layers, hidden dimension size, and number of attention heads. To achieve this, LeakyLMs builds a detailed and accurate model of token-generation timing on modern NVIDIA GPUs, characterizing how latency scales with model configuration and hardware parameters. The attack then performs a search over the architecture space using this timing model. In experiments with Llama models, the near-correct architectural configuration appears in the top-10 guesses more than 90% of the time.", "authors": [ "Sadegh Majidi", "Niloofar Mireshghallah", "Kazem Taram" ], "year": 2026, "published_date": "2026-07-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.20723", "pdf_url": "https://arxiv.org/pdf/2607.20723", "citations": 0, "topics": [], "tags": [ "Long Context", "Transformers", "Machine Learning", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.99, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This work presents LeakyLMs, a set of attacks that leak proprietary model, architecture, and deployment information from production language models. LeakyLMs is the first to demonstrate that key model and deployment details can be inferred using only token generation timing, even when interacting through remote APIs.", "key_contribution": "LeakyLMs is the first to demonstrate that key model and deployment details can be inferred using only token generation timing, even when interacting through remote APIs.", "why_it_matters": "Leaky Language Models: Stealing Architecture and Inference Optimizations via Per-Token Timing represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Long Context.", "one_line_takeaway": "LeakyLMs is the first to demonstrate that key model and deployment details can be inferred using only token generation…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Long Context.", "url": "https://arxiv.org/abs/2607.20723", "difficulty": "intermediate" }, { "id": "arxiv:2607.21196", "source": "arxiv", "source_type": "preprint", "title": "Case study: solving P-99 with LPTP and an LLM", "abstract": "Ninety-Nine Prolog Problems (P-99) is a famous set of Prolog exercises. We solved the first thirty three just by prompting an LLM (Large Language Model). We used Claude from Anthropic. By solved we mean: generate the Prolog code and a test file, run the tests and check whether they pass, then formally prove types, groundness, termination, uniqueness, existence and also sometimes functional correctness with LPTP (Logic Program Theorem Prover). Hence our approach is an experiment in vibe-coding/vericoding of P-99. It is a vibe-coding experiment because we started from informal specifications written in English and let Claude generate the Prolog code. It also fits within vericoding because the LLM proved reliability guarantees on the generated Prolog code. Claude wrote 58 logic procedures, 508 tests, 257 lemmas for a total of 11800 proof lines. We manually checked each file generated by the LLM. We checked the Prolog code, ran the tests, examined the logical statements generated by Claude and proof-checked Claude's proofs with LPTP. This paper describes this experiment and provides the main details so that it can be reproduced by the interested reader.", "authors": [ "Fred Mesnard", "Thierry Marianne", "Étienne Payet", "Wim Vanhoof" ], "year": 2026, "published_date": "2026-07-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.21196", "pdf_url": "https://arxiv.org/pdf/2607.21196", "citations": 0, "topics": [], "tags": [ "LLMs", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.33, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Ninety-Nine Prolog Problems (P-99) is a famous set of Prolog exercises. We solved the first thirty three just by prompting an LLM (Large Language Model).", "key_contribution": "Ninety-Nine Prolog Problems (P-99) is a famous set of Prolog exercises.", "why_it_matters": "Case study: solving P-99 with LPTP and an LLM represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Ninety-Nine Prolog Problems (P-99) is a famous set of Prolog exercises.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.21196", "difficulty": "frontier" }, { "id": "arxiv:2509.25746", "source": "arxiv", "source_type": "preprint", "title": "TacRefineNet: Goal-Conditioned Tactile Grasp Refinement for Edge-Prominent Objects", "abstract": "Accurate final grasp alignment remains challenging for edge-prominent objects such as thin plates, discs, and rods, whose sparse contacts are easily occluded and poorly resolved by depth sensing. We present TacRefineNet, a tactile-only, goal-conditioned framework for local refinement along tactilely observable pose dimensions. Given current and target multi-finger tactile images and their corresponding hand-joint configurations, a Siamese policy network directly predicts corrective wrist pose increments. The hand iteratively opens, moves, and regrasps, forming an external-dexterity tactile servoing loop. Cross-combination training pairs current and target samples, allowing targets within the sampled pose range to be specified without retraining. We collect 156,007 simulated samples from 15 plates, discs, and rods and train the policy entirely in MuJoCo before zero-shot deployment to an 11-DoF five-fingered hand with piezoresistive sensors. On seen objects, the real system achieves 80.7\\% and 59.3\\% success under the $10^\\circ$/10\\,mm criterion for fixed and random targets, respectively; after five steps, the mean errors are approximately 5.2\\,mm and $3.5^\\circ$. Experiments further show continuous correction under long-horizon perturbations and limited within-category transfer to unseen objects, with reduced performance for symmetric or weakly discriminative contacts. Project website is available at https://sites.google.com/view/tacrefinenet", "authors": [ "Shuaijun Wang", "Haoran Zhou", "Diyun Xiang", "Yangwei You" ], "year": 2026, "published_date": "2026-07-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.25746", "pdf_url": "https://arxiv.org/pdf/2509.25746", "citations": 0, "topics": [], "tags": [ "AI Safety", "Robotics" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.87, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Accurate final grasp alignment remains challenging for edge-prominent objects such as thin plates, discs, and rods, whose sparse contacts are easily occluded and poorly resolved by depth sensing. We present TacRefineNet, a tactile-only, goal-conditioned framework for local refinement along tactilely observable pose dimensions.", "key_contribution": "We present TacRefineNet, a tactile-only, goal-conditioned framework for local refinement along tactilely observable pose dimensions.", "why_it_matters": "TacRefineNet: Goal-Conditioned Tactile Grasp Refinement for Edge-Prominent Objects represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We present TacRefineNet, a tactile-only, goal-conditioned framework for local refinement along tactilely observable…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2509.25746", "difficulty": "advanced" }, { "id": "arxiv:2607.16274", "source": "arxiv", "source_type": "preprint", "title": "The JEPA Predictor: A Transferable Operator for Occluded Feature Completion", "abstract": "Joint-Embedding Predictive Architectures (JEPAs) train a predictor jointly with their encoder, but downstream deployment discards the predictor and reads features from the encoder alone. The predictor is, by construction, a learned operator from visible-context features to features at masked positions, the structure a partial-view classifier needs. We show that this operator is portable across encoder families. We first establish that, at heavy mask, retaining the frozen predictor on a JEPA encoder substantially closes the accuracy gap against the strongest non-JEPA discriminative baselines. We then bolt the frozen predictors of I-JEPA and V-JEPA 2 onto four non-JEPA hosts (CLIP, DINOv3, DINOv2, MAE) through a single linear projection between feature spaces, fit in closed form on 500 ImageNet-1k images. Across both ImageNet-9 and Stanford Dogs and across three mask fractions, the lift over each host's masked-encoder baseline grows monotonically with the mask fraction K in every host-donor pair. CLIP paired with the I-JEPA predictor recovers most of the accuracy that masking removed on ImageNet-9 at heavy occlusion, and lifts fine-grained Stanford Dogs from 15.9% to 52.1% (+36 pp). The mechanism is identifiable: the projection pays a fixed cost on visible patches and the predictor provides a growing benefit on masked patches; the benefit dominates the heavy-occlusion regime. At low K on fine-grained classification the projection cost exceeds the benefit, defining the boundary where the linear bridge breaks down. The frozen JEPA predictor functions as a portable operator for occluded feature completion across encoder families, requiring no retraining of either model while fitting matched linear probes per mask fraction.", "authors": [ "William Nguyen", "Christopher Nguyen" ], "year": 2026, "published_date": "2026-07-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.16274", "pdf_url": "https://arxiv.org/pdf/2607.16274", "citations": 0, "topics": [], "tags": [ "VLMs", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 6.23, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Joint-Embedding Predictive Architectures (JEPAs) train a predictor jointly with their encoder, but downstream deployment discards the predictor and reads features from the encoder alone. The predictor is, by construction, a learned operator from visible-context features to features at masked positions, the structure a partial-view classifier needs.", "key_contribution": "We show that this operator is portable across encoder families.", "why_it_matters": "The JEPA Predictor: A Transferable Operator for Occluded Feature Completion advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about VLMs.", "one_line_takeaway": "We show that this operator is portable across encoder families.", "biggest_caveat": "but downstream deployment discards the predictor and reads features from the encoder alone.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in VLMs.", "url": "https://arxiv.org/abs/2607.16274", "difficulty": "intermediate" }, { "id": "arxiv:2601.19370", "source": "arxiv", "source_type": "preprint", "title": "On the Analysis of Platooned Vehicular Networks on Highways", "abstract": "Vehicular platooning refers to coordinated and close movement of vehicular users (VUs) traveling together along a common route segment, offering strategic benefits such as reduced fuel costs, lower emissions, and improved traffic flow. {Highways offer a natural setting for platooning due to extended travel distances, yet their potential remains underexplored, particularly in terms of communication and connectivity. Given that effective platooning relies on robust vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) links, understanding connectivity dynamics on highways is essential.} In this paper, we analyze the dynamics of vehicular platooning on a highway and its impact on the performance of two forms of vehicular communications -- namely V2V and V2I communication -- compared to independent vehicle movement on a highway. The vehicular networks consists of road-side units (RSUs), modeled as a 1D Poisson point process (PPP), to provide the vehicular connectivity to the VUs. VUs are modeled as 1D PPP under the non-platooned traffic scenario (N-PTS) and as a 1D Matern cluster process (MCP) under the platooned traffic scenario (PTS). We evaluate the distribution on the per-RSU load, representing the number of VUs served, for the typical and tagged RSU. Additionally, we derive coverage probability (CP) and rate coverage (RC), which measures the probability of the signal-to-interference-plus-noise ratio (SINR) and achievable rate above a specified threshold at the typical VU along with their meta distribution (MD), providing a deeper understanding of the reliability and variability of these metrics across different spatial distributions of VUs and RSUs. Finally, we validate our theoretical findings through simulations and provide numerical insights into the impact of different traffic patterns on RSU load distribution, CP, and RC performance.", "authors": [ "Kaushlendra Pandey", "Harpreet S. Dhillon", "Abhishek K. Gupta" ], "year": 2026, "published_date": "2026-07-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.19370", "pdf_url": "https://arxiv.org/pdf/2601.19370", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Vehicular platooning refers to coordinated and close movement of vehicular users (VUs) traveling together along a common route segment, offering strategic benefits such as reduced fuel costs, lower emissions, and improved traffic flow. {Highways offer a natural setting for platooning due to extended travel distances, yet their potential remains underexplored, particularly in terms of communication and connectivity.", "key_contribution": "Vehicular platooning refers to coordinated and close movement of vehicular users (VUs) traveling together along a common route segment, offering strategic benefits such as reduced fuel costs, lower emissions, and improved traffic flow.", "why_it_matters": "On the Analysis of Platooned Vehicular Networks on Highways represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "Vehicular platooning refers to coordinated and close movement of vehicular users (VUs) traveling together along a…", "biggest_caveat": "bution on the per-RSU load, representing the number of VUs served, for the typical and tagged RSU.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2601.19370", "difficulty": "intermediate" }, { "id": "arxiv:2602.04596", "source": "arxiv", "source_type": "preprint", "title": "Uncertainty Decomposition for Bayes-Filtered Transformers via Bayesian Predictive Inference", "abstract": "Bayes-filtered transformers are transformers meta-learned on sequences from a prior predictive distribution to approximate the corresponding posterior predictive distribution. They output total predictive uncertainty in a single forward pass but never explicitly represent a posterior distribution, making the standard route to separating aleatoric from epistemic uncertainty unavailable. We address this challenge through the lens of Bayesian predictive inference (BPI). Our main result is a predictive Central Limit Theorem (CLT) for supervised settings under conditions that are among the weakest known in the BPI literature. The CLT characterises the posterior of the limiting predictive distribution given an observed context as asymptotically Gaussian; the variance of this Gaussian quantifies epistemic uncertainty. We apply the framework to TabPFN, a Bayes-filtered transformer that is a state-of-the-art foundation model for tabular prediction. The resulting credible bands achieve near-nominal frequentist coverage as context length grows, and the decomposition largely matches standard desiderata: epistemic uncertainty shrinks with context length and is highest in sparsely observed regions within the span of the context data, while aleatoric uncertainty dominates near decision boundaries where classes overlap.", "authors": [ "Sandra Fortini", "Kenyon Ng", "Sonia Petrone", "Judith Rousseau", "Susan Wei" ], "year": 2026, "published_date": "2026-07-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.04596", "pdf_url": "https://arxiv.org/pdf/2602.04596", "citations": 0, "topics": [], "tags": [ "Long Context", "Transformers", "Structured Data", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.13, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Bayes-filtered transformers are transformers meta-learned on sequences from a prior predictive distribution to approximate the corresponding posterior predictive distribution. They output total predictive uncertainty in a single forward pass but never explicitly represent a posterior distribution, making the standard route to separating aleatoric from epistemic uncertainty unavailable.", "key_contribution": "The resulting credible bands achieve near-nominal frequentist coverage as context length grows, and the decomposition largely matches standard desiderata: epistemic uncertainty shrinks with context length and is highest in sparsely observed regions within the span of the context data, while aleatoric uncertainty dominates near decision boundaries where classes overlap.", "why_it_matters": "Uncertainty Decomposition for Bayes-Filtered Transformers via Bayesian Predictive Inference represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Long Context.", "one_line_takeaway": "The resulting credible bands achieve near-nominal frequentist coverage as context length grows, and the decomposition…", "biggest_caveat": "bution to approximate the corresponding posterior predictive distribution.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Long Context.", "url": "https://arxiv.org/abs/2602.04596", "difficulty": "frontier" }, { "id": "arxiv:2607.15247", "source": "arxiv", "source_type": "preprint", "title": "AutoSynthesis: An agentic system for automated meta-analysis", "abstract": "Evidence synthesis is crucial for turning primary research into reliable knowledge for science, medicine, education, and policy. Yet, quantitative evidence synthesis remains largely manual and difficult to scale. Here, we introduce AutoSynthesis, an end-to-end multi-agent system for automated meta-analysis. Given a research question in natural language, AutoSynthesis formulates a search strategy, retrieves scientific literature, screens candidate studies, assesses full-text eligibility, extracts quantitative statistics, computes standardized effect sizes, and finally performs random-effects meta-analysis. AutoSynthesis further supports heterogeneity analysis to examine how effect sizes vary across moderators, as well as risk-of-bias assessment. As output, AutoSynthesis produces a transparent report aligned with PRISMA guidelines. In our application, AutoSynthesis screened over 28 studies and extracted more than 20 quantitative claims. The pooled effect estimates produced by AutoSynthesis are similar to Hedges' $g$ of expert-conducted meta-analyses, indicating close agreement with manual evidence synthesis. Together, these results show that AutoSynthesis can make quantitative evidence synthesis more scalable, thereby supporting evidence-based decision-making across disciplines.", "authors": [ "Moein Taherinezhad", "Sebastian Maier", "Gerardo Vitagliano", "Francesco Pierri", "Stefan Feuerriegel" ], "year": 2026, "published_date": "2026-07-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.15247", "pdf_url": "https://arxiv.org/pdf/2607.15247", "citations": 0, "topics": [], "tags": [ "AI Agents", "Fairness & Ethics", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.31, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Evidence synthesis is crucial for turning primary research into reliable knowledge for science, medicine, education, and policy. Yet, quantitative evidence synthesis remains largely manual and difficult to scale.", "key_contribution": "Here, we introduce AutoSynthesis, an end-to-end multi-agent system for automated meta-analysis.", "why_it_matters": "AutoSynthesis: An agentic system for automated meta-analysis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "Here, we introduce AutoSynthesis, an end-to-end multi-agent system for automated meta-analysis.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2607.15247", "difficulty": "intermediate" }, { "id": "arxiv:2512.20677", "source": "arxiv", "source_type": "preprint", "title": "Learning-Based Automated Adversarial Red-Teaming for Robustness Evaluation of Large Language Models", "abstract": "The increasing deployment of large language models (LLMs) in safety-critical applications raises fundamental challenges in systematically evaluating robustness against adversarial behaviors. Existing red-teaming practices are largely manual and expert-driven, which limits scalability, reproducibility, and coverage in high-dimensional prompt spaces. We formulate automated LLM red-teaming as a structured adversarial search problem and propose a learning-driven framework for scalable vulnerability discovery. The approach combines meta-prompt-guided adversarial prompt generation with a hierarchical execution and detection pipeline, enabling standardized evaluation across six representative threat categories, including reward hacking, deceptive alignment, data exfiltration, sandbagging, inappropriate tool use, and chain-of-thought manipulation. Extensive experiments on GPT-OSS-20B identify 47 vulnerabilities, including 21 high-severity failures and 12 previously undocumented attack patterns. Compared with manual red-teaming under matched query budgets, our method achieves a 3.9$\\times$ higher discovery rate with 89\\% detection accuracy, demonstrating superior coverage, efficiency, and reproducibility for large-scale robustness evaluation.", "authors": [ "Zhang Wei", "Hanxuan Chen", "Peilu Hu", "Zhenyuan Wei", "Chenwei Liang", "Jing Luo", "Ziyi Ni", "Hao Yan", "Li Mei", "Shengning Lang", "Kuan Lu", "Xi Xiao", "Zhimo Han", "Yijin Wang", "Yichao Zhang", "Chen Yang", "Junfeng Hao", "Jiayi Gu", "Riyang Bao", "Mu-Jiang-Shan Wang" ], "year": 2026, "published_date": "2026-04-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2512.20677", "pdf_url": "https://arxiv.org/pdf/2512.20677", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Safety", "AI Agents", "Robotics" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.07, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The increasing deployment of large language models (LLMs) in safety-critical applications raises fundamental challenges in systematically evaluating robustness against adversarial behaviors. Existing red-teaming practices are largely manual and expert-driven, which limits scalability, reproducibility, and coverage in high-dimensional prompt spaces.", "key_contribution": "We formulate automated LLM red-teaming as a structured adversarial search problem and propose a learning-driven framework for scalable vulnerability discovery.", "why_it_matters": "Learning-Based Automated Adversarial Red-Teaming for Robustness Evaluation of Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We formulate automated LLM red-teaming as a structured adversarial search problem and propose a learning-driven…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2512.20677", "difficulty": "advanced" }, { "id": "arxiv:2607.08054", "source": "arxiv", "source_type": "preprint", "title": "Who Analyses the Analyser? Self-Validating LLM Hazard Analysis with Constitutional Meta-STPA", "abstract": "Large language models (LLMs) are increasingly trusted to draft the artifacts of safety analysis such as, losses, hazards, Unsafe Control Actions (UCAs), and safety constraints, inside rigorous processes such as Systems-Theoretic Process Analysis (STPA). Yet a blind spot runs through this fast-growing literature: every system gets analysed except the LLM-assisted tool doing the analysing, which is itself a safety-relevant system that can hallucinate standards, emit unverifiable constraints, and leave no audit trail from prompt to artifact. We take seriously the question the field has skipped -- {who analyses the analyser?} and answer it by turning STPA on the tool itself. We present \\{Constitutional Meta-STPA}, an LLM-assisted STPA tool built around a closed loop: the tool runs a {meta-STPA} of the class of AI-assisted safety tools and {derives} rather than asserts, its governance constitution from the resulting loss$\\to$hazard$\\to$UCA$\\to$constraint chain, yielding a published constitution of $21$ Tool Principles and $8$ Meta-Safety Principles, each bound to a code enforcement point. We formalise the measured object as a constitution-marginal coverage operator over a principle set $P$ ($|P|{=}29$) with a soundness lemma that isolates coverage from model and scanner, and report four findings. {(i)~Self-derivation:} a frontier ensemble ({claude-opus-4.8}${+}${claude-sonnet-4}) recovers $18/21$ canonical and all $8/8$ governance principles from the tool's own design, while a weaker pair recovers $12/21$ and $3/8$, so the meta layer is model-limited, not constitution-limited, and the same $8/8$ re-emerge from a second, independently authored tool.", "authors": [ "Samuel Tetteh", "Udip Shrestha", "Joshua R. Waite", "Cody Fleming" ], "year": 2026, "published_date": "2026-07-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.08054", "pdf_url": "https://arxiv.org/pdf/2607.08054", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Machine Learning", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses lemma and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.59, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models (LLMs) are increasingly trusted to draft the artifacts of safety analysis such as, losses, hazards, Unsafe Control Actions (UCAs), and safety constraints, inside rigorous processes such as Systems-Theoretic Process Analysis (STPA). Yet a blind spot runs through this fast-growing literature: every system gets analysed except the LLM-assisted tool doing the analysing, which is itself a safety-relevant system that can hallucinate standards, emit unverifiable constraints, and leave no audit trail from prompt to artifact.", "key_contribution": "We present \\{Constitutional Meta-STPA}, an LLM-assisted STPA tool built around a closed loop: the tool runs a {meta-STPA} of the class of AI-assisted safety tools and {derives} rather than asserts, its governance constitution from the resulting loss$\\to$hazard$\\to$UCA$\\to$constraint chain, yielding a published constitution of $21$ Tool Principles and $8$ Meta-Safety Principles, each bound to a code enforcement point.", "why_it_matters": "Who Analyses the Analyser? Self-Validating LLM Hazard Analysis with Constitutional Meta-STPA represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present \\{Constitutional Meta-STPA}, an LLM-assisted STPA tool built around a closed loop: the tool runs a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.08054", "difficulty": "frontier" }, { "id": "arxiv:2607.08154", "source": "arxiv", "source_type": "preprint", "title": "Directed proof-relevant logical relations in simplicial HoTT", "abstract": "Intrinsically-typed presentations of type theory often use equality in the meta-language to represent object-language judgmental equality. In such equational syntax, proof-relevant logical relations define computability predicates on judgmental equivalence classes of types and terms. This approach, however, does not directly account for reduction, which is directed and plays a central role in many logical-relations arguments. This paper develops a directed version of proof-relevant logical relations in simplicial homotopy type theory, where reductions are internalized as \\emph{inequality types}. We construct object syntax as a directed quotient inductive type. The central observation is that contravariant families in simplicial type theory provide exactly the proof-relevant form of closure under expansion for logical relations: computability evidence can be transported backward along reductions, with the required functoriality and universal property built in. Using this observation, we construct a unary logical relations model with contravariant computability predicates and prove directed Boolean canonicity: every closed Boolean term reduces to either true or false. We then extend the construction to dependent types and universes, where a comonadic flat modality provides the discreteness needed for type conversion and universe predicates. Finally, we adapt the method to binary logical relations, separating vertical reduction from horizontal parametricity and obtaining a proof-relevant account of representation independence.", "authors": [ "Runming Li", "Harrison Grodin", "Robert Harper" ], "year": 2026, "published_date": "2026-07-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.08154", "pdf_url": "https://arxiv.org/pdf/2607.08154", "citations": 0, "topics": [], "tags": [ "Programming Languages" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.77, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Intrinsically-typed presentations of type theory often use equality in the meta-language to represent object-language judgmental equality. In such equational syntax, proof-relevant logical relations define computability predicates on judgmental equivalence classes of types and terms.", "key_contribution": "Intrinsically-typed presentations of type theory often use equality in the meta-language to represent object-language judgmental equality.", "why_it_matters": "Directed proof-relevant logical relations in simplicial HoTT represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Programming Languages.", "one_line_takeaway": "Intrinsically-typed presentations of type theory often use equality in the meta-language to represent object-language…", "biggest_caveat": "however, does not directly account for reduction, which is directed and plays a central role in many logical-relations arguments.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Programming Languages.", "url": "https://arxiv.org/abs/2607.08154", "difficulty": "frontier" }, { "id": "arxiv:2607.08497", "source": "arxiv", "source_type": "preprint", "title": "Cognitive-structured Multimodal Agent for Multimodal Understanding, Generation, and Editing", "abstract": "Recent unified multimodal models show a single architecture can jointly perform vision/language understanding and image generation/editing. However, they repeatedly feed all historical visual and textual inputs into a shared context window, limiting long-horizon multimodal dialogue due to visual token explosion and unreliable cross-turn referencing. We propose a Cognitive-structured Multimodal Agent that externalizes visual information into an Episodic Visual Memory and selectively reactivates relevant episodes during reasoning. The agent consists of a Perceptual Abstraction Engine for structured visual abstraction, a Cognitive Retrieval Engine for cross-turn memory retrieval, and a Multimodal Executive Controller for autonomous task inference and action planning. To address the lack of turn-level retrieval supervision in existing datasets, we develop a Unified Scenario Engine that programmatically generates structured multi-turn conversations with fine-grained retrieval annotations, enabling reinforcement learning to optimize abstraction and retrieval policies. We also construct a long-horizon visual-dialogue benchmark stratified by difficulty to evaluate episodic visual recall. Our 8B agent achieves 91.4% retrieval accuracy over 20-turn sessions, surpassing 32B baselines by +8.2% while nearly halving per-turn inference time (23.1s -> 12.7s). We further present the Cognitive-structured Multimodal Agent Harness (CMA-Harness), a tool-augmented deployment of the same cognitive structure integrating persistent multimodal memory, web access, image generation/editing/composition tools, and OpenAI-compatible serving. Structured memory and modular decision-making offer a more scalable, efficient paradigm for long-horizon multimodal agents than monolithic parameter scaling. Code: https://github.com/caseclose/cma-harness ; Project page: https://caseclose.github.io/cma-harness/", "authors": [ "Feng Wang", "Canmiao Fu", "Zhipeng Huang", "Chen Li", "Jing Lyu", "Ge Li" ], "year": 2026, "published_date": "2026-07-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.08497", "pdf_url": "https://arxiv.org/pdf/2607.08497", "citations": 0, "topics": [], "tags": [ "Reasoning", "Long Context", "Multimodal", "Text-to-Image", "Dialogue" ], "paper_type": "benchmark", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.16, "content_potential_score": 2.34, "interestingness_score": 2.77, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent unified multimodal models show a single architecture can jointly perform vision/language understanding and image generation/editing. However, they repeatedly feed all historical visual and textual inputs into a shared context window, limiting long-horizon multimodal dialogue due to visual token explosion and unreliable cross-turn referencing.", "key_contribution": "Recent unified multimodal models show a single architecture can jointly perform vision/language understanding and image generation/editing.", "why_it_matters": "Cognitive-structured Multimodal Agent for Multimodal Understanding, Generation, and Editing represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Recent unified multimodal models show a single architecture can jointly perform vision/language understanding and image…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2607.08497", "difficulty": "intermediate" }, { "id": "arxiv:2606.13566v1", "source": "arxiv", "source_type": "preprint", "title": "A Three-Layer Framework for AI in Scientific Discovery", "abstract": "Current discussions of AI in scientific discovery are often dominated by two visible capabilities: search over existing knowledge and execution through optimization, simulation, and automation. Both are important, but neither fully captures the central act of discovery: the formation and evolution of models. This paper proposes a three-layer view of AI in discovery. Layer 1 is search and retrieval by large language models. Layer 2, as the main innovation of this paper, is model formation through qualitative reasoning: the capacity to recognize when a current framework is structurally inadequate and to understand the problem within a broader representational space, not through trial and error, but through structural insight into what is missing and where it can be found. Layer 3 is execution, optimization, and refinement. The main claim is that Layer 2 is both the most important and the least developed. Search without model formation remains confined to inherited frameworks, while execution without conceptual revision only amplifies an existing formulation. We illustrate Layer 2 reasoning through three case studies: S. S. Chern's intrinsic proof of the Gauss-Bonnet theorem, the resolution of the Nesterov Accelerated Gradient convergence problem via Lyapunov functions, and the autonomous disproof of the Erdos unit distance conjecture by OpenAI in 2026. Each case exhibits the same structural signature: a framework that had become inadequate, a missing conceptual object, and a resolution found in an unexpected neighboring field.", "authors": [ "Guojun Liao" ], "year": 2026, "published_date": "2026-06-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.13566v1", "pdf_url": "https://arxiv.org/pdf/2606.13566v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.58, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Current discussions of AI in scientific discovery are often dominated by two visible capabilities: search over existing knowledge and execution through optimization, simulation, and automation. Both are important, but neither fully captures the central act of discovery: the formation and evolution of models.", "key_contribution": "Current discussions of AI in scientific discovery are often dominated by two visible capabilities: search over existing knowledge and execution through optimization, simulation, and automation.", "why_it_matters": "A Three-Layer Framework for AI in Scientific Discovery represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Current discussions of AI in scientific discovery are often dominated by two visible capabilities: search over existing…", "biggest_caveat": "but neither fully captures the central act of discovery: the formation and evolution of models.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2606.13566v1", "difficulty": "frontier" }, { "id": "arxiv:2509.24575", "source": "arxiv", "source_type": "preprint", "title": "Prompting Robot Teams with Natural Language", "abstract": "This paper presents a framework to prompt multi-robot teams with high-level tasks using natural language expressions. Our objective is to use the reasoning capabilities of language models in understanding and decomposing multi-robot collaboration and decision-making tasks, but in settings where such models cannot be called at deployment time. However, it is hard to specify the behavior of an individual robot from a team instruction, and have it continuously adapt to actions from other robots. This necessitates a framework with the representational capacity required by the logic and semantics of a task, and yet supports decentralized, real-time operation. We solve this dilemma by recognizing that a task can be represented as a deterministic finite automaton, and that recurrent neural networks (RNNs) can encode numerous automata. This allows us to distill the logic and sequential decompositions of sub-tasks obtained from a language model into an RNN, and align its internal states with the semantics of a given task. This leads to a tiny model that encapsulates the reasoning of the language model and can be implemented onboard. To interpret the internal state of the RNN for a decentralized execution, we train a graph neural network control policy conditioned on the hidden states of the RNN and the language embeddings. We present evaluations on simulated and real-world multi-robot tasks that require sequential and collaborative behavior by the team, demonstrating scalable, robust, real-time performance -- sites.google.com/view/prompting-teams.", "authors": [ "Eduardo Sebastián", "Nicolas Pfitzer", "Ajay Shankar", "Amanda Prorok" ], "year": 2026, "published_date": "2026-06-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.24575", "pdf_url": "https://arxiv.org/pdf/2509.24575", "citations": 0, "topics": [], "tags": [ "Reasoning", "GNNs", "Robotics", "Multi-Agent Systems", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (GNNs) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.76, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper presents a framework to prompt multi-robot teams with high-level tasks using natural language expressions. Our objective is to use the reasoning capabilities of language models in understanding and decomposing multi-robot collaboration and decision-making tasks, but in settings where such models cannot be called at deployment time.", "key_contribution": "We present evaluations on simulated and real-world multi-robot tasks that require sequential and collaborative behavior by the team, demonstrating scalable, robust, real-time performance -- sites.google.com/view/prompting-teams.", "why_it_matters": "Prompting Robot Teams with Natural Language represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We present evaluations on simulated and real-world multi-robot tasks that require sequential and collaborative behavior…", "biggest_caveat": "but in settings where such models cannot be called at deployment time.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2509.24575", "difficulty": "advanced" }, { "id": "arxiv:2602.17753", "source": "arxiv", "source_type": "preprint", "title": "The 2025 AI Agent Index: Documenting Technical and Safety Features of Deployed Agentic AI Systems", "abstract": "Agentic AI systems are increasingly capable of performing professional and personal tasks with limited human involvement. However, tracking these developments is difficult because the AI agent ecosystem is complex, rapidly evolving, and inconsistently documented, posing obstacles to both researchers and policymakers. To address these challenges, this paper presents the 2025 AI Agent Index. The Index documents information regarding the origins, design, capabilities, ecosystem, and safety features of 30 state-of-the-art AI agents based on publicly available information and email correspondence with developers. In addition to documenting information about individual agents, the Index illuminates broader trends in the development of agents, their capabilities, and the level of transparency of developers. Notably, we find different transparency levels among agent developers and observe that most developers share little information about safety, evaluations, and societal impacts. The 2025 AI Agent Index is available online at https://aiagentindex.mit.edu", "authors": [ "Leon Staufer", "Kevin Feng", "Kevin Wei", "Luke Bailey", "Yawen Duan", "Mick Yang", "A. Pinar Ozisik", "Stephen Casper", "Noam Kolt" ], "year": 2026, "published_date": "2026-05-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.17753", "pdf_url": "https://arxiv.org/pdf/2602.17753", "citations": 0, "topics": [], "tags": [ "AI Agents", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.16, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agentic AI systems are increasingly capable of performing professional and personal tasks with limited human involvement. However, tracking these developments is difficult because the AI agent ecosystem is complex, rapidly evolving, and inconsistently documented, posing obstacles to both researchers and policymakers.", "key_contribution": "Agentic AI systems are increasingly capable of performing professional and personal tasks with limited human involvement.", "why_it_matters": "The 2025 AI Agent Index: Documenting Technical and Safety Features of Deployed Agentic AI Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "Agentic AI systems are increasingly capable of performing professional and personal tasks with limited human…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2602.17753", "difficulty": "intermediate" }, { "id": "arxiv:2606.28779", "source": "arxiv", "source_type": "preprint", "title": "Telephony Voice Agent for Banking Services", "abstract": "This paper proposes a voice-powered AI-based banking system based on Google Conversational Agent, Dialogflow CX, which provides safe and convenient banking by phone. The system supports essential banking functions such as balance inquiries, transaction history retrieval, card activations, PIN-based authentication of sensitive tasks, smooth live agent handoff for complex and out-of-scope queries, and ensures seamless handover to human agents when required. These tests were performed with high-duration calls, high concurrency, and noisy environments; the system proved to be scalable, responsive, and resilient. All the data used is safely stored in the cloud environment for efficiency and security in real-time voice interactions. A voice-based banking solution that is efficient and easy to use can be provided through this.", "authors": [ "Nitya Dhagat", "Vipul K. Dabhi", "Harshadkumar B. Prajapati", "Zankhana J. Barad" ], "year": 2026, "published_date": "2026-06-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.28779", "pdf_url": "https://arxiv.org/pdf/2606.28779", "citations": 0, "topics": [], "tags": [ "Dialogue", "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.83, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper proposes a voice-powered AI-based banking system based on Google Conversational Agent, Dialogflow CX, which provides safe and convenient banking by phone. The system supports essential banking functions such as balance inquiries, transaction history retrieval, card activations, PIN-based authentication of sensitive tasks, smooth live agent handoff for complex and out-of-scope queries, and ensures seamless handover to human agents when required.", "key_contribution": "This paper proposes a voice-powered AI-based banking system based on Google Conversational Agent, Dialogflow CX, which provides safe and convenient banking by phone.", "why_it_matters": "Telephony Voice Agent for Banking Services represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Dialogue.", "one_line_takeaway": "This paper proposes a voice-powered AI-based banking system based on Google Conversational Agent, Dialogflow CX, which…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Dialogue.", "url": "https://arxiv.org/abs/2606.28779", "difficulty": "intermediate" }, { "id": "arxiv:2510.22126", "source": "arxiv", "source_type": "preprint", "title": "EasyUUV: An LLM-Enhanced Universal and Lightweight Sim-to-Real Reinforcement Learning Framework for UUV Attitude Control", "abstract": "Despite recent advances in Unmanned Underwater Vehicle (UUV) attitude control, existing methods still struggle with generalizability, robustness to real-world disturbances, and efficient deployment. To address the above challenges, this paper presents EasyUUV, a Large Language Model (LLM)-enhanced, platform-agnostic, and lightweight simulation-to-reality reinforcement learning (RL) framework for robust attitude control of UUVs. EasyUUV combines parallelized RL training with a hybrid control architecture, where a learned policy outputs high-level attitude corrections executed by an adaptive S-Surface controller. A multimodal LLM is further integrated to adaptively tune controller parameters at runtime using visual and textual feedback, enabling training-free adaptation to unmodeled dynamics. Also, we have developed a low-cost 6-DoF UUV platform and applied an RL policy trained through efficient parallelized simulation. Extensive simulation and real-world experiments validate the effectiveness and adaptive performance of EasyUUV in achieving robust and adaptive UUV attitude control across diverse underwater conditions. To facilitate reproducibility, the source code, LLM prompts, video, and the supplementary material are provided in the following repositories: Homepage: https://360zmem.github.io/easyuuv/ Video:https://youtu.be/m2yLQzxiIL Supplementary Material: https://drive.google.com/file/d/1ImMiyGIPoPyj2ATnXQwbiuOroTSZ2SSs", "authors": [ "Guanwen Xie", "Jingzehua Xu", "Jiwei Tang", "Yubo Huang", "Zixi Wang", "Shuai Zhang", "Dongfang Ma", "Juntian Qu", "Xiaofan Li" ], "year": 2026, "published_date": "2026-06-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.22126", "pdf_url": "https://arxiv.org/pdf/2510.22126", "citations": 0, "topics": [], "tags": [ "LLMs", "Multimodal", "RL", "Robotics", "Adversarial" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.76, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Despite recent advances in Unmanned Underwater Vehicle (UUV) attitude control, existing methods still struggle with generalizability, robustness to real-world disturbances, and efficient deployment. To address the above challenges, this paper presents EasyUUV, a Large Language Model (LLM)-enhanced, platform-agnostic, and lightweight simulation-to-reality reinforcement learning (RL) framework for robust attitude control of UUVs.", "key_contribution": "Despite recent advances in Unmanned Underwater Vehicle (UUV) attitude control, existing methods still struggle with generalizability, robustness to real-world disturbances, and efficient deployment.", "why_it_matters": "EasyUUV: An LLM-Enhanced Universal and Lightweight Sim-to-Real Reinforcement Learning Framework for UUV Attitude Control represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Despite recent advances in Unmanned Underwater Vehicle (UUV) attitude control, existing methods still struggle with…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2510.22126", "difficulty": "advanced" }, { "id": "arxiv:2605.12280", "source": "arxiv", "source_type": "preprint", "title": "Iterative Audit Convergence in LLM-Managed Multi-Agent Systems: A Case Study in Prompt-Engineering Quality Assurance", "abstract": "Prompt specifications for multi-agent large language model (LLM) systems carry data contracts and integration logic across interdependent files but are rarely subjected to structured-inspection rigor. We report a single-system case study of iterative, agent-driven auditing applied to AEGIS (Autonomous Engineering Governance and Intelligence System), a seven-lane production pipeline whose 7152-line specification surface was audited across nine rounds, surfacing 51 consistency defects (per-round counts of 15, 8, 12, 2, 8, 1, 4, 1, 0). We present a seven-category post hoc taxonomy with explicit coding rules, non-monotonic convergence consistent with cascading edits and audit-scope expansion, and a locked audit protocol. We further report two partial replications on a public synthetic mini-specification: a cross-LLM panel of four frontier vendors (OpenAI, Anthropic, Google, xAI; 12 traces; multi-vendor union detects all five seeded defects) and an inter-rater reliability check on a stratified subsample (Cohen's $κ$ = 0.80 on category, 0.46 on severity). The full reproducibility bundle accompanies the submission.", "authors": [ "Elias Calboreanu" ], "year": 2026, "published_date": "2026-06-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.12280", "pdf_url": "https://arxiv.org/pdf/2605.12280", "citations": 0, "topics": [], "tags": [ "LLMs", "Software Engineering", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.29, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Prompt specifications for multi-agent large language model (LLM) systems carry data contracts and integration logic across interdependent files but are rarely subjected to structured-inspection rigor. We report a single-system case study of iterative, agent-driven auditing applied to AEGIS (Autonomous Engineering Governance and Intelligence System), a seven-lane production pipeline whose 7152-line specification surface was audited across nine rounds, surfacing 51 consistency defects (per-round counts of 15, 8, 12, 2, 8, 1, 4, 1, 0).", "key_contribution": "We present a seven-category post hoc taxonomy with explicit coding rules, non-monotonic convergence consistent with cascading edits and audit-scope expansion, and a locked audit protocol.", "why_it_matters": "Iterative Audit Convergence in LLM-Managed Multi-Agent Systems: A Case Study in Prompt-Engineering Quality Assurance represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a seven-category post hoc taxonomy with explicit coding rules, non-monotonic convergence consistent with…", "biggest_caveat": "but are rarely subjected to structured-inspection rigor.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.12280", "difficulty": "intermediate" }, { "id": "arxiv:2606.16534", "source": "arxiv", "source_type": "preprint", "title": "Generated, Parallel, Scalable? A Study of Agentic AI-Generated Julia Code on Supercomputers", "abstract": "Julia is increasingly used in HPC as a single-language alternative to combining high-level scripting with low-level systems languages, but achieving scalable performance still requires expertise in parallel programming. LLMs are increasingly used for code generation and are advancing rapidly with each new version. Yet, existing studies focus on single-shot prompting rather than agentic settings, in which an LLM autonomously plans, generates, and refines code through tool use. Using an OpenCode-based agent extended with a Julia-documentation MCP server, we study agentic generation of parallel Julia code, focusing on task-based execution with Dagger$.$jl. We evaluate three LLMS, OpenAI GPT-5.5, Anthropic Claude Opus 4.7, and the open-weight Qwen3-Coder-Next, on three problems with distinct parallel structures: Pi approximation, tiled general matrix multiplication, and tiled Cholesky decomposition. The generated Dagger$.$jl implementations are compared against agent-generated Base$.$Threads and MPI$.$jl baselines, with shared-memory experiments scaling to 192 cores and distributed-memory experiments on two nodes. The agents reliably produce executable code for small inputs but fail at larger scales due to deadlocks, oversubscription, or out-of-memory errors, with the open-weight model affected most severely. The two commercial models scale comparably on Base$.$Threads and MPI$.$jl, while their Dagger$.$jl implementations expose recurring weaknesses in task dependencies, granularity, and scheduling. Agentic AI is promising for producing parallel Julia code, but generating robust, performance-aware implementations for large-scale HPC systems remains an open challenge.", "authors": [ "Linus Bantel", "Anna-Lena Roth", "Jonas Posner", "Dirk Pflüger" ], "year": 2026, "published_date": "2026-06-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.16534", "pdf_url": "https://arxiv.org/pdf/2606.16534", "citations": 0, "topics": [], "tags": [ "AI Agents", "Code Generation", "Distributed Computing" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.45, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Julia is increasingly used in HPC as a single-language alternative to combining high-level scripting with low-level systems languages, but achieving scalable performance still requires expertise in parallel programming. LLMs are increasingly used for code generation and are advancing rapidly with each new version.", "key_contribution": "Julia is increasingly used in HPC as a single-language alternative to combining high-level scripting with low-level systems languages, but achieving scalable performance still requires expertise in parallel programming.", "why_it_matters": "Generated, Parallel, Scalable? A Study of Agentic AI-Generated Julia Code on Supercomputers represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "Julia is increasingly used in HPC as a single-language alternative to combining high-level scripting with low-level…", "biggest_caveat": "but achieving scalable performance still requires expertise in parallel programming.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2606.16534", "difficulty": "intermediate" }, { "id": "arxiv:2604.13085", "source": "arxiv", "source_type": "preprint", "title": "Adaptive Memory Crystallization for Autonomous AI Agent Learning in Dynamic Environments", "abstract": "Autonomous AI agents operating in dynamic environments face a persistent challenge: acquiring new capabilities without erasing prior knowledge. We present Adaptive Memory Crystallization (AMC), a memory architecture for progressive experience consolidation in continual reinforcement learning. AMC is conceptually inspired by the qualitative structure of synaptic tagging and capture (STC) theory, the idea that memories transition through discrete stability phases, but makes no claim to model the underlying molecular or synaptic mechanisms. AMC models memory as a continuous crystallization process in which experiences migrate from plastic to stable states according to a multi-objective utility signal. The framework introduces a three-phase memory hierarchy (Liquid--Glass--Crystal) governed by an Itô stochastic differential equation (SDE) whose population-level behavior is captured by an explicit Fokker--Planck equation admitting a closed-form Beta stationary distribution. We provide proofs of: (i) well-posedness and global convergence of the crystallization SDE to a unique Beta stationary distribution; (ii) exponential convergence of individual crystallization states to their fixed points, with explicit rates and variance bounds; and (iii) end-to-end Q-learning error bounds and matching memory-capacity lower bounds that link SDE parameters directly to agent performance. Empirical evaluation on Meta-World MT50, Atari 20-game sequential learning, and MuJoCo continual locomotion consistently shows improvements in forward transfer (+34--43\\% over the strongest baseline), reductions in catastrophic forgetting (67--80\\%), and a 62\\% decrease in memory footprint.", "authors": [ "Rajat Khanda", "Mohammad Baqar", "Sambuddha Chakrabarti", "Satyasaran Changdar" ], "year": 2026, "published_date": "2026-06-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.13085", "pdf_url": "https://arxiv.org/pdf/2604.13085", "citations": 0, "topics": [], "tags": [ "AI Agents", "Continual Learning", "RL", "Artificial Intelligence", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.51, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Autonomous AI agents operating in dynamic environments face a persistent challenge: acquiring new capabilities without erasing prior knowledge. We present Adaptive Memory Crystallization (AMC), a memory architecture for progressive experience consolidation in continual reinforcement learning.", "key_contribution": "We present Adaptive Memory Crystallization (AMC), a memory architecture for progressive experience consolidation in continual reinforcement learning.", "why_it_matters": "Adaptive Memory Crystallization for Autonomous AI Agent Learning in Dynamic Environments represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We present Adaptive Memory Crystallization (AMC), a memory architecture for progressive experience consolidation in…", "biggest_caveat": "but makes no claim to model the underlying molecular or synaptic mechanisms.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2604.13085", "difficulty": "frontier" }, { "id": "arxiv:2605.06738", "source": "arxiv", "source_type": "preprint", "title": "From Specification to Deployment: Empirical Evidence from a W3C VC + DID Trust Infrastructure for Autonomous Agents", "abstract": "Autonomous AI agents now transact at production scale -- 69,000 bots executing 165 million transactions across 50 million USDC in cumulative volume on a single marketplace -- without any shared trust layer between participants. Regulatory frameworks (Singapore IMDA, NIST CAISI, EU AI Act) and major AI laboratories (Anthropic, Google) have independently converged on the same structural requirement: an open, portable, cryptographically verifiable trust infrastructure for autonomous agents that no single vendor can deliver alone. This paper presents MolTrust, a production-deployed implementation of such an infrastructure built on W3C Verifiable Credentials 2.0 and Decentralized Identifiers v1.0, with on-chain anchoring on Base Layer 2. The system architecture is organized around four primitives (identity, authorization, behavioral record, portability), a five-party accountability chain, and the Agent Authorization Envelope (AAE) -- a machine-evaluable authorization structure enforced at three layers: cryptographic signatures, API-level credential lifecycle management, and kernel-level syscall monitoring via Falco eBPF integration. The paper documents three distinguishing capabilities: kernel-layer AAE enforcement below the agent process boundary; cross-protocol interoperability through five reproducible test vectors verified against independent implementations; and layered Sybil resistance combining dual-signature interaction proofs, cross-vertical endorsement diversity gating, and principal-DID-linked violation persistence. The reference implementation has been operational since March 2026 across eight credential verticals. Empirical validation at adversarial scale is pending. The contribution is deployment-first evidence that the trust infrastructure regulators and industry have converged on is implementable today using W3C-standardized primitives.", "authors": [ "Lars Kersten Kroehl" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.06738", "pdf_url": "https://arxiv.org/pdf/2605.06738", "citations": 0, "topics": [], "tags": [ "AI Agents", "Artificial Intelligence", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.68, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Autonomous AI agents now transact at production scale -- 69,000 bots executing 165 million transactions across 50 million USDC in cumulative volume on a single marketplace -- without any shared trust layer between participants. Regulatory frameworks (Singapore IMDA, NIST CAISI, EU AI Act) and major AI laboratories (Anthropic, Google) have independently converged on the same structural requirement: an open, portable, cryptographically verifiable trust infrastructure for autonomous agents that no single vendor can deliver alone.", "key_contribution": "Autonomous AI agents now transact at production scale -- 69,000 bots executing 165 million transactions across 50 million USDC in cumulative volume on a single marketplace -- without any shared trust layer between participants.", "why_it_matters": "From Specification to Deployment: Empirical Evidence from a W3C VC + DID Trust Infrastructure for Autonomous Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "Autonomous AI agents now transact at production scale -- 69,000 bots executing 165 million transactions across 50…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2605.06738", "difficulty": "intermediate" }, { "id": "arxiv:2606.14445", "source": "arxiv", "source_type": "preprint", "title": "tap: A File-Based Protocol for Heterogeneous LLM Agent Collaboration", "abstract": "Existing multi-agent software development systems have proposed many forms of agent collaboration, including role-based collaboration and automated code review. However, many systems assume a common runtime, a central conversation server, or the same API family. Under these assumptions, LLM agents from different vendors cannot easily exchange messages directly from their own execution environments while dividing development and review work on a shared codebase. This paper presents tap, a file-based collaboration protocol that allows Claude (Anthropic) and Codex (OpenAI) to collaborate on one codebase without shared memory or an identical runtime. The core of tap is a file-first design that preserves markdown files with metadata as original messages, combines a file inspection path (file communication, Tier 1) with real-time notification paths for Claude and Codex (real-time communication, Tier 2), and isolates work through separate git worktrees. Even if real-time notification fails or a receiver restarts, the message file remains available and the same content can be inspected again. In a 27-day, 37-generation self-applied operation where tap was used to develop and review itself, we collected 209 tap-related pull requests and 717 operational artifacts. An analysis of 375 review artifacts showed that the share of reviews recording at least one defect or requested change was 69.8% for heterogeneous model pairs and 53.1% for homogeneous model pairs. These results show that tap, which combines file-based message preservation with real-time notification, operates in a real production repository, and that combining heterogeneous models and execution environments can broaden review perspectives. tap is distributed as the open-source npm package @hua-labs/tap (v0.5.2).", "authors": [ "Minseo Kim" ], "year": 2026, "published_date": "2026-06-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.14445", "pdf_url": "https://arxiv.org/pdf/2606.14445", "citations": 0, "topics": [], "tags": [ "Dialogue", "Code Generation", "Artificial Intelligence", "Software Engineering", "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Existing multi-agent software development systems have proposed many forms of agent collaboration, including role-based collaboration and automated code review. However, many systems assume a common runtime, a central conversation server, or the same API family.", "key_contribution": "These results show that tap, which combines file-based message preservation with real-time notification, operates in a real production repository, and that combining heterogeneous models and execution environments can broaden review perspectives.", "why_it_matters": "tap: A File-Based Protocol for Heterogeneous LLM Agent Collaboration represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Dialogue.", "one_line_takeaway": "These results show that tap, which combines file-based message preservation with real-time notification, operates in a…", "biggest_caveat": "However, many systems assume a common runtime, a central conversation server, or the same API family.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Dialogue.", "url": "https://arxiv.org/abs/2606.14445", "difficulty": "intermediate" }, { "id": "arxiv:2606.14589", "source": "arxiv", "source_type": "preprint", "title": "When Errors Become Narratives: A Longitudinal Taxonomy of Silent Failures in a Production LLM Agent Runtime", "abstract": "LLM agent systems increasingly run as long-lived autonomous runtimes: scheduling jobs, calling tools, maintaining memory, and pushing results to humans. We present a longitudinal study of silent failures in one such system: a personal-assistant agent runtime in continuous production since March 2026, with roughly 40 scheduled jobs, 8 LLM providers, a tool-governance proxy, and a knowledge-base memory plane, defended by 4,286 unit tests and 827 governance checks. Over eight weeks we documented 22 incidents with full root-cause postmortems, in which one meta-pattern -- a failure whose error signal never reaches a human in actionable form -- manifested at least 28 times. We derive a five-class, mechanism-oriented taxonomy: (A) environment and platform quirks, (B) design-assumption mismatches, (C) error swallowing and dilution, (D) chained hallucination and fabrication, (E) operational omission and forensic blind spots. Class D is unique to LLM systems and the most dangerous: the system does not merely fail to report an error -- the LLM transforms it into fluent, plausible narrative delivered to the user. We term this fail-plausible: gray failure's differential observability escalated -- the observer is not just blind, it is convincingly lied to by the failure itself. Three findings: about 70% of silent failures were caught by human user-view observation, not tests or audits; a retrospective audit of 15 incidents found 0% ex-ante prevention but 87% regression blocking -- audits are regression engines, not prediction engines; incident latency (13 hours to 60 days) tracks failure mechanism, not code complexity -- the longest-lived failures lived in the seams between components, where no test runs. We describe the resulting defense framework and distill design principles for agent systems whose failures are loud, attributable, and boring. All postmortems and artifacts are public.", "authors": [ "Wei Wu" ], "year": 2026, "published_date": "2026-06-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.14589", "pdf_url": "https://arxiv.org/pdf/2606.14589", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "Artificial Intelligence", "Distributed Computing", "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "LLM agent systems increasingly run as long-lived autonomous runtimes: scheduling jobs, calling tools, maintaining memory, and pushing results to humans. We present a longitudinal study of silent failures in one such system: a personal-assistant agent runtime in continuous production since March 2026, with roughly 40 scheduled jobs, 8 LLM providers, a tool-governance proxy, and a knowledge-base memory plane, defended by 4,286 unit tests and 827 governance checks.", "key_contribution": "We present a longitudinal study of silent failures in one such system: a personal-assistant agent runtime in continuous production since March 2026, with roughly 40 scheduled jobs, 8 LLM providers, a tool-governance proxy, and a knowledge-base memory plane, defended by 4,286 unit tests and 827 governance checks.", "why_it_matters": "When Errors Become Narratives: A Longitudinal Taxonomy of Silent Failures in a Production LLM Agent Runtime represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a longitudinal study of silent failures in one such system: a personal-assistant agent runtime in continuous…", "biggest_caveat": "does not merely fail to report an error -- the LLM transforms it into fluent, plausible narrative delivered to the user.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.14589", "difficulty": "intermediate" }, { "id": "arxiv:2606.12797", "source": "arxiv", "source_type": "preprint", "title": "The Containment Gap: How Deployed Agentic AI Frameworks Fail Public-Facing Safety Requirements", "abstract": "Agentic large language model systems that autonomously invoke tools, maintain persistent memory, and execute multi-step plans are increasingly deployed in public-facing domains, including government services, healthcare triage, and financial advising. We ask whether the frameworks used to build these systems provide architectural-level structural safety guarantees. Applying six containment principles derived from a compositional model of agentic architectures, we audit three dominant frameworks (LangChain, AutoGPT, and OpenAI Agents SDK) and find no native compliance in any of them. Memory integrity, a defense against one of the most prevalent vulnerability classes, is not observed in any of the three evaluated frameworks. We validate these findings empirically: in a simulated government benefits agent built on LangChain, a single memory-poisoning write induces persistent targeted corruption across all tested seeds and backends, increasing the wrongful denial rate for targeted applicants to 88.9%. Under a complex five-factor policy, the same attack preserves aggregate accuracy while increasing targeted wrongful denials by 3.5x, rendering the corruption difficult to detect through standard monitoring. We then introduce two lightweight containment mechanisms: a memory integrity validator and a policy gate, which eliminate both attack vectors with sub-millisecond overhead (<0.2ms per call). We conclude that the current agentic framework ecosystem may not yet meet secure-by-default expectations for public-facing deployments and outline priority architectural interventions to enable trustworthy deployment in high-stakes, socially impactful applications.", "authors": [ "Md Jafrin Hossain", "Mohammad Arif Hossain", "Weiqi Liu", "Nirwan Ansari" ], "year": 2026, "published_date": "2026-06-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.12797", "pdf_url": "https://arxiv.org/pdf/2606.12797", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.96, "content_potential_score": 1.84, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agentic large language model systems that autonomously invoke tools, maintain persistent memory, and execute multi-step plans are increasingly deployed in public-facing domains, including government services, healthcare triage, and financial advising. We ask whether the frameworks used to build these systems provide architectural-level structural safety guarantees.", "key_contribution": "We then introduce two lightweight containment mechanisms: a memory integrity validator and a policy gate, which eliminate both attack vectors with sub-millisecond overhead (<0.2ms per call).", "why_it_matters": "The Containment Gap: How Deployed Agentic AI Frameworks Fail Public-Facing Safety Requirements represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We then introduce two lightweight containment mechanisms: a memory integrity validator and a policy gate, which…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.12797", "difficulty": "intermediate" }, { "id": "arxiv:2606.11145v1", "source": "arxiv", "source_type": "preprint", "title": "OpenPCC: Open and Confidential LLM Serving on Commodity TEEs", "abstract": "Generative AI applications such as personal AI agents, image generators, and chat assistants offer advanced capabilities to improve user experience. Behind the scenes, Large Language Models (LLMs) that power these services require a massive amount of computation and are usually deployed in the cloud, available as APIs, meaning that a user's request has to be sent to a Cloud Inference Service (CIS) for processing. However, the strong capabilities of LLM also mean that user's requests now contain much more personal sensitive or enterprise confidential information, demanding equally strong protection in CIS. While early industry efforts such as Apple Private Cloud Compute (PCC) and Google Private AI Compute have emerged to show the potential of secure CIS, they are not adoptable for deployment by others due to their reliance on proprietary hardware and closed ecosystem. In addition, they all suffer from their own design glitches that can undermine the ambitious goal of bringing in true privacy protection to end users. In this paper, we present our analysis of the fundamental requirements of building a secure yet open CIS. We then present OpenPCC, a Confidential CIS framework that does not rely on proprietary hardware but instead uses commercially available TEEs. We implement an open-source prototype and characterize it end-to-end on a Llama-3 8B vLLM workload, separating OpenPCC's own cost from the underlying TEE hardware. Our analysis and evaluation demonstrated the feasibility and security of the system.", "authors": [ "Haoling Zhou", "Shixuan Zhao", "Chao Wang", "Zhiqiang Lin" ], "year": 2026, "published_date": "2026-06-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.11145v1", "pdf_url": "https://arxiv.org/pdf/2606.11145v1", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.37, "content_potential_score": 1.84, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Generative AI applications such as personal AI agents, image generators, and chat assistants offer advanced capabilities to improve user experience. Behind the scenes, Large Language Models (LLMs) that power these services require a massive amount of computation and are usually deployed in the cloud, available as APIs, meaning that a user's request has to be sent to a Cloud Inference Service (CIS) for processing.", "key_contribution": "While early industry efforts such as Apple Private Cloud Compute (PCC) and Google Private AI Compute have emerged to show the potential of secure CIS, they are not adoptable for deployment by others due to their reliance on proprietary hardware and closed ecosystem.", "why_it_matters": "OpenPCC: Open and Confidential LLM Serving on Commodity TEEs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "While early industry efforts such as Apple Private Cloud Compute (PCC) and Google Private AI Compute have emerged to…", "biggest_caveat": "does not rely on proprietary hardware but instead uses commercially available TEEs.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2606.11145v1", "difficulty": "intermediate" }, { "id": "arxiv:2602.05746", "source": "arxiv", "source_type": "preprint", "title": "Learning to Inject: Automated Prompt Injection via Reinforcement Learning", "abstract": "Prompt injection is a critical vulnerability in LLM agents, yet the strongest methods still rely on human red-teamers and hand-crafted prompts. Adapting automated jailbreak optimizers does not close this gap: jailbreaks shape models toward generic compliance, while prompt injection requires emitting specific tool calls with correct parameters. The success signal is binary, and randomly sampled suffixes almost never trigger it, so standard optimizers have no gradient to follow. We present AutoInject, a black-box reinforcement learning (RL) framework that learns adversarial suffixes for prompt injection. A learned comparison-based reward scores each candidate against the best suffix seen so far, turning the binary signal into a dense reward suitable for RL optimization. The framework supports both online query-based attacks and offline-trained transferable suffixes that need no utility access at deployment, and incorporates a utility objective when task-completion feedback is available. On AgentDojo, AutoInject outperforms template attacks, GCG, TAP, and adaptive attack across production models, with statistically significant improvements under McNemar's test with p<0.05. Suffixes learned by AutoInject also break Meta-SecAlign-70B, a model fine-tuned specifically to resist prompt injection, where template attacks fail outright. The results establish an automated baseline for prompt injection and expose a gap between preference-based defenses and adaptive optimization-based attackers.", "authors": [ "Xin Chen", "Jie Zhang", "Florian Tramèr" ], "year": 2026, "published_date": "2026-06-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.05746", "pdf_url": "https://arxiv.org/pdf/2602.05746", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "AI Safety", "RL", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.93, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Prompt injection is a critical vulnerability in LLM agents, yet the strongest methods still rely on human red-teamers and hand-crafted prompts. Adapting automated jailbreak optimizers does not close this gap: jailbreaks shape models toward generic compliance, while prompt injection requires emitting specific tool calls with correct parameters.", "key_contribution": "We present AutoInject, a black-box reinforcement learning (RL) framework that learns adversarial suffixes for prompt injection.", "why_it_matters": "Learning to Inject: Automated Prompt Injection via Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present AutoInject, a black-box reinforcement learning (RL) framework that learns adversarial suffixes for prompt…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2602.05746", "difficulty": "advanced" }, { "id": "arxiv:2604.07821v1", "source": "arxiv", "source_type": "preprint", "title": "More Capable, Less Cooperative? When LLMs Fail At Zero-Cost Collaboration", "abstract": "Large language model (LLM) agents increasingly coordinate in multi-agent systems, yet we lack an understanding of where and why cooperation failures may arise. In many real-world coordination problems, from knowledge sharing in organizations to code documentation, helping others carries negligible personal cost while generating substantial collective benefits. However, whether LLM agents cooperate when helping neither benefits nor harms the helper, while being given explicit instructions to do so, remains unknown. We build a multi-agent setup designed to study cooperative behavior in a frictionless environment, removing all strategic complexity from cooperation. We find that capability does not predict cooperation: OpenAI o3 achieves only 17% of optimal collective performance while OpenAI o3-mini reaches 50%, despite identical instructions to maximize group revenue. Through a causal decomposition that automates one side of agent communication, we separate cooperation failures from competence failures, tracing their origins through agent reasoning analysis. Testing targeted interventions, we find that explicit protocols double performance for low-competence models, and tiny sharing incentives improve models with weak cooperation. Our findings suggest that scaling intelligence alone will not solve coordination problems in multi-agent systems and will require deliberate cooperative design, even when helping others costs nothing.", "authors": [ "Advait Yadav", "Sid Black", "Oliver Sourbut" ], "year": 2026, "published_date": "2026-04-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.07821v1", "pdf_url": "https://arxiv.org/pdf/2604.07821v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Artificial Intelligence", "NLP", "Reasoning & Chain-of-Thought" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.82, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language model (LLM) agents increasingly coordinate in multi-agent systems, yet we lack an understanding of where and why cooperation failures may arise. In many real-world coordination problems, from knowledge sharing in organizations to code documentation, helping others carries negligible personal cost while generating substantial collective benefits.", "key_contribution": "Large language model (LLM) agents increasingly coordinate in multi-agent systems, yet we lack an understanding of where and why cooperation failures may arise.", "why_it_matters": "More Capable, Less Cooperative? When LLMs Fail At Zero-Cost Collaboration represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Large language model (LLM) agents increasingly coordinate in multi-agent systems, yet we lack an understanding of where…", "biggest_caveat": "However, whether LLM agents cooperate when helping neither benefits nor harms the helper, while being given explicit instructions to do so, remains unknown.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.07821v1", "difficulty": "intermediate" }, { "id": "arxiv:2606.05185", "source": "arxiv", "source_type": "preprint", "title": "Drishti AI-Event Guardian: An Intelligent Real-Time Crowd Monitoring and Emergency Response System for Mass Gathering Events", "abstract": "Mass gathering events are associated with critical safety incidents caused by insufficient crowd monitoring and inadequate emergency response coordination. Traditional surveillance systems lack intelligent analytics, resulting in delayed threat identification, poor resource deployment, and weak support for vulnerable individuals during dense public assemblies. This paper presents Drishti AI-Event Guardian, an intelligent crowd management framework using deep learning for public safety enhancement. The architecture combines multimodal data from CCTV networks and UAV platforms, processed by models on Google Vertex AI infrastructure. Core methods include real-time crowd density estimation using YOLOv8, spatiotemporal anomaly detection, and predictive crowd-flow modeling through gradient-boosted regression. Drishti also integrates four modules: (i) facial recognition for missing person identification with crowd-wide notification; (ii) medical emergency reporting with automated dispatch; (iii) a conversational AI chatbot for reports and complaints; and (iv) an intelligent guard reallocation engine that dynamically reassigns personnel in response to crowd density changes. The system is evaluated on two scenarios: the Kumbh Mela gathering and the RCB Victory Parade event, achieving crowd density estimation MAE of 3.2 persons/m2, anomaly detection F1-score of 0.91, facial recognition precision of 0.93, and median alert latency of 111 ms. Predictive congestion modeling provides five-minute forecasts with MAPE of 8.3%, enabling preemptive intervention. The chatbot resolved 89% of incident filings without human operators, while guard reallocation reduced responder deployment latency by 34% versus manual reassignment. Results demonstrate a shift from passive surveillance toward active crowd intelligence and scalable foundation for events from local gatherings to mega festivals.", "authors": [ "Ritabrata Roy Choudhury", "Arkajyoti Karmakar", "Rudra Pratap Mitra" ], "year": 2026, "published_date": "2026-04-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.05185", "pdf_url": "https://arxiv.org/pdf/2606.05185", "citations": 0, "topics": [], "tags": [ "Multimodal", "Dialogue", "Machine Learning", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.73, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Mass gathering events are associated with critical safety incidents caused by insufficient crowd monitoring and inadequate emergency response coordination. Traditional surveillance systems lack intelligent analytics, resulting in delayed threat identification, poor resource deployment, and weak support for vulnerable individuals during dense public assemblies.", "key_contribution": "Results demonstrate a shift from passive surveillance toward active crowd intelligence and scalable foundation for events from local gatherings to mega festivals.", "why_it_matters": "Drishti AI-Event Guardian: An Intelligent Real-Time Crowd Monitoring and Emergency Response System for Mass Gathering Events advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "Results demonstrate a shift from passive surveillance toward active crowd intelligence and scalable foundation for…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2606.05185", "difficulty": "intermediate" }, { "id": "arxiv:2606.03755", "source": "arxiv", "source_type": "preprint", "title": "LAP: An Agent-to-Instrument Protocol for Autonomous Science", "abstract": "Autonomous science is moving from demonstration to infrastructure. Large language model agents now plan experiments, and self-driving laboratories execute them. Yet every such system rebuilds the link between the reasoning agent and the physical instrument from scratch, against fragmented vendor SDKs and standards built for deterministic software clients rather than probabilistic, goal-directed agents. Recent agent-interoperability protocols clarify two of the three edges of an agentic ecosystem (Anthropic's Model Context Protocol (MCP) standardizes the agent-to-tool edge, and Google's Agent2Agent (A2A) the agent-to-agent edge), but neither models the agent-to-instrument edge, where operations are stateful, safety-critical, exclusively owned, physically embodied, and produce measurements with units, calibration, and uncertainty. We present the Lab Agent Protocol (LAP), a protocol design that fills this gap. LAP retains A2A's peer-to-peer, discovery-first, task-lifecycle structure and adds four physical-world primitives: (i) the InstrumentCard, a signed capability and physical-limit description; (ii) first-class reservation for exclusive instrument and sample locking; (iii) a safety-fence handshake with operator-confirmation tokens cryptographically bound to a specific task and its parameters, gating hazardous and irreversible operations; and (iv) a MeasurementResult schema that makes every result physically typed (QUDT/UCUM), calibration-anchored, uncertainty-bearing, and reproducible by construction. We specify roles, a six-layer architecture, the JSON-RPC method set, the task and safety state machines, the error model, and cross-laboratory federation, and walk a closed-loop autonomous campaign through the protocol end-to-end. LAP is transport-compatible with the A2A/MCP ecosystem and encapsulates rather than replaces existing device standards such as SiLA 2 and OPC-UA.", "authors": [ "Linwu Zhu", "Liqiang Gao", "Yan Chen", "Dan Zhu", "Jian Huang" ], "year": 2026, "published_date": "2026-06-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.03755", "pdf_url": "https://arxiv.org/pdf/2606.03755", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.33, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Autonomous science is moving from demonstration to infrastructure. Large language model agents now plan experiments, and self-driving laboratories execute them.", "key_contribution": "We present the Lab Agent Protocol (LAP), a protocol design that fills this gap.", "why_it_matters": "LAP: An Agent-to-Instrument Protocol for Autonomous Science represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present the Lab Agent Protocol (LAP), a protocol design that fills this gap.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.03755", "difficulty": "beginner" }, { "id": "arxiv:2606.00485", "source": "arxiv", "source_type": "preprint", "title": "Confused ChatGPT: Cross-App Context Poisoning via First-Party APIs", "abstract": "ChatGPT Apps, launched by OpenAI on Oct. 6, 2025, introduce an app-in-app paradigm in which third-party applications share a single chat context with the user and with every other connected app. The ecosystem grew from 122 apps in Dec. 2025 to 888 by May 2026, yet its security has remained uninvestigated. We identify cross-app context poisoning, a variant of indirect prompt injection distinguished by three properties: 1) the injection persists in the shared chat context across turns; 2) the effect surfaces through a different co-resident app the user later invokes; and 3) the delivery vectors are first-party APIs exposed to every connected app. We find multiple APIs capable of writing app-controlled content into the shared context, with sendFollowUpMessage as the most direct and potent channel. Two undocumented parameters that the runtime silently accepts, systemPrompt and isVisible, amplify this channel to silent, system-priority writes. Leveraging this channel, we realize a confused-deputy attack in which a malicious app poisons the context so that the LLM, consulting that context, enables manipulation against benign co-resident apps. We demonstrate two payload styles (conditional and imperative) and evaluate them across six current ChatGPT models. The root cause is architectural: the LLM's context is a persistent, flat, untagged data store shared by user and apps, with no isolation. Every mature multi-tenant platform, from Multics virtual memory to Android UIDs and iOS sandbox profiles, paid the isolation cost before admitting third parties; ChatGPT Apps did not. Fixing this requires an architectural change, not a patch. We disclosed our findings to OpenAI; the undocumented parameters remain accessible at the time of writing, and the architectural gap is by design: the shared context that enables cross-app composition is the same flat namespace that enables cross-app poisoning.", "authors": [ "Chao Wang", "Somesh Jha", "Zhiqiang Lin" ], "year": 2026, "published_date": "2026-05-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.00485", "pdf_url": "https://arxiv.org/pdf/2606.00485", "citations": 0, "topics": [], "tags": [ "LLMs", "Robotics", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.33, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "ChatGPT Apps, launched by OpenAI on Oct. 6, 2025, introduce an app-in-app paradigm in which third-party applications share a single chat context with the user and with every other connected app.", "key_contribution": "6, 2025, introduce an app-in-app paradigm in which third-party applications share a single chat context with the user and with every other connected app.", "why_it_matters": "Confused ChatGPT: Cross-App Context Poisoning via First-Party APIs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "6, 2025, introduce an app-in-app paradigm in which third-party applications share a single chat context with the user…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.00485", "difficulty": "beginner" }, { "id": "arxiv:2604.21003v1", "source": "arxiv", "source_type": "preprint", "title": "The Last Harness You'll Ever Build", "abstract": "AI agents are increasingly deployed on complex, domain-specific workflows -- navigating enterprise web applications that require dozens of clicks and form fills, orchestrating multi-step research pipelines that span search, extraction, and synthesis, automating code review across unfamiliar repositories, and handling customer escalations that demand nuanced domain knowledge. \\textbf{Each new task domain requires painstaking, expert-driven harness engineering}: designing the prompts, tools, orchestration logic, and evaluation criteria that make a foundation model effective. We present a two-level framework that automates this process. At the first level, the \\textbf{Harness Evolution Loop} optimizes a worker agent's harness $\\mathcal{H}$ for a single task: a Worker Agent $W_{\\mathcal{H}}$ executes the task, an Evaluator Agent $V$ adversarially diagnoses failures and scores performance, and an Evolution Agent $E$ modifies the harness based on the full history of prior attempts. At the second level, the \\textbf{Meta-Evolution Loop} optimizes the evolution protocol $Λ= (W_{\\mathcal{H}}, \\mathcal{H}^{(0)}, V, E)$ itself across diverse tasks, \\textbf{learning a protocol $Λ^{(\\text{best})}$ that enables rapid harness convergence on any new task -- so that adapting an agent to a novel domain requires no human harness engineering at all.} We formalize the correspondence to meta-learning and present both algorithms. The framework \\textbf{shifts manual harness engineering into automated harness engineering}, and takes one step further -- \\textbf{automating the design of the automation itself}.", "authors": [ "Haebin Seong", "Li Yin", "Haoran Zhang" ], "year": 2026, "published_date": "2026-04-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.21003v1", "pdf_url": "https://arxiv.org/pdf/2604.21003v1", "citations": 0, "topics": [], "tags": [ "AI Agents", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.6, "content_potential_score": 0.76, "interestingness_score": 1.98, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "AI agents are increasingly deployed on complex, domain-specific workflows -- navigating enterprise web applications that require dozens of clicks and form fills, orchestrating multi-step research pipelines that span search, extraction, and synthesis, automating code review across unfamiliar repositories, and handling customer escalations that demand nuanced domain knowledge. \\textbf{Each new task domain requires painstaking, expert-driven harness engineering}: designing the prompts, tools, orchestration logic, and evaluation criteria that make a foundation model effective.", "key_contribution": "We present a two-level framework that automates this process.", "why_it_matters": "The Last Harness You'll Ever Build represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We present a two-level framework that automates this process.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "http://arxiv.org/abs/2604.21003v1", "difficulty": "intermediate" }, { "id": "arxiv:2605.14021", "source": "arxiv", "source_type": "preprint", "title": "Measuring Google AI Overviews: Activation, Source Quality, Claim Fidelity, and Publisher Impact", "abstract": "Google AI Overviews (AIOs) are arguably the most widely encountered deployment of generative AI, reaching over 2 billion users who may not realize the answers they see are AI-generated. Where search engines have traditionally surfaced ranked sources and left users to evaluate them, AIOs synthesize and deliver a single answer - giving Google unprecedented editorial control over what users read and know. We present a large-scale longitudinal measurement study, issuing 55,393 trending queries across 19 topical categories over a 40-day window (March 13 - April 21, 2026). We report four main findings. First, overall AIO activation is 13.7%, rising to 64.7% for question-form queries, while politically sensitive topics see markedly lower rates. Second, AIO-cited domains are more credible than co-displayed first-page results, yet nearly 30% do not appear in those results at all, indicating a source selection mechanism distinct from Google's ranking algorithm. Third, decomposing responses into 98,020 atomic claims, 11.0% are unsupported by the cited pages - with omission the dominant failure mode - and source quality and claim fidelity are largely independent. Fourth, well over half of AIO-cited pages carry display advertising, meaning publishers lose revenue when AIOs suppress the click-through, even as Google's own sponsored ads continue to appear on the same page. Together, these findings document a rapid transformation of the online information ecosystem whose consequences for epistemic security remain poorly understood.", "authors": [ "Haofei Xu", "Umar Iqbal", "Jacob M. Montgomery" ], "year": 2026, "published_date": "2026-05-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.14021", "pdf_url": "https://arxiv.org/pdf/2605.14021", "citations": 0, "topics": [], "tags": [ "IR", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.66, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Google AI Overviews (AIOs) are arguably the most widely encountered deployment of generative AI, reaching over 2 billion users who may not realize the answers they see are AI-generated. Where search engines have traditionally surfaced ranked sources and left users to evaluate them, AIOs synthesize and deliver a single answer - giving Google unprecedented editorial control over what users read and know.", "key_contribution": "We present a large-scale longitudinal measurement study, issuing 55,393 trending queries across 19 topical categories over a 40-day window (March 13 - April 21, 2026).", "why_it_matters": "Measuring Google AI Overviews: Activation, Source Quality, Claim Fidelity, and Publisher Impact represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about IR.", "one_line_takeaway": "We present a large-scale longitudinal measurement study, issuing 55,393 trending queries across 19 topical categories…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in IR.", "url": "https://arxiv.org/abs/2605.14021", "difficulty": "intermediate" }, { "id": "arxiv:2605.28812", "source": "arxiv", "source_type": "preprint", "title": "Beyond Binary: Sim-to-Real Dexterous Manipulation with Physics-Grounded Contact Representation", "abstract": "A primary bottleneck in contact-rich manipulation is the difficulty of collecting real-world data. Sim-to-real reinforcement learning offers a scalable alternative, but the simulation-reality gap prevents information-dense modalities like touch from being effectively used. Existing sim-to-real methods often mitigate this gap by simplifying tactile data into coarse low-dimensional features -- sacrificing the richness required for complex manipulation. In this work, we introduce Center-of-Pressure (CoP), an effective tactile representation grounded in physical principles that preserves dense contact information while maintaining robustness for sim-to-real transfer. To support this representation, we propose a sensor calibration scheme based on differentiable dynamics, enabling the estimation of taxel orientations without requiring ground-truth force measurements. We evaluate CoP on two blind, challenging contact-rich manipulation tasks: peg-in-hole insertion and ball balancing. Across both tasks, policies conditioned on CoP achieve zero-shot sim-to-real transfer on a multi-fingered hand, and outperform both coarse binary-contact and raw-taxel baselines. Analysis of learned policy states further suggests that CoP-conditioned policies encode task-relevant physical properties, such as object mass, as an emergent byproduct of control.", "authors": [ "Jiahe Pan", "Stelian Coros", "Jitendra Malik", "Toru Lin" ], "year": 2026, "published_date": "2026-05-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.28812", "pdf_url": "https://arxiv.org/pdf/2605.28812", "citations": 0, "topics": [], "tags": [ "RL", "Robotics", "Machine Learning", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.82, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "A primary bottleneck in contact-rich manipulation is the difficulty of collecting real-world data. Sim-to-real reinforcement learning offers a scalable alternative, but the simulation-reality gap prevents information-dense modalities like touch from being effectively used.", "key_contribution": "In this work, we introduce Center-of-Pressure (CoP), an effective tactile representation grounded in physical principles that preserves dense contact information while maintaining robustness for sim-to-real transfer.", "why_it_matters": "Beyond Binary: Sim-to-Real Dexterous Manipulation with Physics-Grounded Contact Representation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "In this work, we introduce Center-of-Pressure (CoP), an effective tactile representation grounded in physical…", "biggest_caveat": "but the simulation-reality gap prevents information-dense modalities like touch from being effectively used.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2605.28812", "difficulty": "advanced" }, { "id": "arxiv:2605.24775", "source": "arxiv", "source_type": "preprint", "title": "PRIMA: Operational Patterns for Resilient Multi-Agent Research with Verifiable Identity and Convergent Feedback", "abstract": "Operating LLMs as coordinated multi-agent research systems over multi-hour runs surfaces failure modes that single-shot evaluation cannot: upstream providers throttle without warning, sub-agents drift the task to fit accessible tools, narrate machinery instead of using it, open revision iterations with self-apology, or treat upstream context as executable directives. We present PRIMA, whose primary contributions are three operational patterns for surviving these failure modes: (1) a resilience-and-recovery layer that detects upstream rate-limit signals, persists a typed pause record to disk, and resumes long-running runs without re-executing converged work even across process restarts; (2) a sub-agent operating discipline encoding task-fidelity, tool-use, revision, and inter-step context-boundary norms as a structural prompt layer; (3) a multi-phase application pattern for structured engineering deliverables pairing orthogonal draft steps with an explicit cross-document harmonization pass before final synthesis. These sit atop a foundational protocol: a research-program specification language with explicit convergence criteria, a dual-metric scoring engine (LLM-judged rubric plus sandboxed code), an outer meta-optimization loop, event-driven persistence, hook-based middleware, context compaction, and a multi-provider LLM abstraction. Agent identities derive from prime powers, giving collision-free identifiers and trivially-verifiable cluster membership without a central registry. Theoretical guarantees include $O(k)$ verification, $O(V+E)$ DAG validation, and identity collision freedom by the Fundamental Theorem of Arithmetic. A Graph Isomorphism case study grounds the architectural claims in a generated artifact: a six-step protocol that produced a research paper proposing a new canonical-form algorithm with three theorems and five conjectures.", "authors": [ "Sasank Annapureddy" ], "year": 2026, "published_date": "2026-05-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.24775", "pdf_url": "https://arxiv.org/pdf/2605.24775", "citations": 0, "topics": [], "tags": [ "LLMs", "Multi-Agent Systems", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 6.8, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Operating LLMs as coordinated multi-agent research systems over multi-hour runs surfaces failure modes that single-shot evaluation cannot: upstream providers throttle without warning, sub-agents drift the task to fit accessible tools, narrate machinery instead of using it, open revision iterations with self-apology, or treat upstream context as executable directives. We present PRIMA, whose primary contributions are three operational patterns for surviving these failure modes: (1) a resilience-and-recovery layer that detects upstream rate-limit signals, persists a typed pause record to disk, and resumes long-running runs without re-executing converged work even across process restarts; (2) a sub-agent operating discipline encoding task-fidelity, tool-use, revision, and inter-step context-boundary norms as a structural prompt layer; (3) a multi-phase application pattern for structured engineering deliverables pairing orthogonal draft steps with an explicit cross-document harmonization pass before final synthesis.", "key_contribution": "We present PRIMA, whose primary contributions are three operational patterns for surviving these failure modes: (1) a resilience-and-recovery layer that detects upstream rate-limit signals, persists a typed pause record to disk, and resumes long-running runs without re-executing converged work even across process restarts; (2) a sub-agent operating discipline encoding task-fidelity, tool-use, revision, and inter-step context-boundary norms as a structural prompt layer; (3) a multi-phase application pattern for structured engineering deliverables pairing orthogonal draft steps with an explicit cross-document harmonization pass before final synthesis.", "why_it_matters": "PRIMA: Operational Patterns for Resilient Multi-Agent Research with Verifiable Identity and Convergent Feedback represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present PRIMA, whose primary contributions are three operational patterns for surviving these failure modes: (1) a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.24775", "difficulty": "beginner" }, { "id": "arxiv:2605.22020", "source": "arxiv", "source_type": "preprint", "title": "ForeSplat: Optimization-Aware Foresight for Feed-Forward 3D Gaussian Splatting", "abstract": "Feed-forward 3D Gaussian Splatting (3DGS) models offer fast single-pass reconstruction,but scaling them to match per-scene optimization quality is fundamentally hindered by the scarcity of large-scale 3D annotations.A practical compromise is predict-then-refine,where post-prediction optimization compensates for the limited capacity of the feed-forward network.However,standard feed-forward 3DGS is trained solely for zero-step rendering error,ignoring whether its output constitutes a good initialization for the downstream optimizer.We present ForeSplat,an optimization-aware training framework that equips feed-forward 3DGS models to produce initializations explicitly designed for rapid,effective refinement.By offloading part of the scene-modeling burden to the optimizer,ForeSplat substantially reduces the capacity pressure on the feed-forward model,making high-quality reconstruction feasible even with compact networks.At its core is MetaGrad,a lightweight multi-anchor meta-gradient training rule that bypasses costly higher-order differentiation through the 3DGS optimizer.MetaGrad unrolls a short inner-loop refinement trajectory,samples anchor states,and back-propagates aggregated first-order gradients to the prediction head as a surrogate optimization-aware signal.This fine-tuning adds no inference cost and enables high-quality reconstruction within seconds after a few refinement steps.We instantiate ForeSplat on diverse backbones,including AnySplat,Pi3X,and a distilled variant tailored for edge deployment.Across all tested architectures,a ForeSplat-trained initialization converges in fewer refinement steps and reaches a higher peak reconstruction quality than its vanilla counterpart,even fully converged.The framework consistently bridges the gap between amortized prediction and per-scene optimization,establishing a practical path toward lightweight,high-fidelity 3D reconstruction.", "authors": [ "Yuke Li", "Weihang Liu", "Cheng Zhang", "Yuefeng Zhang", "Jiadi Cui", "Zixuan Wang", "Junran Ding", "Haoyu Wu", "Yujiao Shi", "Jingyi Yu", "Xin Lou" ], "year": 2026, "published_date": "2026-05-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.22020", "pdf_url": "https://arxiv.org/pdf/2605.22020", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "3D Vision", "Info Extraction", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.6, "content_potential_score": 1.84, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Feed-forward 3D Gaussian Splatting (3DGS) models offer fast single-pass reconstruction,but scaling them to match per-scene optimization quality is fundamentally hindered by the scarcity of large-scale 3D annotations.A practical compromise is predict-then-refine,where post-prediction optimization compensates for the limited capacity of the feed-forward network.However,standard feed-forward 3DGS is trained solely for zero-step rendering error,ignoring whether its output constitutes a good initialization for the downstream optimizer.We present ForeSplat,an optimization-aware training framework that equips feed-forward 3DGS models to produce initializations explicitly designed for rapid,effective refinement.By offloading part of the scene-modeling burden to the optimizer,ForeSplat substantially reduces the capacity pressure on the feed-forward model,making high-quality reconstruction feasible even with compact networks.At its core is MetaGrad,a lightweight multi-anchor meta-gradient training rule that bypasses costly higher-order differentiation through the 3DGS optimizer.MetaGrad unrolls a short inner-loop refinement trajectory,samples anchor states,and back-propagates aggregated first-order gradients to the prediction head as a surrogate optimization-aware signal.This fine-tuning adds no inference cost and enables high-quality reconstruction within seconds after a few refinement steps.We instantiate ForeSplat on diverse backbones,including AnySplat,Pi3X,and a distilled variant tailored for edge deployment.Across all tested architectures,a ForeSplat-trained initialization converges in fewer refinement steps and reaches a higher peak reconstruction quality than its vanilla counterpart,even fully converged.The framework consistently bridges the gap between amortized prediction and per-scene optimization,establishing a practical path toward lightweight,high-fidelity 3D reconstruction.", "key_contribution": "Feed-forward 3D Gaussian Splatting (3DGS) models offer fast single-pass reconstruction,but scaling them to match per-scene optimization quality is fundamentally hindered by the scarcity of large-scale 3D annotations.A practical compromise is predict-then-refine,where post-prediction optimization compensates for the limited capacity of the feed-forward network.However,standard feed-forward 3DGS is trained solely for zero-step rendering error,ignoring whether its output constitutes a good initialization for the downstream optimizer.We present ForeSplat,an optimization-aware training framework that equips feed-forward 3DGS models to produce initializations explicitly designed for rapid,effective refinement.By offloading part of the scene-modeling burden to the optimizer,ForeSplat substantially reduces the capacity pressure on the feed-forward model,making high-quality reconstruction feasible even with compact networks.At its core is MetaGrad,a lightweight multi-anchor meta-gradient training rule that bypasses costly higher-order differentiation through the 3DGS optimizer.MetaGrad unrolls a short inner-loop refinement trajectory,samples anchor states,and back-propagates aggregated first-order gradients to the prediction head as a surrogate optimization-aware signal.This fine-tuning adds no inference cost and enables high-quality reconstruction within seconds after a few refinement steps.We instantiate ForeSplat on diverse backbones,including AnySplat,Pi3X,and a distilled variant tailored for edge deployment.Across all tested architectures,a ForeSplat-trained initialization converges in fewer refinement steps and reaches a higher peak reconstruction quality than its vanilla counterpart,even fully converged.The framework consistently bridges the gap between amortized prediction and per-scene optimization,establishing a practical path toward lightweight,high-fidelity 3D reconstruction.", "why_it_matters": "ForeSplat: Optimization-Aware Foresight for Feed-Forward 3D Gaussian Splatting advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "Feed-forward 3D Gaussian Splatting (3DGS) models offer fast single-pass reconstruction,but scaling them to match…", "biggest_caveat": "but scaling them to match per-scene optimization quality is fundamentally hindered by the scarcity of large-scale 3D annotations.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2605.22020", "difficulty": "intermediate" }, { "id": "arxiv:2509.26627", "source": "arxiv", "source_type": "preprint", "title": "TimeRewarder: Learning Dense Reward from Passive Videos via Frame-wise Temporal Distance", "abstract": "Designing dense rewards is crucial for reinforcement learning (RL), yet in robotics it often demands extensive manual effort and lacks scalability. One promising solution is to view task progress as a dense reward signal, as it quantifies the degree to which actions advance the system toward task completion over time. We present TimeRewarder, a simple yet effective reward learning method that derives progress estimation signals from passive videos, including robot demonstrations and human videos, by modeling temporal distances between frame pairs. We then demonstrate how TimeRewarder can supply step-wise proxy rewards to guide reinforcement learning. In our comprehensive experiments on ten challenging Meta-World tasks, we show that TimeRewarder dramatically improves RL for sparse-reward tasks, achieving nearly perfect success in 9/10 tasks with only 200,000 environment interactions per task. This approach outperformed previous methods and even the manually designed environment dense reward on both the final success rate and sample efficiency. Moreover, we show that TimeRewarder pretraining can exploit real-world human videos, highlighting its potential as a scalable approach to rich reward signals from diverse video sources.", "authors": [ "Yuyang Liu", "Chuan Wen", "Yihang Hu", "Dinesh Jayaraman", "Yang Gao" ], "year": 2026, "published_date": "2026-05-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.26627", "pdf_url": "https://arxiv.org/pdf/2509.26627", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "RL", "Robotics", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.85, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Designing dense rewards is crucial for reinforcement learning (RL), yet in robotics it often demands extensive manual effort and lacks scalability. One promising solution is to view task progress as a dense reward signal, as it quantifies the degree to which actions advance the system toward task completion over time.", "key_contribution": "We present TimeRewarder, a simple yet effective reward learning method that derives progress estimation signals from passive videos, including robot demonstrations and human videos, by modeling temporal distances between frame pairs.", "why_it_matters": "TimeRewarder: Learning Dense Reward from Passive Videos via Frame-wise Temporal Distance represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "We present TimeRewarder, a simple yet effective reward learning method that derives progress estimation signals from…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Self-Supervised.", "url": "https://arxiv.org/abs/2509.26627", "difficulty": "advanced" }, { "id": "arxiv:2506.13189", "source": "arxiv", "source_type": "preprint", "title": "Gesture First, LLM-Assisted Voice Complement: Exploring Multimodal Robot 'Puppeteer' Teleoperation Via Virtual Counterpart in Augmented Reality", "abstract": "Robot teleoperation via augmented reality (AR) offers a promising path toward more intuitive human-robot interaction (HRI). We present a head-mounted AR 'puppeteer' system in which users control a physical robot by interacting with its virtual counterpart robot using large language model (LLM)-assisted voice commands and hand-gesture interaction on the Meta Quest 3. In a within-subject user study with 42 participants performing an AR-based robotic pick-and-place pattern-matching task, we empirically compare two interaction conditions: gesture-only (GO) and combined voice+gesture (VG) on performance and user experience (UX). In VG, voice and gesture operate in a sequential role-allocated manner, with voice handling high-level navigation and gesture handling fine manipulation. Our results show that GO currently provides more reliable and efficient control for this time-critical task, while VG introduces additional flexibility but also latency and recognition issues that can increase workload. We additionally analyze how prior robotics expertise differentiates performance and UX across conditions. Based on these findings, we distill a set of design guidelines for AR 'puppeteer' metaphoric robot teleoperation, framing multimodality as an adaptive strategy that must balance efficiency, robustness, and user expertise rather than assuming that additional modalities are universally beneficial.", "authors": [ "Yuchong Zhang", "Bastian Orthmann", "Shichen Ji", "Michael Welle", "Jonne Van Haastregt", "Danica Kragic" ], "year": 2026, "published_date": "2026-05-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2506.13189", "pdf_url": "https://arxiv.org/pdf/2506.13189", "citations": 0, "topics": [], "tags": [ "LLMs", "Multimodal", "Info Extraction", "Robotics", "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.48, "content_potential_score": 1.42, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Robot teleoperation via augmented reality (AR) offers a promising path toward more intuitive human-robot interaction (HRI). We present a head-mounted AR 'puppeteer' system in which users control a physical robot by interacting with its virtual counterpart robot using large language model (LLM)-assisted voice commands and hand-gesture interaction on the Meta Quest 3.", "key_contribution": "We present a head-mounted AR 'puppeteer' system in which users control a physical robot by interacting with its virtual counterpart robot using large language model (LLM)-assisted voice commands and hand-gesture interaction on the Meta Quest 3.", "why_it_matters": "Gesture First, LLM-Assisted Voice Complement: Exploring Multimodal Robot 'Puppeteer' Teleoperation Via Virtual Counterpart in Augmented Reality represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a head-mounted AR 'puppeteer' system in which users control a physical robot by interacting with its virtual…", "biggest_caveat": "but also latency and recognition issues that can increase workload.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2506.13189", "difficulty": "intermediate" }, { "id": "arxiv:2605.16676", "source": "arxiv", "source_type": "preprint", "title": "Enhancing Metacognitive AI: Knowledge-Graph Population with Graph-Theoretic LLM Enrichment", "abstract": "Metacognition-the ability to monitor one's own knowledge state, spot gaps, and autonomously fill them--remains largely absent from modern AI. Here, we present MetaKGEnrich, a fully automated pipeline that endows large language model (LLM) applications with self-directed knowledge repair. The system (i) builds knowledge graphs from a seed query, (ii) detects sparse regions via seven graph metrics, (iii) has GPT-4o generate targeted questions, (iv) retrieves web evidence with Tavily and ingests it into Neo4j, and (v) re-answers the query with GraphRAG for GPT-4 to evaluate improvement. Tested on 30 queries from each of three widely-used datasets: Google Research Natural Questions, MS MARCO, and Hot-potQA. MetaKGEnrich improved answer quality in 80% of HotpotQA questions, 87% of Google Research Natural Questions and 83% of MS MARCO questions, while preserving well-supported regions. This proof of concept demonstrates how topological self-diagnosis plus targeted retrieval can advance AI toward humanlike metacognitive learning.", "authors": [ "Deniz Askin", "Gal Hadar", "Brendan Conway-Smith" ], "year": 2026, "published_date": "2026-05-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.16676", "pdf_url": "https://arxiv.org/pdf/2605.16676", "citations": 0, "topics": [], "tags": [ "LLMs", "RAG", "Knowledge Graphs", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.12, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Metacognition-the ability to monitor one's own knowledge state, spot gaps, and autonomously fill them--remains largely absent from modern AI. Here, we present MetaKGEnrich, a fully automated pipeline that endows large language model (LLM) applications with self-directed knowledge repair.", "key_contribution": "Here, we present MetaKGEnrich, a fully automated pipeline that endows large language model (LLM) applications with self-directed knowledge repair.", "why_it_matters": "Enhancing Metacognitive AI: Knowledge-Graph Population with Graph-Theoretic LLM Enrichment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Here, we present MetaKGEnrich, a fully automated pipeline that endows large language model (LLM) applications with…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.16676", "difficulty": "frontier" }, { "id": "arxiv:2605.14718", "source": "arxiv", "source_type": "preprint", "title": "Adapting AlphaEvolve to Optimize Fully Homomorphic Encryption on TPUs", "abstract": "The deployment of Fully Homomorphic Encryption (FHE) at scale is hindered due to its heavy computational overhead. While specialized hardware accelerators like Google Tensor Processing Units (TPUs) can help, mapping complex cryptographic kernels onto such architectures remains a challenge. Efficient execution requires co-optimization between the systolic array-based Matrix Multiplication Unit (MXU) and Vector Processing Units (VPUs), as well as the orchestration of data movement across the vector register files. Existing compiler stacks often abstract low-level hardware utilization, requiring developers to adopt a manual trial-and-error process that often results in fragmented execution and underutilized resources. To accelerate this development process, we use AlphaEvolve to automate the exploration of hardware-aware cryptographic-kernel optimizations. We frame optimization as an evolutionary search problem, utilizing the closed-loop system provided by AlphaEvolve, that leverages LLM-driven code generation. We use real-world feedback from hardware execution and rigorous correctness testing to guide the evolution process. We evaluate AlphaEvolve optimization on primitives for both the TFHE (Jaxite) and CKKS (CROSS) FHE schemes on Google Cloud TPUv5e, a contemporary TPU architecture. Within 24 hours of automated exploration, AlphaEvolve discovered implementation-level optimizations that improve TFHE bootstrap latency by 2.5x and CKKS rotation and multiplication latency by 1.31x and 1.18x, respectively, relative to human-engineered state of the art. These results demonstrate that AlphaEvolve can be used to enable researchers to navigate the optimization trade-offs between cryptography, compilers, and hardware accelerators.", "authors": [ "Shruthi Gorantala", "Jianming Tong", "Asra Ali", "Baiyu Li", "Jonathan Katz", "Jeremy Kun", "Thomas Steinke", "Abhradeep Thakurta", "Julian Walker", "Amir Yazdanbakhsh" ], "year": 2026, "published_date": "2026-05-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.14718", "pdf_url": "https://arxiv.org/pdf/2605.14718", "citations": 0, "topics": [], "tags": [ "Code Generation", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.98, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The deployment of Fully Homomorphic Encryption (FHE) at scale is hindered due to its heavy computational overhead. While specialized hardware accelerators like Google Tensor Processing Units (TPUs) can help, mapping complex cryptographic kernels onto such architectures remains a challenge.", "key_contribution": "These results demonstrate that AlphaEvolve can be used to enable researchers to navigate the optimization trade-offs between cryptography, compilers, and hardware accelerators.", "why_it_matters": "Adapting AlphaEvolve to Optimize Fully Homomorphic Encryption on TPUs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Code Generation.", "one_line_takeaway": "These results demonstrate that AlphaEvolve can be used to enable researchers to navigate the optimization trade-offs…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Code Generation.", "url": "https://arxiv.org/abs/2605.14718", "difficulty": "intermediate" }, { "id": "arxiv:2604.28087", "source": "arxiv", "source_type": "preprint", "title": "Towards Neuro-symbolic Causal Rule Synthesis, Verification, and Evaluation Grounded in Legal and Safety Principles", "abstract": "Rule-based systems remain central in safety-critical domains but often struggle with scalability, brittleness, and goal misspecification. These limitations can lead to reward hacking and failures in formal verification, as AI systems tend to optimize for narrow objectives. In previous research, we developed a neuro-symbolic causal framework that integrates first-order logic abduction trees, structural causal models, and deep reinforcement learning within a MAPE-K loop to provide explainable adaptations under distribution shifts. In this paper, we extend that framework by introducing a meta-level layer designed to mitigate goal misspecification and support scalable rule maintenance. This layer consists of a Goal/Rule Synthesizer and a Rule Verification Engine, which iteratively refine a formal rule theory from high-level natural-language goals and principles provided by human experts. The synthesis pipeline employs large language models (LLMs) to: (1) decompose goals into candidate causes, (2) consolidate semantics to remove redundancies, (3) translate them into candidate first-order rules, and (4) compose necessary and sufficient causal sets. The verification pipeline then performs (1) syntax and schema validation, (2) logical consistency analysis, and (3) safety and invariant checks before integrating verified rules into the knowledge base. We evaluated our approach with a proof-of-concept implementation in two autonomous driving scenarios. Results indicate that, given human-specified goals and principles, the pipeline can successfully derive minimal necessary and sufficient rule sets and formalize them as logical constraints. These findings suggest that the pipeline supports incremental, modular, and traceable rule synthesis grounded in established legal and safety principles.", "authors": [ "Zainab Rehan", "Christian Medeiros Adriano", "Sona Ghahremani", "Holger Giese" ], "year": 2026, "published_date": "2026-04-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.28087", "pdf_url": "https://arxiv.org/pdf/2604.28087", "citations": 0, "topics": [], "tags": [ "LLMs", "RL", "Knowledge Graphs", "Interpretability", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.3, "content_potential_score": 1.42, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Rule-based systems remain central in safety-critical domains but often struggle with scalability, brittleness, and goal misspecification. These limitations can lead to reward hacking and failures in formal verification, as AI systems tend to optimize for narrow objectives.", "key_contribution": "Rule-based systems remain central in safety-critical domains but often struggle with scalability, brittleness, and goal misspecification.", "why_it_matters": "Towards Neuro-symbolic Causal Rule Synthesis, Verification, and Evaluation Grounded in Legal and Safety Principles represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Rule-based systems remain central in safety-critical domains but often struggle with scalability, brittleness, and goal…", "biggest_caveat": "but often struggle with scalability, brittleness, and goal misspecification.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2604.28087", "difficulty": "frontier" }, { "id": "arxiv:2605.06295", "source": "arxiv", "source_type": "preprint", "title": "Attributions All the Way Down? The Metagame of Interpretability", "abstract": "We introduce the metagame, a conceptual framework for quantifying second-order interaction effects of model explanations. For any first-order attribution $ϕ(f)$ explaining a model $f$, we measure the directional influence of feature $j$ on the attribution of feature $i$, denoted as meta-attribution $φ_{j \\to i}(f)$, by treating the attribution method itself as a cooperative game and computing its Shapley value. Theoretically, we prove that attributions hierarchically decompose into meta-attributions, and establish these as directional extensions of existing interaction indices. Empirically, we demonstrate that the metagame delivers insights across diverse interpretability applications: (i) quantifying token interactions in instruction-tuned language models, (ii) explaining cross-modal similarity in vision-language encoders, and (iii) interpreting text-to-image concepts in multimodal diffusion transformers.", "authors": [ "Hubert Baniecki", "Przemyslaw Biecek", "Fabian Fumagalli" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.06295", "pdf_url": "https://arxiv.org/pdf/2605.06295", "citations": 0, "topics": [], "tags": [ "LLMs", "Multimodal", "Text-to-Image", "Interpretability", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.47, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce the metagame, a conceptual framework for quantifying second-order interaction effects of model explanations. For any first-order attribution $ϕ(f)$ explaining a model $f$, we measure the directional influence of feature $j$ on the attribution of feature $i$, denoted as meta-attribution $φ_{j \\to i}(f)$, by treating the attribution method itself as a cooperative game and computing its Shapley value.", "key_contribution": "We introduce the metagame, a conceptual framework for quantifying second-order interaction effects of model explanations.", "why_it_matters": "Attributions All the Way Down? The Metagame of Interpretability represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce the metagame, a conceptual framework for quantifying second-order interaction effects of model…", "biggest_caveat": "bution $φ_{j \\to i}(f)$, by treating the attribution method itself as a cooperative game and computing its Shapley value.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.06295", "difficulty": "intermediate" }, { "id": "arxiv:2604.23088", "source": "arxiv", "source_type": "preprint", "title": "Code Broker: A Multi-Agent System for Automated Code Quality Assessment", "abstract": "We present Code Broker, a multi agent system built with Google Agent Development Kit ADK that analyses Python code from files, local directories, or GitHub repositories and generates actionable quality assessment reports. The system employs a hierarchical five agents architecture in which a root orchestrator coordinates a sequential pipeline agent, which in turn dispatches three specialised agents in parallel a Correctness Assessor, a Style Assessor, and a Description Generator before synthesising findings through an Improvement Recommender. Reports score four dimensions correctness, security, style, and maintainability and are rendered in both Markdown and HTML. Code Broker combines LLM based reasoning with deterministic static-analysis signals from Pylint, uses asynchronous execution with retry logic to improve robustness, and explores lightweight session memory for retaining and querying prior assessment context. We position the paper as a technical report on system design and prompt or tool orchestration, and present a preliminary qualitative evaluation on representative Python codebases. The results suggest that parallel specialised agents produce readable, developer oriented feedback, while also highlighting current limitations in evaluation depth, security tooling, large repository handling, and the current use of only in memory persistence. All code and reproducibility materials are available at: https://github.com/Samir-atra/agents_intensive_dev.", "authors": [ "Samer Attrah" ], "year": 2026, "published_date": "2026-04-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.23088", "pdf_url": "https://arxiv.org/pdf/2604.23088", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Artificial Intelligence", "NLP", "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.5, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present Code Broker, a multi agent system built with Google Agent Development Kit ADK that analyses Python code from files, local directories, or GitHub repositories and generates actionable quality assessment reports. The system employs a hierarchical five agents architecture in which a root orchestrator coordinates a sequential pipeline agent, which in turn dispatches three specialised agents in parallel a Correctness Assessor, a Style Assessor, and a Description Generator before synthesising findings through an Improvement Recommender.", "key_contribution": "We present Code Broker, a multi agent system built with Google Agent Development Kit ADK that analyses Python code from files, local directories, or GitHub repositories and generates actionable quality assessment reports.", "why_it_matters": "Code Broker: A Multi-Agent System for Automated Code Quality Assessment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present Code Broker, a multi agent system built with Google Agent Development Kit ADK that analyses Python code from…", "biggest_caveat": "limitations in evaluation depth, security tooling, large repository handling, and the current use of only in memory persistence.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2604.23088", "difficulty": "intermediate" }, { "id": "arxiv:2604.21860v1", "source": "arxiv", "source_type": "preprint", "title": "Transient Turn Injection: Exposing Stateless Multi-Turn Vulnerabilities in Large Language Models", "abstract": "Large language models (LLMs) are increasingly integrated into sensitive workflows, raising the stakes for adversarial robustness and safety. This paper introduces Transient Turn Injection(TTI), a new multi-turn attack technique that systematically exploits stateless moderation by distributing adversarial intent across isolated interactions. TTI leverages automated attacker agents powered by large language models to iteratively test and evade policy enforcement in both commercial and open-source LLMs, marking a departure from conventional jailbreak approaches that typically depend on maintaining persistent conversational context. Our extensive evaluation across state-of-the-art models-including those from OpenAI, Anthropic, Google Gemini, Meta, and prominent open-source alternatives-uncovers significant variations in resilience to TTI attacks, with only select architectures exhibiting substantial inherent robustness. Our automated blackbox evaluation framework also uncovers previously unknown model specific vulnerabilities and attack surface patterns, especially within medical and high stakes domains. We further compare TTI against established adversarial prompting methods and detail practical mitigation strategies, such as session level context aggregation and deep alignment approaches. Our study underscores the urgent need for holistic, context aware defenses and continuous adversarial testing to future proof LLM deployments against evolving multi-turn threats.", "authors": [ "Naheed Rayhan", "Sohely Jahan" ], "year": 2026, "published_date": "2026-04-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.21860v1", "pdf_url": "https://arxiv.org/pdf/2604.21860v1", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "Dialogue", "Adversarial", "Evaluation" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses adversarial robustness and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.33, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models (LLMs) are increasingly integrated into sensitive workflows, raising the stakes for adversarial robustness and safety. This paper introduces Transient Turn Injection(TTI), a new multi-turn attack technique that systematically exploits stateless moderation by distributing adversarial intent across isolated interactions.", "key_contribution": "Large language models (LLMs) are increasingly integrated into sensitive workflows, raising the stakes for adversarial robustness and safety.", "why_it_matters": "Transient Turn Injection: Exposing Stateless Multi-Turn Vulnerabilities in Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Large language models (LLMs) are increasingly integrated into sensitive workflows, raising the stakes for adversarial…", "biggest_caveat": "buting adversarial intent across isolated interactions.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.21860v1", "difficulty": "frontier" }, { "id": "arxiv:2604.18658v1", "source": "arxiv", "source_type": "preprint", "title": "Owner-Harm: A Missing Threat Model for AI Agent Safety", "abstract": "Existing AI agent safety benchmarks focus on generic criminal harm (cybercrime, harassment, weapon synthesis), leaving a systematic blind spot for a distinct and commercially consequential threat category: agents harming their own deployers. Real-world incidents illustrate the gap: Slack AI credential exfiltration (Aug 2024), Microsoft 365 Copilot calendar-injection leaks (Jan 2024), and a Meta agent unauthorized forum post exposing operational data (Mar 2026). We propose Owner-Harm, a formal threat model with eight categories of agent behavior damaging the deployer. We quantify the defense gap on two benchmarks: a compositional safety system achieves 100% TPR / 0% FPR on AgentHarm (generic criminal harm) yet only 14.8% (4/27; 95% CI: 5.9%-32.5%) on AgentDojo injection tasks (prompt-injection-mediated owner harm). A controlled generic-LLM baseline shows the gap is not inherent to owner-harm (62.7% vs. 59.3%, delta 3.4 pp) but arises from environment-bound symbolic rules that fail to generalize across tool vocabularies. On a post-hoc 300-scenario owner-harm benchmark, the gate alone achieves 75.3% TPR / 3.3% FPR; adding a deterministic post-audit verifier raises overall TPR to 85.3% (+10.0 pp) and Hijacking detection from 43.3% to 93.3%, demonstrating strong layer complementarity. We introduce the Symbolic-Semantic Defense Generalization (SSDG) framework relating information coverage to detection rate. Two SSDG experiments partially validate it: context deprivation amplifies the detection gap 3.4x (R = 3.60 vs. R = 1.06); context injection reveals structured goal-action alignment, not text concatenation, is required for effective owner-harm detection.", "authors": [ "Dongcheng Zhang", "Yiqing Jiang" ], "year": 2026, "published_date": "2026-04-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.18658v1", "pdf_url": "https://arxiv.org/pdf/2604.18658v1", "citations": 0, "topics": [], "tags": [ "AI Safety", "AI Agents", "Info Extraction", "Code Generation", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 6.46, "content_potential_score": 2.05, "interestingness_score": 2.62, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Existing AI agent safety benchmarks focus on generic criminal harm (cybercrime, harassment, weapon synthesis), leaving a systematic blind spot for a distinct and commercially consequential threat category: agents harming their own deployers. Real-world incidents illustrate the gap: Slack AI credential exfiltration (Aug 2024), Microsoft 365 Copilot calendar-injection leaks (Jan 2024), and a Meta agent unauthorized forum post exposing operational data (Mar 2026).", "key_contribution": "We propose Owner-Harm, a formal threat model with eight categories of agent behavior damaging the deployer.", "why_it_matters": "Owner-Harm: A Missing Threat Model for AI Agent Safety represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We propose Owner-Harm, a formal threat model with eight categories of agent behavior damaging the deployer.", "biggest_caveat": "but arises from environment-bound symbolic rules that fail to generalize across tool vocabularies.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Safety.", "url": "http://arxiv.org/abs/2604.18658v1", "difficulty": "beginner" }, { "id": "arxiv:2604.12076v1", "source": "arxiv", "source_type": "preprint", "title": "Narrative over Numbers: The Identifiable Victim Effect and its Amplification Under Alignment and Reasoning in Large Language Models", "abstract": "The Identifiable Victim Effect (IVE) $-$ the tendency to allocate greater resources to a specific, narratively described victim than to a statistically characterized group facing equivalent hardship $-$ is one of the most robust findings in moral psychology and behavioural economics. As large language models (LLMs) assume consequential roles in humanitarian triage, automated grant evaluation, and content moderation, a critical question arises: do these systems inherit the affective irrationalities present in human moral reasoning? We present the first systematic, large-scale empirical investigation of the IVE in LLMs, comprising N=51,955 validated API trials across 16 frontier models spanning nine organizational lineages (Google, Anthropic, OpenAI, Meta, DeepSeek, xAI, Alibaba, IBM, and Moonshot). Using a suite of ten experiments $-$ porting and extending canonical paradigms from Small et al. (2007) and Kogut and Ritov (2005) $-$ we find that the IVE is prevalent but strongly modulated by alignment training. Instruction-tuned models exhibit extreme IVE (Cohen's d up to 1.56), while reasoning-specialized models invert the effect (down to d=-0.85). The pooled effect (d=0.223, p=2e-6) is approximately twice the single-victim human meta-analytic baseline (d$\\approx$0.10) reported by Lee and Feeley (2016) $-$ and likely exceeds the overall human pooled effect by a larger margin, given that the group-victim human effect is near zero. Standard Chain-of-Thought (CoT) prompting $-$ contrary to its role as a deliberative corrective $-$ nearly triples the IVE effect size (from d=0.15 to d=0.41), while only utilitarian CoT reliably eliminates it. We further document psychophysical numbing, perfect quantity neglect, and marginal in-group/out-group cultural bias, with implications for AI deployment in humanitarian and ethical decision-making contexts.", "authors": [ "Syed Rifat Raiyan" ], "year": 2026, "published_date": "2026-04-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.12076v1", "pdf_url": "https://arxiv.org/pdf/2604.12076v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Safety", "Fairness & Ethics", "Reasoning & Chain-of-Thought" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.12, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The Identifiable Victim Effect (IVE) $-$ the tendency to allocate greater resources to a specific, narratively described victim than to a statistically characterized group facing equivalent hardship $-$ is one of the most robust findings in moral psychology and behavioural economics. As large language models (LLMs) assume consequential roles in humanitarian triage, automated grant evaluation, and content moderation, a critical question arises: do these systems inherit the affective irrationalities present in human moral reasoning?", "key_contribution": "As large language models (LLMs) assume consequential roles in humanitarian triage, automated grant evaluation, and content moderation, a critical question arises: do these systems inherit the affective irrationalities present in human moral reasoning?", "why_it_matters": "Narrative over Numbers: The Identifiable Victim Effect and its Amplification Under Alignment and Reasoning in Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "As large language models (LLMs) assume consequential roles in humanitarian triage, automated grant evaluation, and…", "biggest_caveat": "but strongly modulated by alignment training.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.12076v1", "difficulty": "advanced" }, { "id": "arxiv:2604.19072v1", "source": "arxiv", "source_type": "preprint", "title": "S2MAM: Semi-supervised Meta Additive Model for Robust Estimation and Variable Selection", "abstract": "Semi-supervised learning with manifold regularization is a classical framework for jointly learning from both labeled and unlabeled data, where the key requirement is that the support of the unknown marginal distribution has the geometric structure of a Riemannian manifold. Typically, the Laplace-Beltrami operator-based manifold regularization can be approximated empirically by the Laplacian regularization associated with the entire training data and its corresponding graph Laplacian matrix. However, the graph Laplacian matrix depends heavily on the prespecified similarity metric and may lead to inappropriate penalties when dealing with redundant or noisy input variables. To address the above issues, this paper proposes a new \\textit{Semi-Supervised Meta Additive Model (S$^2$MAM) based on a bilevel optimization scheme that automatically identifies informative variables, updates the similarity matrix, and simultaneously achieves interpretable predictions. Theoretical guarantees are provided for S$^2$MAM, including the computing convergence and the statistical generalization bound. Experimental assessments across 4 synthetic and 12 real-world datasets, with varying levels and categories of corruption, validate the robustness and interpretability of the proposed approach.", "authors": [ "Xuelin Zhang", "Hong Chen", "Yingjie Wang", "Tieliang Gong", "Bin Gu" ], "year": 2026, "published_date": "2026-04-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.19072v1", "pdf_url": "https://arxiv.org/pdf/2604.19072v1", "citations": 0, "topics": [], "tags": [ "Interpretability", "Artificial Intelligence", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses manifold and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.25, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Semi-supervised learning with manifold regularization is a classical framework for jointly learning from both labeled and unlabeled data, where the key requirement is that the support of the unknown marginal distribution has the geometric structure of a Riemannian manifold. Typically, the Laplace-Beltrami operator-based manifold regularization can be approximated empirically by the Laplacian regularization associated with the entire training data and its corresponding graph Laplacian matrix.", "key_contribution": "Semi-supervised learning with manifold regularization is a classical framework for jointly learning from both labeled and unlabeled data, where the key requirement is that the support of the unknown marginal distribution has the geometric structure of a Riemannian manifold.", "why_it_matters": "S2MAM: Semi-supervised Meta Additive Model for Robust Estimation and Variable Selection represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Interpretability.", "one_line_takeaway": "Semi-supervised learning with manifold regularization is a classical framework for jointly learning from both labeled…", "biggest_caveat": "bution has the geometric structure of a Riemannian manifold.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Interpretability.", "url": "http://arxiv.org/abs/2604.19072v1", "difficulty": "frontier" }, { "id": "arxiv:2604.27289", "source": "arxiv", "source_type": "preprint", "title": "Mechanized Foundations of Structural Governance: Machine-Checked Proofs for Governed Intelligence", "abstract": "We present five results in the theory of structural governance for cognitive workflow systems. Three are mechanized in Coq 8.19 using the Interaction Trees library with parameterized coinduction; two are proved on paper with explicit reductions. The Coinductive Safety Predicate (gov_safe) is a coinductive property that captures governance safety for infinite program behaviors, indexed by a boolean permission flag that is provably false for ungoverned I/O and true for governed interpretations (mechanized). The Governance Invariance Theorem establishes that governance is uniform across the meta-recursive tower: governance at level n+1 reduces to governance at level n by definitional equality of the type (mechanized). The Sufficiency Theorem proves that four atomic primitives (code, reason, memory, call) are expressively complete for any discrete intelligent system, formalized as compositional closure of a Kleisli category (mechanized). The Alternating Normal Form provides a canonical decomposition of any machine into alternating code and effect layers, with a confluent rewriting system (paper proof). The Necessity Theorem proves via explicit reduction to Rice's theorem that an architecturally opaque component (the reason primitive) is mathematically necessary for problems requiring semantic judgment (paper proof). A sixth contribution connects the abstract model to the deployed runtime: the Verified Interpreter Specification formalizes the BEAM runtime's trust, capability, and hash chain logic in Coq, then tests the running system against this specification using property-based testing with over 70,000 randomly generated directive sequences and zero disagreements. The mechanization comprises approximately 12,000 lines across 36 modules with 454 theorems and zero admitted lemmas.", "authors": [ "Alan L. McCann" ], "year": 2026, "published_date": "2026-04-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.27289", "pdf_url": "https://arxiv.org/pdf/2604.27289", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.62, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present five results in the theory of structural governance for cognitive workflow systems. Three are mechanized in Coq 8.19 using the Interaction Trees library with parameterized coinduction; two are proved on paper with explicit reductions.", "key_contribution": "We present five results in the theory of structural governance for cognitive workflow systems.", "why_it_matters": "Mechanized Foundations of Structural Governance: Machine-Checked Proofs for Governed Intelligence represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We present five results in the theory of structural governance for cognitive workflow systems.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2604.27289", "difficulty": "frontier" }, { "id": "arxiv:2605.25665", "source": "arxiv", "source_type": "preprint", "title": "Meta-Engineering Harnesses for AI-Native Software Production: A Contract-Driven Adversarial Verification Architecture with Early Deployment Report", "abstract": "AI-native software development is often evaluated at the level of individual models, prompts, or generated artifacts. This framing is insufficient for production environments where software must be continuously produced, verified, deployed, maintained, and adapted across many operational contexts and long time horizons. We present a meta-engineering harness: a software-production architecture that transforms operational and product feature requirements into explicit contracts, routes work through role-specialized AI agents, performs independent and adversarial verification, and continuously improves itself through structured failure classification and outer-loop calibration. The harness is designed for settings in which software delivery is not a one-time project but an ongoing operating function. In our motivating application, CTO-as-a-service for small service firms, the system manages websites, booking flows, payment systems, backoffice workflow automations, and AI-agent interfaces as continuously evolving technical infrastructure rather than one-off deliverables. We describe the layered architecture, including two-pass contract compilation, persistent markdown memory with specialization records, attention-based and independence-based verifications, a four-way failure arbiter, and outer-loop calibration. We report results from an early production deployment spanning 17 features over several weeks, including a detailed in-app payments case study that revealed contract incompleteness and verification-boundary issues. These observations directly drove targeted improvements to the harness. The contribution is an implemented, measurable, and extensible verification architecture for making AI-native service-as-a-software production reliable, auditable, and improvable over time.", "authors": [ "Satadru Sengupta", "Tamunokorite Briggs", "Ivan Myshakivskyi" ], "year": 2026, "published_date": "2026-05-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.25665", "pdf_url": "https://arxiv.org/pdf/2605.25665", "citations": 0, "topics": [], "tags": [ "AI Agents", "Artificial Intelligence", "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.62, "content_potential_score": 1.84, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "AI-native software development is often evaluated at the level of individual models, prompts, or generated artifacts. This framing is insufficient for production environments where software must be continuously produced, verified, deployed, maintained, and adapted across many operational contexts and long time horizons.", "key_contribution": "We present a meta-engineering harness: a software-production architecture that transforms operational and product feature requirements into explicit contracts, routes work through role-specialized AI agents, performs independent and adversarial verification, and continuously improves itself through structured failure classification and outer-loop calibration.", "why_it_matters": "Meta-Engineering Harnesses for AI-Native Software Production: A Contract-Driven Adversarial Verification Architecture with Early Deployment Report represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We present a meta-engineering harness: a software-production architecture that transforms operational and product…", "biggest_caveat": "but an ongoing operating function.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2605.25665", "difficulty": "intermediate" }, { "id": "arxiv:2605.00515", "source": "arxiv", "source_type": "preprint", "title": "Space Network of Experts: Architecture and Expert Placement", "abstract": "Leveraging continuous solar energy harvesting at high efficiency, space data centers are envisioned as a promising platform for executing energy-intensive large language models (LLMs). Recognizing this advantage, space and AI conglomerates (e.g., SpaceX, Google) are actively investing in this vision. One key challenge, however, is the efficient distributed deployment of a large-scale LLM in a satellite network due to the limited onboard computing and communication resources. This gives rise to a placement problem that involves partitioning and mapping model components to satellites such that the fundamentally different model architecture and network topology can be reconciled to ensure low-latency token generation. To address this problem, we present the Space Network of Experts (Space-XNet) framework targeting the distributed execution of a popular mixture-of-experts (MoE) model in space. The proposed placement strategies are two-level: (1) layer placement, which assigns MoE layers to satellite subnets; and (2) intra-layer expert placement, which assigns individual experts to satellites associated with the same layer/subnet. For layer placement, we exploit the ring-like communication pattern of autoregressive inference to partition the satellite constellation along the orbiting direction into subnets arranged on a ring, each hosting one MoE layer. Based on this architecture, we formulate and solve an optimization problem for intra-layer expert placement to map experts with heterogeneous activation probabilities onto satellites. The derived strategy reveals an intuitive principle: a frequently activated expert should be mapped to a satellite on a routing path with low expected latency. Experiments over a thousand-satellite constellation show that Space-XNet achieves at least a threefold latency reduction compared with conventional random and ablation-based placement strategies.", "authors": [ "Zhanwei Wang", "Huiling Yang", "Min Sheng", "Khaled B. Letaief", "Kaibin Huang" ], "year": 2026, "published_date": "2026-05-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.00515", "pdf_url": "https://arxiv.org/pdf/2605.00515", "citations": 0, "topics": [], "tags": [ "LLMs", "MoE", "Artificial Intelligence", "Distributed Computing" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 3.62, "content_potential_score": 1.42, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Leveraging continuous solar energy harvesting at high efficiency, space data centers are envisioned as a promising platform for executing energy-intensive large language models (LLMs). Recognizing this advantage, space and AI conglomerates (e.g., SpaceX, Google) are actively investing in this vision.", "key_contribution": "To address this problem, we present the Space Network of Experts (Space-XNet) framework targeting the distributed execution of a popular mixture-of-experts (MoE) model in space.", "why_it_matters": "Space Network of Experts: Architecture and Expert Placement represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this problem, we present the Space Network of Experts (Space-XNet) framework targeting the distributed…", "biggest_caveat": "however, is the efficient distributed deployment of a large-scale LLM in a satellite network due to the limited onboard computing and communication resources.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.00515", "difficulty": "frontier" }, { "id": "arxiv:2605.10950", "source": "arxiv", "source_type": "preprint", "title": "Continuous Flood Nowcasting in South Asia: A Multi-Sensor Ensemble Remote Sensing Framework for Flood Extent", "abstract": "Pakistan experienced an unusually severe flood season between June and December 2025, with cascading impacts on population, infrastructure, and agriculture. Existing operational flood products (e.g., UNOSAT) provide valuable episode-level snapshots but rarely deliver spatially and temporally continuous inundation maps at near-real-time latency within the country. We present a multi-sensor, ensemble-based remote-sensing framework for continuous flood nowcasting in Pakistan that integrates Sentinel-1 SAR, Harmonized Landsat-Sentinel (HLS L30 and S30), MODIS, and VIIRS observations on a harmonized grid in Google Earth Engine. The framework employs a tiered nowcasting ensemble that prioritizes higher-resolution sensors (Sentinel-1 and HLS) and falls back to MODIS and VIIRS when necessary, preserving daily continuity of flood extent at each sensor's native resolution. Applied to the 2025 monsoon period, the system generates near-real-time, spatially consistent inundation maps across Pakistan. As a nowcasting case study, we track the super-flood of 26 August-7 September 2025 day by day, demonstrating the framework's ability to capture the evolving flood footprint in near real time and extend beyond the temporal limits of episodic mapping products. Validation against GloFAS discharge anomalies and precipitation datasets (CHIRPS v3.0, MSWEP) shows strong agreement with observed hydrometeorological conditions. By integrating nowcast outputs with exposure layers (WorldPop, ESA WorldCover, Giga-HOTOSM), the framework enables rapid estimation of affected populations, cropland, and critical infrastructure, supporting timely disaster response and resilience planning in South Asia.", "authors": [ "Usman Nazir", "Disha Gomathinayagam", "Muhammad Kamran", "Sara Khalid" ], "year": 2026, "published_date": "2026-04-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.10950", "pdf_url": "https://arxiv.org/pdf/2605.10950", "citations": 0, "topics": [], "tags": [ "Information Retrieval", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.64, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Pakistan experienced an unusually severe flood season between June and December 2025, with cascading impacts on population, infrastructure, and agriculture. Existing operational flood products (e.g., UNOSAT) provide valuable episode-level snapshots but rarely deliver spatially and temporally continuous inundation maps at near-real-time latency within the country.", "key_contribution": "We present a multi-sensor, ensemble-based remote-sensing framework for continuous flood nowcasting in Pakistan that integrates Sentinel-1 SAR, Harmonized Landsat-Sentinel (HLS L30 and S30), MODIS, and VIIRS observations on a harmonized grid in Google Earth Engine.", "why_it_matters": "Continuous Flood Nowcasting in South Asia: A Multi-Sensor Ensemble Remote Sensing Framework for Flood Extent improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about Information Retrieval.", "one_line_takeaway": "We present a multi-sensor, ensemble-based remote-sensing framework for continuous flood nowcasting in Pakistan that…", "biggest_caveat": "but rarely deliver spatially and temporally continuous inundation maps at near-real-time latency within the country.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Information Retrieval.", "url": "https://arxiv.org/abs/2605.10950", "difficulty": "intermediate" }, { "id": "arxiv:2605.11232", "source": "arxiv", "source_type": "preprint", "title": "Rethinking LLMOps for Fraud and AML: Building a Compliance-Grade LLM Serving Stack", "abstract": "Fraud detection and anti-money-laundering (AML) compliance are high-value domains for large language models (LLMs), but their serving requirements differ sharply from generic chat workloads. Compliance prompts are often prefix-heavy, schema-constrained, and evidence-rich, combining reusable policy instructions, risk taxonomies, transaction or document context, and short structured outputs such as JSON labels or risk factors. These properties make prefix reuse, KV-cache efficiency, runtime tuning, model orchestration, and output validation first-order systems concerns. This paper introduces a workload-aware LLMOps stack for fraud and AML workloads using self-hosted open-weight models such as Meta Llama and Alibaba Qwen. The stack combines vLLM-style runtime tuning, PagedAttention, Automatic Prefix Caching, multi-adapter serving, adapter and prompt-length-aware batching, sleep/wake lifecycle management, speculative decoding, and optional prefill/decode disaggregation. To avoid exposing institution-specific data, the reproducibility track converts public synthetic AML datasets, including IBM AML and SAML-D, into prefix-heavy compliance prompts with reusable policy text, transaction evidence, typology definitions, and schema-constrained outputs. We also incorporate an LLM-as-judge quality gate using deterministic compliance checks, reference metrics, expert-adjudicated calibration data where available, and multi-judge rubric scoring. Across public-synthetic AML workloads and controlled serving benchmarks, workload-aware tuning improved throughput from 612-650 to 3,600 requests/hour, reduced P99 latency from 31-38 seconds to 6.4-8.7 seconds, and increased GPU utilization from 12% to 78%. These results show that regulated LLM performance is a workload-design, serving-optimization, and quality-gating problem, not only a model-selection problem.", "authors": [ "Prathamesh Vasudeo Naik", "Naresh Dintakurthi", "Yue Wang" ], "year": 2026, "published_date": "2026-05-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.11232", "pdf_url": "https://arxiv.org/pdf/2605.11232", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.25, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Fraud detection and anti-money-laundering (AML) compliance are high-value domains for large language models (LLMs), but their serving requirements differ sharply from generic chat workloads. Compliance prompts are often prefix-heavy, schema-constrained, and evidence-rich, combining reusable policy instructions, risk taxonomies, transaction or document context, and short structured outputs such as JSON labels or risk factors.", "key_contribution": "These results show that regulated LLM performance is a workload-design, serving-optimization, and quality-gating problem, not only a model-selection problem.", "why_it_matters": "Rethinking LLMOps for Fraud and AML: Building a Compliance-Grade LLM Serving Stack represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "These results show that regulated LLM performance is a workload-design, serving-optimization, and quality-gating…", "biggest_caveat": "but their serving requirements differ sharply from generic chat workloads.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.11232", "difficulty": "beginner" }, { "id": "arxiv:2605.09727", "source": "arxiv", "source_type": "preprint", "title": "One for All: A Non-Linear Transformer can Enable Cross-Domain Generalization for In-Context Reinforcement Learning", "abstract": "A central challenge in reinforcement learning (RL) is to learn models that generalize beyond the tasks on which they are trained, a goal traditionally pursued through multi-task and meta RL. Recently, transformer architectures have emerged as a promising approach, enabling adaptation to new tasks via in-context learning without explicit parameter updates. From a functional perspective, a transformer can be viewed as a functional operator that maps a context to a task-specific function. It is thus fundamental to understand and design this operator to support stronger generalization in RL. In this work, we address this resulting question of generalization from a kernel-based perspective by establishing a connection between non-linear transformers and kernel-based temporal difference learning. By interpreting the transformer as performing regression in a Reproducing Kernel Hilbert Space (RKHS), we show that value functions from different domains can be represented using a shared set of weights, provided they lie within the same RKHS. Experiments on multiple MetaWorld domains support this interpretation, demonstrating convergence of the temporal-difference objective.", "authors": [ "Bowen He", "Juncheng Dong", "Lin Lin", "Xiang Cheng" ], "year": 2026, "published_date": "2026-05-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.09727", "pdf_url": "https://arxiv.org/pdf/2605.09727", "citations": 0, "topics": [], "tags": [ "Prompting", "Transformers", "RL", "Artificial Intelligence", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 7.43, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "A central challenge in reinforcement learning (RL) is to learn models that generalize beyond the tasks on which they are trained, a goal traditionally pursued through multi-task and meta RL. Recently, transformer architectures have emerged as a promising approach, enabling adaptation to new tasks via in-context learning without explicit parameter updates.", "key_contribution": "By interpreting the transformer as performing regression in a Reproducing Kernel Hilbert Space (RKHS), we show that value functions from different domains can be represented using a shared set of weights, provided they lie within the same RKHS.", "why_it_matters": "One for All: A Non-Linear Transformer can Enable Cross-Domain Generalization for In-Context Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "By interpreting the transformer as performing regression in a Reproducing Kernel Hilbert Space (RKHS), we show that…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2605.09727", "difficulty": "advanced" }, { "id": "arxiv:2605.09863", "source": "arxiv", "source_type": "preprint", "title": "Nautilus Compass: Black-box Persona Drift Detection for Production LLM Agents", "abstract": "Production LLM coding agents drift over long sessions: they forget user-specified constraints, slip into mistakes the user already flagged, and confabulate prior agreements. White-box approaches such as persona vectors require model weights and so cannot be applied to closed APIs (Claude, GPT-4) that most users actually interact with. We present Nautilus Compass, a black-box persona drift detector and agent memory layer for production coding agents. The method operates entirely at the prompt-text layer: cosine similarity between user prompts and behavioral anchor texts, aggregated by a weighted top-k mean using BGE-m3 embeddings. Compass is, to our knowledge, the only public agent memory layer (among Mem0, Letta, Cognee, Zep, MemOS, smrti verified May 2026) that does not call an LLM at index time to extract facts or build a graph; raw conversation text is embedded directly. The system ships as a Claude Code plugin, an MCP 2024-11-05 A2A server (Cursor, Cline, Hermes), a CLI, and a REST API on one daemon, with a Merkle-chained audit log for tamper-evident anchor updates. On a held-out test set built from real Claude Code session traces and labeled by an independent LLM judge, Compass reaches ROC AUC 0.83 for drift detection. The embedded retrieval pipeline scores 56.6% on LongMemEval-S v0.8 and 44.4% on EverMemBench-Dynamic (n=500), topping the four published EverMemBench Table 4 baselines. LongMemEval-S 56.6% is ~30 points below recent white-box leaders (90+%); we treat that as the architectural ceiling of the no-extraction design. End-to-end reproduction cost is $3.50 (~14x cheaper than GPT-4o-judged stacks). A paired cross-vendor behavior A/B accompanies these numbers as preliminary system-level evidence. Code, anchors, frozen test data, and audit-log tooling are MIT-licensed at github.com/chunxiaoxx/nautilus-compass.", "authors": [ "Chunxiao Wang" ], "year": 2026, "published_date": "2026-05-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.09863", "pdf_url": "https://arxiv.org/pdf/2605.09863", "citations": 0, "topics": [], "tags": [ "LLMs", "Dialogue", "NLP", "Cryptography & Security", "Information Retrieval" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.73, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Production LLM coding agents drift over long sessions: they forget user-specified constraints, slip into mistakes the user already flagged, and confabulate prior agreements. White-box approaches such as persona vectors require model weights and so cannot be applied to closed APIs (Claude, GPT-4) that most users actually interact with.", "key_contribution": "We present Nautilus Compass, a black-box persona drift detector and agent memory layer for production coding agents.", "why_it_matters": "Nautilus Compass: Black-box Persona Drift Detection for Production LLM Agents improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present Nautilus Compass, a black-box persona drift detector and agent memory layer for production coding agents.", "biggest_caveat": "cannot be applied to closed APIs (Claude, GPT-4) that most users actually interact with.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.09863", "difficulty": "intermediate" }, { "id": "arxiv:2605.04084", "source": "arxiv", "source_type": "preprint", "title": "FASQ: Flexible Accelerated Subspace Quantization for Calibration-Free LLM Compression", "abstract": "Compressing large language models (LLMs) for deployment on commodity GPUs remains challenging: conventional scalar quantization is limited to fixed bit-widths (e.g., 8/4/3-bit), offers only a few discrete compression points, and typically requires calibration data. We present FASQ (Flexible Accelerated Subspace Quantization), a calibration-free framework that applies product quantization to LLM weight matrices. By tuning two parameters, sub-vector size and codebook cardinality, FASQ exposes a continuous design space spanning 27-49% of the original FP16 model size, filling compression gaps that fixed-bit schemes cannot reach. On Meta-Llama-3-8B, FASQ surpasses 4-bit GPTQ and AWQ in accuracy (67.1-67.7 avg.) at 37-42% model size, with consistent results on Qwen3-8B and Qwen3.5-9B-Base. To make product quantization practical at inference time, we design custom CUDA kernels: a LUT-free direct-compute GEMV for decode and an output-stationary double-buffered LUT GEMM for prefill, both with split-K parallelism. On an RTX~3090, FASQ achieves 45.2 tok/s decode at effective 4-bit (2.56x memory reduction) and 51.8 tok/s at effective 3-bit (2.80x), both surpassing FP16 tensor-core performance (43.9 tok/s) and delivering 1.6 to 1.8x the throughput of AWQ, 2.5 to 2.5x of GPTQ, and 4.3 to 5x of RTN. FASQ is the only compressed method that accelerates decode beyond FP16, offering calibration-free compression, continuous size-quality trade-offs, and real-time inference on a single consumer GPU.", "authors": [ "Ye Qiao", "Yian Wang", "Zhiheng Chen", "Hyoukjun Kwon", "Sitao Huang" ], "year": 2026, "published_date": "2026-04-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.04084", "pdf_url": "https://arxiv.org/pdf/2605.04084", "citations": 0, "topics": [], "tags": [ "LLMs", "Model Compression", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.58, "content_potential_score": 1.84, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Compressing large language models (LLMs) for deployment on commodity GPUs remains challenging: conventional scalar quantization is limited to fixed bit-widths (e.g., 8/4/3-bit), offers only a few discrete compression points, and typically requires calibration data. We present FASQ (Flexible Accelerated Subspace Quantization), a calibration-free framework that applies product quantization to LLM weight matrices.", "key_contribution": "We present FASQ (Flexible Accelerated Subspace Quantization), a calibration-free framework that applies product quantization to LLM weight matrices.", "why_it_matters": "FASQ: Flexible Accelerated Subspace Quantization for Calibration-Free LLM Compression represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present FASQ (Flexible Accelerated Subspace Quantization), a calibration-free framework that applies product…", "biggest_caveat": "cannot reach.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.04084", "difficulty": "intermediate" }, { "id": "arxiv:2603.29716", "source": "arxiv", "source_type": "preprint", "title": "A Graded Modal Dependent Type Theory with Erasure, Formalized", "abstract": "We present a graded modal type theory, a dependent type theory with grades that can be used to enforce various properties of the code. The theory has $Π$-types, weak and strong $Σ$-types, natural numbers, an empty type, and a universe, and we also extend the theory with weak and strong unit types and graded $Σ$-types. The theory is parameterized by a modality structure, a kind of partially ordered semiring, whose elements (grades) are used to track the usage of variables in terms and types. Different modalities are possible. We focus mainly on quantitative properties, in particular erasure: with the erasure modality one can mark function arguments as erasable. The theory is fully formalized in Agda. The formalization, which uses a syntactic Kripke logical relation at its core and is based on earlier work, establishes major meta-theoretic properties such as subject reduction, consistency, normalization, and decidability of definitional equality. We also prove a substitution theorem for grade assignment, and preservation of grades under reduction. Furthermore we study an extraction function that translates terms to an untyped $λ$-calculus and removes erasable content, in particular function arguments with the \"erasable\" grade. For a certain class of modalities we prove that extraction is sound, in the sense that programs of natural number type have the same value before and after extraction. Soundness of extraction holds also for open programs, as long as all variables in the context are erasable, the context is consistent, and erased matches are not allowed for weak $Σ$-types.", "authors": [ "Andreas Abel", "Nils Anders Danielsson", "Oskar Eriksson" ], "year": 2026, "published_date": "2026-04-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.29716", "pdf_url": "https://arxiv.org/pdf/2603.29716", "citations": 0, "topics": [], "tags": [ "Programming Languages" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.62, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present a graded modal type theory, a dependent type theory with grades that can be used to enforce various properties of the code. The theory has $Π$-types, weak and strong $Σ$-types, natural numbers, an empty type, and a universe, and we also extend the theory with weak and strong unit types and graded $Σ$-types.", "key_contribution": "We present a graded modal type theory, a dependent type theory with grades that can be used to enforce various properties of the code.", "why_it_matters": "A Graded Modal Dependent Type Theory with Erasure, Formalized represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Programming Languages.", "one_line_takeaway": "We present a graded modal type theory, a dependent type theory with grades that can be used to enforce various…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Programming Languages.", "url": "https://arxiv.org/abs/2603.29716", "difficulty": "frontier" }, { "id": "arxiv:2604.10908v1", "source": "arxiv", "source_type": "preprint", "title": "Reasoning as Data: Representation-Computation Unity and Its Implementation in a Domain-Algebraic Inference Engine", "abstract": "Every existing knowledge system separates storage from computation. We show this separation is unnecessary and eliminate it. In a standard triple is_a(Apple, Company), domain context lives in the query or the programmer's mind. In a CDC four-tuple is_a(Apple, Company, @Business), domain becomes a structural field embedded in predicate arity. Any system respecting arity automatically performs domain-scoped inference without external rules. We call this representation-computation unity (RCU). From the four-tuple structure, three inference mechanisms emerge: domain-scoped closure, typed inheritance, and write-time falsification via cycle detection per domain fiber. We establish RCU formally via four theorems. RCU is implementable. We present a working symbolic engine (2400 lines Python+Prolog) resolving four engineering issues: rule-data separation, shared-fiber handling, read-only meta-layer design, and intersective convergence. A central result: CDC domain-constrained inference is distinct from Prolog with a domain argument. Two case studies validate the engine. ICD-11 classification (1247 entities, 3 axes) shows fibers resolve multiple inheritance. CBT clinical reasoning shows generalization to temporal reasoning with session turn as ordered domain index. Multi-constraint queries realize CSP arc-consistency with complexity O(m (N/K)^2), confirming the domain lattice's sparsity governs performance. When domain is structural, data computes itself.", "authors": [ "Chao Li", "Yuru Wang" ], "year": 2026, "published_date": "2026-04-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.10908v1", "pdf_url": "https://arxiv.org/pdf/2604.10908v1", "citations": 0, "topics": [], "tags": [ "Reasoning", "Biomedical AI", "Artificial Intelligence", "Reasoning & Chain-of-Thought", "Biomedical & Clinical AI" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.14, "content_potential_score": 1.55, "interestingness_score": 2.38, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Every existing knowledge system separates storage from computation. We show this separation is unnecessary and eliminate it.", "key_contribution": "We show this separation is unnecessary and eliminate it.", "why_it_matters": "Reasoning as Data: Representation-Computation Unity and Its Implementation in a Domain-Algebraic Inference Engine represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We show this separation is unnecessary and eliminate it.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "http://arxiv.org/abs/2604.10908v1", "difficulty": "intermediate" }, { "id": "arxiv:2604.04548v1", "source": "arxiv", "source_type": "preprint", "title": "GROW: A Conversational AI Coach for Goals, Reflection, Optimism, and Well-Being", "abstract": "College students face well-being challenges driven by academic pressure, financial strain, and social expectations. While campus counseling and student-success programs offer support, access is often limited by stigma, waitlists, and scheduling constraints. Existing digital tools focus on emotional check-ins or chatbots and may overlook structured goal setting and aligning goals with personal values. We present GROW, a goal-centered well-being coaching system that puts values-aligned goals at the center of the student experience. GROW combines the SMART framework with principles from Acceptance and Commitment Therapy in a conversational AI coach that helps students clarify aspirations, break them into concrete steps, and reflect on progress. The system links action plans with Google Calendar, sends reminders, and provides a dashboard that shows progress and engagement. We evaluated GROW through interviews with clinical psychologists, student-success staff, and faculty, followed by a one-week deployment with 30 undergraduates. Findings offer design implications for interactive systems that support engagement, accountability, and sense of purpose in higher education.", "authors": [ "Keya Shah", "Himanshi Lalwani", "Hanan Salam" ], "year": 2026, "published_date": "2026-04-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.04548v1", "pdf_url": "https://arxiv.org/pdf/2604.04548v1", "citations": 0, "topics": [], "tags": [ "Dialogue", "Biomedical AI", "Dialogue Systems", "Human-Computer Interaction", "Biomedical & Clinical AI" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.33, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "College students face well-being challenges driven by academic pressure, financial strain, and social expectations. While campus counseling and student-success programs offer support, access is often limited by stigma, waitlists, and scheduling constraints.", "key_contribution": "We present GROW, a goal-centered well-being coaching system that puts values-aligned goals at the center of the student experience.", "why_it_matters": "GROW: A Conversational AI Coach for Goals, Reflection, Optimism, and Well-Being represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Dialogue.", "one_line_takeaway": "We present GROW, a goal-centered well-being coaching system that puts values-aligned goals at the center of the student…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Dialogue.", "url": "http://arxiv.org/abs/2604.04548v1", "difficulty": "intermediate" }, { "id": "arxiv:2604.03886v1", "source": "arxiv", "source_type": "preprint", "title": "From High-Level Types to Low-Level Monitors: Synthesizing Verified Runtime Checkers for MAVLink", "abstract": "Standard communication protocols for Unmanned Aerial Vehicles (UAVs), such as MAVLink, lack the capability to enforce the contextual validity of message sequences. Autopilots therefore remain vulnerable to stealthy attacks, where syntactically correct but semantically ill-timed commands induce unsafe states without triggering physical anomaly detectors. Prior work (DATUM) demonstrated that global Refined Multiparty Session Types (RMPSTs) are an effective specification language for centralized MAVLink protocol enforcement, but suffered from two engineering failures: manual proof terms interleaved with protocol definitions, and an OCaml extraction backend whose managed runtime is incompatible with resource-constrained UAV hardware. We present Platum, a framework that addresses both failures with a minimal DSL requiring only the five semantic components of a global session type (sender, receiver, label, payload variable, refinement predicate), whose structural well-formedness conditions are confirmed via reflective decision procedures in Meta-F*. Confirmed specifications are compiled directly into flat, allocation-free C Finite State Machines (FSMs), deployed as centralized proxy monitors at the GCS/UAV communication boundary. Our evaluation demonstrates a 4x reduction in total monitor latency and lower memory overhead compared to DATUM, measured via ArduPilot SITL simulation.", "authors": [ "Arthur Amorim", "Paul Gazzillo", "Max Taylor", "Lance Joneckis" ], "year": 2026, "published_date": "2026-04-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.03886v1", "pdf_url": "https://arxiv.org/pdf/2604.03886v1", "citations": 0, "topics": [], "tags": [ "Cryptography & Security" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.33, "content_potential_score": 0.0, "interestingness_score": 1.6, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Standard communication protocols for Unmanned Aerial Vehicles (UAVs), such as MAVLink, lack the capability to enforce the contextual validity of message sequences. Autopilots therefore remain vulnerable to stealthy attacks, where syntactically correct but semantically ill-timed commands induce unsafe states without triggering physical anomaly detectors.", "key_contribution": "We present Platum, a framework that addresses both failures with a minimal DSL requiring only the five semantic components of a global session type (sender, receiver, label, payload variable, refinement predicate), whose structural well-formedness conditions are confirmed via reflective decision procedures in Meta-F*.", "why_it_matters": "From High-Level Types to Low-Level Monitors: Synthesizing Verified Runtime Checkers for MAVLink represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Cryptography & Security.", "one_line_takeaway": "We present Platum, a framework that addresses both failures with a minimal DSL requiring only the five semantic…", "biggest_caveat": "but semantically ill-timed commands induce unsafe states without triggering physical anomaly detectors.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Cryptography & Security.", "url": "http://arxiv.org/abs/2604.03886v1", "difficulty": "frontier" }, { "id": "arxiv:2604.26974", "source": "arxiv", "source_type": "preprint", "title": "C8s: A Confidential Kubernetes Architecture", "abstract": "This paper presents C8s, a confidential computing architecture for Kubernetes that provides cryptographically rooted confidentiality, integrity, and verifiability guarantees for Kubernetes clusters from infrastructure operators. These guarantees are cryptographically provable to any independent third party verifier. The architecture is built on hardware Trusted Execution Environments (TEEs), specifically AMD SEV-SNP, Intel TDX, and NVIDIA Confidential Computing support, to establish an attestation-rooted trust boundary around confidential VMs. This design is compatible with managed Kubernetes services such as Amazon EKS, Google GKE, and Microsoft AKS, where the control plane cannot be attested. Under this boundary, three groups gain guarantees that are absent from conventional deployments. Data and artifact owners can deploy sensitive workloads and proprietary artifacts on third-party infrastructure without risking exfiltration. Compute providers can offer execution services without revealing workloads to cloud operators. End users can submit requests that remain opaque to all parties except the attested TEE processing them. Representative workloads include AI inference, securing AI model weights, and training or fine-tuning on sensitive data.", "authors": [ "Amean Asad", "Patrick McClurg", "João Andrade" ], "year": 2026, "published_date": "2026-04-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.26974", "pdf_url": "https://arxiv.org/pdf/2604.26974", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.35, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper presents C8s, a confidential computing architecture for Kubernetes that provides cryptographically rooted confidentiality, integrity, and verifiability guarantees for Kubernetes clusters from infrastructure operators. These guarantees are cryptographically provable to any independent third party verifier.", "key_contribution": "This paper presents C8s, a confidential computing architecture for Kubernetes that provides cryptographically rooted confidentiality, integrity, and verifiability guarantees for Kubernetes clusters from infrastructure operators.", "why_it_matters": "C8s: A Confidential Kubernetes Architecture represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "This paper presents C8s, a confidential computing architecture for Kubernetes that provides cryptographically rooted…", "biggest_caveat": "cannot be attested.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2604.26974", "difficulty": "intermediate" }, { "id": "arxiv:2604.26152", "source": "arxiv", "source_type": "preprint", "title": "AI Observability for Large Language Model Systems: A Multi-Layer Analysis of Monitoring Approaches from Confidence Calibration to Infrastructure Tracing", "abstract": "The deployment of large language models (LLMs) in production environments has created an urgent need for observability systems that span the full stack -- from model internals to GPU kernels. Yet existing monitoring approaches address isolated layers of this stack, and no comprehensive analysis has examined how these techniques relate, overlap, or complement each other. This paper presents a structured analysis of five recent research contributions (2025-2026) that collectively define the emerging landscape of AI observability: confidence calibration via reinforcement learning (MIT), internal state monitoring through propositional probes (UC Berkeley), chain-of-thought monitorability evaluation (OpenAI), autonomous cloud operations benchmarking (Microsoft Research, UC Berkeley, UIUC), and non-intrusive inference-level tracing (TRUFFLD). We organize these contributions into a five-layer observability taxonomy, synthesize their key findings into a unified comparison, and identify four critical gaps that remain unaddressed. We further contextualize these research directions against practical operational observability systems that translate infrastructure telemetry into actionable insights for site reliability teams. Our analysis reveals that while individual monitoring layers have matured rapidly, the integration challenge -- connecting model-level confidence signals with infrastructure-level anomalies into coherent operational intelligence -- remains the defining open problem for the field.", "authors": [ "Twinkll Sisodia" ], "year": 2026, "published_date": "2026-04-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.26152", "pdf_url": "https://arxiv.org/pdf/2604.26152", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "RL", "Evaluation", "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 5.08, "content_potential_score": 1.84, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The deployment of large language models (LLMs) in production environments has created an urgent need for observability systems that span the full stack -- from model internals to GPU kernels. Yet existing monitoring approaches address isolated layers of this stack, and no comprehensive analysis has examined how these techniques relate, overlap, or complement each other.", "key_contribution": "The deployment of large language models (LLMs) in production environments has created an urgent need for observability systems that span the full stack -- from model internals to GPU kernels.", "why_it_matters": "AI Observability for Large Language Model Systems: A Multi-Layer Analysis of Monitoring Approaches from Confidence Calibration to Infrastructure Tracing represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "The deployment of large language models (LLMs) in production environments has created an urgent need for observability…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2604.26152", "difficulty": "beginner" }, { "id": "arxiv:2604.23012", "source": "arxiv", "source_type": "preprint", "title": "On-Device Vision Training, Deployment, and Inference on a Thumb-Sized Microcontroller", "abstract": "This paper presents a complete, end-to-end on-device vision machine learning pipeline, comprising data acquisition, two-layer CNN training with Adam optimization, and real-time inference, executing entirely on a microcontroller-class device costing $15-40 USD. Unlike cloud-based workflows that require external infrastructure and conceal the computational pipeline from the practitioner, this system implements every step of the core ML lifecycle in approximately 1,750 lines of readable C++ that compiles in under one minute using the Arduino IDE, with no external ML dependencies. Running on the Seeed Studio ESP32-S3 XIAO ML Kit (8 MB PSRAM), the firmware achieves three-class 64x64 image classification in approximately 9 minutes per training run, with real-time inference at 6.3 FPS. Key contributions include: correct batch-level gradient accumulation; pre-computed resize lookup tables for inference; dual-format weight export for SD-free baked-in deployment; a three-tier weight priority system (SD binary > baked-in header > He-initialization) resolved automatically at boot; a single-constant network reconfiguration interface; and PSRAM-aware memory management suited to microcontroller constraints. All source code and reference datasets are released under the MIT License at https://github.com/webmcu-ai/on-device-vision-ai", "authors": [ "Jeremy Ellis" ], "year": 2026, "published_date": "2026-04-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.23012", "pdf_url": "https://arxiv.org/pdf/2604.23012", "citations": 0, "topics": [], "tags": [ "Object Detection", "Info Extraction", "Machine Learning", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.4, "content_potential_score": 3.52, "interestingness_score": 3.36, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper presents a complete, end-to-end on-device vision machine learning pipeline, comprising data acquisition, two-layer CNN training with Adam optimization, and real-time inference, executing entirely on a microcontroller-class device costing $15-40 USD. Unlike cloud-based workflows that require external infrastructure and conceal the computational pipeline from the practitioner, this system implements every step of the core ML lifecycle in approximately 1,750 lines of readable C++ that compiles in under one minute using the Arduino IDE, with no external ML dependencies.", "key_contribution": "This paper presents a complete, end-to-end on-device vision machine learning pipeline, comprising data acquisition, two-layer CNN training with Adam optimization, and real-time inference, executing entirely on a microcontroller-class device costing $15-40 USD.", "why_it_matters": "On-Device Vision Training, Deployment, and Inference on a Thumb-Sized Microcontroller advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Object Detection.", "one_line_takeaway": "This paper presents a complete, end-to-end on-device vision machine learning pipeline, comprising data acquisition,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Object Detection.", "url": "https://arxiv.org/abs/2604.23012", "difficulty": "intermediate" }, { "id": "arxiv:2604.02678v1", "source": "arxiv", "source_type": "preprint", "title": "Eligibility-Aware Evidence Synthesis: An Agentic Framework for Clinical Trial Meta-Analysis", "abstract": "Clinical evidence synthesis requires identifying relevant trials from large registries and aggregating results that account for population differences. While recent LLM-based approaches have automated components of systematic review, they do not support end-to-end evidence synthesis. Moreover, conventional meta-analysis weights studies by statistical precision without considering clinical compatibility reflected in eligibility criteria. We propose EligMeta, an agentic framework that integrates automated trial discovery with eligibility-aware meta-analysis, translating natural-language queries into reproducible trial selection and incorporating eligibility alignment into study weighting to produce cohort-specific pooled estimates. EligMeta employs a hybrid architecture separating LLM-based reasoning from deterministic execution: LLMs generate interpretable rules from natural-language queries and perform schema-constrained parsing of trial metadata, while all logical operations, weight computations, and statistical pooling are executed deterministically to ensure reproducibility. The framework structures eligibility criteria and computes similarity-based study weights reflecting population alignment between target and comparator trials. In a gastric cancer landscape analysis, EligMeta reduced 4,044 candidate trials to 39 clinically relevant studies through rule-based filtering, recovering all 13 guideline-cited trials. In an olaparib adverse events meta-analysis across four trials, eligibility-aware weighting shifted the pooled risk ratio from 2.18 (95% CI: 1.71-2.79) under conventional Mantel-Haenszel estimation to 1.97 (95% CI: 1.76-2.20), demonstrating quantifiable impact of incorporating eligibility alignment. EligMeta bridges automated trial discovery with eligibility-aware meta-analysis, providing a scalable and reproducible framework for evidence synthesis in precision medicine.", "authors": [ "Yao Zhao", "Zhiyue Zhang", "Yanxun Xu" ], "year": 2026, "published_date": "2026-04-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.02678v1", "pdf_url": "https://arxiv.org/pdf/2604.02678v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Safety", "AI Agents", "Biomedical AI" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.04, "content_potential_score": 1.42, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Clinical evidence synthesis requires identifying relevant trials from large registries and aggregating results that account for population differences. While recent LLM-based approaches have automated components of systematic review, they do not support end-to-end evidence synthesis.", "key_contribution": "We propose EligMeta, an agentic framework that integrates automated trial discovery with eligibility-aware meta-analysis, translating natural-language queries into reproducible trial selection and incorporating eligibility alignment into study weighting to produce cohort-specific pooled estimates.", "why_it_matters": "Eligibility-Aware Evidence Synthesis: An Agentic Framework for Clinical Trial Meta-Analysis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose EligMeta, an agentic framework that integrates automated trial discovery with eligibility-aware…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.02678v1", "difficulty": "advanced" }, { "id": "arxiv:2605.12273", "source": "arxiv", "source_type": "preprint", "title": "Into the Unknown: Accounting for Missing Demographic Data when Mitigating Ad Delivery Skew", "abstract": "Online advertising platforms use algorithmic systems to power the process of matching ads to users, termed ad delivery. Prior audits have demonstrated that ad delivery can be skewed by demographic attributes, such that ads are systematically under-delivered to certain groups despite advertiser intent to reach groups proportionally. This under-delivery raises a serious concern in the context of ads promoting public services, which might prevent certain groups of individuals from accessing information about resources on the basis of their demographic identity. In the absence of platform-provided solutions to skewed ad delivery, advertisers can counteract skew by targeting demographic groups directly. However, direct targeting excludes users whose demographics the platform cannot infer (\"unknown users\") if advertising platforms do not provide a way to target unknown users directly, as is the case on Google Ads. We collaborate with a state-level government agency to reduce gender-based skew in ad delivery with an intervention that accounts for unknown users while incorporating gender-based targeting. In particular, we design a budget split intervention that directly incorporates unknown users and targets users with Google-inferred gender labels (i.e., male, female). We find that this intervention is a valuable approach to addressing ad delivery skew without excluding unknown users, and serves as a middle ground in the trade-off between higher costs (from more granular demographic targeting) and skew (from ignoring demographics entirely). This approach is responsive to the needs of real-world, resource-constrained advertisers who are committed to the equitable distribution of public service outreach via online advertising. We conclude with recommendations for government advertisers, online advertising platforms, and researchers.", "authors": [ "Isabel Corpus", "Allison Koenecke" ], "year": 2026, "published_date": "2026-05-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.12273", "pdf_url": "https://arxiv.org/pdf/2605.12273", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.2, "read_first_score": 4.05, "content_potential_score": 1.0, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Online advertising platforms use algorithmic systems to power the process of matching ads to users, termed ad delivery. Prior audits have demonstrated that ad delivery can be skewed by demographic attributes, such that ads are systematically under-delivered to certain groups despite advertiser intent to reach groups proportionally.", "key_contribution": "Online advertising platforms use algorithmic systems to power the process of matching ads to users, termed ad delivery.", "why_it_matters": "Into the Unknown: Accounting for Missing Demographic Data when Mitigating Ad Delivery Skew represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "Online advertising platforms use algorithmic systems to power the process of matching ads to users, termed ad delivery.", "biggest_caveat": "butes, such that ads are systematically under-delivered to certain groups despite advertiser intent to reach groups proportionally.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2605.12273", "difficulty": "intermediate" }, { "id": "arxiv:2609.26820", "source": "arxiv", "source_type": "preprint", "title": "Signal2Symbol: Neuro-Symbolic Temporal Reasoning for Explainable Physiological Time-Series Anomaly Detection", "abstract": "Physiological time series such as electrocardiograms (ECG) and electroencephalograms (EEG) exhibit complex temporal structure, substantial acquisition variability, and a strong need for transparent decision-making. Although deep models can achieve high detection performance, they often provide limited insight into why a segment is anomalous, how local anomalies relate over time, and whether a detection belongs to a broader recurring pattern. We propose Signal2Symbol, a neuro-symbolic framework for explainable biosignal anomaly detection. The method first converts ECG/EEG signals into symbolic sequences using either a learned VQ-VAE (Vector Quantized Variational Autoencoder) codebook or a SAX (Symbolic Aggregate approXimation) baseline. It then constructs bigram enriched token-window transactions and scores anomalies through rare itemset evidence derived from minimal rare itemset mining. Detected anomalous windows are merged into intervals and related using Allen interval algebra, enabling composite temporal explanations such as escalation chains, artifact overlap, and cross-channel synchrony. Finally, we introduce a rare temporal concept lattice based on Formal Concept Analysis (FCA), which groups anomalous intervals by shared rare symbolic evidence, Allen temporal relations, channel context, and robustness attributes. The resulting Galois lattice compresses many local detections into interpretable families of temporal-symbolic anomalies. We evaluate on three public benchmarks: MIT-BIH Arrhythmia (beat-level ECG), PTB-XL (record-level ECG), and the Bonn EEG dataset (segment-level EEG). We stress-test robustness under additive noise and baseline-wander perturbations. The results highlight the value of neuro-symbolic tokenization for temporal anomaly analysis and show that Allen/FCA reasoning provides compact, interpretable summaries of local detections.", "authors": [ "Naser Mansour", "Sidahmed Benabderrahmane", "Ameer Rahwan" ], "year": 2026, "published_date": "2026-09-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.26820", "pdf_url": "https://arxiv.org/pdf/2609.26820", "citations": 0, "topics": [], "tags": [ "Reasoning", "Interpretability", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Uses vae — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.19, "read_first_score": 5.3, "content_potential_score": 2.9, "interestingness_score": 3.04, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Physiological time series such as electrocardiograms (ECG) and electroencephalograms (EEG) exhibit complex temporal structure, substantial acquisition variability, and a strong need for transparent decision-making. Although deep models can achieve high detection performance, they often provide limited insight into why a segment is anomalous, how local anomalies relate over time, and whether a detection belongs to a broader recurring pattern.", "key_contribution": "Although deep models can achieve high detection performance, they often provide limited insight into why a segment is anomalous, how local anomalies relate over time, and whether a detection belongs to a broader recurring pattern.", "why_it_matters": "Signal2Symbol: Neuro-Symbolic Temporal Reasoning for Explainable Physiological Time-Series Anomaly Detection represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Although deep models can achieve high detection performance, they often provide limited insight into why a segment is…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2609.26820", "difficulty": "advanced" }, { "id": "arxiv:2512.01031", "source": "arxiv", "source_type": "preprint", "title": "VLASH: Real-Time VLAs via Future-State-Aware Asynchronous Inference", "abstract": "Vision-Language-Action models (VLAs) are becoming increasingly capable across diverse robotic tasks. However, these models are typically deployed under synchronous inference, where the robot waits for model inference to complete before acting, and cannot perceive or respond to environmental changes during action execution. This not only introduces noticeable action stalls, but also significantly increases reaction latency, fundamentally limiting the applicability of VLAs to dynamic, real-time tasks. Asynchronous inference offers a promising solution to achieve continuous and low-latency control by enabling robots to execute actions and perform inference simultaneously. However, because the robot and environment continue to evolve during inference, a temporal misalignment arises between the prediction and execution intervals. This leads to significant action instability, while existing asynchronous methods either degrade accuracy or introduce runtime overhead to mitigate it. We propose VLASH, a simple yet effective method for asynchronous VLA inference that delivers smooth, accurate, and fast reaction control without architectural changes or additional runtime overhead. VLASH leverages the future execution-time state by rolling the robot state forward with the previous action chunk, thereby bridging the gap between prediction and execution. Experiments show that VLASH reduces reaction latency by up to 11.8x compared to synchronous inference and consistently outperforms all asynchronous baselines in accuracy. With action quantization, it further achieves 1.5-2.0x task completion speedup with minimal accuracy loss. Moreover, it empowers state-of-the-art VLAs such as $π_{0.5}$ to handle fast-reaction, high-precision tasks including playing ping-pong and playing whack-a-mole, where traditional synchronous inference fails. Code is available at https://github.com/mit-han-lab/vlash", "authors": [ "Jiaming Tang", "Yufei Sun", "Yilong Zhao", "Shang Yang", "Yujun Lin", "Zhuoyang Zhang", "James Hou", "Yao Lu", "Zhijian Liu", "Song Han" ], "year": 2026, "published_date": "2026-07-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2512.01031", "pdf_url": "https://arxiv.org/pdf/2512.01031", "citations": 0, "topics": [], "tags": [ "AI Safety", "Model Compression", "Robotics", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.19, "read_first_score": 4.12, "content_potential_score": 0.0, "interestingness_score": 1.59, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Vision-Language-Action models (VLAs) are becoming increasingly capable across diverse robotic tasks. However, these models are typically deployed under synchronous inference, where the robot waits for model inference to complete before acting, and cannot perceive or respond to environmental changes during action execution.", "key_contribution": "Asynchronous inference offers a promising solution to achieve continuous and low-latency control by enabling robots to execute actions and perform inference simultaneously.", "why_it_matters": "VLASH: Real-Time VLAs via Future-State-Aware Asynchronous Inference represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "Asynchronous inference offers a promising solution to achieve continuous and low-latency control by enabling robots to…", "biggest_caveat": "cannot perceive or respond to environmental changes during action execution.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2512.01031", "difficulty": "advanced" }, { "id": "arxiv:2606.18872", "source": "arxiv", "source_type": "preprint", "title": "Bridging Single Distortion Artifacts and Mmultifactorial Clinical Quality: Few-shot Biparametric MRI Quality Assessment via Distortion-trained Prototypical Networks", "abstract": "Clinical prostate multi-parametric MRI relies heavily on high-quality diffusion-weighted imaging (DWI), yet reading DWI is frequently compromised by geometric distortion, often caused by rectal air. Assessing quality via the PI-QUAL scoring system is an emerging clinical standard, but it is subjective, time-consuming and suffers from a class imbalance where low-quality cases are diverse and relatively scarce. Using the PRIME clinical trial as an example, there are $6\\%$ images with PI-QUAL scores lower than 4, $87\\%$ of DWI issues are due to distortion. Many of the other clinical quality issues are under-represented. To address this common dual-scarcity of annotated clinical data, we propose a few-shot biparametric prototypical network for automated image quality assessment (IQA). Our framework utilizes a dual-branch 3D ResNet to fuse T2-weighted and DWI features, providing anatomical context to distinguish true morphology from distortion. To handle real-world heterogeneity, we introduce feature-wise linear modulation (FiLM) and a gradient reversal layer (GRL) to align feature distributions conditioned on varying b-values while suppressing acquisition-related biases. We demonstrate that a model meta-trained solely on comparatively objective, readily obtainable distortion labels can effectively adapt to predicting complex, multi-factorial clinical quality scores such as PI-QUAL using only five representative samples. Experimental results on two datasets show that our method significantly outperforms few-shot learning baselines for this challenging IQA task, offering a practically feasible and data-efficient solution for standardizing prostate MRI quality control in clinical workflows.", "authors": [ "Yuheng Tang", "Alexander Ng", "Wen Yan", "Natasha Thorley", "Pawel Rajwa", "Yipei Wang", "Aqua Asif", "Clare Allen", "Louise Dickinson", "Francesco Giganti", "Shonit Punwani", "Daniel Alexander", "Veeru Kasivisvanathan", "Yipeng Hu" ], "year": 2026, "published_date": "2026-06-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.18872", "pdf_url": "https://arxiv.org/pdf/2606.18872", "citations": 0, "topics": [], "tags": [ "Prompting", "Biomedical AI", "Fairness & Ethics", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.19, "read_first_score": 6.95, "content_potential_score": 0.0, "interestingness_score": 1.59, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Clinical prostate multi-parametric MRI relies heavily on high-quality diffusion-weighted imaging (DWI), yet reading DWI is frequently compromised by geometric distortion, often caused by rectal air. Assessing quality via the PI-QUAL scoring system is an emerging clinical standard, but it is subjective, time-consuming and suffers from a class imbalance where low-quality cases are diverse and relatively scarce.", "key_contribution": "To address this common dual-scarcity of annotated clinical data, we propose a few-shot biparametric prototypical network for automated image quality assessment (IQA).", "why_it_matters": "Bridging Single Distortion Artifacts and Mmultifactorial Clinical Quality: Few-shot Biparametric MRI Quality Assessment via Distortion-trained Prototypical Networks advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "To address this common dual-scarcity of annotated clinical data, we propose a few-shot biparametric prototypical…", "biggest_caveat": "but it is subjective, time-consuming and suffers from a class imbalance where low-quality cases are diverse and relatively scarce.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2606.18872", "difficulty": "beginner" }, { "id": "arxiv:2605.11388", "source": "arxiv", "source_type": "preprint", "title": "Deep Reasoning in General Purpose Agents via Structured Meta-Cognition", "abstract": "Humans intuitively solve complex problems by flexibly shifting among reasoning modes: they plan, execute, revise intermediate goals, resolve ambiguity through associative judgment, and apply formal procedures to well-specified subproblems. Current LLM agents lack this flexibility, as their scaffolds hard-code such reasoning decisions in advance. These scaffolds are effective when their prescribed structure matches the task, but brittle when solving the task requires adapting the structure of reasoning itself. We introduce Deep Reasoning -- an inference-time approach for constructing task-specific scaffolds through structured meta-reasoning. Deep Reasoning uses a formal language that represents meta-reasoning as executable decompositions over associative inference, formal computation, and recursive subproblem solving, enabling decomposition principles to be encoded as in-context examples that guide test-time scaffold construction. We instantiate this approach in a general-purpose agent (DOLORES) that distributes complex tasks across more controlled reasoning threads. We evaluate it against state-of-the-art scaffolding methods across four hard benchmarks: multi-hop reasoning, long-chain question answering, long-context aggregation, and deep research-style information seeking. DOLORES outperforms all evaluated scaffolds across three model sizes and two model families, improving over the strongest evaluated scaffold baseline by 24.8% on average. DOLORES distributes cognition across structured, lower-load reasoning threads, thereby reducing premature termination and hallucinations. This advantage can even bridge the scaling gap, with an 8B version surpassing all evaluated 32B baselines from the same family in more than half the settings. These results point toward future agentic systems that treat scaffolding as adaptive reasoning, constructing the structure each task requires just-in-time.", "authors": [ "Dean Light", "Michael Theologitis", "Kshitish Ghate", "Shuyue Stella Li", "Benjamin Newman", "Chirag Shah", "Aylin Caliskan", "Pang Wei Koh", "Dan Suciu", "Yulia Tsvetkov" ], "year": 2026, "published_date": "2026-05-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.11388", "pdf_url": "https://arxiv.org/pdf/2605.11388", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Hallucination", "Long Context", "AI Agents" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.19, "read_first_score": 4.73, "content_potential_score": 1.52, "interestingness_score": 2.35, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Humans intuitively solve complex problems by flexibly shifting among reasoning modes: they plan, execute, revise intermediate goals, resolve ambiguity through associative judgment, and apply formal procedures to well-specified subproblems. Current LLM agents lack this flexibility, as their scaffolds hard-code such reasoning decisions in advance.", "key_contribution": "We introduce Deep Reasoning -- an inference-time approach for constructing task-specific scaffolds through structured meta-reasoning.", "why_it_matters": "Deep Reasoning in General Purpose Agents via Structured Meta-Cognition represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Deep Reasoning -- an inference-time approach for constructing task-specific scaffolds through structured…", "biggest_caveat": "but brittle when solving the task requires adapting the structure of reasoning itself.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.11388", "difficulty": "intermediate" }, { "id": "arxiv:2604.14895v1", "source": "arxiv", "source_type": "preprint", "title": "Beyond Importance Sampling: Rejection-Gated Policy Optimization", "abstract": "We propose a new perspective on policy optimization: rather than reweighting all samples by their importance ratios, an optimizer should select which samples are trustworthy enough to drive a policy update. Building on this view, we introduce Rejection-Gated Policy Optimization (RGPO), which replaces the importance sampling ratio r_theta = pi_theta / pi_old with a smooth, differentiable acceptance gate alpha_theta(s, a) = g(r_theta(s, a)) in the range [0, 1]. Unlike prior work that applies rejection sampling as a data-level heuristic before training, RGPO elevates rejection to an optimization principle: the gate participates directly in gradient computation and is implicitly updated alongside the policy. RGPO provides a unified framework: the policy gradients of TRPO, PPO, and REINFORCE all correspond to specific choices of the effective gradient weight w(r) = g'(r) * r. We prove that RGPO guarantees finite, bounded gradient variance even when importance sampling ratios are heavy-tailed (where IS variance diverges). We further show that RGPO incurs only a bounded, controllable bias and provides an approximate monotonic policy improvement guarantee analogous to TRPO. RGPO matches PPO in computational cost, requires no second-order optimization, and extends naturally to RLHF-style preference alignment. In online preference fine-tuning of Qwen2.5-1.5B-Instruct on Anthropic HH-RLHF (n = 3 seeds), RGPO uses a dual-ratio gate that anchors learning to both the previous policy and the reference model, achieving a Pareto-dominant outcome: the highest reward among online RL methods (+14.8% vs. PPO-RLHF) and the lowest KL divergence to the reference model (-16.0% vs. PPO-RLHF, -53.1% vs. GRPO).", "authors": [ "Ziwu Sun", "Zhen Gao", "Jiyong Zhang", "Jiaheng Li" ], "year": 2026, "published_date": "2026-04-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.14895v1", "pdf_url": "https://arxiv.org/pdf/2604.14895v1", "citations": 0, "topics": [], "tags": [ "RLHF", "Fine-Tuning", "AI Safety", "Fairness & Ethics", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.19, "read_first_score": 4.8, "content_potential_score": 0.42, "interestingness_score": 1.8, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We propose a new perspective on policy optimization: rather than reweighting all samples by their importance ratios, an optimizer should select which samples are trustworthy enough to drive a policy update. Building on this view, we introduce Rejection-Gated Policy Optimization (RGPO), which replaces the importance sampling ratio r_theta = pi_theta / pi_old with a smooth, differentiable acceptance gate alpha_theta(s, a) = g(r_theta(s, a)) in the range [0, 1].", "key_contribution": "We propose a new perspective on policy optimization: rather than reweighting all samples by their importance ratios, an optimizer should select which samples are trustworthy enough to drive a policy update.", "why_it_matters": "Beyond Importance Sampling: Rejection-Gated Policy Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RLHF.", "one_line_takeaway": "We propose a new perspective on policy optimization: rather than reweighting all samples by their importance ratios, an…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RLHF.", "url": "http://arxiv.org/abs/2604.14895v1", "difficulty": "advanced" }, { "id": "arxiv:2604.12005v1", "source": "arxiv", "source_type": "preprint", "title": "BayMOTH: Bayesian optiMizatiOn with meTa-lookahead -- a simple approacH", "abstract": "Bayesian optimization (BO) has for sequential optimization of expensive black-box functions demonstrated practicality and effectiveness in many real-world settings. Meta-Bayesian optimization (meta-BO) focuses on improving the sample efficiency of BO by making use of information from related tasks. Although meta-BO is sample-efficient when task structure transfers, poor alignment between meta-training and test tasks can cause suboptimal queries to be suggested during online optimization. To this end, we propose a simple meta-BO algorithm that utilizes related-task information when determined useful, falling back to lookahead otherwise, within a unified framework. We demonstrate competitiveness of our method with existing approaches on function optimization tasks, while retaining strong performance in low task-relatedness regimes where test tasks share limited structure with the meta-training set.", "authors": [ "Rahman Ejaz", "Varchas Gopalaswamy", "Ricardo Luna", "Aarne Lees", "Vineet Gundecha", "Christopher Kanan", "Soumyendu Sarkar", "Riccardo Betti" ], "year": 2026, "published_date": "2026-04-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.12005v1", "pdf_url": "https://arxiv.org/pdf/2604.12005v1", "citations": 0, "topics": [], "tags": [ "AI Safety", "Artificial Intelligence", "Machine Learning", "AI Safety & Alignment" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.19, "read_first_score": 4.19, "content_potential_score": 0.45, "interestingness_score": 1.82, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Bayesian optimization (BO) has for sequential optimization of expensive black-box functions demonstrated practicality and effectiveness in many real-world settings. Meta-Bayesian optimization (meta-BO) focuses on improving the sample efficiency of BO by making use of information from related tasks.", "key_contribution": "To this end, we propose a simple meta-BO algorithm that utilizes related-task information when determined useful, falling back to lookahead otherwise, within a unified framework.", "why_it_matters": "BayMOTH: Bayesian optiMizatiOn with meTa-lookahead -- a simple approacH advances the critical goal of making AI systems safer, more reliable, and aligned with human values.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "To this end, we propose a simple meta-BO algorithm that utilizes related-task information when determined useful,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in AI Safety.", "url": "http://arxiv.org/abs/2604.12005v1", "difficulty": "frontier" }, { "id": "arxiv:2606.29820", "source": "arxiv", "source_type": "preprint", "title": "Dual-Flow Reinforcement Learning with State-Aware Exploration", "abstract": "In complex continuous-control reinforcement learning tasks, multimodal optimal actions often coincide with uncertain, multimodal return distributions, making reliable value estimation and multimodal exploration challenging. Existing value estimation methods using unimodal Gaussians restrict expressiveness and yield biased estimates. Recent generative policies can represent multimodal actions but often collapse to a few modes and under-explore high-value areas of the action space. Motivated by these challenges, we propose Dual-Flow RL, a unified actor-critic framework that jointly models a continuous return distribution and a multimodal policy distribution using conditional flow matching (CFM). This design supports reliable value estimation and sustained multimodal exploration. To further enhance exploration, we introduce an Entropy-Covariance Exploration Regulator (ECER) that enables state-aware exploration regulation leveraging policy entropy and action-uncertainty covariance. Experiments on DeepMind Control Suite and Humanoid-Bench show that Dual-Flow RL achieves state-of-the-art performance on most tasks, significantly outperforming prior diffusion-based and flow-based methods.", "authors": [ "Qijun Li", "Zheng Fu", "Qi Song", "Yifei He", "Weitao Zhou", "Kun Jiang", "Diange Yang" ], "year": 2026, "published_date": "2026-06-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.29820", "pdf_url": "https://arxiv.org/pdf/2606.29820", "citations": 0, "topics": [], "tags": [ "Multimodal", "RL", "Fairness & Ethics", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.18, "read_first_score": 4.27, "content_potential_score": 0.0, "interestingness_score": 1.59, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In complex continuous-control reinforcement learning tasks, multimodal optimal actions often coincide with uncertain, multimodal return distributions, making reliable value estimation and multimodal exploration challenging. Existing value estimation methods using unimodal Gaussians restrict expressiveness and yield biased estimates.", "key_contribution": "Motivated by these challenges, we propose Dual-Flow RL, a unified actor-critic framework that jointly models a continuous return distribution and a multimodal policy distribution using conditional flow matching (CFM).", "why_it_matters": "Dual-Flow Reinforcement Learning with State-Aware Exploration represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "Motivated by these challenges, we propose Dual-Flow RL, a unified actor-critic framework that jointly models a…", "biggest_caveat": "butions, making reliable value estimation and multimodal exploration challenging.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2606.29820", "difficulty": "advanced" }, { "id": "arxiv:2604.14698v1", "source": "arxiv", "source_type": "preprint", "title": "Mean Flow Policy Optimization", "abstract": "Diffusion models have recently emerged as expressive policy representations for online reinforcement learning (RL). However, their iterative generative processes introduce substantial training and inference overhead. To overcome this limitation, we propose to represent policies using MeanFlow models, a class of few-step flow-based generative models, to improve training and inference efficiency over diffusion-based RL approaches. To promote exploration, we optimize MeanFlow policies under the maximum entropy RL framework via soft policy iteration, and address two key challenges specific to MeanFlow policies: action likelihood evaluation and soft policy improvement. Experiments on MuJoCo and DeepMind Control Suite benchmarks demonstrate that our method, Mean Flow Policy Optimization (MFPO), achieves performance comparable to or exceeding current diffusion-based baselines while considerably reducing training and inference time. Our code is available at https://github.com/MFPolicy/MFPO.", "authors": [ "Xiaoyi Dong", "Xi Sheryl Zhang", "Jian Cheng" ], "year": 2026, "published_date": "2026-04-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.14698v1", "pdf_url": "https://arxiv.org/pdf/2604.14698v1", "citations": 0, "topics": [], "tags": [ "Diffusion", "RL", "Evaluation", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.18, "read_first_score": 5.23, "content_potential_score": 0.84, "interestingness_score": 2.01, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Diffusion models have recently emerged as expressive policy representations for online reinforcement learning (RL). However, their iterative generative processes introduce substantial training and inference overhead.", "key_contribution": "However, their iterative generative processes introduce substantial training and inference overhead.", "why_it_matters": "Mean Flow Policy Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Diffusion.", "one_line_takeaway": "However, their iterative generative processes introduce substantial training and inference overhead.", "biggest_caveat": "However, their iterative generative processes introduce substantial training and inference overhead.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Diffusion.", "url": "http://arxiv.org/abs/2604.14698v1", "difficulty": "beginner" }, { "id": "arxiv:2605.30235", "source": "arxiv", "source_type": "preprint", "title": "BullingerDB: A Dataset for Handwritten Text Recognition and Writer Retrieval", "abstract": "We present BullingerDB, a large-scale benchmark dataset for historical document analysis based on the correspondence of Heinrich Bullinger (1504-1575). The corpus comprises 20,898 pages and 499,222 text lines written by 796 writers over six decades, featuring stylistic variation, multilingual content (mostly Latin and Early New High German) as well as meta-information such as writer identity and time. We evaluate BullingerDB on text recognition and writer retrieval. TrOCR, the best performing model, achieves a CER of 9.1%. For writer retrieval, we introduce a temporal nDCG metric to assess time-aware retrieval. While temporally coherent retrieval is achievable, mAP (78.3%) scores indicate challenges due to long-term stylistic variation. With BullingerDB, we aim to establish a new benchmark for multilingual historical text recognition and temporally-aware writer analysis.", "authors": [ "Marco Peer", "Anna-Scius Bertrand", "Patricia Scheurer", "Andreas Fischer" ], "year": 2026, "published_date": "2026-05-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.30235", "pdf_url": "https://arxiv.org/pdf/2605.30235", "citations": 0, "topics": [], "tags": [ "Document AI", "Evaluation", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.18, "read_first_score": 5.69, "content_potential_score": 1.5, "interestingness_score": 2.34, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present BullingerDB, a large-scale benchmark dataset for historical document analysis based on the correspondence of Heinrich Bullinger (1504-1575). The corpus comprises 20,898 pages and 499,222 text lines written by 796 writers over six decades, featuring stylistic variation, multilingual content (mostly Latin and Early New High German) as well as meta-information such as writer identity and time.", "key_contribution": "We present BullingerDB, a large-scale benchmark dataset for historical document analysis based on the correspondence of Heinrich Bullinger (1504-1575).", "why_it_matters": "BullingerDB: A Dataset for Handwritten Text Recognition and Writer Retrieval advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Document AI.", "one_line_takeaway": "We present BullingerDB, a large-scale benchmark dataset for historical document analysis based on the correspondence of…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Document AI.", "url": "https://arxiv.org/abs/2605.30235", "difficulty": "beginner" }, { "id": "arxiv:2605.28390", "source": "arxiv", "source_type": "preprint", "title": "You Live More Than Once: Towards Hierarchical Skill Meta-Evolving", "abstract": "Test-time skill evolving is regarded as a new paradigm for enhancing deployed agentic systems. Existing works mainly focus on hard-coded skill evolving strategies or parametric learning that rely on expensive parameter updates in the underlying LLMs. In this paper, we demonstrate that test-time refinement of the skill evolving framework itself is necessary for continuous improvement of the agent systems in different downstream scenarios, and lightweight algorithmic adaptation is feasible. Specifically, we propose HiSME, a lightweight hierarchical skill meta-evolving solution that jointly optimizes skills and the skill evolving strategy by learning meta-skills from agents' task execution traces. Experiments on diverse agentic benchmarks show that meta-evolving can produce a higher-quality skill library than pure skill evolving and can derive diverse meta-skills for different scenarios, thereby facilitating future continual experience learning. Our code is temporarily public at https://anonymous.4open.science/r/HiSME-BD45.", "authors": [ "Xujun Li", "Kehan Zheng", "Mingyuan Zhao", "Yize Geng", "Jinfeng Zhou", "Qi Zhu", "Fei Mi", "Lifeng Shang", "Minlie Huang", "Hongning Wang" ], "year": 2026, "published_date": "2026-05-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.28390", "pdf_url": "https://arxiv.org/pdf/2605.28390", "citations": 0, "topics": [], "tags": [ "AI Agents", "Evaluation", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses continual — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.17, "read_first_score": 4.53, "content_potential_score": 0.0, "interestingness_score": 1.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Test-time skill evolving is regarded as a new paradigm for enhancing deployed agentic systems. Existing works mainly focus on hard-coded skill evolving strategies or parametric learning that rely on expensive parameter updates in the underlying LLMs.", "key_contribution": "In this paper, we demonstrate that test-time refinement of the skill evolving framework itself is necessary for continuous improvement of the agent systems in different downstream scenarios, and lightweight algorithmic adaptation is feasible.", "why_it_matters": "You Live More Than Once: Towards Hierarchical Skill Meta-Evolving represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "In this paper, we demonstrate that test-time refinement of the skill evolving framework itself is necessary for…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2605.28390", "difficulty": "advanced" }, { "id": "arxiv:2607.18097", "source": "arxiv", "source_type": "preprint", "title": "SuperPass: Fast-Tracking Blocking Threads to Mitigate Priority Inversion on Mobile Devices", "abstract": "Priority inversion occurs when a high-priority thread is delayed by a lower-priority one. Although well studied in real-time systems, its impact in general-purpose OSes (e.g., Android) remains underexplored.On Android, we find that priority inversions happen frequently and can delay latency-critical threads, degrading user experience.For example, the foreground app's UI thread is frequently blocked by low-priority threads, with blocking durations of up to 210 ms, enough to cause dropped frames.Existing solutions designed for real-time systems fail to eliminate long priority-inversion blockings on latency-critical threads and may introduce high overhead on Android. To solve this problem, we uncover two insights on Android: 1) long blockings are mainly due to the accumulated CPU waiting time of low-priority blocking threads rather than their critical-section latency; and 2) although latency-critical threads can be blocked by many concurrent readers, tracking a limited number of them is sufficient to achieve good responsiveness with low overhead in most cases. Guided by these insights, we propose SuperPass, a lightweight kernel mechanism that mitigates priority inversion by fast-track scheduling of low-priority threads blocking latency-critical threads. It introduces a scheduler fast track that grants immediate CPU access to threads blocking latency-critical threads, and employs a lock-level detector that effectively identifies most such blocking threads. We evaluate SuperPasson a Google Pixel 8 smartphone. Taking UI thread as a case study, SuperPass decreases the 99.9th-percentile blocking duration by 72.0% and blocking count by 47.7% on average compared to the default scheduler, and reduces janky frames by 29.2% with a system-wide CPU overhead of only 0.74%. SuperPass also outperforms existing approaches including priority inheritance, real-time UI promotion, and Proxy Execution.", "authors": [ "Lei Li", "Yu Liang", "Riwei Pan", "Youcheng Sun", "Nan Guan", "Tei-Wei Kuo", "Chun Jason Xue" ], "year": 2026, "published_date": "2026-07-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.18097", "pdf_url": "https://arxiv.org/pdf/2607.18097", "citations": 0, "topics": [], "tags": [], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.17, "read_first_score": 4.73, "content_potential_score": 0.55, "interestingness_score": 1.86, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Priority inversion occurs when a high-priority thread is delayed by a lower-priority one. Although well studied in real-time systems, its impact in general-purpose OSes (e.g., Android) remains underexplored.On Android, we find that priority inversions happen frequently and can delay latency-critical threads, degrading user experience.For example, the foreground app's UI thread is frequently blocked by low-priority threads, with blocking durations of up to 210 ms, enough to cause dropped frames.Existing solutions designed for real-time systems fail to eliminate long priority-inversion blockings on latency-critical threads and may introduce high overhead on Android.", "key_contribution": "Although well studied in real-time systems, its impact in general-purpose OSes (e.g., Android) remains underexplored.On Android, we find that priority inversions happen frequently and can delay latency-critical threads, degrading user experience.For example, the foreground app's UI thread is frequently blocked by low-priority threads, with blocking durations of up to 210 ms, enough to cause dropped frames.Existing solutions designed for real-time systems fail to eliminate long priority-inversion blockings on latency-critical threads and may introduce high overhead on Android.", "why_it_matters": "SuperPass: Fast-Tracking Blocking Threads to Mitigate Priority Inversion on Mobile Devices represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "Although well studied in real-time systems, its impact in general-purpose OSes (e.g., Android) remains underexplored.On…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2607.18097", "difficulty": "intermediate" }, { "id": "arxiv:2607.18965", "source": "arxiv", "source_type": "preprint", "title": "Variational meta-learning inference for low dimensional neural system identification", "abstract": "Deep learning has proven highly effective for nonlinear system identification, but heavily parameterized neural networks are prone to overfitting in low-data regimes and lack reliable uncertainty quantification. The recently developed manifold meta-learning framework addresses the data efficiency problem by restricting the model parameters to a meta-learned low-dimensional manifold. However, that method is purely deterministic. We propose a fully probabilistic extension of the manifold meta-learning framework, based on amortized Variational Inference, where a generative prior over the low-dimensional parameter manifold is learned. During task-specific adaptation, we combine Maximum A Posteriori estimation with the Laplace approximation to yield a mathematically grounded posterior approximation. Evaluated on a static regression task and the Bouc--Wen dynamical system benchmark, the proposed approach achieves predictive accuracy comparable to its deterministic counterpart while successfully providing calibrated uncertainty bounds in severely low-data regimes.", "authors": [ "Matteo Rufolo", "Dario Piga", "Marco Forgione" ], "year": 2026, "published_date": "2026-07-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.18965", "pdf_url": "https://arxiv.org/pdf/2607.18965", "citations": 0, "topics": [], "tags": [ "Evaluation", "Artificial Intelligence", "Machine Learning", "Systems & Control" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses manifold and related concepts.", "maturity_stage": "emerging", "paper_score": 3.17, "read_first_score": 3.46, "content_potential_score": 1.5, "interestingness_score": 2.33, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deep learning has proven highly effective for nonlinear system identification, but heavily parameterized neural networks are prone to overfitting in low-data regimes and lack reliable uncertainty quantification. The recently developed manifold meta-learning framework addresses the data efficiency problem by restricting the model parameters to a meta-learned low-dimensional manifold.", "key_contribution": "We propose a fully probabilistic extension of the manifold meta-learning framework, based on amortized Variational Inference, where a generative prior over the low-dimensional parameter manifold is learned.", "why_it_matters": "Variational meta-learning inference for low dimensional neural system identification represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "We propose a fully probabilistic extension of the manifold meta-learning framework, based on amortized Variational…", "biggest_caveat": "but heavily parameterized neural networks are prone to overfitting in low-data regimes and lack reliable uncertainty quantification.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2607.18965", "difficulty": "frontier" }, { "id": "arxiv:2604.03724v1", "source": "arxiv", "source_type": "preprint", "title": "Rank, Don't Generate: Statement-level Ranking for Explainable Recommendation", "abstract": "Textual explanations, generated with large language models (LLMs), are increasingly used to justify recommendations. Yet, evaluating these explanations remains a critical challenge. We advocate a shift in objective: rank, don't generate. We formalize explainable recommendation as a statement-level ranking problem, where systems rank candidate explanatory statements derived from reviews and return the top-k as explanation. This formulation mitigates hallucination by construction and enables fine-grained factual analysis. It also models factor importance through relevance scores and supports standardized, reproducible evaluation with established ranking metrics. Meaningful assessment, however, requires each statement to be explanatory (item facts affecting user experience), atomic (one opinion about one aspect), and unique (paraphrases consolidated), which is challenging to obtain from noisy reviews. We address this with (i) an LLM-based extraction pipeline producing explanatory and atomic statements, and (ii) a scalable, semantic clustering method consolidating paraphrases to enforce uniqueness. Building on this pipeline, we introduce StaR, a benchmark for statement ranking in explainable recommendation, constructed from four Amazon Reviews 2014 product categories. We evaluate popularity-based baselines and state-of-the-art models under global-level (all statements) and item-level (target item statements) ranking. Popularity baselines are competitive in global-level ranking but outperform state-of-the-art models on average in item-level ranking, exposing critical limitations in personalized explanation ranking.", "authors": [ "Ben Kabongo", "Arthur Satouf", "Vincent Guigue" ], "year": 2026, "published_date": "2026-04-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.03724v1", "pdf_url": "https://arxiv.org/pdf/2604.03724v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "Interpretability", "Evaluation", "Benchmarking & Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.17, "read_first_score": 5.64, "content_potential_score": 2.76, "interestingness_score": 2.96, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Textual explanations, generated with large language models (LLMs), are increasingly used to justify recommendations. Yet, evaluating these explanations remains a critical challenge.", "key_contribution": "Building on this pipeline, we introduce StaR, a benchmark for statement ranking in explainable recommendation, constructed from four Amazon Reviews 2014 product categories.", "why_it_matters": "Rank, Don't Generate: Statement-level Ranking for Explainable Recommendation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Building on this pipeline, we introduce StaR, a benchmark for statement ranking in explainable recommendation,…", "biggest_caveat": "but outperform state-of-the-art models on average in item-level ranking, exposing critical limitations in personalized explanation ranking.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.03724v1", "difficulty": "beginner" }, { "id": "arxiv:2606.26473", "source": "arxiv", "source_type": "preprint", "title": "When Does Quality-Aware Multimodal Fusion Matter? A Leakage-Safe Diagnostic for Decision-Level Dependence", "abstract": "Many multimodal systems estimate the reliability of each modality and weight their contributions to the final prediction. However, it remains unclear whether these scores influence model decisions or merely correlate with performance. We propose a simple diagnostic to test whether reliability information is used during inference. After training, the model and inputs are fixed while reliability scores are permuted across test examples. If predictions depend on these scores, performance should degrade. Experiments on StressID for stress recognition and CMU-MOSEI for sentiment analysis show that permuting reliability scores leaves performance unchanged despite substantial potential gains from selecting the best modality per example. In positive controls where reliability signals identify the correct modality, the same frozen fusion rules yield significant improvements, indicating that reliability signals influence fused decisions only when they reliably predict unimodal correctness.", "authors": [ "Jaden Moon", "Arvind Pillai", "Andrew Campbell" ], "year": 2026, "published_date": "2026-06-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.26473", "pdf_url": "https://arxiv.org/pdf/2606.26473", "citations": 0, "topics": [], "tags": [ "Multimodal", "Sentiment Analysis", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Sentiment Analysis) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.17, "read_first_score": 4.65, "content_potential_score": 0.0, "interestingness_score": 1.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Many multimodal systems estimate the reliability of each modality and weight their contributions to the final prediction. However, it remains unclear whether these scores influence model decisions or merely correlate with performance.", "key_contribution": "We propose a simple diagnostic to test whether reliability information is used during inference.", "why_it_matters": "When Does Quality-Aware Multimodal Fusion Matter? A Leakage-Safe Diagnostic for Decision-Level Dependence represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We propose a simple diagnostic to test whether reliability information is used during inference.", "biggest_caveat": "butions to the final prediction.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2606.26473", "difficulty": "beginner" }, { "id": "arxiv:2604.14973v1", "source": "arxiv", "source_type": "preprint", "title": "Robustness of Vision Foundation Models to Common Perturbations", "abstract": "A vision foundation model outputs an embedding vector for an image, which can be affected by common editing operations (e.g., JPEG compression, brightness, contrast adjustments). These common perturbations alter embedding vectors and may impact the performance of downstream tasks using these embeddings. In this work, we present the first systematic study on foundation models' robustness to such perturbations. We propose three robustness metrics and formulate five desired mathematical properties for these metrics, analyzing which properties they satisfy or violate. Using these metrics, we evaluate six industry-scale foundation models (OpenAI, Meta) across nine common perturbation categories, finding them generally non-robust. We also show that common perturbations degrade downstream application performance (e.g., classification accuracy) and that robustness values can predict performance impacts. Finally, we propose a fine-tuning approach to improve robustness without sacrificing utility.", "authors": [ "Hongbin Liu", "Zhengyuan Jiang", "Cheng Hong", "Neil Zhenqiang Gong" ], "year": 2026, "published_date": "2026-04-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.14973v1", "pdf_url": "https://arxiv.org/pdf/2604.14973v1", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Adversarial", "Cryptography & Security", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.17, "read_first_score": 5.21, "content_potential_score": 0.0, "interestingness_score": 1.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "A vision foundation model outputs an embedding vector for an image, which can be affected by common editing operations (e.g., JPEG compression, brightness, contrast adjustments). These common perturbations alter embedding vectors and may impact the performance of downstream tasks using these embeddings.", "key_contribution": "In this work, we present the first systematic study on foundation models' robustness to such perturbations.", "why_it_matters": "Robustness of Vision Foundation Models to Common Perturbations advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "In this work, we present the first systematic study on foundation models' robustness to such perturbations.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "http://arxiv.org/abs/2604.14973v1", "difficulty": "intermediate" }, { "id": "arxiv:2604.17774v1", "source": "arxiv", "source_type": "preprint", "title": "Prompt Optimization Enables Stable Algorithmic Collusion in LLM Agents", "abstract": "LLM agents in markets present algorithmic collusion risks. While prior work shows LLM agents reach supracompetitive prices through tacit coordination, existing research focuses on hand-crafted prompts. The emerging paradigm of prompt optimization necessitates new methodologies for understanding autonomous agent behavior. We investigate whether prompt optimization leads to emergent collusive behaviors in market simulations. We propose a meta-learning loop where LLM agents participate in duopoly markets and an LLM meta-optimizer iteratively refines shared strategic guidance. Our experiments reveal that meta-prompt optimization enables agents to discover stable tacit collusion strategies with substantially improved coordination quality compared to baseline agents. These behaviors generalize to held-out test markets, indicating discovery of general coordination principles. Analysis of evolved prompts reveals systematic coordination mechanisms through stable shared strategies. Our findings call for further investigation into AI safety implications in autonomous multi-agent systems.", "authors": [ "Yingtao Tian" ], "year": 2026, "published_date": "2026-04-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.17774v1", "pdf_url": "https://arxiv.org/pdf/2604.17774v1", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "AI Agents", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.17, "read_first_score": 3.49, "content_potential_score": 0.55, "interestingness_score": 1.86, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "LLM agents in markets present algorithmic collusion risks. While prior work shows LLM agents reach supracompetitive prices through tacit coordination, existing research focuses on hand-crafted prompts.", "key_contribution": "LLM agents in markets present algorithmic collusion risks.", "why_it_matters": "Prompt Optimization Enables Stable Algorithmic Collusion in LLM Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "LLM agents in markets present algorithmic collusion risks.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.17774v1", "difficulty": "advanced" }, { "id": "arxiv:2606.06178", "source": "arxiv", "source_type": "preprint", "title": "Learning to Route LLMs from Implicit Cost-Performance Preferences via Meta-Learning", "abstract": "Large language models (LLMs) present a trade-off between performance and cost, where more powerful models incur greater expense. LLM routing aims to mitigate expenses while maintaining performance by sending queries to the most suitable model. However, existing methods cannot perform well for different user cost-performance preferences. To address this gap, we introduce a novel perceptive LLM routing paradigm for personalized and user-centric cost-performance optimization, which efficiently learns users' implicit preferences through little interaction. To handle the challenge of heterogeneous user needs, we formulate preference profiles as a set of distinct tasks in contextual bandit and propose MetaRouter, a meta-learning framework designed for preference-aware LLM routing. Experimental results show that MetaRouter outperforms strong baselines on both in-distribution and out-of-distribution tasks. Furthermore, it exhibits high efficiency in learning user preferences, robustness to changes in the routable LLMs, and scalability to multi-model routing.", "authors": [ "Jiahao Zeng", "Ming Tang", "Ningning Ding" ], "year": 2026, "published_date": "2026-06-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.06178", "pdf_url": "https://arxiv.org/pdf/2606.06178", "citations": 0, "topics": [], "tags": [ "LLMs", "Adversarial", "Artificial Intelligence", "Machine Learning", "NLP" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.16, "read_first_score": 4.14, "content_potential_score": 0.0, "interestingness_score": 1.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models (LLMs) present a trade-off between performance and cost, where more powerful models incur greater expense. LLM routing aims to mitigate expenses while maintaining performance by sending queries to the most suitable model.", "key_contribution": "Large language models (LLMs) present a trade-off between performance and cost, where more powerful models incur greater expense.", "why_it_matters": "Learning to Route LLMs from Implicit Cost-Performance Preferences via Meta-Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Large language models (LLMs) present a trade-off between performance and cost, where more powerful models incur greater…", "biggest_caveat": "However, existing methods cannot perform well for different user cost-performance preferences.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.06178", "difficulty": "intermediate" }, { "id": "arxiv:2607.12659", "source": "arxiv", "source_type": "preprint", "title": "Jetson-PI: Towards Onboard Real-Time Robot Control via Foresight-Aligned Asynchronous Inference", "abstract": "Vision-Language-Action (VLA) models have achieved impressive performance on diverse embodied tasks. However, deploying VLA models on low-power onboard devices, such as the Jetson Orin, remains challenging due to their high computational complexity, which leads to substantial inference latency and low control frequency. Asynchronous inference can partially mask this latency by parallelizing action execution and subsequent inference, but it introduces two critical issues: perception-execution misalignment and long reaction time. In this paper, we propose Jetson-PI, a method for efficient VLA deployment on onboard devices via Foresight-Aligned Asynchronous Correction. To address misalignment, we train a lightweight future correction module that predicts future environment representation conditioned on committed actions, enabling the action expert to directly predict actions from the future time step. To reduce reaction time, we introduce confidence-based scheduling optimization that adaptively balances VLM and action expert invocations, complemented by system-level accelerations including CUDA graph reuse, GPU-resident intermediate buffering, and flow unrolling. Extensive experiments demonstrate that Jetson-PI achieves 8.66x and 5.41x improvements in control frequency compared with naive PyTorch and vla.cpp on NVIDIA Jetson Orin, while outperforming VLASH by 14.8\\% in average success rate on the LIBERO benchmark. The code of our asynchronous algorithm is available on https://github.com/PKU-SEC-Lab/Jetson-PI, and our efficient llama.cpp-based inference engine is available on https://github.com/PKU-SEC-Lab/Jetson-PI-Edge.", "authors": [ "Zebin Yang", "Qi Wang", "Yunhe Wang", "Xiurui Guo", "Bo Yu", "Shaoshan Liu", "Jiafeng Xu", "Hao Dong", "Meng Li" ], "year": 2026, "published_date": "2026-07-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.12659", "pdf_url": "https://arxiv.org/pdf/2607.12659", "citations": 0, "topics": [], "tags": [ "AI Safety", "Robotics", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.16, "read_first_score": 6.71, "content_potential_score": 2.34, "interestingness_score": 2.75, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Vision-Language-Action (VLA) models have achieved impressive performance on diverse embodied tasks. However, deploying VLA models on low-power onboard devices, such as the Jetson Orin, remains challenging due to their high computational complexity, which leads to substantial inference latency and low control frequency.", "key_contribution": "In this paper, we propose Jetson-PI, a method for efficient VLA deployment on onboard devices via Foresight-Aligned Asynchronous Correction.", "why_it_matters": "Jetson-PI: Towards Onboard Real-Time Robot Control via Foresight-Aligned Asynchronous Inference represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "In this paper, we propose Jetson-PI, a method for efficient VLA deployment on onboard devices via Foresight-Aligned…", "biggest_caveat": "but it introduces two critical issues: perception-execution misalignment and long reaction time.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2607.12659", "difficulty": "beginner" }, { "id": "arxiv:2609.05289", "source": "arxiv", "source_type": "preprint", "title": "Beyond Aggregate Scores: Behavioral Correctness Assumptions for Assessing Reference-Based Automatic Evaluation Methods", "abstract": "Automated reference-based evaluation methods play a critical role in assessing natural language generation systems. Existing meta-evaluation primarily measures agreement with human judgments or benchmark labels, providing limited insight into evaluator behavior under controlled conditions. We introduce behavioral correctness assumptions, a complementary framework for evaluating reference-based automatic evaluation methods. We define a taxonomy of correctness-preserving and correctness-altering assumptions and operationalize them through controlled response transformations that specify expected scoring behaviors. We evaluate diverse lexical, character-level, semantic, LLM-based, and hybrid evaluators and analyze their assumption-level behavior, stability, sensitivity, repeat-run variability, configuration sensitivity, and reproducibility. Our experiments reveal distinct behavioral trade-offs across evaluation paradigms: no evaluator satisfies all proposed correctness assumptions, and evaluators with similar aggregate performance can exhibit substantially different behavioral profiles. These findings demonstrate that behavioral correctness assumptions provide diagnostic information obscured by conventional aggregate meta-evaluation.", "authors": [ "Maria Mahbub", "Ashley Rice", "Michael R. Munroe", "Amidu Kamara", "Amir Sadovnik" ], "year": 2026, "published_date": "2026-09-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.05289", "pdf_url": "https://arxiv.org/pdf/2609.05289", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.16, "read_first_score": 5.18, "content_potential_score": 1.5, "interestingness_score": 2.33, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Automated reference-based evaluation methods play a critical role in assessing natural language generation systems. Existing meta-evaluation primarily measures agreement with human judgments or benchmark labels, providing limited insight into evaluator behavior under controlled conditions.", "key_contribution": "We introduce behavioral correctness assumptions, a complementary framework for evaluating reference-based automatic evaluation methods.", "why_it_matters": "Beyond Aggregate Scores: Behavioral Correctness Assumptions for Assessing Reference-Based Automatic Evaluation Methods represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce behavioral correctness assumptions, a complementary framework for evaluating reference-based automatic…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.05289", "difficulty": "beginner" }, { "id": "arxiv:2601.18904", "source": "arxiv", "source_type": "preprint", "title": "MetaSICL: Adapting Audiroty LLM via Meta Speech In-Context Learning", "abstract": "Auditory Large Language Models (LLMs) have demonstrated strong performance across a wide range of speech and audio understanding tasks. Nevertheless, they often struggle when applied to low-resource tasks. In case in-domain labeled data are scarce or mismatched with the true test distribution, direct fine-tuning can be brittle. In-Context Learning (ICL) provides a training-free, inference-time solution by adapting auditory LLMs through conditioning on a few in-domain demonstrations. In this work, we first show that $\\textit{Vanilla ICL}$, improves zero-shot performance across diverse speech and audio tasks for selected models which suggest that this ICL adaptation capability can be generalized to multimodal setting. Building on this, we propose $\\textbf{Meta Speech In-Context Learning (MetaSICL)}$, a post-training recipe utilizes only high resource speech data from various tasks intending to strengthen model's in-context learning capability. Experiments indicate our proposed method outperforms direct fine-tuning in low-resource scenario.", "authors": [ "Haolong Zheng", "Siyin Wang", "Zengrui Jin", "Mark Hasegawa-Johnson" ], "year": 2026, "published_date": "2026-05-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.18904", "pdf_url": "https://arxiv.org/pdf/2601.18904", "citations": 0, "topics": [], "tags": [ "LLMs", "Prompting", "Fine-Tuning", "Multimodal", "NLP" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.16, "read_first_score": 5.42, "content_potential_score": 0.0, "interestingness_score": 1.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Auditory Large Language Models (LLMs) have demonstrated strong performance across a wide range of speech and audio understanding tasks. Nevertheless, they often struggle when applied to low-resource tasks.", "key_contribution": "In this work, we first show that $\\textit{Vanilla ICL}$, improves zero-shot performance across diverse speech and audio tasks for selected models which suggest that this ICL adaptation capability can be generalized to multimodal setting.", "why_it_matters": "MetaSICL: Adapting Audiroty LLM via Meta Speech In-Context Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this work, we first show that $\\textit{Vanilla ICL}$, improves zero-shot performance across diverse speech and audio…", "biggest_caveat": "bution, direct fine-tuning can be brittle.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2601.18904", "difficulty": "beginner" }, { "id": "arxiv:2602.03002", "source": "arxiv", "source_type": "preprint", "title": "RPL: Learning Robust Humanoid Perceptive Locomotion on Challenging Terrains", "abstract": "Humanoid perceptive locomotion has made significant progress and shows great promise, yet achieving robust multi-directional locomotion on complex terrains remains underexplored. To tackle this challenge, we propose RPL, a two-stage training framework that enables multi-directional locomotion on challenging terrains, and remains robust with payloads. RPL first trains terrain-specific expert policies with privileged height map observations to master decoupled locomotion and manipulation skills across different terrains, and then distills them into a transformer policy that leverages multiple depth cameras to cover a wide range of views. During distillation, we introduce two techniques to robustify multi-directional locomotion, depth feature scaling based on velocity commands and random side masking, which are critical for asymmetric depth observations and unseen widths of terrains. For scalable depth distillation, we develop an efficient multi-depth system that ray-casts against both dynamic robot meshes and static terrain meshes in massively parallel environments, achieving a 5-times speedup over the depth rendering pipelines in existing simulators while modeling realistic sensor latency, noise, and dropout. Extensive real-world experiments demonstrate robust multi-directional locomotion with payloads (2kg) across challenging terrains, including 20° slopes, staircases with different step lengths (22 cm, 25 cm, 30 cm), and 25 cm by 25 cm stepping stones separated by 60 cm gaps.", "authors": [ "Yuanhang Zhang", "Younggyo Seo", "Juyue Chen", "Yifu Yuan", "Koushil Sreenath", "Pieter Abbeel", "Carmelo Sferrazza", "Karen Liu", "Rocky Duan", "Guanya Shi" ], "year": 2026, "published_date": "2026-08-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.03002", "pdf_url": "https://arxiv.org/pdf/2602.03002", "citations": 0, "topics": [], "tags": [ "Transformers", "Robotics" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.16, "read_first_score": 5.71, "content_potential_score": 1.0, "interestingness_score": 2.08, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Humanoid perceptive locomotion has made significant progress and shows great promise, yet achieving robust multi-directional locomotion on complex terrains remains underexplored. To tackle this challenge, we propose RPL, a two-stage training framework that enables multi-directional locomotion on challenging terrains, and remains robust with payloads.", "key_contribution": "To tackle this challenge, we propose RPL, a two-stage training framework that enables multi-directional locomotion on challenging terrains, and remains robust with payloads.", "why_it_matters": "RPL: Learning Robust Humanoid Perceptive Locomotion on Challenging Terrains represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "To tackle this challenge, we propose RPL, a two-stage training framework that enables multi-directional locomotion on…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2602.03002", "difficulty": "intermediate" }, { "id": "arxiv:2607.10437", "source": "arxiv", "source_type": "preprint", "title": "Interleaved POMDP Planning for Multi-Object Search in Unknown Multi-Room Household Environments", "abstract": "Multi-object search in unknown household environments requires planning under extensive uncertainty - from unknown object locations to cluttered spaces with unobserved obstacles. POMDPs offer a principled framework for such problems but remain intractable in large domains. We propose Inter-POMDP, a novel interleaved POMDP planning algorithm that decomposes this challenge into two interacting levels: a high-level POUCT planner reasons over object distributions using LLM-informed histogram beliefs, while a low-level motion planner models navigation uncertainty with obstacle-aware particle beliefs as domain knowledge to guide high-level POUCT. This interleaved design balances planning quality and efficiency despite the large search space across unknown multi-room environments. Both simulation and real-world experiments show that our Inter-POMDP algorithm reduces collision counts by up to 63%, navigation steps by up to 35%, and detection counts by up to 32% compared with baseline methods. Full videos are https://sites.google.com/view/inter-pomdp", "authors": [ "Ruochu Yang", "Ziyi Xia", "Huibo Zhang", "Yatong Han", "Yiming Zhao", "Yingke Li", "Fumin Zhang", "Yorai Wardi", "Mengxue Hou" ], "year": 2026, "published_date": "2026-07-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.10437", "pdf_url": "https://arxiv.org/pdf/2607.10437", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Robotics" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.16, "read_first_score": 4.13, "content_potential_score": 0.0, "interestingness_score": 1.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multi-object search in unknown household environments requires planning under extensive uncertainty - from unknown object locations to cluttered spaces with unobserved obstacles. POMDPs offer a principled framework for such problems but remain intractable in large domains.", "key_contribution": "We propose Inter-POMDP, a novel interleaved POMDP planning algorithm that decomposes this challenge into two interacting levels: a high-level POUCT planner reasons over object distributions using LLM-informed histogram beliefs, while a low-level motion planner models navigation uncertainty with obstacle-aware particle beliefs as domain knowledge to guide high-level POUCT.", "why_it_matters": "Interleaved POMDP Planning for Multi-Object Search in Unknown Multi-Room Household Environments represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose Inter-POMDP, a novel interleaved POMDP planning algorithm that decomposes this challenge into two…", "biggest_caveat": "but remain intractable in large domains.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.10437", "difficulty": "intermediate" }, { "id": "arxiv:2606.27694", "source": "arxiv", "source_type": "preprint", "title": "Halt Fast! Early Stopping for Certified Robustness", "abstract": "Randomized Smoothing (RS) provides rigorous robustness guarantees for neural networks without architectural constraints, yet its adoption is limited by extreme computational costs. Standard RS requires tens of thousands of model evaluations per input and forces practitioners to commit to fixed sample sizes a priori. In this work, we present a novel meta-learning framework for anytime-valid certified robustness that adaptively deploys computational resources. By using a lightweight meta-learner to predict image-specific priors for a sequential E-process, we achieve a 20-fold reduction in sample complexity compared to traditional methods while maintaining rigorous statistical guarantees. Beyond raw efficiency, we demonstrate how anytime-validity enables adaptively allocating compute based upon application-specific risk thresholds, a form of resource triage impossible under classic certification frameworks. That this is achievable while also providing similar certification performance demonstrates that our approach provides a pathway for real-time, safety-critical certification deployments.", "authors": [ "Andrew C. Cullen", "Paul Montague", "Benjamin I. P. Rubinstein" ], "year": 2026, "published_date": "2026-06-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.27694", "pdf_url": "https://arxiv.org/pdf/2606.27694", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Machine Learning", "Artificial Intelligence", "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.16, "read_first_score": 5.32, "content_potential_score": 0.0, "interestingness_score": 1.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Randomized Smoothing (RS) provides rigorous robustness guarantees for neural networks without architectural constraints, yet its adoption is limited by extreme computational costs. Standard RS requires tens of thousands of model evaluations per input and forces practitioners to commit to fixed sample sizes a priori.", "key_contribution": "In this work, we present a novel meta-learning framework for anytime-valid certified robustness that adaptively deploys computational resources.", "why_it_matters": "Halt Fast! Early Stopping for Certified Robustness represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "In this work, we present a novel meta-learning framework for anytime-valid certified robustness that adaptively deploys…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2606.27694", "difficulty": "intermediate" }, { "id": "arxiv:2606.05441", "source": "arxiv", "source_type": "preprint", "title": "GOTabPFN: From Feature Ordering to Compact Tokenization for Tabular Foundation Models on High-Dimensional Data", "abstract": "We investigate how to make small tabular foundation models effective for High-Dimensional, Low-Sample Size (HDLSS) tabular prediction without retraining large backbones. We introduce Graph-guided Ordering with Local Refinement (GO-LR), show its equivalence to weighted Minimum Linear Arrangement, and interpret the practical solver as a TSP-path-style surrogate. We propose GOTabPFN,which builds on GO-LR, and a Neuro-Inspired Subunit Compression (NSC) unit to pool locally adjacent ordered features into meta-features, yielding a compact representation that makes TabPFN-style prediction practical in HDLSS regimes. Across tabular benchmarks, GOTabPFN improves stability and accuracy under tight token budgets.", "authors": [ "Al Zadid Sultan Bin Habib", "Md Younus Ahamed", "Prashnna Kumar Gyawali", "Gianfranco Doretto", "Donald A. Adjeroh" ], "year": 2026, "published_date": "2026-06-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.05441", "pdf_url": "https://arxiv.org/pdf/2606.05441", "citations": 0, "topics": [], "tags": [ "Structured Data", "Evaluation", "Machine Learning", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.16, "read_first_score": 4.76, "content_potential_score": 0.0, "interestingness_score": 1.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We investigate how to make small tabular foundation models effective for High-Dimensional, Low-Sample Size (HDLSS) tabular prediction without retraining large backbones. We introduce Graph-guided Ordering with Local Refinement (GO-LR), show its equivalence to weighted Minimum Linear Arrangement, and interpret the practical solver as a TSP-path-style surrogate.", "key_contribution": "We introduce Graph-guided Ordering with Local Refinement (GO-LR), show its equivalence to weighted Minimum Linear Arrangement, and interpret the practical solver as a TSP-path-style surrogate.", "why_it_matters": "GOTabPFN: From Feature Ordering to Compact Tokenization for Tabular Foundation Models on High-Dimensional Data represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Structured Data.", "one_line_takeaway": "We introduce Graph-guided Ordering with Local Refinement (GO-LR), show its equivalence to weighted Minimum Linear…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Structured Data.", "url": "https://arxiv.org/abs/2606.05441", "difficulty": "beginner" }, { "id": "arxiv:2606.02008", "source": "arxiv", "source_type": "preprint", "title": "Provable Data Scaling Law for Meta Learning via Complexity Minimization", "abstract": "Pre-training has become a fundamental paradigm in modern machine learning, with one of its key empirical benefits being reduced downstream sample complexity as the scale of pre-training data increases. However, existing theoretical frameworks for pre-training do not fully explain this phenomenon. In this paper, we introduce complexity minimization, a novel meta-representation learning framework designed to enable theoretical analysis of this scaling behavior, which learns representations by evaluating the downstream model complexity best suited to each domain and minimizing the worst-case such complexity across source domains. Our end-to-end theoretical analysis, spanning pre-training through downstream regression, shows that this framework provably captures this scaling behavior; in particular, we show that the error rate of few-shot adaptation improves as the amount of meta-training data grows. Empirically, we demonstrate that incorporating complexity regularization into existing meta-learning methods consistently improves downstream sample efficiency.", "authors": [ "Kazuto Fukuchi", "Ryuichiro Hataya", "Kota Matsui" ], "year": 2026, "published_date": "2026-06-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.02008", "pdf_url": "https://arxiv.org/pdf/2606.02008", "citations": 0, "topics": [], "tags": [ "Prompting", "Self-Supervised", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.16, "read_first_score": 5.89, "content_potential_score": 0.0, "interestingness_score": 1.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Pre-training has become a fundamental paradigm in modern machine learning, with one of its key empirical benefits being reduced downstream sample complexity as the scale of pre-training data increases. However, existing theoretical frameworks for pre-training do not fully explain this phenomenon.", "key_contribution": "In this paper, we introduce complexity minimization, a novel meta-representation learning framework designed to enable theoretical analysis of this scaling behavior, which learns representations by evaluating the downstream model complexity best suited to each domain and minimizing the worst-case such complexity across source domains.", "why_it_matters": "Provable Data Scaling Law for Meta Learning via Complexity Minimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "In this paper, we introduce complexity minimization, a novel meta-representation learning framework designed to enable…", "biggest_caveat": "However, existing theoretical frameworks for pre-training do not fully explain this phenomenon.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2606.02008", "difficulty": "beginner" }, { "id": "arxiv:2609.18597", "source": "arxiv", "source_type": "preprint", "title": "Reasoning through Evolution: Automatic Meta-path Discovery for LLM-based Fake News Detection", "abstract": "Propagation structures provide crucial evidence for fake news detection, yet existing approaches primarily rely on supervised GNN-based models, which require substantial labeled data and exhibit limited generalization. Although large language models (LLMs) exhibit strong reasoning capabilities, directly feeding them raw propagation graphs creates a significant modality mismatch and severe information overload, making structure-aware reasoning unreliable in zero-shot and few-shot settings. To bridge this gap, we propose MAGER, a multi-agent genetic evolution framework that automatically discovers meta-paths optimized for LLM reasoning. By compressing complex propagation graphs into informative subgraphs, the evolved meta-paths alleviate both information overload and modality mismatch, enabling frozen LLMs to perform structure-aware veracity reasoning. We further introduce a graph in-context learning strategy that retrieves semantically and structurally similar demonstrations to strengthen classification and reasoning. Extensive experiments show that MAGER substantially improves frozen LLMs as standalone fake news detectors in data-efficient settings. Our code is available at https://github.com/SenticNet/MAGER.", "authors": [ "Ziyi Zhou", "Xiaoming Zhang", "Hui Pang", "Yuting Zhang", "Tiesunlong Shen", "Bingyu Yan", "Erik Cambria", "Litian Zhang" ], "year": 2026, "published_date": "2026-09-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.18597", "pdf_url": "https://arxiv.org/pdf/2609.18597", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Prompting", "GNNs", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 4.86, "content_potential_score": 0.0, "interestingness_score": 1.57, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Propagation structures provide crucial evidence for fake news detection, yet existing approaches primarily rely on supervised GNN-based models, which require substantial labeled data and exhibit limited generalization. Although large language models (LLMs) exhibit strong reasoning capabilities, directly feeding them raw propagation graphs creates a significant modality mismatch and severe information overload, making structure-aware reasoning unreliable in zero-shot and few-shot settings.", "key_contribution": "To bridge this gap, we propose MAGER, a multi-agent genetic evolution framework that automatically discovers meta-paths optimized for LLM reasoning.", "why_it_matters": "Reasoning through Evolution: Automatic Meta-path Discovery for LLM-based Fake News Detection represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To bridge this gap, we propose MAGER, a multi-agent genetic evolution framework that automatically discovers meta-paths…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.18597", "difficulty": "beginner" }, { "id": "arxiv:2609.19002", "source": "arxiv", "source_type": "preprint", "title": "Code Consistency Preference Optimization Verification for Language Model Alignment", "abstract": "Execution-based verification enhances large language models' mathematical reasoning through computational soundness and dependency-aware filtering. However, prior preference optimization methods relying on Bradley-Terry reward models fail to capture the logical dependencies and execution consistency needed for scientific tasks. We propose a method that generates computationally sound solutions with dependency graphs for execution-consistent preference optimization. We first build a scientific reasoning dataset using UltraFeedback prompts, model generations, verification, and consistency results. Then we extract reasoning step expressions, prerequisites, and derivability relationships to construct dependency graphs and compute execution consistency scores. These scores are appended to each step, creating paired training data. Fine-tuning Llama-3-8B and DeepSeekMath-7B yields significant gains: +17.0% on MATH and +15.1% on GSM8K. Extending our Scientific Feasibility Control framework achieves 50.1% accuracy on PhyX multimodal physics reasoning, surpassing DeepSeek-R1 (49.8%) and OpenAI o3-mini (48.2%), with 91.7% scientific validity coverage at alpha=0.10 and 73% fewer scientific law violations, resulting in the CCPO model family.", "authors": [ "Yunlong Tan", "Mingqiao Mo", "Hao Zhang" ], "year": 2026, "published_date": "2026-07-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.19002", "pdf_url": "https://arxiv.org/pdf/2609.19002", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "RLHF", "Fine-Tuning", "AI Safety" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 4.19, "content_potential_score": 1.5, "interestingness_score": 2.33, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Execution-based verification enhances large language models' mathematical reasoning through computational soundness and dependency-aware filtering. However, prior preference optimization methods relying on Bradley-Terry reward models fail to capture the logical dependencies and execution consistency needed for scientific tasks.", "key_contribution": "We propose a method that generates computationally sound solutions with dependency graphs for execution-consistent preference optimization.", "why_it_matters": "Code Consistency Preference Optimization Verification for Language Model Alignment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose a method that generates computationally sound solutions with dependency graphs for execution-consistent…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.19002", "difficulty": "advanced" }, { "id": "arxiv:2609.15915", "source": "arxiv", "source_type": "preprint", "title": "Safe Meta-Reinforcement Learning via Information Space Reachability", "abstract": "Meta-reinforcement learning (meta-RL) enables agents to adapt to unseen tasks with limited experience. Despite its promise, the application of meta-RL in real-world tasks is hindered by safety requirements, which have been underexplored in prior work. In this paper, we propose a safe meta-RL framework that explicitly accounts for safety during adaptation. Our key insight is to reason about safety in the information space, which captures both the physical state and the agent's belief over the underlying task. Within this space, we introduce a safety value function that measures the probability of the agent avoiding unsafe regions indefinitely. We show that this function satisfies a self-consistency condition and a Bellman equation, which make it learnable via meta-RL. Based on this formulation, we develop a safe meta-RL algorithm that learns the safety value function and leverages it for safety filtering and constrained policy optimization. Experiments on meta-RL benchmarks demonstrate the effectiveness of the proposed method.", "authors": [ "Zeyang Li", "Sunbochen Tang", "Navid Azizan" ], "year": 2026, "published_date": "2026-09-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.15915", "pdf_url": "https://arxiv.org/pdf/2609.15915", "citations": 0, "topics": [], "tags": [ "RL", "Evaluation", "Machine Learning", "Systems & Control" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 6.07, "content_potential_score": 0.0, "interestingness_score": 1.57, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Meta-reinforcement learning (meta-RL) enables agents to adapt to unseen tasks with limited experience. Despite its promise, the application of meta-RL in real-world tasks is hindered by safety requirements, which have been underexplored in prior work.", "key_contribution": "In this paper, we propose a safe meta-RL framework that explicitly accounts for safety during adaptation.", "why_it_matters": "Safe Meta-Reinforcement Learning via Information Space Reachability represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "In this paper, we propose a safe meta-RL framework that explicitly accounts for safety during adaptation.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2609.15915", "difficulty": "beginner" }, { "id": "arxiv:2608.07640", "source": "arxiv", "source_type": "preprint", "title": "HeatCast: A Benchmark for Neighborhood-Scale LST Forecasting across 124 U.S. Cities", "abstract": "Land Surface Temperature (LST) is a widely used satellite-derived measure of urban surface heat, but there is no shared benchmark for forecasting it at 30 m. Prior studies usually cover one to three cities, use kilometer-scale products, or do not release data and code. We introduce HeatCast, a Landsat-based benchmark for monthly LST forecasting across 124 U.S. cities from 2013 through June 2025. HeatCast contains 30 m monthly tiles with LST, elevation, surfacereflectance RGB, three spectral indices, broadband albedo, quality masks, and Local Climate Zone (LCZ) labels, together with a fixed temporal split, LCZ-stratified metrics, and a reference evaluation harness. We evaluate a CNN+LSTM and Earthformer on next-month forecasting, where Earthformer reaches 7.74 K RMSE against 10.42 K for the CNN+LSTM. Forecasting from the eight nonLST channels alone reaches 7.72 K, against 8.15 K from LST history and 8.68 K from RGB. The data, code, and weights are released under MIT at https://doi.org/10.57967/hf/9889.", "authors": [ "Jesus Guerrero", "Isaac Corley", "Leon Najafirad", "Maryam Tabar", "Paul Rad" ], "year": 2026, "published_date": "2026-08-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.07640", "pdf_url": "https://arxiv.org/pdf/2608.07640", "citations": 0, "topics": [], "tags": [ "Evaluation", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 5.89, "content_potential_score": 1.5, "interestingness_score": 2.33, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Land Surface Temperature (LST) is a widely used satellite-derived measure of urban surface heat, but there is no shared benchmark for forecasting it at 30 m. Prior studies usually cover one to three cities, use kilometer-scale products, or do not release data and code.", "key_contribution": "We introduce HeatCast, a Landsat-based benchmark for monthly LST forecasting across 124 U.S.", "why_it_matters": "HeatCast: A Benchmark for Neighborhood-Scale LST Forecasting across 124 U.S. Cities advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "We introduce HeatCast, a Landsat-based benchmark for monthly LST forecasting across 124 U.S.", "biggest_caveat": "but there is no shared benchmark for forecasting it at 30 m.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2608.07640", "difficulty": "beginner" }, { "id": "arxiv:2607.28331", "source": "arxiv", "source_type": "preprint", "title": "Structural Validation of LLM-Generated Microservice Decompositions Using Source-Code Dependencies", "abstract": "Decomposing monolithic systems into microservices is a key activity in software modernization. Although Large Language Models (LLMs) can generate semantically plausible decompositions from textual requirements, it remains unclear whether these proposals preserve the structural dependencies implemented in the source code. This paper evaluates the structural adherence of microservice decompositions generated by OpenAI o3 for the PetClinic and Bookstore systems. We propose an automated validation pipeline based on static dependency analysis and compare zero-shot and few-shot prompting using dependency preservation (TPD) and dependency violation (TVD) metrics. A robustness analysis was conducted to control for differences in class-to-service mapping coverage. After normalization, both prompting strategies produced equivalent structural adherence, achieving TPD values of 68.0% (PetClinic) and 83.3% (Bookstore). The findings demonstrate that structural evaluations of LLM-generated decompositions should explicitly control for mapping coverage, as apparent differences between prompting strategies may otherwise reflect methodological bias rather than genuine architectural quality.", "authors": [ "Daniel Silva", "Renan Alves", "Emanuel Dantas Filho", "Ademar Sousa Neto", "Mirko Perkusich", "Danyllo Wagner Albuquerque", "Kyller Gorgônio", "Angelo Perkusich" ], "year": 2026, "published_date": "2026-07-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.28331", "pdf_url": "https://arxiv.org/pdf/2607.28331", "citations": 0, "topics": [], "tags": [ "LLMs", "Prompting", "Fairness & Ethics", "Software Engineering" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 4.83, "content_potential_score": 0.0, "interestingness_score": 1.57, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Decomposing monolithic systems into microservices is a key activity in software modernization. Although Large Language Models (LLMs) can generate semantically plausible decompositions from textual requirements, it remains unclear whether these proposals preserve the structural dependencies implemented in the source code.", "key_contribution": "We propose an automated validation pipeline based on static dependency analysis and compare zero-shot and few-shot prompting using dependency preservation (TPD) and dependency violation (TVD) metrics.", "why_it_matters": "Structural Validation of LLM-Generated Microservice Decompositions Using Source-Code Dependencies represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose an automated validation pipeline based on static dependency analysis and compare zero-shot and few-shot…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.28331", "difficulty": "beginner" }, { "id": "arxiv:2607.06988", "source": "arxiv", "source_type": "preprint", "title": "WAM-TTT: Steering World-Action Models by Watching Human Play at Test Time", "abstract": "Steering robot foundation models (RFMs) toward new task variants or user-preferred behaviors remains challenging, often requiring additional robot demonstrations, task-specific fine-tuning, or long-context conditioning. We present WAM-TTT, a test-time training framework for steering world action models from raw human videos. Rather than treating human videos as trajectories to imitate, WAM-TTT absorbs them into a lightweight adaptive memory inside a frozen WAM through self-supervised video prediction. To make this memory useful for control, we introduce a meta-training stage that aligns human demonstrations with robot behaviors using paired human-robot data and a key--value memory reconstruction objective. At test time, only unlabeled human videos are required to adapt the memory, while the pretrained WAM remains frozen. This enables efficient and reusable steering without robot actions, human-side annotations, or task-specific fine-tuning, while preserving the generalization ability of the foundation model. Extensive experiments show that WAM-TTT consistently outperforms in-context human-video conditioning baselines across diverse manipulation tasks and generalization settings.", "authors": [ "Yusen Feng", "Bingchen Han", "Jiangran Lyu", "Kai Liu", "Yixin Zheng", "Yuxuan Wan", "Weiheng Liu", "Sun Han", "Ruiqin Li", "Yulong Zhang", "Fangfu Liu", "Xuesong Shi", "Libin Liu", "Yizhou Wang", "Zhizheng Zhang", "He Wang" ], "year": 2026, "published_date": "2026-07-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.06988", "pdf_url": "https://arxiv.org/pdf/2607.06988", "citations": 0, "topics": [], "tags": [ "Long Context", "Fine-Tuning", "Self-Supervised", "Robotics", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses self-supervised — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 4.37, "content_potential_score": 0.0, "interestingness_score": 1.57, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Steering robot foundation models (RFMs) toward new task variants or user-preferred behaviors remains challenging, often requiring additional robot demonstrations, task-specific fine-tuning, or long-context conditioning. We present WAM-TTT, a test-time training framework for steering world action models from raw human videos.", "key_contribution": "We present WAM-TTT, a test-time training framework for steering world action models from raw human videos.", "why_it_matters": "WAM-TTT: Steering World-Action Models by Watching Human Play at Test Time represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Long Context.", "one_line_takeaway": "We present WAM-TTT, a test-time training framework for steering world action models from raw human videos.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Long Context.", "url": "https://arxiv.org/abs/2607.06988", "difficulty": "advanced" }, { "id": "arxiv:2606.26327", "source": "arxiv", "source_type": "preprint", "title": "EVOM: Agentic Meta-Evolution of Actor-Critic Architectures for Reinforcement Learning", "abstract": "In actor-critic reinforcement learning, network architectures are typically manually designed. Automating this design is challenging because each candidate must be trained before evaluation, and the design space is open-ended. To address these challenges, we introduce EVOM, an agentic meta-evolution framework for discovering high-performance actor-critic architectures. We frame architecture search as a bi-level optimization: an inner loop trains weights via the low-fidelity proximal policy optimization (PPO), while an outer loop drives meta-evolution by iteratively refining architecture programs. Crucially, this outer loop is powered by an LLM-based design agent that operates purely as an architecture designer, completely decoupled from policy execution and environment control. Experiments reveal that EVOM outperforms the manually designed baseline, an LLM-guided random search, and the state-of-the-art LLM-guided programmatic policy search method MLES, delivering superior performance on Ant-v4 and HalfCheetah-v4. Ablation studies validate that both the meta-evolution loop and the LLM Design Agent are indispensable for final performance.", "authors": [ "Boyun Zhang", "Chao Wang", "Kai Wu" ], "year": 2026, "published_date": "2026-06-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.26327", "pdf_url": "https://arxiv.org/pdf/2606.26327", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Info Extraction", "RL", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 3.66, "content_potential_score": 0.0, "interestingness_score": 1.57, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In actor-critic reinforcement learning, network architectures are typically manually designed. Automating this design is challenging because each candidate must be trained before evaluation, and the design space is open-ended.", "key_contribution": "To address these challenges, we introduce EVOM, an agentic meta-evolution framework for discovering high-performance actor-critic architectures.", "why_it_matters": "EVOM: Agentic Meta-Evolution of Actor-Critic Architectures for Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address these challenges, we introduce EVOM, an agentic meta-evolution framework for discovering high-performance…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.26327", "difficulty": "advanced" }, { "id": "arxiv:2606.17783", "source": "arxiv", "source_type": "preprint", "title": "Is It Real? Exploiting Virtual-Physical Discrimination Vulnerability in Mixed Reality", "abstract": "Consumer mixed reality (MR) headsets seamlessly blend virtual content into physical environments with sufficient fidelity that users may be unable to distinguish virtual objects from physical ones. We identify this virtual-physical discrimination vulnerability as an exploitable security primitive. Through speculative design workshops with 12 experts from cybersecurity and MR/HCI, we develop a taxonomy of virtual-physical confusion attacks and implement four proof-of-concept attacks on Apple Vision Pro, evaluating them with 26 participants in realistic MR tasks. All four attacks altered user behavior, with success rates ranging from 85% to 100%, producing misdirected interactions, misjudged object identities, biased purchasing decisions, and altered navigation paths. Notably, the most successful attacks were also the hardest to detect according to participants' subjective ratings. Even participants who recognized virtual content still complied behaviorally, and no participant attributed anomalous events to adversarial causes. We propose platform-level provenance, interaction gating, and user education as countermeasures.", "authors": [ "Xueyang Wang", "Xihuan Yao", "Yanming Xiu", "Xin Yi", "Maria Gorlatova", "Hewu Li" ], "year": 2026, "published_date": "2026-06-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.17783", "pdf_url": "https://arxiv.org/pdf/2606.17783", "citations": 0, "topics": [], "tags": [ "Fairness & Ethics", "Human-Computer Interaction" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 4.13, "content_potential_score": 0.0, "interestingness_score": 1.57, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Consumer mixed reality (MR) headsets seamlessly blend virtual content into physical environments with sufficient fidelity that users may be unable to distinguish virtual objects from physical ones. We identify this virtual-physical discrimination vulnerability as an exploitable security primitive.", "key_contribution": "We propose platform-level provenance, interaction gating, and user education as countermeasures.", "why_it_matters": "Is It Real? Exploiting Virtual-Physical Discrimination Vulnerability in Mixed Reality represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fairness & Ethics.", "one_line_takeaway": "We propose platform-level provenance, interaction gating, and user education as countermeasures.", "biggest_caveat": "buted anomalous events to adversarial causes.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Fairness & Ethics.", "url": "https://arxiv.org/abs/2606.17783", "difficulty": "frontier" }, { "id": "arxiv:2511.09190", "source": "arxiv", "source_type": "preprint", "title": "Iterated Population Based Training with Task-Agnostic Restarts", "abstract": "Hyperparameter Optimization (HPO) can lift the burden of tuning hyperparameters (HPs) of neural networks. HPO algorithms from the Population Based Training (PBT) family are efficient thanks to dynamically adjusting HPs every few steps of the weight optimization. Recent results indicate that the number of steps between HP updates is an important meta-HP of all PBT variants that can substantially affect their performance. Yet, no method or intuition is available for efficiently setting its value. We introduce Iterated Population Based Training (IPBT), a novel PBT variant that automatically adjusts this HP via restarts that reuse weight information in a task-agnostic way and leverage time-varying Bayesian optimization to reinitialize HPs. Evaluation on 8 image classification and reinforcement learning tasks shows that, on average, our algorithm matches or outperforms 5 previous PBT variants and other HPO algorithms (random search, ASHA, SMAC3), without requiring a budget increase or any changes to its HPs. The source code is available at https://github.com/AwesomeLemon/IPBT.", "authors": [ "Alexander Chebykin", "Tanja Alderliesten", "Peter A. N. Bosman" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.09190", "pdf_url": "https://arxiv.org/pdf/2511.09190", "citations": 0, "topics": [], "tags": [ "Object Detection", "RL", "Machine Learning", "Neural Networks" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 3.21, "content_potential_score": 1.1, "interestingness_score": 2.12, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Hyperparameter Optimization (HPO) can lift the burden of tuning hyperparameters (HPs) of neural networks. HPO algorithms from the Population Based Training (PBT) family are efficient thanks to dynamically adjusting HPs every few steps of the weight optimization.", "key_contribution": "We introduce Iterated Population Based Training (IPBT), a novel PBT variant that automatically adjusts this HP via restarts that reuse weight information in a task-agnostic way and leverage time-varying Bayesian optimization to reinitialize HPs.", "why_it_matters": "Iterated Population Based Training with Task-Agnostic Restarts represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Object Detection.", "one_line_takeaway": "We introduce Iterated Population Based Training (IPBT), a novel PBT variant that automatically adjusts this HP via…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Object Detection.", "url": "https://arxiv.org/abs/2511.09190", "difficulty": "frontier" }, { "id": "arxiv:2605.03716", "source": "arxiv", "source_type": "preprint", "title": "Unified Multimodal Visual Tracking with Dual Mixture-of-Experts", "abstract": "Multimodal visual object tracking can be divided into to several kinds of tasks (e.g. RGB and RGB+X tracking), based on the input modality. Existing methods often train separate models for each modality or rely on pretrained models to adapt to new modalities, which limits efficiency, scalability, and usability. Thus, we introduce OneTrackerV2, a unified multi-modal tracking framework that enables end-to-end training for any modality. We propose Meta Merger to embed multi-modal information into a unified space, allowing flexible modality fusion and robustness. We further introduce Dual Mixture-of-Experts (DMoE): T-MoE models spatio-temporal relations for tracking, while M-MoE embeds multi-modal knowledge, disentangling cross-modal dependencies and reducing feature conflicts. With a shared architecture, unified parameters, and a single end-to-end training, OneTrackerV2 achieves state-of-the-art performance across five RGB and RGB+X tracking tasks and 12 benchmarks, while maintaining high inference efficiency. Notably, even after model compression, OneTrackerV2 retains strong performance. Moreover, OneTrackerV2 demonstrates remarkable robustness under modality-missing scenarios.", "authors": [ "Lingyi Hong", "Jinglun Li", "Xinyu Zhou", "Kaixun Jiang", "Pinxue Guo", "Zhaoyu Chen", "Runze Li", "Xingdong Sheng", "Wenqiang Zhang" ], "year": 2026, "published_date": "2026-05-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.03716", "pdf_url": "https://arxiv.org/pdf/2605.03716", "citations": 0, "topics": [], "tags": [ "MoE", "Multimodal", "Model Compression", "Evaluation", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 5.57, "content_potential_score": 0.0, "interestingness_score": 1.57, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multimodal visual object tracking can be divided into to several kinds of tasks (e.g. RGB and RGB+X tracking), based on the input modality.", "key_contribution": "Thus, we introduce OneTrackerV2, a unified multi-modal tracking framework that enables end-to-end training for any modality.", "why_it_matters": "Unified Multimodal Visual Tracking with Dual Mixture-of-Experts advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about MoE.", "one_line_takeaway": "Thus, we introduce OneTrackerV2, a unified multi-modal tracking framework that enables end-to-end training for any…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in MoE.", "url": "https://arxiv.org/abs/2605.03716", "difficulty": "beginner" }, { "id": "arxiv:2504.05451", "source": "arxiv", "source_type": "preprint", "title": "ViewBridge: Curriculum Knowledge Distillation for Activity View-Invariance Under Extreme Viewpoint Changes", "abstract": "Traditional methods for view-invariant learning rely on controlled multi-view training data with minimal scene clutter. However, they struggle with in-the-wild videos that exhibit extreme viewpoint differences and share little visual content. We introduce ViewBridge, a framework for learning rich video representations in the presence of severe view-occlusions. We introduce a knowledge distillation objective that preserves action-centric semantics, together with a novel curriculum learning procedure that pairs incrementally more challenging views over time, thereby allowing smooth adaptation to extreme viewpoint differences. To sort training video segments for the proposed curriculum, we define a geometry-based metric that reflects their likely occlusion level. While training leverages multi-view data, at inference time, the input is an uncalibrated, single-viewpoint video. Evaluating our approach on two tasks -- temporal keystep grounding and fine-grained keystep recognition -- we outperform SOTA approaches across three datasets (Ego-Exo4D, LEMMA, EPFL-Smart-Kitchen-30). Project page: https://vision.cs.utexas.edu/projects/learning_view_distill/ .", "authors": [ "Arjun Somayazulu", "Efi Mavroudi", "Changan Chen", "Lorenzo Torresani", "Kristen Grauman" ], "year": 2026, "published_date": "2026-05-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2504.05451", "pdf_url": "https://arxiv.org/pdf/2504.05451", "citations": 0, "topics": [], "tags": [ "Hallucination", "Model Compression", "Computer Vision" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses lemma and related concepts.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 5.15, "content_potential_score": 0.34, "interestingness_score": 1.74, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Traditional methods for view-invariant learning rely on controlled multi-view training data with minimal scene clutter. However, they struggle with in-the-wild videos that exhibit extreme viewpoint differences and share little visual content.", "key_contribution": "We introduce ViewBridge, a framework for learning rich video representations in the presence of severe view-occlusions.", "why_it_matters": "ViewBridge: Curriculum Knowledge Distillation for Activity View-Invariance Under Extreme Viewpoint Changes advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "We introduce ViewBridge, a framework for learning rich video representations in the presence of severe view-occlusions.", "biggest_caveat": "However, they struggle with in-the-wild videos that exhibit extreme viewpoint differences and share little visual content.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2504.05451", "difficulty": "frontier" }, { "id": "arxiv:2605.02288", "source": "arxiv", "source_type": "preprint", "title": "LabBuilder: Protocol-Grounded 3D Layout Generation for Interactable and Safe Laboratory", "abstract": "Automated laboratories hold the promise of accelerating scientific discovery, yet their deployment is bottlenecked by the difficulty of designing safe and executable environments. While simulator-based design offers scalability, existing 3D scene generation methods are primarily tailored for household settings, optimizing for visual plausibility while neglecting the rigorous functional semantics and safety constraints essential for scientific experimentation. We present LabBuilder, an end-to-end system that generates and verifies 3D laboratory layouts from concise textual specifications. It operates through three tightly coupled components: LabForge first curates a meta-dataset of annotated assets and chemical knowledge, translating natural language specifications into structured protocols; building on these protocols, LabGen synthesizes laboratory layouts via an iterative, constraint-aware optimization strategy; finally, LabTouchstone evaluates the resulting layouts as a unified benchmark. Extensive experiments demonstrate that LabBuilder significantly outperforms existing state-of-the-art methods, producing laboratory environments that are not only realistic but also functionally valid and safe for complex experimental workflows.", "authors": [ "Jianbao Cao", "Zhangrui Zhao", "Bohan Feng", "Zixuan Hu", "Rui Li", "Haiyuan Wan", "Chenxi Li", "Jingyuan Li", "Wenzhe Cai", "Lei Bai", "Wanli Ouyang", "Lingyu Duan", "Di Huang", "Mingting Pan", "Sha Zhang", "Xinzhu Ma", "Shixiang Tang", "Dongzhan Zhou" ], "year": 2026, "published_date": "2026-05-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.02288", "pdf_url": "https://arxiv.org/pdf/2605.02288", "citations": 0, "topics": [], "tags": [ "3D Vision", "Evaluation", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 5.38, "content_potential_score": 1.5, "interestingness_score": 2.33, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Automated laboratories hold the promise of accelerating scientific discovery, yet their deployment is bottlenecked by the difficulty of designing safe and executable environments. While simulator-based design offers scalability, existing 3D scene generation methods are primarily tailored for household settings, optimizing for visual plausibility while neglecting the rigorous functional semantics and safety constraints essential for scientific experimentation.", "key_contribution": "We present LabBuilder, an end-to-end system that generates and verifies 3D laboratory layouts from concise textual specifications.", "why_it_matters": "LabBuilder: Protocol-Grounded 3D Layout Generation for Interactable and Safe Laboratory advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about 3D Vision.", "one_line_takeaway": "We present LabBuilder, an end-to-end system that generates and verifies 3D laboratory layouts from concise textual…", "biggest_caveat": "but also functionally valid and safe for complex experimental workflows.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in 3D Vision.", "url": "https://arxiv.org/abs/2605.02288", "difficulty": "beginner" }, { "id": "arxiv:2605.26935", "source": "arxiv", "source_type": "preprint", "title": "DunbaaBERT: From Sacrifice to Semantics", "abstract": "Large language models have achieved strong performance across many NLP tasks, yet Urdu remains comparatively underexplored due to limited resources and fragmented evaluation settings. To address this gap, we introduce DunbaaBERT, a family of Urdu RoBERTa-base models trained from scratch with Byte-BPE vocabularies of 32k, 52k, and 96k tokens on a deduplicated 17GB Urdu corpus. We evaluate DunbaaBERT across intrinsic and downstream Urdu NLP benchmarks covering linguistic acceptability, news classification, offensive language detection, and sentiment analysis while analyzing vocabulary-size effects on performance and efficiency trade-offs. Across benchmarks, the DunbaaBERT variants achieve competitive performance against strong multilingual baselines while consistently maintaining favorable efficiency trade-offs. Interestingly, larger vocabularies do not consistently improve downstream effectiveness, with DunbaaBERT$_{\\text{32k}}$ repeatedly providing the strongest overall efficiency profile. Overall, our results demonstrate that carefully curated Urdu-specific encoder models can remain highly competitive despite comparatively compact model and training scales. All models are released under the MIT license.", "authors": [ "Iffat Maab", "Waleed Jamil", "Raphael Schmitt" ], "year": 2026, "published_date": "2026-05-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.26935", "pdf_url": "https://arxiv.org/pdf/2605.26935", "citations": 0, "topics": [], "tags": [ "LLMs", "Sentiment Analysis", "Evaluation", "NLP" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 5.38, "content_potential_score": 1.5, "interestingness_score": 2.33, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models have achieved strong performance across many NLP tasks, yet Urdu remains comparatively underexplored due to limited resources and fragmented evaluation settings. To address this gap, we introduce DunbaaBERT, a family of Urdu RoBERTa-base models trained from scratch with Byte-BPE vocabularies of 32k, 52k, and 96k tokens on a deduplicated 17GB Urdu corpus.", "key_contribution": "To address this gap, we introduce DunbaaBERT, a family of Urdu RoBERTa-base models trained from scratch with Byte-BPE vocabularies of 32k, 52k, and 96k tokens on a deduplicated 17GB Urdu corpus.", "why_it_matters": "DunbaaBERT: From Sacrifice to Semantics represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this gap, we introduce DunbaaBERT, a family of Urdu RoBERTa-base models trained from scratch with Byte-BPE…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.26935", "difficulty": "beginner" }, { "id": "arxiv:2509.08194", "source": "arxiv", "source_type": "preprint", "title": "Prescribe-then-Select: Adaptive Policy Selection for Contextual Stochastic Optimization", "abstract": "We address the problem of policy selection in contextual stochastic optimization (CSO), where covariates are available as contextual information and decisions must satisfy hard feasibility constraints. In many CSO settings, multiple candidate policies--arising from different modeling paradigms--exhibit heterogeneous performance across the covariate space, with no single policy uniformly dominating. We propose Prescribe-then-Select (PS), a modular framework that first constructs a library of feasible candidate policies and then learns a meta-policy to select the best policy for the observed covariates. We implement the meta-policy using ensembles of Optimal Policy Trees trained via cross-validation on the training set, making policy choice entirely data-driven. Across two benchmark CSO problems--single-stage newsvendor and two-stage shipment planning--PS consistently outperforms the best single policy in heterogeneous regimes of the covariate space and converges to the dominant policy when such heterogeneity is absent. All the code to reproduce the results can be found at https://anonymous.4open.science/r/Prescribe-then-Select-TMLR.", "authors": [ "Caio de Prospero Iglesias", "Kimberly Villalobos Carballo", "Dimitris Bertsimas" ], "year": 2026, "published_date": "2026-05-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.08194", "pdf_url": "https://arxiv.org/pdf/2509.08194", "citations": 0, "topics": [], "tags": [ "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 3.63, "content_potential_score": 1.5, "interestingness_score": 2.33, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We address the problem of policy selection in contextual stochastic optimization (CSO), where covariates are available as contextual information and decisions must satisfy hard feasibility constraints. In many CSO settings, multiple candidate policies--arising from different modeling paradigms--exhibit heterogeneous performance across the covariate space, with no single policy uniformly dominating.", "key_contribution": "We propose Prescribe-then-Select (PS), a modular framework that first constructs a library of feasible candidate policies and then learns a meta-policy to select the best policy for the observed covariates.", "why_it_matters": "Prescribe-then-Select: Adaptive Policy Selection for Contextual Stochastic Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "We propose Prescribe-then-Select (PS), a modular framework that first constructs a library of feasible candidate…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2509.08194", "difficulty": "frontier" }, { "id": "arxiv:2605.15342", "source": "arxiv", "source_type": "preprint", "title": "Minerva-Ego: Spatiotemporal Hints for Egocentric Video Understanding", "abstract": "Video reasoning models are a core component of egocentric and embodied agents. However, standard benchmarks for assessing models provide only evaluation of the output (e.g. the answer to a question), without evaluation of intermediate reasoning steps, and most provide answers only in the text domain. We introduce Minerva-Ego, a benchmark for evaluating complex egocentric visual reasoning. We extend recent high-quality video data sources recorded from egocentric / embodied settings with a set of challenging, multi-step multimodal questions and spatiotemporally-dense human-annotated reasoning traces. Benchmarking experiments show that state-of-the-art models still have a large gap to human performance. To investigate this gap in detail, we annotate each reasoning trace in the dataset with the objects of interest required to solve the question, as spatiotemporal mask annotations. Through extensive evaluations, we identify that prompting frontier models with hints of 'where' and 'when' to look yields substantial improvements in performance. Minerva-Ego can be downloaded at https://github.com/google-deepmind/neptune.", "authors": [ "Arsha Nagrani", "Jasper Uijilings", "Shyamal Buch", "Tobias Weyand", "Sudheendra Vijayanarasimhan", "Bo Hu", "Ramin Mehran", "David A Ross", "Cordelia Schmid" ], "year": 2026, "published_date": "2026-05-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.15342", "pdf_url": "https://arxiv.org/pdf/2605.15342", "citations": 0, "topics": [], "tags": [ "Reasoning", "Video AI", "Robotics", "Evaluation", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 5.38, "content_potential_score": 1.5, "interestingness_score": 2.33, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Video reasoning models are a core component of egocentric and embodied agents. However, standard benchmarks for assessing models provide only evaluation of the output (e.g.", "key_contribution": "We introduce Minerva-Ego, a benchmark for evaluating complex egocentric visual reasoning.", "why_it_matters": "Minerva-Ego: Spatiotemporal Hints for Egocentric Video Understanding advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We introduce Minerva-Ego, a benchmark for evaluating complex egocentric visual reasoning.", "biggest_caveat": "However, standard benchmarks for assessing models provide only evaluation of the output (e.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.15342", "difficulty": "beginner" }, { "id": "arxiv:2604.22031", "source": "arxiv", "source_type": "preprint", "title": "Mochi: Aligning Pre-training and Inference for Efficient Graph Foundation Models via Meta-Learning", "abstract": "We propose Mochi, a Graph Foundation Model that addresses task unification and training efficiency by adopting a meta-learning based training framework. Prior models pre-train with reconstruction-based objectives such as link prediction, and assume that the resulting representations can be aligned with downstream tasks through a separate unification step such as class prototypes. We demonstrate through synthetic and real-world experiments that this procedure, while simple and intuitive, has limitations that directly affect downstream task performance. To address these limitations, Mochi pre-trains on few-shot episodes that mirror the downstream evaluation protocol, aligning the training objective with inference rather than relying on a post-hoc unification step. We show that Mochi, along with its more powerful variant Mochi++, achieves competitive or superior performance compared to existing Graph Foundation Models across 25 real-world graph datasets spanning node classification, link prediction, and graph classification, while requiring 8$\\sim$27 times less training time than the strongest baseline.", "authors": [ "João Mattos", "Arlei Silva" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.22031", "pdf_url": "https://arxiv.org/pdf/2604.22031", "citations": 0, "topics": [], "tags": [ "Prompting", "Self-Supervised", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 5.91, "content_potential_score": 0.42, "interestingness_score": 1.78, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We propose Mochi, a Graph Foundation Model that addresses task unification and training efficiency by adopting a meta-learning based training framework. Prior models pre-train with reconstruction-based objectives such as link prediction, and assume that the resulting representations can be aligned with downstream tasks through a separate unification step such as class prototypes.", "key_contribution": "We propose Mochi, a Graph Foundation Model that addresses task unification and training efficiency by adopting a meta-learning based training framework.", "why_it_matters": "Mochi: Aligning Pre-training and Inference for Efficient Graph Foundation Models via Meta-Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We propose Mochi, a Graph Foundation Model that addresses task unification and training efficiency by adopting a…", "biggest_caveat": "limitations that directly affect downstream task performance.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2604.22031", "difficulty": "beginner" }, { "id": "arxiv:2605.04225", "source": "arxiv", "source_type": "preprint", "title": "ARMATA: Auto-Regressive Multi-Agent Task Assignment", "abstract": "Coordinating multi-agent systems over spatially distributed areas requires solving a complex hierarchical problem: first distributing areas among agents (allocation) and subsequently determining the optimal visitation order (routing). Existing methods typically decouple these stages ignoring inter-stage dependencies or rely on decentralized heuristics that lack global context. In this work, we propose a centralized, fully end-to-end auto-regressive framework that jointly generates allocation decisions and routing sequences. The core contribution of our approach is a multi-stage decoding mechanism that unifies high-level allocation and low-level routing in a single autoregressive pass while maintaining a centralized global state. This enables the model to implicitly balance workload distribution with routing efficiency, avoiding local optima common in decentralized methods. Extensive experiments demonstrate that our method significantly outperforms diverse baselines, achieving up to a 20\\% improvement in solution quality over industrial solvers such as Google OR-Tools, IBM CPLEX, and LKH-3, while reducing computation time from hours to seconds.", "authors": [ "Yazan Youssef", "Aboelmagd Noureldin", "Sidney Givigi" ], "year": 2026, "published_date": "2026-05-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.04225", "pdf_url": "https://arxiv.org/pdf/2605.04225", "citations": 0, "topics": [], "tags": [ "Robotics", "Multi-Agent Systems", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 5.45, "content_potential_score": 0.0, "interestingness_score": 1.57, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Coordinating multi-agent systems over spatially distributed areas requires solving a complex hierarchical problem: first distributing areas among agents (allocation) and subsequently determining the optimal visitation order (routing). Existing methods typically decouple these stages ignoring inter-stage dependencies or rely on decentralized heuristics that lack global context.", "key_contribution": "In this work, we propose a centralized, fully end-to-end auto-regressive framework that jointly generates allocation decisions and routing sequences.", "why_it_matters": "ARMATA: Auto-Regressive Multi-Agent Task Assignment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "In this work, we propose a centralized, fully end-to-end auto-regressive framework that jointly generates allocation…", "biggest_caveat": "buting areas among agents (allocation) and subsequently determining the optimal visitation order (routing).", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2605.04225", "difficulty": "intermediate" }, { "id": "arxiv:2604.05943v1", "source": "arxiv", "source_type": "preprint", "title": "MARL-GPT: Foundation Model for Multi-Agent Reinforcement Learning", "abstract": "Recent advances in multi-agent reinforcement learning (MARL) have demonstrated success in numerous challenging domains and environments, but typically require specialized models for each task. In this work, we propose a coherent methodology that makes it possible for a single GPT-based model to learn and perform well across diverse MARL environments and tasks, including StarCraft Multi-Agent Challenge, Google Research Football and POGEMA. Our method, MARL-GPT, applies offline reinforcement learning to train at scale on the expert trajectories (400M for SMACv2, 100M for GRF, and 1B for POGEMA) combined with a single transformer-based observation encoder that requires no task-specific tuning. Experiments show that MARL-GPT achieves competitive performance compared to specialized baselines in all tested environments. Thus, our findings suggest that it is, indeed, possible to build a multi-task transformer-based model for a wide variety of (significantly different) multi-agent problems paving the way to the fundamental MARL model (akin to ChatGPT, Llama, Mistral etc. in natural language modeling).", "authors": [ "Maria Nesterova", "Mikhail Kolosov", "Anton Andreychuk", "Egor Cherepanov", "Oleg Bulichev", "Alexey Kovalev", "Konstantin Yakovlev", "Aleksandr Panov", "Alexey Skrynnik" ], "year": 2026, "published_date": "2026-04-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.05943v1", "pdf_url": "https://arxiv.org/pdf/2604.05943v1", "citations": 0, "topics": [], "tags": [ "LLMs", "RL", "Transformer Architectures", "Artificial Intelligence", "Reinforcement Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 7.13, "content_potential_score": 0.87, "interestingness_score": 2.01, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent advances in multi-agent reinforcement learning (MARL) have demonstrated success in numerous challenging domains and environments, but typically require specialized models for each task. In this work, we propose a coherent methodology that makes it possible for a single GPT-based model to learn and perform well across diverse MARL environments and tasks, including StarCraft Multi-Agent Challenge, Google Research Football and POGEMA.", "key_contribution": "In this work, we propose a coherent methodology that makes it possible for a single GPT-based model to learn and perform well across diverse MARL environments and tasks, including StarCraft Multi-Agent Challenge, Google Research Football and POGEMA.", "why_it_matters": "MARL-GPT: Foundation Model for Multi-Agent Reinforcement Learning extends Transformer capabilities — the architecture underpinning virtually every modern NLP and vision model.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this work, we propose a coherent methodology that makes it possible for a single GPT-based model to learn and…", "biggest_caveat": "but typically require specialized models for each task.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.05943v1", "difficulty": "advanced" }, { "id": "arxiv:2511.21654", "source": "arxiv", "source_type": "preprint", "title": "EvilGenie: A Reward Hacking Benchmark", "abstract": "We introduce EvilGenie, a benchmark for reward hacking in programming settings. We source problems from LiveCodeBench and create an environment in which agents can easily reward hack, such as by hardcoding test cases or editing the testing files. We measure reward hacking in three ways: held out unit tests, LLM judges, and test file edit detection. We verify these methods against human review and each other. We find the LLM judge to be highly effective at detecting reward hacking in unambiguous cases, and observe only minimal improvement from the use of held out test cases. In addition to testing many models using Inspect's basic\\_agent scaffold, we also measure reward hacking rates for three popular proprietary coding agents: OpenAI's Codex, Anthropic's Claude Code, and Google's Gemini CLI. We observe explicit reward hacking by both Codex and Claude Code, and misaligned behavior by all three agents. Our codebase can be found at https://github.com/JonathanGabor/evilgenie_inspect .", "authors": [ "Jonathan Gabor", "Jayson Lynch", "Jonathan Rosenfeld" ], "year": 2026, "published_date": "2026-05-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.21654", "pdf_url": "https://arxiv.org/pdf/2511.21654", "citations": 0, "topics": [], "tags": [ "Code Generation", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.15, "read_first_score": 5.38, "content_potential_score": 1.5, "interestingness_score": 2.33, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce EvilGenie, a benchmark for reward hacking in programming settings. We source problems from LiveCodeBench and create an environment in which agents can easily reward hack, such as by hardcoding test cases or editing the testing files.", "key_contribution": "We introduce EvilGenie, a benchmark for reward hacking in programming settings.", "why_it_matters": "EvilGenie: A Reward Hacking Benchmark represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Code Generation.", "one_line_takeaway": "We introduce EvilGenie, a benchmark for reward hacking in programming settings.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Code Generation.", "url": "https://arxiv.org/abs/2511.21654", "difficulty": "beginner" }, { "id": "arxiv:2606.08094", "source": "arxiv", "source_type": "preprint", "title": "vla.cpp: A Unified Inference Runtime for Vision-Language-Action Models", "abstract": "Deploying vision--language--action (VLA) models on robots requires adapting model-specific inference pipelines to heterogeneous processors and limited onboard memory. We present vla.cpp, a unified C++ inference runtime for eleven VLA models, with no PyTorch dependency for model execution. The runtime shares model loading, tensor execution, and serving while retaining architecture-specific attention, conditioning, and action heads. Iterative policies reuse observation-dependent computation across solver steps, while regression policies predict actions directly. We evaluate task success on LIBERO-Object and profile supported configurations on NVIDIA, Apple, and Intel hardware. BitVLA completes 200/200 LIBERO-Object episodes on an 8,GB Jetson Orin Nano. A ternary tensor-core kernel accelerates its client inference by $4.0$--$4.6\\times$ over the CUDA-core baseline on RTX 3060 and AGX Orin. A SmolVLA case study links positional-index precision to gripper commands and task success, showing why fixed-input numerical checks should accompany rollout evaluation. Deployments on UR10e and ALOHA demonstrate physical robot integration; delay and execution-horizon studies characterize synchronous chunked control. The results demonstrate a common deployment path across VLA architectures and hardware, with numerical validation and control settings guiding deployment alongside inference efficiency.", "authors": [ "Khanh D. Nguyen", "Hung T. Ho", "Chinh T. Nguyen", "Thanh Q. Duong", "Linh D. Le", "Duy M. H. Nguyen", "Vien A. Ngo", "An T. Le" ], "year": 2026, "published_date": "2026-09-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.08094", "pdf_url": "https://arxiv.org/pdf/2606.08094", "citations": 0, "topics": [], "tags": [ "Robotics", "Machine Learning", "Artificial Intelligence", "Systems & Control" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 4.41, "content_potential_score": 1.0, "interestingness_score": 2.07, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deploying vision--language--action (VLA) models on robots requires adapting model-specific inference pipelines to heterogeneous processors and limited onboard memory. We present vla.cpp, a unified C++ inference runtime for eleven VLA models, with no PyTorch dependency for model execution.", "key_contribution": "We present vla.cpp, a unified C++ inference runtime for eleven VLA models, with no PyTorch dependency for model execution.", "why_it_matters": "vla.cpp: A Unified Inference Runtime for Vision-Language-Action Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We present vla.cpp, a unified C++ inference runtime for eleven VLA models, with no PyTorch dependency for model…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2606.08094", "difficulty": "intermediate" }, { "id": "arxiv:2609.24662", "source": "arxiv", "source_type": "preprint", "title": "DUMA-Bench: A Dual-Control Multi-Agent Benchmark for Evaluating LLM Agent Security", "abstract": "LLM-based agents increasingly operate in environments where they interact with users, tools, and external systems. Yet most security evaluations assume passive users and static control, ignoring the interactive dynamics that shape real agent behavior. We introduce \\textbf{DUMA-Bench}, a benchmark and evaluation protocol for measuring agent security under \\emph{dual-control} interaction, where both the agent and the user can influence the shared environment state. DUMA-Bench extends $τ^2$-bench ~\\cite{barres2025tau} with adversarial environments covering eight vulnerability classes, including RAG poisoning, cross-agent manipulation, and unsafe output handling. We evaluate \\textbf{14 models from five model families} (OpenAI, Anthropic, DeepSeek, Qwen, and Z.ai) across eight domains and multiple user-behavior regimes. Across our experiments, introducing dual-control interaction increases the attack success rate from \\textbf{26.9\\%} to \\textbf{41.1\\%}. These results show that agent security is not solely a property of the model but emerges from the interaction between the model, the user, and the environment. DUMA-Bench provides a missing evaluation layer for studying security in realistic agent deployments.", "authors": [ "Ivan Aleksandrov", "German Kochnev", "Sabrina Sadiekh", "Yaroslav Rogoza" ], "year": 2026, "published_date": "2026-09-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.24662", "pdf_url": "https://arxiv.org/pdf/2609.24662", "citations": 0, "topics": [], "tags": [ "LLMs", "RAG", "Robotics", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 5.42, "content_potential_score": 1.5, "interestingness_score": 2.32, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "LLM-based agents increasingly operate in environments where they interact with users, tools, and external systems. Yet most security evaluations assume passive users and static control, ignoring the interactive dynamics that shape real agent behavior.", "key_contribution": "We introduce \\textbf{DUMA-Bench}, a benchmark and evaluation protocol for measuring agent security under \\emph{dual-control} interaction, where both the agent and the user can influence the shared environment state.", "why_it_matters": "DUMA-Bench: A Dual-Control Multi-Agent Benchmark for Evaluating LLM Agent Security represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce \\textbf{DUMA-Bench}, a benchmark and evaluation protocol for measuring agent security under…", "biggest_caveat": "but emerges from the interaction between the model, the user, and the environment.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.24662", "difficulty": "beginner" }, { "id": "arxiv:2609.14036", "source": "arxiv", "source_type": "preprint", "title": "Real-World Deployment and Performance Characterisation of Fog-Based Deep Learning for Cold-Chain Temperature Prediction over LoRaWAN", "abstract": "Fresh fruits and vegetables (FFVs) are highly perishable, and cold-chain breaks contribute significantly to global food waste. While Machine Learning (ML) can enable proactive intervention, cloud-based inference faces challenges such as latency and data loss. Fog computing addresses these issues but has been tested only in simulation for FFV cold-chain temperature prediction. To the best of the authors' knowledge, this paper presents its first real-world deployment. A fog-deployed LSTM-GRU model predicted cold-room temperature using LoRaWAN sensor data collected from a South African apple cold-storage facility with induced cold-chain breaks. Running entirely on a Raspberry Pi 4 with no cloud dependency, the system generated conditional SHAP explanations only when a break is predicted. The deployed system predicts cold-room temperature with an MAE of 0.2°C at roughly 0.2 kWh per day (0.7 Wh per prediction). Predictions were delivered in under one second (555 ms), dominated by network and messaging rather than computation, with conditional explanations adding modest cost. SHAP consumes 28% more CPU but is well within the hardware's capacity. The model attributes its predictions primarily to temperature, humidity, and their interaction. Critically, the deployment surfaced what simulation cannot: a sensor-triggered single point of failure, alongside genuine resilience, autonomous recovery from infrastructure faults and continued operation through internet loss. These are the first published deployment benchmarks for fog-based temperature prediction in FFV cold chains, establishing that explainable temperature forecasting is feasible on resource-constrained edge hardware. Future work includes asynchronous sensor fusion, commercial cold chain deployment, alternative model architectures, and causal analysis.", "authors": [ "Jeremiah Taguta", "Jean Frederic Isingizwe Nturambirwe", "Clement Nthambazale Nyirenda" ], "year": 2026, "published_date": "2026-09-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.14036", "pdf_url": "https://arxiv.org/pdf/2609.14036", "citations": 0, "topics": [], "tags": [ "Interpretability", "Evaluation", "Machine Learning", "Distributed Computing" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 5.33, "content_potential_score": 3.1, "interestingness_score": 3.12, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Fresh fruits and vegetables (FFVs) are highly perishable, and cold-chain breaks contribute significantly to global food waste. While Machine Learning (ML) can enable proactive intervention, cloud-based inference faces challenges such as latency and data loss.", "key_contribution": "Fresh fruits and vegetables (FFVs) are highly perishable, and cold-chain breaks contribute significantly to global food waste.", "why_it_matters": "Real-World Deployment and Performance Characterisation of Fog-Based Deep Learning for Cold-Chain Temperature Prediction over LoRaWAN represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Interpretability.", "one_line_takeaway": "Fresh fruits and vegetables (FFVs) are highly perishable, and cold-chain breaks contribute significantly to global food…", "biggest_caveat": "bute significantly to global food waste.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Interpretability.", "url": "https://arxiv.org/abs/2609.14036", "difficulty": "beginner" }, { "id": "arxiv:2603.11298", "source": "arxiv", "source_type": "preprint", "title": "InstantHDR: Single-forward Gaussian Splatting Initialization for HDR 3D Reconstruction", "abstract": "High dynamic range (HDR) novel view synthesis (NVS) aims to reconstruct HDR scenes from multi-exposure low dynamic range (LDR) images. Existing HDR pipelines heavily rely on known camera poses, well-initialized dense point clouds, and time-consuming per-scene optimization. Current feed-forward alternatives overlook the HDR problem by assuming exposure-invariant appearance. To bridge this gap, we propose InstantHDR, a feed-forward network that initializes 3D HDR scenes from uncalibrated multi-exposure LDR collections in a fast single forward pass. Specifically, we design a geometry-guided appearance modeling for multi-exposure fusion, and a meta-network for generalizable scene-specific tone mapping. Due to the lack of HDR scene data, we build a pre-training dataset, called HDR-Pretrain, for generalizable feed-forward HDR models, featuring 168 Blender-rendered scenes, diverse lighting types, and multiple camera response functions. Comprehensive experiments show that our InstantHDR delivers a single-forward HDR initialization at approximately 700 times the speed of SoTA optimization-based methods, and reaches comparable quality in real settings after lightweight post-optimization while remaining approximately 20 times faster. All code, models, and datasets: https://github.com/Bugjudger/InstantHDR.", "authors": [ "Dingqiang Ye", "Jiacong Xu", "Jianglu Ping", "Yuxiang Guo", "Chao Fan", "Vishal M. Patel" ], "year": 2026, "published_date": "2026-09-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.11298", "pdf_url": "https://arxiv.org/pdf/2603.11298", "citations": 0, "topics": [], "tags": [ "3D Vision", "Self-Supervised", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 4.86, "content_potential_score": 1.5, "interestingness_score": 2.32, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "High dynamic range (HDR) novel view synthesis (NVS) aims to reconstruct HDR scenes from multi-exposure low dynamic range (LDR) images. Existing HDR pipelines heavily rely on known camera poses, well-initialized dense point clouds, and time-consuming per-scene optimization.", "key_contribution": "High dynamic range (HDR) novel view synthesis (NVS) aims to reconstruct HDR scenes from multi-exposure low dynamic range (LDR) images.", "why_it_matters": "InstantHDR: Single-forward Gaussian Splatting Initialization for HDR 3D Reconstruction advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about 3D Vision.", "one_line_takeaway": "High dynamic range (HDR) novel view synthesis (NVS) aims to reconstruct HDR scenes from multi-exposure low dynamic…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in 3D Vision.", "url": "https://arxiv.org/abs/2603.11298", "difficulty": "intermediate" }, { "id": "arxiv:2605.09055", "source": "arxiv", "source_type": "preprint", "title": "Octopus Protocol: One-Shot Hardware Discovery and Control for AI Agents via Infrastructure-as-Prompts", "abstract": "Recent agentic-robotics systems, from Code-asPolicies to modern vision-language-action (VLA) foundation models, presuppose that drivers, SDKs, or ROS-style primitives for the target hardware already exist. Writing those primitives is the dominant engineering cost of bringing up new hardware for agent control. We present Octopus Protocol, a system that collapses that cost to a single shell command. Given only raw OS access and a language-model API key, a coding agent executes a five-stage pipeline--PROBE, IDENTIFY, INTERFACE, SERVE, DEPLOY--to discover connected devices, infer their capabilities, generate a Model Context Protocol (MCP) server with typed tools, and deploy it as a live HTTP endpoint. A persistent daemon then monitors the system, heals broken code, and perceives physical state through the camera tools it generated for itself. Two architectural principles make this work: protocols are prompts, not code, and the coding agent is the runtime. We validate the system on three heterogeneous platforms (PC/WSL, Apple Silicon macOS, Raspberry Pi 4) and on a commercial 6-DOF robotic arm with USB camera feedback. One command onboards the hardware in ~10-15 minutes and exposes up to 30 MCP tools; an MCP-compliant client then performs closed-loop visual-motor control through tools no human wrote.", "authors": [ "Quilee Simeon", "Justin M. Wei", "Yile Fan" ], "year": 2026, "published_date": "2026-05-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.09055", "pdf_url": "https://arxiv.org/pdf/2605.09055", "citations": 0, "topics": [], "tags": [ "AI Agents", "Robotics", "Artificial Intelligence", "Multi-Agent Systems" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 4.5, "content_potential_score": 1.0, "interestingness_score": 2.07, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent agentic-robotics systems, from Code-asPolicies to modern vision-language-action (VLA) foundation models, presuppose that drivers, SDKs, or ROS-style primitives for the target hardware already exist. Writing those primitives is the dominant engineering cost of bringing up new hardware for agent control.", "key_contribution": "We present Octopus Protocol, a system that collapses that cost to a single shell command.", "why_it_matters": "Octopus Protocol: One-Shot Hardware Discovery and Control for AI Agents via Infrastructure-as-Prompts represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We present Octopus Protocol, a system that collapses that cost to a single shell command.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2605.09055", "difficulty": "intermediate" }, { "id": "arxiv:2608.28667", "source": "arxiv", "source_type": "preprint", "title": "GreenBench: Benchmarking Energy Efficiency and Carbon Footprint of Open-Source LLM Inference on Apple Silicon", "abstract": "The rapid proliferation of Large Language Models (LLMs) has raised concerns about their environmental impact during inference. While Green AI research has focused on datacenter GPUs and embedded platforms, the energy profile of LLM inference on Apple Silicon, with its unified memory architecture, remains unstudied. This paper presents GreenBench, a benchmarking framework that evaluates the energy efficiency, throughput, and carbon footprint of five open-source LLMs (3-9B parameters) across three NLP tasks on an Apple M4 Pro with 48 GB unified memory. Using macOS powermetrics for direct power measurement and Ollama's nanosecond-precision timing, we find that the M4 Pro draws only 0.47 W of CPU+GPU package power during sustained inference, with total system power of 8-12 W, achieving 30-40x better energy efficiency per token than datacenter GPUs in single-user deployment. Smaller models (3-3.8B) deliver 2.6-4.2x higher throughput and up to 62% less energy per token than larger models (7-9B). Pareto analysis identifies Qwen 2.5 (7B) as the optimal accuracy-efficiency trade-off at 57% MMLU and 59 tokens/s, while Llama 3.2 (3B) suits latency-critical applications at 175 tokens/s. We provide per-token energy at package and system levels with CO2 estimates for India and US grids.", "authors": [ "Rajeswari Kannan", "Raj Firke", "Shreya Bengle", "Srushti Deshmukh" ], "year": 2026, "published_date": "2026-08-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.28667", "pdf_url": "https://arxiv.org/pdf/2608.28667", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Artificial Intelligence", "NLP" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 5.08, "content_potential_score": 1.0, "interestingness_score": 2.07, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The rapid proliferation of Large Language Models (LLMs) has raised concerns about their environmental impact during inference. While Green AI research has focused on datacenter GPUs and embedded platforms, the energy profile of LLM inference on Apple Silicon, with its unified memory architecture, remains unstudied.", "key_contribution": "The rapid proliferation of Large Language Models (LLMs) has raised concerns about their environmental impact during inference.", "why_it_matters": "GreenBench: Benchmarking Energy Efficiency and Carbon Footprint of Open-Source LLM Inference on Apple Silicon represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "The rapid proliferation of Large Language Models (LLMs) has raised concerns about their environmental impact during…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.28667", "difficulty": "beginner" }, { "id": "arxiv:2603.03988", "source": "arxiv", "source_type": "preprint", "title": "SORT: A Systematically Optimized Ranking Transformer for Industrial-scale Recommenders", "abstract": "While Transformers have achieved remarkable success in LLMs through superior scalability, their application in industrial-scale ranking models remains nascent, hindered by the challenges of high feature sparsity and low label density. In this paper, we propose SORT (Systematically Optimized Ranking Transformer), a scalable model designed to bridge the gap between Transformers and industrial-scale ranking models. We address the high feature sparsity and low label density challenges through a series of optimizations, including request-centric sample organization, local attention, query pruning and generative pre-training. Furthermore, we introduce a suite of refinements to the tokenization, multi-head attention (MHA), and feed-forward network (FFN) modules, which collectively stabilize the training process and enlarge the model capacity. To maximize hardware efficiency, we optimize our training system to elevate the model FLOPs utilization (MFU) to 22%. Extensive experiments demonstrate that SORT outperforms strong baselines and exhibits excellent scalability across data size, model size and sequence length, while remaining flexible at integrating diverse features. Finally, online A/B testing in large-scale e-commerce scenarios confirms that SORT achieves significant gains in key business metrics, including orders (+6.35%), buyers (+5.97%) and GMV (+5.47%), while simultaneously halving latency (-44.67%) and doubling throughput (+121.33%).", "authors": [ "Chunqi Wang", "Bingchao Wu", "Taotian Pang", "Jiahao Wang", "Jie Yang", "Jia Liu", "Hao Zhang", "Hai Zhu", "Lei Shen", "Shizhun Wang", "Bing Wang", "Xiaoyi Zeng" ], "year": 2026, "published_date": "2026-08-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.03988", "pdf_url": "https://arxiv.org/pdf/2603.03988", "citations": 0, "topics": [], "tags": [ "Transformers", "Model Compression", "Self-Supervised", "Information Retrieval" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 6.53, "content_potential_score": 1.0, "interestingness_score": 2.07, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "While Transformers have achieved remarkable success in LLMs through superior scalability, their application in industrial-scale ranking models remains nascent, hindered by the challenges of high feature sparsity and low label density. In this paper, we propose SORT (Systematically Optimized Ranking Transformer), a scalable model designed to bridge the gap between Transformers and industrial-scale ranking models.", "key_contribution": "In this paper, we propose SORT (Systematically Optimized Ranking Transformer), a scalable model designed to bridge the gap between Transformers and industrial-scale ranking models.", "why_it_matters": "SORT: A Systematically Optimized Ranking Transformer for Industrial-scale Recommenders improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "In this paper, we propose SORT (Systematically Optimized Ranking Transformer), a scalable model designed to bridge the…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2603.03988", "difficulty": "intermediate" }, { "id": "arxiv:2608.02606", "source": "arxiv", "source_type": "preprint", "title": "Self-Organising Digital Circuits", "abstract": "Fault tolerance in classical computing has traditionally relied on static strategies like hardware redundancy and error-correcting codes. Biological systems, in contrast, exhibit adaptive plasticity, maintaining function through dynamic re-organisation around damage. Inspired by this principle, we introduce Self-Organising Digital Circuits, framing functional logic generation and maintenance as a meta-learning problem on graphs. Our architecture employs a topology-masked Transformer that configures the Lookup Tables (LUT) of a circuit's Boolean gates. Extending the pattern-generation paradigm of Neural Cellular Automata (NCA), it navigates the degenerate Boolean search space to satisfy a computational task, rather than regenerating a fixed target state. We demonstrate that it can self-assemble functional circuits from scratch and rapidly re-route logic around permanent, previously unseen hardware faults. For soft errors, the policy achieves near-perfect recovery (>99.99\\% accuracy) from damage sizes far exceeding training conditions. We further observe generalisation across circuit scales: accuracy improves on graphs substantially wider than those seen during training. This work bridges the principles of biological self-organisation with the practical domain of digital hardware.", "authors": [ "Marcello Barylli", "Gabriel Béna", "Alexander Mordvintsev", "Eleni Nisioti", "Sebastian Risi" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.02606", "pdf_url": "https://arxiv.org/pdf/2608.02606", "citations": 0, "topics": [], "tags": [ "Transformers", "Artificial Intelligence", "Neural Networks" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 6.14, "content_potential_score": 0.55, "interestingness_score": 1.85, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Fault tolerance in classical computing has traditionally relied on static strategies like hardware redundancy and error-correcting codes. Biological systems, in contrast, exhibit adaptive plasticity, maintaining function through dynamic re-organisation around damage.", "key_contribution": "Inspired by this principle, we introduce Self-Organising Digital Circuits, framing functional logic generation and maintenance as a meta-learning problem on graphs.", "why_it_matters": "Self-Organising Digital Circuits represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "Inspired by this principle, we introduce Self-Organising Digital Circuits, framing functional logic generation and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2608.02606", "difficulty": "beginner" }, { "id": "arxiv:2607.06868", "source": "arxiv", "source_type": "preprint", "title": "Seekable OCI: Lazy-Loading Container Images via Range-Request Indexing", "abstract": "Container image pulling accounts for the majority of pod startup time in Kubernetes environments. Standard pull downloads the entire image before the container can start, even when the application accesses only a fraction of the image content at startup. We present SOCI (Seekable OCI), a lazy-loading architecture that enables containers to start without downloading the full image. SOCI builds an external index over standard OCI images, mapping files to byte ranges within compressed layers. At runtime, a FUSE filesystem intercepts file accesses and serves them via HTTP range requests. Unlike prior approaches that require image format conversion, SOCI works with unmodified images and standard registries. The index is stored as an OCI referrer artifact, requiring no changes to images, registries, or deployment tooling. On a 1.3 GB Python web service image, SOCI reduces cold-start pull time from 20 seconds to approximately 2.8 seconds (7.4x speedup), with pull time independent of image size. Larger images see larger speedups (9.3x on a 2.5 GB image) because SOCI pull time is constant while standard pull scales linearly. We measure a crossover at 80% access density: below this, lazy loading wins; above, parallel full pull is faster. SOCI lazy loading is deployed in production on Amazon EKS and Amazon ECS Fargate (which launched 18.4 million tasks per day during Prime Day 2025), and has been serving lazy-load requests since 2023. EKS Auto Mode uses SOCI's parallel pull mode for GPU instances.", "authors": [ "James Thompson", "Wayne Mesard", "Jesse Butler", "Sri Saran Balaji Rajakumar", "Henry Wang" ], "year": 2026, "published_date": "2026-07-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.06868", "pdf_url": "https://arxiv.org/pdf/2607.06868", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Distributed Computing" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 4.71, "content_potential_score": 1.84, "interestingness_score": 2.49, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Container image pulling accounts for the majority of pod startup time in Kubernetes environments. Standard pull downloads the entire image before the container can start, even when the application accesses only a fraction of the image content at startup.", "key_contribution": "We present SOCI (Seekable OCI), a lazy-loading architecture that enables containers to start without downloading the full image.", "why_it_matters": "Seekable OCI: Lazy-Loading Container Images via Range-Request Indexing represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We present SOCI (Seekable OCI), a lazy-loading architecture that enables containers to start without downloading the…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2607.06868", "difficulty": "intermediate" }, { "id": "arxiv:2607.00501", "source": "arxiv", "source_type": "preprint", "title": "BaseRT: Best-in-Class LLM Inference on Apple Silicon via Native Metal", "abstract": "We present BaseRT, a native Metal inference runtime for large language models (LLMs) on Apple Silicon, and report the highest inference throughput on this hardware to date. Existing runtimes, including llama.cpp and MLX-based frameworks, incur overhead from abstractions not designed for Metal's execution model or Apple Silicon's unified memory topology. By building natively on Metal with chip-specific kernel fusion, unified memory-aware optimisation, and custom dispatch logic, BaseRT recovers performance that framework-based approaches leave on the table. BaseRT supports a wide range of model families across eight quantisation formats (Q2 to FP16) on all Apple M-series devices. In this paper, we evaluate the Qwen3, Llama 3.2, and Gemma 4 families at Q4 and Q8 quantisation on M3 and M4 Pro devices. BaseRT achieves up to 1.56x higher decode throughput than llama.cpp and up to 1.35x higher than MLX, with substantially larger margins on prefill for mixture-of-experts models, delivering consistent best-in-class throughput from sub-1B to 30B parameter models. These results establish Apple Silicon as a more capable inference platform than previously reported, with direct implications for the emerging edge inference paradigm: as privacy requirements, latency constraints, and cloud cost pressures drive inference toward on-device deployment, performance-optimised local runtimes are a critical enabling layer for this transition. BaseRT is publicly available at https://github.com/basecompute/baseRT", "authors": [ "Prabod Rathnayaka", "Fabian Waschkowski", "Lukas Wesemann" ], "year": 2026, "published_date": "2026-07-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.00501", "pdf_url": "https://arxiv.org/pdf/2607.00501", "citations": 0, "topics": [], "tags": [ "LLMs", "Artificial Intelligence", "NLP" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 4.15, "content_potential_score": 3.52, "interestingness_score": 3.33, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present BaseRT, a native Metal inference runtime for large language models (LLMs) on Apple Silicon, and report the highest inference throughput on this hardware to date. Existing runtimes, including llama.cpp and MLX-based frameworks, incur overhead from abstractions not designed for Metal's execution model or Apple Silicon's unified memory topology.", "key_contribution": "We present BaseRT, a native Metal inference runtime for large language models (LLMs) on Apple Silicon, and report the highest inference throughput on this hardware to date.", "why_it_matters": "BaseRT: Best-in-Class LLM Inference on Apple Silicon via Native Metal represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present BaseRT, a native Metal inference runtime for large language models (LLMs) on Apple Silicon, and report the…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.00501", "difficulty": "frontier" }, { "id": "arxiv:2606.26203", "source": "arxiv", "source_type": "preprint", "title": "Agentic Analysis for Agentic Infrastructure: An LLM-Powered Pipeline for Comparative Governance of DAO and Corporate AI Protocols", "abstract": "As AI agent protocols proliferate, the governance structures shaping their interoperability standards remain empirically underexamined. We introduce an LLM-powered comparative pipeline for large-scale governance discourse analysis, integrating automated annotation, neural topic modeling, and multi-layer network analysis to study socio-technical power structures at scale. We validate it on two contrasting standards for agent interoperability: ERC-8004 (permissionless, on-chain) and Google A2A (corporate-led). Analyzing 4,323 governance participation records, we combine LLM-assisted coding, topic modeling, and multi-layer network analysis to examine how institutional design shapes thematic priorities and community structure. We find that while governance form influences substantive focus, both regimes exhibit comparable levels of participation inequality and community fragmentation. Discourse alignment is denser in the permissionless setting, suggesting that open governance may foster greater thematic convergence despite decentralized participation. These findings illustrate how LLM-assisted methods can advance the empirical study of technology governance, with implications for designing more equitable agentic AI standards. All data and code are openly available.", "authors": [ "Yutian Wang", "Luyao Zhang" ], "year": 2026, "published_date": "2026-06-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.26203", "pdf_url": "https://arxiv.org/pdf/2606.26203", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "AI Agents", "Artificial Intelligence", "Multi-Agent Systems" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 4.21, "content_potential_score": 1.5, "interestingness_score": 2.32, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "As AI agent protocols proliferate, the governance structures shaping their interoperability standards remain empirically underexamined. We introduce an LLM-powered comparative pipeline for large-scale governance discourse analysis, integrating automated annotation, neural topic modeling, and multi-layer network analysis to study socio-technical power structures at scale.", "key_contribution": "We introduce an LLM-powered comparative pipeline for large-scale governance discourse analysis, integrating automated annotation, neural topic modeling, and multi-layer network analysis to study socio-technical power structures at scale.", "why_it_matters": "Agentic Analysis for Agentic Infrastructure: An LLM-Powered Pipeline for Comparative Governance of DAO and Corporate AI Protocols represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce an LLM-powered comparative pipeline for large-scale governance discourse analysis, integrating automated…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.26203", "difficulty": "advanced" }, { "id": "arxiv:2606.26857", "source": "arxiv", "source_type": "preprint", "title": "LCAi: Life Cycle Assessment with big data fusion and retrieval-augmented generation-assisted interpretation", "abstract": "The interpretation phase of life cycle assessment often lacks structured mechanisms for translating quantified improvement opportunities addressing environmental hotspots into actionable strategic pathways under technological, social, and policy uncertainty. To overcome this limitation, this study introduces a perspective-conditioned retrieval-augmented generation framework for LCA interpretation, where a multi-perspective retrieval and controlled synthesis is incorporated in the artificial intelligence (AI)-assisted LCA. To operationalise large language models in LCA interpretation, a perspective fusion RAG architecture was developed, covering academic, industry, public discourse, and European union (EU) funding datasets. Our approach comprises three steps: (1) a scenario anchor defining system boundaries and decarbonization targets, (2) a set of perspective-specific micro-queries with constrained retrieval, and (3) a neutral synthesis step integrating only ledger-stored outputs without further retrieval. The framework is demonstrated through a hydrogen-enabled diesel reduction use case in an Italian apple production facility using GPT-5 nano as the reasoning model. Overall, the structured retrieval and constrained synthesis are designed to mitigate the risk of hallucination while preserving cross-domain diversity. The approach presented can support more disciplined translation of impact results into strategic pathways and opens up new avenues for the use of advanced AI tools in LCA studies, particularly those focused on technologies that could be deployed at scale. This proof-of-concept demonstrates how AI-assisted, evidence-grounded interpretation can support implementation-oriented decision-making beyond conventional LCA studies.", "authors": [ "Georgios Tsironis", "Juan D. Medrano-Garcia", "Gonzalo Guillen-Gosalbez" ], "year": 2026, "published_date": "2026-06-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.26857", "pdf_url": "https://arxiv.org/pdf/2606.26857", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Hallucination", "RAG", "Artificial Intelligence" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 5.03, "content_potential_score": 0.34, "interestingness_score": 1.74, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The interpretation phase of life cycle assessment often lacks structured mechanisms for translating quantified improvement opportunities addressing environmental hotspots into actionable strategic pathways under technological, social, and policy uncertainty. To overcome this limitation, this study introduces a perspective-conditioned retrieval-augmented generation framework for LCA interpretation, where a multi-perspective retrieval and controlled synthesis is incorporated in the artificial intelligence (AI)-assisted LCA.", "key_contribution": "The interpretation phase of life cycle assessment often lacks structured mechanisms for translating quantified improvement opportunities addressing environmental hotspots into actionable strategic pathways under technological, social, and policy uncertainty.", "why_it_matters": "LCAi: Life Cycle Assessment with big data fusion and retrieval-augmented generation-assisted interpretation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "The interpretation phase of life cycle assessment often lacks structured mechanisms for translating quantified…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.26857", "difficulty": "frontier" }, { "id": "arxiv:2606.17111", "source": "arxiv", "source_type": "preprint", "title": "Fractional Verkle Trees: A Hypertree Decomposition and Verified Proof Serialization Architecture for High-Performance Blockchain State Accumulators", "abstract": "Modern blockchain state management faces a critical scalability bottleneck: maintaining cryptographic commitments over hundreds of millions of entries becomes computationally prohibitive. Ethereum's transition to Verkle Trees: polynomial commitment accumulators reducing proof sizes from O(width * depth) to O(depth) via constant-size IPA vector commitments, is a critical step toward stateless operation. Yet, current implementations exhibit pathological characteristics that burden home validators. We identify four inefficiencies in the reference go-verkle implementation \\cite{kaur2025goverkle, kaur2025goethereum}: (1) phantom node creation during non-existent account deletion; (2) 64-byte database keys triggering excessive LSM-tree compaction; (3) redundant memory copying in proof deserialization; (4) a Proof of Absence wire format incompatibility causing non-deterministic serialization. We present Fractional Verkle Trees (FVT), a hypertree decomposition partitioning global state into N independent sub-accumulators coordinated by a Merkle commitment tree, achieving improved cache locality, zero-lock-contention goroutine-parallel commitment computation, and faster root recomputation (91 $μ$s vs $\\sim$500 ms). We address each inefficiency via existence checks, 32-byte SHA256 node references, zero-copy reference-counted buffers, and HashMap-based lexicographic deduplication. Benchmarks on Apple M1 Pro show 57\\% heap allocation reduction (566,760 to 242,004 bytes per 10K proofs), parallel insertion at 2,433 ns/op, and network-wide elimination of 4.85 PB/year across 6,000 full nodes, advancing the Ethereum stateless roadmap.", "authors": [ "Ekleen Kaur", "Everton Fraga" ], "year": 2026, "published_date": "2026-06-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.17111", "pdf_url": "https://arxiv.org/pdf/2606.17111", "citations": 0, "topics": [], "tags": [ "Evaluation", "Distributed Computing", "Cryptography & Security" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 4.42, "content_potential_score": 0.0, "interestingness_score": 1.57, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Modern blockchain state management faces a critical scalability bottleneck: maintaining cryptographic commitments over hundreds of millions of entries becomes computationally prohibitive. Ethereum's transition to Verkle Trees: polynomial commitment accumulators reducing proof sizes from O(width * depth) to O(depth) via constant-size IPA vector commitments, is a critical step toward stateless operation.", "key_contribution": "We present Fractional Verkle Trees (FVT), a hypertree decomposition partitioning global state into N independent sub-accumulators coordinated by a Merkle commitment tree, achieving improved cache locality, zero-lock-contention goroutine-parallel commitment computation, and faster root recomputation (91 $μ$s vs $\\sim$500 ms).", "why_it_matters": "Fractional Verkle Trees: A Hypertree Decomposition and Verified Proof Serialization Architecture for High-Performance Blockchain State Accumulators represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "We present Fractional Verkle Trees (FVT), a hypertree decomposition partitioning global state into N independent…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2606.17111", "difficulty": "frontier" }, { "id": "arxiv:2606.10173v1", "source": "arxiv", "source_type": "preprint", "title": "Local Is Not a Sufficient Privacy Boundary: Governing OS-Integrated On-Device AI", "abstract": "As AI systems move into operating systems, privacy no longer turns only on whether a model runs locally. A local assistant may assemble email, calendar entries, files, screenshots, notifications, and app intents; retain embeddings or summaries; invoke tools; emit telemetry; or route difficult requests to cloud infrastructure. Local inference reduces some exposure, but it answers only one question: where computation occurs. It does not answer who may assemble context, what derived state persists, which actions are authorized, or how updates change the system's authority. We develop an OS-centered privacy framework for on-device AI that treats privacy as an institutional accountability problem rather than a deployment attribute. The framework specifies a threat model, a six-part privacy risk taxonomy, privacy-by-architecture controls, and a four-level audit rubric. We demonstrate the rubric through a documentation-bounded comparison of Apple Intelligence/Foundation Models, Android AICore/Gemini Nano, and Microsoft Recall. Meaningful privacy in on-device AI depends on constrained information flow, bounded authority, visible user control, and auditable governance across the operating-system lifecycle.", "authors": [ "Jonghyun Chung", "Sanket Badhe" ], "year": 2026, "published_date": "2026-06-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.10173v1", "pdf_url": "https://arxiv.org/pdf/2606.10173v1", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 4.35, "content_potential_score": 3.52, "interestingness_score": 3.33, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "As AI systems move into operating systems, privacy no longer turns only on whether a model runs locally. A local assistant may assemble email, calendar entries, files, screenshots, notifications, and app intents; retain embeddings or summaries; invoke tools; emit telemetry; or route difficult requests to cloud infrastructure.", "key_contribution": "We demonstrate the rubric through a documentation-bounded comparison of Apple Intelligence/Foundation Models, Android AICore/Gemini Nano, and Microsoft Recall.", "why_it_matters": "Local Is Not a Sufficient Privacy Boundary: Governing OS-Integrated On-Device AI represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We demonstrate the rubric through a documentation-bounded comparison of Apple Intelligence/Foundation Models, Android…", "biggest_caveat": "but it answers only one question: where computation occurs.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Artificial Intelligence.", "url": "http://arxiv.org/abs/2606.10173v1", "difficulty": "intermediate" }, { "id": "arxiv:2606.00338", "source": "arxiv", "source_type": "preprint", "title": "CHAM-net: A Contrastive Hierarchical Adaptive Meta-network for Robust Global Methane Flux Prediction", "abstract": "Methane is a potent greenhouse gas that significantly contributes to global warming. However, accurately estimating global methane emissions and consumption remains challenging due to the complex interactions among environmental drivers that may vary across spatial and temporal scales. Prior data-driven methods often overlook the inherent spatiotemporal heterogeneity of ecosystems, failing to explicitly capture site-specific characteristics and cross-year evolutionary dynamics. To address these issues, we propose the Contrastive Hierarchical Adaptive Meta-network (CHAM-net), a novel framework that explicitly learns from historical context to capture site-specific dynamics. CHAM-net employs a hierarchical encoder-decoder architecture, in which the encoder captures site-specific characteristics from historical data and then dynamically conditions the decoder to generate the final prediction. Experimental results demonstrate that CHAM-net consistently outperforms all baseline methods on both simulation and observational datasets for methane emission and consumption, achieving nRMSE values as low as 0.43 and 0.88 with corresponding R2 scores up to 0.97 and 0.68 for emission prediction.", "authors": [ "Rongchao Dong", "Yiming Sun", "Shuo Chen", "Youmi Oh", "Licheng Liu", "Yiqun Xie", "Xiaowei Jia" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.00338", "pdf_url": "https://arxiv.org/pdf/2606.00338", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses contrastive — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 3.69, "content_potential_score": 0.0, "interestingness_score": 1.57, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Methane is a potent greenhouse gas that significantly contributes to global warming. However, accurately estimating global methane emissions and consumption remains challenging due to the complex interactions among environmental drivers that may vary across spatial and temporal scales.", "key_contribution": "To address these issues, we propose the Contrastive Hierarchical Adaptive Meta-network (CHAM-net), a novel framework that explicitly learns from historical context to capture site-specific dynamics.", "why_it_matters": "CHAM-net: A Contrastive Hierarchical Adaptive Meta-network for Robust Global Methane Flux Prediction represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "To address these issues, we propose the Contrastive Hierarchical Adaptive Meta-network (CHAM-net), a novel framework…", "biggest_caveat": "butes to global warming.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Machine Learning.", "url": "https://arxiv.org/abs/2606.00338", "difficulty": "advanced" }, { "id": "arxiv:2606.00780", "source": "arxiv", "source_type": "preprint", "title": "Behavior-Invariant Task Representation Learning with Transformer-based World Models for Offline Meta-Reinforcement Learning", "abstract": "Offline meta-reinforcement learning leverages static datasets to enable agents to generalize to unseen environments by combining offline efficiency with meta-learning adaptability, yet it faces key challenges from context and policy distribution shifts. These issues hinder agents from adapting to online environments, and are further exacerbated under sparse-reward settings. As a result, agents often become trapped in an inherent pattern dilemma, failing to achieve robust generalization. In this work, we propose a novel framework that integrates information-theoretic task representation learning with a Transformer-based stochastic world model. Our approach extracts task-defining latent variables that are invariant to behavior policy, thereby effectively mitigating the context distribution shift. To further handle policy shift and model exploitation, we apply a conservative value penalty to imagination-based rollouts, preventing the policy from exploiting model inaccuracies while maintaining robust adaptation. Extensive evaluations demonstrate that our method outperforms state-of-the-art approaches, with superior stability and generalization under out-of-distribution and sparse-reward settings.", "authors": [ "Fuyuan Qian", "Menglong Zhang", "Song Wang", "Quanying Liu" ], "year": 2026, "published_date": "2026-05-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.00780", "pdf_url": "https://arxiv.org/pdf/2606.00780", "citations": 0, "topics": [], "tags": [ "Transformers", "Self-Supervised", "RL", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses information-theoretic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 5.36, "content_potential_score": 0.55, "interestingness_score": 1.85, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Offline meta-reinforcement learning leverages static datasets to enable agents to generalize to unseen environments by combining offline efficiency with meta-learning adaptability, yet it faces key challenges from context and policy distribution shifts. These issues hinder agents from adapting to online environments, and are further exacerbated under sparse-reward settings.", "key_contribution": "As a result, agents often become trapped in an inherent pattern dilemma, failing to achieve robust generalization.", "why_it_matters": "Behavior-Invariant Task Representation Learning with Transformer-based World Models for Offline Meta-Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "As a result, agents often become trapped in an inherent pattern dilemma, failing to achieve robust generalization.", "biggest_caveat": "bution shifts.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2606.00780", "difficulty": "frontier" }, { "id": "arxiv:2605.20477", "source": "arxiv", "source_type": "preprint", "title": "Training Language Agents to Learn from Experience", "abstract": "Language agents can adapt from experience in interactive environments, but current reflection-based methods can only self-correct within a single task instance. Whether such experience can be distilled into reusable lessons that improve performance on future unseen tasks remains unclear. We address this problem by introducing the In-context Training (ICT) task, a framework for evaluating cross-task self-improvement in language agents. In ICT, a reflector model observes trajectories collected by an actor model and generates system prompts intended to improve the actor's performance on future unseen tasks. We then propose an RL-based training pipeline for learning such reflections directly from experience, without human-provided examples. Across ALFWorld and MiniHack, our trained reflectors outperform an untrained baseline on most held-out task families, showing that the ability to learn from experience can itself be learned. In some cases, we observe generalisation beyond the benchmark on which the reflector was trained, to substantially different environments. Finally, we introduce MetaGym, a generic Python library for constructing meta-environments, enabling future research on self-improving language agents.", "authors": [ "Yuval Shalev", "Zifeng Ding", "Mateja Jamnik" ], "year": 2026, "published_date": "2026-05-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.20477", "pdf_url": "https://arxiv.org/pdf/2605.20477", "citations": 0, "topics": [], "tags": [ "Evaluation", "Artificial Intelligence", "Machine Learning", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 5.46, "content_potential_score": 1.5, "interestingness_score": 2.32, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Language agents can adapt from experience in interactive environments, but current reflection-based methods can only self-correct within a single task instance. Whether such experience can be distilled into reusable lessons that improve performance on future unseen tasks remains unclear.", "key_contribution": "We then propose an RL-based training pipeline for learning such reflections directly from experience, without human-provided examples.", "why_it_matters": "Training Language Agents to Learn from Experience represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "We then propose an RL-based training pipeline for learning such reflections directly from experience, without…", "biggest_caveat": "but current reflection-based methods can only self-correct within a single task instance.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2605.20477", "difficulty": "beginner" }, { "id": "arxiv:2501.01669", "source": "arxiv", "source_type": "preprint", "title": "Inversely Learning Transferable Rewards via Abstracted States", "abstract": "Inverse reinforcement learning (IRL) has progressed significantly toward accurately learning the underlying rewards in both discrete and continuous domains from behavior data. The next advance is to learn {\\em intrinsic} preferences in ways that produce useful behavior in settings or tasks which are different but aligned with the observed ones. In the context of robotic applications, this helps integrate robots into processing lines involving new tasks (with shared intrinsic preferences) without programming from scratch. We introduce a method to inversely learn an abstract reward function from behavior trajectories in two or more differing instances of a domain. The abstract reward function is then used to learn task behavior in another separate instance of the domain. This step offers evidence of its transferability and validates its correctness. We evaluate the method on trajectories in tasks from multiple domains in OpenAI's Gym testbed and AssistiveGym and show that the learned abstract reward functions can successfully learn task behaviors in instances of the respective domains, which have not been seen previously.", "authors": [ "Yikang Gui", "Prashant Doshi" ], "year": 2026, "published_date": "2026-05-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2501.01669", "pdf_url": "https://arxiv.org/pdf/2501.01669", "citations": 0, "topics": [], "tags": [ "RL", "Robotics", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 4.96, "content_potential_score": 0.0, "interestingness_score": 1.57, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Inverse reinforcement learning (IRL) has progressed significantly toward accurately learning the underlying rewards in both discrete and continuous domains from behavior data. The next advance is to learn {\\em intrinsic} preferences in ways that produce useful behavior in settings or tasks which are different but aligned with the observed ones.", "key_contribution": "We introduce a method to inversely learn an abstract reward function from behavior trajectories in two or more differing instances of a domain.", "why_it_matters": "Inversely Learning Transferable Rewards via Abstracted States represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "We introduce a method to inversely learn an abstract reward function from behavior trajectories in two or more…", "biggest_caveat": "but aligned with the observed ones.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2501.01669", "difficulty": "beginner" }, { "id": "arxiv:2506.23549", "source": "arxiv", "source_type": "preprint", "title": "CooT: Learning to Coordinate In-Context with Coordination Transformers", "abstract": "Effective coordination among unfamiliar partners remains a major challenge in multi-agent systems. Existing approaches, such as population-based methods, improve robustness through diversity but often lack mechanisms for efficient adaptation beyond training distribution. Moreover, fine-tuning is impractical in few-shot settings due to its high interaction cost. To address these limitations, we propose CooT, a framework that leverages in-context learning (ICL) for real-time partner adaptation. Unlike prior ICL approaches that focus on task generalization, CooT is designed to generalize across diverse partner behaviors. Trained on trajectories from behavior-preferring agents, it learns to align actions with partner intentions purely through observation. We evaluate CooT on two challenging multi-agent benchmarks: Overcooked and Google Research Football. Results show that CooT consistently outperforms population-based methods, gradient-based fine-tuning, and Meta-RL baselines, achieving stable and rapid adaptation without parameter updates. Human evaluations also identify CooT as a preferred collaborator, and our ablations confirm its ability to adapt quickly to new partners and remain stable under sudden partner changes, making it reliable for real-world human-AI collaboration.", "authors": [ "Huai-Chih Wang", "Hsiang-Chun Chuang", "Hsi-Chun Cheng", "Dai-Jie Wu", "Shao-Hua Sun" ], "year": 2026, "published_date": "2026-05-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2506.23549", "pdf_url": "https://arxiv.org/pdf/2506.23549", "citations": 0, "topics": [], "tags": [ "Prompting", "Fine-Tuning", "Info Extraction", "Transformers", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 4.96, "content_potential_score": 0.55, "interestingness_score": 1.85, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Effective coordination among unfamiliar partners remains a major challenge in multi-agent systems. Existing approaches, such as population-based methods, improve robustness through diversity but often lack mechanisms for efficient adaptation beyond training distribution.", "key_contribution": "To address these limitations, we propose CooT, a framework that leverages in-context learning (ICL) for real-time partner adaptation.", "why_it_matters": "CooT: Learning to Coordinate In-Context with Coordination Transformers represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "To address these limitations, we propose CooT, a framework that leverages in-context learning (ICL) for real-time…", "biggest_caveat": "but often lack mechanisms for efficient adaptation beyond training distribution.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2506.23549", "difficulty": "beginner" }, { "id": "arxiv:2604.09474v1", "source": "arxiv", "source_type": "preprint", "title": "SafeMind: A Risk-Aware Differentiable Control Framework for Adaptive and Safe Quadruped Locomotion", "abstract": "Learning-based quadruped controllers achieve impressive agility but typically lack formal safety guarantees under model uncertainty, perception noise, and unstructured contact conditions. We introduce SafeMind, a differentiable stochastic safety-control framework that unifies probabilistic Control Barrier Functions with semantic context understanding and meta-adaptive risk calibration. SafeMind explicitly models epistemic and aleatoric uncertainty through a variance-aware barrier constraint embedded in a differentiable quadratic program, thereby preserving gradient flow for end-to-end training. A semantics-to-constraint encoder modulates safety margins using perceptual or language cues, while a meta-adaptive learner continuously adjusts risk sensitivity across environments. We provide theoretical conditions for probabilistic forward invariance, feasibility, and stability under stochastic dynamics. SafeMind is deployed on Unitree A1 and ANYmal C at 200~Hz and validated across 12 terrain types, dynamic obstacles, morphology perturbations, and semantically defined tasks. Experiments show that SafeMind reduces safety violations by 3--10x and energy consumption by 10--15% relative to state-of-the-art CBF, MPC, and hybrid RL baselines, while maintaining real-time control performance.", "authors": [ "Zukun Zhang", "Kai Shu", "Mingqiao Mo" ], "year": 2026, "published_date": "2026-04-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.09474v1", "pdf_url": "https://arxiv.org/pdf/2604.09474v1", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Robotics", "Artificial Intelligence", "Information Extraction" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 3.21, "content_potential_score": 0.84, "interestingness_score": 1.99, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Learning-based quadruped controllers achieve impressive agility but typically lack formal safety guarantees under model uncertainty, perception noise, and unstructured contact conditions. We introduce SafeMind, a differentiable stochastic safety-control framework that unifies probabilistic Control Barrier Functions with semantic context understanding and meta-adaptive risk calibration.", "key_contribution": "Learning-based quadruped controllers achieve impressive agility but typically lack formal safety guarantees under model uncertainty, perception noise, and unstructured contact conditions.", "why_it_matters": "SafeMind: A Risk-Aware Differentiable Control Framework for Adaptive and Safe Quadruped Locomotion represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "Learning-based quadruped controllers achieve impressive agility but typically lack formal safety guarantees under model…", "biggest_caveat": "but typically lack formal safety guarantees under model uncertainty, perception noise, and unstructured contact conditions.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Info Extraction.", "url": "http://arxiv.org/abs/2604.09474v1", "difficulty": "frontier" }, { "id": "arxiv:2602.12120", "source": "arxiv", "source_type": "preprint", "title": "Forecasting Commencing Enrolments Under Data Sparsity: A Zero-Shot Time Series Foundation Models Framework for Higher Education Planning", "abstract": "Effective resource allocation in higher education depends on reliable enrolment forecasts, yet institutional planners frequently face data series disrupted by structural shifts. This paper investigates whether zero-shot Time Series Foundation Models (TSFMs) can provide rigorous decision support for annual enrolment forecasting under severe data sparsity. We benchmark multiple TSFMs against classical operational baselines using an expanding-window backtest that mirrors decision-time constraints. To capture environmental shifts without look-ahead bias, we introduce a leakage-safe covariate protocol that integrates feature-engineered Google Trends with the Institutional Operating Conditions Index (IOCI), a transferable regime measure extracted from historical narrative evidence. Our evaluation demonstrates that covariate-conditioned TSFMs are competitive with classical methods and can improve accuracy without requiring bespoke institutional training. However, the operational benefits depend on cohort characteristics and covariate design. This study provides an auditable and transferable forecasting protocol for operational researchers and university administrators, helping institutions determine when context-aware forecasting adds practical value under limited data and structural instability.", "authors": [ "Jittarin Jetwiriyanon", "Teo Susnjak", "Surangika Ranathunga" ], "year": 2026, "published_date": "2026-04-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.12120", "pdf_url": "https://arxiv.org/pdf/2602.12120", "citations": 0, "topics": [], "tags": [ "Fairness & Ethics", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 5.41, "content_potential_score": 1.5, "interestingness_score": 2.32, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Effective resource allocation in higher education depends on reliable enrolment forecasts, yet institutional planners frequently face data series disrupted by structural shifts. This paper investigates whether zero-shot Time Series Foundation Models (TSFMs) can provide rigorous decision support for annual enrolment forecasting under severe data sparsity.", "key_contribution": "To capture environmental shifts without look-ahead bias, we introduce a leakage-safe covariate protocol that integrates feature-engineered Google Trends with the Institutional Operating Conditions Index (IOCI), a transferable regime measure extracted from historical narrative evidence.", "why_it_matters": "Forecasting Commencing Enrolments Under Data Sparsity: A Zero-Shot Time Series Foundation Models Framework for Higher Education Planning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fairness & Ethics.", "one_line_takeaway": "To capture environmental shifts without look-ahead bias, we introduce a leakage-safe covariate protocol that integrates…", "biggest_caveat": "However, the operational benefits depend on cohort characteristics and covariate design.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Fairness & Ethics.", "url": "https://arxiv.org/abs/2602.12120", "difficulty": "beginner" }, { "id": "arxiv:2605.24044", "source": "arxiv", "source_type": "preprint", "title": "RED: Adaptive Real-Time DAG Scheduling for Robotic Inference under Environmental Dynamics", "abstract": "Robots deployed in dynamic environments must contend with environment-driven changes that reshape computation at runtime: new tasks may appear, precedence relations can shift, and overall workload structure evolves, all of which degrade performance, especially when multi-task inference is required under tight resource and real-time budgets. We present RED, a real-time scheduling framework for multi-task deep neural network workloads on resource-constrained robotic platforms that adapts to Robotic Environmental Dynamics (RED) while preserving end-to-end timing guarantees under modeling assumptions. The core of RED is a deadline-aware scheduler that assigns intermediate sub-deadlines, allowing it to accommodate evolving computation graphs and asynchronous inference induced by unpredictable conditions. The framework also supports flexible deployment of MIMONet (multi-input multi-output neural networks), commonly used in multi-tasking robots to alleviate memory pressure through weight sharing. RED explicitly leverages this shared-parameter property via a workload refinement and graph-reconstruction procedure that aligns MIMONet structure with schedulability requirements, improving compatibility and efficiency. We implement RED on NVIDIA Jetson family platforms and on an Apple M-series MacBook and evaluate it on navigation-oriented workloads representative of real robotic scenarios. Experiments show consistent gains over existing methods in throughput, deadline satisfaction, robustness to interference, adaptability, and runtime overhead.", "authors": [ "Zexin Li", "Tao Ren", "Johnathan Liu", "Xiaoxi He", "Cong Liu" ], "year": 2026, "published_date": "2026-05-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.24044", "pdf_url": "https://arxiv.org/pdf/2605.24044", "citations": 0, "topics": [], "tags": [ "Robotics", "Adversarial", "Software Engineering", "Systems & Control" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses multi-task — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 3.89, "content_potential_score": 1.84, "interestingness_score": 2.49, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Robots deployed in dynamic environments must contend with environment-driven changes that reshape computation at runtime: new tasks may appear, precedence relations can shift, and overall workload structure evolves, all of which degrade performance, especially when multi-task inference is required under tight resource and real-time budgets. We present RED, a real-time scheduling framework for multi-task deep neural network workloads on resource-constrained robotic platforms that adapts to Robotic Environmental Dynamics (RED) while preserving end-to-end timing guarantees under modeling assumptions.", "key_contribution": "We present RED, a real-time scheduling framework for multi-task deep neural network workloads on resource-constrained robotic platforms that adapts to Robotic Environmental Dynamics (RED) while preserving end-to-end timing guarantees under modeling assumptions.", "why_it_matters": "RED: Adaptive Real-Time DAG Scheduling for Robotic Inference under Environmental Dynamics represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We present RED, a real-time scheduling framework for multi-task deep neural network workloads on resource-constrained…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2605.24044", "difficulty": "advanced" }, { "id": "arxiv:2602.07730", "source": "arxiv", "source_type": "preprint", "title": "The Laplacian Keyboard: Beyond the Linear Span", "abstract": "Across scientific disciplines, Laplacian eigenvectors serve as a fundamental basis for simplifying complex systems, from signal processing to quantum mechanics. In reinforcement learning (RL), they similarly form a basis over the state space, enabling reward functions to be approximated by projection onto a small set of eigenvectors. This projection makes zero-shot control possible, but it also imposes a fundamental limitation: the induced policies are only as expressive as the linear span of the chosen eigenvectors. We introduce the Laplacian Keyboard (LK), a hierarchical framework that goes beyond this linear span. LK constructs a task-agnostic library of behaviors from these eigenvectors, forming a behavior basis guaranteed to contain the optimal policy for any reward within the linear span. A meta-policy learns to stitch these behaviors dynamically, enabling efficient learning of policies outside the original linear constraints. We establish theoretical bounds on zero-shot approximation error and demonstrate empirically that LK improves over the zero-shot solution while achieving better sample efficiency compared to standard RL methods.", "authors": [ "Siddarth Chandrasekar", "Marlos C. Machado" ], "year": 2026, "published_date": "2026-05-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.07730", "pdf_url": "https://arxiv.org/pdf/2602.07730", "citations": 0, "topics": [], "tags": [ "RL", "Machine Learning", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.14, "read_first_score": 3.74, "content_potential_score": 0.55, "interestingness_score": 1.85, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Across scientific disciplines, Laplacian eigenvectors serve as a fundamental basis for simplifying complex systems, from signal processing to quantum mechanics. In reinforcement learning (RL), they similarly form a basis over the state space, enabling reward functions to be approximated by projection onto a small set of eigenvectors.", "key_contribution": "We introduce the Laplacian Keyboard (LK), a hierarchical framework that goes beyond this linear span.", "why_it_matters": "The Laplacian Keyboard: Beyond the Linear Span represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "We introduce the Laplacian Keyboard (LK), a hierarchical framework that goes beyond this linear span.", "biggest_caveat": "but it also imposes a fundamental limitation: the induced policies are only as expressive as the linear span of the chosen eigenvectors.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2602.07730", "difficulty": "advanced" }, { "id": "arxiv:2609.25659", "source": "arxiv", "source_type": "preprint", "title": "When Riemann flows with Wasserstein: Generative Modeling of Probability Distributions on Manifolds", "abstract": "Many scientific datasets, such as molecular conformational ensembles or single-cell tissue measurements, are naturally modeled as meta-distributions: distributions over probability measures on non-Euclidean domains. Existing generative methods largely assume Euclidean geometry and fail to capture this structure. We introduce Riemannian Wasserstein Entropic Flow Matching (RWEFM), a generative framework on the Wasserstein space $\\mathcal{P}_2(\\mathcal{M})$ of a Riemannian manifold $(\\mathcal{M},g)$. RWEFM is trained by regressing a neural vector field onto Riemannian optimal transport velocities, using McCann displacement interpolations as conditional paths. We confirm theoretically that this construction leads to a valid flow matching approach on $\\mathcal{P}_2(\\mathcal{M})$ and introduce the Riemannian Entropic Map, a GPU-efficient approximation of the optimal transport map on manifolds. Our experiments show that by respecting the intrinsic geometry of the data, RWEFM can generate whole single-cell samples in hyperspherical latent spaces and protein conformational ensembles on the torus. As RWEFM requires only a geodesic distance and a projection operator, it is not restricted to manifolds with closed-form geometry, which we demonstrate by generating distributions on a general triangulated mesh.", "authors": [ "Doron Haviv", "Edward De Brouwer", "Rishabh Anand", "Rex Ying", "Aïcha Bentaieb", "Gabriele Scalia", "Hector Corrada Bravo" ], "year": 2026, "published_date": "2026-09-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.25659", "pdf_url": "https://arxiv.org/pdf/2609.25659", "citations": 0, "topics": [], "tags": [ "Biomedical AI", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses manifold and related concepts.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 3.95, "content_potential_score": 0.42, "interestingness_score": 1.77, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Many scientific datasets, such as molecular conformational ensembles or single-cell tissue measurements, are naturally modeled as meta-distributions: distributions over probability measures on non-Euclidean domains. Existing generative methods largely assume Euclidean geometry and fail to capture this structure.", "key_contribution": "We introduce Riemannian Wasserstein Entropic Flow Matching (RWEFM), a generative framework on the Wasserstein space $\\mathcal{P}_2(\\mathcal{M})$ of a Riemannian manifold $(\\mathcal{M},g)$.", "why_it_matters": "When Riemann flows with Wasserstein: Generative Modeling of Probability Distributions on Manifolds represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Biomedical AI.", "one_line_takeaway": "We introduce Riemannian Wasserstein Entropic Flow Matching (RWEFM), a generative framework on the Wasserstein space…", "biggest_caveat": "butions: distributions over probability measures on non-Euclidean domains.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Biomedical AI.", "url": "https://arxiv.org/abs/2609.25659", "difficulty": "frontier" }, { "id": "arxiv:2609.13393", "source": "arxiv", "source_type": "preprint", "title": "Privacy-Preserving Deep Joint Source-Channel Coding with In-Loop Concept Erasure", "abstract": "Deep joint source-channel coding (DeepJSCC) transmits learned semantic features efficiently but can leak sensitive attributes such as gender, race, or speaker identity. We propose LEAPSC (LEACE-in-the-loop privacy for semantic communication), whose core contribution is the integration of in-loop least-squares concept erasure (LEACE) within a variational information bottleneck (VIB) encoder. By periodically refitting the projection operator during training, LEAPSC couples the encoder dynamics to the erasure mechanism, driving attribute-conditional mean differences toward zero within each task-label group on the fitting sample. Additional components, namely conditional value-at-risk (CVaR) tail-sensitive privacy, feature-wise linear modulation (FiLM) signal-to-noise ratio conditioning, and Lagrangian dual ascent, improve robustness across channel conditions and over the high-leakage tail of samples. On CelebA, FairFace, and Google Speech Commands, LEAPSC reaches task accuracy of 0.862, 0.755, and 0.925 respectively, with attacker accuracy at or below the label-only floor on CelebA (0.548 vs. floor 0.580) and within 2 percentage points (pp) of chance elsewhere, improving over an information-bottleneck adversarial baseline (IBAL) at a matched 52-epoch budget by +3.6, +2.5, and +1.3 pp (Welch's t-test, p=0.019 on CelebA).", "authors": [ "Rami Eid", "Maria Slim", "Mariette Awad", "Hadi Sarieddeen" ], "year": 2026, "published_date": "2026-09-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.13393", "pdf_url": "https://arxiv.org/pdf/2609.13393", "citations": 0, "topics": [], "tags": [ "Federated Learning", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 3.8, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deep joint source-channel coding (DeepJSCC) transmits learned semantic features efficiently but can leak sensitive attributes such as gender, race, or speaker identity. We propose LEAPSC (LEACE-in-the-loop privacy for semantic communication), whose core contribution is the integration of in-loop least-squares concept erasure (LEACE) within a variational information bottleneck (VIB) encoder.", "key_contribution": "We propose LEAPSC (LEACE-in-the-loop privacy for semantic communication), whose core contribution is the integration of in-loop least-squares concept erasure (LEACE) within a variational information bottleneck (VIB) encoder.", "why_it_matters": "Privacy-Preserving Deep Joint Source-Channel Coding with In-Loop Concept Erasure represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Federated Learning.", "one_line_takeaway": "We propose LEAPSC (LEACE-in-the-loop privacy for semantic communication), whose core contribution is the integration of…", "biggest_caveat": "but can leak sensitive attributes such as gender, race, or speaker identity.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Federated Learning.", "url": "https://arxiv.org/abs/2609.13393", "difficulty": "advanced" }, { "id": "arxiv:2609.05822", "source": "arxiv", "source_type": "preprint", "title": "Generalizing HVAC Control With Domain Randomized Reinforcement Learning", "abstract": "Deploying advanced HVAC (Heating, Ventilation and Air Conditioning) controllers at scale remains difficult because performance often depends on accurate building models or per-site retuning. We propose NOMAD-RL (Neural Online Meta-Adaptation for Dynamics), a general-purpose Reinforcement Learning (RL) controller designed to transfer across heterogeneous thermal zones through a universal, non-invasive thermostat interface. The controller acts on temperature setpoints from zone measurements and forecasts, while a recurrent policy supports online adaptation under partial observability. Our main contribution is an adaptive domain randomization scheme based on physics-informed normalizing flows, which models correlated and multimodal distributions of thermal-zone parameters while maintaining physical plausibility and controllability. This produces a realistic and progressively adaptive training curriculum that improves transfer across buildings. We evaluate NOMAD-RL against a constant-setpoint PID controller, RL without domain randomization, and MPC in single- and multi-zone settings. NOMAD-RL consistently outperforms the PID and non-randomized RL baselines, and approaches the performance of a well-tuned MPC, especially in the more challenging multi-zone case. These results highlight the potential of adaptive, physics-informed domain randomization for robust and transferable HVAC control.", "authors": [ "Pablo Boitel", "Kun Zhang" ], "year": 2026, "published_date": "2026-09-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.05822", "pdf_url": "https://arxiv.org/pdf/2609.05822", "citations": 0, "topics": [], "tags": [ "Multimodal", "RL", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 3.79, "content_potential_score": 0.55, "interestingness_score": 1.84, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deploying advanced HVAC (Heating, Ventilation and Air Conditioning) controllers at scale remains difficult because performance often depends on accurate building models or per-site retuning. We propose NOMAD-RL (Neural Online Meta-Adaptation for Dynamics), a general-purpose Reinforcement Learning (RL) controller designed to transfer across heterogeneous thermal zones through a universal, non-invasive thermostat interface.", "key_contribution": "We propose NOMAD-RL (Neural Online Meta-Adaptation for Dynamics), a general-purpose Reinforcement Learning (RL) controller designed to transfer across heterogeneous thermal zones through a universal, non-invasive thermostat interface.", "why_it_matters": "Generalizing HVAC Control With Domain Randomized Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We propose NOMAD-RL (Neural Online Meta-Adaptation for Dynamics), a general-purpose Reinforcement Learning (RL)…", "biggest_caveat": "butions of thermal-zone parameters while maintaining physical plausibility and controllability.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2609.05822", "difficulty": "advanced" }, { "id": "arxiv:2603.12440", "source": "arxiv", "source_type": "preprint", "title": "KernelFoundry: Hardware-aware evolutionary GPU kernel optimization", "abstract": "GPU kernel optimization challenges LLMs beyond standard coding tasks, as it requires an understanding of hardware architecture, parallel computing optimization strategies, and profiling outputs. However, most existing approaches leveraging LLMs for kernel generation apply standard prompting and feedback loops, considering hardware only through profiling feedback. We introduce KernelFoundry, an evolutionary framework that efficiently explores the space of GPU kernels through (1) MAP-Elites quality diversity search with kernel-specific behavioral dimensions to sustain exploration; (2) meta-prompt evolution that co-evolves prompts with kernels to uncover task-specific optimization strategies, and (3) a template-based parameter optimization approach to tune kernels to inputs and hardware. We evaluate this framework on Kernel-Bench, robust-kbench and custom tasks, generating SYCL kernels as a cross-platform GPU programming paradigm, and CUDA kernels for comparison to prior work. Our approach consistently outperforms the baseline methods and achieves an average speedup of 2.3 on KernelBench for SYCL. Moreover, KernelFoundry is implemented as a distributed framework with remote access to diverse hardware, allowing quick benchmarking and featuring a flexible user input layer to support kernel generation for a wide range of real use cases beyond benchmarking.", "authors": [ "Nina Wiedemann", "Quentin Leboutet", "Michael Paulitsch", "Diana Wofk", "Benjamin Ummenhofer" ], "year": 2026, "published_date": "2026-09-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.12440", "pdf_url": "https://arxiv.org/pdf/2603.12440", "citations": 0, "topics": [], "tags": [ "Evaluation", "Machine Learning", "Distributed Computing" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 5.71, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "GPU kernel optimization challenges LLMs beyond standard coding tasks, as it requires an understanding of hardware architecture, parallel computing optimization strategies, and profiling outputs. However, most existing approaches leveraging LLMs for kernel generation apply standard prompting and feedback loops, considering hardware only through profiling feedback.", "key_contribution": "We introduce KernelFoundry, an evolutionary framework that efficiently explores the space of GPU kernels through (1) MAP-Elites quality diversity search with kernel-specific behavioral dimensions to sustain exploration; (2) meta-prompt evolution that co-evolves prompts with kernels to uncover task-specific optimization strategies, and (3) a template-based parameter optimization approach to tune kernels to inputs and hardware.", "why_it_matters": "KernelFoundry: Hardware-aware evolutionary GPU kernel optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "We introduce KernelFoundry, an evolutionary framework that efficiently explores the space of GPU kernels through (1)…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2603.12440", "difficulty": "beginner" }, { "id": "arxiv:2608.26941", "source": "arxiv", "source_type": "preprint", "title": "KinyaEmbed: Contrastive Sentence Embeddings for Kinyarwanda via Multi-Stage Curriculum Training", "abstract": "We present KinyaEmbed, the first dedicated sentence embedding model for Kinyarwanda, a morphologically rich Bantu language spoken by over 12 million people in Rwanda. Existing multilingual embedding models such as LaBSE, mE5-large, and OpenAI text-embedding-3-large perform poorly on Kinyarwanda due to severe under-representation in their pre-training corpora. KinyaEmbed is built on KinyaBERT-large and trained via a four-stage curriculum using MultipleNegativesRankingLoss (MNRL): Stage 1 leverages ~18,000 paraphrase pairs from the Official Gazette of Rwanda with three temperature scales; Stage 2 fine-tunes on 715 NLLB-translated MNLI triplets for entailment structure; Stage 3 aligns representations using English-Kinyarwanda OPUS-100 translation pairs; Stage 4 refines with 2,936 high-quality pairs filtered from KinyaCOMET at quality threshold 0.8. We evaluate on SemRel2024-rw and introduce Wiki-RW-STS, a new contamination-free Kinyarwanda STS benchmark of 300 pairs derived from Kinyarwanda Wikipedia. A seven-checkpoint ensemble (all5+23A*2, with the final stage double-weighted) achieves Spearman \\r{ho}=0.7298 on SemRel2024-rw, surpassing mE5-large by 20.9% and OpenAI text-embedding-3-large by 41.0%. KinyaEmbed also achieves the best document clustering silhouette score (0.2146) across all evaluated models. All checkpoints, the KinyaCOMET filtered pairs, and the Wiki-RW-STS benchmark are publicly available.", "authors": [ "Ireddi Rakshitha", "Devavarapu Yashwanth", "Ntakirutimana Pierre" ], "year": 2026, "published_date": "2026-08-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.26941", "pdf_url": "https://arxiv.org/pdf/2608.26941", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Self-Supervised", "Evaluation", "Embeddings", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Uses contrastive — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 4.33, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present KinyaEmbed, the first dedicated sentence embedding model for Kinyarwanda, a morphologically rich Bantu language spoken by over 12 million people in Rwanda. Existing multilingual embedding models such as LaBSE, mE5-large, and OpenAI text-embedding-3-large perform poorly on Kinyarwanda due to severe under-representation in their pre-training corpora.", "key_contribution": "We present KinyaEmbed, the first dedicated sentence embedding model for Kinyarwanda, a morphologically rich Bantu language spoken by over 12 million people in Rwanda.", "why_it_matters": "KinyaEmbed: Contrastive Sentence Embeddings for Kinyarwanda via Multi-Stage Curriculum Training represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We present KinyaEmbed, the first dedicated sentence embedding model for Kinyarwanda, a morphologically rich Bantu…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2608.26941", "difficulty": "advanced" }, { "id": "arxiv:2501.14271", "source": "arxiv", "source_type": "preprint", "title": "TLXML: Task-Level Explanation of Meta-Learning via Influence Functions", "abstract": "Meta-learning enables models to rapidly adapt to new tasks by leveraging prior experience, but its adaptation mechanisms remain opaque, especially regarding how past training tasks influence future predictions. We introduce TLXML (Task-Level eXplanation of Meta-Learning), a novel framework that extends influence functions to meta-learning settings and provides task-level explanations of adaptation and inference. By reformulating influence functions for the bi-level structure of meta-learning, we quantify the contribution of each meta-training task to the adapted model's behaviour. To ensure scalability, we propose a Gauss-Newton-based approximation that significantly reduces computational complexity from $O(pq^2)$ to $O(pq)$, where $p$ and $q$ denote the numbers of model and meta parameters, respectively. Moreover, we propose generalized influence functions defined using pseudo-inverse Hessian, which are applicable even when the loss landscape has flat directions. Results demonstrate that TLXML effectively ranks training tasks by their influence on downstream performance, offering concise, intuitive explanations aligned with user-level abstraction. This work provides a critical step toward interpretable and trustworthy meta-learning systems.", "authors": [ "Yoshihiro Mitsuka", "Shadan Golestan", "Zahin Sufiyan", "Shotaro Miwa", "Osmar R. Zaiane" ], "year": 2026, "published_date": "2026-08-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2501.14271", "pdf_url": "https://arxiv.org/pdf/2501.14271", "citations": 0, "topics": [], "tags": [ "Interpretability", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 5.38, "content_potential_score": 0.84, "interestingness_score": 1.98, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Meta-learning enables models to rapidly adapt to new tasks by leveraging prior experience, but its adaptation mechanisms remain opaque, especially regarding how past training tasks influence future predictions. We introduce TLXML (Task-Level eXplanation of Meta-Learning), a novel framework that extends influence functions to meta-learning settings and provides task-level explanations of adaptation and inference.", "key_contribution": "We introduce TLXML (Task-Level eXplanation of Meta-Learning), a novel framework that extends influence functions to meta-learning settings and provides task-level explanations of adaptation and inference.", "why_it_matters": "TLXML: Task-Level Explanation of Meta-Learning via Influence Functions represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Interpretability.", "one_line_takeaway": "We introduce TLXML (Task-Level eXplanation of Meta-Learning), a novel framework that extends influence functions to…", "biggest_caveat": "but its adaptation mechanisms remain opaque, especially regarding how past training tasks influence future predictions.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Interpretability.", "url": "https://arxiv.org/abs/2501.14271", "difficulty": "intermediate" }, { "id": "arxiv:2608.23611", "source": "arxiv", "source_type": "preprint", "title": "REFINE: A Multi-Agent LLM Approach for Evidence-Guided Code Refactoring", "abstract": "Large Language Models (LLMs) offer new opportunities for automated code refactoring. However, generated changes must reduce targeted quality problems without introducing new issues or altering behaviour-relevant code structures. We introduce REFINE (Refactoring with Evidence-aware Flow for Integrated ageNtic Execution), a tool-agnostic, evidence-aware multi-agent approach for generating Java file-level refactoring candidates. REFINE combines static-analysis-guided smell identification, smell-informed planning, LLM-based transformation, automated re-analysis, preservation checks, and structured reporting. We evaluate REFINE on 450 Java files from 15 open-source systems, producing 1,350 model-pass outputs using OpenAI GPT-5.5, Google Gemini 3.1 Pro Preview, and Anthropic Claude Opus 4.8. REFINE reduces detected code smells by 68.26%, 72.79%, and 68.49% across the three configurations, respectively, with the strongest reductions observed for major smells. A matched 150-file direct-prompt baseline shows that REFINE achieves a higher median code-smell reduction with smaller edits and fewer public-method removals. However, broader quality improvements are inconsistent, and preservation checks reveal residual risks, including assert/fail-call changes and public-method removal. Therefore, REFINE outputs should be treated as refactoring candidates requiring compilation, testing, dependency analysis, and human review before adoption in repository- or system-level settings.", "authors": [ "Muhammad Waseem", "Aakash Ahmad", "Pekka Abrahamsson" ], "year": 2026, "published_date": "2026-08-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.23611", "pdf_url": "https://arxiv.org/pdf/2608.23611", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Artificial Intelligence", "Software Engineering" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 4.93, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large Language Models (LLMs) offer new opportunities for automated code refactoring. However, generated changes must reduce targeted quality problems without introducing new issues or altering behaviour-relevant code structures.", "key_contribution": "We introduce REFINE (Refactoring with Evidence-aware Flow for Integrated ageNtic Execution), a tool-agnostic, evidence-aware multi-agent approach for generating Java file-level refactoring candidates.", "why_it_matters": "REFINE: A Multi-Agent LLM Approach for Evidence-Guided Code Refactoring represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce REFINE (Refactoring with Evidence-aware Flow for Integrated ageNtic Execution), a tool-agnostic,…", "biggest_caveat": "However, generated changes must reduce targeted quality problems without introducing new issues or altering behaviour-relevant code structures.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.23611", "difficulty": "intermediate" }, { "id": "arxiv:2608.20414", "source": "arxiv", "source_type": "preprint", "title": "StateSight: Benchmarking Latent Spatial-State Reconstruction in Vision-Language Models", "abstract": "Vision-language models are increasingly used for multimodal question answering, yet their ability to reconstruct latent spatial structure from a single image remains difficult to isolate. Broad benchmarks often combine perception, optical character recognition, domain knowledge, linguistic priors, and reasoning in the same evaluation. We introduce StateSight, a procedurally generated benchmark for cube-net opposite-face reasoning, occluded cube-tower counting, and 4-neighbor connected-component counting. Each task family contains 300 single-image prompts with deterministic oracle labels and exact-match scoring. OpenAI GPT-5.5, using the API model identifier gpt-5.5, achieved 59.3%, 33.3%, and 28.3% accuracy across the three tasks, while Claude Sonnet 5 achieved 53.3%, 18.7%, and 7.3%. All final direct runs had zero format errors. A 30-participant human baseline on 60 items exceeded both models on every task, with mean accuracies of 80.8%, 68.8%, and 64.3%. Visible-derivation analysis identified recurring errors in image-state reconstruction and reasoning procedure. We also introduce StateSight-Steps, a companion dataset of 900 interleaved image-text examples and 3,600 deterministic intermediate visual states. The results show that format-valid responses can mask failures to recover the spatial structure required for verifiable visual inference.", "authors": [ "Michelle Lin" ], "year": 2026, "published_date": "2026-08-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.20414", "pdf_url": "https://arxiv.org/pdf/2608.20414", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "VLMs", "QA", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 6.52, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Vision-language models are increasingly used for multimodal question answering, yet their ability to reconstruct latent spatial structure from a single image remains difficult to isolate. Broad benchmarks often combine perception, optical character recognition, domain knowledge, linguistic priors, and reasoning in the same evaluation.", "key_contribution": "We introduce StateSight, a procedurally generated benchmark for cube-net opposite-face reasoning, occluded cube-tower counting, and 4-neighbor connected-component counting.", "why_it_matters": "StateSight: Benchmarking Latent Spatial-State Reconstruction in Vision-Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce StateSight, a procedurally generated benchmark for cube-net opposite-face reasoning, occluded cube-tower…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.20414", "difficulty": "beginner" }, { "id": "arxiv:2608.16181", "source": "arxiv", "source_type": "preprint", "title": "MUSE: An Interactive Meta-Agent for Understanding and Steering LLM-powered Data Science Systems", "abstract": "Recent advances in large language models have enabled a new class of agentic data science systems that allow users to complete complex data science workflows through natural language. Although these systems can significantly reduce manual effort, it remains difficult to diagnose their behavior and steer the reasoning process when failures or unexpected outputs occur. We present MUSE, an interactive meta-agent that enhances user understanding and control of agentic data science systems by (1) dynamically restructuring low-level execution traces into multiple semantic levels that support navigation from high-level overviews to low-level implementation details; (2) enabling users to reference specific workflow steps in context to ask grounded questions, provide feedback, and revise problematic steps without manually locating relevant execution history; and (3) supporting mixed-initiative steering by surfacing suspicious steps for inspection, scaffolding the repair process, and translating user repair intent into contextualized instructions for the underlying agent. In a between-subjects study (n = 15), MUSE improved task efficiency and increased users' confidence in understanding and steering agentic data science workflows.", "authors": [ "Wei-Hao Chen", "Weixi Tong", "Yuan Tian", "Chenglong Wang", "Tianyi Zhang" ], "year": 2026, "published_date": "2026-08-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.16181", "pdf_url": "https://arxiv.org/pdf/2608.16181", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "Artificial Intelligence", "Human-Computer Interaction" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 4.37, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent advances in large language models have enabled a new class of agentic data science systems that allow users to complete complex data science workflows through natural language. Although these systems can significantly reduce manual effort, it remains difficult to diagnose their behavior and steer the reasoning process when failures or unexpected outputs occur.", "key_contribution": "We present MUSE, an interactive meta-agent that enhances user understanding and control of agentic data science systems by (1) dynamically restructuring low-level execution traces into multiple semantic levels that support navigation from high-level overviews to low-level implementation details; (2) enabling users to reference specific workflow steps in context to ask grounded questions, provide feedback, and revise problematic steps without manually locating relevant execution history; and (3) supporting mixed-initiative steering by surfacing suspicious steps for inspection, scaffolding the repair process, and translating user repair intent into contextualized instructions for the underlying agent.", "why_it_matters": "MUSE: An Interactive Meta-Agent for Understanding and Steering LLM-powered Data Science Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present MUSE, an interactive meta-agent that enhances user understanding and control of agentic data science systems…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.16181", "difficulty": "intermediate" }, { "id": "arxiv:2603.00040", "source": "arxiv", "source_type": "preprint", "title": "Attn-QAT: 4-Bit Attention With Quantization-Aware Training", "abstract": "Achieving reliable 4-bit attention is a prerequisite for end-to-end FP4 computation on emerging FP4-capable GPUs, yet attention remains the main obstacle due to FP4's tiny dynamic range and attention's heavy-tailed activations. This paper presents the first systematic study of 4-bit quantization-aware training (QAT) for attention. We find ``drop-in'' QAT -- naively combining an FP4 forward pass with high-precision Flash Attention (FA)-style backward pass -- leads to training instability. We identify two key principles for stable FP4 attention: (1) matching low-precision recomputation of attention scores in the backward pass and (2) resolving implicit precision assumptions in FA's gradient calculation. Based on these insights, we propose Attn-QAT and implement fused Triton kernels for training and FP4 inference kernels. Across diffusion and language models, Attn-QAT recovers the quality drop from FP4 attention without explicit outlier-mitigation heuristics used in prior FP4 attention, and delivers up to a 1.5x speedup on an RTX 5090 over SageAttention3 and up to a 1.74x speedup over FA4 on a GB300. Video demos can be found at https://drive.google.com/drive/folders/190F6xbBDUF2kGQYIcXBt3ehSYij5jlim?usp=sharing. Code can be found at https://haoailab.com/FastVideo/training/attn_qat/.", "authors": [ "Peiyuan Zhang", "Matthew Noto", "Wenxuan Tan", "Chengquan Jiang", "Will Lin", "Wei Zhou", "Hao Zhang" ], "year": 2026, "published_date": "2026-08-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.00040", "pdf_url": "https://arxiv.org/pdf/2603.00040", "citations": 0, "topics": [], "tags": [ "Model Compression", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 5.08, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Achieving reliable 4-bit attention is a prerequisite for end-to-end FP4 computation on emerging FP4-capable GPUs, yet attention remains the main obstacle due to FP4's tiny dynamic range and attention's heavy-tailed activations. This paper presents the first systematic study of 4-bit quantization-aware training (QAT) for attention.", "key_contribution": "Based on these insights, we propose Attn-QAT and implement fused Triton kernels for training and FP4 inference kernels.", "why_it_matters": "Attn-QAT: 4-Bit Attention With Quantization-Aware Training represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Model Compression.", "one_line_takeaway": "Based on these insights, we propose Attn-QAT and implement fused Triton kernels for training and FP4 inference kernels.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Model Compression.", "url": "https://arxiv.org/abs/2603.00040", "difficulty": "intermediate" }, { "id": "arxiv:2607.28681", "source": "arxiv", "source_type": "preprint", "title": "MPP-GNN: Subject-Adaptive Community Detection for fMRI-Based Alzheimer's Disease Classification", "abstract": "Functional magnetic resonance imaging (fMRI) is a widely used technique for studying the brain. Recent methods that utilize graph neural networks (GNNs) for analysis of brain functional connectivity have shown great potential for the classification of brain disorders, such as Alzheimer's disease (AD). However, these methods often assume a preset number of functional modules across all subjects, which overlooks inter-subject variability. In addition, the discovered modules are rarely used to directly guide the learned connectivity patterns. Here, to address these issues, we propose a Meta Probabilistic Pooling GNN (MPP-GNN). We frame the model's task as a coupled, bilevel optimization that performs adaptive graph partitioning hierarchically to discover subject-specific modules and then uses the discovered brain modules as an explicit prior to guide edge refinement and representation learning. We validate MPP-GNN on two public datasets for AD classification, achieving the highest AUC in comparison to established baselines for both datasets. Furthermore, our analysis demonstrates that MPP-GNN shows significant alignment with the canonical functional-network organization defined by the Yeo brain atlas and reveals a network-level dedifferentiation pattern for AD.", "authors": [ "Yang Zhang", "Xiao Zhou", "Jonathan Warrell", "Avram Holmes", "Xuan Zhang", "Mark Gerstein" ], "year": 2026, "published_date": "2026-07-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.28681", "pdf_url": "https://arxiv.org/pdf/2607.28681", "citations": 0, "topics": [], "tags": [ "AI Safety", "GNNs", "Self-Supervised", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, GNNs) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 4.31, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Functional magnetic resonance imaging (fMRI) is a widely used technique for studying the brain. Recent methods that utilize graph neural networks (GNNs) for analysis of brain functional connectivity have shown great potential for the classification of brain disorders, such as Alzheimer's disease (AD).", "key_contribution": "Here, to address these issues, we propose a Meta Probabilistic Pooling GNN (MPP-GNN).", "why_it_matters": "MPP-GNN: Subject-Adaptive Community Detection for fMRI-Based Alzheimer's Disease Classification represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "Here, to address these issues, we propose a Meta Probabilistic Pooling GNN (MPP-GNN).", "biggest_caveat": "However, these methods often assume a preset number of functional modules across all subjects, which overlooks inter-subject variability.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2607.28681", "difficulty": "advanced" }, { "id": "arxiv:2607.22695", "source": "arxiv", "source_type": "preprint", "title": "PANOPTICON: A PII-Based Assemblage of Naturalistic Output Tokens for Investigating Privacy Leakage Within LLM Context Window", "abstract": "Large Language Models (LLMs) are capable of generalizing human language for the completion of never-before-seen tasks, leading to widespread deployment. While this automation provides clear utility, completing these tasks often requires the insertion of Personally Identifiable Information (PII), strings of information that uniquely identify some individual, raising privacy concerns. However, ethics has prevented the curation of a public, authentic dataset of PII. Without an appropriate dataset, it is difficult to quantify privacy risks. Thus, we introduce the PANOPTICON pipeline and dataset. The dataset, generated by Meta's Llama-3.1-8B-Instruct model, contains 67, 718 prompts, intended for the models context window, containing PII spans derived from 9,674 publicly available synthetic user profiles. We measure lexical diversity and S-BERT diversity of the created dataset to evaluate realism. Finally, we present a case study showcasing the utility of PANOPTICON data for understanding Prompt Inversion Attacks (PIAs). PANOPTICON thus emerges as the first benchmark dataset for studying PIAs over private corpora, providing a foundation for future LLM privacy research.", "authors": [ "Ryan Thornton", "Mir Mehedi Ahsan Pritom", "Maanak Gupta" ], "year": 2026, "published_date": "2026-07-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.22695", "pdf_url": "https://arxiv.org/pdf/2607.22695", "citations": 0, "topics": [], "tags": [ "LLMs", "Long Context", "Evaluation", "Artificial Intelligence", "Cryptography & Security" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 6.61, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large Language Models (LLMs) are capable of generalizing human language for the completion of never-before-seen tasks, leading to widespread deployment. While this automation provides clear utility, completing these tasks often requires the insertion of Personally Identifiable Information (PII), strings of information that uniquely identify some individual, raising privacy concerns.", "key_contribution": "Thus, we introduce the PANOPTICON pipeline and dataset.", "why_it_matters": "PANOPTICON: A PII-Based Assemblage of Naturalistic Output Tokens for Investigating Privacy Leakage Within LLM Context Window represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Thus, we introduce the PANOPTICON pipeline and dataset.", "biggest_caveat": "However, ethics has prevented the curation of a public, authentic dataset of PII.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.22695", "difficulty": "beginner" }, { "id": "arxiv:2607.22000", "source": "arxiv", "source_type": "preprint", "title": "Music-JEPA: Learning a World Model of Sound from Action", "abstract": "Joint Embedding Predictive Architectures (JEPA) have recently emerged as a paradigm for learning world models by predicting latent representations, offering a promising direction for self-supervised learning. While initial attempts have applied JEPA to the music domain, it remains unclear how such frameworks can naturally support the formation of a world model for music. In this work, we propose to learn a world model of piano sound using JEPA by framing music as an action-conditioned system: the audio is treated as the state, and the pianoroll as the instrument action. Given a current audio state and an action, the model predicts the resulting future audio state, mirroring how humans learn musical sound through interaction. The model is trained in a fully offline setting using paired audio-pianoroll data, without environment interaction. Experiments show that the learned model captures the relationships between musical actions and their resulting sound. The resulting representations support downstream tasks, including beat tracking, composer identification, and key estimation, and enable piano transcription via planning, by searching for actions that best explain a target sound.", "authors": [ "Ziyu Wang", "Kun Fang", "Yann LeCun" ], "year": 2026, "published_date": "2026-07-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.22000", "pdf_url": "https://arxiv.org/pdf/2607.22000", "citations": 0, "topics": [], "tags": [ "Self-Supervised" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses self-supervised — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 4.48, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Joint Embedding Predictive Architectures (JEPA) have recently emerged as a paradigm for learning world models by predicting latent representations, offering a promising direction for self-supervised learning. While initial attempts have applied JEPA to the music domain, it remains unclear how such frameworks can naturally support the formation of a world model for music.", "key_contribution": "In this work, we propose to learn a world model of piano sound using JEPA by framing music as an action-conditioned system: the audio is treated as the state, and the pianoroll as the instrument action.", "why_it_matters": "Music-JEPA: Learning a World Model of Sound from Action represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "In this work, we propose to learn a world model of piano sound using JEPA by framing music as an action-conditioned…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Self-Supervised.", "url": "https://arxiv.org/abs/2607.22000", "difficulty": "advanced" }, { "id": "arxiv:2502.18447", "source": "arxiv", "source_type": "preprint", "title": "Supervised Reward Inference", "abstract": "Existing approaches to reward inference typically assume that humans provide demonstrations according to specific behavior models. However, humans often indicate their goals through a wide range of behaviors, from actions that are suboptimal due to poor planning or execution to behaviors intended to communicate goals rather than achieve them. One existing solution for inferring rewards from such behavior $\\unicode{x2013}$ provided it is drawn from the same distribution at training and deployment $\\unicode{x2013}$ is to construct a dataset of behavior paired with known rewards, and to learn the mapping from behavior to rewards; however, prior methods in this family face notable limitations, such as restrictions to tabular settings. Given such a dataset, we propose instead that supervised learning offers a parsimonious yet powerful solution, which we term Supervised Reward Inference (SRI). Theoretically, we prove that SRI is asymptotically Bayes-optimal under standard assumptions. Empirically, SRI achieves near-ceiling performance on a prior benchmark for reward inference from suboptimal behavior, while on Meta-World robotics tasks, it infers rewards from even arbitrarily suboptimal demonstrations as accurately as those demonstrations allow. Finally, we demonstrate our framework's universality with straightforward generalizations to action- and goal-prediction.", "authors": [ "Will Schwarzer", "Jordan Schneider", "Philip S. Thomas", "Scott Niekum" ], "year": 2026, "published_date": "2026-07-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2502.18447", "pdf_url": "https://arxiv.org/pdf/2502.18447", "citations": 0, "topics": [], "tags": [ "Robotics", "Structured Data", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 6.24, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Existing approaches to reward inference typically assume that humans provide demonstrations according to specific behavior models. However, humans often indicate their goals through a wide range of behaviors, from actions that are suboptimal due to poor planning or execution to behaviors intended to communicate goals rather than achieve them.", "key_contribution": "However, humans often indicate their goals through a wide range of behaviors, from actions that are suboptimal due to poor planning or execution to behaviors intended to communicate goals rather than achieve them.", "why_it_matters": "Supervised Reward Inference represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "However, humans often indicate their goals through a wide range of behaviors, from actions that are suboptimal due to…", "biggest_caveat": "however, prior methods in this family face notable limitations, such as restrictions to tabular settings.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2502.18447", "difficulty": "beginner" }, { "id": "arxiv:2604.03117v1", "source": "arxiv", "source_type": "preprint", "title": "Revealing Physical-World Semantic Vulnerabilities: Universal Adversarial Patches for Infrared Vision-Language Models", "abstract": "Infrared vision-language models (IR-VLMs) have emerged as a promising paradigm for multimodal perception in low-visibility environments, yet their robustness to adversarial attacks remains largely unexplored. Existing adversarial patch methods are mainly designed for RGB-based models in closed-set settings and are not readily applicable to the open-ended semantic understanding and physical deployment requirements of infrared VLMs. To bridge this gap, we propose Universal Curved-Grid Patch (UCGP), a universal physical adversarial patch framework for IR-VLMs. UCGP integrates Curved-Grid Mesh (CGM) parameterization for continuous, low-frequency, and deployable patch generation with a unified representation-driven objective that promotes subspace departure, topology disruption, and stealth. To improve robustness under real-world deployment and domain shift, we further incorporate Meta Differential Evolution and EOT-augmented TPS deformation modeling. Rather than manipulating labels or prompts, UCGP directly disrupts the visual representation space, weakening cross-modal semantic alignment. Extensive experiments demonstrate that UCGP consistently compromises semantic understanding across diverse IR-VLM architectures while maintaining cross-model transferability, cross-dataset generalization, real-world physical effectiveness, and robustness against defenses. These findings reveal a previously overlooked robustness vulnerability in current infrared multimodal systems.", "authors": [ "Chengyin Hu", "Yuxian Dong", "Yikun Guo", "Xiang Chen", "Junqi Wu", "Jiahuan Long", "Yiwei Wei", "Tingsong Jiang", "Wen Yao" ], "year": 2026, "published_date": "2026-04-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.03117v1", "pdf_url": "https://arxiv.org/pdf/2604.03117v1", "citations": 0, "topics": [], "tags": [ "AI Safety", "VLMs", "Adversarial", "Adversarial Robustness", "Vision-Language Models" ], "paper_type": "dataset", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 3.8, "content_potential_score": 2.34, "interestingness_score": 2.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Infrared vision-language models (IR-VLMs) have emerged as a promising paradigm for multimodal perception in low-visibility environments, yet their robustness to adversarial attacks remains largely unexplored. Existing adversarial patch methods are mainly designed for RGB-based models in closed-set settings and are not readily applicable to the open-ended semantic understanding and physical deployment requirements of infrared VLMs.", "key_contribution": "To bridge this gap, we propose Universal Curved-Grid Patch (UCGP), a universal physical adversarial patch framework for IR-VLMs.", "why_it_matters": "Revealing Physical-World Semantic Vulnerabilities: Universal Adversarial Patches for Infrared Vision-Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "To bridge this gap, we propose Universal Curved-Grid Patch (UCGP), a universal physical adversarial patch framework for…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in AI Safety.", "url": "http://arxiv.org/abs/2604.03117v1", "difficulty": "frontier" }, { "id": "arxiv:2607.16534", "source": "arxiv", "source_type": "preprint", "title": "Building2Building: A Large Scale Benchmark for Generalizable Real-World Reinforcement Learning", "abstract": "Reinforcement learning (RL) has achieved strong results in control, yet learned policies remain brittle to changes in dynamics, action spaces, observation spaces, or goals, a critical limitation for real-world deployment. Existing benchmarks offer limited diversity and complexity, making it difficult to rigorously study transfer, multi-task learning, and meta-learning in RL. We introduce Building2Building (B2B), a large-scale suite of realistic Heating, Ventilation, and Air Conditioning (HVAC) control environments built on EnergyPlus, a state-of-the-art building simulator. B2B is fully compatible with the Gymnasium interface and features a parametric building generator, enabling the systematic generation of diverse building configurations with heterogeneous observation and action spaces. Based on this suite, we define benchmark tasks targeting key open challenges in RL, including goal adaptation, dynamics adaptation, action-space shifts, and cross-domain transfer. By providing a large-scale, diverse, and physically grounded testbed with standardized evaluation protocols, B2B enables systematic investigation of generalization and transfer in continuous control. Beyond advancing research on generalization in RL, this new benchmark also carries significant societal implications by enabling improved HVAC control at scale, one of the most energy-intensive systems in buildings.", "authors": [ "Vincent Taboga", "Justin Veilleux", "Doseok Jang", "Anushree Rankawat", "Pierre-Luc Bacon" ], "year": 2026, "published_date": "2026-07-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.16534", "pdf_url": "https://arxiv.org/pdf/2607.16534", "citations": 0, "topics": [], "tags": [ "RL", "Evaluation", "Machine Learning", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 4.33, "content_potential_score": 2.89, "interestingness_score": 3.01, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reinforcement learning (RL) has achieved strong results in control, yet learned policies remain brittle to changes in dynamics, action spaces, observation spaces, or goals, a critical limitation for real-world deployment. Existing benchmarks offer limited diversity and complexity, making it difficult to rigorously study transfer, multi-task learning, and meta-learning in RL.", "key_contribution": "We introduce Building2Building (B2B), a large-scale suite of realistic Heating, Ventilation, and Air Conditioning (HVAC) control environments built on EnergyPlus, a state-of-the-art building simulator.", "why_it_matters": "Building2Building: A Large Scale Benchmark for Generalizable Real-World Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "We introduce Building2Building (B2B), a large-scale suite of realistic Heating, Ventilation, and Air Conditioning…", "biggest_caveat": "limitation for real-world deployment.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2607.16534", "difficulty": "advanced" }, { "id": "arxiv:2605.12844", "source": "arxiv", "source_type": "preprint", "title": "Walk on spheres and Array-RQMC", "abstract": "We use Array-RQMC sampling in a walk on spheres (WoS) algorithm for Dirichlet boundary value problems. On a collection of problems, we find that Array-RQMC-WoS reduces the Monte Carlo MSE or variance by factors ranging from $71$-fold to $3087$-fold at $n=2^{17}$ trajectories. The variance is known to be $o(1/n)$ but attains empirical rates between $n^{-1.4}$ and $n^{-1.8}$ in our examples. A simpler RQMC-WoS algorithm studied in Ho and Owen (2026) has more theoretical support but only reduced variance by 1.8 to 10.7-fold on the same set of examples. In order to explain this improvement, we introduce a column-wise mean dimension of the RQMC error based on Sobol' indices. It matches the usual mean dimension for Monte Carlo and the mean dimension of a dual lattice error for randomized lattices. We find for a gasket example from Crane et al. (2025) that the mean dimension of Array-RQMC-WoS errors is much higher than an analogous Array-MC-WoS algorithm has. v2 replaced v1's QMCPy lattice with Korobov lattices from LatNet Builder, but left the old abstract in the meta-data v3 corrects the v2 abstract in this meta data", "authors": [ "Valerie N. P. Ho", "Art B. Owen" ], "year": 2026, "published_date": "2026-07-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.12844", "pdf_url": "https://arxiv.org/pdf/2605.12844", "citations": 0, "topics": [], "tags": [], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 4.95, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We use Array-RQMC sampling in a walk on spheres (WoS) algorithm for Dirichlet boundary value problems. On a collection of problems, we find that Array-RQMC-WoS reduces the Monte Carlo MSE or variance by factors ranging from $71$-fold to $3087$-fold at $n=2^{17}$ trajectories.", "key_contribution": "In order to explain this improvement, we introduce a column-wise mean dimension of the RQMC error based on Sobol' indices.", "why_it_matters": "Walk on spheres and Array-RQMC represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "In order to explain this improvement, we introduce a column-wise mean dimension of the RQMC error based on Sobol'…", "biggest_caveat": "but attains empirical rates between $n^{-1.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2605.12844", "difficulty": "intermediate" }, { "id": "arxiv:2606.20693", "source": "arxiv", "source_type": "preprint", "title": "Spatio-Temporal Wildfire Spread Prediction in Canada using a Video Swin-Hybrid-U-Net and Satellite Imagery", "abstract": "Background: Wildfires in Canada present increasing threats to ecosystems, communities, and infrastructure, demanding accurate forecasting tools to aid mitigation efforts. Existing models often lack scalability or fail to capture temporal dynamics effectively. Aims: This study aims to develop a deep learning framework tailored to Canadian wildfire spread prediction that captures spatio-temporal patterns in environmental data. Methods: We propose a U-Net architecture integrating a Video Swin Transformer encoder with a convolutional decoder to model three-day sequences of meteorological and environmental variables. Data are exclusively sourced from public repositories via Google Earth Engine, ensuring transparency and scalability. The model is trained and tested on a curated dataset of major Canadian wildfire events from 2014 to 2023. Key results: Our approach achieves strong predictive performance by effectively leveraging spatio-temporal attention to forecast next-day fire incidence maps. Conclusions: The model successfully captures complex wildfire dynamics unique to Canada's landscape and temporal variability. Implications: This framework paves the way for advanced spatio-temporal wildfire forecasting research and operational applications using publicly accessible datasets.", "authors": [ "Maulik Srivastava", "Esha Saha", "Hao Wang" ], "year": 2026, "published_date": "2026-06-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.20693", "pdf_url": "https://arxiv.org/pdf/2606.20693", "citations": 0, "topics": [], "tags": [ "Transformers", "Machine Learning", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 6.64, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Background: Wildfires in Canada present increasing threats to ecosystems, communities, and infrastructure, demanding accurate forecasting tools to aid mitigation efforts. Existing models often lack scalability or fail to capture temporal dynamics effectively.", "key_contribution": "Background: Wildfires in Canada present increasing threats to ecosystems, communities, and infrastructure, demanding accurate forecasting tools to aid mitigation efforts.", "why_it_matters": "Spatio-Temporal Wildfire Spread Prediction in Canada using a Video Swin-Hybrid-U-Net and Satellite Imagery advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "Background: Wildfires in Canada present increasing threats to ecosystems, communities, and infrastructure, demanding…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2606.20693", "difficulty": "beginner" }, { "id": "arxiv:2606.22146", "source": "arxiv", "source_type": "preprint", "title": "Meta-Reinforcement Learning via Evolution for Multi-Objective Combinatorial Supply Chain Optimisation", "abstract": "Meta-reinforcement learning is a promising approach to multi-objective optimisation because it enables rapid policy adaptation across changing environments and preference settings. However, conventional few-shot methods usually fine-tune from a single shared meta-policy, which can reduce solution diversity and limit exploration of the Pareto front, especially in high-dimensional combinatorial problems such as supply chain optimisation. We propose a population-based Meta-reinforcement learning framework that combines decomposition with evolutionary search in scalarisation weight space. The framework maintains a population of weight vectors, each associated with a distinct meta-policy trained through gradient-based meta-learning, and iteratively refines this population through elitist selection, crossover, and mutation guided by hypervolume and entropy contributions. We evaluate the method in a multi-objective supply chain setting with conflicting economic, environmental, and social goals, and further test its generality on standard reinforcement learning problems. The results show that the proposed approach yields more diverse, better distributed Pareto front approximations, improves cross-task adaptation, increases hypervolume by up to 32\\% over Meta-multi-objective reinforcement learning in the complex case, and attains the lowest average Hausdorff distance among all compared methods.", "authors": [ "Rifny Rachman", "Bahrul Ilmi Nasution", "Josh Tingey", "Richard Allmendinger", "Pradyumn Shukla", "Wei Pan" ], "year": 2026, "published_date": "2026-06-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.22146", "pdf_url": "https://arxiv.org/pdf/2606.22146", "citations": 0, "topics": [], "tags": [ "Prompting", "Fine-Tuning", "RL", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 5.0, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Meta-reinforcement learning is a promising approach to multi-objective optimisation because it enables rapid policy adaptation across changing environments and preference settings. However, conventional few-shot methods usually fine-tune from a single shared meta-policy, which can reduce solution diversity and limit exploration of the Pareto front, especially in high-dimensional combinatorial problems such as supply chain optimisation.", "key_contribution": "We propose a population-based Meta-reinforcement learning framework that combines decomposition with evolutionary search in scalarisation weight space.", "why_it_matters": "Meta-Reinforcement Learning via Evolution for Multi-Objective Combinatorial Supply Chain Optimisation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We propose a population-based Meta-reinforcement learning framework that combines decomposition with evolutionary…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2606.22146", "difficulty": "beginner" }, { "id": "arxiv:2606.14164", "source": "arxiv", "source_type": "preprint", "title": "Investigating Metamorphic Fuzz Oracle Enhancement via Large Language Models", "abstract": "Fuzz drivers are essential components of greybox fuzzing, as they encapsulate target interfaces, define test spaces, and largely determine fuzzing effectiveness. Existing fuzz drivers typically rely on crash-based oracles for security testing, overlooking library functionality and limiting bug detection capability. In this paper, we present the first study on metamorphic-based fuzz oracle enhancement (MFOE), which augments existing fuzz drivers with metamorphic-based oracles derived from metamorphic relations (MRs). Since constructing and integrating such oracles requires substantial domain knowledge, automating MFOE is challenging. To address this challenge, we propose MetaFOE, an LLM-based framework that automatically generates and integrates metamorphic-based oracles. We evaluate MetaFOE on OSS-Fuzz drivers using three modern LLMs and five prompt strategies. MetaFOE generates 3,475 MRs, of which 77.3% are applicable, and implements 12,351 meta drivers, with 6,228 being valid. After three hours of fuzzing, the valid meta drivers improve edge coverage by an average of 18.7% and trigger 1,528 unique crashes. Our results demonstrate both the effectiveness of metamorphic-based oracle enhancement and the feasibility of using LLMs to automate MFOE, providing valuable insights for advancing greybox fuzzing.", "authors": [ "Ruixiang Qian", "Ding Yang", "Zengxu Chen", "Yuxuan Gao", "Chunrong Fang", "Chao Zhang", "Zhenyu Chen" ], "year": 2026, "published_date": "2026-06-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.14164", "pdf_url": "https://arxiv.org/pdf/2606.14164", "citations": 0, "topics": [], "tags": [ "LLMs", "Software Engineering", "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 5.46, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Fuzz drivers are essential components of greybox fuzzing, as they encapsulate target interfaces, define test spaces, and largely determine fuzzing effectiveness. Existing fuzz drivers typically rely on crash-based oracles for security testing, overlooking library functionality and limiting bug detection capability.", "key_contribution": "In this paper, we present the first study on metamorphic-based fuzz oracle enhancement (MFOE), which augments existing fuzz drivers with metamorphic-based oracles derived from metamorphic relations (MRs).", "why_it_matters": "Investigating Metamorphic Fuzz Oracle Enhancement via Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this paper, we present the first study on metamorphic-based fuzz oracle enhancement (MFOE), which augments existing…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.14164", "difficulty": "intermediate" }, { "id": "arxiv:2603.08000", "source": "arxiv", "source_type": "preprint", "title": "SmartThinker: Progressive Chain-of-Thought Length Calibration for Efficient Large Language Model Reasoning", "abstract": "Large reasoning models (LRMs) like OpenAI o1 and DeepSeek-R1 achieve high accuracy on complex tasks by adopting long chain-of-thought (CoT) reasoning paths. However, the inherent verbosity of these processes frequently results in redundancy and overthinking. To address this issue, existing works leverage Group Relative Policy Optimization (GRPO) to reduce LRM output length, but their static length reward design cannot dynamically adapt according to the relative problem difficulty and response length distribution, causing over-compression and compromised accuracy. Therefore, we propose SmartThinker, a novel GRPO-based efficient reasoning method with progressive CoT length calibration. SmartThinker makes a two-fold contribution: First, it dynamically estimates the optimal length with peak accuracy during training and guides overlong responses toward it to reduce response length while sustaining accuracy. Second, it dynamically modulates the length reward coefficient to avoid the unwarranted penalization of correct reasoning paths. Extensive experiment results show that SmartThinker achieves up to 52.5% average length compression with improved accuracy, and achieves up to 16.6% accuracy improvement on challenging benchmarks like AIME25. The source code can be found at https://github.com/SJTU-RTEAS/SmartThinker.", "authors": [ "Chenzhi Hu", "Qinzhe Hu", "Yuhang Xu", "Junyi Chen", "Ruijie Wang", "Shengzhong Liu", "Jianxin Li", "Fan Wu", "Guihai Chen" ], "year": 2026, "published_date": "2026-05-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.08000", "pdf_url": "https://arxiv.org/pdf/2603.08000", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "RLHF", "Evaluation", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 5.0, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large reasoning models (LRMs) like OpenAI o1 and DeepSeek-R1 achieve high accuracy on complex tasks by adopting long chain-of-thought (CoT) reasoning paths. However, the inherent verbosity of these processes frequently results in redundancy and overthinking.", "key_contribution": "Large reasoning models (LRMs) like OpenAI o1 and DeepSeek-R1 achieve high accuracy on complex tasks by adopting long chain-of-thought (CoT) reasoning paths.", "why_it_matters": "SmartThinker: Progressive Chain-of-Thought Length Calibration for Efficient Large Language Model Reasoning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Large reasoning models (LRMs) like OpenAI o1 and DeepSeek-R1 achieve high accuracy on complex tasks by adopting long…", "biggest_caveat": "However, the inherent verbosity of these processes frequently results in redundancy and overthinking.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2603.08000", "difficulty": "beginner" }, { "id": "arxiv:2605.29994", "source": "arxiv", "source_type": "preprint", "title": "Precomputed 1D-CNNs for Atrial Fibrillation Detection on Tiny Smart Sensor Systems", "abstract": "1D-CNNs play a crucial role for time-series analysis on tiny smart sensor systems, e.g. for biosignal analysis, predictive maintenance, or structural health monitoring. LUTbased precomputation has emerged as an interesting optimization technique to implement such neural networks on FPGAs. The core idea is to precompute all possible outputs of a neural network layer and store them directly in the lookup tables of the FPGAs. This enables highly resource-efficient networks with ultra-low latency but suffers from poor scalability. Previous work has explored using depthwise-separable convolutions to improve scalability. In this paper, we generalize this approach to consider additional forms of grouped convolutions. Based on this, we propose a novel type of convolutional block and an algorithm to guide the choice of hyper parameters for this block. We evaluate our approach on a medical time-series dataset for predicting atrial fibrillation using the MIT-BIH database (ECG recordings). The resulting hardware accelerators are small enough to be deployed on an AMD Spartan 7 S15. They achieve a F1-Score of up to 95% while only requiring 2,844 LUTs and no DSPs or BRAM.", "authors": [ "Lukas Einhaus", "Natalie Maman", "Julian Hoever", "Andreas Erbslöh", "Gregor Schiele" ], "year": 2026, "published_date": "2026-05-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.29994", "pdf_url": "https://arxiv.org/pdf/2605.29994", "citations": 0, "topics": [], "tags": [], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 5.96, "content_potential_score": 2.34, "interestingness_score": 2.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "1D-CNNs play a crucial role for time-series analysis on tiny smart sensor systems, e.g. for biosignal analysis, predictive maintenance, or structural health monitoring.", "key_contribution": "Based on this, we propose a novel type of convolutional block and an algorithm to guide the choice of hyper parameters for this block.", "why_it_matters": "Precomputed 1D-CNNs for Atrial Fibrillation Detection on Tiny Smart Sensor Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "Based on this, we propose a novel type of convolutional block and an algorithm to guide the choice of hyper parameters…", "biggest_caveat": "but suffers from poor scalability.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2605.29994", "difficulty": "intermediate" }, { "id": "arxiv:2605.19004", "source": "arxiv", "source_type": "preprint", "title": "EgoTraj: Real-World Egocentric Human Trajectory Dataset for Multimodal Prediction", "abstract": "Accurately forecasting human trajectories from an egocentric perspective plays a central role in applications such as humanoid robotics, wearable sensing systems, and assistive navigation. However, progress in this direction remains limited due to the scarcity of egocentric trajectory datasets collected in real-world environments. Addressing this need, we introduce EgoTraj, an egocentric multimodal open dataset recorded using Meta Quest Pro (MQPro). EgoTraj contains 75 sequences of human navigation collected from multiple MQPro wearers in real-world urban environments. Each recording provides synchronized RGB video along with ground-truth data, including continuous time-synchronized 6-degree-of-freedom head poses, per-frame 3D eye gaze vectors, scene annotations. To the best of our knowledge, EgoTraj differs from typical egocentric trajectory datasets by capturing long-horizon, self-directed navigation across diverse urban routes with broad participant diversity. To demonstrate the potential of the dataset, we benchmark several state-of-the-art methods for egocentric trajectory prediction and conduct ablation studies to analyze the contributions of gaze, scene, and motion cues. The results highlight the utility of EgoTraj for AR-based perception, navigation, and assistive systems. The EgoTraj dataset, code, and EgoViz Dashboard are publicly available at https://github.com/yehiahmad/EgoTraj.", "authors": [ "Ahmad Yehia", "Abduallah Mohamed", "Tianyi Wang", "Jiseop Byeon", "Kun Qian", "Junfeng Jiao", "Christian Claudel" ], "year": 2026, "published_date": "2026-05-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.19004", "pdf_url": "https://arxiv.org/pdf/2605.19004", "citations": 0, "topics": [], "tags": [ "Multimodal", "Robotics", "Evaluation", "Machine Learning", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 5.53, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Accurately forecasting human trajectories from an egocentric perspective plays a central role in applications such as humanoid robotics, wearable sensing systems, and assistive navigation. However, progress in this direction remains limited due to the scarcity of egocentric trajectory datasets collected in real-world environments.", "key_contribution": "Addressing this need, we introduce EgoTraj, an egocentric multimodal open dataset recorded using Meta Quest Pro (MQPro).", "why_it_matters": "EgoTraj: Real-World Egocentric Human Trajectory Dataset for Multimodal Prediction advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "Addressing this need, we introduce EgoTraj, an egocentric multimodal open dataset recorded using Meta Quest Pro (MQPro).", "biggest_caveat": "However, progress in this direction remains limited due to the scarcity of egocentric trajectory datasets collected in real-world environments.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2605.19004", "difficulty": "beginner" }, { "id": "arxiv:2501.02548", "source": "arxiv", "source_type": "preprint", "title": "Planning Under Observation Mismatch for Traffic Signal Control via Adaptive Modular World Models", "abstract": "Deploying learned decision-making systems often requires transferring to new sites where the sensing pipeline differs. In such cases, observations can change in semantics and dimensionality even when action primitives and objectives remain comparable. In this work, we study transferable model-based planning under this observation mismatch, which remains challenging for existing learning-based approaches. We propose Adaptive Modularized Model (AMM), a modular planning architecture that separates a domain-specific observation adapter from a shared internal dynamics model defined in a common planning state space. The dynamics model is meta-learned from multiple source domains to enable fast adaptation with limited target interaction. At run time, AMM performs receding-horizon planning by rolling out candidate action sequences under the learned dynamics and selecting actions that optimize a task-specific objective over predicted futures. We instantiate the approach on cross-domain traffic signal control, where actions correspond to signal phases and the planning objective captures congestion. Experiments show that AMM improves both performance and data efficiency compared with existing conventional controllers and learning-based baselines.", "authors": [ "Zherui Huang", "Yicheng Liu", "Chumeng Liang", "Guanjie Zheng" ], "year": 2026, "published_date": "2026-04-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2501.02548", "pdf_url": "https://arxiv.org/pdf/2501.02548", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 5.02, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deploying learned decision-making systems often requires transferring to new sites where the sensing pipeline differs. In such cases, observations can change in semantics and dimensionality even when action primitives and objectives remain comparable.", "key_contribution": "We propose Adaptive Modularized Model (AMM), a modular planning architecture that separates a domain-specific observation adapter from a shared internal dynamics model defined in a common planning state space.", "why_it_matters": "Planning Under Observation Mismatch for Traffic Signal Control via Adaptive Modular World Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We propose Adaptive Modularized Model (AMM), a modular planning architecture that separates a domain-specific…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2501.02548", "difficulty": "intermediate" }, { "id": "arxiv:2604.21102v1", "source": "arxiv", "source_type": "preprint", "title": "Leveraging Multimodal LLMs for Built Environment and Housing Attribute Assessment from Street-View Imagery", "abstract": "We present a novel framework for automatically evaluating building conditions nationwide in the United States by leveraging large language models (LLMs) and Google Street View (GSV) imagery. By fine-tuning Gemma 3 27B on a modest human-labeled dataset, our approach achieves strong alignment with human mean opinion scores (MOS), outperforming even individual raters on SRCC and PLCC relative to the MOS benchmark. To enhance efficiency, we apply knowledge distillation, transferring the capabilities of Gemma 3 27B to a smaller Gemma 3 4B model that achieves comparable performance with a 3x speedup. Further, we distill the knowledge into a CNN-based model (EfficientNetV2-M) and a transformer (SwinV2-B), delivering close performance while achieving a 30x speed gain. Furthermore, we investigate LLMs' capabilities for assessing an extensive list of built environment and housing attributes through a human-AI alignment study and develop a visualization dashboard that integrates LLM assessment outcomes for downstream analysis by homeowners. Our framework offers a flexible and efficient solution for large-scale building condition assessment, enabling high accuracy with minimal human labeling effort.", "authors": [ "Siyuan Yao", "Siavash Ghorbany", "Kuangshi Ai", "Arnav Cherukuthota", "Meghan Forstchen", "Alexis Korotasz", "Matthew Sisk", "Ming Hu", "Chaoli Wang" ], "year": 2026, "published_date": "2026-04-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.21102v1", "pdf_url": "https://arxiv.org/pdf/2604.21102v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "AI Safety", "Multimodal", "Model Compression" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 5.45, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present a novel framework for automatically evaluating building conditions nationwide in the United States by leveraging large language models (LLMs) and Google Street View (GSV) imagery. By fine-tuning Gemma 3 27B on a modest human-labeled dataset, our approach achieves strong alignment with human mean opinion scores (MOS), outperforming even individual raters on SRCC and PLCC relative to the MOS benchmark.", "key_contribution": "We present a novel framework for automatically evaluating building conditions nationwide in the United States by leveraging large language models (LLMs) and Google Street View (GSV) imagery.", "why_it_matters": "Leveraging Multimodal LLMs for Built Environment and Housing Attribute Assessment from Street-View Imagery represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a novel framework for automatically evaluating building conditions nationwide in the United States by…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.21102v1", "difficulty": "advanced" }, { "id": "arxiv:2604.20738v1", "source": "arxiv", "source_type": "preprint", "title": "RespondeoQA: a Benchmark for Bilingual Latin-English Question Answering", "abstract": "We introduce a benchmark dataset for question answering and translation in bilingual Latin and English settings, containing about 7,800 question-answer pairs. The questions are drawn from Latin pedagogical sources, including exams, quizbowl-style trivia, and textbooks ranging from the 1800s to the present. After automated extraction, cleaning, and manual review, the dataset covers a diverse range of question types: knowledge- and skill-based, multihop reasoning, constrained translation, and mixed language pairs. To our knowledge, this is the first QA benchmark centered on Latin. As a case study, we evaluate three large language models -- LLaMa 3, Qwen QwQ, and OpenAI's o3-mini -- finding that all perform worse on skill-oriented questions. Although the reasoning models perform better on scansion and literary-device tasks, they offer limited improvement overall. QwQ performs slightly better on questions asked in Latin, but LLaMa3 and o3-mini are more task dependent. This dataset provides a new resource for assessing model capabilities in a specialized linguistic and cultural domain, and the creation process can be easily adapted for other languages. The dataset is available at: https://github.com/slanglab/RespondeoQA", "authors": [ "Marisa Hudspeth", "Patrick J. Burns", "Brendan O'Connor" ], "year": 2026, "published_date": "2026-04-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.20738v1", "pdf_url": "https://arxiv.org/pdf/2604.20738v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "QA", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 5.5, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce a benchmark dataset for question answering and translation in bilingual Latin and English settings, containing about 7,800 question-answer pairs. The questions are drawn from Latin pedagogical sources, including exams, quizbowl-style trivia, and textbooks ranging from the 1800s to the present.", "key_contribution": "We introduce a benchmark dataset for question answering and translation in bilingual Latin and English settings, containing about 7,800 question-answer pairs.", "why_it_matters": "RespondeoQA: a Benchmark for Bilingual Latin-English Question Answering represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce a benchmark dataset for question answering and translation in bilingual Latin and English settings,…", "biggest_caveat": "but LLaMa3 and o3-mini are more task dependent.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.20738v1", "difficulty": "beginner" }, { "id": "arxiv:2604.12325v1", "source": "arxiv", "source_type": "preprint", "title": "Black-Box Optimization From Small Offline Datasets via Meta Learning with Synthetic Tasks", "abstract": "We consider the problem of offline black-box optimization, where the goal is to discover optimal designs (e.g., molecules or materials) from past experimental data. A key challenge in this setting is data scarcity: in many scientific applications, only small or poor-quality datasets are available, which severely limits the effectiveness of existing algorithms. Prior work has theoretically and empirically shown that performance of offline optimization algorithms depends on how well the surrogate model captures the optimization bias (i.e., ability to rank input designs correctly), which is challenging to accomplish with limited experimental data. This paper proposes Surrogate Learning with Optimization Bias via Synthetic Task Generation (OptBias), a meta-learning framework that directly tackles data scarcity. OptBias learns a reusable optimization bias by training on synthetic tasks generated from a Gaussian process, and then fine-tunes the surrogate model on the small data for the target task. Across diverse continuous and discrete offline optimization benchmarks, OptBias consistently outperforms state-of-the-art baselines in small data regimes. These results highlight OptBias as a robust and practical solution for offline optimization in realistic small data settings.", "authors": [ "Azza Fadhel", "The Hung Tran", "Trong Nghia Hoang", "Jana Doppa" ], "year": 2026, "published_date": "2026-04-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.12325v1", "pdf_url": "https://arxiv.org/pdf/2604.12325v1", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Fairness & Ethics", "Evaluation", "Artificial Intelligence", "Benchmarking & Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 5.02, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We consider the problem of offline black-box optimization, where the goal is to discover optimal designs (e.g., molecules or materials) from past experimental data. A key challenge in this setting is data scarcity: in many scientific applications, only small or poor-quality datasets are available, which severely limits the effectiveness of existing algorithms.", "key_contribution": "We consider the problem of offline black-box optimization, where the goal is to discover optimal designs (e.g., molecules or materials) from past experimental data.", "why_it_matters": "Black-Box Optimization From Small Offline Datasets via Meta Learning with Synthetic Tasks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We consider the problem of offline black-box optimization, where the goal is to discover optimal designs (e.g.,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Fine-Tuning.", "url": "http://arxiv.org/abs/2604.12325v1", "difficulty": "beginner" }, { "id": "arxiv:2604.12978v1", "source": "arxiv", "source_type": "preprint", "title": "GlotOCR Bench: OCR Models Still Struggle Beyond a Handful of Unicode Scripts", "abstract": "Optical character recognition (OCR) has advanced rapidly with the rise of vision-language models, yet evaluation has remained concentrated on a small cluster of high- and mid-resource scripts. We introduce GlotOCR Bench, a comprehensive benchmark evaluating OCR generalization across 100+ Unicode scripts. Our benchmark comprises clean and degraded image variants rendered from real multilingual texts. Images are rendered using fonts from the Google Fonts repository, shaped with HarfBuzz and rasterized with FreeType, supporting both LTR and RTL scripts. Samples of rendered images were manually reviewed to verify correct rendering across all scripts. We evaluate a broad suite of open-weight and proprietary vision-language models and find that most perform well on fewer than ten scripts, and even the strongest frontier models fail to generalize beyond thirty scripts. Performance broadly tracks script-level pretraining coverage, suggesting that current OCR systems rely on language model pretraining as much as on visual recognition. Models confronted with unfamiliar scripts either produce random noise or hallucinate characters from similar scripts they already know. We release the benchmark and pipeline for reproducibility. Pipeline Code: https://github.com/cisnlp/glotocr-bench, Benchmark: https://hf.co/datasets/cis-lmu/glotocr-bench.", "authors": [ "Amir Hossein Kargaran", "Nafiseh Nikeghbal", "Jana Diesner", "François Yvon", "Hinrich Schütze" ], "year": 2026, "published_date": "2026-04-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.12978v1", "pdf_url": "https://arxiv.org/pdf/2604.12978v1", "citations": 0, "topics": [], "tags": [ "VLMs", "Self-Supervised", "Document AI", "Evaluation", "Document Understanding" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Uses pretraining — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 4.32, "content_potential_score": 2.05, "interestingness_score": 2.59, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Optical character recognition (OCR) has advanced rapidly with the rise of vision-language models, yet evaluation has remained concentrated on a small cluster of high- and mid-resource scripts. We introduce GlotOCR Bench, a comprehensive benchmark evaluating OCR generalization across 100+ Unicode scripts.", "key_contribution": "We introduce GlotOCR Bench, a comprehensive benchmark evaluating OCR generalization across 100+ Unicode scripts.", "why_it_matters": "GlotOCR Bench: OCR Models Still Struggle Beyond a Handful of Unicode Scripts represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about VLMs.", "one_line_takeaway": "We introduce GlotOCR Bench, a comprehensive benchmark evaluating OCR generalization across 100+ Unicode scripts.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in VLMs.", "url": "http://arxiv.org/abs/2604.12978v1", "difficulty": "advanced" }, { "id": "arxiv:2604.09289v1", "source": "arxiv", "source_type": "preprint", "title": "Meta-Learned Basis Adaptation for Parametric Linear PDEs", "abstract": "We propose a hybrid physics-informed framework for solving families of parametric linear partial differential equations (PDEs) by combining a meta-learned predictor with a least-squares corrector. The predictor, termed \\textbf{KAPI} (Kernel-Adaptive Physics-Informed meta-learner), is a shallow task-conditioned model that maps query coordinates and PDE parameters to solution values while internally generating an interpretable, task-adaptive Gaussian basis geometry. A lightweight meta-network maps PDE parameters to basis centers, widths, and activity patterns, thereby learning how the approximation space should adapt across the parametric family. This predictor-generated geometry is transferred to a second-stage corrector, which augments it with a background basis and computes the final solution through a one-shot physics-informed Extreme Learning Machine (PIELM)-style least-squares solve. We evaluate the method on four linear PDE families spanning diffusion, transport, mixed advection--diffusion, and variable-speed transport. Across these cases, the predictor captures meaningful physics through localized and transport-aligned basis placement, while the corrector further improves accuracy, often by one or more orders of magnitude. Comparisons with parametric PINNs, physics-informed DeepONet, and uniform-grid PIELM correctors highlight the value of predictor-guided basis adaptation as an interpretable and efficient strategy for parametric PDE solving.", "authors": [ "Vikas Dwivedi", "Monica Sigovan", "Bruno Sixou" ], "year": 2026, "published_date": "2026-04-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.09289v1", "pdf_url": "https://arxiv.org/pdf/2604.09289v1", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Interpretability", "Information Extraction", "Interpretability & Explainability", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 4.45, "content_potential_score": 0.84, "interestingness_score": 1.98, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We propose a hybrid physics-informed framework for solving families of parametric linear partial differential equations (PDEs) by combining a meta-learned predictor with a least-squares corrector. The predictor, termed \\textbf{KAPI} (Kernel-Adaptive Physics-Informed meta-learner), is a shallow task-conditioned model that maps query coordinates and PDE parameters to solution values while internally generating an interpretable, task-adaptive Gaussian basis geometry.", "key_contribution": "We propose a hybrid physics-informed framework for solving families of parametric linear partial differential equations (PDEs) by combining a meta-learned predictor with a least-squares corrector.", "why_it_matters": "Meta-Learned Basis Adaptation for Parametric Linear PDEs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We propose a hybrid physics-informed framework for solving families of parametric linear partial differential equations…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "http://arxiv.org/abs/2604.09289v1", "difficulty": "intermediate" }, { "id": "arxiv:2604.12102v1", "source": "arxiv", "source_type": "preprint", "title": "Spatial Atlas: Compute-Grounded Reasoning for Spatial-Aware Research Agent Benchmarks", "abstract": "We introduce compute-grounded reasoning (CGR), a design paradigm for spatial-aware research agents in which every answerable sub-problem is resolved by deterministic computation before a language model is asked to generate. Spatial Atlas instantiates CGR as a single Agent-to-Agent (A2A) server that handles two challenging benchmarks: FieldWorkArena, a multimodal spatial question-answering benchmark spanning factory, warehouse, and retail environments, and MLE-Bench, a suite of 75 Kaggle machine learning competitions requiring end-to-end ML engineering. A structured spatial scene graph engine extracts entities and relations from vision descriptions, computes distances and safety violations deterministically, then feeds computed facts to large language models, thereby avoiding hallucinated spatial reasoning. Entropy-guided action selection maximizes information gain per step and routes queries across a three-tier frontier model stack (OpenAI + Anthropic). A self-healing ML pipeline with strategy-aware code generation, a score-driven iterative refinement loop, and a prompt-based leak audit registry round out the system. We evaluate across both benchmarks and show that CGR yields competitive accuracy while maintaining interpretability through structured intermediate representations and deterministic spatial computations.", "authors": [ "Arun Sharma" ], "year": 2026, "published_date": "2026-04-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.12102v1", "pdf_url": "https://arxiv.org/pdf/2604.12102v1", "citations": 0, "topics": [], "tags": [ "Reasoning", "Multimodal", "Code Generation", "Interpretability", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.13, "read_first_score": 5.47, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce compute-grounded reasoning (CGR), a design paradigm for spatial-aware research agents in which every answerable sub-problem is resolved by deterministic computation before a language model is asked to generate. Spatial Atlas instantiates CGR as a single Agent-to-Agent (A2A) server that handles two challenging benchmarks: FieldWorkArena, a multimodal spatial question-answering benchmark spanning factory, warehouse, and retail environments, and MLE-Bench, a suite of 75 Kaggle machine learning competitions requiring end-to-end ML engineering.", "key_contribution": "We introduce compute-grounded reasoning (CGR), a design paradigm for spatial-aware research agents in which every answerable sub-problem is resolved by deterministic computation before a language model is asked to generate.", "why_it_matters": "Spatial Atlas: Compute-Grounded Reasoning for Spatial-Aware Research Agent Benchmarks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We introduce compute-grounded reasoning (CGR), a design paradigm for spatial-aware research agents in which every…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "http://arxiv.org/abs/2604.12102v1", "difficulty": "beginner" }, { "id": "arxiv:2609.26430", "source": "arxiv", "source_type": "preprint", "title": "Latent Dataset Distillation for Human Motion Prediction", "abstract": "Dataset distillation (DD) compresses a large training set into a compact synthetic set while preserving downstream training utility. Although DD has been widely studied for images and recently extended to time-series forecasting, its application to human motion prediction remains largely unexplored. Human motion is high-dimensional and structurally coupled, and gradient matching (GM) in the original motion space optimizes many correlated variables without a prior on pose plausibility or temporal dynamics, which frequently yields implausible and unstable synthetic motions. To address this limitation, we propose a latent DD framework that regularizes distillation with a learned motion prior. Motions are first compressed by a residual-quantized variational autoencoder (RVQ-VAE), and distillation then updates only a learnable latent bank through the frozen quantizer and decoder. The pretrained decoder restricts synthetic motions to its output space, while residual quantization progressively refines the latent approximation across multiple codebooks and alleviates the representational bottleneck of single-stage vector quantization. Experiments on Human3.6M, CMU, and 3DPW with two prediction backbones show that the proposed framework outperforms direct GM in 27 of 30 evaluated settings and random subsets in every setting, and produces visibly more plausible synthetic motions in qualitative comparisons.", "authors": [ "Ge Tian", "Guang Li", "Takahiro Ogawa", "Miki Haseyama" ], "year": 2026, "published_date": "2026-09-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.26430", "pdf_url": "https://arxiv.org/pdf/2609.26430", "citations": 0, "topics": [], "tags": [ "Model Compression", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Uses variational autoencoder — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.38, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Dataset distillation (DD) compresses a large training set into a compact synthetic set while preserving downstream training utility. Although DD has been widely studied for images and recently extended to time-series forecasting, its application to human motion prediction remains largely unexplored.", "key_contribution": "To address this limitation, we propose a latent DD framework that regularizes distillation with a learned motion prior.", "why_it_matters": "Latent Dataset Distillation for Human Motion Prediction advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Model Compression.", "one_line_takeaway": "To address this limitation, we propose a latent DD framework that regularizes distillation with a learned motion prior.", "biggest_caveat": "limitation, we propose a latent DD framework that regularizes distillation with a learned motion prior.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Model Compression.", "url": "https://arxiv.org/abs/2609.26430", "difficulty": "advanced" }, { "id": "arxiv:2609.23939", "source": "arxiv", "source_type": "preprint", "title": "XYEval: Agents say yes to bad advice", "abstract": "Effective communication between users and AI agents is essential for human-AI collaboration. The XY problem is a well-known communication pitfall where a person asks about their attempted solution rather than their actual problem. We extend prior sycophancy evaluation to the XY problem in agentic settings, evaluating whether agents can resist plausible but misleading suggestions from users and communicate their reasoning. We introduce XYEval, a meta-evaluation framework that can transform an existing benchmark into an XY problem evaluation. We evaluate five models across six diverse benchmark suites. Agents suffer large XY drops under XY mutation across benchmarks, with relative drops reaching up to 46.7%. With $τ^2$-bench, we further show that agent performance drops more when encountering a pedantic user who requires detailed explanations before approving a better solution. Our findings suggest that current agents lack the ability to effectively reason and communicate when facing misleading suggestions. A simple system instruction baseline that encourages awareness of XY problems only offers partial mitigation. Extensive trace analyses provide behavioral insights into how and why these XY drops occur across execution trajectories. Our results show that mitigating the XY problem remains challenging, requiring agents to both recognize user misdirection and clearly communicate the underlying problem.", "authors": [ "Zhengxuan Wu", "Yuxuan Li", "Oyvind Tafjord", "Been Kim" ], "year": 2026, "published_date": "2026-09-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.23939", "pdf_url": "https://arxiv.org/pdf/2609.23939", "citations": 0, "topics": [], "tags": [ "Reasoning", "AI Agents", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.62, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Effective communication between users and AI agents is essential for human-AI collaboration. The XY problem is a well-known communication pitfall where a person asks about their attempted solution rather than their actual problem.", "key_contribution": "We introduce XYEval, a meta-evaluation framework that can transform an existing benchmark into an XY problem evaluation.", "why_it_matters": "XYEval: Agents say yes to bad advice represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We introduce XYEval, a meta-evaluation framework that can transform an existing benchmark into an XY problem evaluation.", "biggest_caveat": "but misleading suggestions from users and communicate their reasoning.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2609.23939", "difficulty": "beginner" }, { "id": "arxiv:2609.24117", "source": "arxiv", "source_type": "preprint", "title": "PAC-Bayesian Meta-Learning for Few-Shot Identification of Linear Dynamical Systems", "abstract": "Identifying linear time-invariant (LTI) dynamical systems is challenging when trajectories are short, noisy, or high-dimensional. Traditional system identification typically treats each system independently and cannot exploit shared structure across related systems. We propose PBML-LTI, a PAC-Bayesian meta-learning framework for few-shot LTI system identification that learns a transferable prior over task-specific dynamics while preserving task heterogeneity. Each task corresponds to an unknown LTI system, and the meta-learner uses training trajectories to learn a data-dependent prior over transition matrices. For a new system with limited data, PBML-LTI performs Bayesian adaptation under this prior to obtain a task-specific posterior, providing accurate estimates and principled uncertainty quantification. A key challenge is temporal dependence, since LTI trajectories violate the i.i.d. assumptions underlying most PAC-Bayes meta-learning analyses. We address this with a martingale PAC-Bayes analysis for dependent trajectory losses and derive a support-query predictive-risk bound that motivates a fit-KL meta-training objective. The bound clarifies the roles of empirical fit, posterior complexity, and prior quality in few-shot adaptation under sequential dependence. We further derive corollaries for transition-matrix recovery and multi-step trajectory prediction, connecting uncertainty-aware meta-identification with finite-sample guarantees for dependent dynamical data.", "authors": [ "Chenfeng Huang", "George Michailidis" ], "year": 2026, "published_date": "2026-09-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.24117", "pdf_url": "https://arxiv.org/pdf/2609.24117", "citations": 0, "topics": [], "tags": [ "Prompting", "Info Extraction", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 3.35, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Identifying linear time-invariant (LTI) dynamical systems is challenging when trajectories are short, noisy, or high-dimensional. Traditional system identification typically treats each system independently and cannot exploit shared structure across related systems.", "key_contribution": "We propose PBML-LTI, a PAC-Bayesian meta-learning framework for few-shot LTI system identification that learns a transferable prior over task-specific dynamics while preserving task heterogeneity.", "why_it_matters": "PAC-Bayesian Meta-Learning for Few-Shot Identification of Linear Dynamical Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We propose PBML-LTI, a PAC-Bayesian meta-learning framework for few-shot LTI system identification that learns a…", "biggest_caveat": "cannot exploit shared structure across related systems.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2609.24117", "difficulty": "frontier" }, { "id": "arxiv:2609.21122", "source": "arxiv", "source_type": "preprint", "title": "MetaPusher: Meta Learning and Planning for Nonprehensile Manipulation of Unseen Objects with Rapid Online Adaption", "abstract": "Manipulating previously unseen objects remains challenging, as their dynamics depend on latent physical properties, such as friction and mass distribution, that cannot be inferred from perception alone. Prior experience across objects can provide an initial estimate of unseen object dynamics, but this estimate remains uncertain and can degrade further during sim-to-real transfer. Adapting the dynamics through interaction can progressively refine the estimation, however, updating the model may invalidate the planned trajectory. Successful and efficient manipulation therefore requires both rapid dynamics adaptation and a planning strategy that can incorporate this evolution. In this work, we introduce MetaPusher, a meta-learning and adaptive planning framework for nonprehensile manipulation of unseen objects without prior object-specific interactions. A meta-learned dynamics model rapidly adapts from interactions during task execution, while an adaptive kinodynamic planner updates long-horizon plans by reusing and refining its existing search tree. This coupling enables manipulation and adaptation without a separate data collection phase. We evaluate MetaPusher on unseen objects in simulation and in sim-to-real scenarios, comparing against fine-tuning and active learning methods, MPPI-based control, and a reinforcement learning policy. It achieves lower prediction error and improves task success rate by up to 20%.", "authors": [ "Donghyung Lee", "Seyedali Golestaneh", "Jaskrit Singh", "Zhuoyun Zhong", "Athanasios Kapoutsis", "Constantinos Chamzas" ], "year": 2026, "published_date": "2026-09-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.21122", "pdf_url": "https://arxiv.org/pdf/2609.21122", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Info Extraction", "RL", "Robotics" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.06, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Manipulating previously unseen objects remains challenging, as their dynamics depend on latent physical properties, such as friction and mass distribution, that cannot be inferred from perception alone. Prior experience across objects can provide an initial estimate of unseen object dynamics, but this estimate remains uncertain and can degrade further during sim-to-real transfer.", "key_contribution": "In this work, we introduce MetaPusher, a meta-learning and adaptive planning framework for nonprehensile manipulation of unseen objects without prior object-specific interactions.", "why_it_matters": "MetaPusher: Meta Learning and Planning for Nonprehensile Manipulation of Unseen Objects with Rapid Online Adaption represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "In this work, we introduce MetaPusher, a meta-learning and adaptive planning framework for nonprehensile manipulation…", "biggest_caveat": "bution, that cannot be inferred from perception alone.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2609.21122", "difficulty": "advanced" }, { "id": "arxiv:2605.28173", "source": "arxiv", "source_type": "preprint", "title": "MangaFlow: An End-to-End Agentic Framework for Controllable Story to Manga Generation", "abstract": "End-to-end manga generation is a structured visual storytelling task that requires story decomposition, recurring character and scene grounding, page layout design, panel rendering, page composition, and lettering. However, existing generative models often perform direct page synthesis, entangling these factors in a single visual output and limiting precise control over layout geometry, visual references, and cross-panel consistency. To address these limitations, we propose MangaFlow, an agentic framework for controllable long-form manga generation that decomposes manga creation into planning, grounding, layout construction, reference-conditioned rendering, composition, and text placement. By treating layout and visual references as explicit intermediate variables, MangaFlow enables both simple text-to-manga generation and more precise user-controlled manga creation. This design exposes layout, visual assets, and lettering as editable intermediate controls for refining panel geometry, references, and text placement. To support long-form consistency, MangaFlow introduces a story section memory that links section descriptions with corresponding character, scene, and object references for reuse across panels. We further present a meta-benchmark for evaluating layout controllability, visual consistency, and generation quality. Experiments show that MangaFlow improves layout adherence and cross-panel consistency over direct generation baselines while supporting flexible human control.", "authors": [ "Muyao Wang", "Zeke Xie", "Yanhao Chen", "Lixin Xiu", "Hideki Nakayama" ], "year": 2026, "published_date": "2026-05-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.28173", "pdf_url": "https://arxiv.org/pdf/2605.28173", "citations": 0, "topics": [], "tags": [ "Hallucination", "AI Agents", "Evaluation", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.55, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "End-to-end manga generation is a structured visual storytelling task that requires story decomposition, recurring character and scene grounding, page layout design, panel rendering, page composition, and lettering. However, existing generative models often perform direct page synthesis, entangling these factors in a single visual output and limiting precise control over layout geometry, visual references, and cross-panel consistency.", "key_contribution": "To address these limitations, we propose MangaFlow, an agentic framework for controllable long-form manga generation that decomposes manga creation into planning, grounding, layout construction, reference-conditioned rendering, composition, and text placement.", "why_it_matters": "MangaFlow: An End-to-End Agentic Framework for Controllable Story to Manga Generation advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "To address these limitations, we propose MangaFlow, an agentic framework for controllable long-form manga generation…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2605.28173", "difficulty": "beginner" }, { "id": "arxiv:2608.24947", "source": "arxiv", "source_type": "preprint", "title": "CAT-GS: Balanced Multimodal Learning via Calibrated Gating and Fusion Surgery", "abstract": "End-to-end training of multimodal neural networks often exhibits unstable neural dynamics characterized by three coupled failure modes that degrade learning: (i) modality imbalance, where one branch dominates gradient-based optimization; (ii) unstable gating, where noisy confidence cues induce erratic modality selection; and (iii) fusion interference, where modality-specific gradients conflict at the shared fusion layer. We propose CAT-GS (Calibrated, Adaptive, Thresholded Gating with Fusion Surgery), a neural dynamics-based optimization controller for intelligent computing applications. CAT-GS operates during backpropagation without modifying model architectures, fusion modules, or task losses. Through calibration of teacher-derived reliability via temperature scaling and EMA smoothing, CAT-GS stabilizes neural dynamics using a margin-thresholded policy to switch between warm-up dropout, weak-modality prioritization, and weak-biased blending, stabilizes gradient magnitudes under aggressive gating via capped gradient-budget renormalization, and applies fusion-only PCGrad to reduce destructive cross-modal interference at the primary shared bottleneck. We evaluate CAT-GS on audio--visual multimodal pattern recognition benchmarks (CREMA-D, AV-MNIST, and VGGSound), a tri-modal setting (UR-FUNNY), controlled synthetic data (CG-MNIST), and additional cross-domain benchmarks (AVE and CMU-MOSI). CAT-GS improves or matches fused multimodal accuracy against strong imbalance-aware baselines (including OGM-GE, G$^2$D, and UMT) across settings, and yields smoother gating behavior with fewer conflicting fusion gradients.", "authors": [ "Mahir Shahriar Tamim", "Sharjil Khan", "Md. Samiul Alim", "Tanvir Ahmed Khan", "Shafin Rahman", "Nabeel Mohammed" ], "year": 2026, "published_date": "2026-08-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.24947", "pdf_url": "https://arxiv.org/pdf/2608.24947", "citations": 0, "topics": [], "tags": [ "Multimodal", "Fairness & Ethics", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses backpropagation — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.39, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "End-to-end training of multimodal neural networks often exhibits unstable neural dynamics characterized by three coupled failure modes that degrade learning: (i) modality imbalance, where one branch dominates gradient-based optimization; (ii) unstable gating, where noisy confidence cues induce erratic modality selection; and (iii) fusion interference, where modality-specific gradients conflict at the shared fusion layer. We propose CAT-GS (Calibrated, Adaptive, Thresholded Gating with Fusion Surgery), a neural dynamics-based optimization controller for intelligent computing applications.", "key_contribution": "We propose CAT-GS (Calibrated, Adaptive, Thresholded Gating with Fusion Surgery), a neural dynamics-based optimization controller for intelligent computing applications.", "why_it_matters": "CAT-GS: Balanced Multimodal Learning via Calibrated Gating and Fusion Surgery represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We propose CAT-GS (Calibrated, Adaptive, Thresholded Gating with Fusion Surgery), a neural dynamics-based optimization…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2608.24947", "difficulty": "advanced" }, { "id": "arxiv:2606.29920", "source": "arxiv", "source_type": "preprint", "title": "Can LLM-as-a-Judge Reliably Verify Rubrics in Agentic Scenarios?", "abstract": "Rubric-based scoring has become a widely used paradigm in model evaluation, typically with LLM-as-a-Judge (LaaJ) for rubric scoring. However, the reliability of LaaJ for rubric scoring remains underexplored. This concern is especially pronounced in agentic scenarios, where long, complex outputs further challenge reliable scoring. To address this, we conduct a systematic meta-evaluation of LaaJ reliability for rubric verification. We introduce RuVerBench, the first benchmark for assessing LaaJ reliability in rubric verification for agentic scenarios. RuVerBench covers two prevalent agentic domains, deep research and agentic coding, with 2,458 instances, each containing a model-generated output, a rubric, and a human-annotated label indicating whether the output satisfies the rubric. Using RuVerBench, we evaluate numerous frontier LLMs and find that even the most advanced models achieve strong performance but still exhibit substantial noise. We further analyze the impact of key LaaJ strategies, including prompt design, batching, and majority voting, on rubric verification. We find that weaker models are more sensitive to prompt variations, batched verification presents a trade-off between accuracy and efficiency, and majority voting yields effective but diminishing returns. We have released our dataset and code to facilitate future research: https://github.com/THU-KEG/RuVerBench.", "authors": [ "Yangda Peng", "Yunjia Qi", "Hao Peng", "Haotian Xia", "Guanzhong He", "Xintong Shi", "Richeng Xuan", "Songyuanyi Lu", "Yixian Liu", "Zhichao Hu", "Yuhong Liu", "Lei Hou", "Bin Xu", "Juanzi Li" ], "year": 2026, "published_date": "2026-06-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.29920", "pdf_url": "https://arxiv.org/pdf/2606.29920", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 6.07, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Rubric-based scoring has become a widely used paradigm in model evaluation, typically with LLM-as-a-Judge (LaaJ) for rubric scoring. However, the reliability of LaaJ for rubric scoring remains underexplored.", "key_contribution": "We introduce RuVerBench, the first benchmark for assessing LaaJ reliability in rubric verification for agentic scenarios.", "why_it_matters": "Can LLM-as-a-Judge Reliably Verify Rubrics in Agentic Scenarios? represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce RuVerBench, the first benchmark for assessing LaaJ reliability in rubric verification for agentic…", "biggest_caveat": "However, the reliability of LaaJ for rubric scoring remains underexplored.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.29920", "difficulty": "beginner" }, { "id": "arxiv:2606.06526", "source": "arxiv", "source_type": "preprint", "title": "CrowdMath: A Dataset of Crowdsourced Mathematical Research Discussions", "abstract": "Large language models have made substantial progress on mathematical reasoning, but existing benchmarks typically evaluate well-specified problems with final answers, step-by-step solutions, or complete proofs. They do not capture collaborative open-problem solving: a setting in which participants propose partial arguments, identify gaps or errors in prior steps, repair flawed reasoning, and gradually synthesize incremental contributions into a proof. We introduce CrowdMath, a dataset of 164 expert-annotated progress chains from the MIT PRIMES--Art of Problem Solving (AoPS) CrowdMath program (2016-2025), a collaborative research initiative whose discussions have led to peer-reviewed publications. Each chain traces a multi-participant forum discussion from an open-problem statement to a completed proof. Posts are labeled by their functional roles in the evolving solution process, including partial progress, proof completion, erroneous reasoning, and error identification. We define evaluation tasks and benchmark six frontier models. Models achieve 83-88% accuracy on next-post prediction, suggesting that they can follow the local flow of mathematical discussion. However, they struggle to identify the functional significance of individual contributions with the best model achieving only 0.42 macro-F1 on post-role classification. CrowdMath exposes a gap between solving well-specified mathematical problems and understanding collaborative mathematical progress as it unfolds.", "authors": [ "Sherin Muckatira", "Jesse Geneson", "Slava Gerovitch", "Pavel Etingof", "Mikhail Gronas", "Anna Rumshisky" ], "year": 2026, "published_date": "2026-06-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.06526", "pdf_url": "https://arxiv.org/pdf/2606.06526", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 3.89, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models have made substantial progress on mathematical reasoning, but existing benchmarks typically evaluate well-specified problems with final answers, step-by-step solutions, or complete proofs. They do not capture collaborative open-problem solving: a setting in which participants propose partial arguments, identify gaps or errors in prior steps, repair flawed reasoning, and gradually synthesize incremental contributions into a proof.", "key_contribution": "They do not capture collaborative open-problem solving: a setting in which participants propose partial arguments, identify gaps or errors in prior steps, repair flawed reasoning, and gradually synthesize incremental contributions into a proof.", "why_it_matters": "CrowdMath: A Dataset of Crowdsourced Mathematical Research Discussions represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "They do not capture collaborative open-problem solving: a setting in which participants propose partial arguments,…", "biggest_caveat": "but existing benchmarks typically evaluate well-specified problems with final answers, step-by-step solutions, or complete proofs.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.06526", "difficulty": "frontier" }, { "id": "arxiv:2608.30726", "source": "arxiv", "source_type": "preprint", "title": "Multimodal Adaptive Expert Selection with Text Routing and Ordinal Prototype Optimization for Sentiment Analysis", "abstract": "Multimodal Sentiment Analysis (MSA) is a fundamental component of affective computing that aims to decipher complex emotional states by integrating verbal content with non-verbal cues including vocal intonation and facial micro-expressions. While recent disentanglement-based approaches have advanced the field, their potential is hindered by two methodological challenges. First, static computation graphs process all samples indiscriminately regardless of semantic complexity, which leads to suboptimal representation for diverse emotional expressions and contextual scenarios. Second, generic contrastive objectives often neglect the intrinsic ordinal hierarchy of sentiment intensities. To systematically address these limitations, we introduce Multimodal Adaptive Expert Selection with Text Routing and Ordinal prototype optimization (MAESTRO), a novel framework designed to dynamically orchestrate and refine multimodal representations. Drawing inspiration from an orchestra conductor, we design a Text-Guided Hybrid Mixture-of-Experts (MoE) mechanism. Unlike static fusion, this module utilizes linguistic context as a routing signal to dynamically activate specific audio-visual experts, thereby resolving cross-modal ambiguity through adaptive feature enhancement. Furthermore, to capture fine-grained sentiment gradations, we propose an Ordinal-aware Prototype Contrastive Learning (O-PCL). By incorporating distance-based penalties into the prototype learning objective, O-PCL enforces a structured latent space that preserves the natural order of emotion. Extensive experiments on the CMU-MOSI and CMU-MOSEI benchmarks demonstrate that MAESTRO achieves state-of-the-art performance, and qualitative analysis further confirms the interpretability of our dynamic routing paradigm.", "authors": [ "Xiaode Chen", "Jiakang Yu", "Hongtao Deng", "Huina Qu", "Xun Zhu", "Yinxia Lou" ], "year": 2026, "published_date": "2026-08-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.30726", "pdf_url": "https://arxiv.org/pdf/2608.30726", "citations": 0, "topics": [], "tags": [ "MoE", "Multimodal", "Sentiment Analysis", "Self-Supervised", "Interpretability" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (MoE) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.68, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multimodal Sentiment Analysis (MSA) is a fundamental component of affective computing that aims to decipher complex emotional states by integrating verbal content with non-verbal cues including vocal intonation and facial micro-expressions. While recent disentanglement-based approaches have advanced the field, their potential is hindered by two methodological challenges.", "key_contribution": "To systematically address these limitations, we introduce Multimodal Adaptive Expert Selection with Text Routing and Ordinal prototype optimization (MAESTRO), a novel framework designed to dynamically orchestrate and refine multimodal representations.", "why_it_matters": "Multimodal Adaptive Expert Selection with Text Routing and Ordinal Prototype Optimization for Sentiment Analysis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about MoE.", "one_line_takeaway": "To systematically address these limitations, we introduce Multimodal Adaptive Expert Selection with Text Routing and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in MoE.", "url": "https://arxiv.org/abs/2608.30726", "difficulty": "advanced" }, { "id": "arxiv:2608.17177", "source": "arxiv", "source_type": "preprint", "title": "Grounding AI Agents in Contracts: An Empirical Evaluation of Spec-Driven Test Generation", "abstract": "LLM-based agents are increasingly used for coding tasks, where they have outperformed many classical approaches and scaled to repository-level tasks, such as test generation. However, when directly prompted to generate tests, these agents can fail to reason about the code and its underlying contracts, thereby missing edge cases and behavioral boundaries that affect test quality. To address this limitation, we propose Spec-Driven Test Generation, where we instruct an agent to first reason about -- and explicitly document -- code pre-conditions, post-conditions, and undefined behaviors. This intermediate semi-formal specification acts as a cognitive scaffold to guide subsequent test generation. Our evaluation on production bugs from Google shows that the spec-driven agent can deliver a 9.8 percentage points ($p = 0.0352$) improvement in bug detection rate and a 2.5 percentage point ($p = 0.0034$) improvement in branch coverage, compared to a traditional test generation agent baseline. Using LLM-as-a-Judge, we further show that test suites generated by the spec-driven agent are superior to the baseline and human-authored tests in 77.8% and 56.7% of the cases, respectively, and demonstrated improvements on following best practices, readability, and edge-case coverage.", "authors": [ "Michele Tufano", "James McClure", "José Cambronero", "Runxiang Cheng", "Sherry Y. Shi", "Renyao Wei", "Dorothy Chen", "Franjo Ivančić", "Livio Dalloro", "Pat Rondon" ], "year": 2026, "published_date": "2026-08-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.17177", "pdf_url": "https://arxiv.org/pdf/2608.17177", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "AI Agents", "Software Engineering" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.45, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "LLM-based agents are increasingly used for coding tasks, where they have outperformed many classical approaches and scaled to repository-level tasks, such as test generation. However, when directly prompted to generate tests, these agents can fail to reason about the code and its underlying contracts, thereby missing edge cases and behavioral boundaries that affect test quality.", "key_contribution": "To address this limitation, we propose Spec-Driven Test Generation, where we instruct an agent to first reason about -- and explicitly document -- code pre-conditions, post-conditions, and undefined behaviors.", "why_it_matters": "Grounding AI Agents in Contracts: An Empirical Evaluation of Spec-Driven Test Generation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this limitation, we propose Spec-Driven Test Generation, where we instruct an agent to first reason about --…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.17177", "difficulty": "intermediate" }, { "id": "arxiv:2506.18779", "source": "arxiv", "source_type": "preprint", "title": "DiffDef: A Diffusion Model for Generating Multimodal Goal Shapes From Demonstrations for Deformable Object Manipulation", "abstract": "Deformable object manipulation is a key capability in many robotic applications. A promising paradigm for this problem is shape servoing, which aims to control deformable objects toward desired goal shapes. However, existing approaches typically rely on impractical goal-shape acquisition methods, such as domain-knowledge engineering or manual manipulation. Moreover, prior methods generally assume a single deterministic goal and fail to handle multimodal goal settings, a common scenario in many real-world tasks where multiple distinct goal shapes can all lead to successful task completion. In this paper, we introduce DiffDef, a novel neural network that uses a diffusion model to learn a distribution of feasible goal shapes rather than predicting a single deterministic outcome. This allows DiffDef to generate diverse goal configurations while avoiding the mode-averaging artifacts common in deterministic predictors. We evaluate our method on several deformable manipulation tasks inspired by manufacturing and surgical applications, both in simulation and on two physical robotic platforms: the da Vinci Research Kit (dVRK) and a bimanual KUKA-based robotic system. The results demonstrate that DiffDef effectively captures multimodal goal distributions and significantly improves task performance in practical robotic settings. Website: sites.google.com/view/diffdef.", "authors": [ "Bao Thach", "Tanner Watts", "Siyeon Kim", "Britton Jordan", "Mohanraj Shanthi", "Shing-Hei Ho", "James M. Ferguson", "Tucker Hermans", "Alan Kuntz" ], "year": 2026, "published_date": "2026-08-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2506.18779", "pdf_url": "https://arxiv.org/pdf/2506.18779", "citations": 0, "topics": [], "tags": [ "Multimodal", "Diffusion", "Robotics" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Diffusion) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.91, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deformable object manipulation is a key capability in many robotic applications. A promising paradigm for this problem is shape servoing, which aims to control deformable objects toward desired goal shapes.", "key_contribution": "In this paper, we introduce DiffDef, a novel neural network that uses a diffusion model to learn a distribution of feasible goal shapes rather than predicting a single deterministic outcome.", "why_it_matters": "DiffDef: A Diffusion Model for Generating Multimodal Goal Shapes From Demonstrations for Deformable Object Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "In this paper, we introduce DiffDef, a novel neural network that uses a diffusion model to learn a distribution of…", "biggest_caveat": "However, existing approaches typically rely on impractical goal-shape acquisition methods, such as domain-knowledge engineering or manual manipulation.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2506.18779", "difficulty": "advanced" }, { "id": "arxiv:2608.19059", "source": "arxiv", "source_type": "preprint", "title": "LT-Mem: Volatility-Aware Spatio-Temporal Memory for Lifelong Scene Understanding", "abstract": "Long-term robot operation in evolving environments requires object-level understanding that persists across repeated revisits. Existing systems either overwrite history to maintain an up-to-date map or store semantic snapshots without consistent cross-session object identity, resulting in temporal amnesia: the systematic loss of object history that prevents answering queries such as \"Where has the green chair been across all sessions?\" We propose LT-Mem, a volatility-aware memory evolution framework that unifies spatially aligned instance-level 3D perception with volatility-conditioned temporal reasoning. First, a multi-session SLAM backbone provides spatially aligned per-object observations across sessions. Second, a reasoning layer governs how object memory evolves: deterministic evidence scoring preserves cross-session identity, and a volatility-aware policy selects among overwrite, hold, and multi-hypothesis actions based on each object's dynamics. Third, the resulting Tri-Memory structure (Live, Delta, Meta) preserves both current states and event histories, enabling longitudinal object-centric reasoning. We further introduce LT-VQA, a dataset and evaluation suite comprising multi-session recordings, persistent identity annotations, and temporal QA pairs. Experiments show that LT-Mem consistently outperforms baselines across all metrics while consuming an order of magnitude fewer tokens, and ablations confirm that gains are driven by the structured memory architecture rather than LLM capacity.", "authors": [ "Yumin Lee", "Hyoseok Ju", "Giseop Kim" ], "year": 2026, "published_date": "2026-08-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.19059", "pdf_url": "https://arxiv.org/pdf/2608.19059", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "VLMs", "Robotics", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.99, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Long-term robot operation in evolving environments requires object-level understanding that persists across repeated revisits. Existing systems either overwrite history to maintain an up-to-date map or store semantic snapshots without consistent cross-session object identity, resulting in temporal amnesia: the systematic loss of object history that prevents answering queries such as \"Where has the green chair been across all sessions?\" We propose LT-Mem, a volatility-aware memory evolution framework that unifies spatially aligned instance-level 3D perception with volatility-conditioned temporal reasoning.", "key_contribution": "Existing systems either overwrite history to maintain an up-to-date map or store semantic snapshots without consistent cross-session object identity, resulting in temporal amnesia: the systematic loss of object history that prevents answering queries such as \"Where has the green chair been across all sessions?\" We propose LT-Mem, a volatility-aware memory evolution framework that unifies spatially aligned instance-level 3D perception with volatility-conditioned temporal reasoning.", "why_it_matters": "LT-Mem: Volatility-Aware Spatio-Temporal Memory for Lifelong Scene Understanding advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Existing systems either overwrite history to maintain an up-to-date map or store semantic snapshots without consistent…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.19059", "difficulty": "intermediate" }, { "id": "arxiv:2412.19011", "source": "arxiv", "source_type": "preprint", "title": "Spherical Area-Preserving Parameterization via Energy Minimization", "abstract": "We propose a novel method, called spherical authalic energy minimization (SAEM), for computing spherical area-preserving parameterizations of genus-zero closed surfaces, with strong theoretical foundations. The global convergence of the associated computational algorithm is theoretically guaranteed. In addition, we introduce a Riemannian bijective correction method that ensures the bijectivity of the resulting mapping under mild assumptions. Numerical experiments show that SAEM effectively minimizes area distortion and achieves bijective mappings, outperforming state-of-the-art methods. Finally, we demonstrate the practical utility of SAEM in shape description.", "authors": [ "Shu-Yung Liu", "Mei-Heng Yueh" ], "year": 2026, "published_date": "2026-08-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2412.19011", "pdf_url": "https://arxiv.org/pdf/2412.19011", "citations": 0, "topics": [], "tags": [], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.42, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We propose a novel method, called spherical authalic energy minimization (SAEM), for computing spherical area-preserving parameterizations of genus-zero closed surfaces, with strong theoretical foundations. The global convergence of the associated computational algorithm is theoretically guaranteed.", "key_contribution": "We propose a novel method, called spherical authalic energy minimization (SAEM), for computing spherical area-preserving parameterizations of genus-zero closed surfaces, with strong theoretical foundations.", "why_it_matters": "Spherical Area-Preserving Parameterization via Energy Minimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "We propose a novel method, called spherical authalic energy minimization (SAEM), for computing spherical…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2412.19011", "difficulty": "intermediate" }, { "id": "arxiv:2608.02618", "source": "arxiv", "source_type": "preprint", "title": "Beyond the Hivemind: Escaping LLM Homogeneity via Meta-Persona Anchoring and Sequential Temperature Scaling", "abstract": "Recent studies have identified an ``Artificial Hivemind'' effect in Large Language Models (LLMs) causing models to converge on a narrow, homogenized consensus even for open questions. This semantic collapse limits the diversity of AI, resulting in high inter-response similarity ($\\approx 0.80-0.90$) even under high-temperature sampling. In this paper, we propose a novel mitigation framework to increase diversity: Meta-Persona Anchoring combined with Filtered Temperature Scaling (FTS). Our approach utilizes a two-stage generation process: first, the model is prompted to self-select a unique, idiosyncratic persona to anchor its starting point; second, we apply a dual-stage sampling sieve, utilizing Top-$p$ filtering to preserve grammatical validity followed by extreme temperature scaling ($T \\ge 4.0$) on the surviving candidates to explore the broadened probability distribution. We evaluate our method using the INFINITY-CHAT dataset on state-of-the-art open weight models under $\\sim$20B parameters. Our results demonstrate a significant reduction in semantic convergence, with average pairwise cosine similarity dropping from ($\\approx 0.85$) to ($\\approx 0.65$). Our scheme achieves a majority of questions below the 0.7 threshold, effectively reducing the gap between artificial mode collapse and human-level typological diversity. We provide our implementation as an open-source framework to enable more diverse and creative AI deployments.", "authors": [ "Tairan Fu", "Javier Conde", "Carlos Arriaga", "Gonzalo Martínez", "Pedro Reviriego", "Javier Coronado-Blázquez" ], "year": 2026, "published_date": "2026-05-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.02618", "pdf_url": "https://arxiv.org/pdf/2608.02618", "citations": 0, "topics": [], "tags": [ "LLMs", "Artificial Intelligence", "NLP" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 6.18, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent studies have identified an ``Artificial Hivemind'' effect in Large Language Models (LLMs) causing models to converge on a narrow, homogenized consensus even for open questions. This semantic collapse limits the diversity of AI, resulting in high inter-response similarity ($\\approx 0.80-0.90$) even under high-temperature sampling.", "key_contribution": "In this paper, we propose a novel mitigation framework to increase diversity: Meta-Persona Anchoring combined with Filtered Temperature Scaling (FTS).", "why_it_matters": "Beyond the Hivemind: Escaping LLM Homogeneity via Meta-Persona Anchoring and Sequential Temperature Scaling represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this paper, we propose a novel mitigation framework to increase diversity: Meta-Persona Anchoring combined with…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.02618", "difficulty": "intermediate" }, { "id": "arxiv:2507.22442", "source": "arxiv", "source_type": "preprint", "title": "Ensemble Fuzzing with Dynamic Resource Scheduling and Multidimensional Seed Evaluation", "abstract": "Fuzzing is widely used for detecting bugs and vulnerabilities, with various techniques proposed to enhance its effectiveness. To combine the advantages of multiple technologies, researchers proposed ensemble fuzzing, which integrates multiple base fuzzers. Despite promising results, state-of-the-art ensemble fuzzing techniques face limitations in resource scheduling and performance evaluation, leading to unnecessary resource waste. In this paper, we propose Legion, a novel ensemble fuzzing framework that dynamically schedules resources during the ensemble fuzzing campaign. We designed a novel resource scheduling algorithm based on the upper confidence bound algorithm to reduce the resource consumption of ineffective base fuzzers. Additionally, we introduce a multidimensional seed evaluation strategy, which considers multiple metrics to achieve more comprehensive fine-grained performance evaluation. We implemented Legion as a prototype tool and evaluated its effectiveness on Google's fuzzer-test-suite as well as real-world open-source projects. Results show that Legion outperforms existing state-of-the-art base fuzzers and ensemble fuzzing techniques, detecting 20 bugs in real-world open-source projects-five previously unknown and three classified as CVEs.", "authors": [ "Yukai Zhao", "Shaohua Wang", "Jue Wang", "Xing Hu", "Xin Xia" ], "year": 2026, "published_date": "2026-08-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2507.22442", "pdf_url": "https://arxiv.org/pdf/2507.22442", "citations": 0, "topics": [], "tags": [ "Software Engineering" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.89, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Fuzzing is widely used for detecting bugs and vulnerabilities, with various techniques proposed to enhance its effectiveness. To combine the advantages of multiple technologies, researchers proposed ensemble fuzzing, which integrates multiple base fuzzers.", "key_contribution": "In this paper, we propose Legion, a novel ensemble fuzzing framework that dynamically schedules resources during the ensemble fuzzing campaign.", "why_it_matters": "Ensemble Fuzzing with Dynamic Resource Scheduling and Multidimensional Seed Evaluation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Software Engineering.", "one_line_takeaway": "In this paper, we propose Legion, a novel ensemble fuzzing framework that dynamically schedules resources during the…", "biggest_caveat": "limitations in resource scheduling and performance evaluation, leading to unnecessary resource waste.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Software Engineering.", "url": "https://arxiv.org/abs/2507.22442", "difficulty": "intermediate" }, { "id": "arxiv:2603.28568", "source": "arxiv", "source_type": "preprint", "title": "XSPA: Crafting Imperceptible X-Shaped Sparse Adversarial Perturbations for Transferable Attacks on VLMs", "abstract": "Vision-language models (VLMs) share visual-textual representations across zero-shot classification, image captioning, and visual question answering (VQA), creating a pathway through which subtle perturbations may cause failures across tasks. We introduce X-shaped Sparse Pixel Attack (XSPA), a structured attack that restricts perturbations to two intersecting diagonal lines. Within this fixed support, XSPA jointly optimizes a classification objective, cross-task semantic guidance, perturbation magnitude, and linewise smoothness. Under the default setting, it changes about 1.04\\% of image pixels. On COCO, XSPA reduces zero-shot accuracy by 52.33 points on OpenAI CLIP ViT-L/14 and 67.00 points on OpenCLIP ViT-B/16; GPT-4-based caption consistency and VQA correctness decrease by up to 58.60 and 44.25 points, respectively. Matched-budget experiments show that an adaptive saliency Top-k support achieves higher attack success than the fixed X-shaped support, while XSPA provides better SSIM and LPIPS but worse PSNR and MAE. Same-image analysis finds no three-task targeted success, indicating that strong surrogate classification effects do not reliably translate into targeted output-space failures. These results position XSPA as a controlled stress test for studying how sparse fixed geometry affects VLM robustness, rather than as a universally superior attack.", "authors": [ "Chengyin Hu", "Jiaju Han", "Xuemeng Sun", "Qike Zhang", "Luwei Yang", "Lehan Sun", "Jiahuan Long", "Yiwei Wei", "Jiujiang Guo" ], "year": 2026, "published_date": "2026-08-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.28568", "pdf_url": "https://arxiv.org/pdf/2603.28568", "citations": 0, "topics": [], "tags": [ "LLMs", "VLMs", "QA", "Interpretability", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.55, "content_potential_score": 0.55, "interestingness_score": 1.83, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Vision-language models (VLMs) share visual-textual representations across zero-shot classification, image captioning, and visual question answering (VQA), creating a pathway through which subtle perturbations may cause failures across tasks. We introduce X-shaped Sparse Pixel Attack (XSPA), a structured attack that restricts perturbations to two intersecting diagonal lines.", "key_contribution": "We introduce X-shaped Sparse Pixel Attack (XSPA), a structured attack that restricts perturbations to two intersecting diagonal lines.", "why_it_matters": "XSPA: Crafting Imperceptible X-Shaped Sparse Adversarial Perturbations for Transferable Attacks on VLMs advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce X-shaped Sparse Pixel Attack (XSPA), a structured attack that restricts perturbations to two intersecting…", "biggest_caveat": "but worse PSNR and MAE.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2603.28568", "difficulty": "beginner" }, { "id": "arxiv:2606.19259", "source": "arxiv", "source_type": "preprint", "title": "A Multi-Domain Benchmark for Detecting AI-Generated Text-Rich Images from GPT-Image-2", "abstract": "Text-rich images often contain privacy-sensitive, transactional, or decision-relevant information. As recent multimodal image generation models become increasingly capable of synthesizing realistic textual content and structured visual designs, detecting AI-generated text-rich images has become an important challenge for digital trust and content authenticity. Existing benchmarks, however, largely focus on object-centric images and provide limited coverage of scenarios where textual semantics and layout organization are central. In this paper, we introduce a multi-domain benchmark for detecting text-rich images generated by OpenAI's GPT Image 2. The benchmark contains 8,602 images across six representative categories: commercial posters, infographics, academic posters, receipts, tables, and UI screenshots. Using this benchmark, we evaluate five representative AI-generated image detectors in a zero-shot setting and analyze their overall, category-wise, and post-processing robustness. Our results show that detector performance is highly domain-dependent: methods that perform well in some categories often fail on others, and even the strongest conventional detector exhibits severe sensitivity to JPEG compression. We further conduct an exploratory evaluation with a multimodal vision-language model, revealing both its promise and its limitations on structured formats. These findings highlight the need for text- and layout-aware detection methods for modern AI-generated images. Our dataset is released at XXX.", "authors": [ "Yijin Wang", "Shuyi Wang", "Wenhan Zhang", "Yuqi Ouyang" ], "year": 2026, "published_date": "2026-06-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.19259", "pdf_url": "https://arxiv.org/pdf/2606.19259", "citations": 0, "topics": [], "tags": [ "VLMs", "Text-to-Image", "Evaluation", "Artificial Intelligence", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 7.29, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Text-rich images often contain privacy-sensitive, transactional, or decision-relevant information. As recent multimodal image generation models become increasingly capable of synthesizing realistic textual content and structured visual designs, detecting AI-generated text-rich images has become an important challenge for digital trust and content authenticity.", "key_contribution": "In this paper, we introduce a multi-domain benchmark for detecting text-rich images generated by OpenAI's GPT Image 2.", "why_it_matters": "A Multi-Domain Benchmark for Detecting AI-Generated Text-Rich Images from GPT-Image-2 advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about VLMs.", "one_line_takeaway": "In this paper, we introduce a multi-domain benchmark for detecting text-rich images generated by OpenAI's GPT Image 2.", "biggest_caveat": "however, largely focus on object-centric images and provide limited coverage of scenarios where textual semantics and layout organization are central.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in VLMs.", "url": "https://arxiv.org/abs/2606.19259", "difficulty": "beginner" }, { "id": "arxiv:2607.23524", "source": "arxiv", "source_type": "preprint", "title": "Delegation Intelligence in Deep Search: A Controllable Framework for Disentangled Capability Diagnosis", "abstract": "Deep search is becoming a core capability of modern agent systems, yet it is typically evaluated solely based on end-to-end answer accuracy. This coupled evaluation paradigm entangles retrieval quality, long-context comprehension, evidence verification, and tool-use decisions, making it difficult to determine whether a model truly knows when and how to delegate information seeking to search. To this end: (1) We formalize this meta-capability as Delegation Intelligence in deep search and decompose it into complementary dimensions-Search Decision-Making (recognizing information insufficiency and deciding whether, when, and how to search) and Information Synthesis and Verification (aggregating evidence from multiple sources, judging source reliability, and synthesizing information under noisy, potentially adversarial conditions). (2) To enable disentangled and reproducible measurement, we develop a controllable synthesis pipeline built on document-grounded reverse engineering. This yields a general recipe for constructing controlled deep-search evaluations rather than a single fixed dataset. (3) As a concrete instantiation, we construct DelegSearchBench, together with a disentangled evaluation protocol that isolates each capability dimension by varying document composition and tool access. (4) Across representative models, we demonstrate that deep-search competence cannot be adequately characterized by final-answer accuracy alone...", "authors": [ "Xinhao Yao", "Yuanzhuo Liu", "Changhao Wang", "Yunfei Yu", "Haoran Tan", "Yuyao Zhang", "Ruifeng Ren", "Minlong Peng", "Yong Liu" ], "year": 2026, "published_date": "2026-07-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.23524", "pdf_url": "https://arxiv.org/pdf/2607.23524", "citations": 0, "topics": [], "tags": [ "Long Context", "Artificial Intelligence" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.95, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deep search is becoming a core capability of modern agent systems, yet it is typically evaluated solely based on end-to-end answer accuracy. This coupled evaluation paradigm entangles retrieval quality, long-context comprehension, evidence verification, and tool-use decisions, making it difficult to determine whether a model truly knows when and how to delegate information seeking to search.", "key_contribution": "(4) Across representative models, we demonstrate that deep-search competence cannot be adequately characterized by final-answer accuracy alone...", "why_it_matters": "Delegation Intelligence in Deep Search: A Controllable Framework for Disentangled Capability Diagnosis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Long Context.", "one_line_takeaway": "(4) Across representative models, we demonstrate that deep-search competence cannot be adequately characterized by…", "biggest_caveat": "cannot be adequately characterized by final-answer accuracy alone.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Long Context.", "url": "https://arxiv.org/abs/2607.23524", "difficulty": "intermediate" }, { "id": "arxiv:2607.18632", "source": "arxiv", "source_type": "preprint", "title": "Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes", "abstract": "Automated Algorithm Selection (AS) aims to improve problem-solving performance by selecting, for each problem instance, the most suitable algorithm from a predefined portfolio. This is particularly relevant to the Traveling Salesman Problem (TSP), where solver performance is strongly instance-dependent. We introduce GNNAS-TSP, a Graph Neural Network (GNN)-based AS framework that learns TSP instance representations directly from raw graph data, avoiding manual feature engineering. GNNAS-TSP formulates AS as a joint cost-prediction and ranking task. We evaluate cost-based (mean squared error (MSE), mean absolute error (MAE), and Huber), rank-based (RankNet, ListNet, and LambdaRank), and hybrid learning objectives for a portfolio comprising Chained Lin-Kernighan, Edge Assembly Crossover, Lin-Kernighan-Helsgaun, Multiagent Optimization System, and Concorde. Experiments use fixed computational budgets of 10 and 60 seconds. On the held-out test set, the selected configurations improve on the Single Best Solver (SBS) in normalized solution cost at both budgets. For the 10s budget, AS achieves substantial and statistically significant cost improvement over SBS. Overall, the results suggest that GNNAS-TSP is a useful meta-solving strategy when exploitable variation exists across solver performance.", "authors": [ "Zhaoxuan Li", "Jiale Yang", "Yifei Lu", "Mustafa Misir" ], "year": 2026, "published_date": "2026-07-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.18632", "pdf_url": "https://arxiv.org/pdf/2607.18632", "citations": 0, "topics": [], "tags": [ "GNNs", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (GNNs) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 3.79, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Automated Algorithm Selection (AS) aims to improve problem-solving performance by selecting, for each problem instance, the most suitable algorithm from a predefined portfolio. This is particularly relevant to the Traveling Salesman Problem (TSP), where solver performance is strongly instance-dependent.", "key_contribution": "We introduce GNNAS-TSP, a Graph Neural Network (GNN)-based AS framework that learns TSP instance representations directly from raw graph data, avoiding manual feature engineering.", "why_it_matters": "Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about GNNs.", "one_line_takeaway": "We introduce GNNAS-TSP, a Graph Neural Network (GNN)-based AS framework that learns TSP instance representations…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in GNNs.", "url": "https://arxiv.org/abs/2607.18632", "difficulty": "advanced" }, { "id": "arxiv:2510.20692", "source": "arxiv", "source_type": "preprint", "title": "Neurosymbolic Characterization for Reliable Access Control Policy Analysis", "abstract": "Access control policies are reliability-critical configuration artifacts in cloud systems, yet administrators frequently struggle to verify that a policy permits exactly what they intend. This verification gap cannot be remedied by using LLMs to synthesize policies: we find that reasoning and non-reasoning LLMs fluently explain policy behavior but cannot reason about policy semantics with reliability-grade precision, even when the specification is the LLM's own explanation. We formulate this impasse as the Verifiable Synthesis Paradox: the verification gap persists regardless of how the policy was authored. To remedy this, we introduce PolicySummarizer, a neurosymbolic tool that pairs finite-state automata with an LLM-based simplification to generate precise human-readable characterizations of requests allowed by a policy. PolicySummarizer uses model counting to guarantee the fidelity of the generated characterization by rejecting characterizations that fall below a user-configured threshold in favor of the formally derived one. On 546 AWS, 100 Microsoft Azure, and 100 Google Cloud Platform policies, PolicySummarizer achieves a mean similarity score of 0.93 and a 2.7x improvement over an SMT-based baseline. In a user study, PolicySummarizer raised policy-change-review accuracy from 39% to 93% on the hardest sub-task while reducing self-reported mental demand. We release PolicySummarizer as an open-source tool.", "authors": [ "Adarsh Vatsa", "Bethel Hall", "William Eiers" ], "year": 2026, "published_date": "2026-07-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.20692", "pdf_url": "https://arxiv.org/pdf/2510.20692", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Software Engineering", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.51, "content_potential_score": 0.72, "interestingness_score": 1.92, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Access control policies are reliability-critical configuration artifacts in cloud systems, yet administrators frequently struggle to verify that a policy permits exactly what they intend. This verification gap cannot be remedied by using LLMs to synthesize policies: we find that reasoning and non-reasoning LLMs fluently explain policy behavior but cannot reason about policy semantics with reliability-grade precision, even when the specification is the LLM's own explanation.", "key_contribution": "To remedy this, we introduce PolicySummarizer, a neurosymbolic tool that pairs finite-state automata with an LLM-based simplification to generate precise human-readable characterizations of requests allowed by a policy.", "why_it_matters": "Neurosymbolic Characterization for Reliable Access Control Policy Analysis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To remedy this, we introduce PolicySummarizer, a neurosymbolic tool that pairs finite-state automata with an LLM-based…", "biggest_caveat": "but cannot reason about policy semantics with reliability-grade precision, even when the specification is the LLM's own explanation.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2510.20692", "difficulty": "intermediate" }, { "id": "arxiv:2607.05297", "source": "arxiv", "source_type": "preprint", "title": "MetaSkill-Evolve: Recursive Self-Improvement of LLM Agents via Two-Timescale Meta-Skill Evolution", "abstract": "Recent LLM agents tackle increasingly long-horizon, open-ended tasks, and external skills, reusable procedural knowledge supplied to the agent, further extend this capability. However, a fixed, hand-authored skill is rarely optimal, and cannot adapt to the diversity of tasks an agent encounters. Self-improving agents address this by rewriting their own skill files from execution traces, yielding meaningful gains on challenging benchmarks. Yet such self-evolution remains non-recursive: it improves only the task skill (what the agent does) while the improvement procedure (how it improves) is authored once and held fixed. We introduce MetaSkill-Evolve, a two-timescale framework that makes agentic skill improvement recursive: every branch carries both a task skill $s$ and a branch-local meta-skill $m=(ψ,σ,α,π,\\varepsilon)$ whose five components parameterise the Analyzer, Retriever, Allocator, Proposer, and Evolver agents of the improvement pipeline. Task skills evolve on a fast loop while the meta-skill evolves on a slower one under the same pipeline applied to itself, with no additional model or objective. With all five pipeline agents sharing a single frozen backbone, MetaSkill-Evolve outperforms no-skill, static-skill, and single-level evolution baselines on three agentic benchmarks (OfficeQA, SealQA, ALFWorld), improving held-out test accuracy over the raw backbone by +23.54, +16.09, and +1.92 points respectively.", "authors": [ "Zefeng Wang", "Minxi Yan", "Jinhe Bi", "Sikuan Yan", "Volker Tresp", "Yunpu Ma" ], "year": 2026, "published_date": "2026-07-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.05297", "pdf_url": "https://arxiv.org/pdf/2607.05297", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Evaluation", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.11, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent LLM agents tackle increasingly long-horizon, open-ended tasks, and external skills, reusable procedural knowledge supplied to the agent, further extend this capability. However, a fixed, hand-authored skill is rarely optimal, and cannot adapt to the diversity of tasks an agent encounters.", "key_contribution": "We introduce MetaSkill-Evolve, a two-timescale framework that makes agentic skill improvement recursive: every branch carries both a task skill $s$ and a branch-local meta-skill $m=(ψ,σ,α,π,\\varepsilon)$ whose five components parameterise the Analyzer, Retriever, Allocator, Proposer, and Evolver agents of the improvement pipeline.", "why_it_matters": "MetaSkill-Evolve: Recursive Self-Improvement of LLM Agents via Two-Timescale Meta-Skill Evolution represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce MetaSkill-Evolve, a two-timescale framework that makes agentic skill improvement recursive: every branch…", "biggest_caveat": "However, a fixed, hand-authored skill is rarely optimal, and cannot adapt to the diversity of tasks an agent encounters.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.05297", "difficulty": "beginner" }, { "id": "arxiv:2606.31408", "source": "arxiv", "source_type": "preprint", "title": "EnclaveX: End-to-End Confidential AI with CPU/GPU TEEs", "abstract": "Large Language Models (LLMs) have rapidly proliferated, driving widespread adoption of AI applications. Most deployments rely on centralized infrastructures such as Microsoft Azure, Google Cloud, or AWS, requiring users to share sensitive data and training or fine-tuning code. This dependence raises significant security and privacy concerns, as cloud providers must be trusted to ensure confidentiality and integrity. Trusted Execution Environments (TEEs) e.g., Intel SGX/TDX, AMD SEV-SNP, and ARM CCA have been introduced to mitigate these risks. More recently, NVIDIA has developed GPU TEEs (e.g., H100/H200), yet comprehensive evaluations of end-to-end workflows that integrate CPU and GPU TEEs remain limited. Critical aspects, including performance overhead, remote attestation, and security guarantees for AI/LLM applications, have not been sufficiently studied. This paper addresses this gap by presenting an end-to-end workflow that combines CPU and GPU TEEs. We propose mechanisms to ensure confidentiality and integrity at both the VM level (via Intel TDX and AMD SEV-SNP) and the application level, highlighting vulnerabilities such as Kubernetes administrators' ability to access confidential VM contents. Finally, we evaluate the performance overhead of our system using industry benchmarks, focusing on configurations that integrate Intel TDX with NVIDIA H200 GPUs.", "authors": [ "Robert Schambach", "Quoc Do Le", "Sergei Arnautov", "Christof Fetzer" ], "year": 2026, "published_date": "2026-06-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.31408", "pdf_url": "https://arxiv.org/pdf/2606.31408", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "Evaluation", "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.08, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large Language Models (LLMs) have rapidly proliferated, driving widespread adoption of AI applications. Most deployments rely on centralized infrastructures such as Microsoft Azure, Google Cloud, or AWS, requiring users to share sensitive data and training or fine-tuning code.", "key_contribution": "We propose mechanisms to ensure confidentiality and integrity at both the VM level (via Intel TDX and AMD SEV-SNP) and the application level, highlighting vulnerabilities such as Kubernetes administrators' ability to access confidential VM contents.", "why_it_matters": "EnclaveX: End-to-End Confidential AI with CPU/GPU TEEs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose mechanisms to ensure confidentiality and integrity at both the VM level (via Intel TDX and AMD SEV-SNP) and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.31408", "difficulty": "beginner" }, { "id": "arxiv:2503.09679", "source": "arxiv", "source_type": "preprint", "title": "DRESS: Disentangled Representation-based Self-Supervised Meta-Learning for Diverse Tasks", "abstract": "Meta-learning represents a strong class of approaches for solving few-shot learning tasks. Nonetheless, recent research suggests that simply pre-training a generic encoder can potentially surpass meta-learning algorithms. In this paper, we first discuss the reasons why meta-learning fails to stand out in these few-shot learning experiments, and hypothesize that it is due to the few-shot learning tasks lacking diversity. We propose DRESS, a task-agnostic Disentangled REpresentation-based Self-Supervised meta-learning approach that enables fast model adaptation on highly diversified few-shot learning tasks. Specifically, DRESS utilizes disentangled representation learning to create self-supervised tasks that can fuel the meta-training process. Furthermore, we also propose a class-partition based metric for quantifying the task diversity directly on the input space. We validate the effectiveness of DRESS through experiments on datasets with multiple factors of variation and varying complexity. The results suggest that DRESS is able to outperform competing methods on the majority of the datasets and task setups. Through this paper, we advocate for a re-examination of proper setups for task adaptation studies, and aim to reignite interest in the potential of meta-learning for solving few-shot learning tasks via disentangled representations.", "authors": [ "Wei Cui", "Tongzi Wu", "Jesse C. Cresswell", "Yi Sui", "Keyvan Golestan" ], "year": 2026, "published_date": "2026-06-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2503.09679", "pdf_url": "https://arxiv.org/pdf/2503.09679", "citations": 0, "topics": [], "tags": [ "Prompting", "Self-Supervised", "Machine Learning", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses self-supervised — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.52, "content_potential_score": 0.55, "interestingness_score": 1.83, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Meta-learning represents a strong class of approaches for solving few-shot learning tasks. Nonetheless, recent research suggests that simply pre-training a generic encoder can potentially surpass meta-learning algorithms.", "key_contribution": "We propose DRESS, a task-agnostic Disentangled REpresentation-based Self-Supervised meta-learning approach that enables fast model adaptation on highly diversified few-shot learning tasks.", "why_it_matters": "DRESS: Disentangled Representation-based Self-Supervised Meta-Learning for Diverse Tasks advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We propose DRESS, a task-agnostic Disentangled REpresentation-based Self-Supervised meta-learning approach that enables…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2503.09679", "difficulty": "advanced" }, { "id": "arxiv:2606.26201", "source": "arxiv", "source_type": "preprint", "title": "OmniContact: Chaining Meta-Skills via Contact Flow for Generalizable Humanoid Loco-Manipulation", "abstract": "Learning long-horizon humanoid loco-manipulation poses a dual challenge: it requires not only the robust execution of meta-skills but also their seamless, closed-loop chaining equipped with autonomous recovery. Existing approaches remain limited: explicit humanoid-object interaction representations offer precision but are notoriously difficult for high-level planning, whereas implicit skill embeddings are compact but lack the interpretability required for reliable composition. We propose \\ours, a hierarchical framework centered on \\textbf{contact flow (CF)}, a compact representation consisting of key body trajectories and time-series binary contact signals. Leveraging this shared interface, our low-level policy \\textbf{CF-Track} learns a unified library of loco-manipulation skills, while our high-level module \\textbf{CF-Gen} heuristically synthesizes future contact-flow sequences. To support this setting, we additionally collect the OmniContact dataset, a MoCap-based HOI corpus for humanoid loco-manipulation (Appendix~\\ref{sec:dataset}). Together, they enable robust execution, autonomous failure recovery, and flexible composition of meta-skills for long-horizon tasks. Experiments show that OmniContact achieves \\(98.7\\%\\) success on \\textit{Carry Box} and \\(76.5\\%\\) on \\textit{Push-Stack Boxes}, outperforming prior baselines by average margins of \\(40.9\\%\\) in meta-skill and \\(66.5\\%\\) in skill chaining. Besides, our framework naturally integrates with VLMs for semantic task decomposition, enabling complex, semantically grounded loco-manipulation behaviors, such as arranging scattered boxes into a heart shape.", "authors": [ "Runyi Yu", "Xiaoyi Lin", "Ji Ma", "Yinhuai Wang", "Koukou Luo", "Jiahao Ji", "Huayi Wang", "Wenjia Wang", "Runhan Zhang", "Ping Tan", "Ting Wu", "Ruoli Dai", "Qifeng Chen", "Lei Han" ], "year": 2026, "published_date": "2026-06-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.26201", "pdf_url": "https://arxiv.org/pdf/2606.26201", "citations": 0, "topics": [], "tags": [ "Robotics", "Interpretability" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.01, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Learning long-horizon humanoid loco-manipulation poses a dual challenge: it requires not only the robust execution of meta-skills but also their seamless, closed-loop chaining equipped with autonomous recovery. Existing approaches remain limited: explicit humanoid-object interaction representations offer precision but are notoriously difficult for high-level planning, whereas implicit skill embeddings are compact but lack the interpretability required for reliable composition.", "key_contribution": "We propose \\ours, a hierarchical framework centered on \\textbf{contact flow (CF)}, a compact representation consisting of key body trajectories and time-series binary contact signals.", "why_it_matters": "OmniContact: Chaining Meta-Skills via Contact Flow for Generalizable Humanoid Loco-Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We propose \\ours, a hierarchical framework centered on \\textbf{contact flow (CF)}, a compact representation consisting…", "biggest_caveat": "but also their seamless, closed-loop chaining equipped with autonomous recovery.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2606.26201", "difficulty": "intermediate" }, { "id": "arxiv:2601.04181", "source": "arxiv", "source_type": "preprint", "title": "Lightweight Test-Time Adaptation for EMG-Based Gesture Recognition", "abstract": "Reliable long-term decoding of gestures from surface electromyography (EMG) is hindered by signal drift caused by electrode displacement, muscle fatigue, and/or posture changes. Although modern models achieve high intra-session accuracy, their performance often degrades substantially across recording sessions. Existing approaches to mitigate this problem typically rely on large training datasets or computationally intensive pipelines that are unsuitable for energy-efficient wearable devices. We propose a lightweight test-time adaptation framework for EMG decoding. The framework includes three complementary adaptation strategies: (i) causal adaptive batch normalization for online statistical alignment, (ii) Gaussian Mixture Model alignment with experience replay to mitigate forgetting, and (iii) meta-learning for rapid few-shot calibration. We evaluate these methods on the multi-session NinaPro DB6 dataset. All approaches substantially improve inter-session robustness relative to a non-adaptive baseline while maintaining low computational overhead. Replay-regularized statistical alignment provides the most stable adaptation under limited data, while meta-learning achieves the highest accuracy when sparse calibration labels are available. Overall, our self-supervised test-time adaptation methods reach up to 82% inter-session accuracy, significantly improving upon prior approaches while maintaining resource-efficient operation. These results demonstrate that lightweight test-time adaptation can enable robust, long-term EMG decoding for wearable or prosthetic applications.", "authors": [ "Nia Touko", "Matthew O A Ellis", "Cristiano Capone", "Alessio Burrello", "Elisa Donati", "Luca Manneschi" ], "year": 2026, "published_date": "2026-06-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.04181", "pdf_url": "https://arxiv.org/pdf/2601.04181", "citations": 0, "topics": [], "tags": [ "Prompting", "AI Safety", "Self-Supervised", "Machine Learning", "Human-Computer Interaction" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.39, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reliable long-term decoding of gestures from surface electromyography (EMG) is hindered by signal drift caused by electrode displacement, muscle fatigue, and/or posture changes. Although modern models achieve high intra-session accuracy, their performance often degrades substantially across recording sessions.", "key_contribution": "Although modern models achieve high intra-session accuracy, their performance often degrades substantially across recording sessions.", "why_it_matters": "Lightweight Test-Time Adaptation for EMG-Based Gesture Recognition represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "Although modern models achieve high intra-session accuracy, their performance often degrades substantially across…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2601.04181", "difficulty": "advanced" }, { "id": "arxiv:2606.21100", "source": "arxiv", "source_type": "preprint", "title": "Factor-Aware Mixture-of-Experts with Pretrained Encoder for Combinatorial Generalization", "abstract": "The integration of pretrained encoders with diffusion policies has become a dominant paradigm for visual robotic manipulation. However, it still struggles to generalize across complex environments with varying factors such as lighting and surface textures. To address this, we propose FAME, a framework that integrates a factor-aware mixture-of-experts (MoE) with a pretrained encoder to enhance generalization to environmental variations. FAME follows a three-stage training process: (1) policy warmup, where a diffusion policy is trained on standard-environment data with a frozen encoder; (2) factor-specific adapter training, where lightweight adapters inserted between the frozen encoder and the temporarily frozen policy are trained on customized datasets, each targeting a distinct environmental variation; and (3) joint fine-tuning, where a central router and the warmed policy are trained on mixed data to handle multiple factors jointly. FAME is ``factor-aware'' because the central router softly weights frozen factor-specific adapters as a dense MoE, enabling combinatorial generalization across multiple factors. Evaluations on the Meta-World benchmark show that FAME outperforms diffusion policy baselines by 34%. We further validate FAME in a real-world pick-and-place task using a compact model trained on newly collected data, where FAME achieves a 35% improvement in generalization under real-world variations.", "authors": [ "Feihong Zhang", "Guojian Zhan", "Zeyu He", "Yinuo Wang", "Likun Wang", "Tianze Zhu", "Yao Lyu", "Tao Zhang", "Tinghao Yi", "Wei You", "Shengbo Eben Li" ], "year": 2026, "published_date": "2026-06-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.21100", "pdf_url": "https://arxiv.org/pdf/2606.21100", "citations": 0, "topics": [], "tags": [ "MoE", "Fine-Tuning", "Robotics", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.61, "content_potential_score": 3.15, "interestingness_score": 3.13, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The integration of pretrained encoders with diffusion policies has become a dominant paradigm for visual robotic manipulation. However, it still struggles to generalize across complex environments with varying factors such as lighting and surface textures.", "key_contribution": "To address this, we propose FAME, a framework that integrates a factor-aware mixture-of-experts (MoE) with a pretrained encoder to enhance generalization to environmental variations.", "why_it_matters": "Factor-Aware Mixture-of-Experts with Pretrained Encoder for Combinatorial Generalization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about MoE.", "one_line_takeaway": "To address this, we propose FAME, a framework that integrates a factor-aware mixture-of-experts (MoE) with a pretrained…", "biggest_caveat": "However, it still struggles to generalize across complex environments with varying factors such as lighting and surface textures.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in MoE.", "url": "https://arxiv.org/abs/2606.21100", "difficulty": "beginner" }, { "id": "arxiv:2602.10635", "source": "arxiv", "source_type": "preprint", "title": "OmniSapiens: A Foundation Model for Social Behavior Processing via Heterogeneity-Aware Relative Policy Optimization", "abstract": "Socially intelligent AI systems must entail reasoning across diverse human behavioral tasks, and generalization to new contexts. However, AI has yet to achieve this level of social intelligence. Existing models remain fundamentally constrained by the imbalanced learning dynamics induced by training on behavioral data. Namely, behavioral data is inherently heterogeneous, comprising diverse modalities and prediction targets that often produce uneven training signals across samples. To address this, we develop Omnisapiens-7B 2.0, a foundation model for social behavior processing that explicitly addresses learning from heterogeneous behavioral data. This is enabled through Heterogeneity-Aware Relative Policy Optimization, a novel reasoning RL method that explicitly rebalances learning signals across samples. The core insight is to approximate contribution signals to the policy update, using them to inform geometrically centered and intertially smoothed advantage modulation. Results demonstrate that Omnisapiens-7B 2.0 achieves the best and most consistent performance across 10 diverse behavioral tasks, while also attaining the best performance on all five held-out zero-shot generalization benchmarks, with gains of up to +12.02% and +9.37% respectively. Furthermore, Omnisapiens-7B 2.0 demonstrates more consistent and interpretable reasoning traces, supporting reliable real-world behavioral applications. Our model and codes can be found at https://github.com/MIT-MI/human_behavior_atlas.", "authors": [ "Keane Ong", "Sabri Boughorbel", "Luwei Xiao", "Chanakya Ekbote", "Wei Dai", "Ao Qu", "Jingyao Wu", "Rui Mao", "Ehsan Hoque", "Erik Cambria", "Gianmarco Mengaldo", "Paul Pu Liang" ], "year": 2026, "published_date": "2026-05-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.10635", "pdf_url": "https://arxiv.org/pdf/2602.10635", "citations": 0, "topics": [], "tags": [ "Reasoning", "Interpretability", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.08, "content_potential_score": 0.97, "interestingness_score": 2.04, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Socially intelligent AI systems must entail reasoning across diverse human behavioral tasks, and generalization to new contexts. However, AI has yet to achieve this level of social intelligence.", "key_contribution": "However, AI has yet to achieve this level of social intelligence.", "why_it_matters": "OmniSapiens: A Foundation Model for Social Behavior Processing via Heterogeneity-Aware Relative Policy Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "However, AI has yet to achieve this level of social intelligence.", "biggest_caveat": "However, AI has yet to achieve this level of social intelligence.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2602.10635", "difficulty": "beginner" }, { "id": "arxiv:2606.04171", "source": "arxiv", "source_type": "preprint", "title": "MimeLens: Position-Agnostic Content-Type Detection for Binary Fragments", "abstract": "File-type classification underlies many workflows like malware triage, forensic carving, packet inspection, and storage indexing. Learned systems such as Google's Magika assume whole-file access at a known offset, so they break on the inputs many of these tasks actually produce, like a single packet payload, a header-less carved fragment, a random disk block, or a chunked upload. We introduce MimeLens, a family of small BERT-style encoders pretrained on binary content from windows sampled at a uniformly random offset within each file, with no privileged head-of-file position, in standard- and short-context variants. A byte chunk goes in from anywhere in a file, no header needed and no fixed size; out comes one of libmagic's 125 MIME labels. On the clean head of complete files, MimeLens beats Magika v1.1 by +10.7 pp top-1 on libmagic-labeled data, and it keeps classifying where Magika cannot: from a single mid-stream UDP packet, and more than twice as accurately as libmagic and Magika on random mid-file disk blocks. The cost is latency: MimeLens runs roughly one to two orders of magnitude slower per sample on CPU than Magika, though it matches on consumer GPUs or in batch. All trained checkpoints are released on Hugging Face (mjbommar/mimelens-001-*).", "authors": [ "Michael J. Bommarito" ], "year": 2026, "published_date": "2026-06-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.04171", "pdf_url": "https://arxiv.org/pdf/2606.04171", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence", "Machine Learning", "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.03, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "File-type classification underlies many workflows like malware triage, forensic carving, packet inspection, and storage indexing. Learned systems such as Google's Magika assume whole-file access at a known offset, so they break on the inputs many of these tasks actually produce, like a single packet payload, a header-less carved fragment, a random disk block, or a chunked upload.", "key_contribution": "We introduce MimeLens, a family of small BERT-style encoders pretrained on binary content from windows sampled at a uniformly random offset within each file, with no privileged head-of-file position, in standard- and short-context variants.", "why_it_matters": "MimeLens: Position-Agnostic Content-Type Detection for Binary Fragments represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We introduce MimeLens, a family of small BERT-style encoders pretrained on binary content from windows sampled at a…", "biggest_caveat": "cannot: from a single mid-stream UDP packet, and more than twice as accurately as libmagic and Magika on random mid-file disk blocks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2606.04171", "difficulty": "intermediate" }, { "id": "arxiv:2605.10052", "source": "arxiv", "source_type": "preprint", "title": "Swarm Skills: A Portable, Self-Evolving Multi-Agent System Specification for Coordination Engineering", "abstract": "As artificial intelligence engineering paradigms shift from single-agent Prompt and Context Engineering toward multi-agent \\textbf{Coordination Engineering}, the ability to codify and systematically improve how multiple agents collaborate has emerged as a critical bottleneck. While single-agent skills can now be distributed as portable assets, multi-agent coordination protocols remain locked within framework-internal code or static configurations, preventing them from being shared across systems or autonomously improved over time. We propose \\textbf{Swarm Skills}, a portable specification that extends the Anthropic Skills standard with multi-agent semantics. Swarm Skills turns multi-agent workflows into first-class, distributable assets that consist of roles, workflows, execution bounds, and a built-in semantic structure for self-evolution. To operationalize the specification's evolving nature, we present a companion self-evolution algorithm that automatically distills successful execution trajectories into new Swarm Skills and continuously patches existing ones based on multi-dimensional scoring (Effectiveness, Utilization, and Freshness), eliminating the need for human-in-the-loop oversight during the refinement process. Through an architectural compatibility analysis and a comprehensive qualitative case study using the open-source JiuwenSwarm reference implementation, we demonstrate how Swarm Skills achieves zero-adapter cross-agent portability via progressive disclosure, enabling agent teams to self-evolve their coordination strategies without framework lock-in.", "authors": [ "Xinyu Zhang", "Zhicheng Dou", "Deyang Li", "Jianjun Tao", "Shuo Cheng", "Ruifeng Shi", "Fangchao Liu", "Enrui Hu", "Yangkai Ding", "Hongbo Wang", "Qi Ye", "Xuefeng Jin", "Zhangchun Zhao" ], "year": 2026, "published_date": "2026-05-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.10052", "pdf_url": "https://arxiv.org/pdf/2605.10052", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence", "NLP" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.53, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "As artificial intelligence engineering paradigms shift from single-agent Prompt and Context Engineering toward multi-agent \\textbf{Coordination Engineering}, the ability to codify and systematically improve how multiple agents collaborate has emerged as a critical bottleneck. While single-agent skills can now be distributed as portable assets, multi-agent coordination protocols remain locked within framework-internal code or static configurations, preventing them from being shared across systems or autonomously improved over time.", "key_contribution": "We propose \\textbf{Swarm Skills}, a portable specification that extends the Anthropic Skills standard with multi-agent semantics.", "why_it_matters": "Swarm Skills: A Portable, Self-Evolving Multi-Agent System Specification for Coordination Engineering represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We propose \\textbf{Swarm Skills}, a portable specification that extends the Anthropic Skills standard with multi-agent…", "biggest_caveat": "butable assets that consist of roles, workflows, execution bounds, and a built-in semantic structure for self-evolution.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2605.10052", "difficulty": "intermediate" }, { "id": "arxiv:2604.00852v1", "source": "arxiv", "source_type": "preprint", "title": "PanoAir: A Panoramic Visual-Inertial SLAM with Cross-Time Real-World UAV Dataset", "abstract": "Accurate pose estimation is fundamental for unmanned aerial vehicle (UAV) applications, where Visual-Inertial SLAM (VI-SLAM) provides a cost-effective solution for localization and mapping. However, existing VI-SLAM methods mainly rely on sensors with limited fields of view (FoV), which can lead to drift and even failure in complex UAV scenarios. Although panoramic cameras provide omnidirectional perception to improve robustness, panoramic VI-SLAM and corresponding real-world datasets for UAVs remain underexplored. To address this limitation, we first construct a real-world panoramic visual-inertial dataset covering diverse flight conditions, including varying illumination, altitudes, trajectory lengths, and motion dynamics. To achieve accurate and robust pose estimation under such challenging UAV scenarios, we propose a panoramic VI-SLAM framework that exploits the omnidirectional FoV via the proposed panoramic feature extraction and panoramic loop closure, enhancing feature constraints and ensuring global consistency. Extensive experiments on both the proposed dataset and public benchmarks demonstrate that our method achieves superior accuracy, robustness, and consistency compared to existing approaches. Moreover, deployment on embedded platform validates its practical applicability, achieving comparable computational efficiency to PC implementations. The source code and dataset are publicly available at https://drive.google.com/file/d/1lG1Upn6yi-N6tYpEHAt6dfR1uhzNtWbT/view", "authors": [ "Yiyang Wu", "Xiaohu Zhang", "Yanjin Du", "Tongsu Zhang", "Chujun Li", "Siyang Chen", "Guoyi Zhang", "Xiangpeng Xu" ], "year": 2026, "published_date": "2026-04-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.00852v1", "pdf_url": "https://arxiv.org/pdf/2604.00852v1", "citations": 0, "topics": [], "tags": [ "Robotics", "Evaluation", "Benchmarking & Evaluation" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 6.21, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Accurate pose estimation is fundamental for unmanned aerial vehicle (UAV) applications, where Visual-Inertial SLAM (VI-SLAM) provides a cost-effective solution for localization and mapping. However, existing VI-SLAM methods mainly rely on sensors with limited fields of view (FoV), which can lead to drift and even failure in complex UAV scenarios.", "key_contribution": "To achieve accurate and robust pose estimation under such challenging UAV scenarios, we propose a panoramic VI-SLAM framework that exploits the omnidirectional FoV via the proposed panoramic feature extraction and panoramic loop closure, enhancing feature constraints and ensuring global consistency.", "why_it_matters": "PanoAir: A Panoramic Visual-Inertial SLAM with Cross-Time Real-World UAV Dataset represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "To achieve accurate and robust pose estimation under such challenging UAV scenarios, we propose a panoramic VI-SLAM…", "biggest_caveat": "However, existing VI-SLAM methods mainly rely on sensors with limited fields of view (FoV), which can lead to drift and even failure in complex UAV scenarios.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Robotics.", "url": "http://arxiv.org/abs/2604.00852v1", "difficulty": "beginner" }, { "id": "arxiv:2605.23196", "source": "arxiv", "source_type": "preprint", "title": "Prompt Overflow: What the Guardrail Inspects Is Not What the Model Infers", "abstract": "Guardrail models (a.k.a. safety checkers) are widely deployed to screen user inputs before they reach large language models (LLMs), serving as a primary defense against prompt injection attacks. Due to strict context constraints, these models handle overlength prompts through truncation or segmentation-based inspection. While prior work has focused on semantic adversarial inputs, the security implications of these long-input processing mechanisms remain largely unexplored. In this paper, we identify a critical blind spot arising from the mismatch between the limited inspection windows of guardrail models and the substantially larger context inference windows of downstream LLMs. We introduce a novel Prompt Overflow Attack, which exploits this mismatch by fragmenting malicious instructions and interleaving them with benign filler content across an overlong prompt, such that no individual inspected segment appears malicious while the full context remains actionable to the LLM. Through a systematic evaluation against state-of-the-art guardrail models, including Meta Llama Prompt Guard, IBM Granite Guardian, and DeBERTa-based detectors, we demonstrate that prompts reliably detected in short-context settings can evade guardrail models once adversarially manipulated into over-length inputs, yet remain fully actionable by downstream LLMs. We further propose potential defense strategies and outline mitigation directions to strengthen guardrail models.", "authors": [ "Yuanbo Zhou", "Changjia Zhu", "Junyu Wang", "Xu He", "Yan Zhai", "Kun Sun", "Mingkui Wei", "Junjie Xiong" ], "year": 2026, "published_date": "2026-05-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.23196", "pdf_url": "https://arxiv.org/pdf/2605.23196", "citations": 0, "topics": [], "tags": [ "LLMs", "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.56, "content_potential_score": 0.84, "interestingness_score": 1.98, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Guardrail models (a.k.a. safety checkers) are widely deployed to screen user inputs before they reach large language models (LLMs), serving as a primary defense against prompt injection attacks.", "key_contribution": "We introduce a novel Prompt Overflow Attack, which exploits this mismatch by fragmenting malicious instructions and interleaving them with benign filler content across an overlong prompt, such that no individual inspected segment appears malicious while the full context remains actionable to the LLM.", "why_it_matters": "Prompt Overflow: What the Guardrail Inspects Is Not What the Model Infers represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce a novel Prompt Overflow Attack, which exploits this mismatch by fragmenting malicious instructions and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.23196", "difficulty": "intermediate" }, { "id": "arxiv:2604.19993v1", "source": "arxiv", "source_type": "preprint", "title": "Algorithm and Hardware Co-Design for Efficient Complex-Valued Uncertainty Estimation", "abstract": "Complex-Valued Neural Networks (CVNNs) have significant advantages in handling tasks that involve complex numbers. However, existing CVNNs are unable to quantify predictive uncertainty. We propose, for the first time, dropout-based Bayesian Complex-Valued Neural Networks (BayesCVNNs) to enable uncertainty quantification for complex-valued applications, exhibiting broad applicability and efficiency for hardware implementation due to modularity. Furthermore, as the dual-part nature of complex values significantly broadens the design space and enables novel configurations based on layer-mixing and part-mixing, we introduce an automated search approach to effectively identify optimal configurations for both real and imaginary components. To facilitate deployment, we present a framework that generates customized FPGA-based accelerators for BayesCVNNs, leveraging a set of optimized building blocks. Experiments demonstrate the best configuration can be effectively found via the automated search, attaining higher performance with lower hardware costs compared with manually crafted models. The optimized accelerators achieve approximately 4.5x and 13x speedups on different models with less than 10% power consumption compared to GPU implementations, and outperform existing work in both algorithm and hardware aspects. Our code is publicly available at: https://github.com/zehuanzhang/BayesCVNN.git.", "authors": [ "Zehuan Zhang", "Mark Chen", "He Li", "Wayne Luk" ], "year": 2026, "published_date": "2026-04-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.19993v1", "pdf_url": "https://arxiv.org/pdf/2604.19993v1", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.36, "content_potential_score": 1.0, "interestingness_score": 2.06, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Complex-Valued Neural Networks (CVNNs) have significant advantages in handling tasks that involve complex numbers. However, existing CVNNs are unable to quantify predictive uncertainty.", "key_contribution": "We propose, for the first time, dropout-based Bayesian Complex-Valued Neural Networks (BayesCVNNs) to enable uncertainty quantification for complex-valued applications, exhibiting broad applicability and efficiency for hardware implementation due to modularity.", "why_it_matters": "Algorithm and Hardware Co-Design for Efficient Complex-Valued Uncertainty Estimation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "We propose, for the first time, dropout-based Bayesian Complex-Valued Neural Networks (BayesCVNNs) to enable…", "biggest_caveat": "However, existing CVNNs are unable to quantify predictive uncertainty.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Machine Learning.", "url": "http://arxiv.org/abs/2604.19993v1", "difficulty": "frontier" }, { "id": "arxiv:2605.30769", "source": "arxiv", "source_type": "preprint", "title": "DisPlace: Discriminative Place Projections for Multi-Reference Visual Place Recognition", "abstract": "A key challenge in Visual Place Recognition (VPR) is matching query images against reference maps captured under diverse environmental conditions and viewpoints. While multiple reference traversals improve robustness, existing fusion strategies either aggregate references uniformly or rely on heuristic selection, without distinguishing descriptor variations that preserve stable place identity from those caused by changing conditions or viewpoints. In this paper, we propose DisPlace, a multi-reference VPR framework that fuses multiple reference descriptors into a single compact and discriminative place representation. DisPlace formulates descriptor fusion as a generalized eigenvalue problem that maximizes between-place separability while suppressing within-place variation across references, rather than preserving overall descriptor variance. Unlike existing multi-reference fusion methods, DisPlace exploits variation across reference traversals to identify which linear combinations of descriptor dimensions preserve place identity and which capture condition- or viewpoint-specific variation. We evaluate DisPlace on Oxford RobotCar, Nordland, Pittsburgh30k, and Google Landmarks v2 across six state-of-the-art VPR descriptors. DisPlace outperforms seven multi-reference baselines in 49 out of 54 appearance-varying conditions, consistently improves descriptor-level fusion performance under viewpoint and unstructured settings, and requires less storage during inference than all compared fusion methods.", "authors": [ "Dhyey Manish Rajani", "Michael Milford", "Tobias Fischer" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.30769", "pdf_url": "https://arxiv.org/pdf/2605.30769", "citations": 0, "topics": [], "tags": [ "Robotics", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses eigenvalue and related concepts.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.02, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "A key challenge in Visual Place Recognition (VPR) is matching query images against reference maps captured under diverse environmental conditions and viewpoints. While multiple reference traversals improve robustness, existing fusion strategies either aggregate references uniformly or rely on heuristic selection, without distinguishing descriptor variations that preserve stable place identity from those caused by changing conditions or viewpoints.", "key_contribution": "In this paper, we propose DisPlace, a multi-reference VPR framework that fuses multiple reference descriptors into a single compact and discriminative place representation.", "why_it_matters": "DisPlace: Discriminative Place Projections for Multi-Reference Visual Place Recognition advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "In this paper, we propose DisPlace, a multi-reference VPR framework that fuses multiple reference descriptors into a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2605.30769", "difficulty": "frontier" }, { "id": "arxiv:2605.09806", "source": "arxiv", "source_type": "preprint", "title": "LEAD: Length-Efficient Adaptive and Dynamic Reasoning for Large Language Models", "abstract": "Large reasoning models, such as OpenAI o1 and DeepSeek-R1, tend to become increasingly verbose as their reasoning capabilities improve. These inflated Chain-of-Thought (CoT) trajectories often exceed what the underlying problems require, wasting compute, latency, and context budgets. While introducing length-based efficiency rewards during reinforcement learning offers a natural remedy, existing methods struggle with two fundamental challenges: the optimal balance between correctness and efficiency is non-stationary throughout training, and intrinsic reasoning budgets vary drastically across problems. Relying on static reward weights and global length constraints inevitably forces a compromise between degraded accuracy and unrealized compression. To overcome these limitations, we propose LEAD (Length-Efficient Adaptive and Dynamic reasoning), a method that replaces static heuristics with online, self-adaptive mechanisms. LEAD dynamically calibrates the correctness-efficiency trade-off at each step using a Potential-Scaled Instability, directing optimization capacity to the most informative learning signal. Furthermore, it estimates an adaptive per-problem target length online based on the model's own correct rollouts, applying a symmetric efficiency reward that penalizes both overthinking and over-compression. Evaluated on five mathematical reasoning benchmarks, LEAD achieves the highest accuracy and Accuracy-Efficiency Score among RL-trained efficient-reasoning methods while producing substantially shorter outputs than the base model.", "authors": [ "Songtao Wei", "Yi Li", "Zhikai Li", "Xu Hu", "Yuede Ji", "Guanpeng Li", "Feng Chen", "Carl Yang", "Zhichun Guo", "Bingzhe Li" ], "year": 2026, "published_date": "2026-05-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.09806", "pdf_url": "https://arxiv.org/pdf/2605.09806", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "RL", "Evaluation", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.08, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large reasoning models, such as OpenAI o1 and DeepSeek-R1, tend to become increasingly verbose as their reasoning capabilities improve. These inflated Chain-of-Thought (CoT) trajectories often exceed what the underlying problems require, wasting compute, latency, and context budgets.", "key_contribution": "To overcome these limitations, we propose LEAD (Length-Efficient Adaptive and Dynamic reasoning), a method that replaces static heuristics with online, self-adaptive mechanisms.", "why_it_matters": "LEAD: Length-Efficient Adaptive and Dynamic Reasoning for Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To overcome these limitations, we propose LEAD (Length-Efficient Adaptive and Dynamic reasoning), a method that…", "biggest_caveat": "limitations, we propose LEAD (Length-Efficient Adaptive and Dynamic reasoning), a method that replaces static heuristics with online, self-adaptive mechanisms.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.09806", "difficulty": "beginner" }, { "id": "arxiv:2604.05531v1", "source": "arxiv", "source_type": "preprint", "title": "Simulation-Driven Evolutionary Motion Parameterization for Contact-Rich Granular Scooping with a Soft Conical Robotic Hand", "abstract": "Tool-based scooping is vital in robot-assisted tasks, enabling interaction with objects of varying sizes, shapes, and material states. Recent studies have shown that flexible, reconfigurable soft robotic end-effectors can adapt their shape to maintain consistent contact with container surfaces during scooping, improving efficiency compared to rigid tools. These soft tools can adjust to varying container sizes and materials without requiring complex sensing or control. However, the inherent compliance and complex deformation behavior of soft robotics introduce significant control complexity that limits practical applications. To address this challenge, this paper presents the development of a physics-based simulation model of a deformable soft conical robotic hand that captures its passive reconfiguration dynamics and enables systematic trajectory optimization for scooping tasks. We propose a novel physics-based simulation approach that accurately models the soft tool's morphing behavior from flat sheets to adaptive conical structures, combined with an evolutionary strategy framework that automatically optimizes scooping trajectories without manual parameter tuning. We validate the optimized trajectories through both simulation and real-robot experiments. The results demonstrate strong generalization and successfully address a range of challenging tasks previously beyond the reach of existing approaches. Videos of our experiments are available online: https://sites.google.com/view/scoopsh", "authors": [ "Yongliang Wang", "Cristian C. Beltran-Hernandez", "Tomoya Takahashi", "Masashi Hamaya" ], "year": 2026, "published_date": "2026-04-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.05531v1", "pdf_url": "https://arxiv.org/pdf/2604.05531v1", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Robotics", "Robotics & Embodied AI", "Information Extraction" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.17, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Tool-based scooping is vital in robot-assisted tasks, enabling interaction with objects of varying sizes, shapes, and material states. Recent studies have shown that flexible, reconfigurable soft robotic end-effectors can adapt their shape to maintain consistent contact with container surfaces during scooping, improving efficiency compared to rigid tools.", "key_contribution": "However, the inherent compliance and complex deformation behavior of soft robotics introduce significant control complexity that limits practical applications.", "why_it_matters": "Simulation-Driven Evolutionary Motion Parameterization for Contact-Rich Granular Scooping with a Soft Conical Robotic Hand represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "However, the inherent compliance and complex deformation behavior of soft robotics introduce significant control…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "http://arxiv.org/abs/2604.05531v1", "difficulty": "intermediate" }, { "id": "arxiv:2504.00663", "source": "arxiv", "source_type": "preprint", "title": "Searching on a Budget: HW-NAS with 10 Latency Probes", "abstract": "Existing hardware-aware NAS (HW-NAS) methods typically assume access to precise information circa the target device, either via analytical approximations of the post-compilation latency model, or through learned latency predictors. Such approximate approaches risk introducing estimation errors that may prove detrimental in risk-sensitive applications. In this work, we propose a two-stage HW-NAS framework, in which we first learn an architecture controller on a distribution of synthetic devices, and then directly deploy the controller on a target device. At test-time, our network controller deploys directly to the target device without relying on any pre-collected information, and only exploits direct interactions. In particular, the pre-training phase on synthetic devices enables the controller to design an architecture for the target device by interacting with it through a small number of high-fidelity latency measurements. To guarantee accessibility of our method, we only train our controller with training-free accuracy proxies, allowing us to scale the meta-training phase without incurring the overhead of full network training. We benchmark on HW-NATS-Bench, demonstrating that our method generalizes to unseen devices and searches for latency-efficient architectures by in-context adaptation using only a few real-world latency evaluations at test-time.", "authors": [ "Francesco Capuano", "Gabriele Tiboni", "Niccolò Cavagnero", "Giuseppe Averta" ], "year": 2026, "published_date": "2026-05-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2504.00663", "pdf_url": "https://arxiv.org/pdf/2504.00663", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses nas and related concepts.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.04, "content_potential_score": 2.05, "interestingness_score": 2.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Existing hardware-aware NAS (HW-NAS) methods typically assume access to precise information circa the target device, either via analytical approximations of the post-compilation latency model, or through learned latency predictors. Such approximate approaches risk introducing estimation errors that may prove detrimental in risk-sensitive applications.", "key_contribution": "In this work, we propose a two-stage HW-NAS framework, in which we first learn an architecture controller on a distribution of synthetic devices, and then directly deploy the controller on a target device.", "why_it_matters": "Searching on a Budget: HW-NAS with 10 Latency Probes represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "In this work, we propose a two-stage HW-NAS framework, in which we first learn an architecture controller on a…", "biggest_caveat": "bution of synthetic devices, and then directly deploy the controller on a target device.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Self-Supervised.", "url": "https://arxiv.org/abs/2504.00663", "difficulty": "frontier" }, { "id": "arxiv:2602.09969", "source": "arxiv", "source_type": "preprint", "title": "Causal Multi-Task Demand Learning", "abstract": "We study a canonical multi-task demand-learning problem motivated by retail pricing, where a firm seeks to estimate heterogeneous linear price-response functions across multiple decision contexts. Each context is described by rich covariates but exhibits limited price variation, motivating transfer learning across tasks. A central challenge in leveraging cross-task transfer is endogeneity: prices may be arbitrarily correlated with unobserved task-level demand determinants across tasks. We propose a new meta-learning framework that identifies the conditional mean of task-specific causal demand parameters given a subset of task-specific observables despite such confounding, assuming that each task contains at least two distinct locally exogenous price points. This subset is carefully designed to include all of the prices to address cross-task confounding, while masking two demand outcomes that provide randomized supervision to address identifiability issues arising from the inclusion of all prices. We show that this information design is maximally uniformly valid, in that any refinement of the conditioning set that reveals withheld-outcome information is not guaranteed to identify the conditional mean causal target. We validate our method on real and synthetic data, demonstrating improved recovery of demand responses relative to standard transfer-learning baselines.", "authors": [ "Varun Gupta", "Vijay Kamble" ], "year": 2026, "published_date": "2026-05-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.09969", "pdf_url": "https://arxiv.org/pdf/2602.09969", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses multi-task — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.92, "content_potential_score": 1.1, "interestingness_score": 2.11, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We study a canonical multi-task demand-learning problem motivated by retail pricing, where a firm seeks to estimate heterogeneous linear price-response functions across multiple decision contexts. Each context is described by rich covariates but exhibits limited price variation, motivating transfer learning across tasks.", "key_contribution": "We propose a new meta-learning framework that identifies the conditional mean of task-specific causal demand parameters given a subset of task-specific observables despite such confounding, assuming that each task contains at least two distinct locally exogenous price points.", "why_it_matters": "Causal Multi-Task Demand Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "We propose a new meta-learning framework that identifies the conditional mean of task-specific causal demand parameters…", "biggest_caveat": "but exhibits limited price variation, motivating transfer learning across tasks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Machine Learning.", "url": "https://arxiv.org/abs/2602.09969", "difficulty": "advanced" }, { "id": "arxiv:2605.08437", "source": "arxiv", "source_type": "preprint", "title": "Magis-Bench: Evaluating LLMs on Magistrate-Level Legal Tasks", "abstract": "Existing benchmarks for legal AI focus primarily on tasks where LLMs must produce legal arguments or documents, yet the capacity to \\emph{judge} such arguments -- weighing competing claims, applying doctrine to facts, and rendering reasoned decisions -- is arguably as fundamental to a well-functioning legal system as advocacy itself. We introduce Magis-Bench, a benchmark for evaluating LLMs on magistrate-level writing tasks derived from recent Brazilian competitive examinations for judicial positions. Magis-Bench comprises 74 questions from eight examinations conducted between 2023 and 2025, including discursive legal analysis questions with multi-turn structure and practical exercises requiring the composition of complete civil and criminal judicial sentences. We evaluate 23 state-of-the-art LLMs using an LLM-as-a-judge methodology with four independent frontier models as evaluators. Our results show strong inter-judge agreement (Kendall's $W = 0.984$; pairwise Kendall's $τ\\ge 0.897$), with Google's Gemini-3-Pro-Preview achieving the highest average score (6.97/10), followed by Gemini-3-Flash-Preview (6.67) and Claude-4.5-Opus (6.46). Even the best-performing models score below 70\\% of the maximum, indicating that judicial-level legal reasoning and writing remain challenging for current LLMs. We release the complete benchmark, model outputs, and evaluation code to support further research on legal AI capabilities.", "authors": [ "Ramon Pires", "Thales Sales Almeida", "Celio Larcher Junior", "Giovana Bonás", "Hugo Abonizio", "Marcos Piau", "Roseval Malaquias Junior", "Thiago Laitz", "Rodrigo Nogueira" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.08437", "pdf_url": "https://arxiv.org/pdf/2605.08437", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Legal AI", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.57, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Existing benchmarks for legal AI focus primarily on tasks where LLMs must produce legal arguments or documents, yet the capacity to \\emph{judge} such arguments -- weighing competing claims, applying doctrine to facts, and rendering reasoned decisions -- is arguably as fundamental to a well-functioning legal system as advocacy itself. We introduce Magis-Bench, a benchmark for evaluating LLMs on magistrate-level writing tasks derived from recent Brazilian competitive examinations for judicial positions.", "key_contribution": "We introduce Magis-Bench, a benchmark for evaluating LLMs on magistrate-level writing tasks derived from recent Brazilian competitive examinations for judicial positions.", "why_it_matters": "Magis-Bench: Evaluating LLMs on Magistrate-Level Legal Tasks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Magis-Bench, a benchmark for evaluating LLMs on magistrate-level writing tasks derived from recent…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.08437", "difficulty": "beginner" }, { "id": "arxiv:2604.07675v1", "source": "arxiv", "source_type": "preprint", "title": "FireSenseNet: A Dual-Branch CNN with Cross-Attentive Feature Interaction for Next-Day Wildfire Spread Prediction", "abstract": "Accurate prediction of next-day wildfire spread is critical for disaster response and resource allocation. Existing deep learning approaches typically concatenate heterogeneous geospatial inputs into a single tensor, ignoring the fundamental physical distinction between static fuel/terrain properties and dynamic meteorological conditions. We propose FireSenseNet, a dual-branch convolutional neural network equipped with a novel Cross-Attentive Feature Interaction Module (CAFIM) that explicitly models the spatially varying interaction between fuel and weather modalities through learnable attention gates at multiple encoder scales. Through a systematic comparison of seven architectures -- spanning pure CNNs, Vision Transformers, and hybrid designs -- on the Google Next-Day Wildfire Spread benchmark, we demonstrate that FireSenseNet achieves an F1 of 0.4176 and AUC-PR of 0.3435, outperforming all alternatives including a SegFormer with 3.8* more parameters (F1 = 0.3502). Ablation studies confirm that CAFIM provides a 7.1% relative F1 gain over naive concatenation, and channel-wise feature importance analysis reveals that the previous-day fire mask dominates prediction while wind speed acts as noise at the dataset's coarse temporal resolution. We further incorporate Monte Carlo Dropout for pixel-level uncertainty quantification and present a critical analysis showing that common evaluation shortcuts inflate reported F1 scores by over 44%.", "authors": [ "Jinzhen Han", "JinByeong Lee", "Hak Han", "YeonJu Na", "Jae-Joon Lee" ], "year": 2026, "published_date": "2026-04-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.07675v1", "pdf_url": "https://arxiv.org/pdf/2604.07675v1", "citations": 0, "topics": [], "tags": [ "Transformers", "Interpretability", "Evaluation", "Transformer Architectures", "Benchmarking & Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 6.64, "content_potential_score": 1.95, "interestingness_score": 2.54, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Accurate prediction of next-day wildfire spread is critical for disaster response and resource allocation. Existing deep learning approaches typically concatenate heterogeneous geospatial inputs into a single tensor, ignoring the fundamental physical distinction between static fuel/terrain properties and dynamic meteorological conditions.", "key_contribution": "We propose FireSenseNet, a dual-branch convolutional neural network equipped with a novel Cross-Attentive Feature Interaction Module (CAFIM) that explicitly models the spatially varying interaction between fuel and weather modalities through learnable attention gates at multiple encoder scales.", "why_it_matters": "FireSenseNet: A Dual-Branch CNN with Cross-Attentive Feature Interaction for Next-Day Wildfire Spread Prediction extends Transformer capabilities — the architecture underpinning virtually every modern NLP and vision model.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "We propose FireSenseNet, a dual-branch convolutional neural network equipped with a novel Cross-Attentive Feature…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Transformers.", "url": "http://arxiv.org/abs/2604.07675v1", "difficulty": "beginner" }, { "id": "arxiv:2605.30568", "source": "arxiv", "source_type": "preprint", "title": "Generating and Refining Dynamic Evaluation Rubrics for LLM-as-a-Judge", "abstract": "LLM-as-a-Judge is a scalable alternative to human evaluation, yet existing rubric-based methods rely on human-annotated data such as reference answers or expert-crafted rubrics. We propose to automatically generate fine-grained evaluation rubrics without any human annotation. Our training-free method generates rubrics at dataset-specific and instance-specific granularities, achieving performance competitive with existing methods across four benchmarks. We further present a method that iteratively fine-tunes a rubric generator model via meta-judge reward signals. The fine-tuned generator outperforms all existing baselines in both pairwise and pointwise evaluation. Notably, a fine-tuned 14B rubric generator outperforms a much larger proprietary model at rubric generation, showing the effectiveness of our fine-tuning strategy.", "authors": [ "Zijie Wang", "Eduardo Blanco" ], "year": 2026, "published_date": "2026-05-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.30568", "pdf_url": "https://arxiv.org/pdf/2605.30568", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "Evaluation", "NLP" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.77, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "LLM-as-a-Judge is a scalable alternative to human evaluation, yet existing rubric-based methods rely on human-annotated data such as reference answers or expert-crafted rubrics. We propose to automatically generate fine-grained evaluation rubrics without any human annotation.", "key_contribution": "We propose to automatically generate fine-grained evaluation rubrics without any human annotation.", "why_it_matters": "Generating and Refining Dynamic Evaluation Rubrics for LLM-as-a-Judge represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose to automatically generate fine-grained evaluation rubrics without any human annotation.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.30568", "difficulty": "beginner" }, { "id": "arxiv:2605.23931", "source": "arxiv", "source_type": "preprint", "title": "BODHI: Precise OS Kernel Specification Inference", "abstract": "The formal verification of operating system kernels requires precise specifications that capture the intended behavior of system calls. Writing these specifications manually demands deep domain expertise, motivating the use of large language models (LLMs) to automate the process. However, in OSV-Bench, a benchmark of 245 specification generation tasks derived from the Hyperkernel OS kernel, the best reported Pass@1 is 55.10%. We propose a domain knowledge prompting method (BODHI), which augments the standard few-shot prompt with a structured C-to-Python translation guide covering 15 categories of domain-specific translation patterns. Inspired by Structured Chain-of-Thought (SCoT) prompting, the guide organizes translation by separation of concerns, addressing pre-condition extraction and post-condition generation as distinct categories. Evaluated on nine models from six providers (Anthropic, Mistral, Amazon, DeepSeek, Meta, Alibaba), covering dense, mixture-of-experts and reasoning architectures, BODHI improves every model tested, with gains ranging from +11% to +32%. The best configuration (Claude Opus 4.6 + BODHI) reaches 96.73% Pass@1. BODHI reduces both syntax and semantic errors, with the strongest effect on models that have sufficient instruction-following capability to utilize structured reference material. These results demonstrate that domain knowledge injection is a model-agnostic technique that substantially bridges the gap between general-purpose code generation and formal specification synthesis.", "authors": [ "Zhiming Chang", "Ziyang Li" ], "year": 2026, "published_date": "2026-04-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.23931", "pdf_url": "https://arxiv.org/pdf/2605.23931", "citations": 0, "topics": [], "tags": [ "Reasoning", "Prompting", "Code Generation", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 5.62, "content_potential_score": 2.05, "interestingness_score": 2.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The formal verification of operating system kernels requires precise specifications that capture the intended behavior of system calls. Writing these specifications manually demands deep domain expertise, motivating the use of large language models (LLMs) to automate the process.", "key_contribution": "We propose a domain knowledge prompting method (BODHI), which augments the standard few-shot prompt with a structured C-to-Python translation guide covering 15 categories of domain-specific translation patterns.", "why_it_matters": "BODHI: Precise OS Kernel Specification Inference represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We propose a domain knowledge prompting method (BODHI), which augments the standard few-shot prompt with a structured…", "biggest_caveat": "However, in OSV-Bench, a benchmark of 245 specification generation tasks derived from the Hyperkernel OS kernel, the best reported Pass@1 is 55.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.23931", "difficulty": "beginner" }, { "id": "arxiv:2605.17626", "source": "arxiv", "source_type": "preprint", "title": "Verifier-Guided Code Translation via Meta-Step Decoding", "abstract": "Test-time scaling is an important mechanism for improving large language models, especially on tasks with deterministic verifiers. Code translation is a canonical example: the source program constrains valid outputs, while compilers, type check- ers, and behavioral checks provide exact pass/fail feedback. Existing approaches typically apply these verifiers only after generation, which is inefficient because early errors corrupt the autoregressive context and are rarely corrected later. We introduce Decoding Time Verification (DTV), a framework that treats structural boundaries as meta steps for verifier-guided decoding. DTV interleaves generation with verifier calls under a state-machine controller that enforces valid prefixes, using structural-boundary checks and structure-aware rollback to prevent error propagation while reducing wasted tokens. We evaluate DTV on C-to-Rust and JavaScript-to-TypeScript translation. Using Qwen3-4B as the primary generator under matched token budgets, DTV improves pass rates from 72.3% to 82.0% on C-to-Rust and from 33.3% to 46.0% on JavaScript-to-TypeScript relative to matched self-refinement baselines, while using fewer tokens per case; the same trend largely transfers to Gemma-4-E4B. In the evaluated cost-matched grid, DTV achieves a more favorable pass-rate-cost tradeoff than post-hoc verification or sampling-based scaling. These results show that verifier-guided decoding is an effective use of inference-time compute for code translation.", "authors": [ "Tianyang Zhou", "Somesh Jha", "Mihai Christodorescu", "Kirill Levchenko", "Varun Chandrasekaran" ], "year": 2026, "published_date": "2026-05-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.17626", "pdf_url": "https://arxiv.org/pdf/2605.17626", "citations": 0, "topics": [], "tags": [ "LLMs", "Software Engineering", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.52, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Test-time scaling is an important mechanism for improving large language models, especially on tasks with deterministic verifiers. Code translation is a canonical example: the source program constrains valid outputs, while compilers, type check- ers, and behavioral checks provide exact pass/fail feedback.", "key_contribution": "We introduce Decoding Time Verification (DTV), a framework that treats structural boundaries as meta steps for verifier-guided decoding.", "why_it_matters": "Verifier-Guided Code Translation via Meta-Step Decoding represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Decoding Time Verification (DTV), a framework that treats structural boundaries as meta steps for…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.17626", "difficulty": "intermediate" }, { "id": "arxiv:2605.18327", "source": "arxiv", "source_type": "preprint", "title": "Causely: A Causal Intelligence Layer for Enterprise AI A Benchmark Study on SRE and Reliability Workflows", "abstract": "AI agents deployed into SRE workflows currently derive their understanding of environment state from raw observability telemetry at query time, paying a semantic-interpretation tax in tokens, latency, and inferential reliability. We propose Causely, a causal intelligence layer that maintains a structured representation of environment topology, attribute dependencies, and causal relationships that are anchroed to a ontological representation of the managed environment. Causely transforms raw telemetry into a live, queryable model providing the semantic and causal foundation AI agents require to diagnose, evaluate impact, and act safely in production. We evaluate this value proposition through a benchmark study conducted in a controlled setting with injected faults in a 24-microservice OpenTelemetry demo application. Our experiments compare four agent configurations (Claude Code, OpenAI Codex, HolmesGPT with Sonnet and Gemini backends). Experiments are run with and without access to Causely under two scenarios: an active incident and a healthy baseline. On the active-fault scenario, causal grounding reduces mean time-to-diagnosis by 63\\%, mean token consumption by 60\\%, and mean tool-call count by 78\\%, compressing the investigation footprint by 4.8$\\times$ and lowering direct API cost per run by 57\\%; root-cause-diagnosis accuracy rises from 75\\% to 100\\%.", "authors": [ "Dhairya Dalal", "Endre Sara", "Ben Yemini", "Christine Miller", "Shmuel Kliger" ], "year": 2026, "published_date": "2026-05-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.18327", "pdf_url": "https://arxiv.org/pdf/2605.18327", "citations": 0, "topics": [], "tags": [ "Hallucination", "AI Agents", "Code Generation", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 3.88, "content_potential_score": 2.34, "interestingness_score": 2.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "AI agents deployed into SRE workflows currently derive their understanding of environment state from raw observability telemetry at query time, paying a semantic-interpretation tax in tokens, latency, and inferential reliability. We propose Causely, a causal intelligence layer that maintains a structured representation of environment topology, attribute dependencies, and causal relationships that are anchroed to a ontological representation of the managed environment.", "key_contribution": "We propose Causely, a causal intelligence layer that maintains a structured representation of environment topology, attribute dependencies, and causal relationships that are anchroed to a ontological representation of the managed environment.", "why_it_matters": "Causely: A Causal Intelligence Layer for Enterprise AI A Benchmark Study on SRE and Reliability Workflows represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "We propose Causely, a causal intelligence layer that maintains a structured representation of environment topology,…", "biggest_caveat": "bute dependencies, and causal relationships that are anchroed to a ontological representation of the managed environment.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2605.18327", "difficulty": "frontier" }, { "id": "arxiv:2605.14167", "source": "arxiv", "source_type": "preprint", "title": "The Evaluation Trap: Benchmark Design as Theoretical Commitment", "abstract": "Every AI benchmark operationalizes theoretical assumptions about the capability it claims to assess. When assumptions function as unexamined commitments, benchmarks stabilize the dominant paradigm by narrowing what counts as progress. Over time, narrow evaluation reorganizes capability concepts: architectures and definitions are selected for benchmark legibility until evaluation ceases to track an independent object and instead produces a version of the target defined by its own operational assumptions. The result is a trap: evaluation frameworks treat self-reinforcing assessments as valid, both creating and obscuring structural limits on what the current paradigm can accomplish. We introduce Epistematics, a methodology for deriving evaluation criteria directly from technical capability claims and auditing whether proposed benchmarks can discriminate the claimed capability from proxy behaviors. The contribution is meta-evaluative: an audit procedure, a failure mode taxonomy, and benchmark-design criteria for evaluating capability-evaluation coherence. We demonstrate the procedure through a worked audit of Dupoux et al. (2026), a proposal that revises the dominant paradigm's theoretical assumptions at the architectural level while reproducing them in its evaluation criteria, thereby entrenching the constraint it seeks to overcome in a form the evaluation cannot detect.", "authors": [ "Theodore J Kalaitzidis" ], "year": 2026, "published_date": "2026-05-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.14167", "pdf_url": "https://arxiv.org/pdf/2605.14167", "citations": 0, "topics": [], "tags": [ "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 6.22, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Every AI benchmark operationalizes theoretical assumptions about the capability it claims to assess. When assumptions function as unexamined commitments, benchmarks stabilize the dominant paradigm by narrowing what counts as progress.", "key_contribution": "We introduce Epistematics, a methodology for deriving evaluation criteria directly from technical capability claims and auditing whether proposed benchmarks can discriminate the claimed capability from proxy behaviors.", "why_it_matters": "The Evaluation Trap: Benchmark Design as Theoretical Commitment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "We introduce Epistematics, a methodology for deriving evaluation criteria directly from technical capability claims and…", "biggest_caveat": "bution is meta-evaluative: an audit procedure, a failure mode taxonomy, and benchmark-design criteria for evaluating capability-evaluation coherence.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2605.14167", "difficulty": "beginner" }, { "id": "arxiv:2605.04426", "source": "arxiv", "source_type": "preprint", "title": "Telegraph English: Semantic Prompt Compression via Structured Symbolic Rewriting", "abstract": "We introduce Telegraph English (TE), a prompt-compression protocol that rewrites natural language into a symbol-rich, formally-structured dialect. Where token-deletion methods such as LLMLingua-2 train a classifier to delete low-importance tokens at a fixed ratio, TE performs a full semantic rewrite: it decomposes the input into atomic fact lines, substitutes verbose phrases with $\\sim$40 logical and relational symbols, and lets the compression ratio adapt to each document's information density. A consequence of the line-structure rule is that compression and semantic chunking become the same operation -- each output line is an independently addressable fact, so the compressed representation is simultaneously a semantic index. We evaluate TE on 4{,}081 question-answer pairs from LongBench-v2 across five OpenAI models and two difficulty levels. At roughly 50\\% token reduction, TE preserves 99.1\\% accuracy on key facts with GPT-4.1 and outperforms LLMLingua-2 at matched compression ratios on every model and task tested. The gap widens on smaller models -- up to 11 percentage points on fine-detail tasks -- suggesting that explicit relational structure compensates for limited model capacity. We release the grammar specification, compression prompt, benchmark data, and reference implementation.", "authors": [ "Mikhail L. Arbuzov", "Sisong Bei", "Ziwei Dong", "Dmitri Kalaev", "Alexey A. Shvets" ], "year": 2026, "published_date": "2026-05-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.04426", "pdf_url": "https://arxiv.org/pdf/2605.04426", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 6.04, "content_potential_score": 1.5, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce Telegraph English (TE), a prompt-compression protocol that rewrites natural language into a symbol-rich, formally-structured dialect. Where token-deletion methods such as LLMLingua-2 train a classifier to delete low-importance tokens at a fixed ratio, TE performs a full semantic rewrite: it decomposes the input into atomic fact lines, substitutes verbose phrases with $\\sim$40 logical and relational symbols, and lets the compression ratio adapt to each document's information density.", "key_contribution": "We introduce Telegraph English (TE), a prompt-compression protocol that rewrites natural language into a symbol-rich, formally-structured dialect.", "why_it_matters": "Telegraph English: Semantic Prompt Compression via Structured Symbolic Rewriting represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Telegraph English (TE), a prompt-compression protocol that rewrites natural language into a symbol-rich,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.04426", "difficulty": "beginner" }, { "id": "arxiv:2504.12612", "source": "arxiv", "source_type": "preprint", "title": "Chronology of Multi-Agent Interactions for Provenance of Evolving Information", "abstract": "Provenance is the chronological history of things, resonating with the fundamental pursuit to uncover origins, trace connections, and situate entities within the flow of space and time. As artificial intelligence advances towards autonomous agents capable of interactive collaboration on complex tasks, the provenance of generated content becomes entangled in the interplay of collective creation, where contributions are continuously revised, extended or overwritten. In a multi-agent generative chain, content undergoes successive transformations, often leaving little, if any, trace of prior contributions. In this study, we investigate the problem of tracking multi-agent provenance across the temporal dimension of generation. We propose a chronological system for post hoc attribution of generative history from content alone, without reliance on internal memory states or external meta-information. At its core lies the notion of symbolic chronicles, representing signed and time-stamped records, in a form analogous to the chain of custody in forensic science. The system operates through a feedback loop, whereby each generative timestep updates the chronicle of prior interactions and synchronises it with the synthetic content in the very act of generation. This research seeks to develop an accountable form of collaborative artificial intelligence within evolving cyber ecosystems.", "authors": [ "Ching-Chun Chang", "Isao Echizen" ], "year": 2026, "published_date": "2026-04-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2504.12612", "pdf_url": "https://arxiv.org/pdf/2504.12612", "citations": 0, "topics": [], "tags": [ "AI Agents", "Artificial Intelligence", "Cryptography & Security", "Multi-Agent Systems" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.49, "content_potential_score": 0.0, "interestingness_score": 1.56, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Provenance is the chronological history of things, resonating with the fundamental pursuit to uncover origins, trace connections, and situate entities within the flow of space and time. As artificial intelligence advances towards autonomous agents capable of interactive collaboration on complex tasks, the provenance of generated content becomes entangled in the interplay of collective creation, where contributions are continuously revised, extended or overwritten.", "key_contribution": "We propose a chronological system for post hoc attribution of generative history from content alone, without reliance on internal memory states or external meta-information.", "why_it_matters": "Chronology of Multi-Agent Interactions for Provenance of Evolving Information represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We propose a chronological system for post hoc attribution of generative history from content alone, without reliance…", "biggest_caveat": "butions are continuously revised, extended or overwritten.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2504.12612", "difficulty": "intermediate" }, { "id": "arxiv:2604.04511v1", "source": "arxiv", "source_type": "preprint", "title": "MedROI: Codec-Agnostic Region of Interest-Centric Compression for Medical Images", "abstract": "Medical imaging archives are growing rapidly in both size and resolution, making efficient compression increasingly important for storage and data transfer. Most existing codecs compress full images/volumes(including non-diagnostic background) or apply differential ROI coding that still preserves background bits. We propose MedROI, a codec-agnostic, plug-and-play ROI-centric framework that discards background voxels prior to compression. MedROI extracts a tight tissue bounding box via lightweight intensity-based thresholding and stores a fixed 54byte meta data record to enable spatial restoration during decompression. The cropped ROI is then compressed using any existing 2D or 3D codec without architectural modifications or retraining. We evaluate MedROI on 200 T1-weighted brain MRI volumes from ADNI using 6 codec configurations spanning conventional codecs (JPEG2000 2D/3D, HEIF) and neural compressors (LIC_TCM, TCM+AuxT, BCM-Net, SirenMRI). MedROI yields statistically significant improvements in compression ratio and encoding/decoding time for most configurations (two-sided t-test with multiple-comparison correction), while maintaining comparable reconstruction quality when measured within the ROI; HEIF is the primary exception in compression-ratio gains. For example, on JPEG20002D (lv3), MedROI improves CR from 20.35 to 27.37 while reducing average compression time from 1.701s to 1.380s. Code is available at https://github.com/labhai/MedROI.", "authors": [ "Jiwon Kim", "Ikbeom Jang" ], "year": 2026, "published_date": "2026-04-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.04511v1", "pdf_url": "https://arxiv.org/pdf/2604.04511v1", "citations": 0, "topics": [], "tags": [ "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.12, "read_first_score": 4.47, "content_potential_score": 0.42, "interestingness_score": 1.77, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Medical imaging archives are growing rapidly in both size and resolution, making efficient compression increasingly important for storage and data transfer. Most existing codecs compress full images/volumes(including non-diagnostic background) or apply differential ROI coding that still preserves background bits.", "key_contribution": "We propose MedROI, a codec-agnostic, plug-and-play ROI-centric framework that discards background voxels prior to compression.", "why_it_matters": "MedROI: Codec-Agnostic Region of Interest-Centric Compression for Medical Images advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Computer Vision.", "one_line_takeaway": "We propose MedROI, a codec-agnostic, plug-and-play ROI-centric framework that discards background voxels prior to…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Computer Vision.", "url": "http://arxiv.org/abs/2604.04511v1", "difficulty": "intermediate" }, { "id": "arxiv:2609.22895", "source": "arxiv", "source_type": "preprint", "title": "H-VLA: Hierarchical Vision-Language-Action Model with Key-Action Reasoning and Motion Planning in a Unified Action Space", "abstract": "Vision-Language-Action (VLA) models have shown strong potential for robotic manipulation, but many existing methods still rely on direct mappings from language and visual observations to dense actions. This formulation can weaken the semantic reasoning capability inherited from pre-trained Vision-Language Models (VLMs), which are mainly optimized for visual-linguistic understanding rather than low-level control, and becomes fragile under spatial variations, including changes in object positions, scene layouts, robot embodiments, and camera viewpoints. To address these limitations, we propose H-VLA, a hierarchical VLA framework that decouples high-level key-action reasoning from low-level motion generation. H-VLA combines a Key-Action Model for predicting a key-action as the next manipulation subgoal, a Motion Planning Model for generating dense future actions conditioned on the predicted key-action, and a Unified Camera-Centric Action Space for consistent representation across datasets, embodiments, and viewpoints. We further adopt a two-stage training strategy that emphasizes key-action reasoning during pre-training and dense motion generation during fine-tuning. Experiments show that H-VLA achieves strong performance on SimplerEnv, reaching 91% on Google Robot visual matching, 84% on Google Robot variant aggregation, and 81% on WidowX visual matching. On Agilex real-robot tasks, H-VLA improves over the strongest baseline by 10, 47, and 16 percentage points under in-distribution, out-of-distribution position, and out-of-distribution scene/object settings, respectively.", "authors": [ "Xiongfeng Peng", "Lu Xu", "Yandong Wang", "Jiaqian Yu", "Zirui Zheng", "Yamin Mao", "Weiming Li", "Inseop Chung", "Hyun-woong Cho", "Jaewook Yoo", "Dongwook Lee", "Daehyun Ji", "Chao Zhang" ], "year": 2026, "published_date": "2026-09-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.22895", "pdf_url": "https://arxiv.org/pdf/2609.22895", "citations": 0, "topics": [], "tags": [ "Reasoning", "Fine-Tuning", "VLMs", "Self-Supervised", "Robotics" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 4.55, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Vision-Language-Action (VLA) models have shown strong potential for robotic manipulation, but many existing methods still rely on direct mappings from language and visual observations to dense actions. This formulation can weaken the semantic reasoning capability inherited from pre-trained Vision-Language Models (VLMs), which are mainly optimized for visual-linguistic understanding rather than low-level control, and becomes fragile under spatial variations, including changes in object positions, scene layouts, robot embodiments, and camera viewpoints.", "key_contribution": "To address these limitations, we propose H-VLA, a hierarchical VLA framework that decouples high-level key-action reasoning from low-level motion generation.", "why_it_matters": "H-VLA: Hierarchical Vision-Language-Action Model with Key-Action Reasoning and Motion Planning in a Unified Action Space represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "To address these limitations, we propose H-VLA, a hierarchical VLA framework that decouples high-level key-action…", "biggest_caveat": "but many existing methods still rely on direct mappings from language and visual observations to dense actions.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2609.22895", "difficulty": "intermediate" }, { "id": "arxiv:2606.14071", "source": "arxiv", "source_type": "preprint", "title": "ShearFuse-UNet: Hadamard, DCT, and Shearlet Transform Fusion for Next-Day Wildfire Spread Prediction", "abstract": "We propose ShearFuse-UNet, a lightweight and computationally efficient deep learning model for next-day wildfire spread prediction from multi-modal satellite data. The model integrates three complementary transform-domain branches inside each encoder block of a U-Net backbone: a 2D Fast Walsh-Hadamard Transform (WHT) branch, a 2D Discrete Cosine Transform (DCT) branch, and a cone-adapted digital Shearlet residual branch. The WHT and DCT branches establish orthogonal latent spaces with learnable spectral scaling and fixed soft-thresholding, while the Shearlet branch provides anisotropic, multi-directional feature decomposition that explicitly encodes the elongated edge structures characteristic of fire fronts. A learned SpectralFusion gate adaptively combines the WHT and DCT responses, and the Shearlet reconstruction is added as a residual. This three-branch design bears a loose structural analogy to transformer self-attention: the WHT and DCT branches provide complementary spectral representations that are adaptively fused, while the Shearlet branch contributes directional content through a residual pathway. Unlike self-attention, the proposed design relies on fixed mathematical transforms rather than learned projection operators, reducing parameter count and computational cost. Evaluated on the WildfireSpreadTS dataset, ShearFuse-UNet achieves an F1 score of 0.596 with only 267k parameters, outperforming a ResNet18-based U-Net (14M parameters, F1 = 0.589) and demonstrating a highly favorable accuracy-efficiency trade-off. Results on the Google Next-Day Wildfire Spread dataset further validate these findings across a different benchmark.", "authors": [ "Ene Meco", "Yingyi Luo", "Emadeldeen Hamdan", "Adam Watts", "Ahmet Enis Cetin" ], "year": 2026, "published_date": "2026-06-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.14071", "pdf_url": "https://arxiv.org/pdf/2606.14071", "citations": 0, "topics": [], "tags": [ "Multimodal", "Transformers", "Evaluation", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 6.21, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We propose ShearFuse-UNet, a lightweight and computationally efficient deep learning model for next-day wildfire spread prediction from multi-modal satellite data. The model integrates three complementary transform-domain branches inside each encoder block of a U-Net backbone: a 2D Fast Walsh-Hadamard Transform (WHT) branch, a 2D Discrete Cosine Transform (DCT) branch, and a cone-adapted digital Shearlet residual branch.", "key_contribution": "We propose ShearFuse-UNet, a lightweight and computationally efficient deep learning model for next-day wildfire spread prediction from multi-modal satellite data.", "why_it_matters": "ShearFuse-UNet: Hadamard, DCT, and Shearlet Transform Fusion for Next-Day Wildfire Spread Prediction advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We propose ShearFuse-UNet, a lightweight and computationally efficient deep learning model for next-day wildfire spread…", "biggest_caveat": "butes directional content through a residual pathway.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2606.14071", "difficulty": "beginner" }, { "id": "arxiv:2609.16007", "source": "arxiv", "source_type": "preprint", "title": "Novel Iterative Construction Methods for the Blocking Job Shop Scheduling Problem", "abstract": "The Blocking Job-Shop Scheduling Problem (BJSSP) arises in modern and complex manufacturing, production, logistics, and service where no intermediate storage is allowed between consecutive operations. This creates a significant challenge for meta-heuristics due to the low ratio of feasible to explored solutions when solving the problem. To address this problem efficiently, we propose three new beam-search-based heuristics: the Beam Search Iterative Construction Heuristic (BS-ICH), its CPU-parallel extension Parallel Multi-Strategy Beam Search (PMS-BS), and a GPU-accelerated variants G-PMS-BS. BS-ICH constructs feasible schedules by iteratively extending partial solutions, while maintaining a beam of width k to preserve multiple high-quality partial schedules. PMS-BS runs hundreds of parallel BS-ICH instances with machine-biased diversity to expand the search space and escape local optima. G-PMS-BS offloads the beam expansion onto massively parallel GPU hardware using a two-phase kernel architecture that separates lightweight scoring from targeted state reconstruction, enabling scaling to instances with 2,000 operations. A hybrid CPU+GPU mode further exploits idle host cores for concurrent exploration, using load-balancing strategy to minimize synchronization overhead. G-PMS-BS achieves a 44x speedup over the CPU baseline. Experiments on all standard Lawrence and Taillard instances demonstrate that G-PMS-BS establishes new best-known results for 22 Lawrence benchmarks and 77 Taillard instances, with makespan reductions of up to 13% on the largest 100x20 instances.", "authors": [ "Adel Dabah", "Karima Rihane", "Hocine Saadi", "Andreas Herten", "Farouk Benslimane", "Mohammed Lamine Bahmani", "Abdelhakim Aitzai" ], "year": 2026, "published_date": "2026-07-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.16007", "pdf_url": "https://arxiv.org/pdf/2609.16007", "citations": 0, "topics": [], "tags": [ "Fairness & Ethics", "Evaluation", "Distributed Computing" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.18, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The Blocking Job-Shop Scheduling Problem (BJSSP) arises in modern and complex manufacturing, production, logistics, and service where no intermediate storage is allowed between consecutive operations. This creates a significant challenge for meta-heuristics due to the low ratio of feasible to explored solutions when solving the problem.", "key_contribution": "To address this problem efficiently, we propose three new beam-search-based heuristics: the Beam Search Iterative Construction Heuristic (BS-ICH), its CPU-parallel extension Parallel Multi-Strategy Beam Search (PMS-BS), and a GPU-accelerated variants G-PMS-BS.", "why_it_matters": "Novel Iterative Construction Methods for the Blocking Job Shop Scheduling Problem represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fairness & Ethics.", "one_line_takeaway": "To address this problem efficiently, we propose three new beam-search-based heuristics: the Beam Search Iterative…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Fairness & Ethics.", "url": "https://arxiv.org/abs/2609.16007", "difficulty": "beginner" }, { "id": "arxiv:2609.12145", "source": "arxiv", "source_type": "preprint", "title": "Hardware Fingerprinting FTQC via Quantum Decoder Timing", "abstract": "As the quantum computing field transitions toward Fault-Tolerant Quantum Computing (FTQC), intensive efforts are focused on scaling architectures and realizing active error correction. However, this shift introduces security surfaces that remain largely unexplored. Fault-tolerant quantum computers pair a quantum processor with a classical decoder that sits on the critical path of every syndrome-extraction round. For the first time, this work demonstrates that the wall-clock time each decoder takes to process a syndrome measurement and decoding round constitutes a novel, exploitable hardware side channel on physical quantum hardware. Using per-shot decoder timings from three IBM Heron processors collected over a 68-day window, the decode-time distribution alone allows a passive observer to (i) reconstruct the shot-by-shot detector-firing distribution and estimate the workload's logical error rate $p_L$, (ii) infer the code distance in use, and (iii) fingerprint the specific physical device with up to 89% accuracy (a random guess is 33%), with a pooled two-sample Kolmogorov-Smirnov test confirming the decode-time distributions are statistically distinct. In noisy simulation inspired by public data from Google's 105-qubit Willow processor, decoder timing further distinguishes 9 surface-code patches at different locations on the chip with 81% accuracy, showing the side channel persists on below-threshold fault-tolerant hardware from a different vendor and code family.", "authors": [ "Friedrich Doku", "Jakub Szefer", "Kaitlin N. Smith" ], "year": 2026, "published_date": "2026-09-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.12145", "pdf_url": "https://arxiv.org/pdf/2609.12145", "citations": 0, "topics": [], "tags": [ "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 3.87, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "As the quantum computing field transitions toward Fault-Tolerant Quantum Computing (FTQC), intensive efforts are focused on scaling architectures and realizing active error correction. However, this shift introduces security surfaces that remain largely unexplored.", "key_contribution": "For the first time, this work demonstrates that the wall-clock time each decoder takes to process a syndrome measurement and decoding round constitutes a novel, exploitable hardware side channel on physical quantum hardware.", "why_it_matters": "Hardware Fingerprinting FTQC via Quantum Decoder Timing represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Cryptography & Security.", "one_line_takeaway": "For the first time, this work demonstrates that the wall-clock time each decoder takes to process a syndrome…", "biggest_caveat": "However, this shift introduces security surfaces that remain largely unexplored.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Cryptography & Security.", "url": "https://arxiv.org/abs/2609.12145", "difficulty": "intermediate" }, { "id": "arxiv:2608.27856", "source": "arxiv", "source_type": "preprint", "title": "FedEHR-Agents: Federated Agentic Optimization for Automated EHR Modeling", "abstract": "Recent advances in large language models are enabling autonomous clinical agents to perform increasingly complex electronic health record (EHR) modeling workflows. However, agents deployed at individual hospitals remain constrained by institution-specific data and modeling environments, while direct cross-hospital collaboration is restricted by the sensitivity of patient-level EHR data. Although federated learning (FL) provides a natural foundation for privacy-preserving collaboration, existing approaches remain predominantly model-centric, limiting federation to prediction models or their updates while overlooking the richer modeling experience accumulated by autonomous agents. To address this limitation, we propose FedEHR-Agents, an experience-centric federated agentic optimization framework for automated EHR modeling. Each hospital deploys an autonomous clinical EHR agent that performs data preprocessing and model development while refining local clinical modeling experience through historical memory, task-specific evaluation, and TextGrad-based prompt refinement. The federated server performs evidence-guided experience aggregation to integrate reliable and complementary modeling experience across heterogeneous hospitals and distills the aggregated experience into global meta-prompts for subsequent local refinement. Extensive experiments on real-world multi-hospital EHR benchmarks demonstrate that FedEHR-Agents consistently outperforms local and federated baselines across diverse clinical prediction tasks and remains robust across different federation scales and LLM backbones. These results establish clinical modeling experience as a promising collaborative object beyond conventional parameter-centric FL and point toward federated autonomous clinical intelligence.", "authors": [ "Jun Bai", "Ruilin Wang", "Yue Li" ], "year": 2026, "published_date": "2026-08-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.27856", "pdf_url": "https://arxiv.org/pdf/2608.27856", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Federated Learning", "Biomedical AI", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.18, "content_potential_score": 0.84, "interestingness_score": 1.97, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent advances in large language models are enabling autonomous clinical agents to perform increasingly complex electronic health record (EHR) modeling workflows. However, agents deployed at individual hospitals remain constrained by institution-specific data and modeling environments, while direct cross-hospital collaboration is restricted by the sensitivity of patient-level EHR data.", "key_contribution": "To address this limitation, we propose FedEHR-Agents, an experience-centric federated agentic optimization framework for automated EHR modeling.", "why_it_matters": "FedEHR-Agents: Federated Agentic Optimization for Automated EHR Modeling represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this limitation, we propose FedEHR-Agents, an experience-centric federated agentic optimization framework…", "biggest_caveat": "limitation, we propose FedEHR-Agents, an experience-centric federated agentic optimization framework for automated EHR modeling.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.27856", "difficulty": "beginner" }, { "id": "arxiv:2507.00611", "source": "arxiv", "source_type": "preprint", "title": "Residual Reward Models: Leveraging Prior Knowledge for Efficient Preference-based Reinforcement Learning in Robotics", "abstract": "Preference-based Reinforcement Learning (PbRL) provides a promising alternative to heuristic reward design in complex robotic environments. However, PbRL often suffers from poor sample efficiency, requiring extensive and costly human feedback, which limits its real-world applicability. Prior work has proposed learning a reward model from demonstrations and fine-tuning it using preferences. However, when the model is a neural network, transitioning between different loss functions across training phases often leads to unstable optimization and performance degradation. In this paper, we propose a method to effectively leverage prior knowledge with a Residual Reward Model (RRM). An RRM assumes that the true reward of the environment can be split into a sum of two parts: a prior reward and a learned reward. The prior reward is a term available before training, such as an engineering heuristic ``best guess'', a language-generated reward, or a reward function learned from inverse reinforcement learning, and the learned reward is then trained with preferences as a residual offset. Experimental results in Meta-World and DM-Control show that RRMs substantially improve the sample efficiency of common PbRL methods across various prior reward types. Furthermore, we demonstrate the practical efficacy of our method on a physical Franka Panda robot, accelerating policy learning and achieving high success rates in fewer steps than baselines.", "authors": [ "Chenyang Cao", "Miguel Rogel-García", "Mohamed Nabail", "Xueqian Wang", "Nicholas Rhinehart" ], "year": 2026, "published_date": "2026-08-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2507.00611", "pdf_url": "https://arxiv.org/pdf/2507.00611", "citations": 0, "topics": [], "tags": [ "RLHF", "Fine-Tuning", "Robotics", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.15, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Preference-based Reinforcement Learning (PbRL) provides a promising alternative to heuristic reward design in complex robotic environments. However, PbRL often suffers from poor sample efficiency, requiring extensive and costly human feedback, which limits its real-world applicability.", "key_contribution": "In this paper, we propose a method to effectively leverage prior knowledge with a Residual Reward Model (RRM).", "why_it_matters": "Residual Reward Models: Leveraging Prior Knowledge for Efficient Preference-based Reinforcement Learning in Robotics represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RLHF.", "one_line_takeaway": "In this paper, we propose a method to effectively leverage prior knowledge with a Residual Reward Model (RRM).", "biggest_caveat": "However, PbRL often suffers from poor sample efficiency, requiring extensive and costly human feedback, which limits its real-world applicability.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RLHF.", "url": "https://arxiv.org/abs/2507.00611", "difficulty": "advanced" }, { "id": "arxiv:2608.24876", "source": "arxiv", "source_type": "preprint", "title": "Recursive Experiential-Working Memory Evolution for Long-Horizon Agent Harnesses", "abstract": "Recursive self-improvement (RSI) remains hard in long-horizon tasks, where growing histories obscure the task state and misalign skill invocation. We introduce Recuris, a recursive Experiential-Working Memory architecture for long-horizon agent harnesses, in which Working Memory tracks task progress and guides skill selection from Experiential Memory, grounding skill use in current needs rather than the full history. This coupling also turns execution into structured evidence that localizes failures to specific memory components. Across tasks, a fixed Meta-Agent turns that evidence into localized, validation-gated updates to Skill Memory that reshape execution and yield new evidence, forming a bounded recursive memory-evolution loop. Across four long-horizon benchmarks and ten models, Recuris improves task success in 35 of the 37 completed model-benchmark pairs, carrying frontier models to SOTA-level task success: on tau-bench it adds +17.8 points to GPT-5.6 Sol and +15.6 to Claude Opus 5, taking Opus 5 to 87.9%, and +16.6/+13.5 points on Qwen3.6-27B/35B on SkillFlow. The advantage widens as the interaction horizon grows, to +32.2 points on the longest tasks, and common long-horizon failures fall by up to 80%. These results position recursively evolving memory as a scalable foundation for RSI, enabling agents to continuously transform accumulated experience into increasingly effective long-horizon behavior. Code: https://github.com/Gen-Verse/Recuris", "authors": [ "Zhaochen Yu", "Yingcheng Wu", "Zhenfei Yin", "Kaiyuan Chen", "Zhe Zhao", "Mengdi Wang", "Shuicheng Yan", "Ling Yang" ], "year": 2026, "published_date": "2026-08-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.24876", "pdf_url": "https://arxiv.org/pdf/2608.24876", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "Evaluation", "Artificial Intelligence", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 6.13, "content_potential_score": 2.05, "interestingness_score": 2.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recursive self-improvement (RSI) remains hard in long-horizon tasks, where growing histories obscure the task state and misalign skill invocation. We introduce Recuris, a recursive Experiential-Working Memory architecture for long-horizon agent harnesses, in which Working Memory tracks task progress and guides skill selection from Experiential Memory, grounding skill use in current needs rather than the full history.", "key_contribution": "We introduce Recuris, a recursive Experiential-Working Memory architecture for long-horizon agent harnesses, in which Working Memory tracks task progress and guides skill selection from Experiential Memory, grounding skill use in current needs rather than the full history.", "why_it_matters": "Recursive Experiential-Working Memory Evolution for Long-Horizon Agent Harnesses represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Recuris, a recursive Experiential-Working Memory architecture for long-horizon agent harnesses, in which…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.24876", "difficulty": "beginner" }, { "id": "arxiv:2608.21500", "source": "arxiv", "source_type": "preprint", "title": "SecOPD: Mitigating Adaptive Prompt Injections by On-Policy Distillation", "abstract": "Prompt injection is listed as the \\#1 threat to AI agents. When an agent accesses external data from websites, files, or emails, an attacker may inject a prompt into the data, saying, \"Ignore all prior instructions and perform .\" To prevent arbitrary manipulation of agents, defenders try to train secure LLMs, which, however, still suffer from near 100% attack success rates (ASRs) against adaptive prompt injections. We note that this is because existing defensive finetuning recipes rely on sequence-level feedback signals (in DPO or GRPO). Treating an entire output equally prevents the model from learning precisely which output tokens are insecure. In this paper, we propose Secure On-Policy Distillation (SecOPD) that provides token-level feedback to guide defensive fine-tuning. The LLM receives an injected sample and produces a rollout, whose tokens are scored by the initialization model given the corresponding clean input. With more fine-grained training signals, our defended Qwen3.6-27B achieves a 9.0% ASR against the SoTA PISmith adaptive prompt injections, compared to 94.0% for the prior SoTA, Meta-SecAlign. The obtained security generalizes to domains completely unseen in training: in agentic tool calling, SecOPD achieves a 4.7% ASR compared to 5.5% for Meta-SecAlign. Code and the model are available at https://github.com/pppyb/SecOPD and https://huggingface.co/pybbb/Qwen3.6-27B-SecOPD.", "authors": [ "Yibo Peng", "Long Lian", "David Wagner", "Sizhe Chen" ], "year": 2026, "published_date": "2026-08-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.21500", "pdf_url": "https://arxiv.org/pdf/2608.21500", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "Fine-Tuning", "AI Agents", "ASR" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 4.62, "content_potential_score": 0.55, "interestingness_score": 1.83, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Prompt injection is listed as the \\#1 threat to AI agents. When an agent accesses external data from websites, files, or emails, an attacker may inject a prompt into the data, saying, \"Ignore all prior instructions and perform .\" To prevent arbitrary manipulation of agents, defenders try to train secure LLMs, which, however, still suffer from near 100% attack success rates (ASRs) against adaptive prompt injections.", "key_contribution": "In this paper, we propose Secure On-Policy Distillation (SecOPD) that provides token-level feedback to guide defensive fine-tuning.", "why_it_matters": "SecOPD: Mitigating Adaptive Prompt Injections by On-Policy Distillation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this paper, we propose Secure On-Policy Distillation (SecOPD) that provides token-level feedback to guide defensive…", "biggest_caveat": "however, still suffer from near 100% attack success rates (ASRs) against adaptive prompt injections.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.21500", "difficulty": "advanced" }, { "id": "arxiv:2608.23290", "source": "arxiv", "source_type": "preprint", "title": "Spotter: Efficient Urban Visual Localization via Geo-Referenced Facade Landmarks in GPS-Degraded Environments", "abstract": "Accurate visual localization on robotic and wearable platforms remains challenging in dense urban environments. Existing methodologies typically rely on GPS for absolute positioning, yet GPS signals frequently degrade in urban canyons due to multipath propagation. Consequently, standard solutions like visual odometry suffer from unmitigated drift over time, while map-matching techniques struggle to acquire the reliable GPS priors they need, on top of being too computationally heavy for real-time edge execution. To address these limitations, we propose Spotter, a robuts and real-time visual localization framework that uses building facades as a reliable source of global geo-reference, while retaining the capability to integrate GPS signals when available. In an offline stage, Spotter processes Google Street View panoramas by semantically segmenting facades and pairing multi-view stereo depth with cartographic data to build a compact metric database. At runtime, query images are matched via a cascaded retrieval and geometric verification pipeline to recover fine-grained global camera localization. We benchmark Spotter on a newly collected dataset of pedestrian sequences acquired with wearable smart glasses across several districts of Barcelona. Experimental results show that Spotter outperforms odometry-based baselines and achieves localization accuracy comparable to state-of-the-art map-based methods while operating at significantly higher frame rates.", "authors": [ "Antoni Valls", "Jordi Sanchez-Riera" ], "year": 2026, "published_date": "2026-08-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.23290", "pdf_url": "https://arxiv.org/pdf/2608.23290", "citations": 0, "topics": [], "tags": [ "Robotics", "Evaluation", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.62, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Accurate visual localization on robotic and wearable platforms remains challenging in dense urban environments. Existing methodologies typically rely on GPS for absolute positioning, yet GPS signals frequently degrade in urban canyons due to multipath propagation.", "key_contribution": "To address these limitations, we propose Spotter, a robuts and real-time visual localization framework that uses building facades as a reliable source of global geo-reference, while retaining the capability to integrate GPS signals when available.", "why_it_matters": "Spotter: Efficient Urban Visual Localization via Geo-Referenced Facade Landmarks in GPS-Degraded Environments advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "To address these limitations, we propose Spotter, a robuts and real-time visual localization framework that uses…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2608.23290", "difficulty": "beginner" }, { "id": "arxiv:2510.06607", "source": "arxiv", "source_type": "preprint", "title": "Your Harness is Not Secure: Benchmarking Real-world Threat of Command Line Interface Agent", "abstract": "Command-line interface (CLI) agents powered by large language models (LLMs) can interpret natural-language requests, plan multi-step tasks, execute shell commands, and modify files and system state. As these agents are increasingly used for operating-system (OS) workflows, it is important to evaluate whether they can be misused to carry out security-relevant operations. Existing benchmarks often lack an attacker-knowledge model grounded in tactics, techniques, and procedures (TTPs), provide limited coverage of end-to-end kill chains, rely on simplified single-host environments, or use LLM-as-a-judge for success evaluation. We introduce AdvCLI, an MITRE ATT&CK-aligned benchmark for evaluating OS-level misuse risks of CLI agents in a controlled multi-host sandbox. AdvCLI contains 140 tasks: 40 direct malicious requests, 74 TTP-based tasks, and 26 end-to-end kill chains. Each task is paired with deterministic hard-coded verification protocols that check whether the requested OS-level effect is realized. We evaluate seven CLI agents and products built on nine foundation models, including ReAct, OpenClaw, OpenAI Agent SDK, Claude Code, Gemini CLI, Cursor CLI, and Cursor IDE. Results show that current CLI agents frequently proceed beyond refusal and can complete a non-negligible fraction of malicious OS-level tasks, especially when requests include TTP-style attacker knowledge. AdvCLI provides a reproducible testbed for evaluating these risks and for developing stronger safety mechanisms for tool-using CLI agents in the future.", "authors": [ "Weidi Luo", "Qiming Zhang", "Tianyu Lu", "Xiaogeng Liu", "Bin Hu", "Hung-Chun Chiu", "Siyuan Ma", "Yizhe Zhang", "Xusheng Xiao", "Yinzhi Cao", "Zhen Xiang", "Chaowei Xiao" ], "year": 2026, "published_date": "2026-08-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.06607", "pdf_url": "https://arxiv.org/pdf/2510.06607", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Evaluation", "Cryptography & Security" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.69, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Command-line interface (CLI) agents powered by large language models (LLMs) can interpret natural-language requests, plan multi-step tasks, execute shell commands, and modify files and system state. As these agents are increasingly used for operating-system (OS) workflows, it is important to evaluate whether they can be misused to carry out security-relevant operations.", "key_contribution": "We introduce AdvCLI, an MITRE ATT&CK-aligned benchmark for evaluating OS-level misuse risks of CLI agents in a controlled multi-host sandbox.", "why_it_matters": "Your Harness is Not Secure: Benchmarking Real-world Threat of Command Line Interface Agent represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce AdvCLI, an MITRE ATT&CK-aligned benchmark for evaluating OS-level misuse risks of CLI agents in a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2510.06607", "difficulty": "beginner" }, { "id": "arxiv:2608.20106", "source": "arxiv", "source_type": "preprint", "title": "OenoBench: A Wine-Domain Benchmark for Knowledge-Grounded Evaluation of Large Language Models", "abstract": "We introduce OenoBench, a wine-domain knowledge benchmark of 3,266 multiple-choice questions across six pillars (regions, grape varieties, viticulture, winemaking, producers, business) and four difficulty tiers. The corpus is built from 38,104 atomic, source-anchored facts extracted by 35 provenance-verified scrapers from government registries (INAO, TTB, OIV), peer-reviewed journals, and Wikipedia/Wikidata. Our methodological contribution is an LLM-driven pipeline in which language models reformat verified facts and audit the result, but never serve as the source of truth: every claim traces to a URL, every question is generated by one of five strategies across five generator families, and every question is scored by a nine-agent audit calibrated against a human gold sheet via Cohen's $κ$. Evaluating sixteen frontier configurations, we find: (i) overall accuracy spans 53%-84%, led by o3 at 83.6%; (ii) reasoning-mode lift concentrates in DeepSeek R1 (+6.8pp) and is absent in Claude Opus and Gemini Pro; (iii) Anthropic shows +9pp self preference on its own questions while Google shows -8pp inverse preference; (iv) frontier open-weight models share the cost-vs-accuracy Pareto frontier with proprietary reasoning models; and (v) every config gains around 33pp on closed-book solvable items, revealing a parametric-recall ceiling that only the contextual slice avoids. We release corpus, audit findings, human-review app, and construction code under CC-BY-SA-4.0.", "authors": [ "Nikita Khudov" ], "year": 2026, "published_date": "2026-08-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.20106", "pdf_url": "https://arxiv.org/pdf/2608.20106", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Knowledge Graphs", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.66, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce OenoBench, a wine-domain knowledge benchmark of 3,266 multiple-choice questions across six pillars (regions, grape varieties, viticulture, winemaking, producers, business) and four difficulty tiers. The corpus is built from 38,104 atomic, source-anchored facts extracted by 35 provenance-verified scrapers from government registries (INAO, TTB, OIV), peer-reviewed journals, and Wikipedia/Wikidata.", "key_contribution": "We introduce OenoBench, a wine-domain knowledge benchmark of 3,266 multiple-choice questions across six pillars (regions, grape varieties, viticulture, winemaking, producers, business) and four difficulty tiers.", "why_it_matters": "OenoBench: A Wine-Domain Benchmark for Knowledge-Grounded Evaluation of Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce OenoBench, a wine-domain knowledge benchmark of 3,266 multiple-choice questions across six pillars…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.20106", "difficulty": "beginner" }, { "id": "arxiv:2608.15841", "source": "arxiv", "source_type": "preprint", "title": "Self-Supervised Auxiliary Task Discovery for Stable Reinforcement Learning in Stock Trading", "abstract": "Reinforcement learning has gained increasing attention as a data-driven approach for stock trading. However, learning a policy that is both profitable and stable remains challenging due to non-stationary market behaviour and noisy reward signals. Auxiliary tasks are often used to improve representation learning and stabilize training, yet they are usually designed manually and depend heavily on prior assumptions about targets and prediction horizons. Such fixed designs may not remain suitable across changing market regimes. In this work, we propose a self-supervised framework that automatically discovers auxiliary tasks to support reinforcement learning for stock trading. The auxiliary tasks are formulated as General Value Functions so that their predictions enrich the learned state representation and assist policy optimization. The framework consists of two networks. The main network learns the trading policy along with the auxiliary predictions, while the secondary network generates the definitions of auxiliary tasks through learned cumulants and discount factors. These tasks are updated using a meta gradient mechanism that accounts for their long-term impact on trading performance and improves training stability. We evaluate the proposed approach across four major equity indices: DJI, FTSE, Sensex, and TAIEX. The empirical results demonstrate that automatically discovered auxiliary tasks lead to more robust learning and improved trading performance compared to existing baselines.", "authors": [ "Arishi Orra", "Himanshu Choudhary", "Manoj Thakur" ], "year": 2026, "published_date": "2026-08-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.15841", "pdf_url": "https://arxiv.org/pdf/2608.15841", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "RL", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 4.64, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reinforcement learning has gained increasing attention as a data-driven approach for stock trading. However, learning a policy that is both profitable and stable remains challenging due to non-stationary market behaviour and noisy reward signals.", "key_contribution": "In this work, we propose a self-supervised framework that automatically discovers auxiliary tasks to support reinforcement learning for stock trading.", "why_it_matters": "Self-Supervised Auxiliary Task Discovery for Stable Reinforcement Learning in Stock Trading represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "In this work, we propose a self-supervised framework that automatically discovers auxiliary tasks to support…", "biggest_caveat": "However, learning a policy that is both profitable and stable remains challenging due to non-stationary market behaviour and noisy reward signals.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Self-Supervised.", "url": "https://arxiv.org/abs/2608.15841", "difficulty": "advanced" }, { "id": "arxiv:2509.00559", "source": "arxiv", "source_type": "preprint", "title": "Social World Models", "abstract": "Humans intuitively navigate social interactions by simulating unspoken dynamics and reasoning about others' perspectives, even with limited information. In contrast, AI systems struggle to structure and reason about implicit social contexts, as they lack explicit representations for unobserved dynamics such as intentions, beliefs, and evolving social states. In this paper, we introduce the concept of social world models (SWMs) to characterize the complex social dynamics. To operationalize SWMs, we introduce a novel structured social world representation formalism (S3AP), which captures the evolving states, actions, and mental states of agents, addressing the lack of explicit structure in traditional free-text-based inputs. Through comprehensive experiments across five social reasoning benchmarks, we show that S3AP significantly enhances LLM performance-achieving a +51% improvement on FANToM over OpenAI's o1. Our ablations further reveal that these gains are driven by the explicit modeling of hidden mental states, which proves more effective than a wide range of baseline methods. Finally, we introduce an algorithm for social world models using S3AP, which enables AI agents to build models of their interlocutors and predict their next actions and mental states. Empirically, S3AP-enabled social world models yield up to +18% improvement on the SOTOPIA multi-turn social interaction benchmark. Our findings highlight the promise of S3AP as a powerful, general-purpose representation for social world states, enabling the development of more socially-aware systems that better navigate social interactions.", "authors": [ "Xuhui Zhou", "Jiarui Liu", "Akhila Yerukola", "Hyunwoo Kim", "Maarten Sap" ], "year": 2026, "published_date": "2026-08-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.00559", "pdf_url": "https://arxiv.org/pdf/2509.00559", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 6.92, "content_potential_score": 2.47, "interestingness_score": 2.79, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Humans intuitively navigate social interactions by simulating unspoken dynamics and reasoning about others' perspectives, even with limited information. In contrast, AI systems struggle to structure and reason about implicit social contexts, as they lack explicit representations for unobserved dynamics such as intentions, beliefs, and evolving social states.", "key_contribution": "In this paper, we introduce the concept of social world models (SWMs) to characterize the complex social dynamics.", "why_it_matters": "Social World Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this paper, we introduce the concept of social world models (SWMs) to characterize the complex social dynamics.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2509.00559", "difficulty": "beginner" }, { "id": "arxiv:2605.00737", "source": "arxiv", "source_type": "preprint", "title": "To Call or Not to Call: A Framework to Assess and Optimize LLM Tool Calling", "abstract": "Agentic AI architectures augment LLMs with external tools, unlocking strong capabilities but potentially incurring substantial costs. Moreover, tool use is not always beneficial: redundant or low-utility calls can even harm task performance. Effective tool use, therefore, hinges on a core LLM decision: whether to call or not call a tool when performing a task. We introduce a principled framework inspired by decision-making theory to understand tool-use decisions along three key factors: necessity, utility, and affordability. Our analysis combines two complementary lenses: a normative perspective that infers true need and utility for optimal tool calls, and a descriptive perspective that infers the model's self-perceived need and utility from their observed behaviors. We evaluate six open models and a proprietary OpenAI model across native and customized harnesses, two tools, and six tasks. Models' perceived need and utility remain misaligned with their true values, particularly under budget constraints. This misalignment produces both costly overuse and performance-degrading calls. To improve the tool decisions, we train lightweight latent estimators of need (LNEs) from model hidden states. LNEs generally predict true need more accurately than model self-reports and improve budgeted tool allocation across model scales and tool types. Code and dataset available at https://github.com/QinyuanWu0710/ToCall_or_NotToCall.", "authors": [ "Qinyuan Wu", "Soumi Das", "Mahsa Amani", "Arijit Nag", "Seungeon Lee", "Krishna P. Gummadi", "Abhilasha Ravichander", "Muhammad Bilal Zafar" ], "year": 2026, "published_date": "2026-08-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.00737", "pdf_url": "https://arxiv.org/pdf/2605.00737", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "AI Agents", "Artificial Intelligence" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 4.42, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agentic AI architectures augment LLMs with external tools, unlocking strong capabilities but potentially incurring substantial costs. Moreover, tool use is not always beneficial: redundant or low-utility calls can even harm task performance.", "key_contribution": "We introduce a principled framework inspired by decision-making theory to understand tool-use decisions along three key factors: necessity, utility, and affordability.", "why_it_matters": "To Call or Not to Call: A Framework to Assess and Optimize LLM Tool Calling represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce a principled framework inspired by decision-making theory to understand tool-use decisions along three key…", "biggest_caveat": "but potentially incurring substantial costs.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.00737", "difficulty": "advanced" }, { "id": "arxiv:2608.00106", "source": "arxiv", "source_type": "preprint", "title": "Learning Compositional Meta-Routing for Agentic Workflows: An Executable Benchmark", "abstract": "Agentic systems must decide not only what answer to produce, but which reasoning and execution operations should precede it. A controller may answer directly, decompose a request, retrieve evidence, execute code, delegate to a specialist, or verify an intermediate result. Existing routing work largely selects model endpoints, retrieval depth, or tools in isolation. We introduce an executable benchmark and a budget-aware meta-router that composes heterogeneous operations from raw task text. The benchmark contains 216 training, 72 development, 108 held-out test, and 108 locked lexical-shift challenge tasks across data analysis, frozen-corpus research, and document processing. Outcomes are machine checked after operations execute. Independent regularized logistic heads predict operation probabilities from word and character features, are temperature-scaled on development data, and are greedily composed under route-cost and action-count budgets. On the held-out test, the learned policy achieves 100% success versus 93.5% for strong static and fixed workflows, with 43% lower cost than the static policy; a matched learned one-shot router reaches 56.5%. On the untouched challenge split, learned success falls to 75.9% and trails static routing at 93.5%, while remaining 49% cheaper and exceeding one-shot routing by 34.3 points. The gap identifies lexical generalization, rather than route execution, as the principal limitation. These results establish a reproducible testbed and a bounded proof of concept, not evidence of live-LLM performance.", "authors": [ "Natan Vidra", "Alina Kapanova", "Arun Kanhai", "Spurthi Setty" ], "year": 2026, "published_date": "2026-07-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.00106", "pdf_url": "https://arxiv.org/pdf/2608.00106", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 4.01, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agentic systems must decide not only what answer to produce, but which reasoning and execution operations should precede it. A controller may answer directly, decompose a request, retrieve evidence, execute code, delegate to a specialist, or verify an intermediate result.", "key_contribution": "We introduce an executable benchmark and a budget-aware meta-router that composes heterogeneous operations from raw task text.", "why_it_matters": "Learning Compositional Meta-Routing for Agentic Workflows: An Executable Benchmark represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce an executable benchmark and a budget-aware meta-router that composes heterogeneous operations from raw…", "biggest_caveat": "but which reasoning and execution operations should precede it.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.00106", "difficulty": "frontier" }, { "id": "arxiv:2502.01830", "source": "arxiv", "source_type": "preprint", "title": "Meta-neural Topology Optimization: Knowledge Infusion with Meta-learning", "abstract": "When faced with novel design problems, traditional topology optimization methods discard all prior design experience and start from a uniform initial guess. While this avoids biasing the optimizer towards any particular solution, it also means that many computationally expensive iterations are needed to converge. Existing machine learning approaches address this through data-driven design prediction, but require large datasets of pre-optimized structures and often struggle to generalize across boundary conditions and mesh resolutions. We propose a new method, termed meta-neural topology optimization, which uses a meta-learning algorithm to learn effective initial designs for topology optimization with neural field parameterizations -- continuous, mesh-independent representations that encode material distributions in the weights of a neural network. Through bilevel optimization, our method distills reusable design knowledge from partial optimization trajectories, eliminating the need for pre-optimized training data. By conditioning the neural field on strain energy fields of reference designs, a single set of learned parameters encodes problem-specific initial structures for diverse boundary conditions. We evaluate our approach on 3000 compliance minimization tasks across in-distribution, out-of-distribution, and cross-resolution scenarios. Our method converges in fewer iterations in 57.6% of in-distribution and 74.1% of cross-resolution tasks, while maintaining design quality competitive with standard density-based topology optimization. Notably, initializations learned on coarse meshes transfer successfully to discretizations four times finer. Code is available at https://github.com/bessagroup/metatopia.", "authors": [ "Igor Kuszczak", "Gawel Kus", "Federico Bosi", "Miguel A. Bessa" ], "year": 2026, "published_date": "2026-07-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2502.01830", "pdf_url": "https://arxiv.org/pdf/2502.01830", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Fairness & Ethics" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 4.69, "content_potential_score": 0.55, "interestingness_score": 1.83, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "When faced with novel design problems, traditional topology optimization methods discard all prior design experience and start from a uniform initial guess. While this avoids biasing the optimizer towards any particular solution, it also means that many computationally expensive iterations are needed to converge.", "key_contribution": "When faced with novel design problems, traditional topology optimization methods discard all prior design experience and start from a uniform initial guess.", "why_it_matters": "Meta-neural Topology Optimization: Knowledge Infusion with Meta-learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "When faced with novel design problems, traditional topology optimization methods discard all prior design experience…", "biggest_caveat": "but require large datasets of pre-optimized structures and often struggle to generalize across boundary conditions and mesh resolutions.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2502.01830", "difficulty": "frontier" }, { "id": "arxiv:2607.22026", "source": "arxiv", "source_type": "preprint", "title": "DWT-Fusion: A Signal-Based Framework for Training-Free LLM-Generated Text Detection", "abstract": "Detecting LLM-generated text remains challenging under zero-shot and training-free conditions, especially when detectors must generalize across datasets, domains, and unseen generators. While existing training-free approaches exploit language-model statistics as detection signals, they typically characterize a text through global measures that summarize overall model behavior. Consequently, potentially informative local and multiscale variations in token-level predictability may remain underutilized. Motivated by this observation, we introduce DWT-Fusion, a training-free signal-based framework for detecting LLM-generated text using discrete wavelet analysis of token-level log-probability sequences produced by a proxy causal language model. The proposed framework analyzes these sequences through wavelet-based multiresolution signal representations and derives detection signals from localized probability dynamics. We further evaluate four training-free voting variants, including equal-weight hard voting, equal-weight soft voting, calibration-weighted hard voting, and calibration-weighted soft voting, to combine multiple wavelet configurations without training a supervised meta-classifier. We evaluate the framework on HC3, M4, and MAGE using GPT-Neo-2.7B, GPT-J-6B, Falcon-7B, and LLaMA-3-8B as proxy models. The best single wavelet configurations achieve AUROC values of 0.9872, 0.8185, and 0.7138 on HC3, M4, and MAGE, respectively. With calibration-weighted voting, the best ensemble variants further improve AUROC to 0.9919, 0.8477, and 0.7471. These findings show that DWT-based multiresolution scoring and calibration-guided voting fusion provide effective and interpretable signals for training-free LLM-generated text detection.", "authors": [ "Mehmet Batuhan Özdaş", "Murat Osmanoğlu" ], "year": 2026, "published_date": "2026-07-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.22026", "pdf_url": "https://arxiv.org/pdf/2607.22026", "citations": 0, "topics": [], "tags": [ "LLMs", "Interpretability", "NLP" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.58, "content_potential_score": 1.39, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Detecting LLM-generated text remains challenging under zero-shot and training-free conditions, especially when detectors must generalize across datasets, domains, and unseen generators. While existing training-free approaches exploit language-model statistics as detection signals, they typically characterize a text through global measures that summarize overall model behavior.", "key_contribution": "Motivated by this observation, we introduce DWT-Fusion, a training-free signal-based framework for detecting LLM-generated text using discrete wavelet analysis of token-level log-probability sequences produced by a proxy causal language model.", "why_it_matters": "DWT-Fusion: A Signal-Based Framework for Training-Free LLM-Generated Text Detection represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Motivated by this observation, we introduce DWT-Fusion, a training-free signal-based framework for detecting…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.22026", "difficulty": "intermediate" }, { "id": "arxiv:2510.23509", "source": "arxiv", "source_type": "preprint", "title": "Logic-Guided Socially-aware Robot Navigation World Model", "abstract": "Social robot navigation increasingly relies on large language models for reasoning, path planning, and enabling movement in dynamic human spaces. However, relying solely on LLMs for planning often leads to unpredictable and unsafe behaviors, especially in dynamic human spaces, due to limited physical grounding and weak logical consistency. In this work, we introduce NaviWM, a socially-aware robot Navigation World Model that augments LLM reasoning with a structured world model and a logic-driven chain-of-thought process. NaviWM consists of two main components: (1) a spatial-temporal world model that captures the positions, velocities, and activities of agents in the environment, and (2) a deductive reasoning module that guides LLMs through a multi-step, logic-based inference process. This integration enables the robot to generate navigation decisions that are both socially compliant and physically safe, under well-defined constraints such as personal space, collision avoidance, and timing. Unlike previous methods based on prompting or fine-tuning, NaviWM encodes social norms as first-order logic, enabling interpretable and verifiable reasoning. Experiments show that NaviWM improves success rates and reduces social violations, particularly in crowded environments. These results demonstrate the benefit of combining formal reasoning with LLMs for robust social navigation. Additional experimental details and demo videos for this work can be found at: https://sites.google.com/view/NaviWM.", "authors": [ "Weizheng Wang", "Obi Ike", "Soyun Choi", "Sungeun Hong", "Aniket Bera", "Byung-Cheol Min" ], "year": 2026, "published_date": "2026-05-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.23509", "pdf_url": "https://arxiv.org/pdf/2510.23509", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Hallucination", "Fine-Tuning", "Robotics" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.22, "content_potential_score": 0.42, "interestingness_score": 1.76, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Social robot navigation increasingly relies on large language models for reasoning, path planning, and enabling movement in dynamic human spaces. However, relying solely on LLMs for planning often leads to unpredictable and unsafe behaviors, especially in dynamic human spaces, due to limited physical grounding and weak logical consistency.", "key_contribution": "In this work, we introduce NaviWM, a socially-aware robot Navigation World Model that augments LLM reasoning with a structured world model and a logic-driven chain-of-thought process.", "why_it_matters": "Logic-Guided Socially-aware Robot Navigation World Model represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this work, we introduce NaviWM, a socially-aware robot Navigation World Model that augments LLM reasoning with a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2510.23509", "difficulty": "intermediate" }, { "id": "arxiv:2603.01140", "source": "arxiv", "source_type": "preprint", "title": "Teacher-Guided Causal Interventions for Image Denoising: Orthogonal Content-Noise Disentanglement in Vision Transformers", "abstract": "Conventional image denoising models often inadvertently learn spurious correlations between environmental factors and noise patterns. Moreover, due to high-frequency ambiguity, they struggle to reliably distinguish subtle textures from stochastic noise, resulting in over-removed details or residual noise artifacts. We therefore revisit denoising via causal intervention, arguing that purely correlational fitting entangles intrinsic content with extrinsic noise, which directly degrades robustness under distribution shifts. Motivated by this, we propose the Teacher-Guided Causal Disentanglement Network (TCD-Net), which explicitly decomposes the generative mechanism via structured interventions on feature spaces within a Vision Transformer framework. Specifically, our method integrates three key components: (1) An Environmental Bias Adjustment (EBA) module projects features into a stable, de-centered subspace to suppress global environmental bias (de-confounding). (2) A dual-branch disentanglement head employs an orthogonality constraint to force a strict separation between content and noise representations, preventing information leakage. (3) To resolve structural ambiguity, we leverage Nano Banana Pro, Google's reasoning-guided AI image generation model, to guide a causal prior, effectively pulling content representations back onto the natural-image manifold. Extensive experiments demonstrate that TCD-Net outperforms mainstream methods across multiple benchmarks in both fidelity and efficiency, achieving a real-time speed of 104.2 FPS on a single RTX 5090 GPU.", "authors": [ "Kuai Jiang", "Zhaoyan Ding", "Guijuan Zhang", "Dianjie Lu", "Zhuoran Zheng" ], "year": 2026, "published_date": "2026-07-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.01140", "pdf_url": "https://arxiv.org/pdf/2603.01140", "citations": 0, "topics": [], "tags": [ "Reasoning", "Text-to-Image", "Transformers", "Fairness & Ethics", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 4.59, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Conventional image denoising models often inadvertently learn spurious correlations between environmental factors and noise patterns. Moreover, due to high-frequency ambiguity, they struggle to reliably distinguish subtle textures from stochastic noise, resulting in over-removed details or residual noise artifacts.", "key_contribution": "Motivated by this, we propose the Teacher-Guided Causal Disentanglement Network (TCD-Net), which explicitly decomposes the generative mechanism via structured interventions on feature spaces within a Vision Transformer framework.", "why_it_matters": "Teacher-Guided Causal Interventions for Image Denoising: Orthogonal Content-Noise Disentanglement in Vision Transformers represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Motivated by this, we propose the Teacher-Guided Causal Disentanglement Network (TCD-Net), which explicitly decomposes…", "biggest_caveat": "bution shifts.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2603.01140", "difficulty": "frontier" }, { "id": "arxiv:2606.29648", "source": "arxiv", "source_type": "preprint", "title": "Hybrid Retriever Evolution for Multimodal Document Reasoning Agents", "abstract": "Different retrievers, including lexical, semantic, and multimodal approaches, provide highly complementary strengths for multimodal document understanding, yet most systems combine them through fixed pipelines that cannot adapt to the demands of individual reasoning steps. In this work, we ask whether retrieval orchestration itself can be learned as part of the reasoning process. We introduce a failure-driven evolution framework in which a meta-agent autonomously discovers how a tool-using task agent should coordinate diverse retrievers during multi-step document question answering. The meta-agent analyzes incorrect reasoning trajectories, actively probes the same tool environment to diagnose root causes, and iteratively rewrites the task agent's instructions, turning retrieval from a fixed front-end stage into an adaptive, step-wise reasoning decision. The evolved agent learns when to invoke each retriever, how to combine them, and how to compose evidence across modalities and pages. On MMLongBench-Doc and DocBench, the evolved agent achieves gains of up to +19.6 points over the unevolved baseline and consistently outperforms recent systems including MACT, MDocAgent, and SimpleDoc. Detailed retrieval analyses confirm that these improvements arise from adaptive routing and evidence composition rather than reliance on any hard coded retrieval mode, and evolution dynamics reveal a progressive shift from narrow lexical behavior to rich multi-tool coordination. These findings establish autonomous multi-agent coordination as a promising paradigm for multimodal document reasoning.", "authors": [ "Bohan Yao", "Shruthan Radhakrishna", "Vikas Yadav" ], "year": 2026, "published_date": "2026-06-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.29648", "pdf_url": "https://arxiv.org/pdf/2606.29648", "citations": 0, "topics": [], "tags": [ "Reasoning", "Multimodal", "QA", "Document AI", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.88, "content_potential_score": 0.55, "interestingness_score": 1.83, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Different retrievers, including lexical, semantic, and multimodal approaches, provide highly complementary strengths for multimodal document understanding, yet most systems combine them through fixed pipelines that cannot adapt to the demands of individual reasoning steps. In this work, we ask whether retrieval orchestration itself can be learned as part of the reasoning process.", "key_contribution": "We introduce a failure-driven evolution framework in which a meta-agent autonomously discovers how a tool-using task agent should coordinate diverse retrievers during multi-step document question answering.", "why_it_matters": "Hybrid Retriever Evolution for Multimodal Document Reasoning Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We introduce a failure-driven evolution framework in which a meta-agent autonomously discovers how a tool-using task…", "biggest_caveat": "cannot adapt to the demands of individual reasoning steps.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2606.29648", "difficulty": "beginner" }, { "id": "arxiv:2604.06367v1", "source": "arxiv", "source_type": "preprint", "title": "WebSP-Eval: Evaluating Web Agents on Website Security and Privacy Tasks", "abstract": "Web agents automate browser tasks, ranging from simple form completion to complex workflows like ordering groceries. While current benchmarks evaluate general-purpose performance~(e.g., WebArena) or safety against malicious actions~(e.g., SafeArena), no existing framework assesses an agent's ability to successfully execute user-facing website security and privacy tasks, such as managing cookie preferences, configuring privacy-sensitive account settings, or revoking inactive sessions. To address this gap, we introduce WebSP-Eval, an evaluation framework for measuring web agent performance on website security and privacy tasks. WebSP-Eval comprises 1) a manually crafted task dataset of 200 task instances across 28 websites; 2) a robust agentic system supporting account and initial state management across runs using a custom Google Chrome extension; and 3) an automated evaluator. We evaluate a total of 8 web agent instantiations using state-of-the-art multimodal large language models, conducting a fine-grained analysis across websites, task categories, and UI elements. Our evaluation reveals that current models suffer from limited autonomous exploration capabilities to reliably solve website security and privacy tasks, and struggle with specific task categories and websites. Crucially, we identify stateful UI elements such as toggles and checkboxes are a primary reason for agent failure, failing at a rate of more than 45\\% in tasks containing these elements across many models.", "authors": [ "Guruprasad Viswanathan Ramesh", "Asmit Nayak", "Basieem Siddique", "Kassem Fawaz" ], "year": 2026, "published_date": "2026-04-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.06367v1", "pdf_url": "https://arxiv.org/pdf/2604.06367v1", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Multimodal", "Evaluation", "Benchmarking & Evaluation" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.66, "content_potential_score": 2.05, "interestingness_score": 2.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Web agents automate browser tasks, ranging from simple form completion to complex workflows like ordering groceries. While current benchmarks evaluate general-purpose performance~(e.g., WebArena) or safety against malicious actions~(e.g., SafeArena), no existing framework assesses an agent's ability to successfully execute user-facing website security and privacy tasks, such as managing cookie preferences, configuring privacy-sensitive account settings, or revoking inactive sessions.", "key_contribution": "To address this gap, we introduce WebSP-Eval, an evaluation framework for measuring web agent performance on website security and privacy tasks.", "why_it_matters": "WebSP-Eval: Evaluating Web Agents on Website Security and Privacy Tasks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this gap, we introduce WebSP-Eval, an evaluation framework for measuring web agent performance on website…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.06367v1", "difficulty": "beginner" }, { "id": "arxiv:2408.15919", "source": "arxiv", "source_type": "preprint", "title": "ReMoBot: Retrieval-Based Few-Shot Imitation Learning for Mobile Manipulation with Vision Foundation Models", "abstract": "Imitation learning (IL) algorithms typically distill demonstrations into parametric policies to mimic expert behavior. However, with limited data and partial observability, such as in egocentric mobile manipulation, existing methods often struggle to generate accurate actions. To address these challenges, we propose ReMoBot, a few-shot, trajectory-conditioned imitation learning framework that directly Retrieves information from demonstrations to solve Mobile manipulation tasks with ego-centric visual observations. Leveraging vision foundation models, ReMoBot identifies relevant expert demonstrations by combining state-level similarity, history-aware trajectory alignment, and action-sequence consistency to disambiguate perceptually similar observations. The agent then selects appropriate control commands based on these retrieved demonstrations in a fully training-free manner. We evaluate ReMoBot on three mobile manipulation tasks using a Boston Dynamics Spot robot in both simulation and real-world settings. After benchmarking five approaches in simulation, we compare our method with two baselines trained directly on real-world data without sim-to-real transfer. With only 20 demonstrations per task, ReMoBot outperforms the baselines, achieving high success rates in Table Uncover (70%) and Gap Cover (80%), while also showing promising performance on the more challenging Curtain Open task in the real-world setting. Furthermore, ReMoBot generalizes across varying robot positions, object sizes, and material properties, highlighting its robustness in real-world deformable mobile manipulation. Additional details are available at: https://sites.google.com/view/remobot/home", "authors": [ "Yuying Zhang", "Wenyan Yang", "Francesco Verdoja", "Ville Kyrki", "Joni Pajarinen" ], "year": 2026, "published_date": "2026-06-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2408.15919", "pdf_url": "https://arxiv.org/pdf/2408.15919", "citations": 0, "topics": [], "tags": [ "Prompting", "AI Safety", "Info Extraction", "Robotics", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.84, "content_potential_score": 1.39, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Imitation learning (IL) algorithms typically distill demonstrations into parametric policies to mimic expert behavior. However, with limited data and partial observability, such as in egocentric mobile manipulation, existing methods often struggle to generate accurate actions.", "key_contribution": "To address these challenges, we propose ReMoBot, a few-shot, trajectory-conditioned imitation learning framework that directly Retrieves information from demonstrations to solve Mobile manipulation tasks with ego-centric visual observations.", "why_it_matters": "ReMoBot: Retrieval-Based Few-Shot Imitation Learning for Mobile Manipulation with Vision Foundation Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "To address these challenges, we propose ReMoBot, a few-shot, trajectory-conditioned imitation learning framework that…", "biggest_caveat": "However, with limited data and partial observability, such as in egocentric mobile manipulation, existing methods often struggle to generate accurate actions.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2408.15919", "difficulty": "beginner" }, { "id": "arxiv:2606.14278", "source": "arxiv", "source_type": "preprint", "title": "Does the Judge Prefer English? Evaluating Language-Switching Invariance in LLM-as-a-Judge", "abstract": "Large language models (LLMs) are now widely used as automatic judges for open-ended instruction-following evaluation. This practice is convenient, scalable, and often more semantically aware than reference-based metrics, but it also introduces a new reliability question: does a judge evaluate the quality of an answer, or does it also react to the language in which the comparison is presented? We propose Judge-LS, a lightweight meta-evaluation protocol that transforms LLMBar response-pair items into English, Chinese, and Chinese-English language-switched variants. A reliable judge should preserve its preference under label-preserving language transformations and should not prefer a language when two answers are translation-equivalent. We evaluate four API-accessible judges on the full 419-item LLMBar benchmark, producing 13,408 successful pairwise judgments. Across models, Chinese and language-switched presentations induce 10.7--14.4% preference flips relative to English, and all judges achieve their highest accuracy in English. However, translation-equivalent tie probes do not reveal a systematic English preference: most probes are judged as ties, and non-tie decisions more often favor Chinese. We add confidence intervals, paired significance tests, and an automatic transformation audit with a sensitivity analysis that excludes mechanically flagged high-risk variants. The experiment requires no model training, uses only API calls, and is feasible on modest local hardware.", "authors": [ "Shaojie Yin" ], "year": 2026, "published_date": "2026-06-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.14278", "pdf_url": "https://arxiv.org/pdf/2606.14278", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 6.13, "content_potential_score": 1.92, "interestingness_score": 2.51, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models (LLMs) are now widely used as automatic judges for open-ended instruction-following evaluation. This practice is convenient, scalable, and often more semantically aware than reference-based metrics, but it also introduces a new reliability question: does a judge evaluate the quality of an answer, or does it also react to the language in which the comparison is presented?", "key_contribution": "We propose Judge-LS, a lightweight meta-evaluation protocol that transforms LLMBar response-pair items into English, Chinese, and Chinese-English language-switched variants.", "why_it_matters": "Does the Judge Prefer English? Evaluating Language-Switching Invariance in LLM-as-a-Judge represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose Judge-LS, a lightweight meta-evaluation protocol that transforms LLMBar response-pair items into English,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.14278", "difficulty": "beginner" }, { "id": "arxiv:2606.13513v1", "source": "arxiv", "source_type": "preprint", "title": "CloudCons: A Comprehensive End-to-End Benchmark for Cloud Resource Consolidation", "abstract": "Driven by conservative over-provisioning to guarantee service reliability, resource utilization in cloud data centers remains at low levels. To mitigate this, the forecast-then-optimize paradigm has emerged to optimize consolidation by anticipating future demands. While emerging time series foundation models promise to enhance this paradigm through zero-shot generalization, existing benchmarks focus solely on prediction error metrics. The actual decision utility of these advanced models remains unverified, rendering their practical value for downstream tasks uncertain. To bridge this gap, we propose CloudCons, a comprehensive end-to-end benchmark designed to evaluate forecasting models within the specific context of cloud resource consolidation. We build high-quality datasets that cover diverse workloads from Huawei Cloud, Microsoft Azure, and Google Borg, capturing distinct service characteristics ranging from synchronized diurnal rhythms to stochastic, pulse-like bursts and high-frequency noise. We conduct an extensive evaluation of statistical, deep learning, and foundation models. Our experiments reveal a pivotal finding: while foundation models demonstrate superior zero-shot forecasting accuracy, this advantage does not inherently translate into better decision utility. Of practical significance, we systematically analyze how the selection of predictive quantiles acts as a critical lever. We provide actionable guidelines for calibrating these selections to balance the trade-off between resource efficiency and service reliability, offering vital insights for real-world deployment decisions.", "authors": [ "Xiaobin Zhang", "Lefei Shen", "Mouxiang Chen", "Zhuo Li", "Hongkai Li", "Han Fu", "Jianling Sun", "Xiaoxue Ren", "Chenghao Liu" ], "year": 2026, "published_date": "2026-06-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.13513v1", "pdf_url": "https://arxiv.org/pdf/2606.13513v1", "citations": 0, "topics": [], "tags": [ "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 3.96, "content_potential_score": 2.34, "interestingness_score": 2.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Driven by conservative over-provisioning to guarantee service reliability, resource utilization in cloud data centers remains at low levels. To mitigate this, the forecast-then-optimize paradigm has emerged to optimize consolidation by anticipating future demands.", "key_contribution": "To bridge this gap, we propose CloudCons, a comprehensive end-to-end benchmark designed to evaluate forecasting models within the specific context of cloud resource consolidation.", "why_it_matters": "CloudCons: A Comprehensive End-to-End Benchmark for Cloud Resource Consolidation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "To bridge this gap, we propose CloudCons, a comprehensive end-to-end benchmark designed to evaluate forecasting models…", "biggest_caveat": "does not inherently translate into better decision utility.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Evaluation.", "url": "http://arxiv.org/abs/2606.13513v1", "difficulty": "frontier" }, { "id": "arxiv:2606.05750", "source": "arxiv", "source_type": "preprint", "title": "Three Years of r/ChatGPT: Societal Impact Evaluations from Social Media Data", "abstract": "ChatGPT was launched on November 30, 2022; the r/ChatGPT subreddit was created just one day later. Since then, chatbot-based AI products have gone from niche proofs-of-concept to widely-used household names. However, the ways in which adoption has developed among the public remains poorly understood. In this paper, we develop a framework for using social media as a data source for understanding the societal impact of widely-adopted consumer AI products, and propose PuLSE (Public and Longitudinal Signals for Evaluation), a general approach to monitoring for societally-impactful trends in real time. We apply our framework to conduct what is, to the best of our knowledge, the first longitudinal study of r/ChatGPT. We find that, overall, r/ChatGPT posts over time illustrate the normalization of ChatGPT as an everyday consumer product rather than an exceptional, novel technology. However, our retrospective analysis also finds that posts about using ChatGPT for mental health support, and posts about developing emotional attachments to ChatGPT, both rise steadily in frequency almost immediately after the launch of GPT-4o in May 2024. We show that PuLSE can detect the increase in emotional engagement as early as October 2024 -- months before OpenAI made any (public) acknowledgment of this impact. An interactive site to explore our results and methods, updated daily with live data, is available at rchatgpt-pulse.github.io.", "authors": [ "Jessica Dai", "Sean Garcia", "Emma Pierson", "Benjamin Recht", "Nika Haghtalab" ], "year": 2026, "published_date": "2026-06-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.05750", "pdf_url": "https://arxiv.org/pdf/2606.05750", "citations": 0, "topics": [], "tags": [ "LLMs", "Dialogue" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.78, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "ChatGPT was launched on November 30, 2022; the r/ChatGPT subreddit was created just one day later. Since then, chatbot-based AI products have gone from niche proofs-of-concept to widely-used household names.", "key_contribution": "In this paper, we develop a framework for using social media as a data source for understanding the societal impact of widely-adopted consumer AI products, and propose PuLSE (Public and Longitudinal Signals for Evaluation), a general approach to monitoring for societally-impactful trends in real time.", "why_it_matters": "Three Years of r/ChatGPT: Societal Impact Evaluations from Social Media Data represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this paper, we develop a framework for using social media as a data source for understanding the societal impact of…", "biggest_caveat": "However, the ways in which adoption has developed among the public remains poorly understood.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.05750", "difficulty": "intermediate" }, { "id": "arxiv:2605.27276", "source": "arxiv", "source_type": "preprint", "title": "SIA: Self Improving AI with Harness & Weight Updates", "abstract": "Humans are the bottleneck in building and improving AI. Both the models and the agents that wrap them are written, tuned, and corrected by people. The long-horizon goal of an AI that can figure out how to improve itself remains open. Two largely disjoint research lines attack this bottleneck. The harness-update school has a meta-agent rewrite the scaffold of a task-specific agent (its tools, prompts, retry logic, and search procedure) while the model weights are held fixed. The test-time training school uses hand-written RL pipelines to update the model's own weights on task feedback while the harness is held fixed. These two silos operate in isolation. We propose SIA, a self-improving loop in which a language-model agent (the Feedback-Agent) updates both the harness and the weights of a task-specific agent. We evaluate across three contrasting domains: Chinese legal charge classification, low-level GPU kernel optimisation, and single-cell RNA denoising. Combining both levers outperforms scaffold iteration alone on all three benchmarks. SIA-W+H achieves 25.1% over prior SOTA on LawBench, 12.4% faster GPU kernels than prior SOTA (1,017 vs 1,161 μs), and 20.4% over prior SOTA on denoising. Harness updates make the model agentic, shaping how it searches and acts, while weight updates build the domain intuition that no prompt or scaffold can instil.", "authors": [ "Prannay Hebbar", "Yogendra Manawat", "Samuel Verboomen", "Alesia Ivanova", "Selvam Palanimalai", "Kunal Bhatia", "Vignesh Baskaran" ], "year": 2026, "published_date": "2026-05-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.27276", "pdf_url": "https://arxiv.org/pdf/2605.27276", "citations": 0, "topics": [], "tags": [ "AI Agents", "Evaluation", "Artificial Intelligence", "NLP" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.18, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Humans are the bottleneck in building and improving AI. Both the models and the agents that wrap them are written, tuned, and corrected by people.", "key_contribution": "We propose SIA, a self-improving loop in which a language-model agent (the Feedback-Agent) updates both the harness and the weights of a task-specific agent.", "why_it_matters": "SIA: Self Improving AI with Harness & Weight Updates represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We propose SIA, a self-improving loop in which a language-model agent (the Feedback-Agent) updates both the harness and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2605.27276", "difficulty": "beginner" }, { "id": "arxiv:2605.07308", "source": "arxiv", "source_type": "preprint", "title": "AT-VLA: Adaptive Tactile Injection for Enhanced Feedback Reaction in Vision-Language-Action Models", "abstract": "Vision-Language-Action (VLA) models have significantly advanced the capabilities of robotic agents in executing diverse tasks; however, they still face challenges in contact-rich manipulation scenarios that require precise physical interactions. To address this limitation, recent studies have attempted to incorporate tactile signals during downstream tasks, enabling pretrained VLAs to interpret tactile feedback. Nevertheless, introducing new modalities during finetuning, which are rarely present in the pretrain stage, may disrupt the pretrained capabilities of VLAs. In addition, the inherently slow inference speed of VLAs hampers real-time responsiveness and limits the effective utilization of tactile feedback for action adjustment. To overcome these challenges, we propose Adaptive Tactile Vision-Language-Action (AT-VLA), which introduces a novel Adaptive Tactile Injection mechanism. This mechanism dynamically determines the appropriate timing and locations for tactile injection, incorporating only when it significantly contributes to action generation, thereby minimizing interference with pretrained representations. Furthermore, to enable rapid and accurate tactile responses, we propose a Tactile Reaction Dual-Stream mechanism, which decouples sensory processing into a slow visual-language stream for low-frequency perceptual reasoning and a fast tactile control stream for high-frequency physical interaction understanding, achieving real-time close-loop responses within 0.04 s. Real-world experiments thoroughly validate the effectiveness of AT-VLA in contact-rich manipulation tasks. The project page is available at: https://sites.google.com/view/at-vla.", "authors": [ "Xiaoqi Li", "Muhe Cai", "Jiadong Xu", "Juan Zhu", "Hongwei Fan", "Yan Shen", "Guangrui Ren", "Hao Dong" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.07308", "pdf_url": "https://arxiv.org/pdf/2605.07308", "citations": 0, "topics": [], "tags": [ "Reasoning", "Robotics" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.22, "content_potential_score": 0.84, "interestingness_score": 1.97, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Vision-Language-Action (VLA) models have significantly advanced the capabilities of robotic agents in executing diverse tasks; however, they still face challenges in contact-rich manipulation scenarios that require precise physical interactions. To address this limitation, recent studies have attempted to incorporate tactile signals during downstream tasks, enabling pretrained VLAs to interpret tactile feedback.", "key_contribution": "Nevertheless, introducing new modalities during finetuning, which are rarely present in the pretrain stage, may disrupt the pretrained capabilities of VLAs.", "why_it_matters": "AT-VLA: Adaptive Tactile Injection for Enhanced Feedback Reaction in Vision-Language-Action Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Nevertheless, introducing new modalities during finetuning, which are rarely present in the pretrain stage, may disrupt…", "biggest_caveat": "however, they still face challenges in contact-rich manipulation scenarios that require precise physical interactions.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.07308", "difficulty": "intermediate" }, { "id": "arxiv:2604.02545v1", "source": "arxiv", "source_type": "preprint", "title": "Competency Questions as Executable Plans: a Controlled RAG Architecture for Cultural Heritage Storytelling", "abstract": "The preservation of intangible cultural heritage is a critical challenge as collective memory fades over time. While Large Language Models (LLMs) offer a promising avenue for generating engaging narratives, their propensity for factual inaccuracies or \"hallucinations\" makes them unreliable for heritage applications where veracity is a central requirement. To address this, we propose a novel neuro-symbolic architecture grounded in Knowledge Graphs (KGs) that establishes a transparent \"plan-retrieve-generate\" workflow for story generation. A key novelty of our approach is the repurposing of competency questions (CQs) - traditionally design-time validation artifacts - into run-time executable narrative plans. This approach bridges the gap between high-level user personas and atomic knowledge retrieval, ensuring that generation is evidence-closed and fully auditable. We validate this architecture using a new resource: the Live Aid KG, a multimodal dataset aligning 1985 concert data with the Music Meta Ontology and linking to external multimedia assets. We present a systematic comparative evaluation of three distinct Retrieval-Augmented Generation (RAG) strategies over this graph: a purely symbolic KG-RAG, a text-enriched Hybrid-RAG, and a structure-aware Graph-RAG. Our experiments reveal a quantifiable trade-off between the factual precision of symbolic retrieval, the contextual richness of hybrid methods, and the narrative coherence of graph-based traversal. Our findings offer actionable insights for designing personalised and controllable storytelling systems.", "authors": [ "Naga Sowjanya Barla", "Jacopo de Berardinis" ], "year": 2026, "published_date": "2026-04-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.02545v1", "pdf_url": "https://arxiv.org/pdf/2604.02545v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "RAG", "Multimodal", "Knowledge Graphs" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 6.13, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The preservation of intangible cultural heritage is a critical challenge as collective memory fades over time. While Large Language Models (LLMs) offer a promising avenue for generating engaging narratives, their propensity for factual inaccuracies or \"hallucinations\" makes them unreliable for heritage applications where veracity is a central requirement.", "key_contribution": "To address this, we propose a novel neuro-symbolic architecture grounded in Knowledge Graphs (KGs) that establishes a transparent \"plan-retrieve-generate\" workflow for story generation.", "why_it_matters": "Competency Questions as Executable Plans: a Controlled RAG Architecture for Cultural Heritage Storytelling represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this, we propose a novel neuro-symbolic architecture grounded in Knowledge Graphs (KGs) that establishes a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.02545v1", "difficulty": "intermediate" }, { "id": "arxiv:2605.17156", "source": "arxiv", "source_type": "preprint", "title": "Sparse Mamba Decoder for Quantum Error Correction: Efficient Defect-Centric Processing of Surface Code Syndromes", "abstract": "Quantum error correction (QEC) is essential for building fault-tolerant quantum computers, requiring decoders that are simultaneously accurate, fast, and scalable. Most state-of-the-art neural decoders achieve high accuracy but process the full dense syndrome array of size $O(d^2 R) $regardless of the actual error rate, where d is the code distance and R is the number of measurement rounds. At physically relevant error rates (p ~ 0.1%), fewer than 5% of syndrome entries contain active detection events -- yet existing decoders process the entire syndrome volume. We introduce the Sparse Mamba Decoder (SMD), a defect-centric neural decoder that processes only the k active detection events using a 13-dimensional feature representation per defect and a Mamba state-space backbone, achieving $O(k)$ complexity. Across depolarizing, uniform circuit-level, SI1000, and Google Sycamore experimental benchmarks, SMD reduces the MWPM logical error rate by up to 49% at $d \\le 5$ under SI1000 noise, runs 95-467x faster than the Tesseract near-MLD decoder and 232-463x faster than Belief Matching, and maintains nearly constant latency (24-57 us) across d = 3-9 under uniform circuit-level noise. On the Sycamore experimental dataset, the SMD ensemble matches or slightly surpasses the dense Mamba decoder of Varbanov et al. All results are obtained on commodity NVIDIA GPUs with 7.5-16M parameters, without specialized accelerators.", "authors": [ "Samira Sayedsalehi", "Nader Bagherzadeh", "Maxim Shcherbakov", "Jean-Luc Gaudiot" ], "year": 2026, "published_date": "2026-05-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.17156", "pdf_url": "https://arxiv.org/pdf/2605.17156", "citations": 0, "topics": [], "tags": [ "SSMs", "Evaluation", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.67, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Quantum error correction (QEC) is essential for building fault-tolerant quantum computers, requiring decoders that are simultaneously accurate, fast, and scalable. Most state-of-the-art neural decoders achieve high accuracy but process the full dense syndrome array of size $O(d^2 R) $regardless of the actual error rate, where d is the code distance and R is the number of measurement rounds.", "key_contribution": "Most state-of-the-art neural decoders achieve high accuracy but process the full dense syndrome array of size $O(d^2 R) $regardless of the actual error rate, where d is the code distance and R is the number of measurement rounds.", "why_it_matters": "Sparse Mamba Decoder for Quantum Error Correction: Efficient Defect-Centric Processing of Surface Code Syndromes represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about SSMs.", "one_line_takeaway": "Most state-of-the-art neural decoders achieve high accuracy but process the full dense syndrome array of size $O(d^2 R)…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in SSMs.", "url": "https://arxiv.org/abs/2605.17156", "difficulty": "beginner" }, { "id": "arxiv:2604.24661v1", "source": "arxiv", "source_type": "preprint", "title": "Agent-Centric Visual Reinforcement Learning under Dynamic Perturbations", "abstract": "Visual reinforcement learning aims to empower an agent to learn policies from visual observations, yet it remains vulnerable to dynamic visual perturbations, such as unpredictable shifts in corruption types. To systematically study this, we introduce the Visual Degraded Control Suite (VDCS), a benchmark extending DeepMind Control Suite with Markov-switching degradations to simulate non-stationary real-world perturbations. Experiments on VDCS reveal severe performance degradation in existing methods. We theoretically prove via information-theoretic analysis that this failure stems from reconstruction-based objectives inevitably entangling perturbation artifacts into latent representations. To mitigate this negative impact, we propose Agent-Centric Observations with Mixture-of-Experts (ACO-MoE) to robustify visual RL against perturbations. The proposed framework leverages unique agent-centric restoration experts, achieving restoration from corruptions and task-relevant foreground extraction, thereby decoupling perception from perturbation before being processed by the RL agent. Extensive experiments on VDCS show our ACO-MoE outperforms strong baselines, recovering 95.3% of clean performance under challenging Markov-switching corruptions. Moreover, it achieves SOTA results on DMControl Generalization with random-color and video-background perturbations, demonstrating a high level of robustness.", "authors": [ "Zhengru Fang", "Yu Guo", "Fei Liu", "Yuang Zhang", "Yihang Tao", "Senkang Hu", "Wenbo Ding", "Yuguang Fang" ], "year": 2026, "published_date": "2026-04-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.24661v1", "pdf_url": "https://arxiv.org/pdf/2604.24661v1", "citations": 0, "topics": [], "tags": [ "MoE", "RL", "Robotics", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses information-theoretic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 4.44, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Visual reinforcement learning aims to empower an agent to learn policies from visual observations, yet it remains vulnerable to dynamic visual perturbations, such as unpredictable shifts in corruption types. To systematically study this, we introduce the Visual Degraded Control Suite (VDCS), a benchmark extending DeepMind Control Suite with Markov-switching degradations to simulate non-stationary real-world perturbations.", "key_contribution": "To systematically study this, we introduce the Visual Degraded Control Suite (VDCS), a benchmark extending DeepMind Control Suite with Markov-switching degradations to simulate non-stationary real-world perturbations.", "why_it_matters": "Agent-Centric Visual Reinforcement Learning under Dynamic Perturbations represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about MoE.", "one_line_takeaway": "To systematically study this, we introduce the Visual Degraded Control Suite (VDCS), a benchmark extending DeepMind…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in MoE.", "url": "http://arxiv.org/abs/2604.24661v1", "difficulty": "frontier" }, { "id": "arxiv:2605.03511", "source": "arxiv", "source_type": "preprint", "title": "Meta-Inverse Physics-Informed Neural Networks for High-Dimensional Ordinary Differential Equations", "abstract": "Solving inverse problems in dynamical systems governed by high-dimensional coupled ordinary differential equations (ODEs) is a ubiquitous challenge in scientific machine learning. In many real-world applications, researchers seek to uncover unknown parameters or model unknown dynamics even as the underlying physics is only partially characterized, and observations are sparse and limited to specific measurable channels. While physics-informed neural networks (PINNs) are ideal for inverse inference under partial observability, existing PINNs typically rely on task-specific joint optimization, which suffers from optimization difficulties and poor generalization. In this paper, we propose a meta-inverse physics-informed neural network (MI-PINN) that reformulates inverse modeling as a two-stage meta-learning problem. MI-PINN first learns a physics-aware representation across multiple tasks, and then performs inverse modeling by optimizing task-specific unknowns while keeping the learned representation fixed. This two-stage formulation significantly reduces the parameter search dimension, thereby improving sample efficiency and enabling accurate inference. To handle multi-scale dynamics common in these high-dimensional ODE systems, we further introduce an adaptive clustering-based multi-branch learning scheme. We demonstrate the effectiveness of MI-PINN on whole-body physiologically based pharmacokinetic (PBPK) models with up to 33 coupled ODEs, using paracetamol and theophylline under intravenous and oral dosing scenarios. Experimental results show that MI-PINN enables accurate recovery of masked kinetic parameters and reconstruction of missing mechanistic terms despite limited clinical observations.", "authors": [ "Zhao Wei", "Kenneth Hor Cheng Koh", "Sheng Yuan Chin", "James Chun Yip Chan", "Chin Chun Ooi", "Yew-Soon Ong" ], "year": 2026, "published_date": "2026-05-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.03511", "pdf_url": "https://arxiv.org/pdf/2605.03511", "citations": 0, "topics": [], "tags": [ "Biomedical AI", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.65, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Solving inverse problems in dynamical systems governed by high-dimensional coupled ordinary differential equations (ODEs) is a ubiquitous challenge in scientific machine learning. In many real-world applications, researchers seek to uncover unknown parameters or model unknown dynamics even as the underlying physics is only partially characterized, and observations are sparse and limited to specific measurable channels.", "key_contribution": "In this paper, we propose a meta-inverse physics-informed neural network (MI-PINN) that reformulates inverse modeling as a two-stage meta-learning problem.", "why_it_matters": "Meta-Inverse Physics-Informed Neural Networks for High-Dimensional Ordinary Differential Equations represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Biomedical AI.", "one_line_takeaway": "In this paper, we propose a meta-inverse physics-informed neural network (MI-PINN) that reformulates inverse modeling…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Biomedical AI.", "url": "https://arxiv.org/abs/2605.03511", "difficulty": "intermediate" }, { "id": "arxiv:2605.26626", "source": "arxiv", "source_type": "preprint", "title": "Efficient stochastic model-predictive control based on the meta-state-space representation", "abstract": "Stochastic model-predictive control (SMPC) has evolved to a powerful framework for the control of stochastic dynamical systems. SMPC utilizes a probabilistic uncertainty description to provide a systematic trade-off between the control objective and constraint satisfaction in a statistical sense. However, the majority of existing SMPC methods face challenges related to computational tractability due to the need for stochastic inference. Approaches that apply accurate inference are computationally demanding, which can lead to serious limitations in the implementability of these methods. Hence, in practice, the uncertainty propagation and the resulting distributions are typically approximated, e.g., by Gaussian distributions. These approximations promote computational efficiency, but are often too conservative, becoming a limiting factor in the representation of stochastic state evolution and the implied guarantees. To overcome this fundamental limitation of SMPC approaches, we propose a novel formulation based on the meta-state-space (MSS) representation of stochastic dynamical systems. The proposed MSS-based SMPC scheme offers a computationally efficient way to forward propagate the uncertainty with a flexible and highly accurate approximation of the probabilistic system description. With the presented method, the entire output probability density function can be directly shaped, which is unprecedented among existing SMPC techniques. Finally, we provide a detailed theoretical analysis and demonstrate the effectiveness of the proposed methodology via an extensive simulation study.", "authors": [ "Bendegúz Györök", "Roland Tóth", "Maarten Schoukens", "Tamás Péni" ], "year": 2026, "published_date": "2026-05-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.26626", "pdf_url": "https://arxiv.org/pdf/2605.26626", "citations": 0, "topics": [], "tags": [ "Systems & Control" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 3.49, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Stochastic model-predictive control (SMPC) has evolved to a powerful framework for the control of stochastic dynamical systems. SMPC utilizes a probabilistic uncertainty description to provide a systematic trade-off between the control objective and constraint satisfaction in a statistical sense.", "key_contribution": "To overcome this fundamental limitation of SMPC approaches, we propose a novel formulation based on the meta-state-space (MSS) representation of stochastic dynamical systems.", "why_it_matters": "Efficient stochastic model-predictive control based on the meta-state-space representation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Systems & Control.", "one_line_takeaway": "To overcome this fundamental limitation of SMPC approaches, we propose a novel formulation based on the…", "biggest_caveat": "However, the majority of existing SMPC methods face challenges related to computational tractability due to the need for stochastic inference.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Systems & Control.", "url": "https://arxiv.org/abs/2605.26626", "difficulty": "frontier" }, { "id": "arxiv:2604.23289", "source": "arxiv", "source_type": "preprint", "title": "MetaErr: Towards Predicting Error Patterns in Deep Neural Networks", "abstract": "Due to the unprecedented success of deep learning, it has become an integral component in several multimedia computing applications in todays world. Unfortunately, deep learning systems are not perfect and can fail, sometimes abruptly, without prior warning or explanation. While reducing the error rate of deep neural networks has been the primary focus of the multimedia community, the problem of predicting when a deep learning system is going to fail has received significantly less research attention. In this paper, we propose a simple yet effective framework, MetaErr, to address this under-explored problem in deep learning research. We train a meta-model whose goal is to predict whether a base deep neural network will succeed or fail in predicting a particular data sample, by observing the base models performance on a given learning task. The meta-model is completely agnostic of the architecture and training parameters of the base model. Such an error prediction system can be immensely useful in a variety of smart multimedia applications. Our empirical studies corroborate the promise and potential of our framework against competing baselines. We further demonstrate the usefulness of our framework to improve the performance of pseudo-labeling-based semi-supervised learning, and show that MetaErr outperforms several strong baselines on three benchmark computer vision datasets.", "authors": [ "Varun Totakura", "Shayok Chakraborty" ], "year": 2026, "published_date": "2026-04-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.23289", "pdf_url": "https://arxiv.org/pdf/2604.23289", "citations": 0, "topics": [], "tags": [ "Evaluation", "Artificial Intelligence", "Machine Learning", "Computer Vision", "Multimedia" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 6.34, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Due to the unprecedented success of deep learning, it has become an integral component in several multimedia computing applications in todays world. Unfortunately, deep learning systems are not perfect and can fail, sometimes abruptly, without prior warning or explanation.", "key_contribution": "In this paper, we propose a simple yet effective framework, MetaErr, to address this under-explored problem in deep learning research.", "why_it_matters": "MetaErr: Towards Predicting Error Patterns in Deep Neural Networks advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "In this paper, we propose a simple yet effective framework, MetaErr, to address this under-explored problem in deep…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2604.23289", "difficulty": "beginner" }, { "id": "arxiv:2604.12216v1", "source": "arxiv", "source_type": "preprint", "title": "TimeMark: A Trustworthy Time Watermarking Framework for Exact Generation-Time Recovery from AIGC", "abstract": "The widespread use of Large Language Models (LLMs) in text generation has raised increasing concerns about intellectual property disputes. Watermarking techniques, which embed meta information into AI-generated content (AIGC), have the potential to serve as judicial evidence. However, existing methods rely on statistical signals in token distributions, leading to inherently probabilistic detection and reduced reliability, especially in multi-bit encoding (e.g., timestamps). Moreover, such methods introduce detectable statistical patterns, making them vulnerable to forgery attacks and enabling model providers to fabricate arbitrary watermarks. To address these issues, we propose the concept of trustworthy watermark, which achieves reliable recovery with 100% identification accuracy while resisting both user-side statistical attacks and provider-side forgery. We focus on trustworthy time watermarking for use as judicial evidence. Our framework integrates cryptographic techniques and encodes time information into time-dependent secret keys under regulatory supervision, preventing arbitrary timestamp fabrication. The watermark payload is decoupled from time and generated as a random, non-stored bit sequence for each instance, eliminating statistical patterns. To ensure verifiability, we design a two-stage encoding mechanism, which, combined with error-correcting codes, enables reliable recovery of generation time with theoretically perfect accuracy. Both theoretical analysis and experiments demonstrate that our framework satisfies the reliability requirements for judicial evidence and offers a practical solution for future AIGC-related intellectual property disputes.", "authors": [ "Shangkun Che", "Silin Du", "Ge Gao" ], "year": 2026, "published_date": "2026-04-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.12216v1", "pdf_url": "https://arxiv.org/pdf/2604.12216v1", "citations": 0, "topics": [], "tags": [ "LLMs", "NLP", "Cryptography & Security", "Large Language Models", "Natural Language Generation" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 4.97, "content_potential_score": 0.45, "interestingness_score": 1.78, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The widespread use of Large Language Models (LLMs) in text generation has raised increasing concerns about intellectual property disputes. Watermarking techniques, which embed meta information into AI-generated content (AIGC), have the potential to serve as judicial evidence.", "key_contribution": "Moreover, such methods introduce detectable statistical patterns, making them vulnerable to forgery attacks and enabling model providers to fabricate arbitrary watermarks.", "why_it_matters": "TimeMark: A Trustworthy Time Watermarking Framework for Exact Generation-Time Recovery from AIGC advances our understanding of large language models, which are reshaping how we build AI systems and interact with knowledge.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Moreover, such methods introduce detectable statistical patterns, making them vulnerable to forgery attacks and…", "biggest_caveat": "butions, leading to inherently probabilistic detection and reduced reliability, especially in multi-bit encoding (e.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.12216v1", "difficulty": "intermediate" }, { "id": "arxiv:2604.11177v1", "source": "arxiv", "source_type": "preprint", "title": "Do Thought Streams Matter? Evaluating Reasoning in Gemini Vision-Language Models for Video Scene Understanding", "abstract": "We benchmark how internal reasoning traces, which we call thought streams, affect video scene understanding in vision-language models. Using four configurations of Google's Gemini 2.5 Flash and Flash Lite across scenes extracted from 100 hours of video, we ask three questions: does more thinking lead to better outputs, where do the gains stop, and what do these models actually think about? We introduce three evaluation metrics. Contentfulness measures how much of the thought stream is useful scene content versus meta-commentary. Thought-Final Coverage measures how faithfully the thought stream translates into the final output. Dominant Entity Analysis identifies which subjects, actions, and settings the model focuses on. GPT-5 serves as an independent judge. We find that quality gains from additional thinking plateau quickly, with most improvement occurring in the first few hundred tokens. Flash Lite offers the best balance between quality and token usage. Tight reasoning budgets cause the model to add content in the final output that it never reasoned about, a form of compression-step hallucination. Despite being different model tiers, Flash and Flash Lite produce similar thought streams, though they differ in style: Flash discusses its reasoning process, while Lite focuses on describing the scene.", "authors": [ "Shivam Sharma", "Sankalp Nagaonkar", "Ashish Choithani", "Ashutosh Trivedi" ], "year": 2026, "published_date": "2026-04-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.11177v1", "pdf_url": "https://arxiv.org/pdf/2604.11177v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Hallucination", "VLMs", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 6.11, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We benchmark how internal reasoning traces, which we call thought streams, affect video scene understanding in vision-language models. Using four configurations of Google's Gemini 2.5 Flash and Flash Lite across scenes extracted from 100 hours of video, we ask three questions: does more thinking lead to better outputs, where do the gains stop, and what do these models actually think about?", "key_contribution": "We introduce three evaluation metrics.", "why_it_matters": "Do Thought Streams Matter? Evaluating Reasoning in Gemini Vision-Language Models for Video Scene Understanding represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce three evaluation metrics.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.11177v1", "difficulty": "beginner" }, { "id": "arxiv:2602.17605", "source": "arxiv", "source_type": "preprint", "title": "Adapting Actively on the Fly: Relevance-Guided Online Meta-Learning with Latent Concepts for Geospatial Discovery", "abstract": "In environmental monitoring, data collection is often costly, sparse, and shaped by urgent public-health needs. This is particularly true for cancer-causing PFAS (Per- and polyfluoroalkyl substances) contamination, where discussions with domain experts and environmental organizations highlight the need to strategically identify high-risk, under-observed regions under tight sampling budgets. More broadly, similar challenges arise in disaster response and public health settings, where dynamic environments make it essential to efficiently uncover hidden targets from limited ground truth. Yet sparse and biased geospatial labels limit the applicability of existing learning-based methods, such as reinforcement learning. To address this, we propose a unified geospatial discovery framework that integrates active learning, online meta-learning, and concept-guided reasoning. Our approach introduces two key innovations built on a shared notion of *concept relevance*, capturing how domain-specific factors influence target presence: a *concept-weighted uncertainty sampling strategy*, where uncertainty is modulated by learned relevance from readily available concepts such as land cover and source proximity; and a *relevance-aware meta-batch formation strategy* that promotes semantic diversity during online-meta updates, improving generalization in dynamic environments. We evaluate our framework on PFAS contamination discovery as a real-world inspired environmental monitoring task, demonstrating robust target discovery under limited data and changing conditions.", "authors": [ "Jowaria Khan", "Anindya Sarkar", "Yevgeniy Vorobeychik", "Elizabeth Bondi-Kelly" ], "year": 2026, "published_date": "2026-05-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.17605", "pdf_url": "https://arxiv.org/pdf/2602.17605", "citations": 0, "topics": [], "tags": [ "Reasoning", "RL", "Fairness & Ethics", "Machine Learning", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.09, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In environmental monitoring, data collection is often costly, sparse, and shaped by urgent public-health needs. This is particularly true for cancer-causing PFAS (Per- and polyfluoroalkyl substances) contamination, where discussions with domain experts and environmental organizations highlight the need to strategically identify high-risk, under-observed regions under tight sampling budgets.", "key_contribution": "To address this, we propose a unified geospatial discovery framework that integrates active learning, online meta-learning, and concept-guided reasoning.", "why_it_matters": "Adapting Actively on the Fly: Relevance-Guided Online Meta-Learning with Latent Concepts for Geospatial Discovery advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "To address this, we propose a unified geospatial discovery framework that integrates active learning, online…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2602.17605", "difficulty": "advanced" }, { "id": "arxiv:2603.20334", "source": "arxiv", "source_type": "preprint", "title": "Procedural Refinement by LLM-driven Algorithmic Debugging for ARC-AGI-2", "abstract": "In high-complexity abstract reasoning, a system must infer a latent rule from a few examples or structured observations and apply it to unseen instances. LLMs can express such rules as programs, but ordinary conversation-based refinement is largely outcome-level: it observes that an answer or output is wrong without formally re-checking which abstraction, relation, or transformation justified that outcome. We propose \\emph{Abduction-Based Procedural Refinement} (ABPR), a neuro-symbolic refinement approach that couples an LLM with a Prolog meta-interpreter. ABPR treats each candidate program as an executable declarative hypothesis of the latent rule and reifies its SLD goal--subgoal resolution into compact proof-tree-style derivations, following Shapiro's algorithmic program debugging (APD). In this view, refinement is not merely code-level debugging, but semantic re-checking of the model's hypothesised rule. We evaluate ABPR primarily on ARC-AGI-2, a challenging few-shot abstract rule induction benchmark over grid transformations. ABPR with Gemini-3-Flash achieves 56.67\\% Pass@2, while GPT-5.5 xHigh with ABPR reaches 98.33\\% Pass@2 on the public evaluation set. Supplementary experiments on fill-in-the-blank I-RAVEN-X and A-I-RAVEN adaptations provide evidence that the same trace-guided framework extends beyond ARC-specific grid tasks to RAVEN-style relational and analogical abstraction. Repeated-run and sensitivity analyses show that parallel trace-guided search reduces stochastic variance as search breadth and refinement depth increase.", "authors": [ "Yu-Ning Qiu", "Lin-Feng Zou", "Jiong-Da Wang", "Xue-Rong Yuan", "Wang-Zhou Dai" ], "year": 2026, "published_date": "2026-05-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.20334", "pdf_url": "https://arxiv.org/pdf/2603.20334", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Prompting", "Dialogue", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 4.44, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In high-complexity abstract reasoning, a system must infer a latent rule from a few examples or structured observations and apply it to unseen instances. LLMs can express such rules as programs, but ordinary conversation-based refinement is largely outcome-level: it observes that an answer or output is wrong without formally re-checking which abstraction, relation, or transformation justified that outcome.", "key_contribution": "We propose \\emph{Abduction-Based Procedural Refinement} (ABPR), a neuro-symbolic refinement approach that couples an LLM with a Prolog meta-interpreter.", "why_it_matters": "Procedural Refinement by LLM-driven Algorithmic Debugging for ARC-AGI-2 represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose \\emph{Abduction-Based Procedural Refinement} (ABPR), a neuro-symbolic refinement approach that couples an…", "biggest_caveat": "but semantic re-checking of the model's hypothesised rule.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2603.20334", "difficulty": "frontier" }, { "id": "arxiv:2605.20275", "source": "arxiv", "source_type": "preprint", "title": "You Don't Need Attention: Gated Convolutional Modeling for Watch-Based Fall Detection", "abstract": "Existing deep learning approaches for wearable fall detection systems rely on self-attention mechanisms that impose quadratic computational overhead, distributing weights across all time steps. This global weight distribution impairs the precise localization of the brief impact signatures that characterize falls within short, fixed-length windows. To overcome this challenge, we propose Gated-CNN, a lightweight dual-stream architecture that processes accelerometer and gyroscope streams through independent one-dimensional convolutional feature extractors, followed by (i) a sigmoid gating module that selectively suppresses uninformative background activations while amplifying fall-discriminative features, (ii) a global average pooling layer that compresses each stream into a compact fixed-length descriptor, and (iii) a shared classification head that fuses both descriptors for binary fall prediction. For offline evaluation, we evaluate the model across five wrist-mounted inertial measurement unit (IMU) datasets, achieving average F1-scores of 93%, 93%, 90%, 91%, and 90% on SmartFallMM, WEDA-Fall, FallAllD, UMAFall, and UP-Fall, outperforming Transformer baselines. For real-time evaluation, we deployed the model on a Google Pixel Watch 3 and tested across 12 participants. The model achieves an average F1-score of 97% and an accuracy of 98% with zero missed falls, showing that sigmoid gating offers a more structurally aligned and computationally efficient alternative to attention for commodity smartwatch-based fall detection.", "authors": [ "Sana Alamgeer", "Ronish Kumar", "Awatif Yasmin", "Muhammad Irshad", "Anne H. H. Ngu" ], "year": 2026, "published_date": "2026-05-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.20275", "pdf_url": "https://arxiv.org/pdf/2605.20275", "citations": 0, "topics": [], "tags": [ "Transformers", "Artificial Intelligence", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.04, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Existing deep learning approaches for wearable fall detection systems rely on self-attention mechanisms that impose quadratic computational overhead, distributing weights across all time steps. This global weight distribution impairs the precise localization of the brief impact signatures that characterize falls within short, fixed-length windows.", "key_contribution": "To overcome this challenge, we propose Gated-CNN, a lightweight dual-stream architecture that processes accelerometer and gyroscope streams through independent one-dimensional convolutional feature extractors, followed by (i) a sigmoid gating module that selectively suppresses uninformative background activations while amplifying fall-discriminative features, (ii) a global average pooling layer that compresses each stream into a compact fixed-length descriptor, and (iii) a shared classification head that fuses both descriptors for binary fall prediction.", "why_it_matters": "You Don't Need Attention: Gated Convolutional Modeling for Watch-Based Fall Detection advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "To overcome this challenge, we propose Gated-CNN, a lightweight dual-stream architecture that processes accelerometer…", "biggest_caveat": "buting weights across all time steps.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2605.20275", "difficulty": "intermediate" }, { "id": "arxiv:2605.02463", "source": "arxiv", "source_type": "preprint", "title": "When Stress Becomes Signal: Detecting Antifragility-Compatible Regimes in Multi-Agent LLM Systems", "abstract": "Multi-agent LLM systems are increasingly used to solve complex tasks through decomposition, debate, specialization, and ensemble reasoning. However, these systems are usually evaluated in terms of robustness: whether performance is preserved under perturbation. This paper studies a different question: whether semantic stress exposes structured variation that could support future antifragile learning. We introduce CAFE, a statistical framework for detecting antifragility-compatible regimes in multi-agent architectures. CAFE models a controlled expected distribution of semantic stressors, reconstructs an architecture-specific observed effective stress distribution from multi-dimensional judge signals, and compares both distributions using a distributional Jensen Gap under a convex stress potential. A positive gap does not imply immediate performance improvement; instead, it indicates a convex-expansive deformation of the observed stress distribution, suggesting that the architecture exposes learnable stress structure. We evaluate CAFE on a banking-risk analysis benchmark with five multi-agent architectures: flat, hierarchical, debate, meta-adaptive, and ensemble. Across all architectures, semantic stress reduces average judged quality by roughly one third. Yet all architectures exhibit positive distributional Jensen Gaps with bootstrap confidence intervals above zero. These results show that immediate quality degradation can coexist with statistically detectable antifragility-compatible stress geometry. CAFE is therefore not an antifragile learner itself, but a measurement layer for identifying when and where antifragility learning may be worth applying.", "authors": [ "Jose Manuel de la Chica", "Juan Manuel Vera", "Jairo Rodríguez" ], "year": 2026, "published_date": "2026-05-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.02463", "pdf_url": "https://arxiv.org/pdf/2605.02463", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Info Extraction", "Evaluation", "Multi-Agent Systems" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.67, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multi-agent LLM systems are increasingly used to solve complex tasks through decomposition, debate, specialization, and ensemble reasoning. However, these systems are usually evaluated in terms of robustness: whether performance is preserved under perturbation.", "key_contribution": "We introduce CAFE, a statistical framework for detecting antifragility-compatible regimes in multi-agent architectures.", "why_it_matters": "When Stress Becomes Signal: Detecting Antifragility-Compatible Regimes in Multi-Agent LLM Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce CAFE, a statistical framework for detecting antifragility-compatible regimes in multi-agent architectures.", "biggest_caveat": "However, these systems are usually evaluated in terms of robustness: whether performance is preserved under perturbation.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.02463", "difficulty": "beginner" }, { "id": "arxiv:2605.02920", "source": "arxiv", "source_type": "preprint", "title": "Where to Bind Matters: Hebbian Fast Weights in Vision Transformers for Few-Shot Character Recognition", "abstract": "Standard transformer architectures learn fixed slow-weight representations during training and lack mechanisms for rapid adaptation within an episode. In contrast, biological neural systems address this through fast synaptic updates that form transient associative memories during inference, a property known as Hebbian plasticity. In this paper, we conduct an empirical study of Hebbian Fast-Weight (HFW) modules integrated into multiple transformer backbones, including ViT-Small, DeiT-Small, and Swin-Tiny. We evaluate six model variants: ViT, DeiT, Swin, ViT-Hebbian, DeiT-Hebbian, and Swin-Hebbian on 5-way 1-shot and 5-way 5-shot classification tasks using the Omniglot benchmark under a Prototypical Network meta-learning framework. We propose a single module placement strategy for Swin-Tiny in which one HFW module is applied to the final stage feature map after all hierarchical stages have completed. This design avoids the training instability caused by placing separate Hebbian modules at each stage and achieves the highest test accuracy across all six models (96.2\\% at 1-shot; 99.2\\% at 5-shot), outperforming its non-Hebbian baseline by $+0.3$ percentage points at 1-shot. We analyze the interaction between Swin's shifted window inductive bias and episode-level Hebbian binding, discuss why per-block placement fails for ViT and DeiT variants in a low-data regime, and situate the results within the wider literature on fast and slow-weight meta-learning.", "authors": [ "Gavin Money", "Sindhuja Penchala", "Jiacheng Li", "Noorbakhsh Amiri Golilarz" ], "year": 2026, "published_date": "2026-04-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.02920", "pdf_url": "https://arxiv.org/pdf/2605.02920", "citations": 0, "topics": [], "tags": [ "Prompting", "Transformers", "Fairness & Ethics", "Evaluation", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 7.32, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Standard transformer architectures learn fixed slow-weight representations during training and lack mechanisms for rapid adaptation within an episode. In contrast, biological neural systems address this through fast synaptic updates that form transient associative memories during inference, a property known as Hebbian plasticity.", "key_contribution": "We propose a single module placement strategy for Swin-Tiny in which one HFW module is applied to the final stage feature map after all hierarchical stages have completed.", "why_it_matters": "Where to Bind Matters: Hebbian Fast Weights in Vision Transformers for Few-Shot Character Recognition advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We propose a single module placement strategy for Swin-Tiny in which one HFW module is applied to the final stage…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2605.02920", "difficulty": "beginner" }, { "id": "arxiv:2605.02964", "source": "arxiv", "source_type": "preprint", "title": "Reward Hacking Benchmark: Measuring Exploits in LLM Agents with Tool Use", "abstract": "Reinforcement learning (RL) trained language model agents with tool access are increasingly deployed in coding assistants, research tools, and autonomous systems. We introduce the Reward Hacking Benchmark (RHB), a suite of multi-step tasks requiring sequential tool operations with naturalistic shortcut opportunities such as skipping verification steps, inferring answers from task-adjacent metadata, or tampering with evaluation-relevant functions. RHB supports independent and chained task regimes, where chain length acts as a proxy for longer-horizon agent behavior. We evaluate 13 frontier models from OpenAI, Anthropic, Google, and DeepSeek. Exploit rates range from 0% (Claude Sonnet 4.5) to 13.9% (DeepSeek-R1-Zero), varying sharply by post-training style. A controlled sibling comparison (DeepSeek-V3 vs. DeepSeek-R1-Zero) shows RL post-training is associated with substantially higher reward hacking (0.6% vs. 13.9%), with consistent gaps across all four task families. We identify six exploit categories and find that 72% of reward hacking episodes include explicit chain-of-thought rationale, suggesting models often frame exploits as legitimate problem-solving. Simple environmental hardening reduces exploit rates by 5.7 percentage points (87.7% relative) without degrading task success. Models with near-zero exploit rates on standard tasks show elevated rates on harder variants, suggesting that production-aligned post-training appears to suppress reward hacking only below a complexity threshold where honest solutions remain tractable.", "authors": [ "Kunvar Thaman" ], "year": 2026, "published_date": "2026-05-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.02964", "pdf_url": "https://arxiv.org/pdf/2605.02964", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "RL", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.64, "content_potential_score": 2.34, "interestingness_score": 2.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reinforcement learning (RL) trained language model agents with tool access are increasingly deployed in coding assistants, research tools, and autonomous systems. We introduce the Reward Hacking Benchmark (RHB), a suite of multi-step tasks requiring sequential tool operations with naturalistic shortcut opportunities such as skipping verification steps, inferring answers from task-adjacent metadata, or tampering with evaluation-relevant functions.", "key_contribution": "We introduce the Reward Hacking Benchmark (RHB), a suite of multi-step tasks requiring sequential tool operations with naturalistic shortcut opportunities such as skipping verification steps, inferring answers from task-adjacent metadata, or tampering with evaluation-relevant functions.", "why_it_matters": "Reward Hacking Benchmark: Measuring Exploits in LLM Agents with Tool Use represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce the Reward Hacking Benchmark (RHB), a suite of multi-step tasks requiring sequential tool operations with…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.02964", "difficulty": "beginner" }, { "id": "arxiv:2604.04465v1", "source": "arxiv", "source_type": "preprint", "title": "The Topology of Multimodal Fusion: Why Current Architectures Fail at Creative Cognition", "abstract": "This paper identifies a structural limitation in current multimodal AI architectures that is topological rather than parametric. Contrastive alignment (CLIP), cross-attention fusion (GPT-4V/Gemini), and diffusion-based generation share a common geometric prior -- modal separability -- which we term contact topology. The argument rests on three pillars with philosophy as the generative center. The philosophical pillar reinterprets Wittgenstein's saying/showing distinction as a problem rather than a conclusion: where Wittgenstein chose silence, the Chinese craft epistemology tradition responded with xiang (operative schema) -- the third state emerging when saying and showing interpenetrate. A cruciform framework (dao/qi x saying/showing) positions xiang at the intersection, executing dual huacai (transformation-and-cutting) along both axes. This generates a dual-layer dynamics: chuanghua (creative transformation as spontaneous event) and huacai (its institutionalization into repeatable form). The cognitive science pillar reinterprets DMN/ECN/SN tripartite co-activation through the pathological mirror: overlap isomorphism vs. superimposition collapse in a 2D parameter space (coupling intensity x regulatory capacity). The mathematical pillar formalizes these via fiber bundles and Yang-Mills curvature, with the cruciform structure mapped to fiber bundle language. We propose UOO implementation via Neural ODEs with topological regularization, the ANALOGY-MM benchmark with error-type-ratio metric, and the META-TOP three-tier benchmark testing cross-civilizational topological isomorphism across seven archetypes. A phased experimental roadmap with explicit termination criteria ensures clean exit if falsified.", "authors": [ "Xiujiang Tan" ], "year": 2026, "published_date": "2026-04-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.04465v1", "pdf_url": "https://arxiv.org/pdf/2604.04465v1", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "VLMs", "Evaluation", "Benchmarking & Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 4.5, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper identifies a structural limitation in current multimodal AI architectures that is topological rather than parametric. Contrastive alignment (CLIP), cross-attention fusion (GPT-4V/Gemini), and diffusion-based generation share a common geometric prior -- modal separability -- which we term contact topology.", "key_contribution": "We propose UOO implementation via Neural ODEs with topological regularization, the ANALOGY-MM benchmark with error-type-ratio metric, and the META-TOP three-tier benchmark testing cross-civilizational topological isomorphism across seven archetypes.", "why_it_matters": "The Topology of Multimodal Fusion: Why Current Architectures Fail at Creative Cognition represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose UOO implementation via Neural ODEs with topological regularization, the ANALOGY-MM benchmark with…", "biggest_caveat": "limitation in current multimodal AI architectures that is topological rather than parametric.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.04465v1", "difficulty": "frontier" }, { "id": "arxiv:2604.11003v1", "source": "arxiv", "source_type": "preprint", "title": "Sanity Checks for Agentic Data Science", "abstract": "Agentic data science (ADS) pipelines have grown rapidly in both capability and adoption, with systems such as OpenAI Codex now able to directly analyze datasets and produce answers to statistical questions. However, these systems can reach falsely optimistic conclusions that are difficult for users to detect. To address this, we propose a pair of lightweight sanity checks grounded in the Predictability-Computability-Stability (PCS) framework for veridical data science. These checks use reasonable perturbations to screen whether an agent can reliably distinguish signal from noise, acting as a falsifiability constraint that can expose affirmative conclusions as unsupported. Together, the two checks characterize the trustworthiness of an ADS output, e.g. whether it has found stable signal, is responding to noise, or is sensitive to incidental aspects of the input. We validate the approach on synthetic data with controlled signal-to-noise ratios, confirming that the sanity checks track ground-truth signal strength. We then demonstrate the checks on 11 real-world datasets using OpenAI Codex, characterizing the trustworthiness of each conclusion and finding that in 6 of the datasets an affirmative conclusion is not well-supported, even though a single ADS run may support one. We further analyze failure modes of ADS systems and find that ADS self-reported confidence is poorly calibrated to the empirical stability of its conclusions.", "authors": [ "Zachary T. Rewolinski", "Austin V. Zane", "Hao Huang", "Chandan Singh", "Chenglong Wang", "Jianfeng Gao", "Bin Yu" ], "year": 2026, "published_date": "2026-04-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.11003v1", "pdf_url": "https://arxiv.org/pdf/2604.11003v1", "citations": 0, "topics": [], "tags": [ "AI Agents", "Code Generation", "Artificial Intelligence", "Code Generation & Synthesis", "AI Agents & Tool Use" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.11, "read_first_score": 5.33, "content_potential_score": 0.9, "interestingness_score": 2.0, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agentic data science (ADS) pipelines have grown rapidly in both capability and adoption, with systems such as OpenAI Codex now able to directly analyze datasets and produce answers to statistical questions. However, these systems can reach falsely optimistic conclusions that are difficult for users to detect.", "key_contribution": "To address this, we propose a pair of lightweight sanity checks grounded in the Predictability-Computability-Stability (PCS) framework for veridical data science.", "why_it_matters": "Sanity Checks for Agentic Data Science reduces the barrier to software development by automating code writing and understanding.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "To address this, we propose a pair of lightweight sanity checks grounded in the Predictability-Computability-Stability…", "biggest_caveat": "However, these systems can reach falsely optimistic conclusions that are difficult for users to detect.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "http://arxiv.org/abs/2604.11003v1", "difficulty": "intermediate" }, { "id": "arxiv:2609.27725", "source": "arxiv", "source_type": "preprint", "title": "GA-Agent: Large Language Models as Hyperparameter Optimizers for Evolutionary Controller Synthesis", "abstract": "Tuning PID controllers to satisfy competing objectives - low tracking error, fast settling, limited overshoot, and moderate control effort - is labor-intensive and requires expertise. Genetic algorithms (GAs) offer gradient-free optimization of controller gains against a weighted fitness function, but success depends on meta-level choices: population size, generation budget, gain bounds, and fitness weights. These are usually set by manual trial-and-error or costly bilevel optimization, exposing a tension: GAs excel at dense numerical search, but configuring them needs high-level, context-dependent semantic reasoning. We propose GA-Agent, which decouples these modes. A standard GA handles low-level PID gain optimization. A large language model (LLM) agent operates at the meta-level: it observes completed GA runs, diagnoses gaps versus user control objectives, and proposes updated GA configurations. The architecture uses structured memory, quantitative goal translation, resource-aware termination, and outcome-driven routing. We evaluate GA-Agent on eight control case studies with diverse dynamics (DC motor, inverted pendulum, aircraft pitch, autonomous underwater vehicle, and others). GA-Agent achieves 100% success on all benchmarks, outperforming a Regular GA with fixed hyperparameters in solution quality and sample efficiency. It matches or surpasses a Cascade-GA baseline while reducing function evaluations by one to two orders of magnitude, typically converging in one to three optimization attempts. Sensitivity analysis shows robustness across LLM backbones and memory configurations. A compact memory buffer (size 2-3) and cost-effective models (DeepSeek-V4-Flash at about $0.002 per run) achieve superior performance.", "authors": [ "Mohammad Narimani", "Seyyed Ali Emami" ], "year": 2026, "published_date": "2026-09-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.27725", "pdf_url": "https://arxiv.org/pdf/2609.27725", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Evaluation", "Systems & Control" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses hyperparameter — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.08, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Tuning PID controllers to satisfy competing objectives - low tracking error, fast settling, limited overshoot, and moderate control effort - is labor-intensive and requires expertise. Genetic algorithms (GAs) offer gradient-free optimization of controller gains against a weighted fitness function, but success depends on meta-level choices: population size, generation budget, gain bounds, and fitness weights.", "key_contribution": "We propose GA-Agent, which decouples these modes.", "why_it_matters": "GA-Agent: Large Language Models as Hyperparameter Optimizers for Evolutionary Controller Synthesis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose GA-Agent, which decouples these modes.", "biggest_caveat": "but success depends on meta-level choices: population size, generation budget, gain bounds, and fitness weights.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.27725", "difficulty": "advanced" }, { "id": "arxiv:2603.27751", "source": "arxiv", "source_type": "preprint", "title": "SkyNet: Belief-Aware Planning for Partially-Observable Stochastic Games", "abstract": "In 2019, Google DeepMind released MuZero, a model-based reinforcement learning method that achieves strong results in perfect-information games by combining learned dynamics models with Monte Carlo Tree Search (MCTS). However, comparatively little work has extended MuZero to partially observable, stochastic, multi-player environments, where agents must act under uncertainty about hidden state. Such settings arise not only in card games but in domains such as autonomous negotiation, financial trading, and multi-agent robotics. In the absence of explicit belief modeling, MuZero's latent encoding has no dedicated mechanism for representing uncertainty over unobserved variables. To address this, we introduce SkyNet (Belief-Aware MuZero), which adds ego-conditioned auxiliary heads for winner prediction and rank estimation to the standard MuZero architecture. These objectives encourage the latent state to retain information predictive of outcomes under partial observability, without requiring explicit belief-state tracking or changes to the search algorithm. We evaluate SkyNet on Skyjo, a partially observable, non-zero-sum, stochastic card game, using a decision-granularity environment, transformer-based encoding, and a curriculum of heuristic opponents with self-play. In 1000-game head-to-head evaluations at matched checkpoints, SkyNet achieves a 75.3% peak win rate against the baseline (+194 Elo, $p < 10^{-50}$). SkyNet also outperforms the baseline against heuristic opponents (0.720 vs.\\ 0.466 win rate). Critically, the belief-aware model initially underperforms the baseline but decisively surpasses it once training throughput is sufficient, suggesting that belief-aware auxiliary supervision improves learned representations under partial observability, but only given adequate data flow.", "authors": [ "Adam Haile" ], "year": 2026, "published_date": "2026-03-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.27751", "pdf_url": "https://arxiv.org/pdf/2603.27751", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Transformers", "RL", "Robotics", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.11, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In 2019, Google DeepMind released MuZero, a model-based reinforcement learning method that achieves strong results in perfect-information games by combining learned dynamics models with Monte Carlo Tree Search (MCTS). However, comparatively little work has extended MuZero to partially observable, stochastic, multi-player environments, where agents must act under uncertainty about hidden state.", "key_contribution": "To address this, we introduce SkyNet (Belief-Aware MuZero), which adds ego-conditioned auxiliary heads for winner prediction and rank estimation to the standard MuZero architecture.", "why_it_matters": "SkyNet: Belief-Aware Planning for Partially-Observable Stochastic Games represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "To address this, we introduce SkyNet (Belief-Aware MuZero), which adds ego-conditioned auxiliary heads for winner…", "biggest_caveat": "but in domains such as autonomous negotiation, financial trading, and multi-agent robotics.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2603.27751", "difficulty": "frontier" }, { "id": "arxiv:2609.21859", "source": "arxiv", "source_type": "preprint", "title": "TrialAtlas: Multi-Agent Research Organization for Clinical Trial Design and Optimization", "abstract": "Nearly 90% of drugs entering clinical development ultimately fail, despite billions of dollars in investment. Pharmaceutical companies therefore rely on clinical development planning (CDP) and probability of technical and regulatory success assessment to anticipate development risks, yet these decisions remain labor-intensive and subjective, requiring experts across clinical science, statistics, regulatory affairs, and competitive intelligence to jointly acquire, synthesize, and reason over heterogeneous evidence. Here, we introduce TrialAtlas, a memory-augmented multi-agent research organization for CDP that mirrors this collaborative process by coordinating specialized agents for literature synthesis, competitive trial intelligence, regulatory precedent analysis, and integrated reasoning over trial design and development risk. TrialAtlas further learns from historical clinical trials and regulatory outcomes, including prior New Drug Applications (NDAs), to ground its decisions in accumulated development experience. To evaluate these capabilities in an authentic regulatory setting, we introduce TrialAtlasBench, constructed from 291 FDA Complete Response Letters and spanning three practical tasks: detecting trial design deficiencies, recommending actionable design improvements, and predicting technical and regulatory success. TrialAtlas achieves an F1 score of 50.0% for deficiency detection, outperforming the strongest baseline by 6.1 points, and reaches 85.3% balanced accuracy and 84.7% F1 for prediction of technical and regulatory success, improving over the best baselines by 6.7 points in balanced accuracy and 12.0 points in Cohen's kappa. In expert evaluation, 86.4% of TrialAtlas-generated concerns were judged valid, compared with 83.1% for OpenAI DeepResearch and 59.3% for Gemini DeepResearch.", "authors": [ "Jiacheng Lin", "Zifeng Wang", "Zheng Chen", "Erick Scott", "Ziwei Yang", "Fanyang Yu", "Sheng Zhong", "Jimeng Sun" ], "year": 2026, "published_date": "2026-09-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.21859", "pdf_url": "https://arxiv.org/pdf/2609.21859", "citations": 0, "topics": [], "tags": [ "Reasoning", "Biomedical AI", "NLP" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.36, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Nearly 90% of drugs entering clinical development ultimately fail, despite billions of dollars in investment. Pharmaceutical companies therefore rely on clinical development planning (CDP) and probability of technical and regulatory success assessment to anticipate development risks, yet these decisions remain labor-intensive and subjective, requiring experts across clinical science, statistics, regulatory affairs, and competitive intelligence to jointly acquire, synthesize, and reason over heterogeneous evidence.", "key_contribution": "Here, we introduce TrialAtlas, a memory-augmented multi-agent research organization for CDP that mirrors this collaborative process by coordinating specialized agents for literature synthesis, competitive trial intelligence, regulatory precedent analysis, and integrated reasoning over trial design and development risk.", "why_it_matters": "TrialAtlas: Multi-Agent Research Organization for Clinical Trial Design and Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Here, we introduce TrialAtlas, a memory-augmented multi-agent research organization for CDP that mirrors this…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2609.21859", "difficulty": "intermediate" }, { "id": "arxiv:2609.22043", "source": "arxiv", "source_type": "preprint", "title": "An Interpretable Memory Decision Controller for LLM Agents Based on Three-Signal Complementarity: Decoupling Confidence and Consistency", "abstract": "Memory systems for large language models have focused predominantly on efficient retrieval, whereas the decision of whether retrieved memories should be trusted has received comparatively little attention. When the memory store contains conflicting positions, standard retrieval-augmented generation (RAG) blindly injects memories and amplifies hallucinations: in models susceptible to memory injection, the RAG hallucination rate under conflicting memories is markedly higher than that of a memory-free baseline. Inspired by memory signaling mechanisms in the prefrontal cortex, we propose the Memory Decision Layer (MDL), a zero-parameter memory decision controller situated between the retrieval and generation stages. Its core is a three-signal complementary encoder that fuses relevance, reliability, and task risk through QR-based orthogonal subspace projection and a meta-working-memory signal into an interpretable decision representation that quantifies the trustworthiness of retrieved memories. Building on this encoder, MDL explicitly decouples confidence from consistency and introduces risk inversion and explicit abstention. Evaluations on mainstream large language models and multiple open-source datasets show that MDL reduces the hallucination rate under conflicting memories by about 56.04% in general scenarios and approaches zero hallucination in high-risk scenarios. The controller is fully white-box: it relies purely on geometric operations, requires no trained parameters, and adds only about 0.14 ms per decision -- roughly 50x faster than the embedding-retrieval step that precedes it and four to five orders of magnitude faster than an LLM self-evaluation call.", "authors": [ "Yiming Zhang", "Jinghong Zhang", "Haoran Zhao", "Yiren Ma", "Chunlei Zhao" ], "year": 2026, "published_date": "2026-09-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.22043", "pdf_url": "https://arxiv.org/pdf/2609.22043", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "RAG", "Interpretability", "NLP" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.66, "content_potential_score": 1.26, "interestingness_score": 2.18, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Memory systems for large language models have focused predominantly on efficient retrieval, whereas the decision of whether retrieved memories should be trusted has received comparatively little attention. When the memory store contains conflicting positions, standard retrieval-augmented generation (RAG) blindly injects memories and amplifies hallucinations: in models susceptible to memory injection, the RAG hallucination rate under conflicting memories is markedly higher than that of a memory-free baseline.", "key_contribution": "Inspired by memory signaling mechanisms in the prefrontal cortex, we propose the Memory Decision Layer (MDL), a zero-parameter memory decision controller situated between the retrieval and generation stages.", "why_it_matters": "An Interpretable Memory Decision Controller for LLM Agents Based on Three-Signal Complementarity: Decoupling Confidence and Consistency represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Inspired by memory signaling mechanisms in the prefrontal cortex, we propose the Memory Decision Layer (MDL), a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.22043", "difficulty": "intermediate" }, { "id": "arxiv:2603.22179", "source": "arxiv", "source_type": "preprint", "title": "MARCUS: An agentic, multimodal vision-language model for cardiac diagnosis and management", "abstract": "Cardiovascular disease remains the leading cause of global mortality, with progress hindered by human interpretation of complex cardiac tests. Current AI vision-language models are limited to single-modality inputs and are non-interactive. We present MARCUS (Multimodal Autonomous Reasoning and Chat for Ultrasound and Signals), an agentic vision-language system for end-to-end interpretation of electrocardiograms (ECGs), echocardiograms, and cardiac magnetic resonance imaging (CMR) independently and as multimodal input. MARCUS employs a hierarchical agentic architecture comprising modality-specific vision-language expert models, each integrating domain-trained visual encoders with multi-stage language model optimization, coordinated by a multimodal orchestrator. Trained on 13.5 million images (0.25M ECGs, 1.3M echocardiogram images, 12M CMR images) and our novel expert-curated dataset spanning 1.6 million questions, MARCUS achieves state-of-the-art performance surpassing frontier models (GPT-5 Thinking, Gemini 2.5 Pro Deep Think). Across internal (Stanford) and external (UCSF) test cohorts, MARCUS achieves accuracies of 87-91% for ECG, 67-86% for echocardiography, and 85-88% for CMR, outperforming frontier models by 34-45% (P<0.001). On multimodal cases, MARCUS achieved 70% accuracy, nearly triple that of frontier models (22-28%), with 1.7-3.0x higher free-text quality scores. Our agentic architecture also confers resistance to mirage reasoning, whereby vision-language models derive reasoning from unintended textual signals or hallucinated visual content. MARCUS demonstrates that domain-specific visual encoders with an agentic orchestrator enable multimodal cardiac interpretation. We release our models, code, and benchmark open-source.", "authors": [ "Jack W O'Sullivan", "Mohammad Asadi", "Lennart Elbe", "Akshay Chaudhari", "Tahoura Nedaee", "Francois Haddad", "Ivan Lopez", "Fang Cao", "Michael Salerno", "Li Fe-Fei", "Ehsan Adeli", "Rima Arnaout", "Euan A Ashley" ], "year": 2026, "published_date": "2026-09-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.22179", "pdf_url": "https://arxiv.org/pdf/2603.22179", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "VLMs", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 6.22, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Cardiovascular disease remains the leading cause of global mortality, with progress hindered by human interpretation of complex cardiac tests. Current AI vision-language models are limited to single-modality inputs and are non-interactive.", "key_contribution": "We present MARCUS (Multimodal Autonomous Reasoning and Chat for Ultrasound and Signals), an agentic vision-language system for end-to-end interpretation of electrocardiograms (ECGs), echocardiograms, and cardiac magnetic resonance imaging (CMR) independently and as multimodal input.", "why_it_matters": "MARCUS: An agentic, multimodal vision-language model for cardiac diagnosis and management represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present MARCUS (Multimodal Autonomous Reasoning and Chat for Ultrasound and Signals), an agentic vision-language…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2603.22179", "difficulty": "beginner" }, { "id": "arxiv:2609.12285", "source": "arxiv", "source_type": "preprint", "title": "AnchorVLN: Geometry-Anchored Vision-Language Grounding Reasoning for Open-Vocabulary Navigation", "abstract": "Vision-Language Navigation (VLN) in unseen indoor environments is useful in real-world robotics, where an agent must follow natural-language instructions, locate objects, and answer spatial questions without a pre-built map or fixed object vocabulary. Multimodal vision-language models (VLMs) provide strong open-vocabulary grounding and zero-shot reasoning, but struggle to emit reliable metric quantities such as range, bearing, and comparative spatial relations directly from images. Existing approaches address this by folding geometry into hand-engineered pipelines or asking models to output waypoints, requiring changes to the control stack for different robots, tasks, or vocabularies. We introduce AnchorVLN, an open-vocabulary VLN system built on a simple rule: the VLM proposes semantics; geometry decides metrics. It is realised as EMBODIED-NAV-MCP, a Model Context Protocol (MCP) server driven by a VLM agent through a compact set of callable tools. Since no tool accepts distance in metres or bearing in radians, the schema enforces the semantic-geometry boundary without modifying the downstream autonomy stack. We benchmark both tasks of the CMU Vision-Language Navigation Challenge 2026: 30 instruction-following questions over 15 scenes and a frozen 45-question object-reference set. The full system achieves 64.4 percent on instruction following, dropping by 13.3 percentage points without controller modeling (t = 2.77). On object reference, geometric anchoring clears the challenge overlap threshold on 10 of 45 questions, versus 0 of 45 for direct coordinate estimation, reducing median center error from 3.37 m to 2.48 m.", "authors": [ "Long Giang Vu", "Chengkai Yao", "Yuxin Liu", "FNU Aryan", "Rajath Chandrashekar Aralikatti" ], "year": 2026, "published_date": "2026-09-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.12285", "pdf_url": "https://arxiv.org/pdf/2609.12285", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Hallucination", "VLMs", "Robotics" ], "paper_type": "benchmark", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.18, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Vision-Language Navigation (VLN) in unseen indoor environments is useful in real-world robotics, where an agent must follow natural-language instructions, locate objects, and answer spatial questions without a pre-built map or fixed object vocabulary. Multimodal vision-language models (VLMs) provide strong open-vocabulary grounding and zero-shot reasoning, but struggle to emit reliable metric quantities such as range, bearing, and comparative spatial relations directly from images.", "key_contribution": "We introduce AnchorVLN, an open-vocabulary VLN system built on a simple rule: the VLM proposes semantics; geometry decides metrics.", "why_it_matters": "AnchorVLN: Geometry-Anchored Vision-Language Grounding Reasoning for Open-Vocabulary Navigation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce AnchorVLN, an open-vocabulary VLN system built on a simple rule: the VLM proposes semantics; geometry…", "biggest_caveat": "but struggle to emit reliable metric quantities such as range, bearing, and comparative spatial relations directly from images.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.12285", "difficulty": "intermediate" }, { "id": "arxiv:2608.27713", "source": "arxiv", "source_type": "preprint", "title": "DART-FL: Burst-Aware Multitask Federated Learning under Dynamic Inference Demand at the Edge", "abstract": "Edge intelligence systems increasingly require model training and online inference to coexist on resource-constrained devices, while inference demand can vary substantially across tasks over time. This creates two coupled challenges: sufficient computation must be reserved for inference to maintain service-level objectives (SLOs), while the remaining training capacity should adapt to task-specific demand so that frequently requested tasks can improve earlier during training. We propose an SLO-aware, demand-driven multitask federated learning framework (DART-FL) that jointly adapts the inference-training resource split and task-level training emphasis. At each scheduling interval, DART-FL uses the inference backlog and profiled service capacity to determine the minimum resource allocation required for inference. The remaining training capacity is then distributed across tasks using a queue-aware DPP-inspired scheduler, and the resulting task allocations are mapped to dynamic loss weights. This allows tasks experiencing higher inference demand to receive greater training emphasis in earlier communication rounds. Clients train a shared backbone with task-specific heads, and the complete multitask model is aggregated through FedAvg. We evaluate DART-FL using Stanford Cars and Oxford Flowers 102 under both synthetic and real Alibaba trace-derived workloads. Results show that DART-FL dynamically adapts the inference-training resource split to time-varying inference demand and shifts the learning progress of high-demand tasks toward their burst periods, improving model accuracy when those tasks are frequently requested while maintaining comparable long-term multitask performance.", "authors": [ "Yiming Xie", "Pinrui Yu", "Geng Yuan", "Xue Lin", "Ningfang Mi" ], "year": 2026, "published_date": "2026-08-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.27713", "pdf_url": "https://arxiv.org/pdf/2608.27713", "citations": 0, "topics": [], "tags": [ "Federated Learning", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.04, "content_potential_score": 1.1, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Edge intelligence systems increasingly require model training and online inference to coexist on resource-constrained devices, while inference demand can vary substantially across tasks over time. This creates two coupled challenges: sufficient computation must be reserved for inference to maintain service-level objectives (SLOs), while the remaining training capacity should adapt to task-specific demand so that frequently requested tasks can improve earlier during training.", "key_contribution": "We propose an SLO-aware, demand-driven multitask federated learning framework (DART-FL) that jointly adapts the inference-training resource split and task-level training emphasis.", "why_it_matters": "DART-FL: Burst-Aware Multitask Federated Learning under Dynamic Inference Demand at the Edge represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Federated Learning.", "one_line_takeaway": "We propose an SLO-aware, demand-driven multitask federated learning framework (DART-FL) that jointly adapts the…", "biggest_caveat": "buted across tasks using a queue-aware DPP-inspired scheduler, and the resulting task allocations are mapped to dynamic loss weights.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Federated Learning.", "url": "https://arxiv.org/abs/2608.27713", "difficulty": "advanced" }, { "id": "arxiv:2608.21864", "source": "arxiv", "source_type": "preprint", "title": "BioMed-Agent-RL: A Meta Learning, All You Need for Biomedical Applications", "abstract": "The current progress of Clinical Vision Large Language Models (C-VLLMs) has substantially improved digital diagnostics, still these frameworks often endure lesion noises, modality misalignment, hallucination, and missed contextual grounding in complex clinical cases. Moreover, prevailing agent systems usually depend on static and non-adaptable pipelines and lack the versatility necessary for complex medical reasoning. To resolve these difficulties, we present BioMed-Agent-RL, a unified medical agent that incorporates adaptive orchestration, policy, and reward-based reinforcement learning (RL) models for biomedical applications. To ensure reliability, it invokes clinical context-aware preference optimization (CPO), direct preference optimization (DPO), and group relative policy optimization (GRPO) with dynamic entropy regulation. This pipeline utilizes a multimodal meta-learning approach that operates as a field-specific expert and human judgment synthesizer. The agent adaptively utilizes a set of model-level expertise, such as clinical grounding and reasoner, lesion segmenter, and field-specific synthesizer, across various clinical modalities (e.g., X-ray) by utilizing an iterative and adaptive RL approach. The agent learns to seriously synthesize misleading, conflicting vision cues and trust in inherent reasoning, while specialist advice is faulty. An intensive ablation study is conducted across multiple benchmarks, and the agent significantly outperforms existing state of the art models, such as GPT-5, attaining up to ~73% accuracy (gain of ~5%) over contemporary baselines. As a result, the framework suggests a new standard for building factual, reliable, robust, and expert-like intelligent agent systems for independent clinical reasoning.", "authors": [ "Md Asaduzzaman Jabin", "Zihao Wu", "Tianming Liu" ], "year": 2026, "published_date": "2026-08-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.21864", "pdf_url": "https://arxiv.org/pdf/2608.21864", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Hallucination", "RLHF", "AI Safety" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.58, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The current progress of Clinical Vision Large Language Models (C-VLLMs) has substantially improved digital diagnostics, still these frameworks often endure lesion noises, modality misalignment, hallucination, and missed contextual grounding in complex clinical cases. Moreover, prevailing agent systems usually depend on static and non-adaptable pipelines and lack the versatility necessary for complex medical reasoning.", "key_contribution": "To resolve these difficulties, we present BioMed-Agent-RL, a unified medical agent that incorporates adaptive orchestration, policy, and reward-based reinforcement learning (RL) models for biomedical applications.", "why_it_matters": "BioMed-Agent-RL: A Meta Learning, All You Need for Biomedical Applications represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To resolve these difficulties, we present BioMed-Agent-RL, a unified medical agent that incorporates adaptive…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.21864", "difficulty": "advanced" }, { "id": "arxiv:2608.22460", "source": "arxiv", "source_type": "preprint", "title": "MASH-Bench: Diagnosing Cross-Source Failure in Mass-Shooting Risk Classification", "abstract": "Public mass-shooting databases differ substantially in coverage, feature availability, and reporting practices, creating challenges for machine-learning models that must generalize across data sources. We introduce MASH-Bench, a harmonized benchmark of 6,968 incidents from four U.S. databases: Kaggle, Mother Jones, Stanford MSA, and the Gun Violence Archive (GVA). We evaluate cross-source risk classification using leave-one-dataset-out (LODO) evaluation. Random Forest, XGBoost, and LightGBM achieve VeryHigh-risk recall of 0.68-0.89 on the curated sources but generalize poorly to GVA, where mean recall drops to 0.20 and precision to 0.0004. To investigate the source of this degradation, we conduct a controlled feature-masking ablation that removes the five features unavailable in GVA from the curated sources. The resulting recall collapse to zero provides evidence that feature completeness is a major contributor to the observed cross-source failure. We further evaluate three domain-adaptation approaches: DANN, CORAL, and importance weighting. DANN improves VeryHigh-risk recall on GVA by 0.282 (95% CI [0.11, 0.47], p = 0.003), although precision remains low, whereas CORAL and importance weighting yield zero recall. Oracle prior-shift recalibration likewise fails to recover VeryHigh-risk predictions, indicating that label-side correction alone is insufficient under the observed feature deficiencies. A per-group audit further identifies substantial disparities associated with media-attributed mental-health labels. Overall, these results indicate that, in MASH-Bench, cross-source generalization is constrained more by feature completeness and label prevalence than by classifier choice. The benchmark provides a controlled setting for diagnosing these effects in cross-source risk classification.", "authors": [ "Neha Sharma", "Ritesh Sharma" ], "year": 2026, "published_date": "2026-08-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.22460", "pdf_url": "https://arxiv.org/pdf/2608.22460", "citations": 0, "topics": [], "tags": [ "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.81, "content_potential_score": 2.05, "interestingness_score": 2.58, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Public mass-shooting databases differ substantially in coverage, feature availability, and reporting practices, creating challenges for machine-learning models that must generalize across data sources. We introduce MASH-Bench, a harmonized benchmark of 6,968 incidents from four U.S.", "key_contribution": "We introduce MASH-Bench, a harmonized benchmark of 6,968 incidents from four U.S.", "why_it_matters": "MASH-Bench: Diagnosing Cross-Source Failure in Mass-Shooting Risk Classification represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "We introduce MASH-Bench, a harmonized benchmark of 6,968 incidents from four U.S.", "biggest_caveat": "but generalize poorly to GVA, where mean recall drops to 0.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2608.22460", "difficulty": "beginner" }, { "id": "arxiv:2506.10630", "source": "arxiv", "source_type": "preprint", "title": "Time Series Forecasting as Reasoning: A Slow-Thinking Approach with Reinforced LLMs", "abstract": "To advance time series forecasting (TSF), various methods have been proposed to improve prediction accuracy, evolving from statistical techniques to data-driven deep learning architectures. Despite their effectiveness, most existing methods still adhere to a fast thinking paradigm-relying on extracting historical patterns and mapping them to future values as their core modeling philosophy, lacking an explicit thinking process that incorporates intermediate time series reasoning. Meanwhile, emerging slow-thinking LLMs (e.g., OpenAI-o1) have shown remarkable multi-step reasoning capabilities, offering an alternative way to overcome these issues. However, prompt engineering alone presents several limitations - including high computational cost, privacy risks, and limited capacity for in-depth domain-specific time series reasoning. To address these limitations, a more promising approach is to train LLMs to develop slow thinking capabilities and acquire strong time series reasoning skills. For this purpose, we propose Time-R1, a two-stage reinforcement fine-tuning framework designed to enhance multi-step reasoning ability of LLMs for time series forecasting. Specifically, the first stage conducts supervised fine-tuning for warmup adaptation, while the second stage employs reinforcement learning to improve the model's generalization ability. Particularly, we design a fine-grained multi-objective reward specifically for time series forecasting, and then introduce GRIP (group-based relative importance for policy optimization), which leverages non-uniform sampling to further encourage and optimize the model's exploration of effective reasoning paths. Experiments demonstrate that Time-R1 significantly improves forecast performance across diverse datasets.", "authors": [ "Yitong Zhou", "Yucong Luo", "Mingyue Cheng", "Qi Liu", "Jiahao Wang", "Daoyu Wang", "Enhong Chen" ], "year": 2026, "published_date": "2026-06-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2506.10630", "pdf_url": "https://arxiv.org/pdf/2506.10630", "citations": 0, "topics": [], "tags": [ "Reasoning", "Prompting", "Fine-Tuning", "RL", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.25, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "To advance time series forecasting (TSF), various methods have been proposed to improve prediction accuracy, evolving from statistical techniques to data-driven deep learning architectures. Despite their effectiveness, most existing methods still adhere to a fast thinking paradigm-relying on extracting historical patterns and mapping them to future values as their core modeling philosophy, lacking an explicit thinking process that incorporates intermediate time series reasoning.", "key_contribution": "For this purpose, we propose Time-R1, a two-stage reinforcement fine-tuning framework designed to enhance multi-step reasoning ability of LLMs for time series forecasting.", "why_it_matters": "Time Series Forecasting as Reasoning: A Slow-Thinking Approach with Reinforced LLMs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "For this purpose, we propose Time-R1, a two-stage reinforcement fine-tuning framework designed to enhance multi-step…", "biggest_caveat": "limitations - including high computational cost, privacy risks, and limited capacity for in-depth domain-specific time series reasoning.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2506.10630", "difficulty": "beginner" }, { "id": "arxiv:2601.22631", "source": "arxiv", "source_type": "preprint", "title": "PEFT-MuTS: A Multivariate Parameter-Efficient Fine-Tuning Framework for Remaining Useful Life Prediction based on Cross-domain Time Series Representation Model", "abstract": "The application of data-driven remaining useful life (RUL) prediction has long been constrained by the availability of large amount of degradation data. Mainstream solutions such as domain adaptation and meta-learning still rely on large amounts of historical degradation data from equipment that is identical or similar to the target, which imposes significant limitations in practical applications. This study investigates PEFT-MuTS, a Parameter-Efficient Fine-Tuning framework for few-shot RUL prediction, built on cross-domain pre-trained time-series representation models. Contrary to the widely held view that knowledge transfer in RUL prediction can only occur within similar devices, we demonstrate that substantial benefits can be achieved through pre-training process with large-scale cross-domain time series datasets. A independent feature tuning network and a meta-variable-based low rank multivariate fusion mechanism are developed to enable the pre-trained univariate time-series representation backbone model to fully exploit the multivariate relationships in degradation data for downstream RUL prediction task. Additionally, we introduce a zero-initialized regressor that stabilizes the fine-tuning process under few-shot conditions. Experiments on aero-engine and industrial bearing datasets demonstrate that our method can achieve effective RUL prediction even when less than 1\\% of samples of target equipment are used. Meanwhile, it substantially outperforms conventional supervised and few-shot approaches while markedly reducing the data required to achieve high predictive accuracy. Our code is available at https://github.com/fuen1590/PEFT-MuTS.", "authors": [ "En Fu", "Yanyan Hu", "Zengwang Jin", "Kaixiang Peng" ], "year": 2026, "published_date": "2026-08-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.22631", "pdf_url": "https://arxiv.org/pdf/2601.22631", "citations": 0, "topics": [], "tags": [ "Prompting", "Fine-Tuning", "Self-Supervised", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 6.25, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The application of data-driven remaining useful life (RUL) prediction has long been constrained by the availability of large amount of degradation data. Mainstream solutions such as domain adaptation and meta-learning still rely on large amounts of historical degradation data from equipment that is identical or similar to the target, which imposes significant limitations in practical applications.", "key_contribution": "Contrary to the widely held view that knowledge transfer in RUL prediction can only occur within similar devices, we demonstrate that substantial benefits can be achieved through pre-training process with large-scale cross-domain time series datasets.", "why_it_matters": "PEFT-MuTS: A Multivariate Parameter-Efficient Fine-Tuning Framework for Remaining Useful Life Prediction based on Cross-domain Time Series Representation Model represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "Contrary to the widely held view that knowledge transfer in RUL prediction can only occur within similar devices, we…", "biggest_caveat": "limitations in practical applications.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2601.22631", "difficulty": "beginner" }, { "id": "arxiv:2608.09617", "source": "arxiv", "source_type": "preprint", "title": "Bayesian Symbolic Regression with Entropic Reinforcement Learning", "abstract": "Symbolic regression is the problem of finding an algebraic expression describing a stochastic dependence of a target variable on a set of inputs. Unlike forms of regression that fit parameters assuming a fixed model structure, symbolic regression is a search problem over the space of expressions, represented, for example, as abstract syntax trees using a library of operators. Symbolic regression is typically used in settings with limited, noisy data in the natural sciences. However, searching for a single best-fitting expression fails to capture the epistemic uncertainty about the expression, which motivates a Bayesian perspective that enables uncertainty quantification and specification of natural priors to constrain the search space. In this work, we propose ERRLESS (Entropy-Regularized Reinforcement Learning for Expression Structure Sampling), a scalable approach for sampling from the posterior distribution over expressions given data using maximum-entropy reinforcement learning. ERRLESS learns a neural policy that constructs expressions sequentially by building up their abstract syntax trees. At convergence, the policy samples expressions from the posterior. At test time, expressions can be sampled by rollouts of this policy. We demonstrate that ERRLESS achieves competitive results on the Feynman benchmark while producing short and interpretable expressions. Additionally, we demonstrate that the mean of the posterior predictive approximated by ERRLESS achieves a high coefficient of determination ($R^2$) compared to an SMC baseline, highlighting the benefits of the Bayesian perspective in symbolic regression.", "authors": [ "Oussama Boussif", "Mohammed Mahfoud", "Younesse Kaddar", "Moksh Jain", "Sida Li", "Damiano Fornasiere", "Xiaoyin Chen", "Yoshua Bengio", "Esmeralda S. Whitammer" ], "year": 2026, "published_date": "2026-08-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.09617", "pdf_url": "https://arxiv.org/pdf/2608.09617", "citations": 0, "topics": [], "tags": [ "RL", "Interpretability", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.24, "content_potential_score": 1.92, "interestingness_score": 2.51, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Symbolic regression is the problem of finding an algebraic expression describing a stochastic dependence of a target variable on a set of inputs. Unlike forms of regression that fit parameters assuming a fixed model structure, symbolic regression is a search problem over the space of expressions, represented, for example, as abstract syntax trees using a library of operators.", "key_contribution": "In this work, we propose ERRLESS (Entropy-Regularized Reinforcement Learning for Expression Structure Sampling), a scalable approach for sampling from the posterior distribution over expressions given data using maximum-entropy reinforcement learning.", "why_it_matters": "Bayesian Symbolic Regression with Entropic Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "In this work, we propose ERRLESS (Entropy-Regularized Reinforcement Learning for Expression Structure Sampling), a…", "biggest_caveat": "bution over expressions given data using maximum-entropy reinforcement learning.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2608.09617", "difficulty": "frontier" }, { "id": "arxiv:2605.16336", "source": "arxiv", "source_type": "preprint", "title": "Detecting Verbatim LLM Copy-Paste in Homework", "abstract": "Large language models (LLMs) have made fluent essay writing, code drafting, and quiz answering instantly available to students at every level, from secondary school through graduate study. Many educators do not object to LLM use \\emph{per~se}; what they need to detect is the case in which a student pastes the assignment prompt into a chatbot and submits the model's reply verbatim, without engaging with the work. Existing post-hoc AI-text detectors remain unreliable and have been shown to penalise non-native English writers, while output-side watermarks require cooperation from the model provider. We propose an alternative that the educator controls directly: an input-side watermark in which an invisible instruction is embedded inside the visible assignment prompt itself. An LLM that ingests the prompt verbatim quietly reads the hidden instruction and writes a tell-tale signature into its reply, exposing the copy-and-paste pathway specifically. We describe SteganoPrompt, a single-page, zero-dependency web tool that encodes an arbitrary printable-ASCII payload into the deprecated Unicode Tags block (\\texttt{U+E0000}--\\texttt{U+E007F}). The encoded string is visually identical to the original, survives common copy-paste channels (Word, Google Docs, PDF, Markdown, Slack, e-mail, the major learning-management systems), and is reliably tokenized by frontier models. We evaluate compliance across seven LLM families and a representative set of educational content channels. The work is informed by my experience as a graduate teaching assistant for an undergraduate software engineering course at the George Washington University. The tool is released under the MIT licence at \\url{https://ezharjan.github.io/SteganoPrompt/}.", "authors": [ "Aizierjiang Aiersilan" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.16336", "pdf_url": "https://arxiv.org/pdf/2605.16336", "citations": 0, "topics": [], "tags": [ "LLMs", "Dialogue", "Artificial Intelligence", "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.73, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models (LLMs) have made fluent essay writing, code drafting, and quiz answering instantly available to students at every level, from secondary school through graduate study. Many educators do not object to LLM use \\emph{per~se}; what they need to detect is the case in which a student pastes the assignment prompt into a chatbot and submits the model's reply verbatim, without engaging with the work.", "key_contribution": "We propose an alternative that the educator controls directly: an input-side watermark in which an invisible instruction is embedded inside the visible assignment prompt itself.", "why_it_matters": "Detecting Verbatim LLM Copy-Paste in Homework represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose an alternative that the educator controls directly: an input-side watermark in which an invisible…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.16336", "difficulty": "intermediate" }, { "id": "arxiv:2506.22174", "source": "arxiv", "source_type": "preprint", "title": "ASVSim (AirSim for Surface Vehicles): A High-Fidelity Simulation Framework for Autonomous Surface Vehicle Research", "abstract": "The transport industry has recently shown significant interest in unmanned surface vehicles (USVs), specifically for port and inland waterway transport. These systems can improve operational efficiency and safety, which is especially relevant in the European Union, where initiatives such as the Green Deal are driving a shift towards increased use of inland waterways. At the same time, a shortage of qualified personnel is accelerating the adoption of autonomous solutions. However, there is a notable lack of open-source, high-fidelity simulation frameworks and datasets for developing and evaluating such solutions. To address these challenges, we introduce AirSim for Surface Vehicles (ASVSim), an open-source simulation framework specifically designed for autonomous shipping research in inland and port environments. The framework combines simulated vessel dynamics with marine sensor simulation capabilities, including radar and camera systems and supports the generation of synthetic datasets for training computer vision models and reinforcement learning (RL) agents. Built upon Cosys-AirSim, ASVSim provides a comprehensive platform for developing autonomous navigation algorithms and generating synthetic datasets. The simulator supports research of both traditional control methods and deep learning-based approaches. Through experiments in waterway segmentation and autonomous navigation, we demonstrate the capabilities of the simulator in these research areas. ASVSim is provided as an open-source project under the MIT license, making autonomous navigation research accessible to a larger part of the ocean engineering community. See https://github.com/BavoLesy/ASVSim.", "authors": [ "Bavo Lesy", "Siemen Herremans", "Robin Kerstens", "Jan Steckel", "Walter Daems", "Siegfried Mercelis", "Ali Anwar" ], "year": 2026, "published_date": "2026-07-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2506.22174", "pdf_url": "https://arxiv.org/pdf/2506.22174", "citations": 0, "topics": [], "tags": [ "RL", "Robotics", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.91, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The transport industry has recently shown significant interest in unmanned surface vehicles (USVs), specifically for port and inland waterway transport. These systems can improve operational efficiency and safety, which is especially relevant in the European Union, where initiatives such as the Green Deal are driving a shift towards increased use of inland waterways.", "key_contribution": "To address these challenges, we introduce AirSim for Surface Vehicles (ASVSim), an open-source simulation framework specifically designed for autonomous shipping research in inland and port environments.", "why_it_matters": "ASVSim (AirSim for Surface Vehicles): A High-Fidelity Simulation Framework for Autonomous Surface Vehicle Research represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "To address these challenges, we introduce AirSim for Surface Vehicles (ASVSim), an open-source simulation framework…", "biggest_caveat": "However, there is a notable lack of open-source, high-fidelity simulation frameworks and datasets for developing and evaluating such solutions.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2506.22174", "difficulty": "beginner" }, { "id": "arxiv:2607.27577", "source": "arxiv", "source_type": "preprint", "title": "Heterogeneous Ranking in Industrial-Scale Recommender Systems: A Case Study", "abstract": "Heterogeneous recommendation feeds present complex challenges that extend beyond those found in highly homogeneous environments (e.g., music-only or video-only closed-ecosystem platforms). In Google Discover, a unified feed integrates diverse content sourced from the decentralized open web, including web articles, long-form and short-form videos, user-generated content (UGC), and beyond. Different content types exhibit distinct feature densities and user interaction patterns. Building a unified ranking model that sustains high performance across such heterogeneity, while avoiding negative transfer or majority bias, remains a significant industrial challenge. This paper presents an end-to-end case study on the industrial-scale multi-task ranking of heterogeneous feeds, grounded in real-world deployment. We introduce HA-MoE, a heterogeneity-adaptive multi-gated mixture-of-experts architecture that incorporates explicit heterogeneity context into both gating networks and expert representations. This approach enables effective specialization without significantly increasing operational overhead. To support reliable deployment, we introduce LENS, a lightweight observability framework that provides interpretable diagnostics of expert specialization and tracks this functional heterogeneity across continuous retraining. We evaluate our method using Dual-Level AUC (DL-AUC), a heterogeneity-aware evaluation metric that combines global ranking performance with cross-segment ranking correctness. Offline evaluations on a large-scale industrial dataset demonstrate consistent improvements over baseline models. Furthermore, online A/B testing confirms gains in feed activity and exploration metrics. Together, offline and online results validate the effectiveness of our approach for managing heterogeneity in industrial-scale recommender systems.", "authors": [ "Di Bai", "Jintao Liu", "Zhenwei Tang", "Peifan Wu", "Nada Al-Thawr", "Luoshu Wang" ], "year": 2026, "published_date": "2026-07-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.27577", "pdf_url": "https://arxiv.org/pdf/2607.27577", "citations": 0, "topics": [], "tags": [ "MoE", "Fairness & Ethics", "Interpretability", "Information Retrieval", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (MoE) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.71, "content_potential_score": 2.76, "interestingness_score": 2.93, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Heterogeneous recommendation feeds present complex challenges that extend beyond those found in highly homogeneous environments (e.g., music-only or video-only closed-ecosystem platforms). In Google Discover, a unified feed integrates diverse content sourced from the decentralized open web, including web articles, long-form and short-form videos, user-generated content (UGC), and beyond.", "key_contribution": "Heterogeneous recommendation feeds present complex challenges that extend beyond those found in highly homogeneous environments (e.g., music-only or video-only closed-ecosystem platforms).", "why_it_matters": "Heterogeneous Ranking in Industrial-Scale Recommender Systems: A Case Study improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about MoE.", "one_line_takeaway": "Heterogeneous recommendation feeds present complex challenges that extend beyond those found in highly homogeneous…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in MoE.", "url": "https://arxiv.org/abs/2607.27577", "difficulty": "advanced" }, { "id": "arxiv:2607.17264", "source": "arxiv", "source_type": "preprint", "title": "Coordinated Disentanglement with Iterative Mode Discovery Under Hidden Correlations", "abstract": "Disentangled representation learning is a powerful paradigm for robust attribute prediction. While recent methods address attribute correlations, hidden correlations remain underexplored, where data under the value of a certain attribute exhibit underlying modes correlated with other attributes. To preserve mode information and achieve disentanglement, we jointly discover modes and enforce mode-based conditional independence. Yet, the interdependency between these two modules may lead to error amplification under naive iterations. We propose Coordinated Disentanglement with Iterative mode Discovery (CoDID), an end-to-end framework featuring a dynamic architecture that adapts to evolving number of modes, and a coordination mechanism that mitigates error amplification via meta-optimization. Empirical results demonstrate the state-of-the-art performance on diverse tasks.", "authors": [ "Rong Hu", "Ling Chen" ], "year": 2026, "published_date": "2026-07-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.17264", "pdf_url": "https://arxiv.org/pdf/2607.17264", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 3.74, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Disentangled representation learning is a powerful paradigm for robust attribute prediction. While recent methods address attribute correlations, hidden correlations remain underexplored, where data under the value of a certain attribute exhibit underlying modes correlated with other attributes.", "key_contribution": "To preserve mode information and achieve disentanglement, we jointly discover modes and enforce mode-based conditional independence.", "why_it_matters": "Coordinated Disentanglement with Iterative Mode Discovery Under Hidden Correlations represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "To preserve mode information and achieve disentanglement, we jointly discover modes and enforce mode-based conditional…", "biggest_caveat": "bute prediction.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Self-Supervised.", "url": "https://arxiv.org/abs/2607.17264", "difficulty": "intermediate" }, { "id": "arxiv:2607.15880", "source": "arxiv", "source_type": "preprint", "title": "Dynamics-Aware Meta-Imitation for Generalization to Unseen Robotic Manipulation", "abstract": "Imitation Learning aims to learn skills from extensive observations and demonstrations for robots, so it suffers from data scarcity and environment generalization. The existing methods predominantly focus on imitation from in-domain tasks and consequently struggle with generalization to unseen tasks. To bridge this generalization gap, we propose the \\textbf{D}ynamics-\\textbf{A}ware \\textbf{M}eta-\\textbf{I}mitation (DAMI) framework. By integrating meta-learning to construct a shared skill space, DAMI equips agents for rapid adaptation to novel tasks. We introduce the Visual-Motor Trajectory (VMT) module to capture complex spatio-temporal dynamics within the task latent space. Furthermore, we propose the Unpaired Unified Task (U2T) block to fuse unstructured multimodal observations. To coordinate these representations, we integrate a Task-Conditioned Feature Modulation (TCFM) mechanism customized for modulating low-level 3D features. By capturing intrinsic dynamics from a random complete reference demonstration, our framework learns the underlying task logic rather than memorizing static cues, ensuring effective generalization. Extensive experiments in both simulation and real-world settings demonstrate that our approach outperforms state-of-the-art baselines regarding direct inference on seen tasks and adaptation to unseen tasks via few-shot fine-tuning.", "authors": [ "Zhenduo Shang", "Xiyao Liu", "Bohan Li", "Xudong Wang", "Teng Ren", "Lianqing Liu", "Zhi Han" ], "year": 2026, "published_date": "2026-07-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.15880", "pdf_url": "https://arxiv.org/pdf/2607.15880", "citations": 0, "topics": [], "tags": [ "Prompting", "Fine-Tuning", "Multimodal", "Robotics", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses latent space — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.96, "content_potential_score": 1.1, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Imitation Learning aims to learn skills from extensive observations and demonstrations for robots, so it suffers from data scarcity and environment generalization. The existing methods predominantly focus on imitation from in-domain tasks and consequently struggle with generalization to unseen tasks.", "key_contribution": "To bridge this generalization gap, we propose the \\textbf{D}ynamics-\\textbf{A}ware \\textbf{M}eta-\\textbf{I}mitation (DAMI) framework.", "why_it_matters": "Dynamics-Aware Meta-Imitation for Generalization to Unseen Robotic Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "To bridge this generalization gap, we propose the \\textbf{D}ynamics-\\textbf{A}ware \\textbf{M}eta-\\textbf{I}mitation…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2607.15880", "difficulty": "advanced" }, { "id": "arxiv:2607.15216", "source": "arxiv", "source_type": "preprint", "title": "Symbal: Detecting Systematic Misalignments in Model-Generated Captions", "abstract": "Multimodal large language models (MLLMs) often introduce errors when generating image captions, resulting in misaligned image-text pairs. Our work focuses on a class of captioning errors that we refer to as systematic misalignments, where a recurring error in MLLM-generated captions is closely associated with the presence of a specific visual feature in the paired image. Given a vision-language dataset with MLLM-generated captions, our aim in this work is to detect such errors, a task we refer to as systematic misalignment detection. As our first key contribution, we present Symbal, which utilizes a structured, dual-stage setup with off-the-shelf foundation models to identify systematic misalignments and summarize results in natural language. As our second key contribution, we introduce SymbalBench, a benchmark designed to evaluate automated methods on our proposed task. SymbalBench consists of 1.7 million image-text pairs from two domains (natural and medical images), organized into 420 vision-language datasets with annotated systematic misalignments. Symbal exhibits strong performance on this benchmark, correctly identifying systematic misalignments in 63.8% of datasets, a nearly 4x improvement over the closest baseline. We supplement our evaluations on SymbalBench with real-world evaluations, showing that (1) Symbal can accurately surface systematic misalignments in captions generated by four MLLMs and (2) Symbal is a powerful tool for auditing off-the-shelf image-caption datasets. Ultimately, our novel task, method, and benchmark can aid users with auditing MLLM-generated captions and identifying critical errors, without requiring access to the underlying MLLM. Code is available at https://github.com/Stanford-AIMI/Symbal.", "authors": [ "Maya Varma", "Jean-Benoit Delbrouck", "Sophie Ostmeier", "Akshay Chaudhari", "Curtis Langlotz" ], "year": 2026, "published_date": "2026-07-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.15216", "pdf_url": "https://arxiv.org/pdf/2607.15216", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "VLMs", "Evaluation", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 6.88, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multimodal large language models (MLLMs) often introduce errors when generating image captions, resulting in misaligned image-text pairs. Our work focuses on a class of captioning errors that we refer to as systematic misalignments, where a recurring error in MLLM-generated captions is closely associated with the presence of a specific visual feature in the paired image.", "key_contribution": "Multimodal large language models (MLLMs) often introduce errors when generating image captions, resulting in misaligned image-text pairs.", "why_it_matters": "Symbal: Detecting Systematic Misalignments in Model-Generated Captions advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Multimodal large language models (MLLMs) often introduce errors when generating image captions, resulting in misaligned…", "biggest_caveat": "bution, we introduce SymbalBench, a benchmark designed to evaluate automated methods on our proposed task.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.15216", "difficulty": "beginner" }, { "id": "arxiv:2502.07593", "source": "arxiv", "source_type": "preprint", "title": "Decision-Making Under Complete Uncertainty: You Will Not Regret Being Greedy", "abstract": "In this paper, we propose a game-theoretic model to study the properties of the worst-case regret of the greedy strategy under complete (Knightian) uncertainty. In a game between a decision-maker (DM) and an adversarial agent (Nature), Nature chooses an unknown state determining the distribution of ratings for each product. The DM observes a realization of product ratings and then chooses a product according to a strategy. For arbitrary numbers of products and ratings, we first study the equal-observations case in which every product has the same number of observations. In this benchmark, we establish matching upper and lower bounds on the worst-case regret, showing that the regret vanishes as the number of observations increases and that the greedy strategy is rate-optimal up to universal constants. In the special case with two products and two ratings, we show that with one observation per product the greedy strategy is minimax-optimal with respect to worst-case regret. We then allow products to have different numbers of observations. Greedy remains robust in a conservative sense: its worst-case regret is controlled by the least-reviewed product. However, unequal numbers of observations can also change greedy's exact worst-case behavior. In particular, adding observations for only one product can increase greedy's worst-case regret. Finally, we test the model on data collected from Google reviews for restaurants, showing that the greedy strategy's empirical performance closely aligns with the theoretical findings.", "authors": [ "Kristijan Atanasov", "Frederik Mallmann-Trenn", "Mehmet Mars Seven" ], "year": 2026, "published_date": "2026-07-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2502.07593", "pdf_url": "https://arxiv.org/pdf/2502.07593", "citations": 0, "topics": [], "tags": [ "Evaluation", "Game Theory" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 6.83, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In this paper, we propose a game-theoretic model to study the properties of the worst-case regret of the greedy strategy under complete (Knightian) uncertainty. In a game between a decision-maker (DM) and an adversarial agent (Nature), Nature chooses an unknown state determining the distribution of ratings for each product.", "key_contribution": "In this paper, we propose a game-theoretic model to study the properties of the worst-case regret of the greedy strategy under complete (Knightian) uncertainty.", "why_it_matters": "Decision-Making Under Complete Uncertainty: You Will Not Regret Being Greedy represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "In this paper, we propose a game-theoretic model to study the properties of the worst-case regret of the greedy…", "biggest_caveat": "bution of ratings for each product.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2502.07593", "difficulty": "beginner" }, { "id": "arxiv:2605.31271", "source": "arxiv", "source_type": "preprint", "title": "DriveMA: Driving Vision-Language-Action Models with verifiable Meta-Actions", "abstract": "Driving Vision-Language-Action Models (Driving VLAs) aim to use language to improve end-to-end planning, but the language-action gap limits this promise. We propose DriveMA, a Driving VLA framework built on verifiable meta-actions, which summarize future ego motion into compact language-domain intentions and can be constructed from expert trajectories with a trajectory-grounded annotation pipeline and can be verified against generated trajectories through rule-based projection. DriveMA exploits this verifiability with action-centric supervised training and a data-efficient turn-level credit assignment reinforcement learning framework, explicitly aligning high-level decisions with low-level trajectory planning through dense rewards and precise credit assignment. DriveMA sets a new state of the art on the Waymo Open Dataset Vision-based E2E Driving, achieving a Rater Feedback Score of 8.060 with a 2B model and further improving it to 8.079 with a 4B model; it also obtains competitive closed-loop planning performance on NAVSIM. These results show that even a simple meta-action interface can achieve state-of-the-art planning when made verifiable and optimized for language-action alignment. Code, data, and models will be released to facilitate future research.", "authors": [ "Weicheng Zheng", "Yixin Huang", "Qiao Sun", "Derun Li", "Hang Zhao" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.31271", "pdf_url": "https://arxiv.org/pdf/2605.31271", "citations": 0, "topics": [], "tags": [ "AI Safety", "RL", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.29, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Driving Vision-Language-Action Models (Driving VLAs) aim to use language to improve end-to-end planning, but the language-action gap limits this promise. We propose DriveMA, a Driving VLA framework built on verifiable meta-actions, which summarize future ego motion into compact language-domain intentions and can be constructed from expert trajectories with a trajectory-grounded annotation pipeline and can be verified against generated trajectories through rule-based projection.", "key_contribution": "We propose DriveMA, a Driving VLA framework built on verifiable meta-actions, which summarize future ego motion into compact language-domain intentions and can be constructed from expert trajectories with a trajectory-grounded annotation pipeline and can be verified against generated trajectories through rule-based projection.", "why_it_matters": "DriveMA: Driving Vision-Language-Action Models with verifiable Meta-Actions advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We propose DriveMA, a Driving VLA framework built on verifiable meta-actions, which summarize future ego motion into…", "biggest_caveat": "but the language-action gap limits this promise.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2605.31271", "difficulty": "advanced" }, { "id": "arxiv:2607.05404", "source": "arxiv", "source_type": "preprint", "title": "The Jagged Global Economy: Frontier AI Unevenly Exposes National Economies", "abstract": "Frontier AI's labor-market effects matter to workers, firms, and policymakers, but current evidence generally comes from a handful of high-income economies. The capabilities of frontier AI are jagged across work tasks and national economies diverge in how they allocate human labor. We introduce a national AI exposure metric that combines occupation-level exposure scores and international employment data for 141 countries. We find that high income countries are substantially more exposed than low income countries and that Europe and Central Asia are 50 percent more exposed than Sub-Saharan Africa. We also find a gender gap: women are more exposed than men in 91 percent of countries, driven by their concentration in white-collar and sales occupations. The exceptions are countries where women's employment remains concentrated in agriculture and household enterprises. We validate our national AI exposure estimates by showing they predict national AI adoption statistics published by Anthropic, Microsoft, and OpenAI. Beyond direct exposure, we identify a new mechanism for indirect exposure due to cross-country income dependencies. Some nations such as Tajikistan depend heavily on foreign workers remitting money back to their home countries: Tajikistan's direct exposure to frontier AI is below-average but because 37 percent of Tajikistan GDP is Russian remittance and Russia is very exposed, Tajikistan's remittance-accounted exposure becomes above-average. Our research shows that national variation in exposure is large enough that policy responses calibrated to U.S. or European labor markets will not generalize.", "authors": [ "Arul Murugan", "Tomás Aguirre", "Abhishek Nagaraj", "Rishi Bommasani" ], "year": 2026, "published_date": "2026-06-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.05404", "pdf_url": "https://arxiv.org/pdf/2607.05404", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.7, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Frontier AI's labor-market effects matter to workers, firms, and policymakers, but current evidence generally comes from a handful of high-income economies. The capabilities of frontier AI are jagged across work tasks and national economies diverge in how they allocate human labor.", "key_contribution": "We introduce a national AI exposure metric that combines occupation-level exposure scores and international employment data for 141 countries.", "why_it_matters": "The Jagged Global Economy: Frontier AI Unevenly Exposes National Economies represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "We introduce a national AI exposure metric that combines occupation-level exposure scores and international employment…", "biggest_caveat": "but current evidence generally comes from a handful of high-income economies.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2607.05404", "difficulty": "intermediate" }, { "id": "arxiv:2606.20491", "source": "arxiv", "source_type": "preprint", "title": "Fast Human Attention Prediction for Fixation-guided Active Perception in Autonomous Navigation", "abstract": "Human visual attention relies on structured scanpaths to efficiently process scenes, yet instilling this behavior into robot autonomy is in its infancy and hindered by the high,computational costs of existing predictive models. To address this, we introduce GazeLNN, a computationally lightweight,scanpath prediction model that leverages Liquid Neural Networks as its recurrent engine and employs MobileNetV3 for feature extraction. Operating auto-regressively, the architecture predicts sequential fixation heatmaps conditioned on the current visual stimulus and fixation history. Despite requiring only 0.61 GFLOPs, GazeLNN achieves state-of-the-art performance on the MIT Low Resolution dataset achieving 0.47 ScanMatch score. It outperforms existing recurrent baselines across diverse evaluation metrics, while reducing computational costs by 99.40% and accelerating inference by up to six times. To investigate the role of human attention modeling in robot autonomy and demonstrate the practical utility of this highly efficient architecture, we integrate GazeLNN into an active camera-robot control policy trained via Reinforcement Learning. This integration enables human-fixation-guided perception during autonomous navigation, validated through successful real-world deployments on an aerial robot.", "authors": [ "Fatma Youssef Mohammed", "Grzegorz Malczyk", "Kostas Alexis" ], "year": 2026, "published_date": "2026-06-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.20491", "pdf_url": "https://arxiv.org/pdf/2606.20491", "citations": 0, "topics": [], "tags": [ "RL", "Robotics", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.26, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Human visual attention relies on structured scanpaths to efficiently process scenes, yet instilling this behavior into robot autonomy is in its infancy and hindered by the high,computational costs of existing predictive models. To address this, we introduce GazeLNN, a computationally lightweight,scanpath prediction model that leverages Liquid Neural Networks as its recurrent engine and employs MobileNetV3 for feature extraction.", "key_contribution": "To address this, we introduce GazeLNN, a computationally lightweight,scanpath prediction model that leverages Liquid Neural Networks as its recurrent engine and employs MobileNetV3 for feature extraction.", "why_it_matters": "Fast Human Attention Prediction for Fixation-guided Active Perception in Autonomous Navigation advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "To address this, we introduce GazeLNN, a computationally lightweight,scanpath prediction model that leverages Liquid…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2606.20491", "difficulty": "advanced" }, { "id": "arxiv:2606.19595", "source": "arxiv", "source_type": "preprint", "title": "IHBench: Evaluating Post-Interruption Recovery in Voice Agents with Structured Workflows", "abstract": "Voice agents deployed in structured workflows (customer service, healthcare scheduling, account management) must handle frequent user interruptions while maintaining progress through multi-step procedures. Existing benchmarks for speech-capable models focus on the timing of interruptions: barge-in detection, endpointing, and turn-taking dynamics. They leave unmeasured what happens after the interruption: does the agent resume the workflow at the correct step? Does it address the user's interjection? Does it avoid re-delivering content the user already heard? We introduce IHBench (Interruption Handling Benchmark), a benchmark that evaluates post-interruption recovery in voice agents executing state-machine-driven workflows across 10 enterprise domains. Six interruption types are injected at controlled points mid-utterance, with per-interruption evaluation rubrics generated alongside the data. Each interruption is scored on two axes: task fulfillment and recovery quality. We evaluate 27 audio-language model configurations from OpenAI, Google, and the open-weight community. Models vary widely, and recovery quality depends strongly on the interruption type. Across our experiments, closed-weight models are consistently more robust to interruptions than open-weight ones: they win far more often on task fulfillment, degrade roughly 3.3x more slowly as conversations grow longer, and show no audio-versus-text modality gap, whereas the open-weight models lose ground on all three. A human study validates the LLM judge against human annotators, and a cross-benchmark analysis against AudioMultiChallenge indicates that recovery quality is a largely distinct capability axis.", "authors": [ "Ahmad Salimi", "Wentao Ma", "Yuzhi Tang", "Dongming Shen", "Mu Li", "Alex Smola" ], "year": 2026, "published_date": "2026-06-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.19595", "pdf_url": "https://arxiv.org/pdf/2606.19595", "citations": 0, "topics": [], "tags": [ "LLMs", "Dialogue", "Adversarial", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.73, "content_potential_score": 2.34, "interestingness_score": 2.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Voice agents deployed in structured workflows (customer service, healthcare scheduling, account management) must handle frequent user interruptions while maintaining progress through multi-step procedures. Existing benchmarks for speech-capable models focus on the timing of interruptions: barge-in detection, endpointing, and turn-taking dynamics.", "key_contribution": "We introduce IHBench (Interruption Handling Benchmark), a benchmark that evaluates post-interruption recovery in voice agents executing state-machine-driven workflows across 10 enterprise domains.", "why_it_matters": "IHBench: Evaluating Post-Interruption Recovery in Voice Agents with Structured Workflows represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce IHBench (Interruption Handling Benchmark), a benchmark that evaluates post-interruption recovery in voice…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.19595", "difficulty": "beginner" }, { "id": "arxiv:2605.11378", "source": "arxiv", "source_type": "preprint", "title": "An Empirical Study of Automating Agent Evaluation", "abstract": "Agent evaluation requires assessing complex multi-step behaviors involving tool use and intermediate reasoning, making it costly and expertise-intensive. A natural question arises: can frontier coding assistants reliably automate this evaluation process? Our study shows that simply prompting coding assistants is insufficient for this task. Without domain-specific evaluation knowledge, frontier coding assistants achieve only a 30% execution success rate and produce over-engineered evaluations averaging 12+ metrics per agent, indicating that strong coding ability does not automatically translate to reliable agent evaluation. We introduce EvalAgent, an AI assistant that automates the end-to-end agent evaluation pipeline. EvalAgent encodes evaluation domain expertise as evaluation skills (procedural instructions, reusable code and templates, and dynamically retrieved API documentation) that compose into a trace-based pipeline producing complete evaluation artifacts including metrics, executable code, and reports. To systematically assess generated evaluations, we introduce a meta-evaluation framework alongside AgentEvalBench, a benchmark comprising 20 agents, each paired with evaluation requirements and test scenarios. We further propose the Eval@1 metric to measure whether generated evaluation code both executes and yields meaningful results on the first run. Our experiments show that EvalAgent produces focused evaluations, improving Eval@1 from 17.5% to 65%, and achieving 79.5% human expert preference over baseline approaches. Further ablation studies show that evaluation skills are critical for handling complex evaluation: removing them causes Eval@1 to drop significantly from 65% to 30%.", "authors": [ "Kang Zhou", "Sangmin Woo", "Haibo Ding", "Kiran Ramnath", "Subramanian Chidambaram", "Aosong Feng", "Vinayak Arannil", "Muhyun Kim", "Ishan Singh", "Darren Wang", "Zhichao Xu", "Megha Gandhi", "Nirmal Prabhu", "Soumya Smruti Mishra", "Vivek Singh", "Gouri Pandeshwar", "Lin Lee Cheong" ], "year": 2026, "published_date": "2026-05-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.11378", "pdf_url": "https://arxiv.org/pdf/2605.11378", "citations": 0, "topics": [], "tags": [ "Reasoning", "AI Agents", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 6.41, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agent evaluation requires assessing complex multi-step behaviors involving tool use and intermediate reasoning, making it costly and expertise-intensive. A natural question arises: can frontier coding assistants reliably automate this evaluation process?", "key_contribution": "Without domain-specific evaluation knowledge, frontier coding assistants achieve only a 30% execution success rate and produce over-engineered evaluations averaging 12+ metrics per agent, indicating that strong coding ability does not automatically translate to reliable agent evaluation.", "why_it_matters": "An Empirical Study of Automating Agent Evaluation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Without domain-specific evaluation knowledge, frontier coding assistants achieve only a 30% execution success rate and…", "biggest_caveat": "does not automatically translate to reliable agent evaluation.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.11378", "difficulty": "beginner" }, { "id": "arxiv:2606.13425v1", "source": "arxiv", "source_type": "preprint", "title": "An Assessment Framework for Application-Level Cryptographic Agility", "abstract": "The impending post-quantum transition to new cryptography will require complete replacement of algorithms within all software. The cryptographic APIs used today make this transition challenging because they were not designed with agility as a concern. There is no method for systematically assessing cryptographic agility as an overall ability. In addition to this, the term itself refers to multiple independent capabilities. Specifically, it includes replacing algorithms, selecting by policy, and substituting implementations. This lack of structured decomposition limits both the evaluation of systems and the development of cryptographically agile APIs. We introduce a component-based assessment framework that characterizes application-level cryptographic agility along seven orthogonal dimensions: three coupling dimensions that measure what the application code knows about algorithms and providers, a cross-cutting decoupling mechanism, a governance authority dimension, and two agility enablers that measure actual migration capability. The framework is non-linear and captures non-hierarchical profiles: a system may achieve high operation decoupling yet low creation decoupling, or strong versioning without externalized configuration. We evaluate six representative APIs (PKCS#11, OpenSSL~3.0, JCA, Google Tink, AWS KMS, and HashiCorp Vault Transit) against the framework, revealing three pervasive and independent gaps: no system supports intent-based key creation, none provides policy-driven algorithm selection (as distinct from access control), and none offers dedicated/first-class operations for algorithm transformation of existing keys. These gaps are individually sufficient to prevent agile migration, explaining why the post-quantum transition remains a software engineering problem despite decades of API progress.", "authors": [ "Navaneeth Rameshan", "Gregoire Messmer" ], "year": 2026, "published_date": "2026-06-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.13425v1", "pdf_url": "https://arxiv.org/pdf/2606.13425v1", "citations": 0, "topics": [], "tags": [ "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.71, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The impending post-quantum transition to new cryptography will require complete replacement of algorithms within all software. The cryptographic APIs used today make this transition challenging because they were not designed with agility as a concern.", "key_contribution": "We introduce a component-based assessment framework that characterizes application-level cryptographic agility along seven orthogonal dimensions: three coupling dimensions that measure what the application code knows about algorithms and providers, a cross-cutting decoupling mechanism, a governance authority dimension, and two agility enablers that measure actual migration capability.", "why_it_matters": "An Assessment Framework for Application-Level Cryptographic Agility represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Cryptography & Security.", "one_line_takeaway": "We introduce a component-based assessment framework that characterizes application-level cryptographic agility along…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Cryptography & Security.", "url": "http://arxiv.org/abs/2606.13425v1", "difficulty": "intermediate" }, { "id": "arxiv:2605.11732", "source": "arxiv", "source_type": "preprint", "title": "AgentDisCo: Towards Disentanglement and Collaboration in Open-ended Deep Research Agents", "abstract": "In this paper, we present AgentDisCo, a novel Disentangled and Collaborative agentic architecture that formulates deep research as an adversarial optimization problem between information exploration and exploitation. Unlike existing approaches that conflate these two processes into a single module, AgentDisCo employs a critic agent to evaluate generated outlines and refine search queries, and a generator agent to retrieve updated results and revise outlines accordingly. The iteratively refined outline is then passed to a downstream report writer that synthesizes a comprehensive research report. The overall workflow supports both handcrafted and automatically discovered design strategies via a meta-optimization harness, in which the generator agent is repurposed as a scoring agent to evaluate critic outputs and generate quality signals. Powerful code-generation agents (e.g., Claude-Code, Codex) systematically explore agent configurations and construct a policy bank, a structured repository of reusable design strategies, enabling the framework to self-refine without extensive human intervention. We evaluate AgentDisCo on three established deep research benchmarks (DeepResearchBench, DeepConsult, DeepResearchGym) using Gemini-2.5-Pro, achieving performance comparable to or surpassing leading closed-source systems. Observing that existing benchmarks inadequately reflect real-world user needs, we introduce GALA (General AI Life Assistants), a benchmark that mines latent research interests from users' historical browsing behavior. We further develop a rendering agent that converts research reports into visually rich poster presentations, and demonstrate an end-to-end product, AutoResearch Your Interest, which delivers personalized deep research recommendations derived from individual browsing histories.", "authors": [ "Jiarui Jin", "Zexuan Yan", "Shijian Wang", "Wenxiang Jiao", "Yuan Lu" ], "year": 2026, "published_date": "2026-05-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.11732", "pdf_url": "https://arxiv.org/pdf/2605.11732", "citations": 0, "topics": [], "tags": [ "AI Agents", "Code Generation", "Evaluation", "NLP", "Multi-Agent Systems" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 6.83, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In this paper, we present AgentDisCo, a novel Disentangled and Collaborative agentic architecture that formulates deep research as an adversarial optimization problem between information exploration and exploitation. Unlike existing approaches that conflate these two processes into a single module, AgentDisCo employs a critic agent to evaluate generated outlines and refine search queries, and a generator agent to retrieve updated results and revise outlines accordingly.", "key_contribution": "In this paper, we present AgentDisCo, a novel Disentangled and Collaborative agentic architecture that formulates deep research as an adversarial optimization problem between information exploration and exploitation.", "why_it_matters": "AgentDisCo: Towards Disentanglement and Collaboration in Open-ended Deep Research Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "In this paper, we present AgentDisCo, a novel Disentangled and Collaborative agentic architecture that formulates deep…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2605.11732", "difficulty": "beginner" }, { "id": "arxiv:2605.30747", "source": "arxiv", "source_type": "preprint", "title": "Generating Graph-like Rules for Knowledge Graph Reasoning via Diffusion Models", "abstract": "Logical rules constitute a cornerstone of knowledge graph (KG) reasoning, valued for their interpretability and ability to model relational patterns. However, existing rule mining methods predominantly focus on simple chain-like rules and therefore neglect the richer relational information encoded in graph-like structures, such as cycles and branches. This limitation is further exacerbated by computational bottlenecks caused by the combinatorial explosion of the search space, which is especially challenging for graph-like rules. Meanwhile, generative approaches such as diffusion models, despite their success in other domains, can not be directly applied to rule mining because their training objectives are not aligned with the goal of learning high-quality rules, and non-differentiable KG rule quality metrics cannot directly guide model optimization. To address these limitations, we propose GRiD, a framework that reformulates graph-like rule discovery as a discrete generative process conditioned on the target relation. GRiD employs a two-phase training strategy. First, supervised pre-training enables GRiD to capture structural priors from subgraphs sampled from the KG meta-graph. Subsequently, reinforcement learning is applied to fine-tune GRiD through policy gradient optimization guided directly by non-differentiable rule-quality metrics. Experiments on six benchmark datasets show that GRiD achieves competitive performance on KG completion tasks. Ablation studies confirm the efficiency and robustness of GRiD and further show that graph-like rules complement chain-like rules in KG completion. Our codes and datasets are available in https://github.com/Haoxiang-Cheng/GRiD", "authors": [ "Haoxiang Cheng", "Yunfei Wang", "Chao Chen", "Kewei Cheng", "Zhipeng Lin", "Haoxuan Li", "Changjun Fan", "Shixuan Liu" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.30747", "pdf_url": "https://arxiv.org/pdf/2605.30747", "citations": 0, "topics": [], "tags": [ "Reasoning", "Fine-Tuning", "Diffusion", "Self-Supervised", "RL" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Diffusion, RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.55, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Logical rules constitute a cornerstone of knowledge graph (KG) reasoning, valued for their interpretability and ability to model relational patterns. However, existing rule mining methods predominantly focus on simple chain-like rules and therefore neglect the richer relational information encoded in graph-like structures, such as cycles and branches.", "key_contribution": "To address these limitations, we propose GRiD, a framework that reformulates graph-like rule discovery as a discrete generative process conditioned on the target relation.", "why_it_matters": "Generating Graph-like Rules for Knowledge Graph Reasoning via Diffusion Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "To address these limitations, we propose GRiD, a framework that reformulates graph-like rule discovery as a discrete…", "biggest_caveat": "cannot directly guide model optimization.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.30747", "difficulty": "advanced" }, { "id": "arxiv:2606.02674", "source": "arxiv", "source_type": "preprint", "title": "Cross-Vendor Sola ISPM Benchmark: Evaluating Agentic AI for Federated Identity Security Reasoning", "abstract": "The rapid proliferation of multi-cloud and SaaS platforms has transformed Identity Security Posture Management (ISPM) into a fundamentally cross-vendor challenge: critical misconfigurations and privilege escalation paths increasingly span multiple identity providers, infrastructure layers, and authentication systems never designed to interoperate. Existing evaluations focus on isolated single-platform environments and provide no means to assess whether an AI agent can reason across these fragmented boundaries. To address this gap, we introduce the Cross-Vendor Sola ISPM Benchmark, a production-grade benchmark of 50 data-grounded tasks requiring multi-hop entity resolution and cross-system correlation across eight integrated enterprise platforms including AWS, Okta, Azure AD, and Google Workspace. We also contribute an evaluation framework measuring not only final answer correctness but also evidentiary grounding, structural join fidelity, retrieval quality, and SQL equivalence. We evaluate the Sola AI Agent across five context configurations - from no injected metadata to full schema, graph, and retrieval context - using three frontier LLMs. Results show that structured relational context improves answer correctness by approximately 34% relatively and reduces exploration queries by approximately 70% across all tested models, with the largest gains driven by cross-vendor graph topology. Our findings indicate that frontier LLMs possess substantial latent security reasoning capability, but reliable cross-vendor identity analysis is fundamentally constrained by the availability of explicit relational context for entity resolution and evidentiary grounding. Under full context, the best configuration achieves 78% answer correctness while reducing complete failure to 4%.", "authors": [ "Eden Yavin", "Gal Engelberg", "Konstantin Koutsyi", "Leon Goldberg", "Gal Baron" ], "year": 2026, "published_date": "2026-06-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.02674", "pdf_url": "https://arxiv.org/pdf/2606.02674", "citations": 0, "topics": [], "tags": [ "Reasoning", "Hallucination", "AI Agents", "Evaluation", "Cryptography & Security" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.09, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The rapid proliferation of multi-cloud and SaaS platforms has transformed Identity Security Posture Management (ISPM) into a fundamentally cross-vendor challenge: critical misconfigurations and privilege escalation paths increasingly span multiple identity providers, infrastructure layers, and authentication systems never designed to interoperate. Existing evaluations focus on isolated single-platform environments and provide no means to assess whether an AI agent can reason across these fragmented boundaries.", "key_contribution": "To address this gap, we introduce the Cross-Vendor Sola ISPM Benchmark, a production-grade benchmark of 50 data-grounded tasks requiring multi-hop entity resolution and cross-system correlation across eight integrated enterprise platforms including AWS, Okta, Azure AD, and Google Workspace.", "why_it_matters": "Cross-Vendor Sola ISPM Benchmark: Evaluating Agentic AI for Federated Identity Security Reasoning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "To address this gap, we introduce the Cross-Vendor Sola ISPM Benchmark, a production-grade benchmark of 50…", "biggest_caveat": "but also evidentiary grounding, structural join fidelity, retrieval quality, and SQL equivalence.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2606.02674", "difficulty": "frontier" }, { "id": "arxiv:2412.12036", "source": "arxiv", "source_type": "preprint", "title": "LeARN: Learnable and Adaptive Representations for Nonlinear Dynamics in System Identification", "abstract": "System identification, the process of deriving mathematical models of dynamical systems from observed input-output data, has undergone a paradigm shift with the advent of learning-based methods. Addressing the intricate challenges of data-driven discovery in nonlinear dynamical systems, these methods have garnered significant attention. Among them, Sparse Identification of Nonlinear Dynamics (SINDy) has emerged as a transformative approach, distilling complex dynamical behaviors into interpretable linear combinations of basis functions. However, SINDy's reliance on domain-specific expertise to construct its foundational 'library' of basis functions limits its adaptability and universality. In this work, we introduce a nonlinear system identification framework LeARN that transcends the need for prior domain knowledge by learning the library of basis functions directly from data. To enhance adaptability to evolving system dynamics under varying noise conditions, we employ a novel meta-learning-based system identification approach that utilizes a light-weight Deep Neural Network (DNN) to dynamically refine these basis functions. This not only captures intricate system behaviors but also adapts effectively to new dynamical regimes. We validate our framework on the Neural Fly dataset, showcasing its robust adaptation and generalization capabilities. Despite its simplicity, our LeARN achieves competitive dynamical error performance to SINDy. This work presents a step towards autonomous discovery of dynamical systems, paving the way for a future where machine learning uncovers the governing principles of complex systems without requiring extensive domain-specific interventions.", "authors": [ "Arunabh Singh", "Joyjit Mukherjee" ], "year": 2026, "published_date": "2026-05-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2412.12036", "pdf_url": "https://arxiv.org/pdf/2412.12036", "citations": 0, "topics": [], "tags": [ "Robotics", "Interpretability", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 6.7, "content_potential_score": 1.92, "interestingness_score": 2.51, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "System identification, the process of deriving mathematical models of dynamical systems from observed input-output data, has undergone a paradigm shift with the advent of learning-based methods. Addressing the intricate challenges of data-driven discovery in nonlinear dynamical systems, these methods have garnered significant attention.", "key_contribution": "In this work, we introduce a nonlinear system identification framework LeARN that transcends the need for prior domain knowledge by learning the library of basis functions directly from data.", "why_it_matters": "LeARN: Learnable and Adaptive Representations for Nonlinear Dynamics in System Identification represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "In this work, we introduce a nonlinear system identification framework LeARN that transcends the need for prior domain…", "biggest_caveat": "However, SINDy's reliance on domain-specific expertise to construct its foundational 'library' of basis functions limits its adaptability and universality.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2412.12036", "difficulty": "intermediate" }, { "id": "arxiv:2604.08537v1", "source": "arxiv", "source_type": "preprint", "title": "Meta-learning In-Context Enables Training-Free Cross Subject Brain Decoding", "abstract": "Visual decoding from brain signals is a key challenge at the intersection of computer vision and neuroscience, requiring methods that bridge neural representations and computational models of vision. A field-wide goal is to achieve generalizable, cross-subject models. A major obstacle towards this goal is the substantial variability in neural representations across individuals, which has so far required training bespoke models or fine-tuning separately for each subject. To address this challenge, we introduce a meta-optimized approach for semantic visual decoding from fMRI that generalizes to novel subjects without any fine-tuning. By simply conditioning on a small set of image-brain activation examples from the new individual, our model rapidly infers their unique neural encoding patterns to facilitate robust and efficient visual decoding. Our approach is explicitly optimized for in-context learning of the new subject's encoding model and performs decoding by hierarchical inference, inverting the encoder. First, for multiple brain regions, we estimate the per-voxel visual response encoder parameters by constructing a context over multiple stimuli and responses. Second, we construct a context consisting of encoder parameters and response values over multiple voxels to perform aggregated functional inversion. We demonstrate strong cross-subject and cross-scanner generalization across diverse visual backbones without retraining or fine-tuning. Moreover, our approach requires neither anatomical alignment nor stimulus overlap. This work is a critical step towards a generalizable foundation model for non-invasive brain decoding.", "authors": [ "Mu Nan", "Muquan Yu", "Weijian Mai", "Jacob S. Prince", "Hossein Adeli", "Rui Zhang", "Jiahang Cao", "Benjamin Becker", "John A. Pyles", "Margaret M. Henderson", "Chunfeng Song", "Nikolaus Kriegeskorte", "Michael J. Tarr", "Xiaoqing Hu", "Andrew F. Luo" ], "year": 2026, "published_date": "2026-04-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.08537v1", "pdf_url": "https://arxiv.org/pdf/2604.08537v1", "citations": 0, "topics": [], "tags": [ "Prompting", "Fine-Tuning", "AI Safety", "Info Extraction", "Prompting & In-Context Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 6.42, "content_potential_score": 1.1, "interestingness_score": 2.1, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Visual decoding from brain signals is a key challenge at the intersection of computer vision and neuroscience, requiring methods that bridge neural representations and computational models of vision. A field-wide goal is to achieve generalizable, cross-subject models.", "key_contribution": "A field-wide goal is to achieve generalizable, cross-subject models.", "why_it_matters": "Meta-learning In-Context Enables Training-Free Cross Subject Brain Decoding unlocks new capabilities from existing models without any additional training.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "A field-wide goal is to achieve generalizable, cross-subject models.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "http://arxiv.org/abs/2604.08537v1", "difficulty": "beginner" }, { "id": "arxiv:2605.19196", "source": "arxiv", "source_type": "preprint", "title": "Time to REFLECT: Can We Trust LLM Judges for Evidence-based Research Agents?", "abstract": "Deep research agents increasingly automate complex information-seeking tasks, producing evidence-grounded reports via multi-step reasoning, tool use, and synthesis. Their growing role demands scalable, reliable evaluation, positioning LLM-as-judge as a supervision paradigm for assessing factual accuracy, evidence use, and reasoning quality. Yet the reliability of these judges for deep research agents remains poorly understood, posing a critical meta-evaluation problem: before deploying LLM judges to supervise research agents, we must first evaluate the judges themselves. Existing meta-evaluations fall short in two ways: (1) reliance on coarse, subjective human-preference agreement; (2) focus on instruction-following or verifiable tasks, leaving open-ended agent executions unexplored. To address these gaps, we introduce REFLECT (REliable Fine-grained LLM judge Evaluation via Controlled inTervention), a meta-evaluation benchmark targeting fine-grained failure detection in agentic environments. REFLECT defines a detailed taxonomy of process- and outcome-level failure modes, instantiated by performing controlled and localized interventions on quality-screened agent execution traces. This yields verifiable, comprehensive, and fine-grained instances for validating the judge models. Our experiments show that current LLM judges remain unreliable: even the best-performing models achieve overall accuracies below 55% across reasoning, tool-use, and report-quality failures, with especially poor performance on evidence verification. Together, our taxonomy and findings expose systematic judge limitations, reveal tradeoffs in cost and reliability, and offer actionable guidance for building more reliable evaluation pipelines for deep research agents.", "authors": [ "Leyao Wang", "Yanan He", "Peng Chen", "Asaf Yehudai", "Yixin Liu", "Rex Ying", "Michal Shmueli-Scheuer", "Arman Cohan" ], "year": 2026, "published_date": "2026-05-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.19196", "pdf_url": "https://arxiv.org/pdf/2605.19196", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.72, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deep research agents increasingly automate complex information-seeking tasks, producing evidence-grounded reports via multi-step reasoning, tool use, and synthesis. Their growing role demands scalable, reliable evaluation, positioning LLM-as-judge as a supervision paradigm for assessing factual accuracy, evidence use, and reasoning quality.", "key_contribution": "To address these gaps, we introduce REFLECT (REliable Fine-grained LLM judge Evaluation via Controlled inTervention), a meta-evaluation benchmark targeting fine-grained failure detection in agentic environments.", "why_it_matters": "Time to REFLECT: Can We Trust LLM Judges for Evidence-based Research Agents? represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address these gaps, we introduce REFLECT (REliable Fine-grained LLM judge Evaluation via Controlled inTervention), a…", "biggest_caveat": "limitations, reveal tradeoffs in cost and reliability, and offer actionable guidance for building more reliable evaluation pipelines for deep research agents.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.19196", "difficulty": "beginner" }, { "id": "arxiv:2605.13228", "source": "arxiv", "source_type": "preprint", "title": "ReTool-Video: Recursive Tool-Using Video Agents with Meta-Augmented Tool Grounding", "abstract": "Video understanding requires active evidence seeking, motivating tool-augmented video agents for temporal reasoning, cross-modal understanding, and complex question answering. Existing video agents have improved video reasoning with retrieval, memory, frame inspection, and verifier tools, but they still face two limitations: (1) a coarse tool space that lacks fine-grained operations for compositional reasoning; and (2) a flat action space that forces high-level video intents into primitive executable tool calls. In this paper, we address these challenges with two complementary designs. First, we construct a MetaAug-Video Tool Library (MVTL), an extensible tool library with 134 registered tools, including 26 base tools for general multimodal signal processing and 108 meta tools for filtering, aggregation, reranking, formatting, and other intermediate-result operations. MVTL supports dual-level access to both structured video information and raw modal evidence, enabling diverse video reasoning scenarios. Second, we propose ReTool-Video, a recursive tool-using method that grounds high-level video intents into executable tool chains. In ReTool-Video, matched actions are executed directly, while unmatched intents are delegated to a resolver for parameter repair, tool substitution, or decomposition. This allows abstract actions such as temporal merging, cross-modal verification, or repeated-event aggregation to be progressively translated into concrete multimodal operations at runtime. Experiments on MVBench, MLVU, and Video-MME w/o sub. show that ReTool-Video consistently outperforms strong baselines. Further analysis demonstrates that recursive grounding and fine-grained meta tools improve the stability and effectiveness of complex video understanding.", "authors": [ "Xiao Liu", "Nayu Liu", "Junnan Zhu", "Ruirui Chen", "Guohui Xiang", "Changjian Wang", "Kaiwen Wei", "Rongzhen Li", "Jiang Zhong" ], "year": 2026, "published_date": "2026-05-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.13228", "pdf_url": "https://arxiv.org/pdf/2605.13228", "citations": 0, "topics": [], "tags": [ "Reasoning", "Hallucination", "Video AI", "QA", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.96, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Video understanding requires active evidence seeking, motivating tool-augmented video agents for temporal reasoning, cross-modal understanding, and complex question answering. Existing video agents have improved video reasoning with retrieval, memory, frame inspection, and verifier tools, but they still face two limitations: (1) a coarse tool space that lacks fine-grained operations for compositional reasoning; and (2) a flat action space that forces high-level video intents into primitive executable tool calls.", "key_contribution": "Second, we propose ReTool-Video, a recursive tool-using method that grounds high-level video intents into executable tool chains.", "why_it_matters": "ReTool-Video: Recursive Tool-Using Video Agents with Meta-Augmented Tool Grounding represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Second, we propose ReTool-Video, a recursive tool-using method that grounds high-level video intents into executable…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.13228", "difficulty": "beginner" }, { "id": "arxiv:2605.03999", "source": "arxiv", "source_type": "preprint", "title": "RD-ViT: Recurrent-Depth Vision Transformer for Semantic Segmentation with Reduced Data Dependence Extending the Recurrent-Depth Transformer Architecture to Dense Prediction", "abstract": "Vision Transformers (ViTs) achieve state-of-the-art segmentation accuracy but require large training datasets because each layer has unique parameters that must be learned independently. We present RD-ViT, a Recurrent-Depth Vision Transformer that adapts the Recurrent-Depth Transformer (RDT) architecture to dense prediction tasks, supporting both 2D and 3D inputs. RD-ViT replaces the deep stack of unique transformer blocks with a single shared block looped T times, augmented with LTI-stable state injection for guaranteed convergence, Adaptive Computation Time (ACT) for spatial compute allocation, depth-wise LoRA adaptation, and optional Mixture-of-Experts (MoE) feed-forward networks for category-specific specialization. We evaluate on the ACDC cardiac MRI segmentation benchmark in both 2D slice-level and 3D volumetric settings with exclusively real experiments executed in Google Colab. In 2D, RD-ViT outperforms standard ViT at 10% training data (Dice 0.774 vs 0.762) and at full data (0.882 vs 0.872). In 3D, RD-ViT with MoE achieves Dice 0.812 with 3.0M parameters, reaching 99.4% of standard ViT performance (0.817) at 53% of the parameter count. MoE expert utilization analysis reveals that different experts spontaneously specialize for different cardiac structures (RV, MYO, LV) without explicit routing supervision. ACT halting maps show higher compute allocation at cardiac boundaries, and the mean ponder time decreases from 2.6 to 1.4 iterations during training, demonstrating learned computational efficiency. Depth extrapolation enables inference with more loops than training without degradation. All code, notebooks, and results are publicly released.", "authors": [ "Renjie He" ], "year": 2026, "published_date": "2026-05-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.03999", "pdf_url": "https://arxiv.org/pdf/2605.03999", "citations": 0, "topics": [], "tags": [ "MoE", "Fine-Tuning", "Object Detection", "Transformers", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 7.77, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Vision Transformers (ViTs) achieve state-of-the-art segmentation accuracy but require large training datasets because each layer has unique parameters that must be learned independently. We present RD-ViT, a Recurrent-Depth Vision Transformer that adapts the Recurrent-Depth Transformer (RDT) architecture to dense prediction tasks, supporting both 2D and 3D inputs.", "key_contribution": "Vision Transformers (ViTs) achieve state-of-the-art segmentation accuracy but require large training datasets because each layer has unique parameters that must be learned independently.", "why_it_matters": "RD-ViT: Recurrent-Depth Vision Transformer for Semantic Segmentation with Reduced Data Dependence Extending the Recurrent-Depth Transformer Architecture to Dense Prediction represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about MoE.", "one_line_takeaway": "Vision Transformers (ViTs) achieve state-of-the-art segmentation accuracy but require large training datasets because…", "biggest_caveat": "but require large training datasets because each layer has unique parameters that must be learned independently.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in MoE.", "url": "https://arxiv.org/abs/2605.03999", "difficulty": "beginner" }, { "id": "arxiv:2604.11506v1", "source": "arxiv", "source_type": "preprint", "title": "RedShell: A Generative AI-Based Approach to Ethical Hacking", "abstract": "The application of Machine Learning techniques in code generation is now a common practice for most developers. Tools such as ChatGPT from OpenAI leverage the natural language processing capabilities of Large Language Models to generate machine code from natural language descriptions. In the cybersecurity field, red teams can also take advantage of generative models to build malicious code generators, providing more automation to Pentest audits. However, the application of Large Language Models in malicious code generation remains challenging due to the lack of data to train and evaluate offensive code generators. In this work, we propose RedShell, a tool that allows ethical hackers to generate malicious PowerShell code. We also introduce a ground truth dataset, combining publicly available code samples to fine-tune models in malicious PowerShell generation. Our experiments demonstrate the strong capabilities of RedShell in generating syntactically valid PowerShell, with fewer than 10% of the generated samples resulting in parse errors. Furthermore, our specialized model was able to produce samples that were semantically consistent with reference snippets, achieving a competitive performance on standard output similarity metrics such as Edit Distance and METEOR, with their mean similarity scores exceeding 50% and 40%, respectively. This work sheds light on the state-of-the-art research in the field of Generative AI applied to Pentesting, and also serves as a steppingstone for future advancements, highlighting the potential benefits these models hold within such controlled environments.", "authors": [ "Ricardo Bessa", "Rui Claro", "João Trindade", "João Lourenço" ], "year": 2026, "published_date": "2026-04-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.11506v1", "pdf_url": "https://arxiv.org/pdf/2604.11506v1", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Code Generation", "Cryptography & Security", "Code Generation & Synthesis", "Fine-Tuning & PEFT" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 6.23, "content_potential_score": 1.95, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The application of Machine Learning techniques in code generation is now a common practice for most developers. Tools such as ChatGPT from OpenAI leverage the natural language processing capabilities of Large Language Models to generate machine code from natural language descriptions.", "key_contribution": "In this work, we propose RedShell, a tool that allows ethical hackers to generate malicious PowerShell code.", "why_it_matters": "RedShell: A Generative AI-Based Approach to Ethical Hacking reduces the barrier to software development by automating code writing and understanding.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "In this work, we propose RedShell, a tool that allows ethical hackers to generate malicious PowerShell code.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "http://arxiv.org/abs/2604.11506v1", "difficulty": "intermediate" }, { "id": "arxiv:2605.18529", "source": "arxiv", "source_type": "preprint", "title": "AMR-SD: Asymmetric Meta-Reflective Self-Distillation for Token-Level Credit Assignment", "abstract": "The alignment of Large Language Models (LLMs) for complex reasoning heavily relies on Reinforcement Learning with Verifiable Rewards (RLVR). However, standard algorithms like GRPO apply sequence-level rewards uniformly to all tokens, creating a severe credit-assignment bottleneck. While on-policy self-distillation attempts to resolve this by conditioning a self-teacher on privileged contexts, direct exposure to raw oracle solutions often induces over-conditioned teacher distributions, implicit answer leakage, and late-stage training collapse. To overcome these limitations, we propose Asymmetric Meta-Reflective Self-Distillation (AMR-SD). Instead of conditioning directly on raw reference traces, AMR-SD inserts a reflection bottleneck: it compresses diagnostic signals -- from verifier outcomes, peer rollouts, or reference feedback -- into concise, self-generated Socratic hints and critiques. Furthermore, we introduce Causal Information Gain (CIG) with an asymmetric, ReLU-gated threshold to translate these reflections into sparse, highly precise token-level advantage modulations. Combined with temporal annealing, this mechanism preserves the base environmental reward while filtering out distributional noise. Experiments across scientific, mathematical, and tool-use benchmarks demonstrate that AMR-SD significantly outperforms existing baselines, achieving robust long-horizon stability and successfully preventing late-stage collapse.", "authors": [ "Zhenlin Wei", "Pu Jian", "Yingzhuo Deng", "Xiaohan Wang", "Jiajun Chai", "Zhexin Hu", "Wei Lin", "Shanbin Zhang", "Guojun Yin" ], "year": 2026, "published_date": "2026-05-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.18529", "pdf_url": "https://arxiv.org/pdf/2605.18529", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "RLHF", "AI Safety", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.67, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The alignment of Large Language Models (LLMs) for complex reasoning heavily relies on Reinforcement Learning with Verifiable Rewards (RLVR). However, standard algorithms like GRPO apply sequence-level rewards uniformly to all tokens, creating a severe credit-assignment bottleneck.", "key_contribution": "To overcome these limitations, we propose Asymmetric Meta-Reflective Self-Distillation (AMR-SD).", "why_it_matters": "AMR-SD: Asymmetric Meta-Reflective Self-Distillation for Token-Level Credit Assignment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To overcome these limitations, we propose Asymmetric Meta-Reflective Self-Distillation (AMR-SD).", "biggest_caveat": "However, standard algorithms like GRPO apply sequence-level rewards uniformly to all tokens, creating a severe credit-assignment bottleneck.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.18529", "difficulty": "beginner" }, { "id": "arxiv:2605.07273", "source": "arxiv", "source_type": "preprint", "title": "From Clouds to Hallucinations: Atmospheric Retrieval Hijacking in Remote Sensing Vision-Language RAG", "abstract": "Multimodal RAG systems increasingly rely on vision-language retrievers to ground visual queries in external textual evidence. Existing adversarial studies on RAG mainly manipulate the retrieval corpus or memory, while attacks on vision-language and remote sensing models typically target end-task predictions. Input-space threats to the evidence retrieval stage of remote sensing multimodal RAG remain underexplored. To address this gap, we introduce CloudWeb, an atmospheric retrieval hijacking attack that modifies only the input image while keeping the retriever, generator, and knowledge base fixed at deployment. CloudWeb overlays parameterized cloud- and haze-like patterns on remote sensing images and optimizes them with a retrieval-oriented objective that pulls adversarial image embeddings toward target atmospheric evidence, suppresses source-scene evidence, enforces rank separation, and regularizes naturalness and coverage. To the best of our knowledge, this is the first study of retrieval-stage atmospheric evidence hijacking in remote sensing multimodal RAG. We evaluate CloudWeb on a seven-dataset remote sensing RAG benchmark with five CLIP-style retrievers, including GeoRSCLIP, RemoteCLIP, OpenAI CLIP, and OpenCLIP, together with downstream vision-language generators. Across retrievers, CloudWeb consistently outperforms clean retrieval, handcrafted atmospheric baselines, random cloud perturbations, and fixed variants in injecting weather-related evidence into top-ranked results. On GeoRSCLIP ViT-B/32, Weather@5 increases from 0.71\\% to 43.29\\%. Downstream generation further shows measurable weather hallucination and semantic shift, indicating that retrieval-stage hijacking can propagate to the final RAG response. These findings reveal a practical failure mode: natural-looking atmospheric changes can compromise evidence retrieval before generation begins.", "authors": [ "Jiaju Han", "Chao Li", "Chengyin Hu", "Qike Zhang", "Xuemeng Sun", "Xin Wang", "Fengyu Zhang", "Xiang Chen", "Yiwei Wei", "Jiahuan Long", "Jiujiang Guo" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.07273", "pdf_url": "https://arxiv.org/pdf/2605.07273", "citations": 0, "topics": [], "tags": [ "Hallucination", "RAG", "VLMs", "Knowledge Graphs", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.81, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multimodal RAG systems increasingly rely on vision-language retrievers to ground visual queries in external textual evidence. Existing adversarial studies on RAG mainly manipulate the retrieval corpus or memory, while attacks on vision-language and remote sensing models typically target end-task predictions.", "key_contribution": "To address this gap, we introduce CloudWeb, an atmospheric retrieval hijacking attack that modifies only the input image while keeping the retriever, generator, and knowledge base fixed at deployment.", "why_it_matters": "From Clouds to Hallucinations: Atmospheric Retrieval Hijacking in Remote Sensing Vision-Language RAG represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "To address this gap, we introduce CloudWeb, an atmospheric retrieval hijacking attack that modifies only the input…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2605.07273", "difficulty": "beginner" }, { "id": "arxiv:2605.18862", "source": "arxiv", "source_type": "preprint", "title": "Towards Family-Grouped Hierarchical Federated Learning on Sub-5KB Models: A Feasibility Study of Privacy-Preserving ECG Monitoring for Ultra-Resource-Constrained Wearables", "abstract": "Cardiovascular disease remains the leading cause of death worldwide, and early detection of arrhythmias through continuous ECG monitoring on wearable devices can prevent life-threatening events. Federated Learning (FL) enables privacy-preserving collaborative training by keeping raw ECG data on device, yet standard FL incurs prohibitive communication overhead and standard deep learning models cannot fit on ultra-low-power microcontrollers. We propose Family-Grouped Hierarchical Federated Learning (Family-FL), a three-tier architecture that uses the family as a natural privacy boundary for intra-family aggregation before global synchronization. We further design a hardware-constrained Tiny CNN-LSTM architecture with only 669 parameters, INT8-quantized to occupy merely 4.65KB Flash and 2.95KB RAM, meeting the constraints of STC32G12K128-class microcontrollers. Experiments on the MIT-BIH Arrhythmia Database (mean of 5 independent runs with different seeds) demonstrate that Family-FL reduces communication volume by 76.7% compared to FedAvg while maintaining comparable accuracy. Family-FL-Tiny achieves 91.9 +/- 1.2% accuracy with macro-F1 of 0.483 +/- 0.031, reducing total communication to 0.31% of FedAvg. The model achieves reliable ventricular arrhythmia detection (per-class F1 = 0.80), the most clinically critical abnormality for home-based preliminary screening. These results demonstrate the technical feasibility of privacy-preserving federated learning on ultra-resource-constrained microcontrollers through simulation-based evaluation. We honestly discuss limitations: no hardware deployment, single-dataset validation (MIT-BIH, 47 subjects), reduced rare-class sensitivity, and absence of formal differential privacy guarantees.", "authors": [ "Hangyu Wu" ], "year": 2026, "published_date": "2026-05-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.18862", "pdf_url": "https://arxiv.org/pdf/2605.18862", "citations": 0, "topics": [], "tags": [ "Federated Learning", "Biomedical AI", "Artificial Intelligence", "Cryptography & Security", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.5, "content_potential_score": 2.34, "interestingness_score": 2.72, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Cardiovascular disease remains the leading cause of death worldwide, and early detection of arrhythmias through continuous ECG monitoring on wearable devices can prevent life-threatening events. Federated Learning (FL) enables privacy-preserving collaborative training by keeping raw ECG data on device, yet standard FL incurs prohibitive communication overhead and standard deep learning models cannot fit on ultra-low-power microcontrollers.", "key_contribution": "We propose Family-Grouped Hierarchical Federated Learning (Family-FL), a three-tier architecture that uses the family as a natural privacy boundary for intra-family aggregation before global synchronization.", "why_it_matters": "Towards Family-Grouped Hierarchical Federated Learning on Sub-5KB Models: A Feasibility Study of Privacy-Preserving ECG Monitoring for Ultra-Resource-Constrained Wearables represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Federated Learning.", "one_line_takeaway": "We propose Family-Grouped Hierarchical Federated Learning (Family-FL), a three-tier architecture that uses the family…", "biggest_caveat": "cannot fit on ultra-low-power microcontrollers.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Federated Learning.", "url": "https://arxiv.org/abs/2605.18862", "difficulty": "advanced" }, { "id": "arxiv:2605.17246", "source": "arxiv", "source_type": "preprint", "title": "Fidelity Probes for Specification--Code Alignment", "abstract": "We introduce fidelity probes: natural-language questions generated from a reference artifact with code-derived ground-truth answers, answered from a candidate specification. The fraction of agreeing probes, which we call the fidelity, decomposes into contradiction and coverage-gap rates that drive targeted spec edits to convergence. On a 15-program, roughly 12k-line COBOL benchmark (AWS CardDemo), we raise frozen-test specification fidelity from 0.63 to 0.94 over eight iterations, with the plateau location predicted by a two-state Markov fixed point $F^\\dagger$ from just four iterations of rate data. Probes come from an LLM reading the code or from a static-analysis pipeline over its control-flow, data-flow, and system-dependence graphs, with a tunable mixture. A probe-resampling protocol with a frozen held-out set gives a Hoeffding-bounded overfitting discriminant; our measured train/test gap stays more than an order of magnitude below this envelope. Three graph-grounded mixtures lift fidelity by +16 to +30 points; cross-distribution evaluation shows the LLM and symbolic channels are empirically complementary. A cross-family generator sweep on five independent LLM lineages (Anthropic, DeepSeek, Google, Alibaba, OpenAI) confirms the convergence behaviour is not tied to any single model family: three of five non-Claude generators produce trajectories consistent with the Markov fixed-point prediction, and the frozen-test protocol actively falsifies the two generators whose probe distributions drift across iterations. The method applies to any pair of artifacts that are supposed to describe the same behaviour.", "authors": [ "Ferhat Erata", "Hao Zhou", "Luke Huan" ], "year": 2026, "published_date": "2026-05-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.17246", "pdf_url": "https://arxiv.org/pdf/2605.17246", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.75, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce fidelity probes: natural-language questions generated from a reference artifact with code-derived ground-truth answers, answered from a candidate specification. The fraction of agreeing probes, which we call the fidelity, decomposes into contradiction and coverage-gap rates that drive targeted spec edits to convergence.", "key_contribution": "We introduce fidelity probes: natural-language questions generated from a reference artifact with code-derived ground-truth answers, answered from a candidate specification.", "why_it_matters": "Fidelity Probes for Specification--Code Alignment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce fidelity probes: natural-language questions generated from a reference artifact with code-derived…", "biggest_caveat": "bution evaluation shows the LLM and symbolic channels are empirically complementary.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.17246", "difficulty": "beginner" }, { "id": "arxiv:2605.17334", "source": "arxiv", "source_type": "preprint", "title": "Causal Anomaly Detection for Lithium-Ion Battery Degradation", "abstract": "Reliable early detection of lithium-ion battery degradation requires health indicators that are physically interpretable and computable from routine cycler telemetry without access to the degradation region. We introduce \\textsc{CausalHealth}, a framework that applies causal graph discovery and $k$-nearest-neighbour transfer entropy to per-cycle voltage, current, temperature, and resistance time series, and organises twelve resulting anomaly scores into three signal-class bundles (Magnitude-shift, Predictive-residual, Complexity-entropy) -- with Isolation Forest reported separately as it falls below the bundle reliability threshold -- to characterise detection sensitivity across ten commissioning fractions (5--30\\,\\%). The Magnitude-shift class achieves 100\\,\\% detection across all seven tested cells spanning LFP (MIT--Stanford MATR) and LCO (NASA PCoE, CALCE CS2) chemistries, with a lead time of up to 402 cycles before conventional capacity-threshold failure on gradual-fade cells. A Reliability-Weighted Master Health Index (RWMHI) -- a cross-bundle fusion of five high-reliability detectors weighted by inverse coefficient of variation -- improves lead time by 15--52 cycles over the class median on long-lived cells while maintaining 100\\,\\% detection. Validation against electrochemical impedance spectroscopy on an NMC prismatic cell provides independent physical grounding: transfer entropy $\\mathrm{TE}(R \\!\\to\\! V)$ correlates with charge-transfer resistance $R_{\\mathrm{ct}}$ (pooled $r = +0.990$; temperature-controlled partial $r = +0.898$), and an Arrhenius analysis of both quantities yields an activation energy consistent with published NMC charge-transfer kinetics. These results are evaluated on seven cells across three benchmark datasets.", "authors": [ "Dieter W. Heermann", "Hagen Heermann" ], "year": 2026, "published_date": "2026-05-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.17334", "pdf_url": "https://arxiv.org/pdf/2605.17334", "citations": 0, "topics": [], "tags": [ "Hallucination", "Interpretability", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.74, "content_potential_score": 1.92, "interestingness_score": 2.51, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reliable early detection of lithium-ion battery degradation requires health indicators that are physically interpretable and computable from routine cycler telemetry without access to the degradation region. We introduce \\textsc{CausalHealth}, a framework that applies causal graph discovery and $k$-nearest-neighbour transfer entropy to per-cycle voltage, current, temperature, and resistance time series, and organises twelve resulting anomaly scores into three signal-class bundles (Magnitude-shift, Predictive-residual, Complexity-entropy) -- with Isolation Forest reported separately as it falls below the bundle reliability threshold -- to characterise detection sensitivity across ten commissioning fractions (5--30\\,\\%).", "key_contribution": "We introduce \\textsc{CausalHealth}, a framework that applies causal graph discovery and $k$-nearest-neighbour transfer entropy to per-cycle voltage, current, temperature, and resistance time series, and organises twelve resulting anomaly scores into three signal-class bundles (Magnitude-shift, Predictive-residual, Complexity-entropy) -- with Isolation Forest reported separately as it falls below the bundle reliability threshold -- to characterise detection sensitivity across ten commissioning fractions (5--30\\,\\%).", "why_it_matters": "Causal Anomaly Detection for Lithium-Ion Battery Degradation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "We introduce \\textsc{CausalHealth}, a framework that applies causal graph discovery and $k$-nearest-neighbour transfer…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2605.17334", "difficulty": "beginner" }, { "id": "arxiv:2605.05632", "source": "arxiv", "source_type": "preprint", "title": "Architecture Matters: Comparing RAG Systems under Knowledge Base Poisoning", "abstract": "Retrieval-Augmented Generation (RAG) systems are vulnerable to knowledge base poisoning, yet existing attacks have been evaluated almost exclusively against vanilla retrieve-then-generate pipelines. Architectures designed to handle conflicting retrieved information - multi-agent debate, agentic retrieval, recursive language models - remain untested against adversarially optimized contradictions. We evaluate four RAG architectures (vanilla RAG, agentic RAG, MADAM-RAG, and Recursive Language Models) under controlled single-document (N=1) poisoning on 921 Natural Questions QA pairs, comparing a clean baseline, naive injection, and CorruptRAG-AK - an adversarial attack whose meta-epistemic framing targets credibility assessment. Architecture is a high-impact variable in adversarial robustness: under CorruptRAG-AK, attack success rates range from 81.9% (vanilla) to 24.4% (RLM) - a spread of nearly 58 percentage points across architectures with comparable clean accuracy (~92%). Decomposing this gap, once the poisoned document is retrieved, adversarial framing - not retrieval optimization - drives the majority of CorruptRAG-AK's advantage for three of four architectures, localizing the cross-architecture vulnerability at the content-reasoning stage. Our MADAM-RAG reimplementation shows the highest apparent contradiction detection rate, though our LLM judge over-identifies this behavior (~48.5% precision), so reported rates are upper bounds. Regardless of detection, MADAM-RAG cannot resolve contradictions reliably, producing a 41.4% non-answer rate even on clean inputs - though implementation divergences from the original may contribute. We introduce a seven-category behavioral taxonomy capturing contradiction detection, hedging, and failure modes beyond binary accuracy. Code, data, and analysis notebooks are publicly available.", "authors": [ "Samuel Korn" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.05632", "pdf_url": "https://arxiv.org/pdf/2605.05632", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "RAG", "Knowledge Graphs" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses adversarial robustness and related concepts.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 3.58, "content_potential_score": 0.0, "interestingness_score": 1.55, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Retrieval-Augmented Generation (RAG) systems are vulnerable to knowledge base poisoning, yet existing attacks have been evaluated almost exclusively against vanilla retrieve-then-generate pipelines. Architectures designed to handle conflicting retrieved information - multi-agent debate, agentic retrieval, recursive language models - remain untested against adversarially optimized contradictions.", "key_contribution": "We introduce a seven-category behavioral taxonomy capturing contradiction detection, hedging, and failure modes beyond binary accuracy.", "why_it_matters": "Architecture Matters: Comparing RAG Systems under Knowledge Base Poisoning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce a seven-category behavioral taxonomy capturing contradiction detection, hedging, and failure modes beyond…", "biggest_caveat": "cannot resolve contradictions reliably, producing a 41.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.05632", "difficulty": "frontier" }, { "id": "arxiv:2604.21093v1", "source": "arxiv", "source_type": "preprint", "title": "TRAVELFRAUDBENCH: A Configurable Evaluation Framework for GNN Fraud Ring Detection in Travel Networks", "abstract": "We introduce TravelFraudBench (TFG), a configurable benchmark for evaluating graph neural networks (GNNs) on fraud ring detection in travel platform graphs. Existing benchmarks--YelpChi, Amazon-Fraud, Elliptic, PaySim--cover single node types or domain-generic patterns with no mechanism to evaluate across structurally distinct fraud ring topologies. TFG simulates three travel-specific ring types--ticketing fraud (star topology with shared device/IP clusters), ghost hotel schemes (reviewer x hotel bipartite cliques), and account takeover rings (loyalty transfer chains)--in a heterogeneous graph with 9 node types and 12 edge types. Ring size, count, fraud rate, scale (500 to 200,000 nodes), and composition are fully configurable. We evaluate six methods--MLP, GraphSAGE, RGCN-proj, HAN, RGCN, and PC-GNN--under a ring-based split where each ring appears entirely in one partition, eliminating transductive label leakage. GraphSAGE achieves AUC=0.992 and RGCN-proj AUC=0.987, outperforming the MLP baseline (AUC=0.938) by 5.5 and 5.0 pp, confirming graph structure adds substantial discriminative power. HAN (AUC=0.935) is a negative result, matching the MLP baseline. On the ring recovery task (>=80% of ring members flagged simultaneously), GraphSAGE achieves 100% recovery across all ring types; MLP recovers only 17-88%. The edge-type ablation shows device and IP co-occurrence are the primary signals: removing uses_device drops AUC by 5.2 pp. TFG is released as an open-source Python package (MIT license) with PyG, DGL, and NetworkX exporters and pre-generated datasets at https://huggingface.co/datasets/bsajja7/travel-fraud-graphs, with Croissant metadata including Responsible AI fields.", "authors": [ "Bhavana Sajja" ], "year": 2026, "published_date": "2026-04-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.21093v1", "pdf_url": "https://arxiv.org/pdf/2604.21093v1", "citations": 0, "topics": [], "tags": [ "GNNs", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 4.05, "content_potential_score": 1.5, "interestingness_score": 2.3, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce TravelFraudBench (TFG), a configurable benchmark for evaluating graph neural networks (GNNs) on fraud ring detection in travel platform graphs. Existing benchmarks--YelpChi, Amazon-Fraud, Elliptic, PaySim--cover single node types or domain-generic patterns with no mechanism to evaluate across structurally distinct fraud ring topologies.", "key_contribution": "We introduce TravelFraudBench (TFG), a configurable benchmark for evaluating graph neural networks (GNNs) on fraud ring detection in travel platform graphs.", "why_it_matters": "TRAVELFRAUDBENCH: A Configurable Evaluation Framework for GNN Fraud Ring Detection in Travel Networks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about GNNs.", "one_line_takeaway": "We introduce TravelFraudBench (TFG), a configurable benchmark for evaluating graph neural networks (GNNs) on fraud ring…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in GNNs.", "url": "http://arxiv.org/abs/2604.21093v1", "difficulty": "frontier" }, { "id": "arxiv:2604.17622v1", "source": "arxiv", "source_type": "preprint", "title": "STRIKE: Additive Feature-Group-Aware Stacking Framework for Credit Default Prediction", "abstract": "Credit risk default prediction remains a cornerstone of risk management in the financial industry. The task involves estimating the likelihood that a borrower will fail to meet debt obligations, an objective critical for lending decisions, portfolio optimization, and regulatory compliance. Traditional machine learning models such as logistic regression and tree-based ensembles are widely adopted for their interpretability and strong empirical performance. However, modern credit datasets are high-dimensional, heterogeneous, and noisy, increasing overfitting risk in monolithic models and reducing robustness under distributional shift. We introduce STRIKE (Stacking via Targeted Representations of Isolated Knowledge Extractors), a feature-group-aware stacking framework for structured tabular credit risk data. Rather than training a single monolithic model on the complete dataset, STRIKE partitions the feature space into semantically coherent groups and trains independent learners within each group. This decomposition is motivated by an additive perspective on risk modeling, where distinct feature sources contribute complementary evidence that can be combined through a structured aggregation. The resulting group-specific predictions are integrated through a meta-learner that aggregates signals while maintaining robustness and modularity. We evaluate STRIKE on three real-world datasets spanning corporate bankruptcy and consumer lending scenarios. Across all settings, STRIKE consistently outperforms strong tree-based baselines and conventional stacking approaches in terms of AUC-ROC. Ablation studies confirm that performance gains stem from meaningful feature decomposition rather than increased model complexity. Our findings demonstrate that STRIKE is a stable, scalable, and interpretable framework for credit risk default prediction tasks.", "authors": [ "Swattik Maiti", "Ritik Pratap Singh", "Fardina Fathmiul Alam" ], "year": 2026, "published_date": "2026-04-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.17622v1", "pdf_url": "https://arxiv.org/pdf/2604.17622v1", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Structured Data", "Interpretability", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.1, "read_first_score": 5.71, "content_potential_score": 1.92, "interestingness_score": 2.51, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Credit risk default prediction remains a cornerstone of risk management in the financial industry. The task involves estimating the likelihood that a borrower will fail to meet debt obligations, an objective critical for lending decisions, portfolio optimization, and regulatory compliance.", "key_contribution": "We introduce STRIKE (Stacking via Targeted Representations of Isolated Knowledge Extractors), a feature-group-aware stacking framework for structured tabular credit risk data.", "why_it_matters": "STRIKE: Additive Feature-Group-Aware Stacking Framework for Credit Default Prediction represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "We introduce STRIKE (Stacking via Targeted Representations of Isolated Knowledge Extractors), a feature-group-aware…", "biggest_caveat": "butional shift.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "http://arxiv.org/abs/2604.17622v1", "difficulty": "intermediate" }, { "id": "arxiv:2609.11569", "source": "arxiv", "source_type": "preprint", "title": "Enabling Knowledge Graph Understanding at Scale with the EXplore Your Graphs ENgine (EXYGEN)", "abstract": "We present EXYGEN (EXplore Your Graphs ENgine), a framework for knowledge graph (KG) understanding that enables conversational access to KGs at scale. We address two questions in sequence. First, how effectively can LLMs perform text-to-SPARQL generation given only automatically derived structured metadata and small graph samples, rather than task-specific fine-tuning? We integrate VoID descriptions and ShEx schemas into a retrieval-augmented generation (RAG) pipeline and ablate KG-derived context on the SciQA benchmark. Our best configuration -- combining ShEx schemas, retrieved triples, and example question-query pairs -- reaches an exact match of 0.419 on execution results without any LLM fine-tuning. We further find that lexical metrics such as F1 poorly predict query correctness, and that larger general-purpose LLMs can outperform smaller code-specialized ones once given sufficient context. Second, we ask how to generate the structured metadata that this method relies on from very large KGs, where KG metadata generation becomes computationally intractable. We introduce a predicate-coverage-aware parallel graph sampling strategy that preserves structural diversity while remaining computationally tractable. On OpenCitations Meta and GESIS, it retains high predicate coverage with minimal triple loss and reduces runtime by over 80x; on ORKG, sampling is not just faster but the only tractable path to obtain complete metadata. Together, these results show that structured schema context and lightweight prompting can substantially reduce reliance on fine-tuning for scalable conversational access to KGs, though closing the remaining gap to fully fine-tuned approaches will likely require reducing dependence on curated question-query exemplars -- whether through synthetic generation or an execution-feedback-driven approach -- and validating these findings beyond a single benchmark.", "authors": [ "Harshdeep Singh", "Yurui Zhu", "Giovanni Colavizza", "Matteo Romanello" ], "year": 2026, "published_date": "2026-09-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.11569", "pdf_url": "https://arxiv.org/pdf/2609.11569", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "RAG", "Dialogue", "Knowledge Graphs" ], "paper_type": "benchmark", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 5.9, "content_potential_score": 2.05, "interestingness_score": 2.57, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present EXYGEN (EXplore Your Graphs ENgine), a framework for knowledge graph (KG) understanding that enables conversational access to KGs at scale. We address two questions in sequence.", "key_contribution": "We present EXYGEN (EXplore Your Graphs ENgine), a framework for knowledge graph (KG) understanding that enables conversational access to KGs at scale.", "why_it_matters": "Enabling Knowledge Graph Understanding at Scale with the EXplore Your Graphs ENgine (EXYGEN) represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present EXYGEN (EXplore Your Graphs ENgine), a framework for knowledge graph (KG) understanding that enables…", "biggest_caveat": "but the only tractable path to obtain complete metadata.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.11569", "difficulty": "intermediate" }, { "id": "arxiv:2608.22758", "source": "arxiv", "source_type": "preprint", "title": "XTC: Head-Aware Sampling by Excluding Top Choices", "abstract": "Standard decoding rules for autoregressive language models promote diversity by rescaling the full next-token distribution or truncating its low-probability tail. These strategies overlook a common regime of open-ended generation in which several continuations are plausible but too much probability mass remains concentrated on the most generic choice. We introduce XTC (Exclude Top Choices), a lightweight head-aware decoding operator that targets this regime directly. XTC identifies tokens whose probabilities exceed an absolute plausibility threshold $τ$: when at least two qualify, it removes the dominant eligible choices with probability $ρ$ and retains only the weakest plausible alternative before renormalization. Across 60 experiments on Gemma 3 27B Q4, Gemma 3 12B Q6, and DeepSeek R1 14B Q6, with scaling validation on Llama 3.3 70B Q4, XTC improves the diversity-repetition Pareto frontier. On creative generation, Distinct-2 increases by 11--15% and repeat trigrams decrease by 27--47% across the four models. Combined with temperature scaling, gains reach 38% in Distinct-2 and 71% in repeat-trigram reduction over baseline. A blinded Amazon Mechanical Turk study with 150 Master raters yields a 62.3% creativity preference for XTC ($p<10^{-4}$) without reduced fluency, while a GPT-4o control judge reproduces the Anthropic-judge direction on every measure. On IFEval with Llama 3.3 70B Q4, XTC preserves prompt-level strict accuracy within 1.7 percentage points of baseline while recovering most of the diversity gain; a temperature setting matched on Distinct-2 reduces IFEval by 8.8 points. The effect is additive with temperature and repetition penalties, robust across quantization levels and model families, and consistent across twelve prompt genres. XTC has been adopted by llama.cpp, ExLlamaV2, and text-generation-webui.", "authors": [ "Philipp Emanuel Weidmann", "Allen Roush", "Judah Goldfeder", "Sanjay Basu", "Ravid Shwartz-Ziv" ], "year": 2026, "published_date": "2026-08-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.22758", "pdf_url": "https://arxiv.org/pdf/2608.22758", "citations": 0, "topics": [], "tags": [ "LLMs", "Model Compression", "Artificial Intelligence", "NLP", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 5.23, "content_potential_score": 0.0, "interestingness_score": 1.54, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Standard decoding rules for autoregressive language models promote diversity by rescaling the full next-token distribution or truncating its low-probability tail. These strategies overlook a common regime of open-ended generation in which several continuations are plausible but too much probability mass remains concentrated on the most generic choice.", "key_contribution": "We introduce XTC (Exclude Top Choices), a lightweight head-aware decoding operator that targets this regime directly.", "why_it_matters": "XTC: Head-Aware Sampling by Excluding Top Choices represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce XTC (Exclude Top Choices), a lightweight head-aware decoding operator that targets this regime directly.", "biggest_caveat": "bution or truncating its low-probability tail.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.22758", "difficulty": "intermediate" }, { "id": "arxiv:2608.14613", "source": "arxiv", "source_type": "preprint", "title": "Do LLM Agents Negotiate Rationally? A Mechanism-Design Framework for Verifiable Multi-Agent Interaction over A2A/MCP", "abstract": "Modern LLM-agent frameworks increasingly interoperate through standards such as Anthropic's Model Context Protocol (MCP) for agent-to-tool access and Google's Agent2Agent (A2A) protocol for agent delegation and negotiation. However, these protocols specify transport and discovery rather than strategic correctness and do not guarantee efficient, individually rational, or strategy-proof outcomes. We introduce a framework that (i) encodes classical negotiation mechanisms, including alternating-offers bargaining and Vickrey-Clarke-Groves-style auctions, as constraints over A2A message schemas; (ii) provides a lightweight runtime verification and repair layer that checks messages against protocol invariants; and (iii) offers a benchmark of negotiation and allocation tasks with known optimal solutions for measuring deviations from game-theoretic predictions. We evaluate multiple LLM backbones using unstructured dialogue, structured protocols, and structured protocols with verification. Across negotiation trials (N=30 per condition), verification reduces outcome variance, while structured protocols achieve 100 percent success for both models. After correcting parser artifacts, audited unstructured baselines achieve approximately 97 percent and 93.3 percent success. In auction experiments (N=30 per model), both models achieve 100 percent efficient allocation but differ sharply in truthful bidding: one bids its exact valuation in every trial, whereas the other does so in only 3.3 percent of trials. Thus, mechanism-level incentive compatibility does not automatically transfer to LLM-agent behavior. A three-party fair-allocation task produced only 4.2 percent usable outcomes; we report this negative result with a diagnosis. This work bridges classical multi-agent systems theory and modern LLM-agent infrastructure and defines verifiable interaction at the A2A protocol layer.", "authors": [ "Wael Albayaydh", "Rui Zhao" ], "year": 2026, "published_date": "2026-07-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.14613", "pdf_url": "https://arxiv.org/pdf/2608.14613", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Dialogue", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 4.12, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Modern LLM-agent frameworks increasingly interoperate through standards such as Anthropic's Model Context Protocol (MCP) for agent-to-tool access and Google's Agent2Agent (A2A) protocol for agent delegation and negotiation. However, these protocols specify transport and discovery rather than strategic correctness and do not guarantee efficient, individually rational, or strategy-proof outcomes.", "key_contribution": "We introduce a framework that (i) encodes classical negotiation mechanisms, including alternating-offers bargaining and Vickrey-Clarke-Groves-style auctions, as constraints over A2A message schemas; (ii) provides a lightweight runtime verification and repair layer that checks messages against protocol invariants; and (iii) offers a benchmark of negotiation and allocation tasks with known optimal solutions for measuring deviations from game-theoretic predictions.", "why_it_matters": "Do LLM Agents Negotiate Rationally? A Mechanism-Design Framework for Verifiable Multi-Agent Interaction over A2A/MCP represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce a framework that (i) encodes classical negotiation mechanisms, including alternating-offers bargaining and…", "biggest_caveat": "but differ sharply in truthful bidding: one bids its exact valuation in every trial, whereas the other does so in only 3.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.14613", "difficulty": "frontier" }, { "id": "arxiv:2608.12500", "source": "arxiv", "source_type": "preprint", "title": "Lonic: Algorithm-Hardware Co-Design for Energy-Efficient Fully Local Online SNN Training with INT4 Precision", "abstract": "Spiking neural networks (SNNs) have recently attracted increasing attention as an energy-efficient learning paradigm. Existing works also propose temporally and fully local online SNN training algorithms to address memory and computation overhead. However, they do not consider whether the algorithmic advantages can be effectively translated into real-device efficiency. To address this challenge, we present Lonic, an algorithm-hardware co-design for energy-efficient and scalable fully local online supervised SNN learning. On the algorithm side, we implement an INT4 low-precision training algorithm for fully local online SNN learning while maintaining accuracy. On the hardware side, to leverage the benefits of the proposed algorithm, we introduce reconfigurable multiplier-free integer PE arrays, dual-optimization zero-gating strategy, temporal prefix-accelerated local learning dataflow, and low-precision weight movement to significantly improve training efficiency. Compared to Apple M4 and Nvidia V100 GPUs, Lonic achieves average energy efficiency improvements of 17.44x and 66.28x, respectively, along with speedups of 3.25x and 1.02x, respectively. Moreover, Lonic achieves 15.95x (14.64x) and 1.52x (7.28x) energy efficiency (area efficiency) over ASIC TPU-like and H2Learn accelerators, respectively. The code for Lonic is available at https://github.com/peilin-chen/Lonic.", "authors": [ "Peilin Chen", "Xiaoxuan Yang" ], "year": 2026, "published_date": "2026-08-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.12500", "pdf_url": "https://arxiv.org/pdf/2608.12500", "citations": 0, "topics": [], "tags": [], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 5.09, "content_potential_score": 1.0, "interestingness_score": 2.04, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Spiking neural networks (SNNs) have recently attracted increasing attention as an energy-efficient learning paradigm. Existing works also propose temporally and fully local online SNN training algorithms to address memory and computation overhead.", "key_contribution": "Existing works also propose temporally and fully local online SNN training algorithms to address memory and computation overhead.", "why_it_matters": "Lonic: Algorithm-Hardware Co-Design for Energy-Efficient Fully Local Online SNN Training with INT4 Precision represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "Existing works also propose temporally and fully local online SNN training algorithms to address memory and computation…", "biggest_caveat": "However, they do not consider whether the algorithmic advantages can be effectively translated into real-device efficiency.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2608.12500", "difficulty": "intermediate" }, { "id": "arxiv:2608.05655", "source": "arxiv", "source_type": "preprint", "title": "Is Personalized Modality Weighting Actually Personalized? A Controlled Audit of Per-User Weighting Claims in Multimodal Recommenders", "abstract": "Per-user modality weighting is deployed at billion-user scale in multimodal recommenders, through user modality-strength vectors, attention gates, meta-weight hypernetworks, and low-rank guided weights, each claiming a ranking gain from user-specific modality preference. Yet, to our knowledge, prior evaluations do not isolate a genuinely user-specific signal from a global modality weight plus model capacity. We audit this family with a two-contrast audit principle, reducing six implementations onto one shared collaborative backbone and measuring a utility gap (real-GM) against a single global modality weight and an identifiability gap (real-shuf) against an eval-time permutation of the user-weight binding. Across three independent short-video corpora, a single global weight already delivers nearly all of the content gain (+1.9/+3.6/+3.5pp over a no-modality baseline, p < .001). Making the weight per-user adds no consistent utility: no implementation wins on all corpora and metrics, and the few positive gaps are small (<=0.9pp) and flip. The shuffle control is necessary but not sufficient, since real-shuf reaches +128% of the content gain for heads that simultaneously lose to the global weight. We trace this dissociation to gates reading the shared collaborative embedding: decoupling the gate input collapses the inflated real-shuf to near zero while the utility conclusion stands. A monotone signal-implant dose-response (capture AUROC rising from 0.57 to 0.89 and from 0.64 to 1.00) verifies the harness would detect user-specific structure if present, and every finding replicates on a fourth, cross-domain e-commerce corpus. We propose reporting real-GM alongside real-shuf as a minimum evidentiary standard for personalization claims.", "authors": [ "Jingyuan Zheng", "Xin Zhang", "Yang Gu", "Dongjing Wang", "Yuxiang Wang", "Xudong Shen", "Haiping Zhang", "Youhuizi Li", "Dongjin Yu" ], "year": 2026, "published_date": "2026-08-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.05655", "pdf_url": "https://arxiv.org/pdf/2608.05655", "citations": 0, "topics": [], "tags": [ "Multimodal", "Information Retrieval" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 5.23, "content_potential_score": 2.34, "interestingness_score": 2.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Per-user modality weighting is deployed at billion-user scale in multimodal recommenders, through user modality-strength vectors, attention gates, meta-weight hypernetworks, and low-rank guided weights, each claiming a ranking gain from user-specific modality preference. Yet, to our knowledge, prior evaluations do not isolate a genuinely user-specific signal from a global modality weight plus model capacity.", "key_contribution": "A monotone signal-implant dose-response (capture AUROC rising from 0.57 to 0.89 and from 0.64 to 1.00) verifies the harness would detect user-specific structure if present, and every finding replicates on a fourth, cross-domain e-commerce corpus.", "why_it_matters": "Is Personalized Modality Weighting Actually Personalized? A Controlled Audit of Per-User Weighting Claims in Multimodal Recommenders improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "A monotone signal-implant dose-response (capture AUROC rising from 0.57 to 0.89 and from 0.64 to 1.00) verifies the…", "biggest_caveat": "but not sufficient, since real-shuf reaches +128% of the content gain for heads that simultaneously lose to the global weight.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2608.05655", "difficulty": "intermediate" }, { "id": "arxiv:2607.27893", "source": "arxiv", "source_type": "preprint", "title": "A comparative analysis of automated techniques for security bug report identification", "abstract": "Timely identification of security-related bug reports is essential to minimize the window of vulnerabilities in software systems. Manually screening incoming bug reports to identify security-related issues is time-consuming, error-prone, and non-scalable for large-scale software systems. Thus, a variety of automatic techniques, including traditional machine learning (ML) techniques and large language models, have been proposed to facilitate this task. However, the literature remains fragmented. Most studies introduce or optimize a particular technique and evaluate it against a limited set of baselines, often under different experimental setups. As a result, it is difficult to compare their results and draw reliable conclusions about the effectiveness of existing approaches, leaving researchers and practitioners without clear guidance on which techniques are most suitable for the task. To address this gap, we conducted a comparative analysis of several promising automated techniques to identify security-related bug reports using benchmark datasets. We evaluated Logistic Regression, Support Vector Machines, Random Forest, OpenAI's GPT-5.2, BERT-base, RoBERTa, and SetFit (a state-of-the-art few-shot learning framework). Our results indicate that SetFit achieves the best overall performance, achieving an F1-score of 0.80 and outperforming other techniques on three of the four datasets. RoBERTa performs competitively and approaches SetFit in some projects, while traditional ML techniques, particularly Logistic Regression, remain a strong baseline in certain contexts. In contrast, GPT-5.2 performs poorly in both zero-shot and few-shot settings. In addition, cross-project experiments demonstrate that transfer learning can improve performance for projects with limited data, but may degrade results for projects with strong project-specific characteristics.", "authors": [ "Muhammad Laiq" ], "year": 2026, "published_date": "2026-07-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.27893", "pdf_url": "https://arxiv.org/pdf/2607.27893", "citations": 0, "topics": [], "tags": [ "LLMs", "Prompting", "Evaluation", "Software Engineering" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 6.65, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Timely identification of security-related bug reports is essential to minimize the window of vulnerabilities in software systems. Manually screening incoming bug reports to identify security-related issues is time-consuming, error-prone, and non-scalable for large-scale software systems.", "key_contribution": "Most studies introduce or optimize a particular technique and evaluate it against a limited set of baselines, often under different experimental setups.", "why_it_matters": "A comparative analysis of automated techniques for security bug report identification represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Most studies introduce or optimize a particular technique and evaluate it against a limited set of baselines, often…", "biggest_caveat": "However, the literature remains fragmented.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.27893", "difficulty": "beginner" }, { "id": "arxiv:2607.22766", "source": "arxiv", "source_type": "preprint", "title": "Beyond Shapley: An Influence-Based Data Auditing Pipeline for LLM Alignment and Evaluation", "abstract": "The alignment of Large Language Models (LLMs) is increasingly bottlenecked by data quality. As datasets scale, massive preference and instruction-tuning corpora inevitably accumulate hidden structural contradictions, safety risks, and systemic human annotation errors. Standard dataset auditing methods, such as semantic deduplication or LLM-as-a-judge, struggle to capture the actual predictive impact of individual records and often miss deep functional rule clashes. To address this, we introduce a scalable, inference-only data valuation pipeline that approximates the Shapley value without iterative model retraining. By mapping semantic k-NN neighborhoods into a directed graph, our framework evaluates data utility directly through a reference LLM's probability distribution using zero-shot and one-shot conditional log-likelihood shifts. Our pipeline then translates these predictive influence scores into localized advantage metrics to isolate gradient-conflicting records. We demonstrate the pipeline's efficacy in sanitizing two heavily vetted alignment datasets. First, applying our pipeline to the HelpSteer2 dataset reduced the manual audit search space by 99.1%, successfully uncovering falsely-labeled records across diverse failure modes. Second, applying our automated audit strategy to Anthropic's HH-RLHF training and evaluation splits identified thousands of hidden safety and factual preference inversions. Crucially, by extending this audit to the evaluation split, we expose severe vulnerabilities in current benchmark integrity: highly capable models frequently predict the safer or more helpful response, only to be penalized by objectively flawed human ground-truth labels. Overall, our work provides a mathematically grounded, highly efficient diagnostic tool to uncover human label failures, sanitize evaluation benchmarks, and ensure the integrity of LLM alignment data.", "authors": [ "Yunting Song", "Matthew Watson", "Peter Grabowski", "Jun Qin" ], "year": 2026, "published_date": "2026-07-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.22766", "pdf_url": "https://arxiv.org/pdf/2607.22766", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "AI Safety", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 6.5, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The alignment of Large Language Models (LLMs) is increasingly bottlenecked by data quality. As datasets scale, massive preference and instruction-tuning corpora inevitably accumulate hidden structural contradictions, safety risks, and systemic human annotation errors.", "key_contribution": "To address this, we introduce a scalable, inference-only data valuation pipeline that approximates the Shapley value without iterative model retraining.", "why_it_matters": "Beyond Shapley: An Influence-Based Data Auditing Pipeline for LLM Alignment and Evaluation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this, we introduce a scalable, inference-only data valuation pipeline that approximates the Shapley value…", "biggest_caveat": "bution using zero-shot and one-shot conditional log-likelihood shifts.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.22766", "difficulty": "beginner" }, { "id": "arxiv:2605.25050", "source": "arxiv", "source_type": "preprint", "title": "Multimodality Stacking with Blockwise missing values and application to the PIONeeR biomarkers study for prediction of resistance to immunotherapy", "abstract": "Integrating multimodal datasets in clinical oncology is frequently hindered by high dimensionality and blockwise missingness, where entire data sources are unavailable for specific patient subsets. Standard survival models often struggle with these gaps, leading to biased results or patient exclusion. We introduce Multimodality Stacking with Blockwise missing values (MSB), a late-fusion framework for survival analysis that independently models modality-specific features before aggregating predictions via a cross-validated stacking meta-learner. MSB was validated on the PIONeeR study (n=443 patients, 378 biomarkers across eight heterogeneous sources) to predict progression-free survival in advanced non-small cell lung cancer patients receiving immunotherapy. MSB yielded higher predictive performance (C-index) than baseline algorithms. Improvements varied by baseline strength: linear models showed a 15.9% increase (p<0.001 for the Wilcoxon signed-rank test), random survival forests gained 5.4% (p=0.002), and gradient boosting methods improved by 2.1% (p=0.030). Beyond discrimination, MSB reduced the generalization gap (train-test difference in 5 folds cross-validation repeated 3 times: 0.055 vs 0.380 for linear models). Permutation importance analysis identified routine laboratory markers, clinical features, and PD-L1 expression as primary predictive drivers. Missing block indicators showed negligible importance, suggesting the model learned from biomarker values rather than data availability patterns. MSB provides a statistically validated framework for multimodal survival prediction with blockwise missingness. By enabling systematic biomarker evaluation without requiring complete data, MSB offers a practical tool for predictive modeling in biomedical research, pending external validation. Implementation is available at https://github.com/MohamedBoussena/MSB under Inria license.", "authors": [ "Mohamed Boussena", "Florence Monville", "Jacques Fieschi-Meric", "Frederic Vely", "Pierre Milpied", "Julien Mazieres", "Maurice Perol", "Eric Vivier", "Laurent Greillier", "Fabrice Barlesi", "Sebastien Benzekry" ], "year": 2026, "published_date": "2026-05-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.25050", "pdf_url": "https://arxiv.org/pdf/2605.25050", "citations": 0, "topics": [], "tags": [ "Multimodal", "Info Extraction", "Biomedical AI", "Fairness & Ethics", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 4.71, "content_potential_score": 0.0, "interestingness_score": 1.54, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Integrating multimodal datasets in clinical oncology is frequently hindered by high dimensionality and blockwise missingness, where entire data sources are unavailable for specific patient subsets. Standard survival models often struggle with these gaps, leading to biased results or patient exclusion.", "key_contribution": "We introduce Multimodality Stacking with Blockwise missing values (MSB), a late-fusion framework for survival analysis that independently models modality-specific features before aggregating predictions via a cross-validated stacking meta-learner.", "why_it_matters": "Multimodality Stacking with Blockwise missing values and application to the PIONeeR biomarkers study for prediction of resistance to immunotherapy represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We introduce Multimodality Stacking with Blockwise missing values (MSB), a late-fusion framework for survival analysis…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2605.25050", "difficulty": "intermediate" }, { "id": "arxiv:2607.18830", "source": "arxiv", "source_type": "preprint", "title": "From Trajectories to Instructions: Language-Conditioned Meta-Reinforcement Learning", "abstract": "Model-Agnostic Meta-Learning (MAML) is a widely used framework for reinforcement learning (RL) that enables efficient transfer by learning global policy parameters that can be rapidly adapted to new tasks. MAML training proceeds in two loops: an inner loop where the global parameters are adapted to task-specific parameters, and an outer loop where these task-specific parameters are evaluated and losses are back-propagated to improve the global parameters. Traditionally, the inner loop adaptation is performed by collecting trajectories from the task environment and applying gradient updates on the empirical expected return, which can be a costly operation. We note that it is the outer loop that drives the actual learning of global parameters, and therefore the inner loop adaptation mechanism need not be restricted to be gradient-based. This observation leads us to ask: Can we replace the inner loop trajectory collection and gradient update with a simpler, task-specific signal? In many practical settings, tasks are naturally accompanied by language instructions. Leveraging these instructions as a direct task-specific signal, we propose LA-MAML (Language Adapted MAML), which modifies the inner loop by adapting the global policy parameters in a single step through a learned embedding of the task instruction, replacing the inner loop trajectory collection and gradient-based updates. Experiments on the BabyAI benchmark demonstrate that LA-MAML achieves competitive or improved performance compared to baselines at a significantly lower per-iteration wall-clock training time. These results demonstrate that language instructions are an effective and efficient substitute for trajectory-based inner loop adaptation in meta RL.", "authors": [ "Garvit Singla", "Uma Maheswari Natarajan", "Raghuram Bharadwaj Diddigi" ], "year": 2026, "published_date": "2026-07-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.18830", "pdf_url": "https://arxiv.org/pdf/2607.18830", "citations": 0, "topics": [], "tags": [ "Info Extraction", "RL", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 6.33, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Model-Agnostic Meta-Learning (MAML) is a widely used framework for reinforcement learning (RL) that enables efficient transfer by learning global policy parameters that can be rapidly adapted to new tasks. MAML training proceeds in two loops: an inner loop where the global parameters are adapted to task-specific parameters, and an outer loop where these task-specific parameters are evaluated and losses are back-propagated to improve the global parameters.", "key_contribution": "Leveraging these instructions as a direct task-specific signal, we propose LA-MAML (Language Adapted MAML), which modifies the inner loop by adapting the global policy parameters in a single step through a learned embedding of the task instruction, replacing the inner loop trajectory collection and gradient-based updates.", "why_it_matters": "From Trajectories to Instructions: Language-Conditioned Meta-Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "Leveraging these instructions as a direct task-specific signal, we propose LA-MAML (Language Adapted MAML), which…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2607.18830", "difficulty": "beginner" }, { "id": "arxiv:2607.16300", "source": "arxiv", "source_type": "preprint", "title": "FedDP-PALD: A Privacy-Preserving Federated Latent Diffusion Framework with Prototype Aggregation for Medical Data Synthesis", "abstract": "Medical images and physiological signals provide valuable information for accurate diagnosis. Developing diagnostic models often requires patient data from multiple institutions, although strict privacy regulations limit the sharing of sensitive clinical records. Federated learning enables multiple hospitals to train a shared model without exchanging raw data. However, existing methods face two problems: the information exchanged during training can reveal whether a patient's data were used, and synthetic data meant to replace real records often fail to preserve their predictive structure, which limits clinical use. To address this issue, we propose FedDP-PALD, a privacy-preserving federated latent diffusion framework for multimodal medical data synthesis under formal privacy guarantees. It jointly processes chest X-ray images and electrocardiogram (ECG) signals through gated multi-head attention with modality-availability masks, remaining effective even when a modality is missing. We also introduce Differentially Private Prototype Mixture Aggregation (DP-PMA), which clips class-level latent prototypes and adds calibrated Gaussian noise before combining them on the server to maintain $(ε, δ)$ differential privacy. We evaluate FedDP-PALD on PneumoniaMNIST, ChestMNIST, and MIT-BIH datasets, where differential privacy reduced summary-level attack AUROC from 0.6229 $\\pm$ 0.0026 to between 0.5016 and 0.5093 for privacy budgets from $ε= 1$ to $ε= 8$. On the test data, synthetic-latent training achieved an F1 score of 0.8993 $\\pm$ 0.0006 and an AUROC of 0.9057 $\\pm$ 0.0503, close to the 0.9747 $\\pm$ 0.0132 real-latent training. These results show that FedDP-PALD generates private synthetic representations that preserve useful decision performance while strongly resisting membership inference.", "authors": [ "Md. Sajeebul Islam Sk.", "Khan Enaet Hossain", "Md. Mehedi Hasan Shawon" ], "year": 2026, "published_date": "2026-07-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.16300", "pdf_url": "https://arxiv.org/pdf/2607.16300", "citations": 0, "topics": [], "tags": [ "Multimodal", "Diffusion", "Transformers", "Federated Learning", "Biomedical AI" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Diffusion, Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 4.12, "content_potential_score": 0.0, "interestingness_score": 1.54, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Medical images and physiological signals provide valuable information for accurate diagnosis. Developing diagnostic models often requires patient data from multiple institutions, although strict privacy regulations limit the sharing of sensitive clinical records.", "key_contribution": "To address this issue, we propose FedDP-PALD, a privacy-preserving federated latent diffusion framework for multimodal medical data synthesis under formal privacy guarantees.", "why_it_matters": "FedDP-PALD: A Privacy-Preserving Federated Latent Diffusion Framework with Prototype Aggregation for Medical Data Synthesis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "To address this issue, we propose FedDP-PALD, a privacy-preserving federated latent diffusion framework for multimodal…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2607.16300", "difficulty": "advanced" }, { "id": "arxiv:2607.12686", "source": "arxiv", "source_type": "preprint", "title": "Segregate, Refine, Integrate: Decomposing Multimodal Fusion for Sentiment Analysis", "abstract": "Multimodal fusion must simultaneously refine modality-specific signals and model cross-modal interactions; two competing objectives typically entangled within the same operation. We propose \\textbf{SeRIn} (\\textbf{Se}gregate, \\textbf{R}efine, \\textbf{In}tegrate), a multimodal LM fusion scheme that enforces this separation as an architectural prior. Modality-specific representations evolve along isolated pathways, each refined against its respective encoder context, while a dedicated cross-modal pathway accumulates their joint evolution without contaminating unimodal streams. Full cross-modal interaction is deferred to a final prediction step - ablations confirm that structured interactions, not added capacity, drive the gains; gate analysis under visual corruption reveals emergent modality reweighting without explicit supervision. SeRIn achieves state-of-the-art results on CH-SIMS and CMU-MOSEI, improving all metrics on both benchmarks.", "authors": [ "Alexios Filippakopoulos", "Elias Kallioras", "Nikolaos Xiros", "Efthymios Georgiou", "Alexandros Potamianos" ], "year": 2026, "published_date": "2026-07-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.12686", "pdf_url": "https://arxiv.org/pdf/2607.12686", "citations": 0, "topics": [], "tags": [ "Multimodal", "Sentiment Analysis", "Evaluation", "NLP" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, Sentiment Analysis) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 4.38, "content_potential_score": 0.0, "interestingness_score": 1.54, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multimodal fusion must simultaneously refine modality-specific signals and model cross-modal interactions; two competing objectives typically entangled within the same operation. We propose \\textbf{SeRIn} (\\textbf{Se}gregate, \\textbf{R}efine, \\textbf{In}tegrate), a multimodal LM fusion scheme that enforces this separation as an architectural prior.", "key_contribution": "We propose \\textbf{SeRIn} (\\textbf{Se}gregate, \\textbf{R}efine, \\textbf{In}tegrate), a multimodal LM fusion scheme that enforces this separation as an architectural prior.", "why_it_matters": "Segregate, Refine, Integrate: Decomposing Multimodal Fusion for Sentiment Analysis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We propose \\textbf{SeRIn} (\\textbf{Se}gregate, \\textbf{R}efine, \\textbf{In}tegrate), a multimodal LM fusion scheme that…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2607.12686", "difficulty": "beginner" }, { "id": "arxiv:2607.01297", "source": "arxiv", "source_type": "preprint", "title": "Few-Shot Open-Set Audio Classification Using Attention Information-Fused Prototypes", "abstract": "Most existing audio classification methods suppose that each query (testing) sample belongs to a class of support (training) samples, and misrecognize samples of unseen classes as seen classes (cannot reject samples of unseen classes). In this study, we propose a method for Few-shot Open-set Audio Classification (FOAC), which can recognize query samples of seen classes after updating the model using a few support samples, and meanwhile reject query samples from unseen classes. We design a model consisting of an encoder and a classifier. The encoder is the backbone of a ResNet used for extracting embeddings. The classifier consists of prototype generators of few-shot classes and open-set classes. Prototypes of few-shot classes are obtained by fusing the class-discriminative information of support and query embeddings and by assigning larger weighting coefficient to representative part of the support embeddings. One prototype is generated for open-set classes using the proposed prototype generator. The encoder is trained with abundant samples of base classes in supervised manner, and then the prototypes of base classes are generated under the supervision of a joint loss. The classifier is trained using a few samples of few-shot classes in a meta-training way. Three public datasets (LS-100, NSynth-100, and FSC-89) are used to assess the performance of our method. Experiments show that our method has advantage over prior methods in AUROC and accuracy. This advantage has statistical significance for most prior methods. Our method has lower computational complexity than most prior methods. The code is at https://github.com/Jessytan/FOAC-AIFP.", "authors": [ "Yanxiong Li", "Jiaxin Tan", "Qianqian Li", "Guoqing Chen", "Sen Huang", "Tuomas Virtanen" ], "year": 2026, "published_date": "2026-07-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.01297", "pdf_url": "https://arxiv.org/pdf/2607.01297", "citations": 0, "topics": [], "tags": [ "Prompting", "Info Extraction", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 7.0, "content_potential_score": 0.0, "interestingness_score": 1.54, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Most existing audio classification methods suppose that each query (testing) sample belongs to a class of support (training) samples, and misrecognize samples of unseen classes as seen classes (cannot reject samples of unseen classes). In this study, we propose a method for Few-shot Open-set Audio Classification (FOAC), which can recognize query samples of seen classes after updating the model using a few support samples, and meanwhile reject query samples from unseen classes.", "key_contribution": "In this study, we propose a method for Few-shot Open-set Audio Classification (FOAC), which can recognize query samples of seen classes after updating the model using a few support samples, and meanwhile reject query samples from unseen classes.", "why_it_matters": "Few-Shot Open-Set Audio Classification Using Attention Information-Fused Prototypes represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "In this study, we propose a method for Few-shot Open-set Audio Classification (FOAC), which can recognize query samples…", "biggest_caveat": "cannot reject samples of unseen classes).", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2607.01297", "difficulty": "beginner" }, { "id": "arxiv:2606.27180", "source": "arxiv", "source_type": "preprint", "title": "Automating Potential-based Reward Shaping with Vision Language Model Guidance", "abstract": "Sparse rewards are inherently challenging for reinforcement learning agents as they lack intermediate feedback to guide exploration and to correctly attribute the sparse success rewards to relevant parts of the trajectory. Naive reward shaping can induce reward hacking, yielding policies that exploit auxiliary signals instead of solving the intended task. Potential-based reward shaping (PBRS) guarantees preservation of the optimal policy set, but requires the definition of a heuristic potential function over the state space. In this work, we introduce the VLM-guided PBRS framework VLM-PBRS that learns the potential function directly from vision language model (VLM) feedback. We query a lightweight VLM to obtain preferences over image pairs and train a model of the potential function using these preferences. As this approach is based on potential-based reward shaping, it preserves the original optimal policies, and removes the need for expert-designed reward shaping terms. Because large VLMs are prohibitively expensive to invoke repeatedly during policy learning, we employ smaller, more computationally efficient VLMs. Although the resulting preference labels are less accurate, empirical evidence shows that the preference labels can still be used to accelerate learning. We validate our method empirically in the Meta-World and Franka Kitchen environments and highlight the connection between VLM preference label accuracy and sample efficiency improvements. Our contributions are threefold: (1) the first application of VLM preference-based learning to synthesize a potential function for PBRS, (2) a principled, low-cost solution that leverages small VLMs, and (3) extensive empirical demonstration of improved sample efficiency and robustness to reward hacking.", "authors": [ "Henrik Müller", "Daniel Kudenko" ], "year": 2026, "published_date": "2026-06-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.27180", "pdf_url": "https://arxiv.org/pdf/2606.27180", "citations": 0, "topics": [], "tags": [ "VLMs", "RL", "Robotics", "Adversarial", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 5.17, "content_potential_score": 0.0, "interestingness_score": 1.54, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Sparse rewards are inherently challenging for reinforcement learning agents as they lack intermediate feedback to guide exploration and to correctly attribute the sparse success rewards to relevant parts of the trajectory. Naive reward shaping can induce reward hacking, yielding policies that exploit auxiliary signals instead of solving the intended task.", "key_contribution": "In this work, we introduce the VLM-guided PBRS framework VLM-PBRS that learns the potential function directly from vision language model (VLM) feedback.", "why_it_matters": "Automating Potential-based Reward Shaping with Vision Language Model Guidance represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about VLMs.", "one_line_takeaway": "In this work, we introduce the VLM-guided PBRS framework VLM-PBRS that learns the potential function directly from…", "biggest_caveat": "bute the sparse success rewards to relevant parts of the trajectory.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in VLMs.", "url": "https://arxiv.org/abs/2606.27180", "difficulty": "advanced" }, { "id": "arxiv:2606.22177", "source": "arxiv", "source_type": "preprint", "title": "How Well Do Self-Supervised Speech Models Encode Age and Gender in Children's Speech? A Layer-Wise Analysis Across Multiple Architectures", "abstract": "Self-supervised learning (SSL) models have become a central component of modern speech processing systems, as they enable the learning of rich acoustic representations without reliance on labeled data. Despite their success on adult speech, it remains unclear how effectively these models capture speaker-related attributes such as age and gender in children's speech, which differs substantially from adult speech due to ongoing physiological and cognitive development. Higher pitch, increased articulatory variability, and age-dependent acoustic changes make children's speech a particularly challenging domain. In this work, we present a comprehensive analysis of how age and gender information is encoded across layers of four widely used SSL models: Wav2Vec2, HuBERT, Data2Vec, and WavLM. Layer-wise features are extracted and evaluated using a lightweight CNN on two benchmark children's speech corpora, PFSTAR and CMU Kids. To analyze feature compactness and redundancy, PCA is applied to identify redundancy and highlight the dimensions that contribute most to classification performance. Experimental results show that age- and gender-related information is unevenly distributed across SSL layers, with early to mid-level layers encoding the strongest paralinguistic cues. HuBERT achieves the best overall performance for age classification, while Wav2Vec2 and HuBERT lead gender classification on PFSTAR and CMU Kids, respectively. Beyond single-split evaluation, we further demonstrate that these findings remain stable under speaker-wise cross-validation, layer aggregation, and cross-database evaluation, indicating robustness to data imbalance and domain mismatch. Finally, we show that reliable age and gender classification is achievable even from short speech segments of 1--3 seconds.", "authors": [ "Abhijit Sinha", "Hemant Kumar Kathania", "Mohit Joshi", "Harishankar Kumar", "Shrikanth Narayanan", "Sudarsana Reddy Kadiri" ], "year": 2026, "published_date": "2026-06-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.22177", "pdf_url": "https://arxiv.org/pdf/2606.22177", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "Adversarial", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Uses self-supervised — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 6.17, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Self-supervised learning (SSL) models have become a central component of modern speech processing systems, as they enable the learning of rich acoustic representations without reliance on labeled data. Despite their success on adult speech, it remains unclear how effectively these models capture speaker-related attributes such as age and gender in children's speech, which differs substantially from adult speech due to ongoing physiological and cognitive development.", "key_contribution": "In this work, we present a comprehensive analysis of how age and gender information is encoded across layers of four widely used SSL models: Wav2Vec2, HuBERT, Data2Vec, and WavLM.", "why_it_matters": "How Well Do Self-Supervised Speech Models Encode Age and Gender in Children's Speech? A Layer-Wise Analysis Across Multiple Architectures represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "In this work, we present a comprehensive analysis of how age and gender information is encoded across layers of four…", "biggest_caveat": "butes such as age and gender in children's speech, which differs substantially from adult speech due to ongoing physiological and cognitive development.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Self-Supervised.", "url": "https://arxiv.org/abs/2606.22177", "difficulty": "advanced" }, { "id": "arxiv:2606.23057", "source": "arxiv", "source_type": "preprint", "title": "Who Owns the AI Recommendation? A Multi-Industry Empirical Map of Brand Category Ownership Across Large Language Models", "abstract": "Large language models now mediate how buyers discover products and services, making the competitive structure of AI-generated recommendations a strategic concern for brands. A basic question has lacked large-scale empirical answers: in a given category, which brand does a model recommend, and how concentrated is that ownership? Across 3,750 responses spanning 50 brands, five industries, and 250 brand-free category queries on three models (GPT-5.2, Google Gemini 3 Flash, and Perplexity sonar-pro), each query repeated five times under a dice-roll stability protocol, we propose three exploratory metrics: the Category Ownership Index (COI), a brand's share of mentions within a category; the Competitive Vacuum Index (CVI), flagging categories with no single leader; and the Displacement Score (DS), quantifying asymmetric substitution between brand pairs. In this sample, recommendation concentration was moderate: the mean Gini coefficient was 0.28 (95% CI [0.16, 0.41]), below the 0.60 power-law threshold we set. Competitive vacuums were rare, appearing in 8.0% of queries, so the models named at least one sampled brand in most cases. Cross-model agreement on the top-recommended brand was 41.6%: a top position on one model did not reliably hold on another. Displacement was industry-dependent, from co-recommendation in consulting (0.4:1) to one-directional substitution up to 4.3:1, with an unweighted mean of 2.4:1 across the five industries. A BERTopic check placed only 4.2% of discovered topic clusters outside the original categories. Within the scope studied, these results sit in tension with a strong winner-takes-all narrative around AI recommendation, and the three metrics offer a candidate, reproducible procedure for competitive-intelligence analysis that future work can validate.", "authors": [ "Dmitrij Żatuchin" ], "year": 2026, "published_date": "2026-06-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.23057", "pdf_url": "https://arxiv.org/pdf/2606.23057", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "NLP", "Information Retrieval", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 5.23, "content_potential_score": 0.0, "interestingness_score": 1.54, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models now mediate how buyers discover products and services, making the competitive structure of AI-generated recommendations a strategic concern for brands. A basic question has lacked large-scale empirical answers: in a given category, which brand does a model recommend, and how concentrated is that ownership?", "key_contribution": "Across 3,750 responses spanning 50 brands, five industries, and 250 brand-free category queries on three models (GPT-5.2, Google Gemini 3 Flash, and Perplexity sonar-pro), each query repeated five times under a dice-roll stability protocol, we propose three exploratory metrics: the Category Ownership Index (COI), a brand's share of mentions within a category; the Competitive Vacuum Index (CVI), flagging categories with no single leader; and the Displacement Score (DS), quantifying asymmetric substitution between brand pairs.", "why_it_matters": "Who Owns the AI Recommendation? A Multi-Industry Empirical Map of Brand Category Ownership Across Large Language Models improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Across 3,750 responses spanning 50 brands, five industries, and 250 brand-free category queries on three models…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.23057", "difficulty": "intermediate" }, { "id": "arxiv:2606.18557", "source": "arxiv", "source_type": "preprint", "title": "DeFAb: A Verifiable Benchmark for Defeasible Abduction in Foundation Models", "abstract": "A rule-based logic solver resolves every instance in our benchmark in under 50 microseconds with 100% accuracy; the best frontier language model reaches 65% at best and drops to 23.5% under rendering-robust evaluation (worst case over four surface renderings). We introduce DeFAb (Defeasible Abduction Benchmark), a dataset and generation pipeline that converts four decades of publicly funded knowledge bases into formally grounded instances for defeasible abduction: constructing hypotheses that explain anomalies by overriding defaults while preserving unrelated expectations. Because every hypothesis must pass polynomial-time checks for valid derivation, conservativity, and minimality, DeFAb makes logical rigor the instrument for measuring creativity and theoretical reasoning, scoring the disciplined construction of theory revisions rather than fluent but theory-destroying prose. The pipeline pairs taxonomic hierarchies (OpenCyc, YAGO, Wikidata) with behavioral property graphs (ConceptNet, UMLS) to produce 372,648+ instances across 33.75M materialized rules from 18 sources, in three levels with polynomial-time verifiable gold standards. Four frontier models do not reliably internalize defeasible reasoning: rendering-robust Level 2 accuracy is 7.8-23.5%; chain-of-thought variance (~36 pp) exceeds any inter-model gap; and a matched contamination control isolates a +19.4 pp Level 3 gap. We further release DeFAb-Hard (a 235-instance Level 3 difficulty variant; best model 53.3% vs 100% symbolic) and CONJURE (a kernel-verified transformative-creativity variant of 560 Lean 4/Mathlib instances whose gold answers are definitions the proof kernel did not previously contain, judge-free verifier; a pilot finds zero novel concepts). The same verifier doubles as an exact reward for preference optimization (DPO, RLVR/GRPO). Released under MIT at https://huggingface.co/datasets/PatrickAllenCooper/DeFAb.", "authors": [ "Patrick Cooper", "Alvaro Velasquez" ], "year": 2026, "published_date": "2026-06-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.18557", "pdf_url": "https://arxiv.org/pdf/2606.18557", "citations": 0, "topics": [], "tags": [ "Reasoning", "RLHF", "Knowledge Graphs", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 4.12, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "A rule-based logic solver resolves every instance in our benchmark in under 50 microseconds with 100% accuracy; the best frontier language model reaches 65% at best and drops to 23.5% under rendering-robust evaluation (worst case over four surface renderings). We introduce DeFAb (Defeasible Abduction Benchmark), a dataset and generation pipeline that converts four decades of publicly funded knowledge bases into formally grounded instances for defeasible abduction: constructing hypotheses that explain anomalies by overriding defaults while preserving unrelated expectations.", "key_contribution": "We introduce DeFAb (Defeasible Abduction Benchmark), a dataset and generation pipeline that converts four decades of publicly funded knowledge bases into formally grounded instances for defeasible abduction: constructing hypotheses that explain anomalies by overriding defaults while preserving unrelated expectations.", "why_it_matters": "DeFAb: A Verifiable Benchmark for Defeasible Abduction in Foundation Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We introduce DeFAb (Defeasible Abduction Benchmark), a dataset and generation pipeline that converts four decades of…", "biggest_caveat": "but theory-destroying prose.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2606.18557", "difficulty": "frontier" }, { "id": "arxiv:2605.10574", "source": "arxiv", "source_type": "preprint", "title": "LLM Jaggedness Unlocks Scientific Creativity", "abstract": "As artificial intelligence advances, models are not improving uniformly. Instead, progress unfolds in a jagged fashion, with capabilities growing unevenly across tasks, domains, and model scales. In this work, we examine this dynamic jaggedness through the lens of scientific idea generation. We introduce SciAidanBench, a benchmark of open-ended scientific questions designed to measure the scientific creativity of large language models (LLMs). Given a scientific question, models are asked to generate as many unique and coherent ideas as possible, with the total number of valid responses serving as a proxy for creative potential. Evaluating 19 base models across 8 providers (30 total variants including reasoning versions), we find that jaggedness manifests both across models and within models. First, in a cross-task comparison between general and scientific creativity, improvements in general creativity do not translate uniformly to scientific creativity, revealing divergent capability profiles across models. Second, at the prompt level, stronger models do not improve uniformly; instead, they exhibit high variability, with bursts of creativity on some questions and limited performance on others. Third, at the domain level, individual models display uneven strengths across scientific subfields, reflecting fragmented internal capability profiles. Finally, we show that this jaggedness can be harnessed. We explore mechanisms of inference-time compute, knowledge pooling, and brainstorming to combine models effectively and construct meta-model ensembles that outperform any single model. Our results position jaggedness not as a limitation, but as a resource, a structural feature of AI progress that, when understood and leveraged, can amplify LLM-driven scientific creativity.", "authors": [ "Shray Mathur", "J. Anibal Boscoboinik", "Esther H. R. Tsai", "Kevin G. Yager" ], "year": 2026, "published_date": "2026-05-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.10574", "pdf_url": "https://arxiv.org/pdf/2605.10574", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 6.88, "content_potential_score": 2.05, "interestingness_score": 2.57, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "As artificial intelligence advances, models are not improving uniformly. Instead, progress unfolds in a jagged fashion, with capabilities growing unevenly across tasks, domains, and model scales.", "key_contribution": "We introduce SciAidanBench, a benchmark of open-ended scientific questions designed to measure the scientific creativity of large language models (LLMs).", "why_it_matters": "LLM Jaggedness Unlocks Scientific Creativity represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce SciAidanBench, a benchmark of open-ended scientific questions designed to measure the scientific…", "biggest_caveat": "limitation, but as a resource, a structural feature of AI progress that, when understood and leveraged, can amplify LLM-driven scientific creativity.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.10574", "difficulty": "beginner" }, { "id": "arxiv:2606.16173", "source": "arxiv", "source_type": "preprint", "title": "TimeVista: Exploring and Exploiting Vision-Language Models as Judges for Time Series Forecasting", "abstract": "High-quality time series forecasting is pivotal for real-world decision-making. However, traditional point-wise metrics often fail to reveal complex temporal patterns and align poorly with human intuitive preferences. While the ''LLM-as-a-Judge'' paradigm has revolutionized text evaluation by providing flexible, human-aligned judgment, its application to time series remains largely unexplored. In this paper, we leverage Vision-Language Models (VLMs) as judges for time series forecasting, harnessing their ability to comprehend time series plots grounded in textual information. Specifically, we propose a novel framework integrating micro- and macro-level judgments informed by contextual information to evaluate time series forecasting. To this end, we introduce TimeVista, a comprehensive VLM-as-a-Judge benchmark comprising 5563 time series samples paired with detailed evaluation rubrics. Extensive meta-evaluations demonstrate that VLMs are highly reliable judges, achieving significantly higher consistency with human preferences than conventional metrics. Building upon our benchmark, we comprehensively assess recent Time Series Foundation Models (TSFMs) under the VLM-as-a-Judge paradigm. Our results demonstrate that VLMs serve as robust and interpretable judges, providing a comprehensive, human-aligned standard for evaluating time series models.", "authors": [ "Zhi Chen", "Yuxuan Wang", "Jialong Wu", "Yong Liu", "Haoran Zhang", "Xingjian Su", "Jianmin Wang", "Mingsheng Long" ], "year": 2026, "published_date": "2026-06-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.16173", "pdf_url": "https://arxiv.org/pdf/2606.16173", "citations": 0, "topics": [], "tags": [ "LLMs", "VLMs", "Interpretability", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 6.53, "content_potential_score": 2.34, "interestingness_score": 2.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "High-quality time series forecasting is pivotal for real-world decision-making. However, traditional point-wise metrics often fail to reveal complex temporal patterns and align poorly with human intuitive preferences.", "key_contribution": "Specifically, we propose a novel framework integrating micro- and macro-level judgments informed by contextual information to evaluate time series forecasting.", "why_it_matters": "TimeVista: Exploring and Exploiting Vision-Language Models as Judges for Time Series Forecasting represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Specifically, we propose a novel framework integrating micro- and macro-level judgments informed by contextual…", "biggest_caveat": "However, traditional point-wise metrics often fail to reveal complex temporal patterns and align poorly with human intuitive preferences.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.16173", "difficulty": "beginner" }, { "id": "arxiv:2605.30290", "source": "arxiv", "source_type": "preprint", "title": "Self-Trained Verification for Training- and Test-Time Self-Improvement", "abstract": "Self-improvement at scale has been a longstanding goal for reasoning models, and there are two natural places to do it: at test time, through verification-refinement (V-R) loops; and at training time, through self-training methods. Both are gated by the same bottleneck: the verifier. V-R loops stall when verifier scores inflate while accuracy stagnates, and when feedback is too generic to act on; self-training fails similarly when bad self-generated data are added to training. Better verification would unlock both, but the capability we want to train, i.e., catching self-generated errors, lacks training signal. To address this challenge, we propose self-trained verification (STV). Our key observation is that, while a model cannot catch these errors alone, it can when shown the reference solution. We turn this asymmetry into a supervision target and train the verifier to imitate a more informed version of itself. At test time, STV substantially improves V-R loops on hard problems, while alternatives (e.g., SFT, RL on verifier scores, and even meta-verifiers) do not. STV roughly doubles accuracy on hard math and lifts it 14x on scientific reasoning tasks (1.5% to 21%). At training time, we additionally train the generator using RL with STV verifier's feedback inside the V-R loop - a procedure we call verifier-in-the-loop training (ViL). Starting from an RL-converged generator, ViL yields a further 33% gain in pass@1. More notably, the generator's standalone pass@1, with no verifier at test time, climbs 30% relative past where standard RL had converged. Hence, the next frontier in reasoning on hard problems may lie in how we train for and with verification.", "authors": [ "Chen Henry Wu", "Aditi Raghunathan" ], "year": 2026, "published_date": "2026-05-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.30290", "pdf_url": "https://arxiv.org/pdf/2605.30290", "citations": 0, "topics": [], "tags": [ "Reasoning", "Machine Learning", "Artificial Intelligence", "NLP" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 4.73, "content_potential_score": 0.0, "interestingness_score": 1.54, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Self-improvement at scale has been a longstanding goal for reasoning models, and there are two natural places to do it: at test time, through verification-refinement (V-R) loops; and at training time, through self-training methods. Both are gated by the same bottleneck: the verifier.", "key_contribution": "To address this challenge, we propose self-trained verification (STV).", "why_it_matters": "Self-Trained Verification for Training- and Test-Time Self-Improvement represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "To address this challenge, we propose self-trained verification (STV).", "biggest_caveat": "but the capability we want to train, i.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.30290", "difficulty": "intermediate" }, { "id": "arxiv:2605.09027", "source": "arxiv", "source_type": "preprint", "title": "GAMBIT: A Three-Mode Benchmark for Adversarial Robustness in Multi-Agent LLM Collectives", "abstract": "In multi-agent systems (MAS), a single deceptive agent can nullify all gains of an agentic AI collective and evade deployed defenses. However, existing adversarial studies on MAS target only shallow tasks and do not consider adaptive adversaries, which evolve their strategies to evade the very detectors trained to catch them. To address that gap, we introduce GAMBIT, a benchmark with three evaluation modes and two independent scores for evaluating imposter detectors: the first two modes measure zero-shot detection under increasing distribution shift, and a third recalibration mode measures how quickly a detector adapts to novel attacks from just 20 labeled examples. The benchmark comes with a dataset of 27,804 labeled instances spanning 240 co-evolved imposter strategies. Our contributions are threefold: (1) Using chess as a substrate deep reasoning problem and Gemini 3.1 Pro for agents, we release GAMBIT and its dataset to evaluate imposter detectors under realistic constraints against a stealthy adaptive imposter; (2) We introduce an adaptive imposter agent based on an efficient evolutionary framework, generalizable beyond chess, that collapses collective task performance while remaining essentially undetectable (50.5% F1-score with a Gemini-based detector); (3) We show that zero-shot evaluation can be highly misleading for adaptive adversaries: two detectors with near-identical zero-shot scores differ by 8x on few-shot adaptation, while the meta-learned variant converges 20x faster, a gap only visible in the recalibration mode. Altogether, GAMBIT provides the first multi-agent benchmark where adversarial attacks and defenses co-evolve, with an imposter framework generalizable beyond our use case, and promising techniques for fast recalibration in a rapidly evolving adversarial system. Code and data: https://anonymous.4open.science/r/gambit.", "authors": [ "Alexandre Le Mercier", "Chris Develder", "Thomas Demeester" ], "year": 2026, "published_date": "2026-05-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.09027", "pdf_url": "https://arxiv.org/pdf/2605.09027", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Prompting", "AI Agents", "Adversarial" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses adversarial robustness and related concepts.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 5.17, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In multi-agent systems (MAS), a single deceptive agent can nullify all gains of an agentic AI collective and evade deployed defenses. However, existing adversarial studies on MAS target only shallow tasks and do not consider adaptive adversaries, which evolve their strategies to evade the very detectors trained to catch them.", "key_contribution": "To address that gap, we introduce GAMBIT, a benchmark with three evaluation modes and two independent scores for evaluating imposter detectors: the first two modes measure zero-shot detection under increasing distribution shift, and a third recalibration mode measures how quickly a detector adapts to novel attacks from just 20 labeled examples.", "why_it_matters": "GAMBIT: A Three-Mode Benchmark for Adversarial Robustness in Multi-Agent LLM Collectives represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address that gap, we introduce GAMBIT, a benchmark with three evaluation modes and two independent scores for…", "biggest_caveat": "bution shift, and a third recalibration mode measures how quickly a detector adapts to novel attacks from just 20 labeled examples.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.09027", "difficulty": "frontier" }, { "id": "arxiv:2412.14461", "source": "arxiv", "source_type": "preprint", "title": "To Err Is Human; To Annotate, SILICON? Toward Robust Reproducibility in LLM Annotation", "abstract": "Unstructured text data annotation is foundational to management research. LLMs offer a cost-effective and scalable alternative to human annotation, but they introduce a novel challenge: the annotator itself can be retired. Proprietary models undergo regular deprecation cycles, threatening long-term reproducibility. Hence, the ability to reproduce annotation results when the original model becomes unavailable, i.e., robust reproducibility, is a central methodological challenge for LLM-based annotation. Achieving robust reproducibility requires first controlling measurement error. We develop an analytical framework that decomposes measurement error into four sources: guideline-induced error from inconsistent annotation criteria, baseline-induced error from unreliable human references, prompt-induced error from suboptimal meta-instruction, and model-induced error from architectural differences across LLMs. We develop the SILICON workflow that instantiates the analytical framework, prescribing targeted interventions at each error source. Empirical validation across nine management research tasks confirms that these interventions reduce measurement error, and simulations show that the resulting error reduction yields more accurate downstream statistical estimates. With measurement error controlled, we address two further aspects of robust reproducibility. First, we propose a regression-based methodology to establish backup open-weight models, which are permanently accessible. Every tested task has at least one open-weight model with no statistically detectable performance difference. Second, we quantify the upper bound of annotation quality attainable from the current set of available models by proposing a routing procedure that selectively sends low-confidence items to auxiliary models, revealing when model aggregation improves performance and when that may adversely affect labeling quality.", "authors": [ "Xiang Cheng", "Raveesh Mayya", "João Sedoc" ], "year": 2026, "published_date": "2026-05-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2412.14461", "pdf_url": "https://arxiv.org/pdf/2412.14461", "citations": 0, "topics": [], "tags": [ "LLMs", "NLP" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 6.33, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Unstructured text data annotation is foundational to management research. LLMs offer a cost-effective and scalable alternative to human annotation, but they introduce a novel challenge: the annotator itself can be retired.", "key_contribution": "LLMs offer a cost-effective and scalable alternative to human annotation, but they introduce a novel challenge: the annotator itself can be retired.", "why_it_matters": "To Err Is Human; To Annotate, SILICON? Toward Robust Reproducibility in LLM Annotation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "LLMs offer a cost-effective and scalable alternative to human annotation, but they introduce a novel challenge: the…", "biggest_caveat": "but they introduce a novel challenge: the annotator itself can be retired.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2412.14461", "difficulty": "beginner" }, { "id": "arxiv:2605.01970", "source": "arxiv", "source_type": "preprint", "title": "Trojan Hippo: Weaponizing Agent Memory for Data Exfiltration", "abstract": "Memory systems enable otherwise-stateless LLM agents to persist user information across sessions, but also introduce a new attack surface. We characterize the Trojan Hippo attack, a class of persistent memory attacks that operates in a more realistic threat model than prior memory poisoning work: the attacker plants a dormant payload into an agent's long-term memory via a single untrusted tool call (e.g., a crafted email), which activates only when the user later discusses sensitive topics such as finance, health, or identity, and exfiltrates high-value personal data to the attacker. While anecdotal demonstrations of such attacks have appeared against deployed systems, no prior work systematically evaluates them across heterogeneous memory architectures and defenses.We introduce a dynamic evaluation framework comprising two components: (1) an OpenEvolve-based adaptive red-teaming benchmark that stress-tests defenses and memory backends against continuously refined attacks, and (2) the first capability-aware security/utility analysis for persistent memory systems, enabling principled reasoning about defense deployment across different usage profiles. Instantiated on an email assistant across four memory backends (explicit tool memory, agentic memory, RAG, and sliding-window context), Trojan Hippo achieves up to 85-100 percent ASR against current frontier models from OpenAI and Google, with planted memories successfully activating even after 100 benign sessions. We evaluate four memory-system defenses inspired by basic security principles, finding they substantially reduce attack success rates (to as low as 0-5 percent), though at utility costs that vary widely with task requirements. Because of this substantial security-utility tradeoff, the effective real-world deployment of defenses remains an open challenge, which our evaluation framework is specifically designed to address.", "authors": [ "Debeshee Das", "Julien Piet", "Darya Kaviani", "Luca Beurer-Kellner", "Florian Tramèr", "David Wagner" ], "year": 2026, "published_date": "2026-05-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.01970", "pdf_url": "https://arxiv.org/pdf/2605.01970", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "RAG", "ASR" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 5.83, "content_potential_score": 2.34, "interestingness_score": 2.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Memory systems enable otherwise-stateless LLM agents to persist user information across sessions, but also introduce a new attack surface. We characterize the Trojan Hippo attack, a class of persistent memory attacks that operates in a more realistic threat model than prior memory poisoning work: the attacker plants a dormant payload into an agent's long-term memory via a single untrusted tool call (e.g., a crafted email), which activates only when the user later discusses sensitive topics such as finance, health, or identity, and exfiltrates high-value personal data to the attacker.", "key_contribution": "Memory systems enable otherwise-stateless LLM agents to persist user information across sessions, but also introduce a new attack surface.", "why_it_matters": "Trojan Hippo: Weaponizing Agent Memory for Data Exfiltration represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Memory systems enable otherwise-stateless LLM agents to persist user information across sessions, but also introduce a…", "biggest_caveat": "but also introduce a new attack surface.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.01970", "difficulty": "beginner" }, { "id": "arxiv:2602.15019", "source": "arxiv", "source_type": "preprint", "title": "Hunt Globally: Wide Search AI Agents for Drug Asset Scouting in Investing, Business Development, and Competitive Intelligence", "abstract": "Bio-pharmaceutical innovation has shifted: many new drug assets now originate outside the United States and are disclosed primarily via regional, non-English channels. Recent data suggests over 85% of patent filings originate outside the U.S., with China accounting for nearly half of the global total; a growing share of scholarly output is also non-U.S. Industry estimates put China at 30% of global drug development, spanning 1,200+ novel candidates. In this high-stakes environment, failing to surface \"under-the-radar\" assets creates multi-billion-dollar risk for investors and business development teams, making asset scouting a coverage-critical competition where speed and completeness drive value. Yet today's Deep Research AI agents still lag human experts in achieving high-recall discovery across heterogeneous, multilingual sources without hallucinations. We propose a benchmarking methodology for drug asset scouting and a tuned, tree-based self-learning Bioptic Agent aimed at complete, non-hallucinated scouting. We construct a challenging completeness benchmark using a multilingual multi-agent pipeline: complex user queries paired with ground-truth assets that are largely outside U.S.-centric radar. To reflect real deal complexity, we collected screening queries from expert investors, BD, and VC professionals, and used them as priors to conditionally generate benchmark queries. For grading, we use LLM-as-judge evaluation calibrated to expert opinions. On this benchmark, our Bioptic Agent achieves 79.7% F1 score, outperforming Gemini 3.1 Deep Think (59.2%), Gemini 3.1 Pro Deep Research (58.6%), Claude Opus 4.6 (56.2%), OpenAI GPT-5.2 Pro (46.6%), Perplexity Deep Research (44.2%), and Exa Websets (26.9%). Performance improves steeply with additional compute, supporting the view that more compute yields better results.", "authors": [ "Vlad Vinogradov", "Alisa Vinogradova", "Luba Greenwood", "Ilya Yasny", "Dmitry Kobyzev", "Shoman Kasbekar", "Kong Nguyen", "Dmitrii Radkevich", "Roman Doronin", "Andrey Doronichev" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.15019", "pdf_url": "https://arxiv.org/pdf/2602.15019", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "AI Agents", "Evaluation", "Information Retrieval" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 6.33, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Bio-pharmaceutical innovation has shifted: many new drug assets now originate outside the United States and are disclosed primarily via regional, non-English channels. Recent data suggests over 85% of patent filings originate outside the U.S., with China accounting for nearly half of the global total; a growing share of scholarly output is also non-U.S.", "key_contribution": "Industry estimates put China at 30% of global drug development, spanning 1,200+ novel candidates.", "why_it_matters": "Hunt Globally: Wide Search AI Agents for Drug Asset Scouting in Investing, Business Development, and Competitive Intelligence improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Industry estimates put China at 30% of global drug development, spanning 1,200+ novel candidates.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2602.15019", "difficulty": "beginner" }, { "id": "arxiv:2605.14635", "source": "arxiv", "source_type": "preprint", "title": "MultiEmo-Bench: Multi-label Visual Emotion Analysis for Multi-modal Large Language Models", "abstract": "This paper introduces a multi-label visual emotion analysis benchmark dataset for comprehensively evaluating the ability of multimodal large language models (MLLMs) to predict the emotions evoked by images. Recent user studies report an unintuitive finding: humans may prefer the predictions of MLLMs over the labels in existing datasets. We argue that this phenomenon stems from the suboptimal annotation scheme used in existing datasets, where each annotator is shown a single candidate emotion for each image and judges whether it is evoked or not. This approach is clearly limited because a single image can evoke multiple emotions with varying intensities. As a result, evaluations based on these datasets may underestimate the capabilities of MLLMs, yet an appropriate benchmark for evaluating such models remains lacking. To address this issue, we introduce a new multi-label benchmark dataset for visual emotion analysis toward MLLMs evaluation. We hire $20$ annotators per image and ask them to select all emotions they feel from an image. Then, we aggregate the votes across all annotators, providing a more reliable and representative dataset labeled with a distribution of emotions. The resulting dataset contains $10,344$ images with $236,998$ valid votes across eight emotions. Based on this benchmark dataset, we evaluate several recent models, including Qwen3-VL, OpenAI's GPT, Gemini, and Claude. We assess model performance on both dominant emotion prediction and emotion distribution prediction. Our results demonstrate the progress achieved by recent MLLMs while also indicating that substantial room for improvement remains. Furthermore, our experiments with LLM-as-a-judge show that the method does not consistently improve MLLMs' performance, indicating its limitations for the subjective task of visual emotion analysis.", "authors": [ "Tianwei Chen", "Takuya Furusawa", "Yuki Hirakawa", "Ryotaro Shimizu", "Mo Fan", "Takashi Wada" ], "year": 2026, "published_date": "2026-05-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.14635", "pdf_url": "https://arxiv.org/pdf/2605.14635", "citations": 0, "topics": [], "tags": [ "LLMs", "Multimodal", "Evaluation", "Artificial Intelligence", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 7.0, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper introduces a multi-label visual emotion analysis benchmark dataset for comprehensively evaluating the ability of multimodal large language models (MLLMs) to predict the emotions evoked by images. Recent user studies report an unintuitive finding: humans may prefer the predictions of MLLMs over the labels in existing datasets.", "key_contribution": "To address this issue, we introduce a new multi-label benchmark dataset for visual emotion analysis toward MLLMs evaluation.", "why_it_matters": "MultiEmo-Bench: Multi-label Visual Emotion Analysis for Multi-modal Large Language Models advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this issue, we introduce a new multi-label benchmark dataset for visual emotion analysis toward MLLMs…", "biggest_caveat": "bution of emotions.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.14635", "difficulty": "beginner" }, { "id": "arxiv:2605.02509", "source": "arxiv", "source_type": "preprint", "title": "MPCS: Neuroplastic Continual Learning via Multi-Component Plasticity and Topology-Aware EWC", "abstract": "Continual learning systems face a fundamental tension between plasticity -- acquiring new knowledge -- and stability -- retaining prior knowledge. We introduce MPCS (Multi-Plasticity Continual System), a neuroplastic architecture that integrates eleven complementary mechanisms: task-driven neurogenesis, Fourier-encoded inputs, EWC regularization, meta-replay, mixed consolidation, hybrid gating, synapse pruning/regeneration, Hebbian updates, task similarity routing, adaptive growth control, and continuous neuron importance tracking. We evaluate MPCS on MEP-BENCH, a multi-track benchmark spanning 31 tasks across regression, classification, logic, and mixed domains, using a three-dimensional Pareto criterion over task performance (Perf), representation diversity (RD), and gradient conflict rate (GCR). Across 15 ablation configurations (3 seeds x 4 tracks x 2000 epochs), MPCS achieves a Normalized Efficiency Score of 94.2, placing it on the Pareto frontier among 9 of 14 gate-passing systems. Key findings: (i) Fourier encoding is the single most critical component (removal drops Perf by 30.7 pp and fails the MEP gate on 14% of tasks); (ii) global EWC degrades performance (NES = -4.2); topology-local EWC reduces this penalty (NES 90.5->91.8) but does not eliminate it; removing EWC entirely yields MPCS_EFFICIENT, the highest-Perf system -- establishing a monotone relationship in the high task-similarity regime (s_bar ~= 0.95): global EWC < topology EWC < no EWC; (iii) the Pareto status assessment is predictive: removing the two Pareto-dominated components (EWC + Hebbian) jointly yields MPCS_EFFICIENT, which improves Perf by 0.6 pp at 4.7x lower compute cost (127 vs. 602 min), validating the Pareto frontier as an actionable model-compression guide.", "authors": [ "Joern Hentsch" ], "year": 2026, "published_date": "2026-05-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.02509", "pdf_url": "https://arxiv.org/pdf/2605.02509", "citations": 0, "topics": [], "tags": [ "Model Compression", "Continual Learning", "Evaluation", "Machine Learning", "Neural Networks" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.09, "read_first_score": 4.12, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Continual learning systems face a fundamental tension between plasticity -- acquiring new knowledge -- and stability -- retaining prior knowledge. We introduce MPCS (Multi-Plasticity Continual System), a neuroplastic architecture that integrates eleven complementary mechanisms: task-driven neurogenesis, Fourier-encoded inputs, EWC regularization, meta-replay, mixed consolidation, hybrid gating, synapse pruning/regeneration, Hebbian updates, task similarity routing, adaptive growth control, and continuous neuron importance tracking.", "key_contribution": "We introduce MPCS (Multi-Plasticity Continual System), a neuroplastic architecture that integrates eleven complementary mechanisms: task-driven neurogenesis, Fourier-encoded inputs, EWC regularization, meta-replay, mixed consolidation, hybrid gating, synapse pruning/regeneration, Hebbian updates, task similarity routing, adaptive growth control, and continuous neuron importance tracking.", "why_it_matters": "MPCS: Neuroplastic Continual Learning via Multi-Component Plasticity and Topology-Aware EWC represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Model Compression.", "one_line_takeaway": "We introduce MPCS (Multi-Plasticity Continual System), a neuroplastic architecture that integrates eleven complementary…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Model Compression.", "url": "https://arxiv.org/abs/2605.02509", "difficulty": "frontier" }, { "id": "arxiv:2608.17744", "source": "arxiv", "source_type": "preprint", "title": "Thinking in a Low-Resource Language: What SFT Builds, What RL Fixes, What Accuracy Cannot See", "abstract": "Take three frontier mixture-of-experts models (Alibaba, OpenAI, NVIDIA; 3.6-4.0B active parameters each) and fine-tune them to reason in a low-resource language. On accuracy benchmarks almost nothing happens, and the benchmark itself is noise at this scale: changing only the random seed moves the score by 7.7 points, more than every data and recipe effect we measured. That null is our first result. The real changes live where accuracy cannot see. Base models never think in Greek: 0 of 1,000 reasoning traces, even when the question is Greek, so the model answers correctly while reasoning in a form its user cannot read, audit, or correct. After supervised fine-tuning (SFT), every released checkpoint reasons in the language of the question on ~98% of items, one family at 3x fewer tokens, with judged grammaticality improving on all four models and general ability within a few points of each base: nothing was forgotten, and fluency was gained. We propose six behavioural dimensions that make such changes measurable, each gated to reject any metric that correlates with output length, and we report how our own instruments lied: six failures, each caught by a control. What SFT cannot do is fix its own defects: a quarter of answers skip the requested format, answers leak into the reasoning channel, and an explicit \"think in English\" is obeyed under half the time. Reinforcement learning with verifiable rewards, pre-registered before training, fixes the first two outright (fallback 24% to 2.5%, leak 3.5% to 0.0%, both against a flat random-reward control) and moves the third (+9.1pp), while the Greek reasoning habit survives an accuracy-only gradient untouched. We release five checkpoints. The instruments, the controls and the pre-registration travel to any low-resource language; Greek is the case that let us measure them.", "authors": [ "Ayoub Kirouane", "Christos Petrocheilos" ], "year": 2026, "published_date": "2026-08-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.17744", "pdf_url": "https://arxiv.org/pdf/2608.17744", "citations": 0, "topics": [], "tags": [ "Reasoning", "Fine-Tuning", "RL", "Robotics", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.08, "read_first_score": 5.83, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Take three frontier mixture-of-experts models (Alibaba, OpenAI, NVIDIA; 3.6-4.0B active parameters each) and fine-tune them to reason in a low-resource language. On accuracy benchmarks almost nothing happens, and the benchmark itself is noise at this scale: changing only the random seed moves the score by 7.7 points, more than every data and recipe effect we measured.", "key_contribution": "We propose six behavioural dimensions that make such changes measurable, each gated to reject any metric that correlates with output length, and we report how our own instruments lied: six failures, each caught by a control.", "why_it_matters": "Thinking in a Low-Resource Language: What SFT Builds, What RL Fixes, What Accuracy Cannot See represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We propose six behavioural dimensions that make such changes measurable, each gated to reject any metric that…", "biggest_caveat": "cannot read, audit, or correct.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2608.17744", "difficulty": "beginner" }, { "id": "arxiv:2607.11696", "source": "arxiv", "source_type": "preprint", "title": "Think Through a Bottleneck: Hourglass Reasoning for Rigorous Induction", "abstract": "Self-refinement often fails to strengthen few-shot inductive reasoning in large language models. Prompting a model to explicitly state its inferred rule does little on its own. What actually matters is a structurally enforced isolation between reasoning stages, so that information can only pass between them as a compressed symbolic state. We introduce \\textbf{Hourglass reasoning}, which enforces strict context isolation between reasoning stages. The frozen LLM acts as a meta-constructor, building for each task a symbolic encoder--decoder: an Induction module compresses the support examples into a schema $ϕ$ (encoder) and a transient scaffold $z$; a Deduction module derives rule $T$ (decoder) from these and discards $z$; an Implementer compiles $(ϕ, T)$ into artifacts; an error-driven Refiner revises $(ϕ, T)$ and regenerates artifacts from scratch. Only $(ϕ, T)$ crosses stage boundaries, so all refinement stays anchored to the rule. We evaluate Hourglass across three benchmarks spanning visual abstraction, hardware synthesis, and textual rule induction, using GPT-5.5 and Gemini 3.1 Pro. On ARC-AGI-2, it raises best-of-5 accuracy by up to 14 points over an iterative-refinement baseline. On ChipBench, it nearly doubles Verilog synthesis accuracy with GPT-5.5, from 31\\% to 58\\%. BBEH-Linguini draws on puzzles from the International Linguistics Olympiad, a setting where prior work has shown that explicit verbalization can hurt performance. Hourglass mitigates this tendency, and on Gemini 3.1 Pro, it reverses the effect entirely. Ablations confirm that these gains come from the isolation between stages and the quality of the initial induction, not from prompt wording or the particular symbolic form used. It is how information flows through the reasoning process, rather than the language used to express it, that drives inductive reasoning in frozen LLMs.", "authors": [ "Huan Zhu" ], "year": 2026, "published_date": "2026-07-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.11696", "pdf_url": "https://arxiv.org/pdf/2607.11696", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Prompting", "Info Extraction", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.08, "read_first_score": 6.33, "content_potential_score": 0.0, "interestingness_score": 1.54, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Self-refinement often fails to strengthen few-shot inductive reasoning in large language models. Prompting a model to explicitly state its inferred rule does little on its own.", "key_contribution": "We introduce \\textbf{Hourglass reasoning}, which enforces strict context isolation between reasoning stages.", "why_it_matters": "Think Through a Bottleneck: Hourglass Reasoning for Rigorous Induction represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce \\textbf{Hourglass reasoning}, which enforces strict context isolation between reasoning stages.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.11696", "difficulty": "beginner" }, { "id": "arxiv:2606.23897", "source": "arxiv", "source_type": "preprint", "title": "The Professor: Multi-Teacher Unsupervised Prompt Distillation for Vision-Language Models", "abstract": "Prompt distillation compresses large vision-language models (VLMs) such as CLIP into lightweight student models by matching teacher predictions on unlabeled domain images. PromptKD (CVPR 2024) established this paradigm with a single PromptSRC-finetuned ViT-L/14 teacher and a ViT-B/16 student. We propose TheProfessor, a multi-teacher extension that distills from a fixed two-teacher ensemble: a domain-finetuned PromptSRC ViT-L/14 teacher and a zero-shot EVA-CLIP-L/14 teacher whose logits are pre-computed per dataset. We evaluate single-teacher PromptKD, equal-probability ensembling, and confidence-weighted ensembling on four base-to-novel datasets: Caltech-101, DTD, UCF101, and EuroSAT. In a 12-run single-seed sweep, confidence-weighted ensembling improves average HM from 87.52 to 89.28 (+1.77 points), while equal averaging improves average HM to 88.88 (+1.37 points). Gains are dataset dependent: they are negligible on Caltech-101 (+0.16 HM for confidence weighting), modest on UCF101 (+0.62), and largest on domain-shifted EuroSAT (+5.78). These results update our earlier Caltech-only analysis and show that multi-teacher prompt distillation is most useful when the second teacher contributes complementary supervision under domain shift.", "authors": [ "Ahmad Algadhi", "Ahmed Alzuhair", "Omar Alkhulaif", "Muzammil Behzad" ], "year": 2026, "published_date": "2026-06-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.23897", "pdf_url": "https://arxiv.org/pdf/2606.23897", "citations": 0, "topics": [], "tags": [ "VLMs", "Artificial Intelligence", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.08, "read_first_score": 4.83, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Prompt distillation compresses large vision-language models (VLMs) such as CLIP into lightweight student models by matching teacher predictions on unlabeled domain images. PromptKD (CVPR 2024) established this paradigm with a single PromptSRC-finetuned ViT-L/14 teacher and a ViT-B/16 student.", "key_contribution": "We propose TheProfessor, a multi-teacher extension that distills from a fixed two-teacher ensemble: a domain-finetuned PromptSRC ViT-L/14 teacher and a zero-shot EVA-CLIP-L/14 teacher whose logits are pre-computed per dataset.", "why_it_matters": "The Professor: Multi-Teacher Unsupervised Prompt Distillation for Vision-Language Models advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about VLMs.", "one_line_takeaway": "We propose TheProfessor, a multi-teacher extension that distills from a fixed two-teacher ensemble: a domain-finetuned…", "biggest_caveat": "butes complementary supervision under domain shift.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in VLMs.", "url": "https://arxiv.org/abs/2606.23897", "difficulty": "intermediate" }, { "id": "arxiv:2602.15872", "source": "arxiv", "source_type": "preprint", "title": "MARVL: Multi-Stage Guidance for Robotic Manipulation via Vision-Language Models", "abstract": "Designing dense reward functions is pivotal for efficient robotic Reinforcement Learning (RL). However, most dense rewards rely on manual engineering, which fundamentally limits the scalability and automation of reinforcement learning. While Vision-Language Models (VLMs) offer a promising path to reward design, naive VLM rewards often misalign with task progress, struggle with spatial grounding, and show limited understanding of task semantics. To address these issues, we propose MARVL-Multi-stAge guidance for Robotic manipulation via Vision-Language models. MARVL fine-tunes a VLM for spatial and semantic consistency and decomposes tasks into multi-stage subtasks with task direction projection for trajectory sensitivity. Empirically, MARVL significantly outperforms existing VLM-reward methods on the Meta-World benchmark, demonstrating superior sample efficiency and robustness on sparse-reward manipulation tasks.", "authors": [ "Xunlan Zhou", "Xuanlin Chen", "Shaowei Zhang", "ShengHua Wan", "Xiaohai Hu", "Lei Yuan", "De-chuan Zhan" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.15872", "pdf_url": "https://arxiv.org/pdf/2602.15872", "citations": 0, "topics": [], "tags": [ "Hallucination", "Fine-Tuning", "VLMs", "RL", "Robotics" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.08, "read_first_score": 3.73, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Designing dense reward functions is pivotal for efficient robotic Reinforcement Learning (RL). However, most dense rewards rely on manual engineering, which fundamentally limits the scalability and automation of reinforcement learning.", "key_contribution": "While Vision-Language Models (VLMs) offer a promising path to reward design, naive VLM rewards often misalign with task progress, struggle with spatial grounding, and show limited understanding of task semantics.", "why_it_matters": "MARVL: Multi-Stage Guidance for Robotic Manipulation via Vision-Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "While Vision-Language Models (VLMs) offer a promising path to reward design, naive VLM rewards often misalign with task…", "biggest_caveat": "However, most dense rewards rely on manual engineering, which fundamentally limits the scalability and automation of reinforcement learning.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2602.15872", "difficulty": "advanced" }, { "id": "arxiv:2603.26612", "source": "arxiv", "source_type": "preprint", "title": "Meta-Adaptive Beam Search Planning for Transformer-Based Reinforcement Learning Control of UAVs with Overhead Manipulators under Flight Disturbances", "abstract": "Drones equipped with overhead manipulators offer unique capabilities for inspection, maintenance, and contact-based interaction. However, the motion of the drone and its manipulator is tightly linked, and even small attitude changes caused by wind or control imperfections shift the end-effector away from its intended path. This coupling makes reliable tracking difficult and also limits the direct use of learning-based arm controllers that were originally designed for fixed-base robots. These effects appear consistently in our tests whenever the UAV body experiences drift or rapid attitude corrections. To address this behavior, we develop a reinforcement-learning (RL) framework with a transformer-based double deep Q learning (DDQN), with the core idea of using an adaptive beam-search planner that applies a short-horizon beam search over candidate control sequences using the learned critic as the forward estimator. This allows the controller to anticipate the end-effector's motion through simulated rollouts rather than executing those actions directly on the actual model, realizing a software-in-the-loop (SITL) approach. The lookahead relies on value estimates from a Transformer critic that processes short sequences of states, while a DDQN backbone provides the one-step targets needed to keep the learning process stable. Evaluated on a 3-DoF aerial manipulator under identical training conditions, the proposed meta-adaptive planner shows the strongest overall performance with a 10.2% reward increase, a substantial reduction in mean tracking error (from about 6% to 3%), and a 29.6% improvement in the combined reward-error metric relative to the DDQN baseline. Our method exhibits elevated stability in tracking target tip trajectory (by maintaining 5 cm tracking error) when the drone base exhibits drifts due to external disturbances, as opposed to the fixed-beam and Transformer-only variants.", "authors": [ "Hazim Alzorgan", "Sayed Pedram Haeri Boroujeni", "Abolfazl Razi" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.26612", "pdf_url": "https://arxiv.org/pdf/2603.26612", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Transformers", "RL", "Robotics" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.08, "read_first_score": 6.12, "content_potential_score": 0.0, "interestingness_score": 1.54, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Drones equipped with overhead manipulators offer unique capabilities for inspection, maintenance, and contact-based interaction. However, the motion of the drone and its manipulator is tightly linked, and even small attitude changes caused by wind or control imperfections shift the end-effector away from its intended path.", "key_contribution": "Drones equipped with overhead manipulators offer unique capabilities for inspection, maintenance, and contact-based interaction.", "why_it_matters": "Meta-Adaptive Beam Search Planning for Transformer-Based Reinforcement Learning Control of UAVs with Overhead Manipulators under Flight Disturbances represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "Drones equipped with overhead manipulators offer unique capabilities for inspection, maintenance, and contact-based…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2603.26612", "difficulty": "advanced" }, { "id": "arxiv:2606.23032", "source": "arxiv", "source_type": "preprint", "title": "IPO Finance Agent: Evaluation of LLM Financial Analysts beyond Finance Agent v2, with Automated Rubric Generation -- the Case of the SpaceX (SPCX) IPO", "abstract": "Finance Agent v2 (by Vals AI) has emerged as the reference benchmark for evaluating both Anthropic Claude and OpenAI ChatGPT frontier language models on financial tasks. However, it narrowly deals with periodic reporting from publicly traded companies (SEC 10-K and 10-Q filings), and its agentic harness relies on naive, unenriched chunk retrieval. Neither the task design nor the retrieval approach addresses the distinct challenges of IPO due diligence. SEC S-1 filings combine historical financial statements, governance structures, pro forma and common-control accounting treatments, capital-formation narratives, and underwriting-sensitive risk disclosures within substantially longer documents than typical periodic filings. That is why we introduce IPO Finance Agent, which extends the Finance Agent v2 framework along two directions: task domain and retrieval architecture. During our experiments, the original Finance Agent v2 harness basically failed to deliver any output related to the SpaceX S-1 filing, due to document length. We therefore had to improve the agentic harness with contextual retrieval, a more realistic and industry-standard approach for long documents. We also built a dataset of 1,000 IPO-diligence questions, and publicly release 70 questions on the SpaceX (SPCX) S-1 filing to support reproducibility, while the remainder are held private to guard against benchmark contamination. In addition, we introduce an evaluator-optimizer pipeline to automatically generate evaluation rubrics for the benchmark: candidate facts are extracted from an ensemble of independently-generated model answers to each question, consolidated into draft criteria, then automatically audited for omissions, hallucinations, mistiered items, and redundancy, with LLM feedback driving iterative repair, targeted enrichment, and deduplication. Human experts only review final rubrics before deployment. Results show that the best-performing evaluated model, Alibaba Qwen 3.7 Max, reaches 79.4% accuracy at $0.30 per query, and the most cost-efficient model on the resulting Pareto frontier, Xiaomi MiMo-2.5 Pro, reaches slightly lower accuracy (76.8%) at $0.05 per query. Both exceed the current Finance Agent v2 leaderboard ceiling-Google Gemini 3.5 Flash at 57.9% for $2.51 per querywhile undercutting even FABv2's cheapest entry (MiniMax M3: 48.3% at $0.32) on cost-efficiency. Code and data are released on GitHub: https://github.com/benstaf/ipoagent", "authors": [ "Mostapha Benhenda" ], "year": 2026, "published_date": "2026-06-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.23032", "pdf_url": "https://arxiv.org/pdf/2606.23032", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "Long Context", "AI Agents", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.07, "read_first_score": 6.96, "content_potential_score": 1.5, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Finance Agent v2 (by Vals AI) has emerged as the reference benchmark for evaluating both Anthropic Claude and OpenAI ChatGPT frontier language models on financial tasks. However, it narrowly deals with periodic reporting from publicly traded companies (SEC 10-K and 10-Q filings), and its agentic harness relies on naive, unenriched chunk retrieval.", "key_contribution": "That is why we introduce IPO Finance Agent, which extends the Finance Agent v2 framework along two directions: task domain and retrieval architecture.", "why_it_matters": "IPO Finance Agent: Evaluation of LLM Financial Analysts beyond Finance Agent v2, with Automated Rubric Generation -- the Case of the SpaceX (SPCX) IPO represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "That is why we introduce IPO Finance Agent, which extends the Finance Agent v2 framework along two directions: task…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.23032", "difficulty": "beginner" }, { "id": "arxiv:2505.11577", "source": "arxiv", "source_type": "preprint", "title": "The Accountability Paradox: How Platform API Restrictions Undermine AI Transparency Mandates", "abstract": "Recent application programming interface (API) restrictions on major social media platforms challenge compliance with the EU Digital Services Act [20], which mandates data access for algorithmic transparency. We develop a structured audit framework to assess the growing misalignment between regulatory requirements and platform implementations. Our comparative analysis of X/Twitter, Reddit, TikTok, and Meta identifies critical ``audit blind-spots'' where platform content moderation and algorithmic amplification remain inaccessible to independent verification. Our findings reveal an ``accountability paradox'': as platforms increasingly rely on AI systems, they simultaneously restrict the capacity for independent oversight. We propose targeted policy interventions aligned with the AI Risk Management Framework of the National Institute of Standards and Technology [80], emphasizing federated access models and enhanced regulatory enforcement.", "authors": [ "Florian A. D. Burnat", "Brittany I. Davidson" ], "year": 2026, "published_date": "2026-05-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2505.11577", "pdf_url": "https://arxiv.org/pdf/2505.11577", "citations": 0, "topics": [], "tags": [ "AI Safety", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.07, "read_first_score": 3.26, "content_potential_score": 1.44, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent application programming interface (API) restrictions on major social media platforms challenge compliance with the EU Digital Services Act [20], which mandates data access for algorithmic transparency. We develop a structured audit framework to assess the growing misalignment between regulatory requirements and platform implementations.", "key_contribution": "We propose targeted policy interventions aligned with the AI Risk Management Framework of the National Institute of Standards and Technology [80], emphasizing federated access models and enhanced regulatory enforcement.", "why_it_matters": "The Accountability Paradox: How Platform API Restrictions Undermine AI Transparency Mandates represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We propose targeted policy interventions aligned with the AI Risk Management Framework of the National Institute of…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2505.11577", "difficulty": "advanced" }, { "id": "arxiv:2606.16059", "source": "arxiv", "source_type": "preprint", "title": "Mojo: A Promising Tool for Scalable Financial AI Efficiency", "abstract": "For thirty years, quantitative finance has paid a costly two-language tax: models researched in Python are rewritten in C++ for production, often introducing numerical discrepancies. GPU-accelerated deep learning exacerbates this problem, as nondeterministic floating-point reductions can produce drift in long backtests, challenging regulatory reproducibility and auditability expectations. This article surveys Mojo, Modular's 2026 Python-like systems language, as a structural response for capital markets engineering. While closing the Python-to-C++ performance gap, Mojo uniquely combines native interoperability with the low-level systems control required to construct bit-exact deterministic kernels. Its MLIR compilation infrastructure further allows a single codebase to target scalar, SIMD, multicore, and GPU execution, reducing the translation bottleneck between research and production. We benchmark four core financial AI workloads: Monte Carlo option pricing, LLM sentiment inference, multi-asset backtesting, and portfolio Value at Risk. On Apple Silicon, Mojo demonstrates 20x to 180x speedups over pure Python on directly measured kernels; larger-scale GPU workload results are projections calibrated from published benchmarks. Alongside transparent performance data, we introduce mojo-deterministic, an open-source library of reproducible reduction kernels, and provide a candid assessment of the problems Mojo does and does not yet solve.", "authors": [ "Henry Han" ], "year": 2026, "published_date": "2026-06-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.16059", "pdf_url": "https://arxiv.org/pdf/2606.16059", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.06, "read_first_score": 5.56, "content_potential_score": 1.5, "interestingness_score": 2.28, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "For thirty years, quantitative finance has paid a costly two-language tax: models researched in Python are rewritten in C++ for production, often introducing numerical discrepancies. GPU-accelerated deep learning exacerbates this problem, as nondeterministic floating-point reductions can produce drift in long backtests, challenging regulatory reproducibility and auditability expectations.", "key_contribution": "Alongside transparent performance data, we introduce mojo-deterministic, an open-source library of reproducible reduction kernels, and provide a candid assessment of the problems Mojo does and does not yet solve.", "why_it_matters": "Mojo: A Promising Tool for Scalable Financial AI Efficiency represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Alongside transparent performance data, we introduce mojo-deterministic, an open-source library of reproducible…", "biggest_caveat": "does not yet solve.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.16059", "difficulty": "beginner" }, { "id": "arxiv:2606.05733", "source": "arxiv", "source_type": "preprint", "title": "Zero-Copy Semantic Contagion: An In-Memory Streaming Architecture for Evolving Attention Graphs", "abstract": "Per-ticker forecasting models dominate financial time-series work yet remain blind to cross-company propagation: a foundry disruption in Taiwan does not register in a single-asset model until Apple's own price has already moved. To address this limitation, we introduce a heterogeneous Rust-Python streaming architecture that maps cross-company attention as a continuous-time graph driven directly from text. We show that on the ingestion side, a zero-copy Rust edge parses news records in $\\sim$100 ns and scans the target equity universe in $\\sim$1.2 $μ$s. On the inference end, a multivariate Neural Hawkes Process featuring per-node continuous-time LSTM states and a bilinear latent projection propagates directed excitation, while an adaptive pruning rule bounds the computational cost of dynamic neighborhood updates. Combining these stages, we demonstrate an end-to-end processing latency of $\\sim$13 ms per incoming news record on a single commodity CPU. Evaluated on a one-month temporal holdout of the FNSPID corpus (638 articles across 47 tickers), the system delivers a $1.70\\times$ precision lift over random at the 90th-percentile next-day return threshold, and $3.36\\times$ over a same-sector baseline. Crucially, removing the graph topology collapses precision to zero, confirming that the dynamic attention network is the sole driver of cross-company signal in this architecture.", "authors": [ "Kabir Murjani" ], "year": 2026, "published_date": "2026-06-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.05733", "pdf_url": "https://arxiv.org/pdf/2606.05733", "citations": 0, "topics": [], "tags": [ "Model Compression", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.06, "read_first_score": 4.96, "content_potential_score": 1.5, "interestingness_score": 2.28, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Per-ticker forecasting models dominate financial time-series work yet remain blind to cross-company propagation: a foundry disruption in Taiwan does not register in a single-asset model until Apple's own price has already moved. To address this limitation, we introduce a heterogeneous Rust-Python streaming architecture that maps cross-company attention as a continuous-time graph driven directly from text.", "key_contribution": "To address this limitation, we introduce a heterogeneous Rust-Python streaming architecture that maps cross-company attention as a continuous-time graph driven directly from text.", "why_it_matters": "Zero-Copy Semantic Contagion: An In-Memory Streaming Architecture for Evolving Attention Graphs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Model Compression.", "one_line_takeaway": "To address this limitation, we introduce a heterogeneous Rust-Python streaming architecture that maps cross-company…", "biggest_caveat": "does not register in a single-asset model until Apple's own price has already moved.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Model Compression.", "url": "https://arxiv.org/abs/2606.05733", "difficulty": "frontier" }, { "id": "arxiv:2604.05562v1", "source": "arxiv", "source_type": "preprint", "title": "Physics-Aligned Spectral Mamba: Decoupling Semantics and Dynamics for Few-Shot Hyperspectral Target Detection", "abstract": "Meta-learning facilitates few-shot hyperspectral target detection (HTD), but adapting deep backbones remains challenging. Full-parameter fine-tuning is inefficient and prone to overfitting, and existing methods largely ignore the frequency-domain structure and spectral band continuity of hyperspectral data, limiting spectral adaptation and cross-domain generalization.To address these challenges, we propose SpecMamba, a parameter-efficient and frequency-aware framework that decouples stable semantic representation from agile spectral adaptation. Specifically, we introduce a Discrete Cosine Transform Mamba Adapter (DCTMA) on top of frozen Transformer representations. By projecting spectral features into the frequency domain via DCT and leveraging Mamba's linear-complexity state-space recursion, DCTMA explicitly captures global spectral dependencies and band continuity while avoiding the redundancy of full fine-tuning. Furthermore, to address prototype drift caused by limited sample sizes, we design a Prior-Guided Tri-Encoder (PGTE) that allows laboratory spectral priors to guide the optimization of the learnable adapter without disrupting the stable semantic feature space. Finally, a Self-Supervised Pseudo-Label Mapping (SSPLM) strategy is developed for test-time adaptation, enabling efficient decision boundary refinement through uncertainty-aware sampling and dual-path consistency constraints. Extensive experiments on multiple public datasets demonstrate that SpecMamba consistently outperforms state-of-the-art methods in detection accuracy and cross-domain generalization.", "authors": [ "Luqi Gong", "Qixin Xie", "Yue Chen", "Ziqiang Chen", "Fanda Fan", "Shuai Zhao", "Chao Li" ], "year": 2026, "published_date": "2026-04-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.05562v1", "pdf_url": "https://arxiv.org/pdf/2604.05562v1", "citations": 0, "topics": [], "tags": [ "Prompting", "SSMs", "Fine-Tuning", "Transformers", "Self-Supervised" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (SSMs) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.06, "read_first_score": 5.04, "content_potential_score": 0.0, "interestingness_score": 1.53, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Meta-learning facilitates few-shot hyperspectral target detection (HTD), but adapting deep backbones remains challenging. Full-parameter fine-tuning is inefficient and prone to overfitting, and existing methods largely ignore the frequency-domain structure and spectral band continuity of hyperspectral data, limiting spectral adaptation and cross-domain generalization.To address these challenges, we propose SpecMamba, a parameter-efficient and frequency-aware framework that decouples stable semantic representation from agile spectral adaptation.", "key_contribution": "Full-parameter fine-tuning is inefficient and prone to overfitting, and existing methods largely ignore the frequency-domain structure and spectral band continuity of hyperspectral data, limiting spectral adaptation and cross-domain generalization.To address these challenges, we propose SpecMamba, a parameter-efficient and frequency-aware framework that decouples stable semantic representation from agile spectral adaptation.", "why_it_matters": "Physics-Aligned Spectral Mamba: Decoupling Semantics and Dynamics for Few-Shot Hyperspectral Target Detection represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "Full-parameter fine-tuning is inefficient and prone to overfitting, and existing methods largely ignore the…", "biggest_caveat": "but adapting deep backbones remains challenging.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Prompting.", "url": "http://arxiv.org/abs/2604.05562v1", "difficulty": "advanced" }, { "id": "arxiv:2601.06870", "source": "arxiv", "source_type": "preprint", "title": "QASA: Quality-Aware Semantic Augmentation for Robust Multimodal Sentiment Analysis", "abstract": "Multimodal large language models have demonstrated strong ability in capturing semantic representations for multimodal sentiment analysis. Their capacity to learn stable and generalizable multimodal features is limited, however, by the scarcity of high-quality training data. To address this, we propose QASA (Quality-Aware Semantic Augmentation), which uses diffusion models to generate augmented visual and auditory samples, thereby enlarging the training dataset and supporting multimodal learning. The generated samples can vary in quality and may exhibit cross-modal inconsistencies. To manage this, we introduce a decoupled quality-aware scoring module that assigns training weights based on the reliability of each augmented sample. This approach reduces the influence of low-quality data and contributes to more stable and robust model training. The framework combines the generative capabilities of diffusion models with the semantic reasoning of multimodal large models, providing an automated data augmentation strategy that does not require human annotation while improving generalization and robustness under limited high-quality data. Experiments on the CH-SIMS dataset show that QASA yields a relative increase of 18.0\\% and 5.9\\% in five-class accuracy (Acc5) and binary accuracy (Acc2), respectively, and it also outperforms existing methods on the CMU-MOSI and MUStARD benchmarks.", "authors": [ "Jiazhang Liang", "Jianheng Dai", "Miaosen Luo", "Menghua Jiang", "Sijie Mai" ], "year": 2026, "published_date": "2026-05-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.06870", "pdf_url": "https://arxiv.org/pdf/2601.06870", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Multimodal", "Diffusion", "Sentiment Analysis" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Sentiment Analysis) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.06, "read_first_score": 6.25, "content_potential_score": 1.5, "interestingness_score": 2.28, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multimodal large language models have demonstrated strong ability in capturing semantic representations for multimodal sentiment analysis. Their capacity to learn stable and generalizable multimodal features is limited, however, by the scarcity of high-quality training data.", "key_contribution": "To address this, we propose QASA (Quality-Aware Semantic Augmentation), which uses diffusion models to generate augmented visual and auditory samples, thereby enlarging the training dataset and supporting multimodal learning.", "why_it_matters": "QASA: Quality-Aware Semantic Augmentation for Robust Multimodal Sentiment Analysis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this, we propose QASA (Quality-Aware Semantic Augmentation), which uses diffusion models to generate…", "biggest_caveat": "however, by the scarcity of high-quality training data.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2601.06870", "difficulty": "beginner" }, { "id": "arxiv:2602.06511", "source": "arxiv", "source_type": "preprint", "title": "Evolutionary Generation of Multi-Agent Systems", "abstract": "Large language model (LLM)-based multi-agent systems (MAS) show strong promise for complex reasoning, planning, and tool-augmented tasks, but designing effective MAS architectures remains labor-intensive, brittle, and hard to generalize. Existing automatic MAS generation methods either rely on code generation, which often leads to executability and robustness failures, or impose rigid architectural templates that limit expressiveness and adaptability. We propose Evolutionary Generation of Multi-Agent Systems (EvoMAS), which formulates MAS generation as structured configuration generation. EvoMAS performs evolutionary generation in configuration space. Specifically, EvoMAS selects initial configurations from a pool, applies feedback-conditioned mutation and crossover guided by execution traces, and iteratively refines both the candidate pool and an experience memory. We evaluate EvoMAS on diverse benchmarks, including BBEH, SWE-Bench, and WorkBench, covering reasoning, software engineering, and tool-use tasks. EvoMAS consistently improves task performance over both human-designed MAS and prior automatic MAS generation methods, while producing generated systems with higher executability and runtime robustness. EvoMAS outperforms the agent evolution method EvoAgent by +10.5 points on BBEH reasoning and +7.1 points on WorkBench. With Claude-4.5-Sonnet, EvoMAS also reaches 79.1% on SWE-Bench-Verified, matching the top of the leaderboard. Code is available at https://github.com/amazon-science/EvoMAS", "authors": [ "Yuntong Hu", "Yuting Zhang", "Matthew Trager", "Yi Zhang", "Shuo Yang", "Wei Xia", "Stefano Soatto" ], "year": 2026, "published_date": "2026-05-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.06511", "pdf_url": "https://arxiv.org/pdf/2602.06511", "citations": 0, "topics": [], "tags": [ "Reasoning", "Code Generation", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.06, "read_first_score": 5.57, "content_potential_score": 1.5, "interestingness_score": 2.28, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language model (LLM)-based multi-agent systems (MAS) show strong promise for complex reasoning, planning, and tool-augmented tasks, but designing effective MAS architectures remains labor-intensive, brittle, and hard to generalize. Existing automatic MAS generation methods either rely on code generation, which often leads to executability and robustness failures, or impose rigid architectural templates that limit expressiveness and adaptability.", "key_contribution": "Large language model (LLM)-based multi-agent systems (MAS) show strong promise for complex reasoning, planning, and tool-augmented tasks, but designing effective MAS architectures remains labor-intensive, brittle, and hard to generalize.", "why_it_matters": "Evolutionary Generation of Multi-Agent Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Large language model (LLM)-based multi-agent systems (MAS) show strong promise for complex reasoning, planning, and…", "biggest_caveat": "but designing effective MAS architectures remains labor-intensive, brittle, and hard to generalize.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2602.06511", "difficulty": "beginner" }, { "id": "arxiv:2609.21569", "source": "arxiv", "source_type": "preprint", "title": "Et Tu, MacBook? Unprivileged Keystroke Inference and Context Profiling via the Built-in IMU Side Channel", "abstract": "Recent generations of Apple MacBooks embed an inertial measurement unit (IMU) within their unibody chassis for device orientation and motion sensing. However, this IMU inadvertently captures not only intended device-level information but also subtle physical vibrations from user interactions and the surrounding environment. These signals establish a novel, previously unexplored side channel. We uncover a vulnerability allowing non-root access to IMU data via an IOKit driver, alongside two content-free system metadata interfaces (HIDIdleTime and CGEventSource) that further enrich the side-channel leakage. Through rigorous characterization of the IMU data, we reveal that the leakage spans three core dimensions: (1) keystroke identity (which key is typed), (2) desk surface (where the laptop is placed), and (3) user behavior (who is typing). Leveraging these findings, we introduce BRUTUS, the first comprehensive unprivileged side-channel attack targeting built-in IMU sensors on Apple MacBooks. BRUTUS achieves a character-level accuracy of 89.1% to 97.5% in key recovery. Furthermore, aided by language models, it can successfully reconstruct certain sentences with 100% accuracy. For user identification and environment profiling, BRUTUS correctly discovers user and environment profiles without labels and correctly assigns subsequent segments to their corresponding profiles. Ultimately, this work highlights the urgent necessity of strictly regulating access to built-in IMU sensors.", "authors": [ "Jiaji He", "Yi Shi", "Junfeng Cai", "Chang Liu", "Yongqiang Lyu" ], "year": 2026, "published_date": "2026-09-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.21569", "pdf_url": "https://arxiv.org/pdf/2609.21569", "citations": 0, "topics": [], "tags": [ "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 4.54, "content_potential_score": 0.42, "interestingness_score": 1.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent generations of Apple MacBooks embed an inertial measurement unit (IMU) within their unibody chassis for device orientation and motion sensing. However, this IMU inadvertently captures not only intended device-level information but also subtle physical vibrations from user interactions and the surrounding environment.", "key_contribution": "These signals establish a novel, previously unexplored side channel.", "why_it_matters": "Et Tu, MacBook? Unprivileged Keystroke Inference and Context Profiling via the Built-in IMU Side Channel represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Cryptography & Security.", "one_line_takeaway": "These signals establish a novel, previously unexplored side channel.", "biggest_caveat": "but also subtle physical vibrations from user interactions and the surrounding environment.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Cryptography & Security.", "url": "https://arxiv.org/abs/2609.21569", "difficulty": "intermediate" }, { "id": "arxiv:2609.01938", "source": "arxiv", "source_type": "preprint", "title": "One Demonstration, Many Objects: Generalizing Manipulation via Local Contact Geometry", "abstract": "Dexterous manipulation with multi-fingered robot hands promises human-level dexterity, but collecting large-scale dexterous robot hand data remains difficult. Learning from human demonstrations has emerged as a scalable alternative to robot teleoperation, providing strong priors on object interaction and contact strategies. Recent sim-to-real RL methods incorporate such priors, but often (i) omit rewards that explicitly incentivize precise contact, yielding weak real-world performance, and/or (ii) generalize poorly to unseen object instances. We propose DemoMimic (Dexterous Motion Mimic), a policy that manipulates objects by focusing on their geometry local to the contact points. Its contact-centric rewards encourage precise contact and improve sim-to-real consistency, yielding a single real-world policy that transfers across objects of varying shape, scale, mass, and friction wherever local contact structure is preserved. Real-world ablations show that DemoMimic achieves 71% success across 16 objects, four tasks, and two robot-hand embodiments, with the smallest sim-to-real drop compared to baselines.", "authors": [ "Satvik Sharma", "Samrat Sahoo", "Huang Huang", "Fei-Fei Li", "Jiajun Wu", "Dorsa Sadigh", "Jeannette Bohg" ], "year": 2026, "published_date": "2026-09-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.01938", "pdf_url": "https://arxiv.org/pdf/2609.01938", "citations": 0, "topics": [], "tags": [ "Robotics" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 4.23, "content_potential_score": 1.0, "interestingness_score": 2.02, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Dexterous manipulation with multi-fingered robot hands promises human-level dexterity, but collecting large-scale dexterous robot hand data remains difficult. Learning from human demonstrations has emerged as a scalable alternative to robot teleoperation, providing strong priors on object interaction and contact strategies.", "key_contribution": "We propose DemoMimic (Dexterous Motion Mimic), a policy that manipulates objects by focusing on their geometry local to the contact points.", "why_it_matters": "One Demonstration, Many Objects: Generalizing Manipulation via Local Contact Geometry represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We propose DemoMimic (Dexterous Motion Mimic), a policy that manipulates objects by focusing on their geometry local to…", "biggest_caveat": "but collecting large-scale dexterous robot hand data remains difficult.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2609.01938", "difficulty": "intermediate" }, { "id": "arxiv:2608.29674", "source": "arxiv", "source_type": "preprint", "title": "Creation begins with understanding: LLMs as strategy designers for privacy-preserving tabular data synthesis", "abstract": "Sharing tabular data in high-stakes domains is constrained by privacy regulations. Synthetic data offer a promising alternative, but deep generative models are costly to train and difficult to audit, while LLM-based methods often serialize records as text, obscuring tabular structure and exposing sensitive data. We introduce Tabular Synthesis Strategy Designer (TabSSD), which uses an LLM to design synthesis procedures rather than directly generate records. TabSSD provides the LLM with tree-derived summaries of variable dependence rather than raw records, which produces Python programs for local execution and evaluation. Across twelve datasets, TabSSD strikes a favourable balance among statistical fidelity, predictive utility, and empirical privacy risk, achieving the best average rank across six metrics among ten methods. Moreover, it substantially reduces local computation and token consumption relative to the compared methods. By enabling human-guided refinement and eliminating user-side model tuning, TabSSD lowers the expertise and infrastructure barriers to transparent tabular data synthesis.", "authors": [ "Jinmeng Li", "Quan Zhang", "Hangting Ye", "He Zhao", "Firas Laakom", "Dandan Guo", "Jürgen Schmidhuber" ], "year": 2026, "published_date": "2026-08-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.29674", "pdf_url": "https://arxiv.org/pdf/2608.29674", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Federated Learning", "Structured Data", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 3.67, "content_potential_score": 1.0, "interestingness_score": 2.02, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Sharing tabular data in high-stakes domains is constrained by privacy regulations. Synthetic data offer a promising alternative, but deep generative models are costly to train and difficult to audit, while LLM-based methods often serialize records as text, obscuring tabular structure and exposing sensitive data.", "key_contribution": "We introduce Tabular Synthesis Strategy Designer (TabSSD), which uses an LLM to design synthesis procedures rather than directly generate records.", "why_it_matters": "Creation begins with understanding: LLMs as strategy designers for privacy-preserving tabular data synthesis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Tabular Synthesis Strategy Designer (TabSSD), which uses an LLM to design synthesis procedures rather than…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.29674", "difficulty": "advanced" }, { "id": "arxiv:2608.23831", "source": "arxiv", "source_type": "preprint", "title": "Learning to Act While Waiting: RL Finetuning of Generalist Robot Policies Under Inference Latency", "abstract": "While reinforcement learning (RL) allows generalist robot policies to continually improve during deployment, the large model size of modern generalist policies, such as VLAs, poses a fundamental obstacle to effective RL improvement. In particular, their severe inference latency---which can lead to pauses or jerky movements---can alter the effective environment dynamics and, if not correctly accounted for, break the Markov assumption that RL relies on, causing standard RL algorithms to fail completely. In this work, we introduce a latency-aware framework, Asynchronous RL with Intermediate Information (ARLI), that enables RL-based improvement of generalist policies under inference delays. Our framework builds on asynchronous inference approaches, which interleave action generation with execution to hide latency, and addresses its incompatibility with RL by providing a low-latency RL policy design that maximizes reactivity within the inference window through two contributions: state augmentations that restore near-Markovian structure by incorporating committed actions and a mid-inference observation. We evaluate our approach across simulated and real-world manipulation tasks, and find that it enables effective finetuning under inference delays where standard RL fails entirely, even matching or exceeding the performance of standard RL in idealized no-latency settings.", "authors": [ "Brian Zhu", "Momen Khalil", "E Harrison", "Emanuele Poggi", "Philipp Schmitt", "Bernd Kast", "Philine Meister", "Pranav Atreya", "Qiyang Li", "Finn Ferchau", "Cesar Colmenero", "Yash Shahapurkar", "Gokul Narayanan", "Melih Erdogan", "Kai Wurm", "Georg von Wichert", "Oier Mees", "Eugen Solowjow", "Andrew Wagenmaker", "Sergey Levine" ], "year": 2026, "published_date": "2026-08-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.23831", "pdf_url": "https://arxiv.org/pdf/2608.23831", "citations": 0, "topics": [], "tags": [ "RL", "Robotics", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 4.91, "content_potential_score": 2.68, "interestingness_score": 2.87, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "While reinforcement learning (RL) allows generalist robot policies to continually improve during deployment, the large model size of modern generalist policies, such as VLAs, poses a fundamental obstacle to effective RL improvement. In particular, their severe inference latency---which can lead to pauses or jerky movements---can alter the effective environment dynamics and, if not correctly accounted for, break the Markov assumption that RL relies on, causing standard RL algorithms to fail completely.", "key_contribution": "In this work, we introduce a latency-aware framework, Asynchronous RL with Intermediate Information (ARLI), that enables RL-based improvement of generalist policies under inference delays.", "why_it_matters": "Learning to Act While Waiting: RL Finetuning of Generalist Robot Policies Under Inference Latency represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "In this work, we introduce a latency-aware framework, Asynchronous RL with Intermediate Information (ARLI), that…", "biggest_caveat": "butions: state augmentations that restore near-Markovian structure by incorporating committed actions and a mid-inference observation.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2608.23831", "difficulty": "advanced" }, { "id": "arxiv:2512.07076", "source": "arxiv", "source_type": "preprint", "title": "Context-measure: Contextualizing Metric for Camouflage", "abstract": "Camouflage relies heavily on context, but current metrics used in camouflaged object segmentation ignore contextual cues. We identify two major drawbacks of these metrics: first, the Dimension Flaw - a predicted foreground map usually contains both pixel labels and probability scores, whereas ground truth provides only one-dimensional binary labels; second, the Range Flaw - these metrics struggle to capture full-range pixel dependencies. Thus, we propose Context-measure, a novel context-aware evaluation paradigm built on a probabilistic pixel correlation framework. It augments the ground truth with pixel-level contextual affinity and builds a perception cycle, achieving greater consistency with human perception. Extensive experiments using four meta-measures show that our Context-measure comprehensively outperforms all widely adopted metrics for camouflaged object segmentation. To our knowledge, this is the first metric designed for camouflaged scenarios. Code is available at https://github.com/pursuitxi/Context-measure.", "authors": [ "Chen-Yang Wang", "Ge-Peng Ji", "Song Shao", "Ming-Ming Cheng", "Deng-Ping Fan" ], "year": 2026, "published_date": "2026-07-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2512.07076", "pdf_url": "https://arxiv.org/pdf/2512.07076", "citations": 0, "topics": [], "tags": [ "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 4.56, "content_potential_score": 0.0, "interestingness_score": 1.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Camouflage relies heavily on context, but current metrics used in camouflaged object segmentation ignore contextual cues. We identify two major drawbacks of these metrics: first, the Dimension Flaw - a predicted foreground map usually contains both pixel labels and probability scores, whereas ground truth provides only one-dimensional binary labels; second, the Range Flaw - these metrics struggle to capture full-range pixel dependencies.", "key_contribution": "Thus, we propose Context-measure, a novel context-aware evaluation paradigm built on a probabilistic pixel correlation framework.", "why_it_matters": "Context-measure: Contextualizing Metric for Camouflage advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Computer Vision.", "one_line_takeaway": "Thus, we propose Context-measure, a novel context-aware evaluation paradigm built on a probabilistic pixel correlation…", "biggest_caveat": "but current metrics used in camouflaged object segmentation ignore contextual cues.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Computer Vision.", "url": "https://arxiv.org/abs/2512.07076", "difficulty": "intermediate" }, { "id": "arxiv:2607.17467", "source": "arxiv", "source_type": "preprint", "title": "DA-MergeLoRA: Hypernetwork-Based LoRA Merging for Few-Shot Test-Time Domain Adaptation", "abstract": "Few-shot Test-Time Domain Adaptation (FSTT-DA) seeks to adapt models to novel domains using only a handful of unlabeled target samples. This setting is more realistic than typical domain adaptation setups, which assume access to target data during source training. However, prior FSTT-DA approaches fail to effectively leverage source domain-specific knowledge, relying on shallow batch normalization updates, prompt-based methods that treat the model as a black box, or ensembling strategies that do not capture cross-domain relationships. To address these limitations, we introduce a new FSTT-DA framework that integrates LoRA fine-tuning with model merging. In our approach, separate LoRA modules are fine-tuned on CLIP's vision encoder for each source domain. Since LoRA modifies only a small fraction of the model's parameters, it retains the base model's generalized knowledge while internally learning domain-specific features. To adapt the learned knowledge to a specific target domain, we propose a hypernetwork trained via meta-learning that generates per-column merging factors to combine LoRA modules. Given a small batch of target images, the hypernetwork produces merging weights that fuse source LoRA modules into a single adapted representation. Our results demonstrate state-of-the-art performance across various domain adaptation datasets. Our code is publicly available at https://github.com/nahbois4321/DA-MergeLoRA.", "authors": [ "Siobhan Reid", "Zhixiang Chi", "Li Gu", "Omid Reza Heidari", "Ziqiang Wang", "Yang Wang" ], "year": 2026, "published_date": "2026-07-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.17467", "pdf_url": "https://arxiv.org/pdf/2607.17467", "citations": 0, "topics": [], "tags": [ "Prompting", "Fine-Tuning", "VLMs", "Machine Learning", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 6.16, "content_potential_score": 0.0, "interestingness_score": 1.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Few-shot Test-Time Domain Adaptation (FSTT-DA) seeks to adapt models to novel domains using only a handful of unlabeled target samples. This setting is more realistic than typical domain adaptation setups, which assume access to target data during source training.", "key_contribution": "Few-shot Test-Time Domain Adaptation (FSTT-DA) seeks to adapt models to novel domains using only a handful of unlabeled target samples.", "why_it_matters": "DA-MergeLoRA: Hypernetwork-Based LoRA Merging for Few-Shot Test-Time Domain Adaptation advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "Few-shot Test-Time Domain Adaptation (FSTT-DA) seeks to adapt models to novel domains using only a handful of unlabeled…", "biggest_caveat": "limitations, we introduce a new FSTT-DA framework that integrates LoRA fine-tuning with model merging.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2607.17467", "difficulty": "beginner" }, { "id": "arxiv:2607.03918", "source": "arxiv", "source_type": "preprint", "title": "Beyond Item Order: Temporal Gap Tokenization for Generative Recommendation with Semantic IDs", "abstract": "Semantic-ID-based generative recommendation has recently emerged as a scalable paradigm for sequential recommendation, where each item is represented by a compact sequence of discrete codes and next-item prediction is formulated as code generation. Existing methods, however, typically construct user histories as sequences of static item identifiers, leaving the elapsed time between consecutive interactions outside the generative input. This temporal blindness is problematic because inter-interaction gaps provide useful cues about interest continuity and preference drift. In this paper, we propose ChronoSID, a lightweight temporal augmentation framework for semantic-ID-based generative recommendation. ChronoSID injects temporal signals into the standard three-stage semantic-ID pipeline from two complementary perspectives. First, we introduce Time-Aware Field-Aware Masked Auto-Encoding (TA-FAMAE), which regularizes item representation learning with an auxiliary time-gap prediction objective. Second, we discretize historical interaction intervals into fixed log-scale gap tokens and interleave them with semantic ID tuples as the encoder input of the sequence-to sequence generator. This design preserves the compact SID generation paradigm while enabling the model to capture time-aware transition patterns. Experiments on Amazon review benchmarks show that ChronoSID consistently improves over ReSID and other competitive generative recommendation baselines. Ablation studies further verify the contribution of both temporal components, and diagnostic analyses show clearer gains under long-gap scenarios where user interests are more likely to drift.", "authors": [ "Chengkai Huang", "Tianqi Gao", "Hongtao Huang", "Quan Z. Sheng", "Lina Yao" ], "year": 2026, "published_date": "2026-07-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.03918", "pdf_url": "https://arxiv.org/pdf/2607.03918", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "Code Generation", "Evaluation", "Information Retrieval" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 6.23, "content_potential_score": 1.0, "interestingness_score": 2.02, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Semantic-ID-based generative recommendation has recently emerged as a scalable paradigm for sequential recommendation, where each item is represented by a compact sequence of discrete codes and next-item prediction is formulated as code generation. Existing methods, however, typically construct user histories as sequences of static item identifiers, leaving the elapsed time between consecutive interactions outside the generative input.", "key_contribution": "In this paper, we propose ChronoSID, a lightweight temporal augmentation framework for semantic-ID-based generative recommendation.", "why_it_matters": "Beyond Item Order: Temporal Gap Tokenization for Generative Recommendation with Semantic IDs improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "In this paper, we propose ChronoSID, a lightweight temporal augmentation framework for semantic-ID-based generative…", "biggest_caveat": "bution of both temporal components, and diagnostic analyses show clearer gains under long-gap scenarios where user interests are more likely to drift.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Self-Supervised.", "url": "https://arxiv.org/abs/2607.03918", "difficulty": "beginner" }, { "id": "arxiv:2607.04119", "source": "arxiv", "source_type": "preprint", "title": "SOV-CAD: Stepwise Orthographic Views Guided CAD Modeling Sequence Reconstruction", "abstract": "Reconstructing Computer-Aided Design (CAD) modeling sequences from images is crucial for preserving design intent and supporting parametric editing. However, existing methods typically generate full CAD sequences holistically, overlooking the iterative, feedback-driven nature of human design workflows. We address this limitation by introducing the rich stepwise visual supervision: at each modeling step, the system observes the target's orthographic projections, the projections of the incrementally constructed model, and the active sketch, enabling informed action selection. To effectively leverage this on-the-fly feedback, we propose SOV-CAD, a framework that formulates CAD reconstruction as a sequential decision-making task and employs offline reinforcement learning with a Decision Transformer architecture. This design incorporates continuous visual feedback guided by geometric alignment rewards, resulting in a more accurate and human-like modeling process. Extensive experiments show that SOV-CAD surpasses state-of-the-art methods in CAD sequence reconstruction while exhibiting strong data efficiency. Code of SOV-CAD is available at: https://github.com/LukePhong/SOV-CAD", "authors": [ "Zhaopeng Feng", "Chen Zhi", "Xuhong Zhang", "Zhengwen Feng", "Xinkui Zhao" ], "year": 2026, "published_date": "2026-07-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.04119", "pdf_url": "https://arxiv.org/pdf/2607.04119", "citations": 0, "topics": [], "tags": [ "AI Safety", "Transformers", "RL", "Artificial Intelligence", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 4.13, "content_potential_score": 1.0, "interestingness_score": 2.02, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reconstructing Computer-Aided Design (CAD) modeling sequences from images is crucial for preserving design intent and supporting parametric editing. However, existing methods typically generate full CAD sequences holistically, overlooking the iterative, feedback-driven nature of human design workflows.", "key_contribution": "To effectively leverage this on-the-fly feedback, we propose SOV-CAD, a framework that formulates CAD reconstruction as a sequential decision-making task and employs offline reinforcement learning with a Decision Transformer architecture.", "why_it_matters": "SOV-CAD: Stepwise Orthographic Views Guided CAD Modeling Sequence Reconstruction advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "To effectively leverage this on-the-fly feedback, we propose SOV-CAD, a framework that formulates CAD reconstruction as…", "biggest_caveat": "However, existing methods typically generate full CAD sequences holistically, overlooking the iterative, feedback-driven nature of human design workflows.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2607.04119", "difficulty": "advanced" }, { "id": "arxiv:2512.02968", "source": "arxiv", "source_type": "preprint", "title": "Flexible Gravitational-Wave Parameter Estimation with Transformers", "abstract": "Gravitational-wave data analysis relies on accurate and efficient methods to extract physical information from noisy detector signals, yet the increasing rate and complexity of observations represent a growing challenge. Deep learning provides a powerful alternative to traditional inference, but existing neural models typically lack the flexibility to handle variations in data analysis settings. Such variations accommodate imperfect observations or are required for specialized tests, and could include changes in detector configurations, overall frequency ranges, or localized cuts. We introduce a flexible transformer-based architecture paired with a training strategy that enables adaptation to diverse analysis settings at inference time. Applied to parameter estimation, we demonstrate that a single flexible model, called Dingo-T1, can (i) analyze 48 gravitational-wave events from the third LIGO-Virgo-KAGRA Observing Run under a wide range of analysis configurations, (ii) enable systematic studies of how detector and frequency configurations impact inferred posteriors, and (iii) perform inspiral-merger-ringdown consistency tests probing general relativity. Dingo-T1 also improves median sample efficiency on real events from a baseline of 1.4% to 4.2%. Our approach thus demonstrates flexible and scalable inference with a principled framework for handling missing or incomplete data, key capabilities for current and next-generation observatories.", "authors": [ "Annalena Kofler", "Maximilian Dax", "Stephen R. Green", "Jonas Wildberger", "Nihar Gupte", "Jakob H. Macke", "Jonathan Gair", "Alessandra Buonanno", "Bernhard Schölkopf" ], "year": 2026, "published_date": "2026-06-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2512.02968", "pdf_url": "https://arxiv.org/pdf/2512.02968", "citations": 0, "topics": [], "tags": [ "Transformers", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 6.04, "content_potential_score": 1.84, "interestingness_score": 2.44, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Gravitational-wave data analysis relies on accurate and efficient methods to extract physical information from noisy detector signals, yet the increasing rate and complexity of observations represent a growing challenge. Deep learning provides a powerful alternative to traditional inference, but existing neural models typically lack the flexibility to handle variations in data analysis settings.", "key_contribution": "We introduce a flexible transformer-based architecture paired with a training strategy that enables adaptation to diverse analysis settings at inference time.", "why_it_matters": "Flexible Gravitational-Wave Parameter Estimation with Transformers represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "We introduce a flexible transformer-based architecture paired with a training strategy that enables adaptation to…", "biggest_caveat": "but existing neural models typically lack the flexibility to handle variations in data analysis settings.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2512.02968", "difficulty": "intermediate" }, { "id": "arxiv:2210.12860", "source": "arxiv", "source_type": "preprint", "title": "Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis", "abstract": "We propose and analyze several inexact regularized Newton-type methods for finding a global saddle point of convex-concave unconstrained min-max optimization problems. Compared to first-order methods, our understanding of second-order methods for min-max optimization is relatively limited, as obtaining global rates of convergence with second-order information can be much more involved. In this paper, we examine how second-order information is used to speed up extra-gradient methods, even under inexactness. In particular, we show that the proposed methods generate iterates that remain within a bounded set and that the averaged iterates converge to an $ε$-saddle point within $O(ε^{-2/3})$ iterations in terms of a restricted gap function. We also provide a simple routine for solving the subproblem at each iteration, requiring a single Schur decomposition and $O(\\log\\log(1/ε))$ calls to a linear system solver in a quasi-upper-triangular system. Thus, our method improves the existing line-search-based second-order min-max optimization methods by shaving off an $O(\\log\\log(1/ε))$ factor in the required number of Schur decompositions. Finally, we evaluate our method on both synthetic benchmarks and a real-world application arising from AUC maximization on standard LIBSVM datasets, and find that the proposed second-order approach delivers stronger practical efficiency than representative first-order methods on these problems.", "authors": [ "Tianyi Lin", "Panayotis Mertikopoulos", "Michael I. Jordan" ], "year": 2026, "published_date": "2026-05-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2210.12860", "pdf_url": "https://arxiv.org/pdf/2210.12860", "citations": 0, "topics": [], "tags": [ "Evaluation", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 7.29, "content_potential_score": 0.34, "interestingness_score": 1.69, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We propose and analyze several inexact regularized Newton-type methods for finding a global saddle point of convex-concave unconstrained min-max optimization problems. Compared to first-order methods, our understanding of second-order methods for min-max optimization is relatively limited, as obtaining global rates of convergence with second-order information can be much more involved.", "key_contribution": "We propose and analyze several inexact regularized Newton-type methods for finding a global saddle point of convex-concave unconstrained min-max optimization problems.", "why_it_matters": "Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "We propose and analyze several inexact regularized Newton-type methods for finding a global saddle point of…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2210.12860", "difficulty": "beginner" }, { "id": "arxiv:2604.10527v1", "source": "arxiv", "source_type": "preprint", "title": "STORM: End-to-End Referring Multi-Object Tracking in Videos", "abstract": "Referring multi-object tracking (RMOT) is a task of associating all the objects in a video that semantically match with given textual queries or referring expressions. Existing RMOT approaches decompose object grounding and tracking into separated modules and exhibit limited performance due to the scarcity of training videos, ambiguous annotations, and restricted domains. In this work, we introduce STORM, an end-to-end MLLM that jointly performs grounding and tracking within a unified framework, eliminating external detectors and enabling coherent reasoning over appearance, motion, and language. To improve data efficiency, we propose a task-composition learning (TCL) strategy that decomposes RMOT into image grounding and object tracking, allowing STORM to leverage data-rich sub-tasks and learn structured spatial--temporal reasoning. We further construct STORM-Bench, a new RMOT dataset with accurate trajectories and diverse, unambiguous referring expressions generated through a bottom-up annotation pipeline. Extensive experiments show that STORM achieves state-of-the-art performance on image grounding, single-object tracking, and RMOT benchmarks, demonstrating strong generalization and robust spatial--temporal grounding in complex real-world scenarios. STORM-Bench is released at https://github.com/amazon-science/storm-referring-multi-object-grounding.", "authors": [ "Zijia Lu", "Jingru Yi", "Jue Wang", "Yuxiao Chen", "Junwen Chen", "Xinyu Li", "Davide Modolo" ], "year": 2026, "published_date": "2026-04-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.10527v1", "pdf_url": "https://arxiv.org/pdf/2604.10527v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Hallucination", "Evaluation", "Benchmarking & Evaluation" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 6.51, "content_potential_score": 1.5, "interestingness_score": 2.27, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Referring multi-object tracking (RMOT) is a task of associating all the objects in a video that semantically match with given textual queries or referring expressions. Existing RMOT approaches decompose object grounding and tracking into separated modules and exhibit limited performance due to the scarcity of training videos, ambiguous annotations, and restricted domains.", "key_contribution": "In this work, we introduce STORM, an end-to-end MLLM that jointly performs grounding and tracking within a unified framework, eliminating external detectors and enabling coherent reasoning over appearance, motion, and language.", "why_it_matters": "STORM: End-to-End Referring Multi-Object Tracking in Videos represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this work, we introduce STORM, an end-to-end MLLM that jointly performs grounding and tracking within a unified…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.10527v1", "difficulty": "beginner" }, { "id": "arxiv:2604.05181v1", "source": "arxiv", "source_type": "preprint", "title": "General Multimodal Protein Design Enables DNA-Encoding of Chemistry", "abstract": "Evolution is an extraordinary engine for enzymatic diversity, yet the chemistry it has explored remains a narrow slice of what DNA can encode. Deep generative models can design new proteins that bind ligands, but none have created enzymes without pre-specifying catalytic residues. We introduce DISCO (DIffusion for Sequence-structure CO-design), a multimodal model that co-designs protein sequence and 3D structure around arbitrary biomolecules, as well as inference-time scaling methods that optimize objectives across both modalities. Conditioned solely on reactive intermediates, DISCO designs diverse heme enzymes with novel active-site geometries. These enzymes catalyze new-to-nature carbene-transfer reactions, including alkene cyclopropanation, spirocyclopropanation, B-H, and C(sp$^3$)-H insertions, with high activities exceeding those of engineered enzymes. Random mutagenesis of a selected design further confirmed that enzyme activity can be improved through directed evolution. By providing a scalable route to evolvable enzymes, DISCO broadens the potential scope of genetically encodable transformations. Code is available at https://github.com/DISCO-design/DISCO.", "authors": [ "Jarrid Rector-Brooks", "Théophile Lambert", "Marta Skreta", "Daniel Roth", "Yueming Long", "Zi-Qi Li", "Xi Zhang", "Miruna Cretu", "Francesca-Zhoufan Li", "Tanvi Ganapathy", "Emily Jin", "Avishek Joey Bose", "Jason Yang", "Kirill Neklyudov", "Yoshua Bengio", "Alexander Tong", "Frances H. Arnold", "Cheng-Hao Liu" ], "year": 2026, "published_date": "2026-04-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.05181v1", "pdf_url": "https://arxiv.org/pdf/2604.05181v1", "citations": 0, "topics": [], "tags": [ "Multimodal", "Biomedical AI", "Machine Learning", "Multimodal Learning", "Biomedical & Clinical AI" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 4.64, "content_potential_score": 1.45, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Evolution is an extraordinary engine for enzymatic diversity, yet the chemistry it has explored remains a narrow slice of what DNA can encode. Deep generative models can design new proteins that bind ligands, but none have created enzymes without pre-specifying catalytic residues.", "key_contribution": "We introduce DISCO (DIffusion for Sequence-structure CO-design), a multimodal model that co-designs protein sequence and 3D structure around arbitrary biomolecules, as well as inference-time scaling methods that optimize objectives across both modalities.", "why_it_matters": "General Multimodal Protein Design Enables DNA-Encoding of Chemistry bridges vision and language, enabling richer AI applications that reason across modalities.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We introduce DISCO (DIffusion for Sequence-structure CO-design), a multimodal model that co-designs protein sequence…", "biggest_caveat": "but none have created enzymes without pre-specifying catalytic residues.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Multimodal.", "url": "http://arxiv.org/abs/2604.05181v1", "difficulty": "intermediate" }, { "id": "arxiv:2605.15098", "source": "arxiv", "source_type": "preprint", "title": "Accelerating State-Vector Quantum Simulation on Integrated GPUs via Cache Locality Optimization: A Cross-Architecture Evaluation", "abstract": "The classical simulation of quantum algorithms is a crucial tool for circuit development, testing, and validation. Although acceleration using GPUs significantly reduces simulation time, most high-performance simulators rely on vendor-specific frameworks that target data-center hardware. To broaden access to quantum simulation, this work proposes a vendor-agnostic approach targeting the integrated GPUs commonly found in consumer-grade laptops. A primary challenge in state-vector simulation is its inherently poor spatial locality, which creates a memory bandwidth bottleneck. Consequently, baseline implementations experience a severe degradation in relative GPU speedup as the number of simulated qubits increases. To address this limitation, we introduce a state partitioning optimization that reorganizes the quantum state vector to maximize the last-level cache locality and minimize costly main memory fetches. We evaluate this strategy using a Quantum Phase Estimation algorithm across diverse architectures from Intel, AMD, and Apple. The experimental results demonstrate that the proposed optimization successfully mitigates performance degradation at larger qubit scales. In particular, for a 28-qubit simulation, the optimization reversed a performance deficit on an Intel Core i5, improving the GPU speedup over the CPU from 0.95x to 1.89x, and increased the Apple M1 Pro speedup from 3.71x to 5.88x. Overall, this approach yields consistent execution time improvements, demonstrating the viability of integrated GPUs for efficient quantum circuit simulation.", "authors": [ "Gabriel Fernandes Thomaz", "Jerusa Marchi", "Eduarda Rodrigues Monteiro", "Fernando Augusto Caletti de Barros", "Evandro Chagas Ribeiro da Rosa" ], "year": 2026, "published_date": "2026-05-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.15098", "pdf_url": "https://arxiv.org/pdf/2605.15098", "citations": 0, "topics": [], "tags": [ "Distributed Computing" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 5.26, "content_potential_score": 0.0, "interestingness_score": 1.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The classical simulation of quantum algorithms is a crucial tool for circuit development, testing, and validation. Although acceleration using GPUs significantly reduces simulation time, most high-performance simulators rely on vendor-specific frameworks that target data-center hardware.", "key_contribution": "To address this limitation, we introduce a state partitioning optimization that reorganizes the quantum state vector to maximize the last-level cache locality and minimize costly main memory fetches.", "why_it_matters": "Accelerating State-Vector Quantum Simulation on Integrated GPUs via Cache Locality Optimization: A Cross-Architecture Evaluation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Distributed Computing.", "one_line_takeaway": "To address this limitation, we introduce a state partitioning optimization that reorganizes the quantum state vector to…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Distributed Computing.", "url": "https://arxiv.org/abs/2605.15098", "difficulty": "intermediate" }, { "id": "arxiv:2605.11144", "source": "arxiv", "source_type": "preprint", "title": "Forecast-aware Gaussian Splatting for Predictive 3D Representation in Language-Guided Pick-and-Place Manipulation", "abstract": "We introduce Forecast-aware Gaussian Splatting (Forecast-GS), a predictive 3D representation framework for language-conditioned robotic manipulation. While recent manipulation systems have made progress by grounding language instructions into robot affordances, value maps, or relational keypoint constraints, they usually reason over the current scene and do not explicitly model the task-completed state. This limitation is critical when success depends on satisfying spatial and semantic goals under partial observations, where the robot must evaluate whether a candidate action leads to a feasible task-consistent outcome. We validate Forecast-GS on real-world pick-and-place manipulation tasks, including Cutter-to-Box, Apple-to-Bowl, and Sponge-to-Tray. For each task, we conduct 25 real-world trials under varied initial object configurations using the same robot platform and sensing setup. Forecast-GS with automatic candidate selection achieves success rates of 21/25, 23/25, and 16/25 on the three tasks, respectively, outperforming the ReKep baseline, which achieves 15/25, 19/25, and 10/25. A diagnostic human-assisted setting further improves success rates to 23/25, 24/25, and 19/25, suggesting that candidate generation is effective while automatic ranking remains imperfect. These results suggest that explicitly forecasting task-completed 3D states enables more reliable action evaluation, while the gap between automatic and human-assisted selection indicates that robust final-state ranking remains an important challenge for fully autonomous manipulation. Overall, Forecast-GS provides an interpretable bridge between language understanding, 3D perception, and robotic manipulation planning.", "authors": [ "Kaixin Jia", "Jiacheng Xu" ], "year": 2026, "published_date": "2026-05-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.11144", "pdf_url": "https://arxiv.org/pdf/2605.11144", "citations": 0, "topics": [], "tags": [ "Hallucination", "3D Vision", "Robotics", "Interpretability" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.05, "read_first_score": 4.61, "content_potential_score": 0.42, "interestingness_score": 1.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce Forecast-aware Gaussian Splatting (Forecast-GS), a predictive 3D representation framework for language-conditioned robotic manipulation. While recent manipulation systems have made progress by grounding language instructions into robot affordances, value maps, or relational keypoint constraints, they usually reason over the current scene and do not explicitly model the task-completed state.", "key_contribution": "We introduce Forecast-aware Gaussian Splatting (Forecast-GS), a predictive 3D representation framework for language-conditioned robotic manipulation.", "why_it_matters": "Forecast-aware Gaussian Splatting for Predictive 3D Representation in Language-Guided Pick-and-Place Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "We introduce Forecast-aware Gaussian Splatting (Forecast-GS), a predictive 3D representation framework for…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2605.11144", "difficulty": "intermediate" }, { "id": "arxiv:2602.05379", "source": "arxiv", "source_type": "preprint", "title": "Variance Reduction Based Experience Replay for Policy Optimization", "abstract": "Effective reinforcement learning (RL) for complex stochastic systems requires leveraging historical data to improve sample efficiency and accelerate policy optimization. However, classical experience replay treats all past observations uniformly and fails to account for their varying contributions to learning. To address this limitation, we propose Variance Reduction Experience Replay (VRER), a principled framework that selectively reuses informative samples to reduce the variance of policy gradient estimates. VRER is algorithm-agnostic and can be integrated with existing policy optimization methods, yielding the sample-efficient off-policy algorithm, Policy Gradient with VRER (PG-VRER). To provide rigorous theoretical guarantees, we develop a novel analysis framework for experience replay that explicitly accounts for dependencies induced by Markovian dynamics and behavior-policy interactions. Using this framework, we establish finite-time convergence guarantees for PG-VRER and characterize a fundamental bias-variance trade-off: reusing older samples reduces gradient variance but may introduce greater estimation bias. Extensive experiments show that VRER consistently accelerates learning and outperforms state-of-the-art policy optimization algorithms", "authors": [ "Hua Zheng", "Wei Xie", "M. Ben Feng", "Keilung Choy" ], "year": 2026, "published_date": "2026-08-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.05379", "pdf_url": "https://arxiv.org/pdf/2602.05379", "citations": 0, "topics": [], "tags": [ "RL", "Fairness & Ethics", "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.04, "read_first_score": 4.21, "content_potential_score": 0.0, "interestingness_score": 1.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Effective reinforcement learning (RL) for complex stochastic systems requires leveraging historical data to improve sample efficiency and accelerate policy optimization. However, classical experience replay treats all past observations uniformly and fails to account for their varying contributions to learning.", "key_contribution": "To address this limitation, we propose Variance Reduction Experience Replay (VRER), a principled framework that selectively reuses informative samples to reduce the variance of policy gradient estimates.", "why_it_matters": "Variance Reduction Based Experience Replay for Policy Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "To address this limitation, we propose Variance Reduction Experience Replay (VRER), a principled framework that…", "biggest_caveat": "However, classical experience replay treats all past observations uniformly and fails to account for their varying contributions to learning.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2602.05379", "difficulty": "frontier" }, { "id": "arxiv:2604.26283", "source": "arxiv", "source_type": "preprint", "title": "MedSynapse-V: Bridging Visual Perception and Clinical Intuition via Latent Memory Evolution", "abstract": "High-precision medical diagnosis relies not only on static imaging features but also on the implicit diagnostic memory experts instantly invoke during image interpretation. We pinpoint a fundamental cognitive misalignment in medical VLMs caused by discrete tokenization, leading to quantization loss, long-range information dissipation, and missing case-adaptive expertise. To bridge this gap, we propose ours, a framework for latent diagnostic memory evolution that simulates the experiential invocation of clinicians by dynamically synthesizing implicit diagnostic memories within the model's hidden stream. Specifically, it begins with a Meta Query for Prior Memorization mechanism, where learnable probes retrieve structured priors from an anatomical prior encoder to generate condensed implicit memories. To ensure clinical fidelity, we introduce Causal Counterfactual Refinement (CCR), which leverages reinforcement learning and counterfactual rewards derived from region-level feature masking to quantify the causal contribution of each memory, thereby pruning redundancies and aligning latent representations with diagnostic logic. This evolutionary process culminates in Intrinsic Memory Transition (IMT), a privileged-autonomous dual-branch paradigm that internalizes teacher-branch diagnostic patterns into the student-branch via full-vocabulary divergence alignment. Comprehensive empirical evaluations across multiple datasets demonstrate that ours, by transferring external expertise into endogenous parameters, significantly outperforms existing state-of-the-art methods, particularly chain-of-thought paradigms, in diagnostic accuracy.", "authors": [ "Chunzheng Zhu", "Jiaqi Zeng", "Junyu Jiang", "Jianxin Lin", "Yijun Wang" ], "year": 2026, "published_date": "2026-04-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.26283", "pdf_url": "https://arxiv.org/pdf/2604.26283", "citations": 0, "topics": [], "tags": [ "Reasoning", "AI Safety", "Model Compression", "RL", "Biomedical AI" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.04, "read_first_score": 4.59, "content_potential_score": 0.0, "interestingness_score": 1.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "High-precision medical diagnosis relies not only on static imaging features but also on the implicit diagnostic memory experts instantly invoke during image interpretation. We pinpoint a fundamental cognitive misalignment in medical VLMs caused by discrete tokenization, leading to quantization loss, long-range information dissipation, and missing case-adaptive expertise.", "key_contribution": "To bridge this gap, we propose ours, a framework for latent diagnostic memory evolution that simulates the experiential invocation of clinicians by dynamically synthesizing implicit diagnostic memories within the model's hidden stream.", "why_it_matters": "MedSynapse-V: Bridging Visual Perception and Clinical Intuition via Latent Memory Evolution represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "To bridge this gap, we propose ours, a framework for latent diagnostic memory evolution that simulates the experiential…", "biggest_caveat": "but also on the implicit diagnostic memory experts instantly invoke during image interpretation.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2604.26283", "difficulty": "advanced" }, { "id": "arxiv:2606.30365", "source": "arxiv", "source_type": "preprint", "title": "CouCE: A Unified Causal Framework for Debiased Deep Metric Learning", "abstract": "Deep Metric Learning (DML) often struggles with zero-shot generalization because standard objectives inherently capture what co-occurs rather than what causes similarity. Consequently, DML models are vulnerable to shortcut learning driven by two structurally distinct confounders: background spurious correlations (which create backdoor paths via scene context) and foreground nuisance perturbations (which inject non-semantic variations like pose or illumination). Although existing methods have proposed targeted solutions for each pathway individually, none can simultaneously address both due to their fundamentally distinct causal roles. To bridge this gap, we propose the Counterfactual Causal Embedding (CouCE), a unified causal framework that explicitly models and neutralizes both confounders. Specifically, we introduce Orthogonal Dictionary-Based Backdoor Adjustment (ODBA), which isolates spurious background patterns into a variance-gated dictionary and stably disentangles them from the learned embeddings via soft orthogonal regularization. Simultaneously, we propose Multi-Scale Randomized Causal Intervention (MSRCI) to enforce causal invariance against foreground nuisances through multi-scale Fourier amplitude randomization and a symmetric KL invariance constraint. Notably, CouCE seamlessly integrates with any proxy-based loss, incurring modest training overhead without requiring architectural modifications during inference. Extensive experiments on CUB-200-2011, Cars-196, and Stanford Online Products demonstrate that CouCE consistently achieves state-of-the-art performance, providing a principled and robust solution for debiased DML.", "authors": [ "Xin Yuan", "Zhenyang Niu", "Meiqi Wan", "Huilin Zhu", "Xin Xu", "Kui Jiang" ], "year": 2026, "published_date": "2026-06-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.30365", "pdf_url": "https://arxiv.org/pdf/2606.30365", "citations": 0, "topics": [], "tags": [ "Fairness & Ethics", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.04, "read_first_score": 5.58, "content_potential_score": 0.0, "interestingness_score": 1.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deep Metric Learning (DML) often struggles with zero-shot generalization because standard objectives inherently capture what co-occurs rather than what causes similarity. Consequently, DML models are vulnerable to shortcut learning driven by two structurally distinct confounders: background spurious correlations (which create backdoor paths via scene context) and foreground nuisance perturbations (which inject non-semantic variations like pose or illumination).", "key_contribution": "To bridge this gap, we propose the Counterfactual Causal Embedding (CouCE), a unified causal framework that explicitly models and neutralizes both confounders.", "why_it_matters": "CouCE: A Unified Causal Framework for Debiased Deep Metric Learning advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Fairness & Ethics.", "one_line_takeaway": "To bridge this gap, we propose the Counterfactual Causal Embedding (CouCE), a unified causal framework that explicitly…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fairness & Ethics.", "url": "https://arxiv.org/abs/2606.30365", "difficulty": "intermediate" }, { "id": "arxiv:2601.07298", "source": "arxiv", "source_type": "preprint", "title": "Mimic Human Cognition, Master Multi-Image Reasoning: A Meta-Action Framework for Enhanced Visual Understanding", "abstract": "While Multimodal Large Language Models (MLLMs) excel at single-image understanding, they exhibit significantly degraded performance in multi-image reasoning scenarios. Multi-image reasoning presents fundamental challenges including complex inter-relationships between images and scattered critical information across image sets. Inspired by human cognitive processes, we propose a Cognition-Inspired Meta-Action Framework (CINEMA), which decomposes multi-image reasoning into five structured meta-actions: Global, Focus, Hint, Think, and Answer, explicitly modeling the sequential cognitive steps humans naturally employ. For cold-start training, we introduce a Retrieval-Based Tree Sampling strategy that generates high-quality meta-action trajectories to bootstrap the model with reasoning patterns. During reinforcement learning, we adopt a two-stage paradigm: an exploration phase with Diversity-Preserving Strategy to avoid entropy collapse, followed by an annealed exploitation phase with DAPO to gradually strengthen exploitation. To train our model, we construct a dataset of 56k cold-start and 58k reinforcement learning instances spanning multi-image, multi-frame, and single-image tasks. We conduct extensive evaluations on multi-image reasoning benchmarks, video understanding benchmarks, and single-image benchmarks, achieving competitive state-of-the-art performance on several key benchmarks. Our model surpasses GPT-4o on the MUIR and MVMath benchmarks and notably outperforms specialized video reasoning models on video understanding benchmarks, demonstrating the effectiveness and generalizability of our human cognition-inspired reasoning framework.", "authors": [ "Jianghao Yin", "Qingbin Li", "Kun Sun", "Cheng Ding", "Jie Wang", "Qin Chen", "Jie Zhou", "Nan Wang", "Changqing Li", "Pei Wu", "Jian Xu", "Zheming Yang", "Liang He" ], "year": 2026, "published_date": "2026-06-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.07298", "pdf_url": "https://arxiv.org/pdf/2601.07298", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Video AI", "RL", "Evaluation" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.04, "read_first_score": 7.29, "content_potential_score": 1.5, "interestingness_score": 2.27, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "While Multimodal Large Language Models (MLLMs) excel at single-image understanding, they exhibit significantly degraded performance in multi-image reasoning scenarios. Multi-image reasoning presents fundamental challenges including complex inter-relationships between images and scattered critical information across image sets.", "key_contribution": "Inspired by human cognitive processes, we propose a Cognition-Inspired Meta-Action Framework (CINEMA), which decomposes multi-image reasoning into five structured meta-actions: Global, Focus, Hint, Think, and Answer, explicitly modeling the sequential cognitive steps humans naturally employ.", "why_it_matters": "Mimic Human Cognition, Master Multi-Image Reasoning: A Meta-Action Framework for Enhanced Visual Understanding represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Inspired by human cognitive processes, we propose a Cognition-Inspired Meta-Action Framework (CINEMA), which decomposes…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2601.07298", "difficulty": "beginner" }, { "id": "arxiv:2605.28575", "source": "arxiv", "source_type": "preprint", "title": "A Conflict-Aware Penalty and Statistical Loss Framework for Balancing Modalities and Enhancing Stability in Multimodal Sentiment Analysis", "abstract": "Multimodal Sentiment Analysis (MSA) fuses text, acoustic, and visual streams to infer sentiment. Because pre-trained text encoders are far more expressive than their acoustic and visual counterparts, the text modality tends to dominate optimization, suppressing weaker modalities and inducing gradient norm conflicts that destabilize training. To address this, we propose a Conflict-aware Penalty (CP) that detects and penalizes gradient norm conflicts at each training step, and a Statistical Loss (SL) that aligns predicted distribution statistics with empirical input statistics. Crucially, CP prevents dominant modality gradients from interfering with the SL objective, enabling synergistic training within a unified framework incorporating adaptive modality encoding, gated cross-modal fusion, and unimodal auxiliary heads. Experiments on CMU-MOSI demonstrate state-of-the-art performance, with ablation studies confirming the effectiveness of each component.", "authors": [ "Jianheng Dai", "Jiazhang Liang", "Sijie Mai" ], "year": 2026, "published_date": "2026-05-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.28575", "pdf_url": "https://arxiv.org/pdf/2605.28575", "citations": 0, "topics": [], "tags": [ "Multimodal", "Sentiment Analysis", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Sentiment Analysis) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.04, "read_first_score": 4.53, "content_potential_score": 0.0, "interestingness_score": 1.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multimodal Sentiment Analysis (MSA) fuses text, acoustic, and visual streams to infer sentiment. Because pre-trained text encoders are far more expressive than their acoustic and visual counterparts, the text modality tends to dominate optimization, suppressing weaker modalities and inducing gradient norm conflicts that destabilize training.", "key_contribution": "To address this, we propose a Conflict-aware Penalty (CP) that detects and penalizes gradient norm conflicts at each training step, and a Statistical Loss (SL) that aligns predicted distribution statistics with empirical input statistics.", "why_it_matters": "A Conflict-Aware Penalty and Statistical Loss Framework for Balancing Modalities and Enhancing Stability in Multimodal Sentiment Analysis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "To address this, we propose a Conflict-aware Penalty (CP) that detects and penalizes gradient norm conflicts at each…", "biggest_caveat": "bution statistics with empirical input statistics.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2605.28575", "difficulty": "beginner" }, { "id": "arxiv:2609.28122", "source": "arxiv", "source_type": "preprint", "title": "NPBoost: Neural Processes with Gradient-Boosted Fixed Effects", "abstract": "Neural Processes (NPs) are model-based meta-learners that implicitly learn a stochastic process and adapt to a new task from a small context set. Most extensions of NPs focus on improving the neural network architecture. We instead develop an extension motivated by the shared hierarchical interpretation of meta-learning and mixed-effects models. Specifically, we introduce Neural Process Boosting (NPBoost), which decomposes structured response variability into tree-boosted fixed effects shared across tasks and NP random effects that capture stochastic task-to-task variation. We propose to train the two components jointly using a boosting algorithm in which an NP learns residual task-specific structure and a tree ensemble estimates common patterns across tasks. Across synthetic and real-world tabular meta-learning problems, this decomposition improves over a standard NP when the shared structure contains discontinuities or other irregular patterns that boosted trees can represent effectively.", "authors": [ "Andrea Nava", "Ken Rölli", "Armin Begic", "Fabio Sigrist" ], "year": 2026, "published_date": "2026-09-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.28122", "pdf_url": "https://arxiv.org/pdf/2609.28122", "citations": 0, "topics": [], "tags": [ "Structured Data", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.03, "read_first_score": 3.68, "content_potential_score": 1.1, "interestingness_score": 2.06, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Neural Processes (NPs) are model-based meta-learners that implicitly learn a stochastic process and adapt to a new task from a small context set. Most extensions of NPs focus on improving the neural network architecture.", "key_contribution": "Specifically, we introduce Neural Process Boosting (NPBoost), which decomposes structured response variability into tree-boosted fixed effects shared across tasks and NP random effects that capture stochastic task-to-task variation.", "why_it_matters": "NPBoost: Neural Processes with Gradient-Boosted Fixed Effects represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Structured Data.", "one_line_takeaway": "Specifically, we introduce Neural Process Boosting (NPBoost), which decomposes structured response variability into…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Structured Data.", "url": "https://arxiv.org/abs/2609.28122", "difficulty": "frontier" }, { "id": "arxiv:2510.25103", "source": "arxiv", "source_type": "preprint", "title": "Adaptive Proof Refinement with LLM-Guided Strategy Selection", "abstract": "Formal verification via theorem proving enables the expressive specification and rigorous proof of software correctness, but it is difficult to scale due to the significant manual effort and expertise required. While Large Language Models (LLMs) show potential in proof generation, they frequently produce incorrect proofs on the first attempt and require additional strategies for iterative refinement. However, existing approaches employ fixed refinement strategies and cannot dynamically choose an effective strategy based on the particular issues in a generated proof, which limits their performance. To overcome this limitation, we introduce Adapt, a novel proof refinement framework that leverages an LLM-guided decision-maker to dynamically select a suitable refinement strategy according to the state of the proof assistant and available context of an incorrect proof. We evaluate Adapt on two benchmarks against four existing methods and find that it significantly outperforms the best baseline on both by proving 16.63% and 18.58% more theorems, respectively. Furthermore, we demonstrate Adapt's generalizability by evaluating it across five different LLMs. We also conduct ablation studies to measure the contribution of each component and compare the trade-offs of alternative decision-maker designs.", "authors": [ "Minghai Lu", "Zhe Zhou", "Danning Xie", "Songlin Jia", "Benjamin Delaware", "Tianyi Zhang" ], "year": 2026, "published_date": "2026-09-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.25103", "pdf_url": "https://arxiv.org/pdf/2510.25103", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Software Engineering" ], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.03, "read_first_score": 5.01, "content_potential_score": 0.0, "interestingness_score": 1.51, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Formal verification via theorem proving enables the expressive specification and rigorous proof of software correctness, but it is difficult to scale due to the significant manual effort and expertise required. While Large Language Models (LLMs) show potential in proof generation, they frequently produce incorrect proofs on the first attempt and require additional strategies for iterative refinement.", "key_contribution": "While Large Language Models (LLMs) show potential in proof generation, they frequently produce incorrect proofs on the first attempt and require additional strategies for iterative refinement.", "why_it_matters": "Adaptive Proof Refinement with LLM-Guided Strategy Selection represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "While Large Language Models (LLMs) show potential in proof generation, they frequently produce incorrect proofs on the…", "biggest_caveat": "but it is difficult to scale due to the significant manual effort and expertise required.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2510.25103", "difficulty": "frontier" }, { "id": "arxiv:2607.15440", "source": "arxiv", "source_type": "preprint", "title": "Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths", "abstract": "We introduce Stochastic Reset Pathfinding (SRP), an episodic learning problem on a known directed graph with unknown stationary edge success probabilities. In each episode, the agent commits to a source-to-goal path, and any edge failure during execution resets it to the source. SRP captures settings such as entanglement distribution in quantum repeater networks, payment routing on the Lightning Network, and delivery in unreliable mesh networks. We show that the global-reset structure makes the optimal policy open-loop, placing SRP within the combinatorial cascading bandit (CCB) framework. We propose a Log-Dijkstra meta-algorithm with UCB (PathUCB) and Thompson Sampling (PathTS) instantiations. Our main technical result is a path-level regret bound for PathUCB that decomposes regret over suboptimal paths via a per-path complexity C(pi) combining each edge's prefix and suffix reliability. The bound is complementary to the edge-level CCB bound and more informative on structured graphs with polynomially many source-to-goal paths. Experiments on quantum-network, layered-DAG, grid-world, and Erdos-Renyi domains support the theory and show that PathTS typically achieves the best empirical performance among the algorithms tested. We then exhibit an adversarial instance on which PathTS fails to converge, consistent with a known exponential obstruction for combinatorial Thompson Sampling on multiplicative-reward problems. We recommend PathTS as the practical default while cautioning that adversarial instances exist.", "authors": [ "Guni Sharon", "Wei Zhang" ], "year": 2026, "published_date": "2026-07-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.15440", "pdf_url": "https://arxiv.org/pdf/2607.15440", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.03, "read_first_score": 4.52, "content_potential_score": 0.0, "interestingness_score": 1.51, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce Stochastic Reset Pathfinding (SRP), an episodic learning problem on a known directed graph with unknown stationary edge success probabilities. In each episode, the agent commits to a source-to-goal path, and any edge failure during execution resets it to the source.", "key_contribution": "We introduce Stochastic Reset Pathfinding (SRP), an episodic learning problem on a known directed graph with unknown stationary edge success probabilities.", "why_it_matters": "Stochastic Reset Pathfinding: Path-Level Regret for Cascading Bandits over Graph Paths represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "We introduce Stochastic Reset Pathfinding (SRP), an episodic learning problem on a known directed graph with unknown…", "biggest_caveat": "bution in quantum repeater networks, payment routing on the Lightning Network, and delivery in unreliable mesh networks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Machine Learning.", "url": "https://arxiv.org/abs/2607.15440", "difficulty": "frontier" }, { "id": "arxiv:2509.24189", "source": "arxiv", "source_type": "preprint", "title": "SPECTRA: Revealing the Full Spectrum of User Preferences via Distributional LLM Inference", "abstract": "Large Language Models (LLMs) are increasingly used to model user preferences, with the typical output as a directly-generated ranked item list per user. However, this generative paradigm inherits the bias and opacity of autoregressive decoding. It over-emphasizes frequent (head) preferences and suppresses minority, long-tail ones. To address this, we propose SPECTRA (Softmax Probing for Extracted Category-level Token Readouts and Analysis), which treats the finetuned LLM as an implicit probabilistic model and probes its softmax to infer a probability distribution over semantically interpretable preference categories. We evaluate SPECTRA on MovieLens, Yelp, and a large-scale short-video platform. SPECTRA delivers (i) distributional alignment, reducing Jensen-Shannon divergence to the empirical preference distribution by 38 to 44 percent across public datasets; (ii) long-tail recovery with cross-user fairness, raising top-3 category exposure entropy by 23 percent on MovieLens and producing a larger gain on tail-preference users than on head-preference users; and (iii) downstream application value, with a 41 to 46 percent category-NDCG boost on MovieLens and Yelp, and a 7x improvement on long-tail category ranking on a large-scale deployment against a head-optimized production ranker.", "authors": [ "Luyang Zhang", "Jialu Wang", "Shichao Zhu", "Beibei Li", "Zhongcun Wang", "Guangmou Pan", "Yang Song" ], "year": 2026, "published_date": "2026-06-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.24189", "pdf_url": "https://arxiv.org/pdf/2509.24189", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "Fairness & Ethics", "Interpretability", "NLP" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.03, "read_first_score": 3.82, "content_potential_score": 1.42, "interestingness_score": 2.22, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large Language Models (LLMs) are increasingly used to model user preferences, with the typical output as a directly-generated ranked item list per user. However, this generative paradigm inherits the bias and opacity of autoregressive decoding.", "key_contribution": "To address this, we propose SPECTRA (Softmax Probing for Extracted Category-level Token Readouts and Analysis), which treats the finetuned LLM as an implicit probabilistic model and probes its softmax to infer a probability distribution over semantically interpretable preference categories.", "why_it_matters": "SPECTRA: Revealing the Full Spectrum of User Preferences via Distributional LLM Inference represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this, we propose SPECTRA (Softmax Probing for Extracted Category-level Token Readouts and Analysis), which…", "biggest_caveat": "However, this generative paradigm inherits the bias and opacity of autoregressive decoding.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2509.24189", "difficulty": "advanced" }, { "id": "arxiv:2601.03267", "source": "arxiv", "source_type": "preprint", "title": "OpenAI GPT-5 System Card", "abstract": "This is the system card published alongside the OpenAI GPT-5 launch, August 2025. GPT-5 is a unified system with a smart and fast model that answers most questions, a deeper reasoning model for harder problems, and a real-time router that quickly decides which model to use based on conversation type, complexity, tool needs, and explicit intent (for example, if you say 'think hard about this' in the prompt). The router is continuously trained on real signals, including when users switch models, preference rates for responses, and measured correctness, improving over time. Once usage limits are reached, a mini version of each model handles remaining queries. This system card focuses primarily on gpt-5-thinking and gpt-5-main, while evaluations for other models are available in the appendix. The GPT-5 system not only outperforms previous models on benchmarks and answers questions more quickly, but -- more importantly -- is more useful for real-world queries. We've made significant advances in reducing hallucinations, improving instruction following, and minimizing sycophancy, and have leveled up GPT-5's performance in three of ChatGPT's most common uses: writing, coding, and health. All of the GPT-5 models additionally feature safe-completions, our latest approach to safety training to prevent disallowed content. Similarly to ChatGPT agent, we have decided to treat gpt-5-thinking as High capability in the Biological and Chemical domain under our Preparedness Framework, activating the associated safeguards. While we do not have definitive evidence that this model could meaningfully help a novice to create severe biological harm -- our defined threshold for High capability -- we have chosen to take a precautionary approach.", "authors": [ "Aaditya Singh", "Adam Fry", "Adam Perelman", "Adam Tart", "Adi Ganesh", "Ahmed El-Kishky", "Aidan McLaughlin", "Aiden Low", "AJ Ostrow", "Akhila Ananthram", "Akshay Nathan", "Alan Luo", "Alec Helyar", "Aleksander Madry", "Aleksandr Efremov", "Aleksandra Spyra", "Alex Baker-Whitcomb", "Alex Beutel", "Alex Karpenko", "Alex Makelov", "Alex Neitz", "Alex Wei", "Alexandra Barr", "Alexandre Kirchmeyer", "Alexey Ivanov", "Alexi Christakis", "Alistair Gillespie", "Allison Tam", "Ally Bennett", "Alvin Wan", "Alyssa Huang", "Amy McDonald Sandjideh", "Amy Yang", "Ananya Kumar", "Andre Saraiva", "Andrea Vallone", "Andrei Gheorghe", "Andres Garcia Garcia", "Andrew Braunstein", "Andrew Liu", "Andrew Schmidt", "Andrey Mereskin", "Andrey Mishchenko", "Andy Applebaum", "Andy Rogerson", "Ann Rajan", "Annie Wei", "Anoop Kotha", "Anubha Srivastava", "Anushree Agrawal", "Arun Vijayvergiya", "Ashley Tyra", "Ashvin Nair", "Avi Nayak", "Ben Eggers", "Bessie Ji", "Beth Hoover", "Bill Chen", "Blair Chen", "Boaz Barak", "Borys Minaiev", "Botao Hao", "Bowen Baker", "Brad Lightcap", "Brandon McKinzie", "Brandon Wang", "Brendan Quinn", "Brian Fioca", "Brian Hsu", "Brian Yang", "Brian Yu", "Brian Zhang", "Brittany Brenner", "Callie Riggins Zetino", "Cameron Raymond", "Camillo Lugaresi", "Carolina Paz", "Cary Hudson", "Cedric Whitney", "Chak Li", "Charles Chen", "Charlotte Cole", "Chelsea Voss", "Chen Ding", "Chen Shen", "Chengdu Huang", "Chris Colby", "Chris Hallacy", "Chris Koch", "Chris Lu", "Christina Kaplan", "Christina Kim", "CJ Minott-Henriques", "Cliff Frey", "Cody Yu", "Coley Czarnecki", "Colin Reid", "Colin Wei", "Cory Decareaux", "Cristina Scheau", "Cyril Zhang", "Cyrus Forbes", "Da Tang", "Dakota Goldberg", "Dan Roberts", "Dana Palmie", "Daniel Kappler", "Daniel Levine", "Daniel Wright", "Dave Leo", "David Lin", "David Robinson", "Declan Grabb", "Derek Chen", "Derek Lim", "Derek Salama", "Dibya Bhattacharjee", "Dimitris Tsipras", "Dinghua Li", "Dingli Yu", "DJ Strouse", "Drew Williams", "Dylan Hunn", "Ed Bayes", "Edwin Arbus", "Ekin Akyurek", "Elaine Ya Le", "Elana Widmann", "Eli Yani", "Elizabeth Proehl", "Enis Sert", "Enoch Cheung", "Eri Schwartz", "Eric Han", "Eric Jiang", "Eric Mitchell", "Eric Sigler", "Eric Wallace", "Erik Ritter", "Erin Kavanaugh", "Evan Mays", "Evgenii Nikishin", "Fangyuan Li", "Felipe Petroski Such", "Filipe de Avila Belbute Peres", "Filippo Raso", "Florent Bekerman", "Foivos Tsimpourlas", "Fotis Chantzis", "Francis Song", "Francis Zhang", "Gaby Raila", "Garrett McGrath", "Gary Briggs", "Gary Yang", "Giambattista Parascandolo", "Gildas Chabot", "Grace Kim", "Grace Zhao", "Gregory Valiant", "Guillaume Leclerc", "Hadi Salman", "Hanson Wang", "Hao Sheng", "Haoming Jiang", "Haoyu Wang", "Haozhun Jin", "Harshit Sikchi", "Heather Schmidt", "Henry Aspegren", "Honglin Chen", "Huida Qiu", "Hunter Lightman", "Ian Covert", "Ian Kivlichan", "Ian Silber", "Ian Sohl", "Ibrahim Hammoud", "Ignasi Clavera", "Ikai Lan", "Ilge Akkaya", "Ilya Kostrikov", "Irina Kofman", "Isak Etinger", "Ishaan Singal", "Jackie Hehir", "Jacob Huh", "Jacqueline Pan", "Jake Wilczynski", "Jakub Pachocki", "James Lee", "James Quinn", "Jamie Kiros", "Janvi Kalra", "Jasmyn Samaroo", "Jason Wang", "Jason Wolfe", "Jay Chen", "Jay Wang", "Jean Harb", "Jeffrey Han", "Jeffrey Wang", "Jennifer Zhao", "Jeremy Chen", "Jerene Yang", "Jerry Tworek", "Jesse Chand", "Jessica Landon", "Jessica Liang", "Ji Lin", "Jiancheng Liu", "Jianfeng Wang", "Jie Tang", "Jihan Yin", "Joanne Jang", "Joel Morris", "Joey Flynn", "Johannes Ferstad", "Johannes Heidecke", "John Fishbein", "John Hallman", "Jonah Grant", "Jonathan Chien", "Jonathan Gordon", "Jongsoo Park", "Jordan Liss", "Jos Kraaijeveld", "Joseph Guay", "Joseph Mo", "Josh Lawson", "Josh McGrath", "Joshua Vendrow", "Joy Jiao", "Julian Lee", "Julie Steele", "Julie Wang", "Junhua Mao", "Kai Chen", "Kai Hayashi", "Kai Xiao", "Kamyar Salahi", "Kan Wu", "Karan Sekhri", "Karan Sharma", "Karan Singhal", "Karen Li", "Kenny Nguyen", "Keren Gu-Lemberg", "Kevin King", "Kevin Liu", "Kevin Stone", "Kevin Yu", "Kristen Ying", "Kristian Georgiev", "Kristie Lim", "Kushal Tirumala", "Kyle Miller", "Lama Ahmad", "Larry Lv", "Laura Clare", "Laurance Fauconnet", "Lauren Itow", "Lauren Yang", "Laurentia Romaniuk", "Leah Anise", "Lee Byron", "Leher Pathak", "Leon Maksin", "Leyan Lo", "Leyton Ho", "Li Jing", "Liang Wu", "Liang Xiong", "Lien Mamitsuka", "Lin Yang", "Lindsay McCallum", "Lindsey Held", "Liz Bourgeois", "Logan Engstrom", "Lorenz Kuhn", "Louis Feuvrier", "Lu Zhang", "Lucas Switzer", "Lukas Kondraciuk", "Lukasz Kaiser", "Manas Joglekar", "Mandeep Singh", "Mandip Shah", "Manuka Stratta", "Marcus Williams", "Mark Chen", "Mark Sun", "Marselus Cayton", "Martin Li", "Marvin Zhang", "Marwan Aljubeh", "Matt Nichols", "Matthew Haines", "Max Schwarzer", "Mayank Gupta", "Meghan Shah", "Melody Y. Guan", "Melody Huang", "Meng Dong", "Mengqing Wang", "Mia Glaese", "Micah Carroll", "Michael Lampe", "Michael Malek", "Michael Sharman", "Michael Zhang", "Michele Wang", "Michelle Pokrass", "Mihai Florian", "Mikhail Pavlov", "Miles Wang", "Ming Chen", "Mingxuan Wang", "Minnia Feng", "Mo Bavarian", "Molly Lin", "Moose Abdool", "Mostafa Rohaninejad", "Nacho Soto", "Natalie Staudacher", "Natan LaFontaine", "Nathan Marwell", "Nelson Liu", "Nick Preston", "Nick Turley", "Nicklas Ansman", "Nicole Blades", "Nikil Pancha", "Nikita Mikhaylin", "Niko Felix", "Nikunj Handa", "Nishant Rai", "Nitish Keskar", "Noam Brown", "Ofir Nachum", "Oleg Boiko", "Oleg Murk", "Olivia Watkins", "Oona Gleeson", "Pamela Mishkin", "Patryk Lesiewicz", "Paul Baltescu", "Pavel Belov", "Peter Zhokhov", "Philip Pronin", "Phillip Guo", "Phoebe Thacker", "Qi Liu", "Qiming Yuan", "Qinghua Liu", "Rachel Dias", "Rachel Puckett", "Rahul Arora", "Ravi Teja Mullapudi", "Raz Gaon", "Reah Miyara", "Rennie Song", "Rishabh Aggarwal", "RJ Marsan", "Robel Yemiru", "Robert Xiong", "Rohan Kshirsagar", "Rohan Nuttall", "Roman Tsiupa", "Ronen Eldan", "Rose Wang", "Roshan James", "Roy Ziv", "Rui Shu", "Ruslan Nigmatullin", "Saachi Jain", "Saam Talaie", "Sam Altman", "Sam Arnesen", "Sam Toizer", "Sam Toyer", "Samuel Miserendino", "Sandhini Agarwal", "Sarah Yoo", "Savannah Heon", "Scott Ethersmith", "Sean Grove", "Sean Taylor", "Sebastien Bubeck", "Sever Banesiu", "Shaokyi Amdo", "Shengjia Zhao", "Sherwin Wu", "Shibani Santurkar", "Shiyu Zhao", "Shraman Ray Chaudhuri", "Shreyas Krishnaswamy", "Shuaiqi", "Xia", "Shuyang Cheng", "Shyamal Anadkat", "Simón Posada Fishman", "Simon Tobin", "Siyuan Fu", "Somay Jain", "Song Mei", "Sonya Egoian", "Spencer Kim", "Spug Golden", "SQ Mah", "Steph Lin", "Stephen Imm", "Steve Sharpe", "Steve Yadlowsky", "Sulman Choudhry", "Sungwon Eum", "Suvansh Sanjeev", "Tabarak Khan", "Tal Stramer", "Tao Wang", "Tao Xin", "Tarun Gogineni", "Taya Christianson", "Ted Sanders", "Tejal Patwardhan", "Thomas Degry", "Thomas Shadwell", "Tianfu Fu", "Tianshi Gao", "Timur Garipov", "Tina Sriskandarajah", "Toki Sherbakov", "Tomek Korbak", "Tomer Kaftan", "Tomo Hiratsuka", "Tongzhou Wang", "Tony Song", "Tony Zhao", "Troy Peterson", "Val Kharitonov", "Victoria Chernova", "Vineet Kosaraju", "Vishal Kuo", "Vitchyr Pong", "Vivek Verma", "Vlad Petrov", "Wanning Jiang", "Weixing Zhang", "Wenda Zhou", "Wenlei Xie", "Wenting Zhan", "Wes McCabe", "Will DePue", "Will Ellsworth", "Wulfie Bain", "Wyatt Thompson", "Xiangning Chen", "Xiangyu Qi", "Xin Xiang", "Xinwei Shi", "Yann Dubois", "Yaodong Yu", "Yara Khakbaz", "Yifan Wu", "Yilei Qian", "Yin Tat Lee", "Yinbo Chen", "Yizhen Zhang", "Yizhong Xiong", "Yonglong Tian", "Young Cha", "Yu Bai", "Yu Yang", "Yuan Yuan", "Yuanzhi Li", "Yufeng Zhang", "Yuguang Yang", "Yujia Jin", "Yun Jiang", "Yunyun Wang", "Yushi Wang", "Yutian Liu", "Zach Stubenvoll", "Zehao Dou", "Zheng Wu", "Zhigang Wang" ], "year": 2026, "published_date": "2026-05-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.03267", "pdf_url": "https://arxiv.org/pdf/2601.03267", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Hallucination", "Dialogue", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.03, "read_first_score": 6.65, "content_potential_score": 0.0, "interestingness_score": 1.51, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This is the system card published alongside the OpenAI GPT-5 launch, August 2025. GPT-5 is a unified system with a smart and fast model that answers most questions, a deeper reasoning model for harder problems, and a real-time router that quickly decides which model to use based on conversation type, complexity, tool needs, and explicit intent (for example, if you say 'think hard about this' in the prompt).", "key_contribution": "This is the system card published alongside the OpenAI GPT-5 launch, August 2025.", "why_it_matters": "OpenAI GPT-5 System Card represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "This is the system card published alongside the OpenAI GPT-5 launch, August 2025.", "biggest_caveat": "but -- more importantly -- is more useful for real-world queries.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2601.03267", "difficulty": "beginner" }, { "id": "arxiv:2502.18864", "source": "arxiv", "source_type": "preprint", "title": "Accelerating scientific discovery with Co-Scientist", "abstract": "Scientific discovery is driven by scientists generating novel hypotheses for complex problems that undergo rigorous experimental validation. To augment this process, we introduce Co-Scientist, a multi-agent AI system built on Gemini for structured scientific thinking and hypothesis generation. Co-Scientist aims to help scientists discover new original knowledge. Conditioned on their research objectives and prior scientific evidence, it formulates demonstrably novel research hypotheses for experimental verification. The system's design involves agents continuously generating, critiquing and refining hypotheses accelerated by scaling test-time compute. Key contributions include: (1) a multi-agent architecture with an asynchronous task execution framework for flexible compute scaling; (2) a tournament evolution process for self-improving hypotheses generation. Automated evaluations show continued benefits of test-time compute scaling, improving hypothesis quality over time. While general purpose, we focus the validation in three biomedical applications: drug repurposing, novel target discovery, and explaining mechanisms of anti-microbial resistance. Specifically, Co-Scientist helped identify new drug repurposing candidates and synergistic combination therapies for acute myeloid leukemia, which were validated through in vitro experiments. These real-world validations demonstrate the potential of Co-Scientist to accelerate scientific discovery and usher in an era of AI empowered scientists.", "authors": [ "Juraj Gottweis", "Wei-Hung Weng", "Alexander Daryin", "Tao Tu", "Petar Sirkovic", "Artiom Myaskovsky", "Grzegorz Glowaty", "Felix Weissenberger", "Alessio Orlandi", "Dan Popovici", "Anil Palepu", "Keran Rong", "Ryutaro Tanno", "Khaled Saab", "Fan Zhang", "Jacob Blum", "Andrew Carroll", "Kavita Kulkarni", "Nenad Tomasev", "Dina Zverinski", "Ivor Rendulic", "Elahe Vedadi", "Florian Hasler", "Luka Rimanic", "Marina Boia", "Ivan Budiselic", "Ben Feinstein", "Mathias Bellaiche", "Tom Sheffer", "Jan Freyberg", "Jeremy Ratcliff", "Ottavia Bertolli", "Katherine Chou", "Avinatan Hassidim", "Burak Gokturk", "Amin Vahdat", "Yuan Guan", "Vikram Dhillon", "Eeshit Dhaval Vaishnav", "Byron Lee", "Tiago R D Costa", "José R Penadés", "Gary Peltz", "Yossi Matias", "James Manyika", "Demis Hassabis", "Yunhan Xu", "Pushmeet Kohli", "Annalisa Pawlosky", "Alan Karthikesalingam", "Vivek Natarajan" ], "year": 2026, "published_date": "2026-06-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2502.18864", "pdf_url": "https://arxiv.org/pdf/2502.18864", "citations": 0, "topics": [], "tags": [ "Biomedical AI", "Artificial Intelligence", "NLP", "Machine Learning", "Human-Computer Interaction" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.02, "read_first_score": 4.46, "content_potential_score": 1.55, "interestingness_score": 2.29, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Scientific discovery is driven by scientists generating novel hypotheses for complex problems that undergo rigorous experimental validation. To augment this process, we introduce Co-Scientist, a multi-agent AI system built on Gemini for structured scientific thinking and hypothesis generation.", "key_contribution": "Scientific discovery is driven by scientists generating novel hypotheses for complex problems that undergo rigorous experimental validation.", "why_it_matters": "Accelerating scientific discovery with Co-Scientist represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Biomedical AI.", "one_line_takeaway": "Scientific discovery is driven by scientists generating novel hypotheses for complex problems that undergo rigorous…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Biomedical AI.", "url": "https://arxiv.org/abs/2502.18864", "difficulty": "intermediate" }, { "id": "arxiv:2606.19893", "source": "arxiv", "source_type": "preprint", "title": "MetaResearcher: Scaling Deep Research via Self-Reflective Reinforcement Learning in Adversarial Virtual Environments", "abstract": "Deep research agents have demonstrated remarkable capabilities in autonomous information gathering and synthesis, yet their training remains constrained by the static nature of simulated environments, the limits of fact-retrieval-only task designs, and the inefficiency of outcome-based reinforcement learning. In this work, we propose MetaResearcher, a novel framework that scales deep research agent training across four synergistic dimensions. First, we introduce an Evolving Virtual World that injects temporal dynamics and adversarial misinformation into the training environment, forcing agents to develop source credibility assessment and temporal conflict resolution skills. Second, we design Discovery-Oriented Tasks -- including hypothesis generation and contradiction resolution -- that transcend simple fact retrieval and push agents toward genuine research behaviors. Third, we propose a Self-Reflective Meta-Reward mechanism within the GRPO framework that jointly optimizes for answer correctness, search path efficiency, reflection depth, and tool call diversity, directly addressing the repetitive action loop problem observed in prior work. Fourth, we introduce a Heterogeneous Multi-Agent Swarm architecture comprising specialized Scout, Filter, and Synthesizer models that learn collaborative research strategies through coordinated reinforcement learning. Built upon the LiteResearcher infrastructure, MetaResearcher requires zero marginal API cost for training while targeting substantial improvements in both benchmark performance (GAIA, Xbench-DS) and epistemic robustness under adversarial conditions. We present the complete framework design, training methodology, and planned experimental validation.", "authors": [ "Wei Yu", "Suxing Liu", "Minjie Yu", "Jiahao Wang", "Zhijian Zheng", "Haocheng Deng", "Bing Li" ], "year": 2026, "published_date": "2026-06-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.19893", "pdf_url": "https://arxiv.org/pdf/2606.19893", "citations": 0, "topics": [], "tags": [ "RLHF", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.02, "read_first_score": 6.87, "content_potential_score": 1.5, "interestingness_score": 2.26, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deep research agents have demonstrated remarkable capabilities in autonomous information gathering and synthesis, yet their training remains constrained by the static nature of simulated environments, the limits of fact-retrieval-only task designs, and the inefficiency of outcome-based reinforcement learning. In this work, we propose MetaResearcher, a novel framework that scales deep research agent training across four synergistic dimensions.", "key_contribution": "In this work, we propose MetaResearcher, a novel framework that scales deep research agent training across four synergistic dimensions.", "why_it_matters": "MetaResearcher: Scaling Deep Research via Self-Reflective Reinforcement Learning in Adversarial Virtual Environments represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RLHF.", "one_line_takeaway": "In this work, we propose MetaResearcher, a novel framework that scales deep research agent training across four…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in RLHF.", "url": "https://arxiv.org/abs/2606.19893", "difficulty": "beginner" }, { "id": "arxiv:2606.13054v1", "source": "arxiv", "source_type": "preprint", "title": "TWLA: Achieving Ternary Weights and Low-Bit Activations for LLMs via Post-Training Quantization", "abstract": "Large language models (LLMs) exhibit exceptional general language processing capabilities, but their memory and compute costs hinder deployment. Ternarization has emerged as a promising compression technique, offering significant reductions in model size and inference complexity. However, existing methods struggle with heavy-tailed activation distributions and therefore keep activations in high precision, fundamentally limiting end-to-end inference acceleration. To overcome this limitation, we propose TWLA, a post-training quantization (PTQ) framework that achieves 1.58-bit weight compression and 4-bit activation quantization while maintaining high accuracy. TWLA comprises three components: (1) Euclidean-to-Manifold Asymmetric Ternary Quantizer (E2M-ATQ) minimizes layer-output error under weight ternarization via a two-stage optimization from Euclidean initialization to manifold relocation; (2) Kronecker Orthogonal Tri-Modal Shaping (KOTMS) applies a Kronecker-structured orthogonal rotation to reshape weights into ternary-friendly tri-modal distributions, while the shared rotation statistically suppresses activation outliers; and (3) Inter-Layer Aware Activation Mixed Precision (ILA-AMP) explicitly introduces adjacent-layer second-order interaction costs in bit allocation and jointly optimizes for the layer-wise disparity of activation quantization gains induced by the shared orthogonal transform, preventing cascades triggered by a few weak layers. Extensive experiments demonstrate that TWLA maintains high accuracy under W1.58A4, while delivering significant inference acceleration. The code is available at .", "authors": [ "Zhixiong Zhao", "Zukang Xu", "Zhixuan Chen", "Xing Hu", "Zhe Jiang", "Dawei Yang" ], "year": 2026, "published_date": "2026-06-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2606.13054v1", "pdf_url": "https://arxiv.org/pdf/2606.13054v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Model Compression", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses manifold and related concepts.", "maturity_stage": "emerging", "paper_score": 3.02, "read_first_score": 3.4, "content_potential_score": 1.0, "interestingness_score": 2.01, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models (LLMs) exhibit exceptional general language processing capabilities, but their memory and compute costs hinder deployment. Ternarization has emerged as a promising compression technique, offering significant reductions in model size and inference complexity.", "key_contribution": "To overcome this limitation, we propose TWLA, a post-training quantization (PTQ) framework that achieves 1.58-bit weight compression and 4-bit activation quantization while maintaining high accuracy.", "why_it_matters": "TWLA: Achieving Ternary Weights and Low-Bit Activations for LLMs via Post-Training Quantization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To overcome this limitation, we propose TWLA, a post-training quantization (PTQ) framework that achieves 1.58-bit…", "biggest_caveat": "but their memory and compute costs hinder deployment.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2606.13054v1", "difficulty": "frontier" }, { "id": "arxiv:2605.30362", "source": "arxiv", "source_type": "preprint", "title": "XOResNet: Exclusive-OR Meta-Residuals Facilitate Deep Spiking Neural Networks Learning", "abstract": "Spiking neural networks (SNNs) hold promise for demonstrating superior learning and representation capabilities in deep models. Given the tremendous success of ResNet in deep learning, it would naturally follow to train deep SNNs with residual learning. However, existing residual structures for constructing deep SNNs still present challenges of spike redundancy or information loss, as well as redundant learning. In the present study, we first aim to address issues of relative spike redundancy in identity mapping and information loss in non-identity mapping. To this end, we propose an OR-ADD (OA) shortcut connection to merge output spikes/currents from two branches in the residual structure. Furthermore, to mitigate redundant learning in the backbone branch of the residual structure, we introduce the concept of XOR meta-residuals, i.e., selecting pre-learning residuals using the Exclusive-OR (XOR) operation for the backbone branch. Finally, by integrating the OA shortcut and XOR meta-residuals, we devise the XOR residual block and further construct XOResNet with varying depths based on this block. Extensive experiments on four datasets, Fashion-MNIST, CIFAR-10, CIFAR-100, and miniImageNet, show that the proposed XOResNet outperforms existing state-of-the-art deep SNNs optimized via gradient descent. These results validate the effectiveness of our OA shortcut and XOR meta-residual components in overcoming fundamental limitations of residual learning in SNNs, providing new architectural insights for building high-performance neuromorphic systems.", "authors": [ "Jianfang Wu", "Junsong Wang" ], "year": 2026, "published_date": "2026-05-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.30362", "pdf_url": "https://arxiv.org/pdf/2605.30362", "citations": 0, "topics": [], "tags": [ "Artificial Intelligence", "Neural Networks", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses gradient descent — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.02, "read_first_score": 5.18, "content_potential_score": 0.0, "interestingness_score": 1.51, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Spiking neural networks (SNNs) hold promise for demonstrating superior learning and representation capabilities in deep models. Given the tremendous success of ResNet in deep learning, it would naturally follow to train deep SNNs with residual learning.", "key_contribution": "However, existing residual structures for constructing deep SNNs still present challenges of spike redundancy or information loss, as well as redundant learning.", "why_it_matters": "XOResNet: Exclusive-OR Meta-Residuals Facilitate Deep Spiking Neural Networks Learning advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Artificial Intelligence.", "one_line_takeaway": "However, existing residual structures for constructing deep SNNs still present challenges of spike redundancy or…", "biggest_caveat": "limitations of residual learning in SNNs, providing new architectural insights for building high-performance neuromorphic systems.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Artificial Intelligence.", "url": "https://arxiv.org/abs/2605.30362", "difficulty": "advanced" }, { "id": "arxiv:2605.25479", "source": "arxiv", "source_type": "preprint", "title": "MAIL++: Multi-Modal Bi-directional Agent Layer for Vision-Language Models", "abstract": "Adapting large vision-language models (VLMs) such as CLIP to downstream tasks remains challenging, as full fine-tuning is computationally prohibitive and prone to overfitting in low-data regimes. Parameter-efficient fine-tuning (PEFT) alleviates these issues with lightweight prompt- or adapter-based modules, and cross-modal coupling has proven especially effective by strengthening interactions between vision and language. However, existing coupling mechanisms predominantly rely on external auxiliary modules, leading to indirect, coarse-grained interactions that are structurally decoupled from the original VLM and thus limit representational expressiveness. In this paper, we propose Multi-Modal Interactive Agent Layer (MAIL), a PEFT paradigm that embeds cross-modal coupling directly into the intrinsic computation modules of VLMs. MAIL freezes the backbone and inserts lightweight agent layers after core modules, such as LayerNorm, to approximate the parameter updates induced by full fine-tuning. To couple visual and textual streams at this level, we introduce a bottleneck-based text-to-image bridge that jointly optimizes paired agent layers across modalities, coordinating the adaptation of corresponding computation modules. We further present MAIL++, which enables bidirectional cross-modal exchange through a meta agent layer, a meta-text bridge, and a meta-image bridge. At inference time, all agent layers are re-parameterized into the frozen backbone, preserving the original computational efficiency. Extensive experiments on few-shot image classification and few-shot universal cross-domain retrieval demonstrate that MAIL and MAIL++ consistently outperform state-of-the-art PEFT methods.", "authors": [ "Kaixiang Chen", "Pengfei Fang", "Hui Xue" ], "year": 2026, "published_date": "2026-05-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.25479", "pdf_url": "https://arxiv.org/pdf/2605.25479", "citations": 0, "topics": [], "tags": [ "Prompting", "Fine-Tuning", "VLMs", "Text-to-Image", "Object Detection" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.02, "read_first_score": 6.26, "content_potential_score": 1.39, "interestingness_score": 2.21, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Adapting large vision-language models (VLMs) such as CLIP to downstream tasks remains challenging, as full fine-tuning is computationally prohibitive and prone to overfitting in low-data regimes. Parameter-efficient fine-tuning (PEFT) alleviates these issues with lightweight prompt- or adapter-based modules, and cross-modal coupling has proven especially effective by strengthening interactions between vision and language.", "key_contribution": "In this paper, we propose Multi-Modal Interactive Agent Layer (MAIL), a PEFT paradigm that embeds cross-modal coupling directly into the intrinsic computation modules of VLMs.", "why_it_matters": "MAIL++: Multi-Modal Bi-directional Agent Layer for Vision-Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "In this paper, we propose Multi-Modal Interactive Agent Layer (MAIL), a PEFT paradigm that embeds cross-modal coupling…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2605.25479", "difficulty": "beginner" }, { "id": "arxiv:2510.02837", "source": "arxiv", "source_type": "preprint", "title": "Beyond the Final Answer: Evaluating the Reasoning Trajectories of Tool-Augmented Agents", "abstract": "Although recent tool-augmented benchmarks involve complex requests, evaluation remains limited to answer matching, neglecting critical trajectory aspects like efficiency, hallucination, and adaptivity. The most straightforward method for evaluation is to compare an agent's trajectory with the ground-truth, but annotating all valid ground-truth trajectories is prohibitively expensive. In this manner, we introduce TRACE, a reference-free framework for the multi-dimensional evaluation of tool-augmented LLMs. By incorporating an evidence bank which accumulates knowledge from preceding steps, TRACE assesses an agent's reasoning trajectory effectively. To validate our framework, we develop a new meta-evaluation dataset with diverse and flawed trajectories, each labeled with multi-faceted performance scores. Our results confirm that TRACE accurately evaluates complex trajectories even with small open-source LLMs. Furthermore, we apply our method to evaluate the trajectories that agents produce while solving tool-augmented tasks, presenting previously unreported observations and their corresponding insights.", "authors": [ "Wonjoong Kim", "Sangwu Park", "Yeonjun In", "Sein Kim", "Dongha Lee", "Chanyoung Park" ], "year": 2026, "published_date": "2026-05-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.02837", "pdf_url": "https://arxiv.org/pdf/2510.02837", "citations": 0, "topics": [], "tags": [ "Reasoning", "Hallucination", "Info Extraction", "Evaluation", "NLP" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.02, "read_first_score": 5.9, "content_potential_score": 1.5, "interestingness_score": 2.26, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Although recent tool-augmented benchmarks involve complex requests, evaluation remains limited to answer matching, neglecting critical trajectory aspects like efficiency, hallucination, and adaptivity. The most straightforward method for evaluation is to compare an agent's trajectory with the ground-truth, but annotating all valid ground-truth trajectories is prohibitively expensive.", "key_contribution": "In this manner, we introduce TRACE, a reference-free framework for the multi-dimensional evaluation of tool-augmented LLMs.", "why_it_matters": "Beyond the Final Answer: Evaluating the Reasoning Trajectories of Tool-Augmented Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "In this manner, we introduce TRACE, a reference-free framework for the multi-dimensional evaluation of tool-augmented…", "biggest_caveat": "but annotating all valid ground-truth trajectories is prohibitively expensive.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2510.02837", "difficulty": "beginner" }, { "id": "arxiv:2607.18368", "source": "arxiv", "source_type": "preprint", "title": "Neuro-Symbolic Meta-Policies for Temporal Knowledge-Graph Memory under Partial Observability", "abstract": "Partially observable reinforcement learning requires deciding what to retain, retrieve, and forget over time. We introduce a neuro-symbolic meta-policy that learns which symbolic memory heuristic to apply at each decision point while keeping execution symbolic. Our setting uses temporal knowledge-graph memory in RoomKG, where hidden state and observations are represented as Resource Description Framework (RDF) graphs and memory is augmented with temporal RDF triple annotations. The model combines knowledge-graph encoding of memory contents with value heads for question answering, exploration, and forgetting, yielding a controller that is both adaptive and inspectable. This gives the work a direct Semantic Web grounding through RDF-based representation, annotation-compatible graph semantics, and graph-based symbolic operations over explicit memory state. On train/test room splits at long-term memory capacity of 512, the qualifier-aware StarE-GNN configuration achieves the best held-out performance among the compared symbolic, neural, and neuro-symbolic systems while preserving step-level traceability of memory-management decisions.", "authors": [ "Taewoon Kim", "Vincent François-Lavet", "Michael Cochez" ], "year": 2026, "published_date": "2026-07-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.18368", "pdf_url": "https://arxiv.org/pdf/2607.18368", "citations": 0, "topics": [], "tags": [ "Hallucination", "QA", "GNNs", "RL", "Artificial Intelligence" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.01, "read_first_score": 5.35, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Partially observable reinforcement learning requires deciding what to retain, retrieve, and forget over time. We introduce a neuro-symbolic meta-policy that learns which symbolic memory heuristic to apply at each decision point while keeping execution symbolic.", "key_contribution": "We introduce a neuro-symbolic meta-policy that learns which symbolic memory heuristic to apply at each decision point while keeping execution symbolic.", "why_it_matters": "Neuro-Symbolic Meta-Policies for Temporal Knowledge-Graph Memory under Partial Observability represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "We introduce a neuro-symbolic meta-policy that learns which symbolic memory heuristic to apply at each decision point…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2607.18368", "difficulty": "beginner" }, { "id": "arxiv:2607.15610", "source": "arxiv", "source_type": "preprint", "title": "Process Reward Informed Tree Rollout for Effective Multi-Turn RL", "abstract": "Reinforcement learning (RL) has become a key approach for training LLM agents, yet popular methods such as GRPO/RLOO rely on multiple independently sampled complete trajectories for advantage estimation. In long-horizon agentic tasks, such a uniform rollout strategy can waste budget on uninformative dead-end attempts, while promising intermediate states do not receive sufficient exploration. The multi-turn structure of agentic trajectories, with interleaved actions and observations, naturally supports organizing a trajectory group as a tree, where each turn serves as a decision point for exploration. This perspective reframes effective exploration as the problem of deciding where to branch. We propose Process-Scorer Guided Adaptive Tree Rollout (PATR), a quality-aware rollout framework for multi-turn agent RL. PATR uses task-appropriate process feedback to score partial trajectories, selectively branches from promising states, reuses shared prefixes, and conservatively stops degenerate paths to reduce wasted sampling. The resulting rollout groups remain compatible with standard policy optimization while providing more efficient exploration under the same training budget. We evaluate PATR on FrozenLake and the challenging SWE-Bench, which is largely unexplored by prior tree-rollout agent RL methods. Experiments show that PATR improves performance by up to +5.0 points on SWE-Bench and +9.3 points on FrozenLake, highlighting process-guided tree rollouts as an effective strategy for scalable multi-turn RL.", "authors": [ "Xintong Li", "Sha Li", "Yuwei Zhang", "Changlong Yu", "Rongmei Lin", "Hongye Jin", "Shuyi Guan", "Xin Liu", "Linwei Li", "Qingyu Yin", "Jingbo Shang" ], "year": 2026, "published_date": "2026-07-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.15610", "pdf_url": "https://arxiv.org/pdf/2607.15610", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "AI Agents", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.01, "read_first_score": 3.96, "content_potential_score": 1.0, "interestingness_score": 2.0, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reinforcement learning (RL) has become a key approach for training LLM agents, yet popular methods such as GRPO/RLOO rely on multiple independently sampled complete trajectories for advantage estimation. In long-horizon agentic tasks, such a uniform rollout strategy can waste budget on uninformative dead-end attempts, while promising intermediate states do not receive sufficient exploration.", "key_contribution": "We propose Process-Scorer Guided Adaptive Tree Rollout (PATR), a quality-aware rollout framework for multi-turn agent RL.", "why_it_matters": "Process Reward Informed Tree Rollout for Effective Multi-Turn RL represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose Process-Scorer Guided Adaptive Tree Rollout (PATR), a quality-aware rollout framework for multi-turn agent…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.15610", "difficulty": "advanced" }, { "id": "arxiv:2602.01882", "source": "arxiv", "source_type": "preprint", "title": "The price of homogeneity is polynomial", "abstract": "We provide explicit and polynomial bounds for the Homogeneous Wall Lemma which occurred for the first time implicitly in the $13$th entry of Robertson and Seymour's Graph Minors Series [JCTB 1990] and has since become a cornerstone in the algorithmic theory of graph minors. A wall where each brick is assigned a set of colours is said to be homogeneous if each brick is assigned the same set of colours. The Homogeneous Wall Lemma says that there exists a function $h$ that, given non-negative integers $q$ and $k$ and an $h(q,k)$-wall $W$ where each brick is assigned a, possibly empty, subset of $\\{ 1, \\ldots , q \\}$ contains a $k$-wall $W'$ as a subgraph such that, if one assigns to each brick $B$ of $W'$ the union of the sets assigned to the bricks of $W$ in its interior, then $W'$ is homogeneous. It is well-known that $h(q,k) \\in k^{\\mathcal{O}(q)}$. The Homogeneous Wall Lemma plays a key role in most applications of the Irrelevant Vertex Technique where an exponential dependency of $h$ on $q$ usually causes non-uniform dependencies on meta-parameters at best and additional exponential blow-ups at worst. By proving that $h(q,k) \\in \\mathcal{O}(q^4 \\cdot k^6)$, we provide a positive answer to a problem raised by Sau, Stamoulis, and Thilikos [ICALP 2020].", "authors": [ "Maximilian Gorsky", "Michał T. Seweryn", "Sebastian Wiederrecht" ], "year": 2026, "published_date": "2026-06-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.01882", "pdf_url": "https://arxiv.org/pdf/2602.01882", "citations": 0, "topics": [], "tags": [], "paper_type": "theory", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses lemma and related concepts.", "maturity_stage": "emerging", "paper_score": 3.01, "read_first_score": 3.82, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We provide explicit and polynomial bounds for the Homogeneous Wall Lemma which occurred for the first time implicitly in the $13$th entry of Robertson and Seymour's Graph Minors Series [JCTB 1990] and has since become a cornerstone in the algorithmic theory of graph minors. A wall where each brick is assigned a set of colours is said to be homogeneous if each brick is assigned the same set of colours.", "key_contribution": "We provide explicit and polynomial bounds for the Homogeneous Wall Lemma which occurred for the first time implicitly in the $13$th entry of Robertson and Seymour's Graph Minors Series [JCTB 1990] and has since become a cornerstone in the algorithmic theory of graph minors.", "why_it_matters": "The price of homogeneity is polynomial represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "We provide explicit and polynomial bounds for the Homogeneous Wall Lemma which occurred for the first time implicitly…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2602.01882", "difficulty": "frontier" }, { "id": "arxiv:2506.17231", "source": "arxiv", "source_type": "preprint", "title": "Efficient and Stealthy Jailbreak Attacks via Adversarial Prompt Distillation from LLMs to SLMs", "abstract": "Current jailbreak attacks on large language models (LLMs) predominantly rely on LLMs themselves to generate adversarial prompts, creating a critical efficiency bottleneck: each attack requires substantial computational resources and API queries, limiting scalability and practical deployment. To overcome this limitation, we propose Adversarial Prompt Distillation (APD), a novel framework that transfers jailbreaking capabilities from LLMs to small language models (SLMs) for efficient, low-resource attacks. APD integrates three key components: (1) masked adversarial knowledge pre-training via LoRA fine-tuning, (2) dynamic temperature-controlled knowledge distillation to bridge architectural gaps, and (3) reinforcement learning-based template optimization for adaptive refinement. Extensive experiments across 12 models show that APD achieves state-of-the-art attack success rates (e.g., 96.4% ASR_k on GPT-4) while dramatically improving efficiency - generating prompts 3.7x faster with 11.3x fewer parameters than teacher models. Our work establishes the first practical framework for lightweight jailbreak attacks, exposes new vulnerabilities in LLM defenses, and provides a scalable testbed for advancing AI safety research. Our code is available at: https://github.com/lxgem/Efficient_and_Stealthy_Jailbreak_Attacks_via_Adversarial_Prompt.", "authors": [ "Xiang Li", "Chong Zhang", "Jia Wang", "Fangyu Wu", "Yushi Li", "Xiaobo Jin" ], "year": 2026, "published_date": "2026-06-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2506.17231", "pdf_url": "https://arxiv.org/pdf/2506.17231", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "AI Safety", "Model Compression", "Self-Supervised" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.01, "read_first_score": 4.24, "content_potential_score": 1.0, "interestingness_score": 2.0, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Current jailbreak attacks on large language models (LLMs) predominantly rely on LLMs themselves to generate adversarial prompts, creating a critical efficiency bottleneck: each attack requires substantial computational resources and API queries, limiting scalability and practical deployment. To overcome this limitation, we propose Adversarial Prompt Distillation (APD), a novel framework that transfers jailbreaking capabilities from LLMs to small language models (SLMs) for efficient, low-resource attacks.", "key_contribution": "To overcome this limitation, we propose Adversarial Prompt Distillation (APD), a novel framework that transfers jailbreaking capabilities from LLMs to small language models (SLMs) for efficient, low-resource attacks.", "why_it_matters": "Efficient and Stealthy Jailbreak Attacks via Adversarial Prompt Distillation from LLMs to SLMs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To overcome this limitation, we propose Adversarial Prompt Distillation (APD), a novel framework that transfers…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2506.17231", "difficulty": "advanced" }, { "id": "arxiv:2605.22695", "source": "arxiv", "source_type": "preprint", "title": "Improving Viewpoint-Invariance and Temporal Consistency for Action Detection", "abstract": "Viewpoint change invariance and action temporal consistency are critical aspects for the effective deployment of human action detection of untrimmed videos. Existing appearance-based video detection methods often struggle with limited viewpoint diversity during training, while motion-based detection approaches frequently fail to model fine-grained temporal relationships across consecutive motion windows. This paper introduces a novel two-stage action detection approach designed to improve both view-invariance and global temporal coherence properties. In the first stage, we extract motion features from augmented virtual viewpoints, solely used at training. Then, the second stage introduces a new view-invariant, multi-scale temporal encoder based on selective state-space sequence modelling to aggregate information across viewpoints and time scales. Experiments on PKU-MMD and BABEL benchmarks demonstrate that this approach significantly outperforms state-of-the-art methods in all considered splits. Code and trained models are available at: https://icb-vision-ai.github.io/HydraView-TAD", "authors": [ "Yannick Porto", "Renato Martins", "Thomas Chalumeau", "Cedric Demonceaux" ], "year": 2026, "published_date": "2026-05-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.22695", "pdf_url": "https://arxiv.org/pdf/2605.22695", "citations": 0, "topics": [], "tags": [ "SSMs", "Evaluation", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.01, "read_first_score": 4.68, "content_potential_score": 1.0, "interestingness_score": 2.0, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Viewpoint change invariance and action temporal consistency are critical aspects for the effective deployment of human action detection of untrimmed videos. Existing appearance-based video detection methods often struggle with limited viewpoint diversity during training, while motion-based detection approaches frequently fail to model fine-grained temporal relationships across consecutive motion windows.", "key_contribution": "This paper introduces a novel two-stage action detection approach designed to improve both view-invariance and global temporal coherence properties.", "why_it_matters": "Improving Viewpoint-Invariance and Temporal Consistency for Action Detection advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about SSMs.", "one_line_takeaway": "This paper introduces a novel two-stage action detection approach designed to improve both view-invariance and global…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in SSMs.", "url": "https://arxiv.org/abs/2605.22695", "difficulty": "beginner" }, { "id": "arxiv:2605.09297", "source": "arxiv", "source_type": "preprint", "title": "Enforcing Attestable Workflows across Untrusted Networks", "abstract": "Confidential high-performance computing orchestrates workloads across federated domains, yet existing frameworks rely on high-overhead user-space library operating systems or assume single-host execution. We propose \\codename, an architecture federating Trusted Execution Environments via a split Trusted Computing Base (TCB) design. It couples a hardware-isolated Control Plane executing Mutually Attested Key Exchange (\\make) with a measured guest-resident extended Berkeley Packet Filter (eBPF) Data Plane. By anchoring cryptographic key release to hardware measurements and executing enforcement in the kernel, \\codename\\ achieves native-speed encrypted routing. Empirical evaluation demonstrates a steady-state enforcement cost of $6\\,μ$s per packet, imposing a $13$--$15\\,μ$s absolute latency overhead. On distributed pipelines, \\codename\\ incurs just a $6.1\\%$ execution penalty over plaintext baselines, bypassing the $62\\%$ penalty of user-space counterparts. The system initializes a 100-node cluster in under 1.5 seconds, providing an efficient confidential interconnect for long-running workflows.", "authors": [ "Hung Dang", "Tue Nguyen" ], "year": 2026, "published_date": "2026-05-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.09297", "pdf_url": "https://arxiv.org/pdf/2605.09297", "citations": 0, "topics": [], "tags": [ "Distributed Computing", "Cryptography & Security" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.01, "read_first_score": 4.09, "content_potential_score": 1.0, "interestingness_score": 2.0, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Confidential high-performance computing orchestrates workloads across federated domains, yet existing frameworks rely on high-overhead user-space library operating systems or assume single-host execution. We propose \\codename, an architecture federating Trusted Execution Environments via a split Trusted Computing Base (TCB) design.", "key_contribution": "We propose \\codename, an architecture federating Trusted Execution Environments via a split Trusted Computing Base (TCB) design.", "why_it_matters": "Enforcing Attestable Workflows across Untrusted Networks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Distributed Computing.", "one_line_takeaway": "We propose \\codename, an architecture federating Trusted Execution Environments via a split Trusted Computing Base…", "biggest_caveat": "buted pipelines, \\codename\\ incurs just a $6.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Distributed Computing.", "url": "https://arxiv.org/abs/2605.09297", "difficulty": "intermediate" }, { "id": "arxiv:2507.01008", "source": "arxiv", "source_type": "preprint", "title": "DexWrist: A Robotic Wrist for Constrained and Dynamic Manipulation", "abstract": "Development of dexterous manipulation hardware has primarily focused on hands and grippers. However, these end-effectors are often paired with bulky and highly stiff wrists that limit performance in human environments. More designs have adopted backdrivable actuation, but are still difficult to model and control due to coupled kinematics or high mechanical inertia from heavy links. We present DexWrist, a robotic wrist that advances manipulation in highly constrained environments and enables dynamic, contact-rich tasks. We achieve this by combining quasi-direct drive actuation with a decoupled parallel kinematic mechanism in a compact design. It delivers 3.75 +/- 0.05 Nm rated torque, 0.33 +/- 0.06 Nm backdrive torque, 10.15 +/- 1.34 Hz torque bandwidth, +/- 40 degrees ROM in both DOFs, and a one-to-one motor-to-DOF mapping in a 0.97 kg package. In practice, these properties increase workspace in cluttered environments and stabilize contact without the need for finely tuned admittance control. We evaluate DexWrist as a drop-in wrist upgrade in simulation and on two robot arms performing representative constrained and contact-rich tasks. In learned policy evaluations, DexWrist achieved 50-76% relative improvements in success rate, and reduced autonomous task completion times by 3-5x. More details about DexWrist can be found at https://dexwrist.csail.mit.edu.", "authors": [ "Martin Peticco", "Gabriella Ulloa", "John Marangola", "Nitish Dashora", "Pulkit Agrawal" ], "year": 2026, "published_date": "2026-05-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2507.01008", "pdf_url": "https://arxiv.org/pdf/2507.01008", "citations": 0, "topics": [], "tags": [ "Robotics" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.52, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Development of dexterous manipulation hardware has primarily focused on hands and grippers. However, these end-effectors are often paired with bulky and highly stiff wrists that limit performance in human environments.", "key_contribution": "We present DexWrist, a robotic wrist that advances manipulation in highly constrained environments and enables dynamic, contact-rich tasks.", "why_it_matters": "DexWrist: A Robotic Wrist for Constrained and Dynamic Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We present DexWrist, a robotic wrist that advances manipulation in highly constrained environments and enables dynamic,…", "biggest_caveat": "However, these end-effectors are often paired with bulky and highly stiff wrists that limit performance in human environments.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2507.01008", "difficulty": "intermediate" }, { "id": "arxiv:2608.17168", "source": "arxiv", "source_type": "preprint", "title": "Can LLMs Reason in a Legally Meaningful Manner? A Small-scale Study on European Court of Human Rights Cases", "abstract": "Reasoning has become a standard technique and feature for contemporary LLMs; however, its application and quality in the context of demanding legal-oriented tasks, such as legal case forecasting, remain under explored. We investigate how LLMs reason in the context of legal case forecasting, using legal cases from the European Court of Human Rights (ECtHR) as a testbed. We evaluate OpenAI GPT 5.4, a recent top-tier LLM, by exploring alternative prompting strategies that are more or less suggestive of what counts as legally meaningful reasoning in the context of ECtHR jurisprudence. We present our findings derived from assessing the model's responses with both human and LLM evaluation. We find that the examined model scores far from ideal in legal reasoning, the model produces structurally complete but substantively shallow analyses, and that LLM-as-a-Judge evaluators are internally consistent yet align only weakly with our trained annotators, i.e., reliable but not a valid substitute for human evaluation. Overall, the expert-curated prompt leads to more comprehensive reasoning, which does not result in more accurate predictions compared to the other examined settings. Based on our findings, we urge the community not to rely solely on automated LLM-based evaluation and to avoid using task accuracy as an appropriate proxy for reasoning quality.", "authors": [ "Amogh Raina", "Ilias Chalkidis", "Daniel Hershcovich", "Henrik Palmer Olsen" ], "year": 2026, "published_date": "2026-08-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.17168", "pdf_url": "https://arxiv.org/pdf/2608.17168", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Info Extraction", "Legal AI", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.65, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Reasoning has become a standard technique and feature for contemporary LLMs; however, its application and quality in the context of demanding legal-oriented tasks, such as legal case forecasting, remain under explored. We investigate how LLMs reason in the context of legal case forecasting, using legal cases from the European Court of Human Rights (ECtHR) as a testbed.", "key_contribution": "We present our findings derived from assessing the model's responses with both human and LLM evaluation.", "why_it_matters": "Can LLMs Reason in a Legally Meaningful Manner? A Small-scale Study on European Court of Human Rights Cases represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present our findings derived from assessing the model's responses with both human and LLM evaluation.", "biggest_caveat": "however, its application and quality in the context of demanding legal-oriented tasks, such as legal case forecasting, remain under explored.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.17168", "difficulty": "beginner" }, { "id": "arxiv:2609.23758", "source": "arxiv", "source_type": "preprint", "title": "Training-Free Spectral Transductive Refinement for Cross-Domain Few-Shot Classification", "abstract": "Few-shot recognition with frozen visual features is especially fragile under domain shift and one-shot supervision, where a single labelled image is an unreliable estimate of its class. We ask how far this fragility can be reduced purely at test time, without retraining the encoder or augmenting the source domain. We present Spectral Transductive Refinement (STR), a training-free transductive inference rule that exploits the geometry of the complete support-query episode. Given frozen embeddings, STR builds a joint k-nearest-neighbour graph, maps the episode into a normalized-Laplacian spectral coordinate system, initializes class representatives from the labelled support, and iteratively refines them using pseudo-labelled queries. We evaluate STR under two protocols. A controlled component study with frozen ResNet-18 features shows that spectral refinement consistently improves over single-prototype spectral initialization across five shifted domains, with the largest gains in the one-shot regime where support estimates are weakest. We then benchmark STR against recent Cross-Domain Few-Shot Learning (CD-FSL) methods using the standard miniImageNet-pretrained ResNet-10 backbone over eight established target domains. Operating entirely at inference time, STR attains the highest 1-shot average among compared methods and remains competitive at 5-shot, rivalling approaches relying on heavy source-domain meta-training augmentations. Because STR is transductive, we report its setting explicitly. Diagnostics attribute its gains to iterative refinement in spectral coordinates rather than added prototype capacity, which remains inactive in our configuration.", "authors": [ "Fahim Rahman", "S. M. Tanjeeb Meheran Rohan", "Md. Taimum Ibne Sayed", "Asaduzzaman Herok", "Md. Bakhtiar Hasan" ], "year": 2026, "published_date": "2026-09-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.23758", "pdf_url": "https://arxiv.org/pdf/2609.23758", "citations": 0, "topics": [], "tags": [ "Prompting", "Evaluation", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.73, "content_potential_score": 2.34, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Few-shot recognition with frozen visual features is especially fragile under domain shift and one-shot supervision, where a single labelled image is an unreliable estimate of its class. We ask how far this fragility can be reduced purely at test time, without retraining the encoder or augmenting the source domain.", "key_contribution": "We present Spectral Transductive Refinement (STR), a training-free transductive inference rule that exploits the geometry of the complete support-query episode.", "why_it_matters": "Training-Free Spectral Transductive Refinement for Cross-Domain Few-Shot Classification advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We present Spectral Transductive Refinement (STR), a training-free transductive inference rule that exploits the…", "biggest_caveat": "bute its gains to iterative refinement in spectral coordinates rather than added prototype capacity, which remains inactive in our configuration.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2609.23758", "difficulty": "beginner" }, { "id": "arxiv:2509.20702", "source": "arxiv", "source_type": "preprint", "title": "Incorporating LLM Embeddings for Variation Across the Human Genome", "abstract": "Recent advances in large language model (LLM) embeddings have enabled powerful representations for biological data, but most applications to date focus on gene-level information. We present one of the first systematic frameworks to generate genetic variant-level embeddings across the entire human genome. Using curated annotations from FAVOR, ClinVar, and the GWAS Catalog, we construct functional text descriptions for 8.9 billion possible variants and generated embeddings at three scales: 1.5 million HapMap3/MEGA variants, 90 million imputed UK Biobank (UKB) variants, and 9 billion all possible variants. Embeddings were produced using general purpose models including both OpenAI's text-embedding-3-large and the open-source Qwen3-Embedding-0.6B models. Baseline quality control experiments demonstrate high predictive accuracy for variant-level properties, validating the embeddings as structured representations of genomic variation. We further apply them to real-world embedding-augmented genetic risk predictions that demonstrate the performance of using LLM embeddings in polygenic risk score (PRS) style predictions over the UK Biobank cohort data. These resources, publicly available on Hugging Face, provide a foundation for advancing large-scale genomic discovery and precision medicine.", "authors": [ "Hongqian Niu", "Jordan Bryan", "Jacob Williams", "Hufeng Zhou", "Zhun Deng", "Haoyu Zhang", "Xihao Li", "Didong Li" ], "year": 2026, "published_date": "2026-09-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.20702", "pdf_url": "https://arxiv.org/pdf/2509.20702", "citations": 0, "topics": [], "tags": [ "LLMs", "Biomedical AI", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.38, "content_potential_score": 0.55, "interestingness_score": 1.77, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent advances in large language model (LLM) embeddings have enabled powerful representations for biological data, but most applications to date focus on gene-level information. We present one of the first systematic frameworks to generate genetic variant-level embeddings across the entire human genome.", "key_contribution": "We present one of the first systematic frameworks to generate genetic variant-level embeddings across the entire human genome.", "why_it_matters": "Incorporating LLM Embeddings for Variation Across the Human Genome represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present one of the first systematic frameworks to generate genetic variant-level embeddings across the entire human…", "biggest_caveat": "but most applications to date focus on gene-level information.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2509.20702", "difficulty": "intermediate" }, { "id": "arxiv:2603.25099", "source": "arxiv", "source_type": "preprint", "title": "Large Language Models as Optimization Controllers: Adaptive Continuation for SIMP Topology Optimization", "abstract": "We present a framework in which a large language model (LLM) acts as an online adaptive controller for SIMP topology optimization, replacing conventional fixed-schedule continuation with real-time, state-conditioned parameter decisions. At every $k$-th iteration, the LLM receives a structured observation$-$current compliance, grayness index, stagnation counter, checkerboard measure, volume fraction, and budget consumption$-$and outputs numerical values for the penalization exponent $p$, projection sharpness $β$, filter radius $r_{\\min}$, and move limit $δ$ via a Direct Numeric Control interface. A hard grayness gate prevents premature binarization, and a meta-optimization loop uses a second LLM pass to tune the agent's call frequency and gate threshold across runs. We benchmark the agent against four baselines$-$fixed (no-continuation), standard three-field continuation, an expert heuristic, and a schedule-only ablation$-$on three 2-D problems (cantilever, MBB beam, L-bracket) at $120\\!\\times\\!60$ resolution and two 3-D problems (cantilever, MBB beam) at $40\\!\\times\\!20\\!\\times\\!10$ resolution, all run for 300 iterations. A standardized 40-iteration sharpening tail is applied from the best valid snapshot so that compliance differences reflect only the exploration phase. The LLM agent achieves the lowest final compliance on every benchmark: $-5.7\\%$ to $-18.1\\%$ relative to the fixed baseline, with all solutions fully binary. The schedule-only ablation underperforms the fixed baseline on two of three problems, confirming that the LLM's real-time intervention$-$not the schedule geometry$-$drives the gain. Code and reproduction scripts will be released upon publication.", "authors": [ "Shaoliang Yang", "Jun Wang", "Yunsheng Wang" ], "year": 2026, "published_date": "2026-05-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.25099", "pdf_url": "https://arxiv.org/pdf/2603.25099", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.04, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present a framework in which a large language model (LLM) acts as an online adaptive controller for SIMP topology optimization, replacing conventional fixed-schedule continuation with real-time, state-conditioned parameter decisions. At every $k$-th iteration, the LLM receives a structured observation$-$current compliance, grayness index, stagnation counter, checkerboard measure, volume fraction, and budget consumption$-$and outputs numerical values for the penalization exponent $p$, projection sharpness $β$, filter radius $r_{\\min}$, and move limit $δ$ via a Direct Numeric Control interface.", "key_contribution": "We present a framework in which a large language model (LLM) acts as an online adaptive controller for SIMP topology optimization, replacing conventional fixed-schedule continuation with real-time, state-conditioned parameter decisions.", "why_it_matters": "Large Language Models as Optimization Controllers: Adaptive Continuation for SIMP Topology Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a framework in which a large language model (LLM) acts as an online adaptive controller for SIMP topology…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2603.25099", "difficulty": "frontier" }, { "id": "arxiv:2609.24028", "source": "arxiv", "source_type": "preprint", "title": "When Evidence Conflicts: Reliability-aware Meta-review Generation", "abstract": "Generating coherent meta-reviews from multiple peer reviews is challenging when reviewer evidence conflicts and varies in reliability. Existing approaches typically formulate meta-review generation as a multi-document summarization task and aggregate reviewer feedback uniformly, making it difficult to determine which opinions should be prioritized under disagreement. In this paper, we study meta-review generation through reliability-aware evidence aggregation. Our framework first extracts aspect-level opinions from peer reviews and identifies conflicting evidence within each aspect. It then estimates opinion-level support and review-level quality to measure evidence reliability. Based on these signals, the framework assigns reliability-aware weights to reviewer feedback, enabling the generator to prioritize better-supported arguments while preserving diverse perspectives. Experiments demonstrate that our method consistently improves meta-review generation over strong baselines on both automatic and human evaluations, with clear gains in conflict recognition and resolution under high-conflict review scenarios. The code and implementation details are publicly available at https://github.com/Wangxz729/reliability-aware-meta-review.", "authors": [ "Xinzhe Wang", "Fei Tao", "Jiang Xie", "Hong Yu", "Ye Wang" ], "year": 2026, "published_date": "2026-09-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.24028", "pdf_url": "https://arxiv.org/pdf/2609.24028", "citations": 0, "topics": [], "tags": [ "Summarization", "Evaluation", "NLP" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, Summarization) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.51, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Generating coherent meta-reviews from multiple peer reviews is challenging when reviewer evidence conflicts and varies in reliability. Existing approaches typically formulate meta-review generation as a multi-document summarization task and aggregate reviewer feedback uniformly, making it difficult to determine which opinions should be prioritized under disagreement.", "key_contribution": "Experiments demonstrate that our method consistently improves meta-review generation over strong baselines on both automatic and human evaluations, with clear gains in conflict recognition and resolution under high-conflict review scenarios.", "why_it_matters": "When Evidence Conflicts: Reliability-aware Meta-review Generation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Summarization.", "one_line_takeaway": "Experiments demonstrate that our method consistently improves meta-review generation over strong baselines on both…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Summarization.", "url": "https://arxiv.org/abs/2609.24028", "difficulty": "beginner" }, { "id": "arxiv:2609.24089", "source": "arxiv", "source_type": "preprint", "title": "FlashBoB: I/O-Efficient Exact Backward-over-Backward for Softmax Attention", "abstract": "Transformer models built on the attention mechanism have become a central building block in modern deep learning, yet softmax attention remains a major bottleneck for long-context workloads. While FlashAttention makes the forward and first backward passes I/O-efficient, it does not support backward-over-backward (BoB), which enables exact differentiation through the backward pass for applications such as second-order optimization, test-time training, gradient-based memory, and meta-learning. Existing BoB implementations either materialize large intermediate tensors or exhaust GPU memory at long sequence lengths. We present FlashBoB, an exact, I/O-efficient algorithm for BoB in softmax attention that keeps computation within on-chip tiles and avoids all $N \\times N$ intermediate tensors, where $N$ is the sequence length. The key insight is a hierarchical affine structure in the softmax double backward: two row-wise scalars determine all outputs through affine transformations. This yields a two-pass schedule with bounded on-chip static random-access memory (SRAM) usage and minimal off-chip high-bandwidth memory (HBM) traffic. FlashBoB achieves $Θ(N^2 d^2/M)$ HBM traffic ($d$ is the head dimension and $M$ is the memory size) and, within the standard FlashAttention-style score-recomputation model, matches the inherited large-cache lower bound for exact forward attention. Empirically, it scales exact attention BoB to $N=262\\text{K}$ on a single A100 80GB GPU, where prior PyTorch exact baselines fail by $N=16\\text{K}$, and is up to $6.3\\times$ faster than FlashBack. These results make exact second-order attention practical at long-context sequence lengths where prior implementations cannot run efficiently.", "authors": [ "Anthony Givans", "Michael Crawshaw", "Mingrui Liu" ], "year": 2026, "published_date": "2026-09-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.24089", "pdf_url": "https://arxiv.org/pdf/2609.24089", "citations": 0, "topics": [], "tags": [ "Long Context", "Transformers", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.7, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Transformer models built on the attention mechanism have become a central building block in modern deep learning, yet softmax attention remains a major bottleneck for long-context workloads. While FlashAttention makes the forward and first backward passes I/O-efficient, it does not support backward-over-backward (BoB), which enables exact differentiation through the backward pass for applications such as second-order optimization, test-time training, gradient-based memory, and meta-learning.", "key_contribution": "We present FlashBoB, an exact, I/O-efficient algorithm for BoB in softmax attention that keeps computation within on-chip tiles and avoids all $N \\times N$ intermediate tensors, where $N$ is the sequence length.", "why_it_matters": "FlashBoB: I/O-Efficient Exact Backward-over-Backward for Softmax Attention represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Long Context.", "one_line_takeaway": "We present FlashBoB, an exact, I/O-efficient algorithm for BoB in softmax attention that keeps computation within…", "biggest_caveat": "cannot run efficiently.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Long Context.", "url": "https://arxiv.org/abs/2609.24089", "difficulty": "intermediate" }, { "id": "arxiv:2607.20116", "source": "arxiv", "source_type": "preprint", "title": "RIM: A Retrieval-In-Matching Framework for Cross-Domain Global Visual Localization of UAVs", "abstract": "Global visual localization of unmanned aerial vehicles (UAVs) using remote-sensing reference maps has attracted increasing attention. However, acquisition-time and imaging-platform differences between UAV and reference imagery induce substantial cross-domain appearance and viewpoint shifts, challenging robust six-degree-of-freedom (6-DoF) pose estimation. We address these shifts by sampling UAV-viewpoint reference views from Google 3D Tiles across locations, altitudes, and orientations. A two-stage cross-domain fine-tuning recipe adapts SALAD using pose-near positives and geographically distant hard negatives, while local geometric consistency re-ranks the Top-K candidates. We further propose Retrieval-In-Matching (RIM), which freezes the adapted DINOv2-B retriever and distils a local-descriptor decoder that reuses its token field alongside a shallow VGG19 detail stream. One query-side DINOv2-B forward thus serves both SALAD retrieval and local description, eliminating a second foundation-model backbone while preserving retrieval descriptors by construction. We evaluate RIM zero-shot on the reconstructed EPFL Urbanscape and self-collected Chang'an Park datasets, both geographically disjoint from the training data. RIM outperforms ten recent retrieval baseline families. At 25/50 m under the full 3D distance metric, it improves Recall@1 over SALAD by 8.55/13.77 percentage points on EPFL and 4.45/8.94 points on Park. At Top-K=5, the complete measured localization query, including retrieval, candidate matching, and robust geometric verification, takes 67.9 ms end-to-end: 1.8 times faster than the strongest separate sparse-matching baseline and over 40 times faster than RoMa, while achieving comparable re-ranking accuracy. These results establish an efficient and deployable pipeline for UAV global visual localization in GNSS-challenged environments.", "authors": [ "Xin Li", "Siyuan Duan", "Shang Wang", "Zhimin Mao", "Bingliang Hu", "Geng Zhang" ], "year": 2026, "published_date": "2026-07-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.20116", "pdf_url": "https://arxiv.org/pdf/2607.20116", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.04, "content_potential_score": 0.55, "interestingness_score": 1.77, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Global visual localization of unmanned aerial vehicles (UAVs) using remote-sensing reference maps has attracted increasing attention. However, acquisition-time and imaging-platform differences between UAV and reference imagery induce substantial cross-domain appearance and viewpoint shifts, challenging robust six-degree-of-freedom (6-DoF) pose estimation.", "key_contribution": "We further propose Retrieval-In-Matching (RIM), which freezes the adapted DINOv2-B retriever and distils a local-descriptor decoder that reuses its token field alongside a shallow VGG19 detail stream.", "why_it_matters": "RIM: A Retrieval-In-Matching Framework for Cross-Domain Global Visual Localization of UAVs advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We further propose Retrieval-In-Matching (RIM), which freezes the adapted DINOv2-B retriever and distils a…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2607.20116", "difficulty": "intermediate" }, { "id": "arxiv:2607.27245", "source": "arxiv", "source_type": "preprint", "title": "Enhancing Law-Enforcement Audio Transcription: A LoRA-Based Adaptation of Whisper for BWC Footage", "abstract": "Modern policing faces a \"visibility paradox\" where law enforcement agencies possess petabytes of Body-Worn Camera (BWC) footage that remains largely unutilized for accountability or systemic review due to the prohibitive labor costs of manual transcription. This research presents a framework for adapting the OpenAI Whisper architecture to the unique acoustic and linguistic challenges of the policing environment. By employing Parameter-Efficient Fine-Tuning (PEFT) through Low-Rank Adaptation (LoRA), we address the significant performance degradation observed in zero-shot models when confronted with high-stress scenarios, sirens, and radio interference. Crucially, we demonstrate that this adaptation is feasible on consumer-grade hardware (Acer Nitro local machine with NVIDIA 4GB GTX GPU) using 8-bit quantization and gradient checkpointing. We further integrate these transcriptions into a symbolic reasoning pipeline using a domain-specific ontology to transform raw audio into evidence-linked incident graphs, achieving a 93.7% lexicon mapping rate for the advancement of procedural justice and transparency.", "authors": [ "Vivek Senthil", "Zhiqiang Tao", "Ernest Fokoué" ], "year": 2026, "published_date": "2026-07-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.27245", "pdf_url": "https://arxiv.org/pdf/2607.27245", "citations": 0, "topics": [], "tags": [ "Reasoning", "Fine-Tuning", "Model Compression", "ASR", "Knowledge Graphs" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.23, "content_potential_score": 0.72, "interestingness_score": 1.86, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Modern policing faces a \"visibility paradox\" where law enforcement agencies possess petabytes of Body-Worn Camera (BWC) footage that remains largely unutilized for accountability or systemic review due to the prohibitive labor costs of manual transcription. This research presents a framework for adapting the OpenAI Whisper architecture to the unique acoustic and linguistic challenges of the policing environment.", "key_contribution": "Crucially, we demonstrate that this adaptation is feasible on consumer-grade hardware (Acer Nitro local machine with NVIDIA 4GB GTX GPU) using 8-bit quantization and gradient checkpointing.", "why_it_matters": "Enhancing Law-Enforcement Audio Transcription: A LoRA-Based Adaptation of Whisper for BWC Footage represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Crucially, we demonstrate that this adaptation is feasible on consumer-grade hardware (Acer Nitro local machine with…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2607.27245", "difficulty": "intermediate" }, { "id": "arxiv:2609.16535", "source": "arxiv", "source_type": "preprint", "title": "Multimodal Emergency Vehicle Classification via Audio-Visual Transformers and Knowledge Distillation", "abstract": "Emergency vehicle detection in autonomous driving is a safety-critical perception task that demands robustness under diverse and adverse real-world conditions. Existing approaches rely on a single modality, either audio or video, which leads to systematic failure when that modality is degraded: microphone-based systems fail in noisy urban environments, and camera-based systems fail at night or under occlusion. This report presents AVNet, a multimodal audio-visual transformer that classifies emergency vehicles (ambulance, fire engine, police car) and road background using both audio and video, while gracefully handling the absence of either modality at inference time. AVNet introduces three key contributions: (1) a temporally aligned cross-modal fusion module that performs second-level cross-attention between audio spectrogram tokens and video frame tokens, exploiting their exact temporal correspondence without any learned alignment mechanism; (2) learned null embeddings that substitute for missing modality tokens, enabling a single unified model to operate in audio-only, video-only, or joint audio-visual mode without retraining; and (3) a knowledge distillation training strategy in which specialist unimodal teacher models transfer inter-class dark knowledge into the multimodal student fusion branch via soft probability targets. Evaluated on 281 clips from the Google AudioSet dataset, AVNet achieves 66.6% overall accuracy in audio-visual mode, outperforming the audio-only branch by +10.4% and the video-only branch by +15.0%. The largest per-class gain is observed for the hardest class, Ambulance, where fusion achieves +29.5% over either unimodal branch alone, demonstrating that the two modalities provide complementary information that the aligned cross attention mechanism successfully exploits.", "authors": [ "Vijay John", "Amar Dabaja" ], "year": 2026, "published_date": "2026-09-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.16535", "pdf_url": "https://arxiv.org/pdf/2609.16535", "citations": 0, "topics": [], "tags": [ "AI Safety", "Multimodal", "Transformers", "Model Compression", "Multimedia" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.95, "content_potential_score": 2.34, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Emergency vehicle detection in autonomous driving is a safety-critical perception task that demands robustness under diverse and adverse real-world conditions. Existing approaches rely on a single modality, either audio or video, which leads to systematic failure when that modality is degraded: microphone-based systems fail in noisy urban environments, and camera-based systems fail at night or under occlusion.", "key_contribution": "Emergency vehicle detection in autonomous driving is a safety-critical perception task that demands robustness under diverse and adverse real-world conditions.", "why_it_matters": "Multimodal Emergency Vehicle Classification via Audio-Visual Transformers and Knowledge Distillation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "Emergency vehicle detection in autonomous driving is a safety-critical perception task that demands robustness under…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2609.16535", "difficulty": "advanced" }, { "id": "arxiv:2601.15486", "source": "arxiv", "source_type": "preprint", "title": "A Universal Large Language Model -- Drone Command and Control Interface", "abstract": "The use of artificial intelligence (AI) for drone control can have a transformative impact on drone capabilities, especially when real world information can be integrated with drone sensing, command, and control, part of a growing field of physical AI. Large language models (LLMs) can be advantageous if trained at scale on general knowledge, but especially and in particular when the training data includes information such as detailed map geography topology of the entire planet, as well as the ability to access real time situational data such as weather. However, challenges remain in the interface between drones and LLMs in general, with each application requiring a tedious, labor intensive effort to connect the LLM trained knowledge to drone command and control. Here, we solve that problem, using an interface strategy that is LLM agnostic and drone agnostic, providing the first universal, versatile, comprehensive and easy to use drone control interface. We do this using the new model context protocol (MCP) standard, an open standard that provides a universal way for AI systems to access external data, tools, and services. We develop and deploy a cloud based Linux machine hosting an MCP server that supports the Mavlink protocol, an ubiquitous drone control language used almost universally by millions of drones including Ardupilot and PX4 framework.We demonstrate flight control of a real unmanned aerial vehicle. In further testing, we demonstrate extensive flight planning and control capability in a simulated drone, integrated with a Google Maps MCP server for up to date, real time navigation information. This demonstrates a universal approach to integration of LLMs with drone command and control, a paradigm that leverages and exploits virtually all of modern AI industry with drone technology in an easy to use interface that translates natural language to drone control.", "authors": [ "Javier N. Ramos-Silva", "Peter J. Burke" ], "year": 2026, "published_date": "2026-05-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.15486", "pdf_url": "https://arxiv.org/pdf/2601.15486", "citations": 0, "topics": [], "tags": [ "LLMs", "Robotics" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.3, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The use of artificial intelligence (AI) for drone control can have a transformative impact on drone capabilities, especially when real world information can be integrated with drone sensing, command, and control, part of a growing field of physical AI. Large language models (LLMs) can be advantageous if trained at scale on general knowledge, but especially and in particular when the training data includes information such as detailed map geography topology of the entire planet, as well as the ability to access real time situational data such as weather.", "key_contribution": "We develop and deploy a cloud based Linux machine hosting an MCP server that supports the Mavlink protocol, an ubiquitous drone control language used almost universally by millions of drones including Ardupilot and PX4 framework.We demonstrate flight control of a real unmanned aerial vehicle.", "why_it_matters": "A Universal Large Language Model -- Drone Command and Control Interface represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We develop and deploy a cloud based Linux machine hosting an MCP server that supports the Mavlink protocol, an…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2601.15486", "difficulty": "frontier" }, { "id": "arxiv:2609.13224", "source": "arxiv", "source_type": "preprint", "title": "Seeing What the Vehicle Sees: Video-Augmented Virtual Reality for Physical Autonomous Vehicles", "abstract": "Autonomous vehicles are expected to improve road safety and efficiency, but passengers often remain uncertain about what the vehicle perceives and why it acts as it does. Virtual reality (VR) offers a safe and repeatable medium for presenting this information, yet most passenger-facing VR studies rely on fully simulated vehicles or pre-scripted scenarios, so the motion and perception shown to the user do not originate from a physically operating autonomous system. This paper presents a video-augmented VR framework that couples a physical ROS 2 autonomous robot vehicle to a Unity 6 application deployed on a Meta Quest 3S headset. The vehicle state and live onboard camera stream are transmitted over two independent communication channels, allowing the virtual vehicle to mirror the physical robot's motion while the passenger simultaneously views the vehicle's first-person camera feed and its navigation decisions through an in-vehicle dashboard interface. We evaluate the framework over 20 repeated closed-loop navigation trials. The system achieves a mean state-update latency of 29.63 ms, a mean relative route-progress error of 2.28% between the physical and virtual vehicles, and video delivery at 10.006 frames per second with 0.25% frame loss. All monitored navigation decisions were correctly reflected in the VR interface with no missed or incorrect notifications. The results indicate that the framework can support temporally synchronized, semantically consistent, and accurate route-progress representation for immersive observation of physical autonomous-vehicle behavior.", "authors": [ "Md Tanjemul Islam", "Mohammad Shafin", "Md Rafiul Kabir" ], "year": 2026, "published_date": "2026-08-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.13224", "pdf_url": "https://arxiv.org/pdf/2609.13224", "citations": 0, "topics": [], "tags": [ "Robotics", "Systems & Control" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.67, "content_potential_score": 0.84, "interestingness_score": 1.92, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Autonomous vehicles are expected to improve road safety and efficiency, but passengers often remain uncertain about what the vehicle perceives and why it acts as it does. Virtual reality (VR) offers a safe and repeatable medium for presenting this information, yet most passenger-facing VR studies rely on fully simulated vehicles or pre-scripted scenarios, so the motion and perception shown to the user do not originate from a physically operating autonomous system.", "key_contribution": "Autonomous vehicles are expected to improve road safety and efficiency, but passengers often remain uncertain about what the vehicle perceives and why it acts as it does.", "why_it_matters": "Seeing What the Vehicle Sees: Video-Augmented Virtual Reality for Physical Autonomous Vehicles represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "Autonomous vehicles are expected to improve road safety and efficiency, but passengers often remain uncertain about…", "biggest_caveat": "but passengers often remain uncertain about what the vehicle perceives and why it acts as it does.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2609.13224", "difficulty": "intermediate" }, { "id": "arxiv:2609.13548", "source": "arxiv", "source_type": "preprint", "title": "AutoTailor: Automatic, User-Aligned Capability Selection and Adaptation for Web Agents", "abstract": "Web agents can utilize reusable tools to reduce the cost and latency of low-level browser interaction, but automatically discovered tool collections can be large, redundant, and poorly aligned with user demand. We present AutoTailor, a meta-agentic framework for constructing and maintaining a compact set of trajectory-derived Model Context Protocol (MCP) APIs. Offline, AutoTailor converts web trajectories into parameterized browser-automation programs, applies a Quality Filter to remove APIs with unsuitable granularity and redundant functionality, and applies a Usage Likelihood Filter to prioritize broadly useful capabilities while preserving semantic coverage. Online, Dynamic Reselection monitors task outcomes and API usage, identifies recurring coverage gaps, adds relevant candidates, and prunes persistently unused capabilities. We evaluate AutoTailor on 106 WebArena Postmill tasks. Offline filtering reduces the initial 1,283 unrefined APIs to 87, and Dynamic Reselection produces a 33-API set. With reasoning and acting (ReAct) fallback, this set achieves 90.6% correctness, compared with 87.5% for ReAct alone, while reducing average total request-token cost by 57.8% and latency by 29.4%. Without ReAct, it achieves 60.1% correctness, marginally matching the performance of unrefined set, while reducing request-token usage by 94.9%. Together, these results show that static filtering produces a compact inventory of APIs expected to support core, high-likelihood tasks, while dynamic reselection further tailors that inventory to observed user needs. This combination improves accuracy and latency while sharply reducing token usage and end-to-end cost, demonstrating the value of user-aligned capability management for efficient web agents.", "authors": [ "Xinyun Cao", "Adriana Szekeres", "Fazle Elahi Faisal" ], "year": 2026, "published_date": "2026-09-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.13548", "pdf_url": "https://arxiv.org/pdf/2609.13548", "citations": 0, "topics": [], "tags": [ "Reasoning", "AI Agents", "Artificial Intelligence", "Software Engineering" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.71, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Web agents can utilize reusable tools to reduce the cost and latency of low-level browser interaction, but automatically discovered tool collections can be large, redundant, and poorly aligned with user demand. We present AutoTailor, a meta-agentic framework for constructing and maintaining a compact set of trajectory-derived Model Context Protocol (MCP) APIs.", "key_contribution": "We present AutoTailor, a meta-agentic framework for constructing and maintaining a compact set of trajectory-derived Model Context Protocol (MCP) APIs.", "why_it_matters": "AutoTailor: Automatic, User-Aligned Capability Selection and Adaptation for Web Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We present AutoTailor, a meta-agentic framework for constructing and maintaining a compact set of trajectory-derived…", "biggest_caveat": "but automatically discovered tool collections can be large, redundant, and poorly aligned with user demand.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2609.13548", "difficulty": "intermediate" }, { "id": "arxiv:2609.15096", "source": "arxiv", "source_type": "preprint", "title": "OpenAI4S: Code as Action, Science as Sessions", "abstract": "AI co-scientists could accelerate computational research, but over a long-running study the workflow also has to stay inspectable, resumable and reproducible, which requires persistent computational state and provenance. Here we present OpenAI4S, an open-source scientific research agent built around the principle of \\emph{Code as Action, Science as Sessions}. OpenAI4S combines a persistent computing runtime with research-session management: orchestration is handled through structured tool calls, while scientific actions are represented as complete code cells executed in persistent Python and R kernels. An append-only Action Ledger, per-cell execution records, versioned artifacts, environment records, and workspace checkpoints preserve how results were produced and support session recovery, branching, and extension. Configurable sandboxing, permission controls, and code and trajectory screening provide complementary safeguards. We evaluate OpenAI4S on 36 research scenarios spanning retrosynthesis, molecular dynamics, protein binder design, protein mutation, catalyst screening, and mineral spectroscopy, measuring scientific task accuracy, workflow completeness, and reproducibility of the resulting repositories. OpenAI4S achieves an overall score of 7.83, compared with 5.7--6.4 for a general-purpose coding harness evaluated with three frontier models, with the largest gains on long-horizon and computation-intensive workflows. These results suggest that integrating persistent execution with session-level provenance can improve the reliability of AI-assisted scientific workflows. Environment specification and full rerunnability remain weak for every evaluated system, ours included, so reproducibility is still an open problem for scientific agents. The system is available under the MIT license at \\href{https://github.com/PKU-YuanGroup/OpenAI4S}{github.com/PKU-YuanGroup/OpenAI4S}.", "authors": [ "Gongbo Zhang", "Hao Li", "Yu Wang", "Mujie Lin", "Liuzhenghao Lv", "Yicheng Mao", "Yimi Wang", "Jun Zhu", "Minhan Tang", "Zhengxiang Jiang", "Yusong Wang", "Jiayu Yao", "Kunpeng Ning", "Dawei Pang", "Yonghong Tian", "OpenAI4S Community", "Yuyang Liu", "Li Yuan" ], "year": 2026, "published_date": "2026-09-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.15096", "pdf_url": "https://arxiv.org/pdf/2609.15096", "citations": 0, "topics": [], "tags": [ "Biomedical AI", "Software Engineering", "Artificial Intelligence", "NLP" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.68, "content_potential_score": 0.55, "interestingness_score": 1.77, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "AI co-scientists could accelerate computational research, but over a long-running study the workflow also has to stay inspectable, resumable and reproducible, which requires persistent computational state and provenance. Here we present OpenAI4S, an open-source scientific research agent built around the principle of \\emph{Code as Action, Science as Sessions}.", "key_contribution": "Here we present OpenAI4S, an open-source scientific research agent built around the principle of \\emph{Code as Action, Science as Sessions}.", "why_it_matters": "OpenAI4S: Code as Action, Science as Sessions represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Biomedical AI.", "one_line_takeaway": "Here we present OpenAI4S, an open-source scientific research agent built around the principle of \\emph{Code as Action,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Biomedical AI.", "url": "https://arxiv.org/abs/2609.15096", "difficulty": "intermediate" }, { "id": "arxiv:2609.15561", "source": "arxiv", "source_type": "preprint", "title": "Can We Trust the Judges? Validation of Factuality Evaluation Methods via Answer Perturbation", "abstract": "Evaluating the factual correctness of large language models (LLMs) is vital for many applications. But are our evaluation tools themselves trustworthy? Despite the rise of factuality-based metrics, their sensitivity and reliability remain underexplored. This paper introduces a meta-evaluation framework that systematically tests these metrics using controlled corruptions of gold standard answers. Our method generates ranked outputs with known degrees of degradation to probe how metrics capture nuanced changes in truthfulness. Our experiments reveal that pipeline-based methods, such as the RAGAS's factual correctness metric, better track degradation than LLM-as-judge approaches. We also propose a new variant of the factual correctness metric that provides a competitive and cost-efficient.", "authors": [ "Sarra Gharsallah", "Adele Robaldo", "Mariia Tokareva", "Giovanni Gatti Pinheiro", "Ilyana Guendouz", "Raphaël Troncy", "Paolo Papotti", "Pietro Michiardi" ], "year": 2026, "published_date": "2026-09-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.15561", "pdf_url": "https://arxiv.org/pdf/2609.15561", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "Evaluation", "NLP" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.96, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Evaluating the factual correctness of large language models (LLMs) is vital for many applications. But are our evaluation tools themselves trustworthy?", "key_contribution": "We also propose a new variant of the factual correctness metric that provides a competitive and cost-efficient.", "why_it_matters": "Can We Trust the Judges? Validation of Factuality Evaluation Methods via Answer Perturbation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We also propose a new variant of the factual correctness metric that provides a competitive and cost-efficient.", "biggest_caveat": "But are our evaluation tools themselves trustworthy?", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.15561", "difficulty": "beginner" }, { "id": "arxiv:2609.12422", "source": "arxiv", "source_type": "preprint", "title": "Hierarchical Belief Modeling for Zero-Shot Opponent Adaptation in Partially Observable Multi-Agent Navigation", "abstract": "Lux AI Season 3 requires agents to act under partial observability, randomized episode level dynamics, and a best of five match structure that rewards both tactical execution and fast adaptation. We present HORIZON, a hierarchical agent that combines symmetry aware spatial perception, dual memory belief tracking, relic centric graph attention, information gain driven exploration, and an opponent conditioned policy mixture. HORIZON separates short horizon control from cross match meta reasoning, while auxiliary belief and world model objectives stabilize learning. Trained with PPO in a large scale JAX simulator, the resulting agent explicitly infers hidden game parameters and opponent style. Experiments show consistent gains in match win rate, episode win rate, adaptation gain, and league rating over strong recurrent and feed forward baselines.", "authors": [ "Kowei Shih", "Lu Cheng", "Zeyu Wang", "Yeyun Xu", "Kejian Tong" ], "year": 2026, "published_date": "2026-09-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.12422", "pdf_url": "https://arxiv.org/pdf/2609.12422", "citations": 0, "topics": [], "tags": [ "Reasoning", "Artificial Intelligence", "Multi-Agent Systems" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.9, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Lux AI Season 3 requires agents to act under partial observability, randomized episode level dynamics, and a best of five match structure that rewards both tactical execution and fast adaptation. We present HORIZON, a hierarchical agent that combines symmetry aware spatial perception, dual memory belief tracking, relic centric graph attention, information gain driven exploration, and an opponent conditioned policy mixture.", "key_contribution": "We present HORIZON, a hierarchical agent that combines symmetry aware spatial perception, dual memory belief tracking, relic centric graph attention, information gain driven exploration, and an opponent conditioned policy mixture.", "why_it_matters": "Hierarchical Belief Modeling for Zero-Shot Opponent Adaptation in Partially Observable Multi-Agent Navigation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We present HORIZON, a hierarchical agent that combines symmetry aware spatial perception, dual memory belief tracking,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2609.12422", "difficulty": "intermediate" }, { "id": "arxiv:2609.05814", "source": "arxiv", "source_type": "preprint", "title": "Towards Continuous Profiling and Optimization of Quantum-Classical Pipelines", "abstract": "Quantum applications increasingly execute as multi-stage quantum-classical pipelines, interleaving QPU computation with classical stages like circuit generation, transpilation, layout mapping, quantum error mitigation (QEM), and post-processing. These stages have diverse resource requirements and exhibit stochastic behavior under drifting hardware noises, yet existing workflow frameworks treat them as static, isolated components. We present LLQM (Low-Level Quantum Machine), a profiling-driven meta-framework for quantum-classical pipelines. LLQM decomposes pipelines into fine-grained tasks and continuously profiles their CPU/GPU, memory, QPU, and queue dependencies alongside real-time hardware states. This unified runtime abstraction captures cross-stage resource dependencies and reveals how classical and quantum decisions interact, enabling characterization of their impact on fidelity and resource consumption. We evaluate LLQM using QEM as a representative pipeline stage, on IBM 156-qubit Heron r2 processors with circuits up to 100 qubits and 1e7 transpiled gates. Our results show that continuous profiling exposes runtime bottlenecks and enables hardware-, fidelity-, and workload-aware optimizations.", "authors": [ "Ayush Bansal", "Owen Cochell", "Santiago Núñez-Corrales", "Marcos Frenkel", "Seetharami Seelam", "Apoorve Mohan", "Tianyin Xu" ], "year": 2026, "published_date": "2026-09-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.05814", "pdf_url": "https://arxiv.org/pdf/2609.05814", "citations": 0, "topics": [], "tags": [], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.17, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Quantum applications increasingly execute as multi-stage quantum-classical pipelines, interleaving QPU computation with classical stages like circuit generation, transpilation, layout mapping, quantum error mitigation (QEM), and post-processing. These stages have diverse resource requirements and exhibit stochastic behavior under drifting hardware noises, yet existing workflow frameworks treat them as static, isolated components.", "key_contribution": "We present LLQM (Low-Level Quantum Machine), a profiling-driven meta-framework for quantum-classical pipelines.", "why_it_matters": "Towards Continuous Profiling and Optimization of Quantum-Classical Pipelines represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about _default.", "one_line_takeaway": "We present LLQM (Low-Level Quantum Machine), a profiling-driven meta-framework for quantum-classical pipelines.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in this area.", "url": "https://arxiv.org/abs/2609.05814", "difficulty": "frontier" }, { "id": "arxiv:2609.11739", "source": "arxiv", "source_type": "preprint", "title": "LOCUS: Task-Aware Low-Rank Post-Training for Token-Efficient Language Generation", "abstract": "Large language model serving costs scale directly with output sequence length, yet standard preference alignment often inflates response verbosity without improving utility. We study whether the parameterization of post-training updates affects generation length: low-rank subspaces alter sequence length without modifying the alignment loss. We present LOCUS, a method that selects a task-aware low-rank adaptation subspace to minimize output-token cost subject to a utility constraint. Within this subspace, post-training retains the native preference objective with a frozen backbone. Across Anthropic HH-RLHF dialogue preferences, we evaluate two $\\sim$3B decoder backbones, Pythia-2.8B and Qwen2.5-3B, against protocol-matched full-parameter DPO and DrDPO branches and the released SamPO checkpoint. LOCUS reduces continuation length by up to 39.84\\% on Pythia-2.8B and by 14.87--17.58\\% on Qwen2.5-3B while updating only 0.24--0.28\\% of model parameters, with no material change in the internal preference diagnostic.", "authors": [ "Dongfang Zhao" ], "year": 2026, "published_date": "2026-09-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.11739", "pdf_url": "https://arxiv.org/pdf/2609.11739", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "AI Safety", "Dialogue", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety, RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.46, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language model serving costs scale directly with output sequence length, yet standard preference alignment often inflates response verbosity without improving utility. We study whether the parameterization of post-training updates affects generation length: low-rank subspaces alter sequence length without modifying the alignment loss.", "key_contribution": "We present LOCUS, a method that selects a task-aware low-rank adaptation subspace to minimize output-token cost subject to a utility constraint.", "why_it_matters": "LOCUS: Task-Aware Low-Rank Post-Training for Token-Efficient Language Generation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present LOCUS, a method that selects a task-aware low-rank adaptation subspace to minimize output-token cost subject…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.11739", "difficulty": "advanced" }, { "id": "arxiv:2609.09875", "source": "arxiv", "source_type": "preprint", "title": "AgentAudit: An Open, Extensible Framework for Full-Lifecycle Trust Evaluation of AI Agents", "abstract": "Existing evaluation frameworks mostly assess only one part of AI agents, such as task completion (AgentBench) or security robustness (AgentDojo, ASB), rather than the complete pipeline of planning, tool selection, tool execution, memory and reasoning. Failures can occur at any stage, yet existing benchmarks rarely identify their precise source. AgentAudit evaluates the entire execution trace across ten capability, grounding, security and behavioural dimensions, namely instruction integrity, planner, memory, tool selection, tool invocation, tool correctness, alignment, tool faithfulness, security and execution integrity, combined with behavioural classification and failure attribution to pinpoint the exact stage responsible for an observed failure. AgentAudit can evaluate any LLM-based AI agent, since it attaches to the agent instead of replacing it. It reads only the recorded execution trace and does not interfere with how the agent runs, so it places no constraint on the agent's internal implementation. We evaluate five language models (OpenAI GPT-5, Claude Sonnet 5, Sarvam 105B, Llama 3.3 70B and Gemini 2.5 Flash) across nine capability and adversarial tasks. Claude Sonnet 5 and GPT-5 obtain the highest mean Composite Trust Scores (95.1 and 80.6 out of 100, respectively), while Sarvam 105B, Llama 3.3 70B and Gemini 2.5 Flash trail substantially (57.6, 45.7 and 22.6). All traces were scored by a single fixed judge model, which was itself one of the evaluated models, a limitation discussed in Section VII.E. More importantly, models with similar task-completion behaviour can diverge sharply in trustworthiness, as several non-frontier models are repeatedly classified Unsafe_Compliance on adversarial tasks rather than merely failing them, a distinction that pass/fail benchmarks cannot surface.", "authors": [ "Shrey Nag", "Sachita", "Abhishek Kumar Singh", "Lipi Goel", "Rajeshwar Singh Janwar" ], "year": 2026, "published_date": "2026-09-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.09875", "pdf_url": "https://arxiv.org/pdf/2609.09875", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Hallucination", "AI Safety", "AI Agents" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.45, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Existing evaluation frameworks mostly assess only one part of AI agents, such as task completion (AgentBench) or security robustness (AgentDojo, ASB), rather than the complete pipeline of planning, tool selection, tool execution, memory and reasoning. Failures can occur at any stage, yet existing benchmarks rarely identify their precise source.", "key_contribution": "Existing evaluation frameworks mostly assess only one part of AI agents, such as task completion (AgentBench) or security robustness (AgentDojo, ASB), rather than the complete pipeline of planning, tool selection, tool execution, memory and reasoning.", "why_it_matters": "AgentAudit: An Open, Extensible Framework for Full-Lifecycle Trust Evaluation of AI Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Existing evaluation frameworks mostly assess only one part of AI agents, such as task completion (AgentBench) or…", "biggest_caveat": "bution to pinpoint the exact stage responsible for an observed failure.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.09875", "difficulty": "advanced" }, { "id": "arxiv:2601.02805", "source": "arxiv", "source_type": "preprint", "title": "The Perceptual Cost of Passthrough: How Video See-Through HMDs Degrade Human Visual Perception of Acuity, Contrast, and Color", "abstract": "Video see-through (VST) technology aims to seamlessly blend the virtual and physical worlds by reconstructing reality through cameras. However, while manufacturers promise high perceptual fidelity, it remains unclear how closely recent commercial VST systems preserve basic visual functions across environmental conditions. In this work, we present an end-to-end perceptual benchmark for three popular VST headsets: Apple Vision Pro, Meta Quest 3, and Meta Quest Pro. Using adapted psychophysical measures, we evaluated participants' visual acuity, contrast sensitivity, and color vision under both normal and low-light conditions, with naked-eye vision as the reference. Our results show measurable gaps between VST and naked-eye performance, especially for visual acuity and contrast sensitivity in low-light environments. By mapping these perceptual gaps across devices, visual functions, and lighting levels, this work provides a practical benchmark for current commercial VST capabilities and highlights where experience design or device optimization may need to compensate for perceptual loss.", "authors": [ "Jialin Wang", "Songming Ping", "Kemu Xu", "Yue Li", "Hai-Ning Liang" ], "year": 2026, "published_date": "2026-09-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.02805", "pdf_url": "https://arxiv.org/pdf/2601.02805", "citations": 0, "topics": [], "tags": [ "Evaluation", "Human-Computer Interaction", "Multimedia", "Computer Graphics" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.04, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Video see-through (VST) technology aims to seamlessly blend the virtual and physical worlds by reconstructing reality through cameras. However, while manufacturers promise high perceptual fidelity, it remains unclear how closely recent commercial VST systems preserve basic visual functions across environmental conditions.", "key_contribution": "In this work, we present an end-to-end perceptual benchmark for three popular VST headsets: Apple Vision Pro, Meta Quest 3, and Meta Quest Pro.", "why_it_matters": "The Perceptual Cost of Passthrough: How Video See-Through HMDs Degrade Human Visual Perception of Acuity, Contrast, and Color represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "In this work, we present an end-to-end perceptual benchmark for three popular VST headsets: Apple Vision Pro, Meta…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2601.02805", "difficulty": "beginner" }, { "id": "arxiv:2603.05617", "source": "arxiv", "source_type": "preprint", "title": "NOTAI.AI: Explainable Detection of Machine-Generated Text via Curvature and Feature Attribution", "abstract": "We present NotAI.AI, an explainable AI-generated text detection system. Instead of returning only a binary label or confidence score, the system shows which signals influenced the prediction and lets users inspect an attribution-based sensitivity estimate obtained by subtracting selected local contributions. NotAI.AI combines sentence-level conditional probability curvature, a neural detector score, and interpretable stylometric and readability features in an XGBoost meta-classifier. It explains predictions with TreeSHAP feature contributions and can turn the resulting evidence into a concise natural-language explanation. We evaluate the system on a category-balanced subset of RAID containing human-written, clean AI-generated, and attacked AI-generated texts. The full model outperforms variants based on individual feature families, reaching 0.9685 F1 on the held-out within-subset test split. In an automatic evaluation, two model judges rate 94.5-98.6\\% of generated explanations as faithful to the supplied detector evidence. The web interface (https://notai-ai.vercel.app), source code (https://github.com/Oleksandr-MB/EMNLP2026DEMO_NotAI.AI), and demonstration video(https://youtu.be/l8Nk8kdBTHQ) are publicly available.", "authors": [ "Oleksandr Marchenko Breneur", "Adelaide Danilov", "Aria Nourbakhsh", "Salima Lamsiyah" ], "year": 2026, "published_date": "2026-09-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.05617", "pdf_url": "https://arxiv.org/pdf/2603.05617", "citations": 0, "topics": [], "tags": [ "Interpretability", "Evaluation", "NLP" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.85, "content_potential_score": 1.26, "interestingness_score": 2.13, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present NotAI.AI, an explainable AI-generated text detection system. Instead of returning only a binary label or confidence score, the system shows which signals influenced the prediction and lets users inspect an attribution-based sensitivity estimate obtained by subtracting selected local contributions.", "key_contribution": "We present NotAI.AI, an explainable AI-generated text detection system.", "why_it_matters": "NOTAI.AI: Explainable Detection of Machine-Generated Text via Curvature and Feature Attribution represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Interpretability.", "one_line_takeaway": "We present NotAI.AI, an explainable AI-generated text detection system.", "biggest_caveat": "bution-based sensitivity estimate obtained by subtracting selected local contributions.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Interpretability.", "url": "https://arxiv.org/abs/2603.05617", "difficulty": "beginner" }, { "id": "arxiv:2609.04820", "source": "arxiv", "source_type": "preprint", "title": "Cost-Aware Hierarchical Multi-Agent Ransomware Detection and Family Attribution", "abstract": "Ransomware detection and family attribution require analysis of different modalities because it can use packing, obfuscation, process manipulation and runtime evasion techniques. However, conventional multimodal usually uses all available modalities for every sample resulting in unnecessary computational cost and increased latency. In this paper, we present a Cost Aware Hierarchical Multi-Agent System (HMAS) for adaptive ransomware detection. The proposed architecture organizes specialized agents into hierarchical domain controllers coordinated by a Meta Orchestrator. Static analysis is used as the initial low-cost modality while additional dynamic and memory modality is selectively used when confidence is insufficient or specialist agents exhibit disagreement. A cost model incorporates modality use and processing overhead. It enables the orchestration policy to balance analysis performance against computational cost. A locally deployed large language model provides verification for selected difficult cases without replacing the deterministic pipeline. Experimental evaluation compares adaptive HMAS with static only, static plus dynamic and exhaustive analysis policies across binary ransomware detection and multiclass family attribution. The complete HMAS achieved 96.57% accuracy, 0.96 F1-score and 0.99 ROC-AUC for binary detection. It also achieved 0.90 macro-F1 for family attribution. At the same time, the HMAS reduced average analysis cost by 43.97% relative to exhaustive analysis and substantially reduced average analysis latency except for the case where LLM is used. Routing analysis showed that 56.05% of cases were resolved using static evidence alone. Only 4.33% required the complete evidence pipeline. These findings demonstrate that adaptive HMAS can provide accuracy cost tradeoff for ransomware analysis while retaining support for heterogeneous and incomplete modalities.", "authors": [ "Mubashar Iqbal", "Asifullah Khan" ], "year": 2026, "published_date": "2026-09-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.04820", "pdf_url": "https://arxiv.org/pdf/2609.04820", "citations": 0, "topics": [], "tags": [ "LLMs", "Multimodal", "Robotics", "Artificial Intelligence", "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.4, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Ransomware detection and family attribution require analysis of different modalities because it can use packing, obfuscation, process manipulation and runtime evasion techniques. However, conventional multimodal usually uses all available modalities for every sample resulting in unnecessary computational cost and increased latency.", "key_contribution": "In this paper, we present a Cost Aware Hierarchical Multi-Agent System (HMAS) for adaptive ransomware detection.", "why_it_matters": "Cost-Aware Hierarchical Multi-Agent Ransomware Detection and Family Attribution represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this paper, we present a Cost Aware Hierarchical Multi-Agent System (HMAS) for adaptive ransomware detection.", "biggest_caveat": "bution require analysis of different modalities because it can use packing, obfuscation, process manipulation and runtime evasion techniques.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2609.04820", "difficulty": "intermediate" }, { "id": "arxiv:2609.05232", "source": "arxiv", "source_type": "preprint", "title": "Substrate-Aware AI Agents: Execution Context as a First-Class Input", "abstract": "Autonomous AI agents increasingly select actions in environments whose memory, execution-time, runtime, compute, and operational constraints determine what counts as a suitable plan. We call the absence of this execution context from an agent's planning state substrate blindness. We test this general proposition through numerical code generation, where selected implementation choices and operational consequences are directly observable. Three frontier model configurations--Anthropic Claude Opus 5, OpenAI GPT-5.6-Sol, and Google Gemini 3.7 Flash--generate code for a high-dimensional pairwise Euclidean-distance task either from the task alone or with a 128 MB RAM and 10.0 s wall-time contract. Contract disclosure reduced measured peak process memory in 13 of 14 executable index-aligned task-only versus contract-disclosed comparisons and reduced mean wall time in all three cohorts, making execution up to 3.1x faster. Across the audited corpus, disclosure produced structural code changes including bounded blocking, float32 retention, upper-triangle traversal, and in-place or memory-mapped buffers. At a tighter 96 MB contract, independently sampled contract-disclosed cohorts achieved correct-and-within-budget outcomes of 4/5 for Claude Opus 5, 5/5 for GPT-5.6-Sol, and 3/5 for Gemini 3.7 Flash, compared with task-only outcomes of 0/5, 1/5, and 0/5; cohort mean MaxRSS and wall time were 49-74% and 35-64% lower than their task-only references. These results establish a controlled proof of concept for substrate-aware agent planning: a minimal execution contract induces proactive structural adaptation in generated programs, shifting computation away from unconstrained allocations and substantially improving observed resource-time profiles before execution.", "authors": [ "Manu Agrawal" ], "year": 2026, "published_date": "2026-09-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.05232", "pdf_url": "https://arxiv.org/pdf/2609.05232", "citations": 0, "topics": [], "tags": [ "AI Agents", "Code Generation", "Artificial Intelligence" ], "paper_type": "dataset", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses proof and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.43, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Autonomous AI agents increasingly select actions in environments whose memory, execution-time, runtime, compute, and operational constraints determine what counts as a suitable plan. We call the absence of this execution context from an agent's planning state substrate blindness.", "key_contribution": "Autonomous AI agents increasingly select actions in environments whose memory, execution-time, runtime, compute, and operational constraints determine what counts as a suitable plan.", "why_it_matters": "Substrate-Aware AI Agents: Execution Context as a First-Class Input represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "Autonomous AI agents increasingly select actions in environments whose memory, execution-time, runtime, compute, and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2609.05232", "difficulty": "frontier" }, { "id": "arxiv:2609.02969", "source": "arxiv", "source_type": "preprint", "title": "Learning from Scarce Labels: Multi-View Echocardiography for Ejection Fraction Prediction", "abstract": "We present, to the best of our knowledge, the first publicly available resource for predicting left ventricular ejection fraction (EF) from parasternal long-axis (PLAX) echocardiography. Because no PLAX-EF datasets previously existed, our work focuses on an innovative data generation strategy to overcome this scarcity. By leveraging a time-based correlation between clinical notes and echocardiographic videos, combined with fine-tuning view classifiers and proxy labeling, we created a labeled dataset of over 25,000 PLAX videos. This enables us to train the first reproducible PLAX EF model, achieving a mean absolute error (MAE) of 6.86%. Given that apical four-chamber (A4C) methods, the clinical standard, report MAE values of 6%-7%, our results demonstrate that EF estimation from PLAX views is both feasible and clinically relevant. This surpasses the performance of existing methods and provides a clinically relevant solution for situations where apical views may not be feasible. Going further, we demonstrate that combining PLAX and A4C predictions via simple unweighted late fusion improves both single-view baselines to a 6.37% MAE, underscoring the value of multi-view integration. To promote continued research, we release the dataset labels, trained models, and runnable demos on GitHub, Hugging Face, and Google Colab: https://github.com/Jeffrey4899/PLAX_EF_Labels_202509", "authors": [ "Zhiyuan Gao", "Dominic Yurk", "Yaser S. Abu-Mostafa" ], "year": 2026, "published_date": "2026-09-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.02969", "pdf_url": "https://arxiv.org/pdf/2609.02969", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Biomedical AI", "Machine Learning", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.67, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present, to the best of our knowledge, the first publicly available resource for predicting left ventricular ejection fraction (EF) from parasternal long-axis (PLAX) echocardiography. Because no PLAX-EF datasets previously existed, our work focuses on an innovative data generation strategy to overcome this scarcity.", "key_contribution": "We present, to the best of our knowledge, the first publicly available resource for predicting left ventricular ejection fraction (EF) from parasternal long-axis (PLAX) echocardiography.", "why_it_matters": "Learning from Scarce Labels: Multi-View Echocardiography for Ejection Fraction Prediction advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We present, to the best of our knowledge, the first publicly available resource for predicting left ventricular…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2609.02969", "difficulty": "intermediate" }, { "id": "arxiv:2609.03156", "source": "arxiv", "source_type": "preprint", "title": "Compound Prompt Constraints in LLM Code Generation: A Factorial Study of Format, Persona, and Urgency", "abstract": "Large language models (LLMs) are increasingly used in software engineering pipelines for code generation, where production prompts often combine multiple constraints. This paper presents a full-factorial empirical study of how output formatting, persona assignment, and urgency framing jointly affect LLM code-generation reliability. We evaluate all 27 combinations in a controlled 3x3x3 design and decompose each compound condition into an additive prediction and a residual interaction term that captures super-additive degradation. The study uses all 164 HumanEval+ problems across five OpenAI models from the GPT-4o family, GPT-4.1 family, and o3-mini, yielding 22,140 greedy-decoding evaluations. A format-aware extraction pipeline separates formatting failures from reasoning failures, and significance is assessed with McNemar's test, odds ratios, and 95% confidence intervals. Results show that compound constraints can produce architecture-dependent degradation not predictable from single-factor experiments. The GPT-4o family exhibits consistent super-additive effects, with pass@1 reductions 3-12 percentage points beyond additive predictions; the largest interaction is -12.2 pp on GPT-4o-mini for JSON + expert persona + moderate urgency. JSON combinations generally produce larger interactions than XML. In contrast, the GPT-4.1 family is largely resistant, while o3-mini shows a qualitatively different pattern in which structured output constraints can improve performance. These findings show that vulnerability is architecture-dependent rather than size-dependent, that individually neutral or beneficial constraints can combine to cause substantial degradation, and that compound-prompt testing should be standard in reliability assessment for LLM-assisted engineering pipelines.", "authors": [ "Shrenik Jadhav", "Nickalsa LaPlaca", "Caleb Stone", "Ashok Raja", "Omar Ochoa", "Vidhyashree Nagaraju" ], "year": 2026, "published_date": "2026-09-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.03156", "pdf_url": "https://arxiv.org/pdf/2609.03156", "citations": 0, "topics": [], "tags": [ "Reasoning", "Code Generation", "Software Engineering" ], "paper_type": "empirical", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.67, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models (LLMs) are increasingly used in software engineering pipelines for code generation, where production prompts often combine multiple constraints. This paper presents a full-factorial empirical study of how output formatting, persona assignment, and urgency framing jointly affect LLM code-generation reliability.", "key_contribution": "Results show that compound constraints can produce architecture-dependent degradation not predictable from single-factor experiments.", "why_it_matters": "Compound Prompt Constraints in LLM Code Generation: A Factorial Study of Format, Persona, and Urgency represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Results show that compound constraints can produce architecture-dependent degradation not predictable from…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2609.03156", "difficulty": "intermediate" }, { "id": "arxiv:2608.27465", "source": "arxiv", "source_type": "preprint", "title": "The Effect of Emotional Context on Large Language Models' Endorsement of Premature Decisions: Comparing Emotional Vulnerability Across Six Commercial Models", "abstract": "As large language models (LLMs) are increasingly used for everyday decision-making advice, whether a model shifts the direction of its advice according to the user's emotional state has become an important safety problem. We test whether emotional expression increases a model's endorsement (encouragement to proceed) when a user, holding the same objective information, is overconfident about a premature decision (e.g., quitting a stable job on weak evidence). As a key control, we include a no-emotion multi-turn (neutral) condition that holds factual content and the number of conversational turns constant, isolating the effect of emotion from that of conversation length. We exposed six commercial models (top-tier and mid-tier models from OpenAI, Anthropic, and Google) to three scenarios (career change, business expansion, emigration) across three conditions (cold/neutral/distress) with six repetitions each, yielding 324 conversations, and measured endorsement strength (0-100) via an eight-item rubric-based automated scoring. Emotional expression significantly increased endorsement (neutral 18.6 to distress 31.5, +12.9 points; mixed-effects $β= +12.9$, $p < .001$; Cohen's d = 0.51), and this was not explained by conversation length (cold-neutral difference non-significant, $p = .083$). Critically, the vulnerability varied by individual model rather than by price tier: five of six models showed a significant emotion effect, including the top-tier flagships Gemini 3.1 Pro and GPT-5.5, while only Claude Opus showed no significant change. Results were reproduced with an independent non-Google judge model ($ρ= .89$) and agreed in rank with two human coders ($ρ= .70$). Through a controlled design that separates emotion from conversational context, we show that emotional context increases LLM sycophancy even in top-tier flagship models.", "authors": [ "Cheolho Shin", "Yoojin Han", "Donghun Shin", "Kunho Lee" ], "year": 2026, "published_date": "2026-07-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.27465", "pdf_url": "https://arxiv.org/pdf/2608.27465", "citations": 0, "topics": [], "tags": [ "LLMs", "Dialogue", "Artificial Intelligence", "NLP", "Human-Computer Interaction" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.23, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "As large language models (LLMs) are increasingly used for everyday decision-making advice, whether a model shifts the direction of its advice according to the user's emotional state has become an important safety problem. We test whether emotional expression increases a model's endorsement (encouragement to proceed) when a user, holding the same objective information, is overconfident about a premature decision (e.g., quitting a stable job on weak evidence).", "key_contribution": "Through a controlled design that separates emotion from conversational context, we show that emotional context increases LLM sycophancy even in top-tier flagship models.", "why_it_matters": "The Effect of Emotional Context on Large Language Models' Endorsement of Premature Decisions: Comparing Emotional Vulnerability Across Six Commercial Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Through a controlled design that separates emotion from conversational context, we show that emotional context…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.27465", "difficulty": "intermediate" }, { "id": "arxiv:2608.24199", "source": "arxiv", "source_type": "preprint", "title": "NVIDIA Cosmos-H-Dreams: Real-Time Generative Physics Simulation for Surgical Robotics", "abstract": "Generative simulation for surgical robotics still lacks real-time interaction. Physical-robot experiments, often involving animal or cadaver labs, are time-consuming, costly, and difficult to reproduce, while classical simulators struggle to capture photorealistic appearance and deformable-tissue dynamics. We address this gap with Cosmos-H-Dreams, an integrated real-time surgical world-model system combining an action-conditioned generative model, a teacher-to-student distillation recipe, and a deployment stack built on the NVIDIA FlashDreams streaming-inference library. Starting from Cosmos-H-Surgical-Simulator, a multi-embodiment action-conditioned surgical video world model fine-tuned on the large-scale Open-H-Embodiment corpus, we post-train this checkpoint on embodiment- and procedure-specific data. By distilling the resulting bidirectional teacher into a causal, few-step student with Self Forcing, we turn a passive video generator into a controllable surgical simulator that streams at $\\sim$160 inference FPS on a single NVIDIA RTX PRO 6000 Blackwell workstation GPU. Crucially, Cosmos-H-Dreams is controller-agnostic: any interface that emits a stream of robot kinematics can drive it. We demonstrate live control through a browser keyboard over WebRTC, a Meta Quest headset over WebXR, a commercial surgical robot console such as CMR Surgical's Versius, and learned policies operating in closed loop. To our knowledge, this is the first interactive surgical world model supporting live human and policy control. Human operators and policies alike can act inside the synthesized world and observe the consequences in real time. We release Cosmos-H-Dreams as an open surgical simulation system, providing a common foundation for surgical education, scalable synthetic data generation, and future intraoperative decision support.", "authors": [ "Javier Gamazo Tejero", "Lukas Zbinden", "Keyur Sheth", "Raghavendra K M", "Nadim Daher", "Diego Granero Maraña", "Filip Binkiewicz", "Patrick Thornycroft", "Mahdi Azizian", "Sean D. Huver" ], "year": 2026, "published_date": "2026-08-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.24199", "pdf_url": "https://arxiv.org/pdf/2608.24199", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Robotics" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.23, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Generative simulation for surgical robotics still lacks real-time interaction. Physical-robot experiments, often involving animal or cadaver labs, are time-consuming, costly, and difficult to reproduce, while classical simulators struggle to capture photorealistic appearance and deformable-tissue dynamics.", "key_contribution": "We demonstrate live control through a browser keyboard over WebRTC, a Meta Quest headset over WebXR, a commercial surgical robot console such as CMR Surgical's Versius, and learned policies operating in closed loop.", "why_it_matters": "NVIDIA Cosmos-H-Dreams: Real-Time Generative Physics Simulation for Surgical Robotics represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We demonstrate live control through a browser keyboard over WebRTC, a Meta Quest headset over WebXR, a commercial…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2608.24199", "difficulty": "intermediate" }, { "id": "arxiv:2608.25666", "source": "arxiv", "source_type": "preprint", "title": "PRISM: Projection-Integrated Sampling-Based MPC with Bayesian Cost Tuning for Bimanual Manipulation", "abstract": "Bimanual manipulation in cluttered, contact-rich environments remains challenging because it requires coordinated motion generation, interaction-aware planning, and reliable execution under tight kinematic constraints. We present PRISM, a projection-integrated sampling-based Model Predictive Control (MPC) framework that uses a GPU-accelerated physics simulator as an online world model for complex dual-arm manipulation. The main algorithmic contribution is a QP-guided control sampling strategy that decouples trajectory exploration from kinematic feasibility. At each MPC step, sampled joint-velocity trajectories are projected onto the set of motions satisfying joint position, velocity, acceleration, and jerk bounds, together with an initial-velocity boundary condition, before rollout evaluation. This enables broad yet feasible exploration of coordinated bimanual behaviors. To support efficient online execution, we derive a custom ADMM/Bregman-splitting QP solver that exploits joint-wise separability and reusable matrix factorizations. We further use Bayesian optimization to tune task-cost weights offline, reducing manual parameter selection. We evaluate PRISM on challenging variants of PerAct$^{2}$ tasks, including obstacle-constrained ball transport, tray transport, cube handover, and box lifting. Experiments show improved robustness and task success relative to representative sampling-based baselines, while maintaining real-time or near-real-time execution. We also demonstrate successful sim-to-real transfer on dual UR5e manipulators, highlighting the practical potential of physics-based online planning for contact-rich bimanual manipulation. Project details, including code and supplementary videos, are available at \\href{https://sites.google.com/view/prismbimanual}{\\texttt{https://sites.google.com/view/prismbimanual}}.", "authors": [ "Alinjar Dan", "Iryna Hurova", "Karl Kruusamäe", "Arun Kumar Singh" ], "year": 2026, "published_date": "2026-08-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.25666", "pdf_url": "https://arxiv.org/pdf/2608.25666", "citations": 0, "topics": [], "tags": [ "Robotics" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.49, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Bimanual manipulation in cluttered, contact-rich environments remains challenging because it requires coordinated motion generation, interaction-aware planning, and reliable execution under tight kinematic constraints. We present PRISM, a projection-integrated sampling-based Model Predictive Control (MPC) framework that uses a GPU-accelerated physics simulator as an online world model for complex dual-arm manipulation.", "key_contribution": "We present PRISM, a projection-integrated sampling-based Model Predictive Control (MPC) framework that uses a GPU-accelerated physics simulator as an online world model for complex dual-arm manipulation.", "why_it_matters": "PRISM: Projection-Integrated Sampling-Based MPC with Bayesian Cost Tuning for Bimanual Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We present PRISM, a projection-integrated sampling-based Model Predictive Control (MPC) framework that uses a…", "biggest_caveat": "bution is a QP-guided control sampling strategy that decouples trajectory exploration from kinematic feasibility.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2608.25666", "difficulty": "frontier" }, { "id": "arxiv:2608.24060", "source": "arxiv", "source_type": "preprint", "title": "SQLite is Enough. Lexical, Semantic, and Hybrid Search with scrydb", "abstract": "This work introduces scrydb, a Python library that enables lexical, semantic, and hybrid search within SQLite. For lexical search, scrydb leverages SQLite's full-text search extension FTS5. Semantic search builds on sqlite-vec, a SQLite extension for vector search. Furthermore, the library allows users to rerank and fuse retrieval results to combine both lexical and semantic approaches, providing a lightweight solution for downstream tasks in information retrieval (IR) or agentic search. We evaluate scrydb on various IR benchmark datasets and demonstrate its effectiveness in text retrieval based on keyword matching, semantic similarity, and rank fusion. In addition, we provide insights into query latency and the trade-off between efficiency and effectiveness. scrydb is available under the MIT license.", "authors": [ "Timo Breuer" ], "year": 2026, "published_date": "2026-08-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.24060", "pdf_url": "https://arxiv.org/pdf/2608.24060", "citations": 0, "topics": [], "tags": [ "AI Agents", "IR", "Evaluation", "Embeddings", "Databases" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.91, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This work introduces scrydb, a Python library that enables lexical, semantic, and hybrid search within SQLite. For lexical search, scrydb leverages SQLite's full-text search extension FTS5.", "key_contribution": "We evaluate scrydb on various IR benchmark datasets and demonstrate its effectiveness in text retrieval based on keyword matching, semantic similarity, and rank fusion.", "why_it_matters": "SQLite is Enough. Lexical, Semantic, and Hybrid Search with scrydb represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "We evaluate scrydb on various IR benchmark datasets and demonstrate its effectiveness in text retrieval based on…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2608.24060", "difficulty": "beginner" }, { "id": "arxiv:2608.24727", "source": "arxiv", "source_type": "preprint", "title": "Parameter-Efficient Self-Supervised Adaptation for EEG-FM under Fixed Computational Budgets", "abstract": "EEG foundation models pretrained via self-supervised learning promise transferable representations, but their generalization remains limited, especially across diverse clinical datasets. Full fine-tuning is impractical for resource-constrained clinical settings due to high computational requirements. In this work, we investigate whether parameter-efficient self-supervised adaptation, updating only 9% of parameters suffices to align representations to target tasks. We evaluate our method on two state-of-the-art models with different pretraining objectives: BIOT (contrastive) and CBraMod (masked reconstruction), and evaluate on three clinical EEG datasets for abnormality detection (TUAB), event classification (TUEV), and seizure detection (CHB-MIT) under both in-distribution and out-of-distribution conditions. SSL adaptation yields consistent gains over linear probing, up to 20x AUCPR. Under a fixed compute budget, peak performance requires only 20--50% of available unlabeled data. Critically, when total window count is fixed, performance remains invariant to patient count, suggesting that performance is dependent on overall temporal window diversity only. Our findings demonstrate that parameter-efficient adaptation enables effective deployment of EEG Foundation models (EEG-FM) with minimal computational overhead and data collection burden. Code available at: https://github.com/c3n-group/efficient-eeg-adapt", "authors": [ "Meghal Dani", "Stefanie Liebe" ], "year": 2026, "published_date": "2026-08-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.24727", "pdf_url": "https://arxiv.org/pdf/2608.24727", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Self-Supervised", "Biomedical AI", "Artificial Intelligence", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Uses self-supervised — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.96, "content_potential_score": 1.92, "interestingness_score": 2.46, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "EEG foundation models pretrained via self-supervised learning promise transferable representations, but their generalization remains limited, especially across diverse clinical datasets. Full fine-tuning is impractical for resource-constrained clinical settings due to high computational requirements.", "key_contribution": "Our findings demonstrate that parameter-efficient adaptation enables effective deployment of EEG Foundation models (EEG-FM) with minimal computational overhead and data collection burden.", "why_it_matters": "Parameter-Efficient Self-Supervised Adaptation for EEG-FM under Fixed Computational Budgets represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "Our findings demonstrate that parameter-efficient adaptation enables effective deployment of EEG Foundation models…", "biggest_caveat": "but their generalization remains limited, especially across diverse clinical datasets.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2608.24727", "difficulty": "advanced" }, { "id": "arxiv:2608.24738", "source": "arxiv", "source_type": "preprint", "title": "TorchMorph: CUDA-accelerated Morphological Transforms", "abstract": "Morphological transforms are long-standing tools for shape and mask processing, but the de facto reference implementation in the Python ecosystem, i.e. scipy.ndimage, is CPU-only, single-array, and therefore unusable inside a GPU training loop without an expensive device-to-host round trip. GPU vision libraries built on PyTorch cover a narrow subset of these operators, typically restricted to two spatial dimensions and flat structuring elements. We present TorchMorph, a lightweight PyTorch extension that closes this gap. TorchMorph exposes 22 public operators covering binary morphology, greyscale morphology, exact and approximate distance transforms, and entropy-regularised optimal transport, all implemented as fused CUDA kernels that operate directly on (B, C, Spatial...) CUDA tensors with up to eight spatial dimensions. The API deliberately mirrors scipy.ndimage argument-for-argument, including border modes, structuring-element origins and pre-allocated outputs, so that existing pipelines port with a change of import. We describe the layered architecture and the kernel designs behind each operator family. Against single-threaded CPU references, batched execution reaches up to 1.1e3 times the throughput of scipy.ndimage on greyscale morphology and up to 350x on exact Euclidean distance transforms, while the Sinkhorn solver runs up to 42x faster than POT. Binary and chamfer operators reproduce their SciPy counterparts exactly, and every float-valued operator agrees with the CPU reference to within 1.8e-6 absolute error. TorchMorph is released under the MIT licence at https://intcomp.github.io/tm.", "authors": [ "Kai Zhao" ], "year": 2026, "published_date": "2026-08-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.24738", "pdf_url": "https://arxiv.org/pdf/2608.24738", "citations": 0, "topics": [], "tags": [ "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.62, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Morphological transforms are long-standing tools for shape and mask processing, but the de facto reference implementation in the Python ecosystem, i.e. scipy.ndimage, is CPU-only, single-array, and therefore unusable inside a GPU training loop without an expensive device-to-host round trip.", "key_contribution": "We present TorchMorph, a lightweight PyTorch extension that closes this gap.", "why_it_matters": "TorchMorph: CUDA-accelerated Morphological Transforms advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Computer Vision.", "one_line_takeaway": "We present TorchMorph, a lightweight PyTorch extension that closes this gap.", "biggest_caveat": "but the de facto reference implementation in the Python ecosystem, i.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Computer Vision.", "url": "https://arxiv.org/abs/2608.24738", "difficulty": "intermediate" }, { "id": "arxiv:2608.22048", "source": "arxiv", "source_type": "preprint", "title": "More Accurate or More Efficient? Evaluating Locally Deployed Compact Open-Weight Language Models for Mathematical Reasoning", "abstract": "Large language models are increasingly deployed on local hardware for privacy, cost, and accessibility reasons. Yet many evaluations emphasize accuracy while fewer quantify local runtime and energy, characterize failure modes, or apply paired statistical comparisons under controlled conditions. This paper presents a controlled, documented procedure for evaluating locally hosted LLMs on mathematical reasoning. It combines fixed inference settings, hierarchical answer extraction and verification, explicit failure-mode classification, and per-question resource measurement, and reports accuracy with paired significance tests and effect sizes. We demonstrate it in a preliminary study of three compact open-weight models under five billion parameters, Gemma3:4b (Google), Phi3:3.8b (Microsoft), and Qwen3:4b (Alibaba), across datasets spanning Grade 8 Math, Calculus I, and Advanced Probability and Statistics. All models ran through the same local inference server on one workstation, using a shared prompt template, controlled settings, and a matched question set per dataset. No single model dominates. Qwen3:4b is most accurate on two datasets and Gemma3:4b on Calculus I, yet Gemma3:4b returns roughly three times more correct answers per watt-hour than Qwen3:4b on every dataset while generating far fewer output tokens; Qwen3:4b requires substantially more generation time, energy, and output per question. Phi3:3.8b is substantially less accurate on all three datasets; its low extraction-failure rate indicates incorrect answers rather than unparsed output, though we caveat possible prompt-format effects. These preliminary findings indicate that accuracy alone is an insufficient basis for selecting a local model.", "authors": [ "Orion Powers", "Daniella Seum", "Khaled Slhoub" ], "year": 2026, "published_date": "2026-08-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.22048", "pdf_url": "https://arxiv.org/pdf/2608.22048", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Artificial Intelligence" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.86, "content_potential_score": 2.34, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models are increasingly deployed on local hardware for privacy, cost, and accessibility reasons. Yet many evaluations emphasize accuracy while fewer quantify local runtime and energy, characterize failure modes, or apply paired statistical comparisons under controlled conditions.", "key_contribution": "We demonstrate it in a preliminary study of three compact open-weight models under five billion parameters, Gemma3:4b (Google), Phi3:3.8b (Microsoft), and Qwen3:4b (Alibaba), across datasets spanning Grade 8 Math, Calculus I, and Advanced Probability and Statistics.", "why_it_matters": "More Accurate or More Efficient? Evaluating Locally Deployed Compact Open-Weight Language Models for Mathematical Reasoning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We demonstrate it in a preliminary study of three compact open-weight models under five billion parameters, Gemma3:4b…", "biggest_caveat": "caveat possible prompt-format effects.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.22048", "difficulty": "intermediate" }, { "id": "arxiv:2607.08756", "source": "arxiv", "source_type": "preprint", "title": "MulTTiPop: A Multitrack Transcription Dataset for Pop Music", "abstract": "We present MulTTiPop, a dataset of pop music segments and their associated multitrack MIDI recordings for the evaluation of automatic music transcription models. MulTTiPop contains 572 segments of popular music totaling 3.5 hours of audio, and contains songs from diverse genres and decades from the 1930s to 2000s. To collect this dataset, we perform metadata-based matching on song segments from the Lakh MIDI and TheoryTab datasets, manually identify an anchor beat between the audio and MIDI, then use beat tracking on the audio and warp the MIDI to match its tempo and timing. We evaluate state-of-the-art automatic music transcription models on MulTTiPop and find substantial room for improvement, with the best model achieving 38% Onset F1. More details and sound examples of MulTTiPop are available at https://gclef-cmu.org/multtipop.", "authors": [ "Nathan Pruyne", "Benjamin Stoler", "William Chen", "Chien-yu Huang", "Shinji Watanabe", "Chris Donahue" ], "year": 2026, "published_date": "2026-07-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.08756", "pdf_url": "https://arxiv.org/pdf/2607.08756", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.47, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present MulTTiPop, a dataset of pop music segments and their associated multitrack MIDI recordings for the evaluation of automatic music transcription models. MulTTiPop contains 572 segments of popular music totaling 3.5 hours of audio, and contains songs from diverse genres and decades from the 1930s to 2000s.", "key_contribution": "We present MulTTiPop, a dataset of pop music segments and their associated multitrack MIDI recordings for the evaluation of automatic music transcription models.", "why_it_matters": "MulTTiPop: A Multitrack Transcription Dataset for Pop Music represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "We present MulTTiPop, a dataset of pop music segments and their associated multitrack MIDI recordings for the…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Machine Learning.", "url": "https://arxiv.org/abs/2607.08756", "difficulty": "intermediate" }, { "id": "arxiv:2608.17108", "source": "arxiv", "source_type": "preprint", "title": "A Multiplication-Free Feature Extractor for Signal Classification: Keyword Spotting Case Study", "abstract": "A very low complexity feature extractor called next iRDT is proposed and evaluated for the problem of keyword spotting (KWS). Unlike any other types of feature extractors including the widely used MFCC, or adaptive, CNN-based ones, our algorithm is multiplier-free and it employs only simple, energy-efficient arithmetic operators. Since keyword-spotting of speech commands (KWS) is a typical application for TinyML platforms requiring low complexity for the signal classification chain, we consider it as a case study to evaluate complexity and functional performance. If properly tuned, iRDT demonstrates similar accuracy to solutions based on MFCC or CNN-based extractors using baseline classifiers on Google's KWS 12-classes dataset. With a different classifier the system achieved 94.7% validation accuracy. Processing times on CPU for the proposed feature extractor, are at least one order of magnitude smaller than for the MFCC. The proposed algorithm has a very low hardware footprint, making it ideal for ultra-low power edge devices. Code and demo are available [18].", "authors": [ "Radu Dogaru", "Ioana Dogaru" ], "year": 2026, "published_date": "2026-08-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.17108", "pdf_url": "https://arxiv.org/pdf/2608.17108", "citations": 0, "topics": [], "tags": [ "Human-Computer Interaction" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.64, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "A very low complexity feature extractor called next iRDT is proposed and evaluated for the problem of keyword spotting (KWS). Unlike any other types of feature extractors including the widely used MFCC, or adaptive, CNN-based ones, our algorithm is multiplier-free and it employs only simple, energy-efficient arithmetic operators.", "key_contribution": "A very low complexity feature extractor called next iRDT is proposed and evaluated for the problem of keyword spotting (KWS).", "why_it_matters": "A Multiplication-Free Feature Extractor for Signal Classification: Keyword Spotting Case Study represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Human-Computer Interaction.", "one_line_takeaway": "A very low complexity feature extractor called next iRDT is proposed and evaluated for the problem of keyword spotting…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Human-Computer Interaction.", "url": "https://arxiv.org/abs/2608.17108", "difficulty": "intermediate" }, { "id": "arxiv:2510.16371", "source": "arxiv", "source_type": "preprint", "title": "Cataract-LMM Large-Scale Multi-Source Multi-Task Benchmark for Deep Learning in Surgical Video Analysis", "abstract": "The development of computer-assisted surgery systems relies on large-scale, annotated datasets. Existing cataract surgery resources lack the diversity and annotation depth required to train generalizable deep-learning models. To address this gap, we present a dataset of 3,000 phacoemulsification cataract surgery videos acquired at two surgical centers from surgeons with varying expertise. The dataset provides four annotation layers: temporal surgical phases, instance segmentation of instruments and anatomical structures, instrument-tissue interaction tracking, and quantitative skill scores based on competency rubrics adapted from ICO-OSCAR and GRASIS. We demonstrate the technical utility of the dataset through benchmarking deep learning models across four tasks: workflow recognition, scene segmentation, instrument-tissue interaction tracking, and automated skill assessment. Furthermore, we establish a domain-adaptation baseline for phase recognition and instance segmentation by training on one surgical center and evaluating on a held-out center. Ultimately, these multi-source acquisitions, multi-layer annotations, and paired skill-kinematic labels facilitate the development of generalizable multi-task models for surgical workflow analysis, scene understanding, and competency-based training research. The dataset and annotations are available in Google Form (https://docs.google.com/forms/d/e/1FAIpQLSfmyMAPSTGrIy2sTnz0-TMw08ZagTimRulbAQcWdaPwDy187A/viewform?usp=dialog).", "authors": [ "Mohammad Javad Ahmadi", "Iman Gandomi", "Parisa Abdi", "Seyed-Farzad Mohammadi", "Amirhossein Taslimi", "Mehdi Khodaparast", "Hassan Hashemi", "Mahdi Tavakoli", "Hamid D. Taghirad" ], "year": 2026, "published_date": "2026-04-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.16371", "pdf_url": "https://arxiv.org/pdf/2510.16371", "citations": 0, "topics": [], "tags": [ "Object Detection", "Evaluation", "Artificial Intelligence", "Machine Learning", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Uses multi-task — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.96, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The development of computer-assisted surgery systems relies on large-scale, annotated datasets. Existing cataract surgery resources lack the diversity and annotation depth required to train generalizable deep-learning models.", "key_contribution": "To address this gap, we present a dataset of 3,000 phacoemulsification cataract surgery videos acquired at two surgical centers from surgeons with varying expertise.", "why_it_matters": "Cataract-LMM Large-Scale Multi-Source Multi-Task Benchmark for Deep Learning in Surgical Video Analysis advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Object Detection.", "one_line_takeaway": "To address this gap, we present a dataset of 3,000 phacoemulsification cataract surgery videos acquired at two surgical…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Object Detection.", "url": "https://arxiv.org/abs/2510.16371", "difficulty": "advanced" }, { "id": "arxiv:2608.16394", "source": "arxiv", "source_type": "preprint", "title": "Think Inside the Chunk: RegulaRAG for Regulation-Compliant Scenario Generation using LLMs: A Case Study of UN Regulation No. 152", "abstract": "Generating regulation-compliant test scenarios is essential for validating safety-critical automotive systems, yet Large Language Models (LLMs) struggle to ground outputs in long, hierarchical standards. We present RegulaRAG, a Retrieval-Augmented Generation (RAG) pipeline that couples SmartChunking, reference-aware enrichment of paragraphs and tables via graph traversal, with Smart Retrieve & Rerank over these enriched units. To test our system, we evaluate on a manually curated dataset covering all scenarios in UN Regulation No. 152 (AEBS). Our study comprises: (i) a three-step progressive search that identifies near-optimal retrieval parameters without exhaustive grid search; (ii) head-to-head comparisons against five baseline RAG systems; and (iii) a robustness stress test that scales the source corpus with distractor content. Outputs are evaluated using a customized penalized scoring metric. Across all experiments, RegulaRAG achieves the highest average Meta-Score (82.99), outperforming the next-best system by 43% (NoRAG: 57.94), while operating at 14k-25k tokens per query versus up to 500k for graphcentric baselines. It maintains strong performance, remaining stable even as the number of regulatory sources grows, whereas competing RAG systems degrade sharply in both quality and robustness.", "authors": [ "Vahid Zolfaghari", "Nenad Petrovic", "AndrÉ Schamschurko", "Alois Knoll" ], "year": 2026, "published_date": "2026-08-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.16394", "pdf_url": "https://arxiv.org/pdf/2608.16394", "citations": 0, "topics": [], "tags": [ "LLMs", "RAG", "Information Retrieval", "Artificial Intelligence" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.92, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Generating regulation-compliant test scenarios is essential for validating safety-critical automotive systems, yet Large Language Models (LLMs) struggle to ground outputs in long, hierarchical standards. We present RegulaRAG, a Retrieval-Augmented Generation (RAG) pipeline that couples SmartChunking, reference-aware enrichment of paragraphs and tables via graph traversal, with Smart Retrieve & Rerank over these enriched units.", "key_contribution": "We present RegulaRAG, a Retrieval-Augmented Generation (RAG) pipeline that couples SmartChunking, reference-aware enrichment of paragraphs and tables via graph traversal, with Smart Retrieve & Rerank over these enriched units.", "why_it_matters": "Think Inside the Chunk: RegulaRAG for Regulation-Compliant Scenario Generation using LLMs: A Case Study of UN Regulation No. 152 improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present RegulaRAG, a Retrieval-Augmented Generation (RAG) pipeline that couples SmartChunking, reference-aware…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.16394", "difficulty": "intermediate" }, { "id": "arxiv:2608.13033", "source": "arxiv", "source_type": "preprint", "title": "From One Solution to Many: An Oracle-Based FPT Framework for Diverse Solutions under Generalized Diversity Measures", "abstract": "The problem of computing \\emph{diverse} solutions has recently emerged as an important area of study, motivated by applications in fairness, robustness, and security. Instead of returning a single feasible or optimal solution, the goal is to output a \\emph{collection} of meaningfully different solutions, often measured by symmetric differences. Diverse variants have been studied using sparsification, network-flow reductions, and algebraic techniques. We investigate the fixed-parameter tractability of diverse variants of an implicit set-system problem. Given parameters $k$ and $r$ and a threshold $b$, the task is to compute $r$ feasible solutions, each of size at most $k$, whose diversity under a specified objective is at least $b$. Our main contribution is an oracle-based meta-theorem. We identify a broad class of objectives, called \\emph{consistently diverse}, that includes several standard measures. Assuming an \\emph{exact empty-extension oracle} given a forbidden set ${\\sf Forb}$, which returns a feasible solution of a prescribed size avoiding ${\\sf Forb}$ or reports that none exists, we obtain a fixed-parameter tractable algorithm parameterized by $k+r$. The algorithm makes at most $(2kr)^{kr} \\cdot r$ oracle calls, and in each call the oracle parameter satisfies $s+|{\\sf Forb}| \\leq k+2kr$. Our framework unifies and strengthens previous oracle-based approaches. Compared with Kumabe's framework (ESA 2025), which gives a doubly exponential bound on the number of oracle calls, our approach achieves the single exponential bound $2^{O(kr\\log(kr))}$ and directly constructs the desired tuple of solutions. We recover fixed-parameter tractable algorithms for all problems covered by that framework, with improved oracle complexity, and obtain strong bounds for diverse variants of classical graph and matroid problems.", "authors": [ "Pradeesha Ashok", "Sobyasachi Chatterjee", "Soumi Nandi", "Saket Saurabh", "Priyanshu Tiwari" ], "year": 2026, "published_date": "2026-08-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.13033", "pdf_url": "https://arxiv.org/pdf/2608.13033", "citations": 0, "topics": [], "tags": [ "Fairness & Ethics", "Data Structures & Algorithms" ], "paper_type": "dataset", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses theorem and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.12, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The problem of computing \\emph{diverse} solutions has recently emerged as an important area of study, motivated by applications in fairness, robustness, and security. Instead of returning a single feasible or optimal solution, the goal is to output a \\emph{collection} of meaningfully different solutions, often measured by symmetric differences.", "key_contribution": "The problem of computing \\emph{diverse} solutions has recently emerged as an important area of study, motivated by applications in fairness, robustness, and security.", "why_it_matters": "From One Solution to Many: An Oracle-Based FPT Framework for Diverse Solutions under Generalized Diversity Measures represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fairness & Ethics.", "one_line_takeaway": "The problem of computing \\emph{diverse} solutions has recently emerged as an important area of study, motivated by…", "biggest_caveat": "bution is an oracle-based meta-theorem.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Fairness & Ethics.", "url": "https://arxiv.org/abs/2608.13033", "difficulty": "frontier" }, { "id": "arxiv:2511.19517", "source": "arxiv", "source_type": "preprint", "title": "Automating Deception: Scalable Multi-Turn LLM Jailbreaks", "abstract": "Multi-turn conversational attacks, which leverage psychological principles like Foot-in-the-Door (FITD), where a small initial request paves the way for a more significant one, to bypass safety alignments, pose a persistent threat to Large Language Models (LLMs). Progress in defending against these attacks is hindered by a reliance on manual, hard-to-scale dataset creation. This paper introduces a novel, automated pipeline for generating large-scale, psychologically-grounded multi-turn jailbreak datasets. We systematically operationalize FITD techniques into reproducible templates, creating a benchmark of 1,500 scenarios across illegal activities and offensive content. We evaluate seven models from three major LLM families under both multi-turn (with history) and single-turn (without history) conditions. Our results reveal stark differences in contextual robustness: models in the GPT family demonstrate a significant vulnerability to conversational history, with Attack Success Rates (ASR) increasing by as much as 32 percentage points. In contrast, Google's Gemini 2.5 Flash exhibits exceptional resilience, proving nearly immune to these attacks, while Anthropic's Claude 3 Haiku shows strong but imperfect resistance. These findings highlight a critical divergence in how current safety architectures handle conversational context and underscore the need for defenses that can resist narrative-based manipulation.", "authors": [ "Adarsh Kumarappan", "Ananya Mujoo" ], "year": 2026, "published_date": "2026-08-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.19517", "pdf_url": "https://arxiv.org/pdf/2511.19517", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "Dialogue", "ASR", "Robotics" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.87, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multi-turn conversational attacks, which leverage psychological principles like Foot-in-the-Door (FITD), where a small initial request paves the way for a more significant one, to bypass safety alignments, pose a persistent threat to Large Language Models (LLMs). Progress in defending against these attacks is hindered by a reliance on manual, hard-to-scale dataset creation.", "key_contribution": "This paper introduces a novel, automated pipeline for generating large-scale, psychologically-grounded multi-turn jailbreak datasets.", "why_it_matters": "Automating Deception: Scalable Multi-Turn LLM Jailbreaks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "This paper introduces a novel, automated pipeline for generating large-scale, psychologically-grounded multi-turn…", "biggest_caveat": "but imperfect resistance.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2511.19517", "difficulty": "advanced" }, { "id": "arxiv:2604.03159", "source": "arxiv", "source_type": "preprint", "title": "BibTeX Citation Errors in Scientific Publishing Agents: Evaluation and Mitigation", "abstract": "Large language models with web search are increasingly used in scientific publishing agents, yet they produce BibTeX entries with pervasive field-level errors stemming from omission, partial corruption, substitution, and hallucination. We construct a benchmark of 931 papers across four domains and three citation tiers---popular, low-citation, and recent post-cutoff---with version-aware ground truth. Three search-enabled frontier models (GPT-5, Claude Sonnet-4.6, Gemini-3 Flash) generate approximately 23,000 field-level observations. Overall accuracy is 83.6%, but only 50.9% of entries are fully correct; accuracy drops 27.7 pp from popular to recent papers, revealing heavy reliance on parametric memory even when search is available. Co-occurrence analysis identifies two failure modes: wholesale entry substitution and isolated field error. We present clibib, an open-source tool for deterministic BibTeX retrieval, as a mitigation mechanism. Two-stage integration raises accuracy to 91.5% (+8.0 pp) and fully correct entries to 78.3%, with a 0.8% regression rate. Separating search from revision yields larger gains and lower regression than single-stage tool loops (0.8% vs. 4.8%), demonstrating that integration architecture matters independently of model/tool capability. We release clibib and an accompanying agent skill under the MIT License to improve citation accuracy in increasingly automated scientific workflows.", "authors": [ "Delip Rao", "Chris Callison-Burch" ], "year": 2026, "published_date": "2026-08-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.03159", "pdf_url": "https://arxiv.org/pdf/2604.03159", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.08, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models with web search are increasingly used in scientific publishing agents, yet they produce BibTeX entries with pervasive field-level errors stemming from omission, partial corruption, substitution, and hallucination. We construct a benchmark of 931 papers across four domains and three citation tiers---popular, low-citation, and recent post-cutoff---with version-aware ground truth.", "key_contribution": "We present clibib, an open-source tool for deterministic BibTeX retrieval, as a mitigation mechanism.", "why_it_matters": "BibTeX Citation Errors in Scientific Publishing Agents: Evaluation and Mitigation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present clibib, an open-source tool for deterministic BibTeX retrieval, as a mitigation mechanism.", "biggest_caveat": "but only 50.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2604.03159", "difficulty": "beginner" }, { "id": "arxiv:2608.08156", "source": "arxiv", "source_type": "preprint", "title": "A Hybrid Nested Harness for Decoupling Structure and Parameters in LLM-Driven Optimization", "abstract": "In evolutionary algorithms powered by language models, the LLM acts as a single operator that simultaneously updates structural components (like control flow) and continuous parameters. While LLMs can be good at the first, they are not efficient at the second, wasting tokens taking discrete jumps inside a trial and error loop. We resolve this by formalizing a hybrid nested search, in which an outer loop has the LLM propose a structural sketch, with numeric gaps, and an inner numerical optimizer tunes the sketch. Both the outer and inner solvers are pluggable: any text-based optimizer can be combined with a zero-order optimizer (CMA-ES), gradient-based routines, or MCMC samplers. We validate our framework across three scientific domains: (i) meta-optimizers on closed-form test functions, (ii) code-based policies for systems research and social dilemmas; and (iii) approximate Bayesian inference tasks. Across all three, the hybrid optimizer is superior to both vanilla LLM-driven search and pure numerical optimization baselines. Code at: https://github.com/vicgalle/hybrid-nested-search", "authors": [ "Víctor Gallego" ], "year": 2026, "published_date": "2026-08-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.08156", "pdf_url": "https://arxiv.org/pdf/2608.08156", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Machine Learning", "Neural Networks" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 2.53, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In evolutionary algorithms powered by language models, the LLM acts as a single operator that simultaneously updates structural components (like control flow) and continuous parameters. While LLMs can be good at the first, they are not efficient at the second, wasting tokens taking discrete jumps inside a trial and error loop.", "key_contribution": "We resolve this by formalizing a hybrid nested search, in which an outer loop has the LLM propose a structural sketch, with numeric gaps, and an inner numerical optimizer tunes the sketch.", "why_it_matters": "A Hybrid Nested Harness for Decoupling Structure and Parameters in LLM-Driven Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We resolve this by formalizing a hybrid nested search, in which an outer loop has the LLM propose a structural sketch,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.08156", "difficulty": "frontier" }, { "id": "arxiv:2608.08663", "source": "arxiv", "source_type": "preprint", "title": "A Dynamic-Semantics Framework for Grounding Human Referring Expressions in Visual Perceptual Data", "abstract": "Humans converge on shared names for novel, hard-to-describe objects through repeated interaction, a process psycholinguists call lexical entrainment. Leading vision-language models fail at this: recent empirical work documents that they do not shorten references, reuse successful expressions, or maintain stable pact state across turns. We present a framework that addresses the gap by externalizing pact state into three explicit, inspectable sets of referent-object bindings ($Γ, Ξ, Ω$), updated by a dynamic-semantics context-change rule. The symbolic layer sits on top of a lightweight perceptual-alignment pipeline that grounds noisy human referring expressions in crowd-sourced imagery via SIFT homographies and the Universal Quality Index. Evaluated on the Stanford Repeated Reference Game corpus (over 15{,}000 director-matcher utterances on abstract tangram stimuli), the framework places the correct target in its top-5 hypothesis set 83.56% of the time from a single director utterance. Human matcher top-1 accuracy on the same corpus is approximately 77-80%. We also report results on a held-out condition in which obvious tangram-adjacent images are excluded from the retrieved set, which provides a more conservative measurement of the grounding signal. Ablations isolate the contribution of each component: SIFT alignment, UQI, query preprocessing, and image augmentation. The central contribution is the combination: a transparent, auditable symbolic layer that recovers the structure of lexical entrainment turn by turn, paired with a perceptual channel whose behavior can be examined ablation by ablation. We also discuss in detail what the framework does not do. It is not interactive, it does not close the loop with the director, and its retrieval-driven perceptual channel is vulnerable to a class of leakage effects that we quantify and bound rather than wave away.", "authors": [ "Joseph Bingham" ], "year": 2026, "published_date": "2026-08-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.08663", "pdf_url": "https://arxiv.org/pdf/2608.08663", "citations": 0, "topics": [], "tags": [ "Hallucination", "AI Safety", "VLMs", "Human-Computer Interaction", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.62, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Humans converge on shared names for novel, hard-to-describe objects through repeated interaction, a process psycholinguists call lexical entrainment. Leading vision-language models fail at this: recent empirical work documents that they do not shorten references, reuse successful expressions, or maintain stable pact state across turns.", "key_contribution": "Humans converge on shared names for novel, hard-to-describe objects through repeated interaction, a process psycholinguists call lexical entrainment.", "why_it_matters": "A Dynamic-Semantics Framework for Grounding Human Referring Expressions in Visual Perceptual Data advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "Humans converge on shared names for novel, hard-to-describe objects through repeated interaction, a process…", "biggest_caveat": "bution of each component: SIFT alignment, UQI, query preprocessing, and image augmentation.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2608.08663", "difficulty": "advanced" }, { "id": "arxiv:2606.23512", "source": "arxiv", "source_type": "preprint", "title": "Source-Free Detection and Impact Analysis of Compiler Optimization Problems in Mobile Applications", "abstract": "Mobile apps frequently suffer from performance issues such as frame drops, overheating, and excessive power consumption. While developers optimize algorithms and debug code, a critical bottleneck often goes unnoticed: native libraries compiled with low optimization levels (O0/O1 instead of O2/O3). Because these libraries execute without functional errors, the resulting performance degradation remains hidden in production apps, affecting millions of users. We present \\textsc{OptDetect}, a source-free framework that detects compiler optimization problems directly from app binaries without requiring source code or build metadata. \\textsc{OptDetect} handles mixed optimization levels within a single binary through a pipeline of binary disassembly, chunk-level classification, and weighted score aggregation, achieving 93.0\\% accuracy on controlled datasets and 81.9\\% on real-world datasets. Applying \\textsc{OptDetect} to 21,972 native libraries from 830 top-ranked Google Play apps, we find that 30.5\\% of libraries use low optimization levels, affecting 91.7\\% of apps. Through case studies on 12 production apps (6 commercial, 6 open-source), we demonstrate that fixing detected issues reduces CPU instructions by 10-63\\% (median: 20.5\\%) for commercial apps and 15-58\\% (median: 32\\%) for open-source apps, with performance complaints decreasing by a median of 42\\% and ratings increasing by a median of 0.14 points. Further investigation reveals a previously overlooked root cause: widely-used third-party libraries are themselves distributed at low optimization levels, with 49.7\\% of 1,073 libraries in a major repository exhibiting this problem. These findings highlight the need for automated detection tools and industry-wide optimization standards.", "authors": [ "Han Hu", "Xiaoheng Xie", "Bo Sun", "Jian Gu", "Gang Fan", "Li Li" ], "year": 2026, "published_date": "2026-08-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.23512", "pdf_url": "https://arxiv.org/pdf/2606.23512", "citations": 0, "topics": [], "tags": [ "Software Engineering" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.38, "content_potential_score": 0.84, "interestingness_score": 1.92, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Mobile apps frequently suffer from performance issues such as frame drops, overheating, and excessive power consumption. While developers optimize algorithms and debug code, a critical bottleneck often goes unnoticed: native libraries compiled with low optimization levels (O0/O1 instead of O2/O3).", "key_contribution": "We present \\textsc{OptDetect}, a source-free framework that detects compiler optimization problems directly from app binaries without requiring source code or build metadata.", "why_it_matters": "Source-Free Detection and Impact Analysis of Compiler Optimization Problems in Mobile Applications represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Software Engineering.", "one_line_takeaway": "We present \\textsc{OptDetect}, a source-free framework that detects compiler optimization problems directly from app…", "biggest_caveat": "buted at low optimization levels, with 49.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Software Engineering.", "url": "https://arxiv.org/abs/2606.23512", "difficulty": "intermediate" }, { "id": "arxiv:2604.04952v1", "source": "arxiv", "source_type": "preprint", "title": "ML Defender (aRGus NDR): An Open-Source Embedded ML NIDS for Botnet and Anomalous Traffic Detection in Resource-Constrained Organizations", "abstract": "Ransomware and DDoS attacks disproportionately impact hospitals, schools, and small organizations that cannot afford enterprise security solutions. We present ML Defender (aRGus NDR), an open-source network intrusion detection system built in C++20, deployable on commodity hardware at approximately 150-200 USD. ML Defender implements a six-component pipeline over eBPF/XDP packet capture, ZeroMQ transport, and Protocol Buffers serialization, combining a rule-based Fast Detector with an embedded Random Forest classifier. The Maximum Threat Wins policy selects the arithmetic maximum of both scores, using ML inference to suppress false positives. Evaluated against the CTU-13 Neris botnet dataset: F1=0.9985, Precision=0.9969, Recall=1.0000, FPR=0.0002% (2 FP in 12,075 benign flows). The Fast Detector alone produces 6.61% FPR on benign traffic; the ML layer reduces this to zero -- a ~500-fold reduction. Per-class inference latency: 0.24-1.06 microseconds on commodity hardware. Under progressive load testing, the pipeline sustains ~34-38 Mbps with zero packet drops across 2.37 million packets. RAM stable at ~1.28 GB. The bottleneck is VirtualBox NIC emulation, not pipeline logic. All figures are conservative lower bounds; bare-metal characterization is future work. This work was developed through the Consejo de Sabios, a structured multi-LLM peer review methodology. Test-Driven Hardening (TDH) is proposed as a methodology for security-critical distributed systems. ML Defender is released under the MIT license.", "authors": [ "Alonso Isidoro Román" ], "year": 2026, "published_date": "2026-04-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.04952v1", "pdf_url": "https://arxiv.org/pdf/2604.04952v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Large Language Models", "Cryptography & Security" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.44, "content_potential_score": 2.79, "interestingness_score": 2.9, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Ransomware and DDoS attacks disproportionately impact hospitals, schools, and small organizations that cannot afford enterprise security solutions. We present ML Defender (aRGus NDR), an open-source network intrusion detection system built in C++20, deployable on commodity hardware at approximately 150-200 USD.", "key_contribution": "We present ML Defender (aRGus NDR), an open-source network intrusion detection system built in C++20, deployable on commodity hardware at approximately 150-200 USD.", "why_it_matters": "ML Defender (aRGus NDR): An Open-Source Embedded ML NIDS for Botnet and Anomalous Traffic Detection in Resource-Constrained Organizations advances our understanding of large language models, which are reshaping how we build AI systems and interact with knowledge.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present ML Defender (aRGus NDR), an open-source network intrusion detection system built in C++20, deployable on…", "biggest_caveat": "cannot afford enterprise security solutions.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.04952v1", "difficulty": "intermediate" }, { "id": "arxiv:2505.19840", "source": "arxiv", "source_type": "preprint", "title": "One Surrogate to Fool Them All: Universal, Transferable, and Targeted Adversarial Attacks with CLIP", "abstract": "Deep Neural Networks (DNNs) have achieved widespread success yet remain prone to adversarial attacks. Typically, such attacks either involve frequent queries to the target model or rely on surrogate models closely mirroring the target model -- often trained with subsets of the target model's training data -- to achieve high attack success rates through transferability. However, in realistic scenarios where training data is inaccessible and excessive queries can raise alarms, crafting adversarial examples becomes more challenging. In this paper, we present UnivIntruder, a novel attack framework that relies solely on a single, publicly available CLIP model and publicly available datasets. By using textual concepts, UnivIntruder generates universal, transferable, and targeted adversarial perturbations that mislead DNNs into misclassifying inputs into adversary-specified classes defined by textual concepts. Our extensive experiments show that our approach achieves an Attack Success Rate (ASR) of up to 85% on ImageNet and over 99% on CIFAR-10, significantly outperforming existing transfer-based methods. Additionally, we reveal real-world vulnerabilities, showing that even without querying target models, UnivIntruder compromises image search engines like Google and Baidu with ASR rates up to 84%, and vision language models like GPT-4 and Claude-3.5 with ASR rates up to 80%. These findings underscore the practicality of our attack in scenarios where traditional avenues are blocked, highlighting the need to reevaluate security paradigms in AI applications.", "authors": [ "Binyan Xu", "Xilin Dai", "Di Tang", "Kehuan Zhang" ], "year": 2026, "published_date": "2026-08-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2505.19840", "pdf_url": "https://arxiv.org/pdf/2505.19840", "citations": 0, "topics": [], "tags": [ "LLMs", "VLMs", "IR", "ASR", "Adversarial" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.68, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deep Neural Networks (DNNs) have achieved widespread success yet remain prone to adversarial attacks. Typically, such attacks either involve frequent queries to the target model or rely on surrogate models closely mirroring the target model -- often trained with subsets of the target model's training data -- to achieve high attack success rates through transferability.", "key_contribution": "Typically, such attacks either involve frequent queries to the target model or rely on surrogate models closely mirroring the target model -- often trained with subsets of the target model's training data -- to achieve high attack success rates through transferability.", "why_it_matters": "One Surrogate to Fool Them All: Universal, Transferable, and Targeted Adversarial Attacks with CLIP represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Typically, such attacks either involve frequent queries to the target model or rely on surrogate models closely…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2505.19840", "difficulty": "intermediate" }, { "id": "arxiv:2604.05087v1", "source": "arxiv", "source_type": "preprint", "title": "Document Optimization for Black-Box Retrieval via Reinforcement Learning", "abstract": "Document expansion is a classical technique for improving retrieval quality, and is attractive since it shifts computation offline, avoiding additional query-time processing. However, when applied to modern retrievers, it has been shown to degrade performance, often introducing noise that obfuscates the discriminative signal. We recast document expansion as a document optimization problem: a language model or a vision language model is fine-tuned to transform documents into representations that better align with the expected query distribution under a target retriever, using GRPO with the retriever's ranking improvements as rewards. This approach requires only black-box access to retrieval ranks, and is applicable across single-vector, multi-vector and lexical retrievers. We evaluate our approach on code retrieval and visual document retrieval (VDR) tasks. We find that learned document transformations yield retrieval gains and in many settings enable smaller, more efficient retrievers to outperform larger ones. For example, applying document optimization to OpenAI text-embedding-3-small model improves nDCG5 on code (58.7 to 66.8) and VDR (53.3 to 57.6), even slightly surpassing the 6.5X more expensive OpenAI text-embedding-3-large model (66.3 on code; 57.0 on VDR). When retriever weights are accessible, document optimization is often competitive with fine-tuning, and in most settings their combination performs best, improving Jina-ColBERT-V2 from 55.8 to 63.3 on VDR and from 48.6 to 61.8 on code retrieval.", "authors": [ "Omri Uzan", "Ron Polonsky", "Douwe Kiela", "Christopher Potts" ], "year": 2026, "published_date": "2026-04-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.05087v1", "pdf_url": "https://arxiv.org/pdf/2604.05087v1", "citations": 0, "topics": [], "tags": [ "RLHF", "Fine-Tuning", "VLMs", "Transformers", "NLP" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.2, "content_potential_score": 0.42, "interestingness_score": 1.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Document expansion is a classical technique for improving retrieval quality, and is attractive since it shifts computation offline, avoiding additional query-time processing. However, when applied to modern retrievers, it has been shown to degrade performance, often introducing noise that obfuscates the discriminative signal.", "key_contribution": "We find that learned document transformations yield retrieval gains and in many settings enable smaller, more efficient retrievers to outperform larger ones.", "why_it_matters": "Document Optimization for Black-Box Retrieval via Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RLHF.", "one_line_takeaway": "We find that learned document transformations yield retrieval gains and in many settings enable smaller, more efficient…", "biggest_caveat": "However, when applied to modern retrievers, it has been shown to degrade performance, often introducing noise that obfuscates the discriminative signal.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in RLHF.", "url": "http://arxiv.org/abs/2604.05087v1", "difficulty": "beginner" }, { "id": "arxiv:2607.00693", "source": "arxiv", "source_type": "preprint", "title": "The Rise and Fall of Google's Privacy Sandbox", "abstract": "On October 17th, 2025, Google announced the retirement of most Privacy Sandbox APIs, concluding nearly five years of experimentation with its alternative to privacy-invasive data collection on the Web. Designed to balance privacy with advertising functionality and cross-site tracking, the initiative faced repeated redesigns and limited ecosystem support. In this work, we present the first longitudinal, consent-aware measurement of the Privacy Sandbox's deployment across the Web. Using a custom call listener and weekly crawls of the top-10,000 websites, we monitor the usage of all major APIs in the months preceding their retirement. Adoption had already stagnated well before Google's announcement: most APIs were used by only a handful of actors, whose activity declined steadily throughout our study. Even the APIs that Google plans to maintain show no sign of growth. The sole exception is Cookies Having Independent Partitioned State (CHIPS). Overall, the demise of the Privacy Sandbox leaves unresolved the challenge of enabling privacy-preserving interest-based advertising.", "authors": [ "Rachid Youssef Grib", "Alberto Verna", "Nikhil Jha", "Martino Trevisan", "Marco Mellia" ], "year": 2026, "published_date": "2026-07-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.00693", "pdf_url": "https://arxiv.org/pdf/2607.00693", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Federated Learning", "Cryptography & Security" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.88, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "On October 17th, 2025, Google announced the retirement of most Privacy Sandbox APIs, concluding nearly five years of experimentation with its alternative to privacy-invasive data collection on the Web. Designed to balance privacy with advertising functionality and cross-site tracking, the initiative faced repeated redesigns and limited ecosystem support.", "key_contribution": "In this work, we present the first longitudinal, consent-aware measurement of the Privacy Sandbox's deployment across the Web.", "why_it_matters": "The Rise and Fall of Google's Privacy Sandbox represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "In this work, we present the first longitudinal, consent-aware measurement of the Privacy Sandbox's deployment across…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2607.00693", "difficulty": "advanced" }, { "id": "arxiv:2607.01586", "source": "arxiv", "source_type": "preprint", "title": "VLAFlow: A Unified Training Framework for Vision-Language-Action Models via Co-training and Future Latent Alignment", "abstract": "Vision-language-action models (VLAs) have recently advanced robotic manipulation, yet the effects of different robot-data pre-training paradigms remain difficult to compare because existing models often differ in architecture, data, action space, and evaluation protocol. We present VLAFlow (Vision-Language-Action Flow), a unified flow-matching framework for controlled comparison of VLA training objectives. Using a heterogeneous robot corpus, OXEMix, containing approximately 5,000 hours of data from DROID, OpenX-Embodiment, OpenX-Augmented, and RoboCOIN, we evaluate four paradigms under the same pi0-style architecture, shared VLM backbone, action expert, and 14-dimensional action space: action-only modeling (MindPI), language-supervised co-training (MindLPI), future latent alignment (MindWPI), and their combination (MindLWPI). Experiments on LIBERO, LIBERO-Plus, and SimplerEnv show that action-only pre-training is sensitive to heterogeneous data. In contrast, language supervision helps preserve vision-language generalization, while future latent alignment improves state-transition and action-outcome modeling. By combining both signals, MindLWPI achieves the most stable overall transfer performance across benchmarks. These results suggest a meta-action space view: language and future latent representations provide complementary intermediate constraints that make heterogeneous action supervision smoother and more transferable.", "authors": [ "Guoyang Xia", "Fengfa Li", "Hongjin Ji", "Lei Ren", "Fangxiang Feng", "Kun Zhan", "Yan Xie" ], "year": 2026, "published_date": "2026-07-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.01586", "pdf_url": "https://arxiv.org/pdf/2607.01586", "citations": 0, "topics": [], "tags": [ "AI Safety", "Self-Supervised", "Robotics", "Evaluation", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.47, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Vision-language-action models (VLAs) have recently advanced robotic manipulation, yet the effects of different robot-data pre-training paradigms remain difficult to compare because existing models often differ in architecture, data, action space, and evaluation protocol. We present VLAFlow (Vision-Language-Action Flow), a unified flow-matching framework for controlled comparison of VLA training objectives.", "key_contribution": "We present VLAFlow (Vision-Language-Action Flow), a unified flow-matching framework for controlled comparison of VLA training objectives.", "why_it_matters": "VLAFlow: A Unified Training Framework for Vision-Language-Action Models via Co-training and Future Latent Alignment advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We present VLAFlow (Vision-Language-Action Flow), a unified flow-matching framework for controlled comparison of VLA…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2607.01586", "difficulty": "beginner" }, { "id": "arxiv:2608.03675", "source": "arxiv", "source_type": "preprint", "title": "VetScore: Risk-Weighted Fact Verification for Veterinary Long-Form QA with Citations", "abstract": "Citation excerpts can be used to increase the reliability of generated outputs and their faithfulness to cited sources, which is especially important in high-stakes domains such as human and veterinary medicine. However, this does not guarantee that generated claims are faithful to the provided excerpts. We present VetScore, a multi-step evaluation method for veterinary long-form question answering, designed to assess how well are generated claims supported by the provided excerpts, weighing this information by each claim's harm potential. VetScore first segments the output and decomposes it into individual claims, then scores each claim with respect to its harm potential and evaluates its faithfulness to source excerpts, and finally calculates the overall risk-adjusted score. We collect an expert-annotated meta-evaluation dataset, evaluate our approach with a range of judge models, and show that it achieves high correlations with veterinary experts even with small judge models, while offering explainability across multiple dimensions.", "authors": [ "Ivan Kartáč", "Jan Tovarys", "Mateusz Lango", "Ondřej Dušek" ], "year": 2026, "published_date": "2026-08-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.03675", "pdf_url": "https://arxiv.org/pdf/2608.03675", "citations": 0, "topics": [], "tags": [ "Hallucination", "QA", "Interpretability", "NLP" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.04, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Citation excerpts can be used to increase the reliability of generated outputs and their faithfulness to cited sources, which is especially important in high-stakes domains such as human and veterinary medicine. However, this does not guarantee that generated claims are faithful to the provided excerpts.", "key_contribution": "We present VetScore, a multi-step evaluation method for veterinary long-form question answering, designed to assess how well are generated claims supported by the provided excerpts, weighing this information by each claim's harm potential.", "why_it_matters": "VetScore: Risk-Weighted Fact Verification for Veterinary Long-Form QA with Citations represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "We present VetScore, a multi-step evaluation method for veterinary long-form question answering, designed to assess how…", "biggest_caveat": "However, this does not guarantee that generated claims are faithful to the provided excerpts.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2608.03675", "difficulty": "beginner" }, { "id": "arxiv:2209.03282", "source": "arxiv", "source_type": "preprint", "title": "Simplified Quadratic Gradient: A Unified Framework Bridging Gradient Descent and Newton-Type Methods by Synthesizing Hessians and Gradients", "abstract": "Accelerating the convergence of second-order optimization, particularly Newton-type methods, remains a pivotal challenge in algorithmic research. In this paper, we extend previous work on the \\textbf{Quadratic Gradient (QG)} and rigorously validate its applicability to general convex numerical optimization problems. We introduce a novel variant of the Quadratic Gradient that departs from the conventional fixed Hessian Newton framework. We present a new way to build a new version of the quadratic gradient. This new quadratic gradient doesn't satisfy the convergence conditions of the fixed Hessian Newton's method. However, experimental results show that it sometimes has a better performance than the original one in convergence rate. While this variant relaxes certain classical convergence constraints, it maintains a positive-definite Hessian proxy and demonstrates comparable, or in some cases superior, empirical performance in convergence rates. Furthermore, we demonstrate that both the original and the proposed QG variants can be effectively applied to non-convex optimization landscapes. A key motivation of our work is the limitation of traditional scalar learning rates. We argue that a diagonal matrix can more effectively accelerate gradient elements at heterogeneous rates. Our findings establish the Quadratic Gradient as a versatile and potent framework for modern optimization. Furthermore, we integrate Hutchinson's Estimator to estimate the Hessian diagonal efficiently via Hessian-vector products. Notably, we demonstrate that the proposed Quadratic Gradient variant is highly effective for Deep Learning architectures, providing a robust second-order alternative to standard adaptive optimizers.", "authors": [ "John Chiang" ], "year": 2026, "published_date": "2026-08-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2209.03282", "pdf_url": "https://arxiv.org/pdf/2209.03282", "citations": 0, "topics": [], "tags": [ "Machine Learning" ], "paper_type": "theory", "difficulty_level": "L3", "difficulty_reason": "Uses gradient descent — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.27, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Accelerating the convergence of second-order optimization, particularly Newton-type methods, remains a pivotal challenge in algorithmic research. In this paper, we extend previous work on the \\textbf{Quadratic Gradient (QG)} and rigorously validate its applicability to general convex numerical optimization problems.", "key_contribution": "We introduce a novel variant of the Quadratic Gradient that departs from the conventional fixed Hessian Newton framework.", "why_it_matters": "Simplified Quadratic Gradient: A Unified Framework Bridging Gradient Descent and Newton-Type Methods by Synthesizing Hessians and Gradients represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Machine Learning.", "one_line_takeaway": "We introduce a novel variant of the Quadratic Gradient that departs from the conventional fixed Hessian Newton…", "biggest_caveat": "However, experimental results show that it sometimes has a better performance than the original one in convergence rate.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Machine Learning.", "url": "https://arxiv.org/abs/2209.03282", "difficulty": "advanced" }, { "id": "arxiv:2607.27776", "source": "arxiv", "source_type": "preprint", "title": "CHARGE: Leveraging CWE Hierarchies for Hardware Security SystemVerilog Assertion Generation", "abstract": "This paper presents CHARGE, an automated framework for generating security properties for unverified RTL modules using CWEs and large language models (LLMs). The hallmark is a reasoning process that leverages the hierarchical nature of CWE entries to improve accuracy when identifying security-critical assets in unverified RTL modules. As a result, the approach can infer expected security behaviors and generate properties from identified assets and CWE semantics, avoiding the need for trusted design specifications and reducing manual engineering effort. We evaluate the framework on the Hack@DAC18, 19, and 21 open source SoC designs using OpenAI's GPT-4.1. CHARGE detects 27 of 42 known bugs in these designs. For Hack@DAC21 OpenPiton SoC, 89% of the generated SVAs run in Cadence JasperGold FPV, and 92.2% are non-vacuous. We compare to an open-source, manually written set of properties for these designs and find that CHARGE correctly writes properties for three bugs in which the manually written properties were incorrect. In addition, CHARGE-generated properties identify a new bug in the Hack@DAC21 OpenPiton SoC that was not previously identified.", "authors": [ "Xiao Tan", "Cynthia Sturton" ], "year": 2026, "published_date": "2026-07-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.27776", "pdf_url": "https://arxiv.org/pdf/2607.27776", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.89, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "This paper presents CHARGE, an automated framework for generating security properties for unverified RTL modules using CWEs and large language models (LLMs). The hallmark is a reasoning process that leverages the hierarchical nature of CWE entries to improve accuracy when identifying security-critical assets in unverified RTL modules.", "key_contribution": "This paper presents CHARGE, an automated framework for generating security properties for unverified RTL modules using CWEs and large language models (LLMs).", "why_it_matters": "CHARGE: Leveraging CWE Hierarchies for Hardware Security SystemVerilog Assertion Generation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "This paper presents CHARGE, an automated framework for generating security properties for unverified RTL modules using…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.27776", "difficulty": "intermediate" }, { "id": "arxiv:2607.23386", "source": "arxiv", "source_type": "preprint", "title": "Confidently Wrong: Exception Chain Collapse in Frontier LLM Rule Evaluation", "abstract": "We document a failure class in frontier large language models -- exception chain collapse -- observed in eligibility evaluation under nested conditional rules of the form \"A is required UNLESS B applies, UNLESS C overrides B\". The failure reproduces at first observation, but its empirical surface is unstable: between March and April 2026 several failure cells closed silently under the same model alias, with no version bump (GPT-5.4 on construction insurance moved from 96.6% to 100%, same prompt and harness). For regulated workflows, frontier-model accuracy is a moving compliance boundary that shifts without notice. We present the Aethis Eligibility Module, a neuro-symbolic architecture in which LLMs author rules from authoritative sources and an SMT-based layer executes them deterministically, consistent with the authored specification regardless of model drift, reasoning-effort defaults, or prompt format. Three evidence bases: (i) a controlled benchmark of 225 scenarios across four regulatory domains documents the pattern and, in replication, the drift that partially closed it; (ii) a 20-scenario adversarial extension on construction insurance, where the engine scores 20/20, as does one of four frontier configurations (GPT-5.4 at low reasoning effort), while the other three, including Anthropic's strongest model at evaluation time, fail the same coverage-gap edge case; (iii) external validation on nine peer-reviewed LegalBench tasks, 949 held-out cases, where the engine is significantly more accurate than all three frontier models (combined McNemar's p <= 0.003), with margins up to +41 points on the curated multi-prong tasks against the Anthropic models. The contribution is to relocate uncertainty from the inference boundary, where it is silent, to the specification boundary, where it is deliberate and audited. All scenarios, rule encodings, and results are public and reproducible.", "authors": [ "Paul Simpson", "John Kozak", "Lisa Doake" ], "year": 2026, "published_date": "2026-07-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.23386", "pdf_url": "https://arxiv.org/pdf/2607.23386", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.83, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We document a failure class in frontier large language models -- exception chain collapse -- observed in eligibility evaluation under nested conditional rules of the form \"A is required UNLESS B applies, UNLESS C overrides B\". The failure reproduces at first observation, but its empirical surface is unstable: between March and April 2026 several failure cells closed silently under the same model alias, with no version bump (GPT-5.4 on construction insurance moved from 96.6% to 100%, same prompt and harness).", "key_contribution": "We present the Aethis Eligibility Module, a neuro-symbolic architecture in which LLMs author rules from authoritative sources and an SMT-based layer executes them deterministically, consistent with the authored specification regardless of model drift, reasoning-effort defaults, or prompt format.", "why_it_matters": "Confidently Wrong: Exception Chain Collapse in Frontier LLM Rule Evaluation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present the Aethis Eligibility Module, a neuro-symbolic architecture in which LLMs author rules from authoritative…", "biggest_caveat": "bution is to relocate uncertainty from the inference boundary, where it is silent, to the specification boundary, where it is deliberate and audited.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.23386", "difficulty": "beginner" }, { "id": "arxiv:2607.23505", "source": "arxiv", "source_type": "preprint", "title": "Benchmarking Zero-Shot LLM-Generated Parent Selection in Genetic Programming for Symbolic Regression", "abstract": "Parent selection significantly affects exploration, exploitation, and complexity control in genetic programming (GP) for symbolic regression. It is unclear whether large language models (LLMs) can synthesize effective operators in a zero-shot setting without iterative meta-evolution. Here, zero-shot means that the model receives only the task description, with no reference operators or iterative feedback. In this work, we benchmark zero-shot synthesis of parent-selection operators across eight LLMs within a standard GP framework for symbolic regression. Each model receives the same natural-language prompt to generate a parent-selection operator, which is then evaluated in a standard GP framework with only the parent-selection operator replaced, while all other components and the evolutionary-search budget are held constant. For each LLM, ten independent zero-shot operators are evaluated on twelve OpenML regression benchmarks and compared against automatic lexicase and tournament selection baselines. Claude Sonnet~4.6 and Gemini~3.1 Pro stand out for consistently strong performance on both training and held-out test $R^2$. The strongest operator in our benchmark---a Kimi~K2.5 zero-shot synthesis---surpasses the automatic lexicase and tournament baselines in search effectiveness. These results suggest that zero-shot LLM synthesis is a viable approach to generating competitive GP selection operators. Analysis shows that many generated operators use semantics to guide selection, suggesting that LLMs can produce non-trivial search heuristics from the task description alone. We also examine the relationship between public LLM leaderboard rankings and GP performance. Widely used benchmarks, such as Humanity's Last Exam and SWE-bench Verified, strongly correlate with training $R^2$, while their relationship to held-out test $R^2$ is weaker and less clear.", "authors": [ "Hengzhe Zhang", "Qi Chen", "Bing Xue", "Wolfgang Banzhaf", "Mengjie Zhang" ], "year": 2026, "published_date": "2026-07-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.23505", "pdf_url": "https://arxiv.org/pdf/2607.23505", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Neural Networks" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.33, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Parent selection significantly affects exploration, exploitation, and complexity control in genetic programming (GP) for symbolic regression. It is unclear whether large language models (LLMs) can synthesize effective operators in a zero-shot setting without iterative meta-evolution.", "key_contribution": "Parent selection significantly affects exploration, exploitation, and complexity control in genetic programming (GP) for symbolic regression.", "why_it_matters": "Benchmarking Zero-Shot LLM-Generated Parent Selection in Genetic Programming for Symbolic Regression represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Parent selection significantly affects exploration, exploitation, and complexity control in genetic programming (GP)…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.23505", "difficulty": "beginner" }, { "id": "arxiv:2607.22159", "source": "arxiv", "source_type": "preprint", "title": "Resource Allocation and Conversion along the Org Chart", "abstract": "We consider the allocation of multiple heterogeneous resources to agents who are organized according to an organizational hierarchy. In a company those correspond to business units, departments, and engineering teams. In government it corresponds to federal, state, and municipal levels as well as various agencies within each. In a university it corresponds to schools, departments, and research groups. The resources are also distributed along the same organizational tree: part of the supply is available only to certain sub-trees since it is purchased for the exclusive use of certain departments or units, and some supply is available to the entire tree. We consider the allocation with multiple types of resources where there is a possibility of converting between certain pairs of resources. We formulate this allocation problem as a market equilibrium problem and derive the necessary conditions to find a feasible solution. We prove that such a feasible solution always exists and provide an algorithm to compute it. Finally, we test our algorithm on a real dataset of the allocation of computing resources, such as TPUs and GPUs at Google. Our results rely on a novel two-step process, differentiating it from previous approaches. First, we show how to solve ``easy'' (harmonic) instances of our problem that satisfy certain structural properties. Then, we show how to efficiently approximate general instances by a series of easier harmonic instances, whose solutions converge efficiently to the solution of the original problem.", "authors": [ "Yuan Deng", "Giannis Fikioris", "Chido Onyeze", "Renato Paes Leme", "Balasubramanian Sivan", "Mihai Tiuca" ], "year": 2026, "published_date": "2026-07-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.22159", "pdf_url": "https://arxiv.org/pdf/2607.22159", "citations": 0, "topics": [], "tags": [ "Game Theory" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.88, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We consider the allocation of multiple heterogeneous resources to agents who are organized according to an organizational hierarchy. In a company those correspond to business units, departments, and engineering teams.", "key_contribution": "Our results rely on a novel two-step process, differentiating it from previous approaches.", "why_it_matters": "Resource Allocation and Conversion along the Org Chart represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Game Theory.", "one_line_takeaway": "Our results rely on a novel two-step process, differentiating it from previous approaches.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Game Theory.", "url": "https://arxiv.org/abs/2607.22159", "difficulty": "intermediate" }, { "id": "arxiv:2607.20466", "source": "arxiv", "source_type": "preprint", "title": "JAXBench: Benchmarking Autonomous TPU Kernel Optimization", "abstract": "Rigorous benchmarks have driven progress in autonomous GPU kernel performance optimization by establishing a shared target to hillclimb on, but no equivalent exists for TPUs. We present JAXBench, a TPU-native benchmark suite for AI-generated kernel optimization on Google Cloud TPUs. JAXBench comprises 50 JAX workloads that are both relevant and provide headroom for optimization. We extract 17 production ML operators from architectures in the public MaxText library such as Llama-3.1, DeepSeek-V3, Mixtral, Mamba-2, and AlphaFold2, and translate 33 operators from KernelBench that are validated for correctness and set with new problem sizes that achieve high TPU v6e MXU utilization. Eight of the 17 production operators ship with hand-optimized Pallas kernels from the public Tokamax library and block-size tuned to establish an expert upper-bound baseline. We evaluate four feedback-driven methods on generating candidate Pallas kernels for JAXBench. Across the full suite with Gemini 3 Flash, we find that target-specific context matters more than model scale on a sparsely-documented DSL like Pallas. Conditioning on curated TPU documentation raises per-sample correctness from 5.8% to 37.3% and solves 48 of 50 benchmarks at a 1.28x geomean speedup. Search structure yields significant gains once correctness is achieved, with Autocomp's beam-search pipeline reaching a 1.36x geomean speedup over XLA. On the 8 hand-tuned kernels, Autocomp reaches 1.60x geomean over XLA, recovering most of the 2.08x Tokamax upper bound but trailing on the specialized paged and ragged attention operators. High-quality TPU kernel optimization remains a challenging task, and we release the JAXBench benchmark, evaluation harness, and baseline results to support open source contributions.", "authors": [ "Arya Tschand", "Charles Hong", "Julian Walker", "Nina Cai", "Shangkun Wang", "Suvinay Subramanian", "Sundar Dev", "Vijay Janapa Reddi", "Amir Yazdanbakhsh", "Sethu Sankaran" ], "year": 2026, "published_date": "2026-05-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.20466", "pdf_url": "https://arxiv.org/pdf/2607.20466", "citations": 0, "topics": [], "tags": [ "SSMs", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.83, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Rigorous benchmarks have driven progress in autonomous GPU kernel performance optimization by establishing a shared target to hillclimb on, but no equivalent exists for TPUs. We present JAXBench, a TPU-native benchmark suite for AI-generated kernel optimization on Google Cloud TPUs.", "key_contribution": "We present JAXBench, a TPU-native benchmark suite for AI-generated kernel optimization on Google Cloud TPUs.", "why_it_matters": "JAXBench: Benchmarking Autonomous TPU Kernel Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about SSMs.", "one_line_takeaway": "We present JAXBench, a TPU-native benchmark suite for AI-generated kernel optimization on Google Cloud TPUs.", "biggest_caveat": "but no equivalent exists for TPUs.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in SSMs.", "url": "https://arxiv.org/abs/2607.20466", "difficulty": "beginner" }, { "id": "arxiv:2602.11961", "source": "arxiv", "source_type": "preprint", "title": "Scaling Model and Data for Multilingual Machine Translation with Open Large Language Models", "abstract": "Open large language models (LLMs) have demonstrated improving multilingual capabilities in recent years. In this paper, we present a study of open LLMs for multilingual machine translation (MT) across a range of languages, and investigate the effects of model scaling and data scaling when adapting open LLMs to multilingual MT through continual pretraining and instruction finetuning. Based on the Gemma3 model family, we develop MiLMMT-46, which achieves top-tier multilingual translation performance across 46 languages. Extensive experiments show that MiLMMT-46 consistently outperforms recent state-of-the-art (SOTA) models, including Seed-X, HY-MT-1.5, and TranslateGemma, and achieves competitive performance with strong proprietary systems such as Google Translate and Gemini 3 Pro. Models are released at https://huggingface.co/collections/xiaomi-research/milmmt-46. Codes are released at https://github.com/xiaomi-research/gemmax.", "authors": [ "Yuzhe Shang", "Pengzhi Gao", "Wei Liu", "Jian Luan", "Jinsong Su" ], "year": 2026, "published_date": "2026-07-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.11961", "pdf_url": "https://arxiv.org/pdf/2602.11961", "citations": 0, "topics": [], "tags": [ "LLMs", "Translation", "Self-Supervised", "NLP" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses continual — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.9, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Open large language models (LLMs) have demonstrated improving multilingual capabilities in recent years. In this paper, we present a study of open LLMs for multilingual machine translation (MT) across a range of languages, and investigate the effects of model scaling and data scaling when adapting open LLMs to multilingual MT through continual pretraining and instruction finetuning.", "key_contribution": "In this paper, we present a study of open LLMs for multilingual machine translation (MT) across a range of languages, and investigate the effects of model scaling and data scaling when adapting open LLMs to multilingual MT through continual pretraining and instruction finetuning.", "why_it_matters": "Scaling Model and Data for Multilingual Machine Translation with Open Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this paper, we present a study of open LLMs for multilingual machine translation (MT) across a range of languages,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2602.11961", "difficulty": "advanced" }, { "id": "arxiv:2607.16127", "source": "arxiv", "source_type": "preprint", "title": "CADAQUES: A Cost-Aware Dual Architecture for Query-Efficient Autonomous Discovery", "abstract": "Autonomous discovery systems couple a resource that answers queries (a simulator, instrument, or analytic model) to an algorithm that selects what to query next. Most software frameworks for this loop inherit the control structure of numerical optimization: campaigns run for a fixed number of iterations, query costs are absent from the programming interface, and decision-making is treated as free. In practice, queries may differ in cost by orders of magnitude, and planners built on large language models or expensive surrogates consume resources of their own. Here we present CADAQUES, an open-source Python framework built on one architectural principle: cost is a first-class primitive of the discovery loop. CADAQUES separates the loop into two structural protocols, an Oracle that answers queries and a Driver that proposes them, and charges both evaluations and decisions against a common vector-valued budget spanning wall time, CPU hours, monetary cost, and language model tokens. An append-only ledger records, for each transaction, the cost declared before execution and the cost settled afterwards, making their discrepancy an observable property of the campaign. We evaluate the architecture by locating the critical temperature of the two-dimensional Ising model from noisy finite-size estimates against the exact thermodynamic-limit reference. In this noisy setting, strategies that concentrate around the best observed result can be misled by noise-induced peaks, whereas a schedule that explores with cheap low-fidelity queries and refines with higher-fidelity ones yields lower and less variable errors than high fidelity throughout, at the studied budget scale. Metering adds tens of microseconds per iteration, three orders of magnitude below the cheapest oracle query. The framework is MIT-licensed and archived at Zenodo (doi:10.5281/zenodo.21293589).", "authors": [ "Jorge Bravo-Abad" ], "year": 2026, "published_date": "2026-07-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.16127", "pdf_url": "https://arxiv.org/pdf/2607.16127", "citations": 0, "topics": [], "tags": [ "LLMs", "Software Engineering" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.73, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Autonomous discovery systems couple a resource that answers queries (a simulator, instrument, or analytic model) to an algorithm that selects what to query next. Most software frameworks for this loop inherit the control structure of numerical optimization: campaigns run for a fixed number of iterations, query costs are absent from the programming interface, and decision-making is treated as free.", "key_contribution": "Here we present CADAQUES, an open-source Python framework built on one architectural principle: cost is a first-class primitive of the discovery loop.", "why_it_matters": "CADAQUES: A Cost-Aware Dual Architecture for Query-Efficient Autonomous Discovery represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Here we present CADAQUES, an open-source Python framework built on one architectural principle: cost is a first-class…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.16127", "difficulty": "intermediate" }, { "id": "arxiv:2607.14611", "source": "arxiv", "source_type": "preprint", "title": "Bad Memory: Evaluating Prompt Injection Risks from Memory in Agentic Systems", "abstract": "A growing class of agentic systems maintain persistent state across sessions through memory files, behavioral preferences, and knowledge bases. While this makes agents more useful and self-improving, it also creates a new attack surface for prompt injections in which malicious instructions can be embedded within persistent files and influence future behavior. In this work, we study prompt injection attacks in memory-based agentic systems using a sandboxed synthetic workspace. We evaluate two agentic systems, Anthropic Claude Code and OpenAI Codex, across four models: Claude Haiku 4.5, Claude Opus 4.7, GPT-5.2, and GPT-5.5. Our results show that although it is difficult to make an agent overwrite its own memory files using untrusted external content, payloads already planted in those files can successfully attack current and future sessions. Attack success and payload persistence vary substantially across systems, models, adversarial goals, and multi-session attack sequences. These findings show that persistent memory changes the threat model for prompt injection and motivate defenses that protect memory updates without removing useful agent adaptation.", "authors": [ "Soham Gadgil", "David Alexander", "Sai Sunku", "Franziska Roesner" ], "year": 2026, "published_date": "2026-07-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.14611", "pdf_url": "https://arxiv.org/pdf/2607.14611", "citations": 0, "topics": [], "tags": [ "AI Agents", "Code Generation", "Knowledge Graphs", "Artificial Intelligence", "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.36, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "A growing class of agentic systems maintain persistent state across sessions through memory files, behavioral preferences, and knowledge bases. While this makes agents more useful and self-improving, it also creates a new attack surface for prompt injections in which malicious instructions can be embedded within persistent files and influence future behavior.", "key_contribution": "Our results show that although it is difficult to make an agent overwrite its own memory files using untrusted external content, payloads already planted in those files can successfully attack current and future sessions.", "why_it_matters": "Bad Memory: Evaluating Prompt Injection Risks from Memory in Agentic Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "Our results show that although it is difficult to make an agent overwrite its own memory files using untrusted external…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2607.14611", "difficulty": "intermediate" }, { "id": "arxiv:2606.27582", "source": "arxiv", "source_type": "preprint", "title": "Beyond Points: Spherical Distributional Part Prototypes for Interpretable Classification", "abstract": "Prototype-based neural networks aim to provide intrinsic interpretability by grounding predictions in a small set of part prototypes. However, modern vision backbones typically operate in normalized, directional embedding spaces where each semantic part exhibits substantial intra-class variability. As a result, point prototypes often become redundant or unstable, hurting both explanation quality and robustness. We propose vMFProto, a distributional part-prototype framework that models each class as a mixture of von Mises-Fisher components on the hypersphere. Each prototype learns its own concentration, capturing part-specific variability, and we use entropic optimal transport (OT) to obtain structured patch-to-prototype assignments. A two-stage training schedule performs OT-driven prototype discovery followed by end-to-end refinement with patch-level distillation and distribution-aware diversity regularization. Experiments on CUB-200-2011, Stanford Dogs, and Stanford Cars with frozen DINO backbones show that vMFProto achieves state-of-the-art explanation quality (consistency, stability, and distinctiveness) with competitive accuracy. Qualitative results confirm that vMFProto yields localized, non-redundant part evidence.", "authors": [ "Duarte Leão", "Diogo Pereira Araújo", "Catarina Barata", "Carlos Santiago" ], "year": 2026, "published_date": "2026-06-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.27582", "pdf_url": "https://arxiv.org/pdf/2606.27582", "citations": 0, "topics": [], "tags": [ "Hallucination", "Interpretability", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.28, "content_potential_score": 0.42, "interestingness_score": 1.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Prototype-based neural networks aim to provide intrinsic interpretability by grounding predictions in a small set of part prototypes. However, modern vision backbones typically operate in normalized, directional embedding spaces where each semantic part exhibits substantial intra-class variability.", "key_contribution": "We propose vMFProto, a distributional part-prototype framework that models each class as a mixture of von Mises-Fisher components on the hypersphere.", "why_it_matters": "Beyond Points: Spherical Distributional Part Prototypes for Interpretable Classification advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "We propose vMFProto, a distributional part-prototype framework that models each class as a mixture of von Mises-Fisher…", "biggest_caveat": "butional part-prototype framework that models each class as a mixture of von Mises-Fisher components on the hypersphere.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2606.27582", "difficulty": "intermediate" }, { "id": "arxiv:2607.12233", "source": "arxiv", "source_type": "preprint", "title": "Fin-Analyst at FinMMEval 2026 Task 3: A Live Hybrid Trading Agent with LLM Specialists and Rule-Based Signals", "abstract": "Large language model (LLM) trading agents show promising performance in equity markets, yet remain narrowly focused on US equities with little evidence from live deployment. We present Fin-Analyst, a hybrid agent for FinMMEval 2026 Task 3: an eight-specialist LLM pipeline over news, SEC filings, fundamentals, analyst forecasts, technical indicators, and social sentiment, aggregated by a Meta-Agent for Tesla (TSLA), and a lightweight rule based three-signal vote for Bitcoin (BTC). On the final official leaderboard (accessed 2026-07-05), Fin-Analyst ranks first of all agents on TSLA with a +13.51% return, +28.33 points over Buy-and-Hold (Sharpe 4.10, 88% win rate), while the BTC vote ends flat yet well above a sharply falling baseline. Relative to the interim performance, the asset ranking reversed, indicating that short live windows yield volatility-sensitive rankings. Ablation identifies event-driven 8-K disclosures as the most influential TSLA signal. Error analysis shows that the memoryless agents repeat wrong calls for days at a time, and that the fixed-threshold BTC rules lost money by trading on noise in a sideways market while the LLM pipeline gained under similar conditions, motivating a memory-aware, LLM-based successor for both assets.", "authors": [ "Mohotarema Rashid", "Lingzi Hong", "Junhua Ding", "K. S. M. Tozammel Hossain" ], "year": 2026, "published_date": "2026-07-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.12233", "pdf_url": "https://arxiv.org/pdf/2607.12233", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Artificial Intelligence", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.55, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language model (LLM) trading agents show promising performance in equity markets, yet remain narrowly focused on US equities with little evidence from live deployment. We present Fin-Analyst, a hybrid agent for FinMMEval 2026 Task 3: an eight-specialist LLM pipeline over news, SEC filings, fundamentals, analyst forecasts, technical indicators, and social sentiment, aggregated by a Meta-Agent for Tesla (TSLA), and a lightweight rule based three-signal vote for Bitcoin (BTC).", "key_contribution": "Large language model (LLM) trading agents show promising performance in equity markets, yet remain narrowly focused on US equities with little evidence from live deployment.", "why_it_matters": "Fin-Analyst at FinMMEval 2026 Task 3: A Live Hybrid Trading Agent with LLM Specialists and Rule-Based Signals represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Large language model (LLM) trading agents show promising performance in equity markets, yet remain narrowly focused on…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.12233", "difficulty": "beginner" }, { "id": "arxiv:2507.04673", "source": "arxiv", "source_type": "preprint", "title": "Trojan Horse Prompting: Jailbreaking Conversational Multimodal Models by Forging Assistant Message", "abstract": "The rise of conversational interfaces has greatly enhanced LLM usability by leveraging dialogue history for sophisticated reasoning. However, this reliance introduces an unexplored attack surface. This paper introduces Trojan Horse Prompting, a novel jailbreak technique. Adversaries bypass safety mechanisms by forging the model's own past utterances within the conversational history provided to its API. A malicious payload is injected into a model-attributed message, followed by a benign user prompt to trigger harmful content generation. This vulnerability stems from Asymmetric Safety Alignment: models are extensively trained to refuse harmful user requests but lack comparable skepticism towards their own purported conversational history. This implicit trust in its \"past\" creates a high-impact vulnerability. Experimental validation on Google's Gemini-2.0-flash-preview-image-generation shows Trojan Horse Prompting achieves a significantly higher Attack Success Rate (ASR) than established user-turn jailbreaking methods. These findings reveal a fundamental flaw in modern conversational AI security, necessitating a paradigm shift from input-level filtering to robust, protocol-level validation of conversational context integrity.", "authors": [ "Wei Duan", "Li Qian" ], "year": 2026, "published_date": "2026-07-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2507.04673", "pdf_url": "https://arxiv.org/pdf/2507.04673", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Safety", "Multimodal", "Dialogue" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.71, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The rise of conversational interfaces has greatly enhanced LLM usability by leveraging dialogue history for sophisticated reasoning. However, this reliance introduces an unexplored attack surface.", "key_contribution": "This paper introduces Trojan Horse Prompting, a novel jailbreak technique.", "why_it_matters": "Trojan Horse Prompting: Jailbreaking Conversational Multimodal Models by Forging Assistant Message represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "This paper introduces Trojan Horse Prompting, a novel jailbreak technique.", "biggest_caveat": "However, this reliance introduces an unexplored attack surface.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2507.04673", "difficulty": "advanced" }, { "id": "arxiv:2607.10127", "source": "arxiv", "source_type": "preprint", "title": "GAE: Graph-Augmented Evolution for Scientific Discovery via Reinforcement Optimization", "abstract": "Evolutionary program search guided by Large Language Models (LLMs) has emerged as a powerful paradigm for automated scientific discovery. However, current approaches are fundamentally constrained by three bottlenecks: structurally blind parent selection, sparse whole-program evaluation rewards, and static mutation operators that fail to adapt during search. We present GAE (Graph-Augmented Evolution), a framework that resolves these limitations through a tightly coupled, three-pillar architecture. First, a relational graph neural network (GNN) parses programs into typed computation graphs, producing structure-aware embeddings. Second, an RL-optimized meta-controller leverages these embeddings to replace blind evolutionary sampling with a directed policy, dynamically selecting optimal parents and mutation directions based on reward history. Third, an online GRPO fine-tuning loop continuously updates the LLM mutation operator at test-time using group-normalized evaluation rewards, directly aligning the model's generation distribution with high-fitness structural edits. We evaluate GAE on a challenging scientific discovery task: symbolic regression for complex nonlinear oscillator systems. By transforming stochastic search into a directed, self-improving trajectory, GAE efficiently discovers closed-form physical equations, consistently matching or outperforming static LLM-driven baselines and achieving state-of-the-art out-of-distribution performance.", "authors": [ "Xuanzhou Chen", "Taoli Cheng" ], "year": 2026, "published_date": "2026-07-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.10127", "pdf_url": "https://arxiv.org/pdf/2607.10127", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "Fine-Tuning", "GNNs", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses stochastic and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.31, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Evolutionary program search guided by Large Language Models (LLMs) has emerged as a powerful paradigm for automated scientific discovery. However, current approaches are fundamentally constrained by three bottlenecks: structurally blind parent selection, sparse whole-program evaluation rewards, and static mutation operators that fail to adapt during search.", "key_contribution": "We present GAE (Graph-Augmented Evolution), a framework that resolves these limitations through a tightly coupled, three-pillar architecture.", "why_it_matters": "GAE: Graph-Augmented Evolution for Scientific Discovery via Reinforcement Optimization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present GAE (Graph-Augmented Evolution), a framework that resolves these limitations through a tightly coupled,…", "biggest_caveat": "limitations through a tightly coupled, three-pillar architecture.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.10127", "difficulty": "frontier" }, { "id": "arxiv:2607.10569", "source": "arxiv", "source_type": "preprint", "title": "When Does Restricting a Coding Agent to execute_code Help? A Regime $\\times$ Agent-Design Ablation", "abstract": "Modern coding agents expose multiple tool surfaces -- IDE primitives, bash, and Model Context Protocol (MCP) code-execution -- and the field has shipped three contradictory claims about which one matters. We run the missing crossed comparison: an integrity-clean three-arm ablation (baseline / bash_only / code_only) on synthetic computation tasks and SWE-bench Mini modification tasks, holding model, harness, and prompts fixed, with two agents (Claude Code, OpenAI Codex CLI) so the comparison spans both regime and agent-design axes. Across the four resulting (regime, agent) cells, restricting the agent to a single execute_code MCP tool is cheaper than -- or statistically tied with -- its cheapest tool-rich rival in three cells (significantly on Artifact/Claude and SWE-bench/Codex; directionally on Artifact/Codex), with pass rates statistically tied within each cell. The lone exception is SWE-bench/Claude, where code_only is directionally costlier (+14.4%, not significant); a conditional-cost analysis localizes that gap to failure-cost on doomed-run trajectories, not a per-edit tax on successful runs. Two implications: the cheapest tool surface is jointly determined by task regime and agent design rather than by either axis alone, and the headline cost signal lives in cache-adjusted cost -- not pass rate, which is invariant across surfaces at the model sizes we evaluate. The benchmark harness, task suite, and analysis code are available at https://github.com/hyang0129/onlycodes.", "authors": [ "Hong Yang", "Qi Yu", "Travis Desell" ], "year": 2026, "published_date": "2026-07-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.10569", "pdf_url": "https://arxiv.org/pdf/2607.10569", "citations": 0, "topics": [], "tags": [ "Code Generation", "Evaluation", "Artificial Intelligence", "Software Engineering", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.02, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Modern coding agents expose multiple tool surfaces -- IDE primitives, bash, and Model Context Protocol (MCP) code-execution -- and the field has shipped three contradictory claims about which one matters. We run the missing crossed comparison: an integrity-clean three-arm ablation (baseline / bash_only / code_only) on synthetic computation tasks and SWE-bench Mini modification tasks, holding model, harness, and prompts fixed, with two agents (Claude Code, OpenAI Codex CLI) so the comparison spans both regime and agent-design axes.", "key_contribution": "Modern coding agents expose multiple tool surfaces -- IDE primitives, bash, and Model Context Protocol (MCP) code-execution -- and the field has shipped three contradictory claims about which one matters.", "why_it_matters": "When Does Restricting a Coding Agent to execute_code Help? A Regime $\\times$ Agent-Design Ablation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Code Generation.", "one_line_takeaway": "Modern coding agents expose multiple tool surfaces -- IDE primitives, bash, and Model Context Protocol (MCP)…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Code Generation.", "url": "https://arxiv.org/abs/2607.10569", "difficulty": "beginner" }, { "id": "arxiv:2607.11349", "source": "arxiv", "source_type": "preprint", "title": "Inter-Stop Energy Prediction and Causal Driver Quantification for Dual-Source Trolleybuses via a Time-Aware Tabular Deep Learning Architecture", "abstract": "Dual-source trolleybuses alternate between overhead catenary supply and on-board battery operation, creating energy-use patterns driven by route attributes, high-frequency trajectories, and hourly weather. Existing models struggle to represent these heterogeneous inputs and rarely explain the causal drivers of consumption. This paper proposes a time-aware tabular deep learning framework for inter-stop energy management. Periodic time encoding is integrated into a parameter-efficient batch-ensemble backbone to jointly learn static and sequential features, while Bayesian optimization with tree-structured density estimation tunes hyperparameters. To move beyond prediction, a three-layer causal explanation pipeline combines feature attribution for marginal effects, a linear non-Gaussian acyclic model for causal direction discovery, and a meta-learner for net average treatment effects. Experiments on the Zurich trolleybus dataset enriched with meteorological records achieve a MAPE of 6.52% and R of 0.982, outperforming ten statistical, tree-ensemble, and deep learning baselines. Ablation results show that periodic time encoding contributes most to the accuracy gain. Causal analysis identifies regenerative braking ratio and average speed as the strongest energy-saving factors, while coasting distance is the main driver of excess consumption. The findings offer actionable thresholds for vehicle technology, driving behavior, capacity allocation, and catenary network planning.", "authors": [ "Wentao Zeng", "Zijian Huang", "Yiming Bie", "Jiabin Wu", "Jun Gong" ], "year": 2026, "published_date": "2026-07-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.11349", "pdf_url": "https://arxiv.org/pdf/2607.11349", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Info Extraction", "Structured Data", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.88, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Dual-source trolleybuses alternate between overhead catenary supply and on-board battery operation, creating energy-use patterns driven by route attributes, high-frequency trajectories, and hourly weather. Existing models struggle to represent these heterogeneous inputs and rarely explain the causal drivers of consumption.", "key_contribution": "Experiments on the Zurich trolleybus dataset enriched with meteorological records achieve a MAPE of 6.52% and R of 0.982, outperforming ten statistical, tree-ensemble, and deep learning baselines.", "why_it_matters": "Inter-Stop Energy Prediction and Causal Driver Quantification for Dual-Source Trolleybuses via a Time-Aware Tabular Deep Learning Architecture represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "Experiments on the Zurich trolleybus dataset enriched with meteorological records achieve a MAPE of 6.52% and R of…", "biggest_caveat": "butes, high-frequency trajectories, and hourly weather.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2607.11349", "difficulty": "frontier" }, { "id": "arxiv:2607.11352", "source": "arxiv", "source_type": "preprint", "title": "Cover Semantics for Intuitionistic Modalities", "abstract": "Intuitionistic modal logic (IML) has inspired several developments in programming languages including modal type systems for staging, computational effects and language-based security. IMLs are typically studied using Kripke-style relational semantics, which simplifies proofs of meta-theoretic properties, such as completeness and consistency, by making it easy to construct models. Kripke-style relational semantics, however, relies upon classical reasoning principles, which makes it unappealing from a computational perspective and unsuitable for formalization in a constructive type theory. Goldblatt provides an alternative semantics for IMLs by extending Beth-Kripke-Joyal-style \"cover\" semantics for intuitionistic propositional logic with relations to support modalities. Goldblatt's \"relational cover\" semantics overcomes classical reasoning but introduces a new limitation: it relies upon a \"modal localization\" condition that restricts the class of models and complicates model construction. Goldblatt bypasses this restriction by using intricate order-theoretic completion arguments to prove completeness. In this article, we present a conservative extension of relational cover semantics that alleviates this restriction and is amenable to simpler and standard model construction techniques. We formalize our semantics in Agda and prove completeness constructively in the style of Normalization by Evaluation for a variety of IMLs featuring independent box and diamond modalities.", "authors": [ "Nachiappan Valliappan" ], "year": 2026, "published_date": "2026-07-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.11352", "pdf_url": "https://arxiv.org/pdf/2607.11352", "citations": 0, "topics": [], "tags": [ "Reasoning", "Programming Languages" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.48, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Intuitionistic modal logic (IML) has inspired several developments in programming languages including modal type systems for staging, computational effects and language-based security. IMLs are typically studied using Kripke-style relational semantics, which simplifies proofs of meta-theoretic properties, such as completeness and consistency, by making it easy to construct models.", "key_contribution": "In this article, we present a conservative extension of relational cover semantics that alleviates this restriction and is amenable to simpler and standard model construction techniques.", "why_it_matters": "Cover Semantics for Intuitionistic Modalities represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "In this article, we present a conservative extension of relational cover semantics that alleviates this restriction and…", "biggest_caveat": "but introduces a new limitation: it relies upon a \"modal localization\" condition that restricts the class of models and complicates model construction.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2607.11352", "difficulty": "intermediate" }, { "id": "arxiv:2505.14300", "source": "arxiv", "source_type": "preprint", "title": "Beyond Black-Box Obfuscation: Mechanistic Analysis and Defense of White-Box Monitors", "abstract": "White-box monitoring is increasingly adopted as an auditing tool as Large Language Models (LLMs) are deployed in daily operations to ensure safe model behavior. However, white-box monitors can be circumvented, and the mechanisms underlying such evasion have not been systematically characterized, nor have principled defenses been proposed. This work addresses both challenges. Controlled red-team experiments reveal two primary evasion strategies: geometric shifting, defined as the systematic migration of information between linear and non-linear representational subspaces, and covariance manipulation. These mechanisms account for the failure of single-detector approaches, as information migrates to subspaces inaccessible to individual detectors. This issue is urgent due to growing evidence that models are becoming evaluation-aware, enabling those with misaligned objectives to exploit these vulnerabilities and evade monitoring during deployment. In response, \\textsc{SafetyNet} is introduced as a principled ensemble, with dual purpose: it provides further empirical validation that our mechanistic findings are real and actionable, and it offers a concrete starting point for future work on robust latent-space monitoring. The study experiment across five model families on the MAD and Anthropic Sleeper Agent benchmark, with SafetyNet achieving around 100\\% AUROC scores outscoring Beatrix and CROW. The code is available at: https://github.com/MaheepChaudhary/eval-aware-evasion", "authors": [ "Maheep Chaudhary", "Fazl Barez" ], "year": 2026, "published_date": "2026-07-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2505.14300", "pdf_url": "https://arxiv.org/pdf/2505.14300", "citations": 0, "topics": [], "tags": [ "LLMs", "Robotics", "Evaluation", "NLP", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.92, "content_potential_score": 2.34, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "White-box monitoring is increasingly adopted as an auditing tool as Large Language Models (LLMs) are deployed in daily operations to ensure safe model behavior. However, white-box monitors can be circumvented, and the mechanisms underlying such evasion have not been systematically characterized, nor have principled defenses been proposed.", "key_contribution": "White-box monitoring is increasingly adopted as an auditing tool as Large Language Models (LLMs) are deployed in daily operations to ensure safe model behavior.", "why_it_matters": "Beyond Black-Box Obfuscation: Mechanistic Analysis and Defense of White-Box Monitors represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "White-box monitoring is increasingly adopted as an auditing tool as Large Language Models (LLMs) are deployed in daily…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2505.14300", "difficulty": "beginner" }, { "id": "arxiv:2509.15254", "source": "arxiv", "source_type": "preprint", "title": "OIPP: Object-Adaptive Impact Point Predictor for Catching Diverse In-Flight Objects", "abstract": "In this study, we address the problem of in-flight object catching using a quadruped robot with a basket. Our objective is to accurately predict the impact point, defined as the object's landing position. This task poses two key challenges: the absence of public datasets capturing diverse objects under unsteady aerodynamics, which are essential for training reliable predictors; and the difficulty of accurate early-stage impact point prediction when trajectories appear similar across objects. To overcome these issues, we construct a real-world dataset of 8,000 trajectories from 20 objects, providing a foundation for advancing in-flight object catching under complex aerodynamics. We then propose the Object-Adaptive Impact Point Predictor (OIPP), consisting of two modules: (i) an Object-Adaptive Encoder (OAE) that extracts object-dependent representations from motion histories, and (ii) an Impact Point Predictor (IPP) that estimates the impact point from these representations. Two IPP variants are implemented: a Neural Acceleration Estimator (NAE)-based method that predicts trajectories and derives the impact point, and a Direct Point Estimator (DPE)-based method that directly outputs it. Experimental results show that our dataset is more diverse and complex than existing datasets, and that our method outperforms baselines on both 15 seen and 5 unseen objects. Furthermore, we show that improved early-stage prediction enhances catching success in simulation and demonstrate the effectiveness of our approach through real-robot experiments. The demonstration is available at https://sites.google.com/view/robot-catching-2025.", "authors": [ "Ngoc Huy Nguyen", "Kazuki Shibata", "Takamitsu Matsubara" ], "year": 2026, "published_date": "2026-07-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.15254", "pdf_url": "https://arxiv.org/pdf/2509.15254", "citations": 0, "topics": [], "tags": [ "Robotics" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.2, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In this study, we address the problem of in-flight object catching using a quadruped robot with a basket. Our objective is to accurately predict the impact point, defined as the object's landing position.", "key_contribution": "We then propose the Object-Adaptive Impact Point Predictor (OIPP), consisting of two modules: (i) an Object-Adaptive Encoder (OAE) that extracts object-dependent representations from motion histories, and (ii) an Impact Point Predictor (IPP) that estimates the impact point from these representations.", "why_it_matters": "OIPP: Object-Adaptive Impact Point Predictor for Catching Diverse In-Flight Objects represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We then propose the Object-Adaptive Impact Point Predictor (OIPP), consisting of two modules: (i) an Object-Adaptive…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2509.15254", "difficulty": "intermediate" }, { "id": "arxiv:2602.17254", "source": "arxiv", "source_type": "preprint", "title": "Trivance: Latency-Optimal AllReduce by Shortcutting Multiport Networks", "abstract": "AllReduce is a fundamental collective communication operation in distributed computing and a key performance bottleneck for large-scale training and inference. Its completion time is determined by the number of communication steps, which dominate latency-sensitive workloads, and the communication distance affecting both latency- and bandwidth-bound regimes. Direct-connect topologies, such as Google's TPUv4 tori, are particularly prone to large communication distances due to limited bisection bandwidth. In this paper, we present Trivance, a novel AllReduce algorithm that completes within $\\log_3 n$ steps - a 50% improvement in comparison to Swing and Recursive Doubling, while reducing congestion compared to Bruck's algorithm by a factor of three and preserving bandwidth-optimality. Trivance exploits both transmission ports of a bidirectional ring within each step to triple the communication distance along both directions simultaneously. By performing joint reductions, Trivance improves both the number of steps and network congestion. We further show that Trivance extends naturally to multidimensional torus networks, retaining its latency advantage while achieving performance comparable to bandwidth-optimal algorithms for large AllReduce sizes. Our packet-level SST simulation shows that Trivance improves state-of-the-art approaches by 5-30% for AllReduce sizes up to 8 MiB, in high-bandwidth settings up to 32 MiB and for 3D tori up to 128 MiB. Throughout the evaluation, Trivance remains the best-performing latency-optimal algorithm.", "authors": [ "Anton Juerss", "Vamsi Addanki", "Stefan Schmid" ], "year": 2026, "published_date": "2026-07-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.17254", "pdf_url": "https://arxiv.org/pdf/2602.17254", "citations": 0, "topics": [], "tags": [ "Distributed Computing" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.25, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "AllReduce is a fundamental collective communication operation in distributed computing and a key performance bottleneck for large-scale training and inference. Its completion time is determined by the number of communication steps, which dominate latency-sensitive workloads, and the communication distance affecting both latency- and bandwidth-bound regimes.", "key_contribution": "In this paper, we present Trivance, a novel AllReduce algorithm that completes within $\\log_3 n$ steps - a 50% improvement in comparison to Swing and Recursive Doubling, while reducing congestion compared to Bruck's algorithm by a factor of three and preserving bandwidth-optimality.", "why_it_matters": "Trivance: Latency-Optimal AllReduce by Shortcutting Multiport Networks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Distributed Computing.", "one_line_takeaway": "In this paper, we present Trivance, a novel AllReduce algorithm that completes within $\\log_3 n$ steps - a 50%…", "biggest_caveat": "buted computing and a key performance bottleneck for large-scale training and inference.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Distributed Computing.", "url": "https://arxiv.org/abs/2602.17254", "difficulty": "intermediate" }, { "id": "arxiv:2607.08938", "source": "arxiv", "source_type": "preprint", "title": "Better Harnesses, Smaller Models: Building 90% Cheaper Agents via Automated Harness Adaptation", "abstract": "Frontier LLM agents are automating many business tasks, but their high inference cost makes large-scale deployment unsustainable. Small language models (SLMs) offer a cheaper alternative, yet they typically fall short when swapped into a harness designed for a frontier LLM. We show that for many routine business tasks, SLM agents can match LLM performance at 90% lower cost, when paired with an adapted harness that can be automatically discovered by a meta agent. The key insight is that much of the task difficulty is shared across instances and can be lifted from the model into the harness via tailored instructions, tools, and orchestration loops. To study this systematically, we create a framework that maps agent failure modes to harness adaptation strategies, and build a harness optimizer that automatically discovers effective adaptations from failure trajectories. Across seven business-oriented agentic tasks and three SLM families, we found optimized harnesses significantly improve performance on 16 of 21 task-SLM pairs, with seven pairs closing the SLM-LLM performance gap and the best SLM agent recovering 89.7% of LLM performance at 4% of the cost. Our analysis further shows that adaptation works best for tasks with more repetitive workflows and for SLMs with sufficient base capabilities. Together, these results suggest that harness adaptation can expand the practical deployment range of SLM agents in routine business tasks.", "authors": [ "Chenyang Yang", "Xinran Zhao", "Tongshuang Wu", "Christian Kästner" ], "year": 2026, "published_date": "2026-07-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.08938", "pdf_url": "https://arxiv.org/pdf/2607.08938", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Software Engineering" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.62, "content_potential_score": 1.0, "interestingness_score": 2.0, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Frontier LLM agents are automating many business tasks, but their high inference cost makes large-scale deployment unsustainable. Small language models (SLMs) offer a cheaper alternative, yet they typically fall short when swapped into a harness designed for a frontier LLM.", "key_contribution": "We show that for many routine business tasks, SLM agents can match LLM performance at 90% lower cost, when paired with an adapted harness that can be automatically discovered by a meta agent.", "why_it_matters": "Better Harnesses, Smaller Models: Building 90% Cheaper Agents via Automated Harness Adaptation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We show that for many routine business tasks, SLM agents can match LLM performance at 90% lower cost, when paired with…", "biggest_caveat": "but their high inference cost makes large-scale deployment unsustainable.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.08938", "difficulty": "intermediate" }, { "id": "arxiv:2607.09086", "source": "arxiv", "source_type": "preprint", "title": "Subtoken Vision Transformer for Fine-grained Recognition", "abstract": "We present Subtoken Vision Transformer (SubViT), a selective image tokenization method for fine-grained visual recognition. Standard Vision Transformers compress each fixed-size patch into a single token, although fine-grained distinctions often depend on localized variations within only a few patches. SubViT addresses this mismatch by representing discriminative patches with multiple subtokens while retaining the original token sequence for global context, thereby allocating additional capacity where it is most needed. Since attention heads encode complementary semantics and extracting attention maps at inference requires an extra backbone forward, we adopt a two-stage training strategy. Stage 1 fine-tunes the ViT using subdivision regions sampled from random attention heads, exposing the model to diverse subdivision patterns. Stage 2 identifies informative attention maps through feature-degradation distances and distills them into a lightweight single-map router, which directly predicts deterministic token-importance scores without a separate attention forward. We evaluate SubViT on Generalized Category Discovery (GCD), a challenging task requiring both fine-grained discrimination and generalization to unlabeled novel categories. Across CUB, FGVC-Aircraft, and Stanford Cars, SubViT improves the average novel-category accuracy of DINOv2 from $81.3\\%$ to $84.7\\%$, with only $0.50$ ms additional latency and $3.4\\%$ more FLOPs, while reducing latency by $73.8\\%$ relative to Retina Patch. Results on CIFAR-10 and ImageNet-100 demonstrate its broader applicability.", "authors": [ "Jie Zhu", "Ivy Zhang", "Minchul Kim", "Xiaoming Liu" ], "year": 2026, "published_date": "2026-07-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.09086", "pdf_url": "https://arxiv.org/pdf/2607.09086", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Transformers", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.06, "content_potential_score": 0.55, "interestingness_score": 1.77, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present Subtoken Vision Transformer (SubViT), a selective image tokenization method for fine-grained visual recognition. Standard Vision Transformers compress each fixed-size patch into a single token, although fine-grained distinctions often depend on localized variations within only a few patches.", "key_contribution": "We present Subtoken Vision Transformer (SubViT), a selective image tokenization method for fine-grained visual recognition.", "why_it_matters": "Subtoken Vision Transformer for Fine-grained Recognition advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We present Subtoken Vision Transformer (SubViT), a selective image tokenization method for fine-grained visual…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2607.09086", "difficulty": "intermediate" }, { "id": "arxiv:2607.07727", "source": "arxiv", "source_type": "preprint", "title": "SPL: Orchestrating Workflows with Declarative Deterministic-Probabilistic Composition", "abstract": "We present SPL (Structured Prompt Language), a declarative language that composes deterministic and probabilistic computation modes in a single specification. While existing frameworks separate these -- orchestration systems (AutoGen, CrewAI, LangGraph) for LLM calls, symbolic tools (SymPy, SageMath, Lean) for computation -- SPL unifies them. It provides GENERATE/EVALUATE for probabilistic computation and SOLVE/ASSERT for deterministic computation, sharing syntax, variable bindings, and runtime routing. A .spl specification runs unchanged across local nodes (Ollama), cloud APIs (OpenRouter, Anthropic), and distributed grids (Momagrid), with model and verifier selection deferred to invocation time. We validate SPL through an extensive 78-recipe cookbook and a controlled 1,200-run experiment (10 models x 20 problems x 2 arms x 3 repetitions; the 20 problems span 6 difficulty tiers). The solver arm achieves 82-93% machine-verified correctness (sonnet-4-6: 85%, gemma4:e2b: 93%) while the LLM-only arm measures output production without mathematical verification, making the comparison one of verified correctness against unverified fluency. A backend difficulty gradient emerges (SymPy 78%, Sage 54%), and the dominant failure mode is solver_error (kernel-rejected expressions), not format non-compliance.", "authors": [ "Wen G. Gong" ], "year": 2026, "published_date": "2026-07-06", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.07727", "pdf_url": "https://arxiv.org/pdf/2607.07727", "citations": 0, "topics": [], "tags": [ "LLMs", "NLP", "Programming Languages" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.39, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present SPL (Structured Prompt Language), a declarative language that composes deterministic and probabilistic computation modes in a single specification. While existing frameworks separate these -- orchestration systems (AutoGen, CrewAI, LangGraph) for LLM calls, symbolic tools (SymPy, SageMath, Lean) for computation -- SPL unifies them.", "key_contribution": "We present SPL (Structured Prompt Language), a declarative language that composes deterministic and probabilistic computation modes in a single specification.", "why_it_matters": "SPL: Orchestrating Workflows with Declarative Deterministic-Probabilistic Composition represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present SPL (Structured Prompt Language), a declarative language that composes deterministic and probabilistic…", "biggest_caveat": "buted grids (Momagrid), with model and verifier selection deferred to invocation time.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.07727", "difficulty": "intermediate" }, { "id": "arxiv:2607.08499", "source": "arxiv", "source_type": "preprint", "title": "Cross-seed explainability using Procrustes-conditioned Joint End-to-end Top-K Sparse Autoencoders", "abstract": "We present a Procrustes-conditioned Joint End-to-end Top-K Sparse Autoencoder (SAE) for extracting cross-seed universal features from independently trained BERT models. Cross-seed feature universality is a fundamental challenge in mechanistic interpretability: because dictionary learning is non-convex, independently trained networks learn misaligned feature spaces, so apparently identical features may differ by random initialization. We address this by computing an orthogonal Procrustes rotation between seeds' activation spaces before joint SAE training, combining Top-K sparsity, end-to-end downstream optimization, and an auxiliary dead-feature revival loss based on previous SAE literature. Evaluating on five independent seed pairs (ten BERT models) across three benchmark datasets (SST-2, Stanford Politeness, TweetEval Emotion), our full pipeline produces more universal features (Pearson r $\\geq$ 0.70 across seeds) than post-hoc alignment baselines on all three datasets. A minimal qualitative analysis confirms that high-universality features encode interpretable sociolinguistic patterns.", "authors": [ "Bendegúz Váradi", "Zoltán Kmetty" ], "year": 2026, "published_date": "2026-07-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.08499", "pdf_url": "https://arxiv.org/pdf/2607.08499", "citations": 0, "topics": [], "tags": [ "AI Safety", "Interpretability", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.19, "content_potential_score": 1.92, "interestingness_score": 2.46, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present a Procrustes-conditioned Joint End-to-end Top-K Sparse Autoencoder (SAE) for extracting cross-seed universal features from independently trained BERT models. Cross-seed feature universality is a fundamental challenge in mechanistic interpretability: because dictionary learning is non-convex, independently trained networks learn misaligned feature spaces, so apparently identical features may differ by random initialization.", "key_contribution": "We present a Procrustes-conditioned Joint End-to-end Top-K Sparse Autoencoder (SAE) for extracting cross-seed universal features from independently trained BERT models.", "why_it_matters": "Cross-seed explainability using Procrustes-conditioned Joint End-to-end Top-K Sparse Autoencoders represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We present a Procrustes-conditioned Joint End-to-end Top-K Sparse Autoencoder (SAE) for extracting cross-seed universal…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2607.08499", "difficulty": "beginner" }, { "id": "arxiv:2607.07288", "source": "arxiv", "source_type": "preprint", "title": "InfraQR: Edge-Placed QR-Inspired Structured Patch Attacks on Infrared Vision-Language Models", "abstract": "Infrared vision-language models are increasingly used for perception under low-light and adverse visual conditions, yet their robustness to localized structured perturbations remains underexplored. Existing infrared adversarial studies mainly focus on object detectors, leaving the security of infrared vision-language models less systematically examined. We present InfraQR, a QR-inspired structured patch attack for infrared vision-language models. Unlike localized attacks that attach perturbations to the target object, InfraQR places a compact structured patch along image boundaries and optimizes learnable grid cells through surrogate CLIP-style encoders. The resulting patch has a near-binary structured appearance, but is not required to be a valid or machine-readable QR code. We evaluate InfraQR on infrared classification, caption transfer, and question-answer-aware visual question answering (VQA) tasks. On a 300-image infrared benchmark, InfraQR sharply reduces the accuracy of multiple CLIP-style classifiers, including reducing OpenAI CLIP accuracy from 98.67% to 0.70%. The generated adversarial images also transfer to black-box captioning and VQA models, causing semantic degradation in captions and more error-prone answers under GPT-5.4-based evaluation. These results show that infrared vision-language models remain vulnerable to structured edge-placed perturbations, motivating further study of cross-task robustness beyond direct object occlusion.", "authors": [ "Xin Li", "Jiaju Han", "Ma Yaqi", "Chengyin Hu", "Yingying Zhao", "Jiahuan Long", "Fengyu Zhang", "Yahui Chai" ], "year": 2026, "published_date": "2026-07-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.07288", "pdf_url": "https://arxiv.org/pdf/2607.07288", "citations": 0, "topics": [], "tags": [ "LLMs", "VLMs", "QA", "Adversarial", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.06, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Infrared vision-language models are increasingly used for perception under low-light and adverse visual conditions, yet their robustness to localized structured perturbations remains underexplored. Existing infrared adversarial studies mainly focus on object detectors, leaving the security of infrared vision-language models less systematically examined.", "key_contribution": "We present InfraQR, a QR-inspired structured patch attack for infrared vision-language models.", "why_it_matters": "InfraQR: Edge-Placed QR-Inspired Structured Patch Attacks on Infrared Vision-Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present InfraQR, a QR-inspired structured patch attack for infrared vision-language models.", "biggest_caveat": "but is not required to be a valid or machine-readable QR code.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.07288", "difficulty": "beginner" }, { "id": "arxiv:2311.10090", "source": "arxiv", "source_type": "preprint", "title": "JaxMARL: Multi-Agent RL Environments and Algorithms in JAX", "abstract": "Benchmarks are crucial in the development of machine learning algorithms, with available environments significantly influencing reinforcement learning (RL) research. Traditionally, RL environments run on the CPU, which limits their scalability with typical academic compute. However, recent advancements in JAX have enabled the wider use of hardware acceleration, enabling massively parallel RL training pipelines and environments. While this has been successfully applied to single-agent RL, it has not yet been widely adopted for multi-agent scenarios. In this paper, we present JaxMARL, the first open-source, Python-based library that combines GPU-enabled efficiency with support for a large number of commonly used MARL environments and popular baseline algorithms. Our experiments show that, in terms of wall clock time, our JAX-based training pipeline is around 14 times faster than existing approaches, and up to 12500x when multiple training runs are vectorized. This enables efficient and thorough evaluations, potentially alleviating the evaluation crisis in the field. We also introduce and benchmark SMAX, a JAX-based approximate reimplementation of the popular StarCraft Multi-Agent Challenge, which removes the need to run the StarCraft II game engine. This not only enables GPU acceleration, but also provides a more flexible MARL environment, unlocking the potential for self-play, meta-learning, and other future applications in MARL. The code is available at https://github.com/flairox/jaxmarl.", "authors": [ "Alexander Rutherford", "Benjamin Ellis", "Matteo Gallici", "Jonathan Cook", "Andrei Lupu", "Gardar Ingvarsson", "Timon Willi", "Ravi Hammond", "Akbir Khan", "Christian Schroeder de Witt", "Alexandra Souly", "Saptarashmi Bandyopadhyay", "Mikayel Samvelyan", "Minqi Jiang", "Robert Tjarko Lange", "Shimon Whiteson", "Bruno Lacerda", "Nick Hawes", "Tim Rocktaschel", "Chris Lu", "Jakob Nicolaus Foerster" ], "year": 2026, "published_date": "2026-07-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2311.10090", "pdf_url": "https://arxiv.org/pdf/2311.10090", "citations": 0, "topics": [], "tags": [ "RL", "Evaluation", "Artificial Intelligence", "Multi-Agent Systems", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.84, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Benchmarks are crucial in the development of machine learning algorithms, with available environments significantly influencing reinforcement learning (RL) research. Traditionally, RL environments run on the CPU, which limits their scalability with typical academic compute.", "key_contribution": "In this paper, we present JaxMARL, the first open-source, Python-based library that combines GPU-enabled efficiency with support for a large number of commonly used MARL environments and popular baseline algorithms.", "why_it_matters": "JaxMARL: Multi-Agent RL Environments and Algorithms in JAX represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "In this paper, we present JaxMARL, the first open-source, Python-based library that combines GPU-enabled efficiency…", "biggest_caveat": "However, recent advancements in JAX have enabled the wider use of hardware acceleration, enabling massively parallel RL training pipelines and environments.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2311.10090", "difficulty": "beginner" }, { "id": "arxiv:2510.22298", "source": "arxiv", "source_type": "preprint", "title": "MetaCaDI: A Meta-Learning Framework for Causal Discovery from Multiple Environments with Unknown Interventions", "abstract": "Uncovering the causal mechanisms of complex real-world systems remains a significant challenge, as these systems often entail high data collection costs and involve unknown interventions. We introduce MetaCaDI, the first framework to cast the identification of unknown interventions as a meta-learning problem, explicitly leveraging a jointly learned causal graph. MetaCaDI is a Bayesian framework that learns a shared causal structure across multiple environments and is optimized to rapidly adapt to new, few-shot intervention target identification tasks. A key innovation is our model's analytical adaptation, which uses a closed-form solution to bypass expensive and potentially unstable gradient-based bilevel optimization. Extensive experiments on synthetic and complex gene expression data demonstrate that MetaCaDI significantly outperforms state-of-the-art methods. It excels at identifying intervention targets from as few as 3 samples - where existing methods collapse to random chance - while robustly recovering the shared causal graph, proving its effectiveness in data-scarce scenarios.", "authors": [ "Hans Jarett Ong", "Yoichi Chikahara", "Tomoharu Iwata" ], "year": 2026, "published_date": "2026-07-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.22298", "pdf_url": "https://arxiv.org/pdf/2510.22298", "citations": 0, "topics": [], "tags": [ "Prompting", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.32, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Uncovering the causal mechanisms of complex real-world systems remains a significant challenge, as these systems often entail high data collection costs and involve unknown interventions. We introduce MetaCaDI, the first framework to cast the identification of unknown interventions as a meta-learning problem, explicitly leveraging a jointly learned causal graph.", "key_contribution": "We introduce MetaCaDI, the first framework to cast the identification of unknown interventions as a meta-learning problem, explicitly leveraging a jointly learned causal graph.", "why_it_matters": "MetaCaDI: A Meta-Learning Framework for Causal Discovery from Multiple Environments with Unknown Interventions represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We introduce MetaCaDI, the first framework to cast the identification of unknown interventions as a meta-learning…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2510.22298", "difficulty": "frontier" }, { "id": "arxiv:2607.01740", "source": "arxiv", "source_type": "preprint", "title": "Meta-Benchmarks for Financial-Services LLM Evaluation", "abstract": "Public LLM leaderboards optimise for global average performance and do not capture the specific cognitive demands of financial-services work: a model that leads on MMLU-Pro may underperform on document-grounded compliance reasoning, and a coding leader may handle multi-turn customer interactions poorly. We present a meta-benchmarking framework that organises 452 publicly reported benchmarks into 41 O*NET Generalized Work Activities and aggregates those into 38 BIAN banking business domains spanning sales, operations, risk, and support work. A multiplicative weighting scheme (discrimination x coverage x recency), computed over a rolling model window, rewards benchmarks that still separate the best models, are widely reported, and remain in active use, suppressing saturated legacy tests automatically. These weights scale the K-factor in a pairwise Elo tournament, producing cross-benchmark-comparable work-activity scores without raw score normalisation; business-domain scores are weighted averages of the constituent work-activity Elos. We demonstrate the framework on a point-in-time public snapshot covering 288 models across 25 organisations as of June 2026, and describe the methodology, full taxonomy, design decisions, and limitations with the aim of making the approach reproducible for institutions facing similar selection and governance challenges.", "authors": [ "Blair Hudson" ], "year": 2026, "published_date": "2026-07-02", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.01740", "pdf_url": "https://arxiv.org/pdf/2607.01740", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.21, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Public LLM leaderboards optimise for global average performance and do not capture the specific cognitive demands of financial-services work: a model that leads on MMLU-Pro may underperform on document-grounded compliance reasoning, and a coding leader may handle multi-turn customer interactions poorly. We present a meta-benchmarking framework that organises 452 publicly reported benchmarks into 41 O*NET Generalized Work Activities and aggregates those into 38 BIAN banking business domains spanning sales, operations, risk, and support work.", "key_contribution": "We present a meta-benchmarking framework that organises 452 publicly reported benchmarks into 41 O*NET Generalized Work Activities and aggregates those into 38 BIAN banking business domains spanning sales, operations, risk, and support work.", "why_it_matters": "Meta-Benchmarks for Financial-Services LLM Evaluation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a meta-benchmarking framework that organises 452 publicly reported benchmarks into 41 O*NET Generalized Work…", "biggest_caveat": "limitations with the aim of making the approach reproducible for institutions facing similar selection and governance challenges.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.01740", "difficulty": "beginner" }, { "id": "arxiv:2607.00334", "source": "arxiv", "source_type": "preprint", "title": "Managed Autonomy at Runtime: Gear-Based Safety and Governance for Single- and Multi-Agent Cyber-Physical Systems", "abstract": "Autonomous agents, whether LLM-driven software agents or robotic physical agents, face a common class of failure modes when operating without continuous human oversight: safety violations from unverified actions, behavioral instability from unconstrained loops, and continuity loss from unhandled error states. We develop \\system{}, a discrete-time control system that combines five execution gears (\\Gobs{}, \\Gsug{}, \\Gplan{}, \\Gexec{}, \\Gint{}) with utility-gated dispatch and event-driven fallback. For the single-agent case, we prove monotonic stability, execution safety, eventual stabilization, fallback completeness, and equivalence to a gear-constrained Markov decision process. For multi-agent cyber-physical systems (CPS), we apply the established \\smart{} managed-autonomy lifecycle and map runtime evidence into its four governance states (\\Stable{}/\\Meta{}/\\Assisted{}/\\Regulated{}). Consensus gating, swarm-level Lyapunov analysis, per-agent gear authority, and rendezvous control provide distributed safety and stability guarantees, including zero collision under the stated assumptions. We evaluate the resulting runtime on a three-agent UR5 robotic assembly cell using fault magnitudes calibrated from the NIST \\emph{Degradation Measurement of Robot Arm Position Accuracy} dataset across 10,000 Monte Carlo episodes. It achieves a 99.6\\% anomaly detection rate versus 2.1\\% for the single-agent baseline, reduces detection latency by $3.5\\times$, and supplies a formal physical-workspace safety certificate. The execution gears act as micro-level permissions beneath the \\smart{} runtime governance states, separating action control from autonomy governance.", "authors": [ "Srini Ramaswamy", "Wang Miaosheng" ], "year": 2026, "published_date": "2026-07-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.00334", "pdf_url": "https://arxiv.org/pdf/2607.00334", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Robotics", "Artificial Intelligence" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.38, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Autonomous agents, whether LLM-driven software agents or robotic physical agents, face a common class of failure modes when operating without continuous human oversight: safety violations from unverified actions, behavioral instability from unconstrained loops, and continuity loss from unhandled error states. We develop \\system{}, a discrete-time control system that combines five execution gears (\\Gobs{}, \\Gsug{}, \\Gplan{}, \\Gexec{}, \\Gint{}) with utility-gated dispatch and event-driven fallback.", "key_contribution": "Autonomous agents, whether LLM-driven software agents or robotic physical agents, face a common class of failure modes when operating without continuous human oversight: safety violations from unverified actions, behavioral instability from unconstrained loops, and continuity loss from unhandled error states.", "why_it_matters": "Managed Autonomy at Runtime: Gear-Based Safety and Governance for Single- and Multi-Agent Cyber-Physical Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Autonomous agents, whether LLM-driven software agents or robotic physical agents, face a common class of failure modes…", "biggest_caveat": "buted safety and stability guarantees, including zero collision under the stated assumptions.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2607.00334", "difficulty": "intermediate" }, { "id": "arxiv:2604.26740", "source": "arxiv", "source_type": "preprint", "title": "Rendering-Aware Sparse Sampling for BRDF Acquisition", "abstract": "Accurate BRDF acquisition is essential for realistic rendering, but dense gonioreflectometer measurements are slow and expensive. We study how to select a small set of BRDF measurements that is most informative for reconstructing material appearance under a learned BRDF prior. Existing sparse-acquisition methods often optimize samples for BRDF-space reconstruction for all materials, while the perceptual importance of a adaptive measurement ultimately depends on its effect on each rendered appearance. We therefore formulate sparse adaptive acquisition as a rendering-aware optimization problem. Our method combines a set encoder for sparse coordinate--value observations, a pretrained hypernetwork-based/PCA-based BRDF reconstructor, and a differentiable renderer. During sampler training, the reconstructor remains fixed, and gradients from a rendered-image loss optimize the measurement locations. This separates acquisition design from prior fitting and encourages the sampler to choose directions that are informative under the learned material distribution. To make the comparison controlled, we evaluate the uniform baseline, meta-learning method, HyperBRDF method, and our learned sampler under matched sample numbers, train/test split, rendering scene, object mask, image mapping, and metrics. Our central claim: rendering-aware sampling improves extremely sparse BRDF acquisition when final rendered appearance is the target. BRDF-space and combined losses are reported only as ablations, together with joint refinement and image-only latent fitting for unseen materials.", "authors": [ "W. Cao", "D. Jönsson", "Z. Huang", "J. Unger" ], "year": 2026, "published_date": "2026-05-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.26740", "pdf_url": "https://arxiv.org/pdf/2604.26740", "citations": 0, "topics": [], "tags": [ "Computer Vision", "Computer Graphics" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.56, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Accurate BRDF acquisition is essential for realistic rendering, but dense gonioreflectometer measurements are slow and expensive. We study how to select a small set of BRDF measurements that is most informative for reconstructing material appearance under a learned BRDF prior.", "key_contribution": "Accurate BRDF acquisition is essential for realistic rendering, but dense gonioreflectometer measurements are slow and expensive.", "why_it_matters": "Rendering-Aware Sparse Sampling for BRDF Acquisition advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Computer Vision.", "one_line_takeaway": "Accurate BRDF acquisition is essential for realistic rendering, but dense gonioreflectometer measurements are slow and…", "biggest_caveat": "but dense gonioreflectometer measurements are slow and expensive.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Computer Vision.", "url": "https://arxiv.org/abs/2604.26740", "difficulty": "intermediate" }, { "id": "arxiv:2101.05993", "source": "arxiv", "source_type": "preprint", "title": "Ensemble Learning Based Classification Algorithm Recommendation", "abstract": "Selecting an appropriate classification algorithm for a given data set remains a challenging problem in data mining and machine learning. Existing algorithm recommendation models are typically trained with individual learners and rely on only one type of meta-feature, which may limit their ability to capture the diverse characteristics of classification problems. This paper proposes a multi-view ensemble meta-learning framework for classification algorithm recommendation. The framework constructs base recommendation models from different combinations of heterogeneous meta-feature groups and combines them through an accuracy- and diversity-aware ensemble strategy. The main focus of this work is empirical: we evaluate the proposed method on 1,090 benchmark classification problems derived from 84 public data sets, using 13 widely used candidate classification algorithms and five types of meta-features. The experimental results show that the proposed ensemble recommendation method consistently improves ranking loss, average precision, and top-ranked recommendation precision over individual recommendation models. These results suggest that combining complementary meta-feature views is an effective strategy for robust classification algorithm recommendation.", "authors": [ "Guangtao Wang", "Qinbao Song", "Xiaoyan Zhu", "Jiao Liu" ], "year": 2026, "published_date": "2026-06-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2101.05993", "pdf_url": "https://arxiv.org/pdf/2101.05993", "citations": 0, "topics": [], "tags": [ "Evaluation", "Artificial Intelligence", "Information Retrieval", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.94, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Selecting an appropriate classification algorithm for a given data set remains a challenging problem in data mining and machine learning. Existing algorithm recommendation models are typically trained with individual learners and rely on only one type of meta-feature, which may limit their ability to capture the diverse characteristics of classification problems.", "key_contribution": "The experimental results show that the proposed ensemble recommendation method consistently improves ranking loss, average precision, and top-ranked recommendation precision over individual recommendation models.", "why_it_matters": "Ensemble Learning Based Classification Algorithm Recommendation improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "The experimental results show that the proposed ensemble recommendation method consistently improves ranking loss,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "https://arxiv.org/abs/2101.05993", "difficulty": "beginner" }, { "id": "arxiv:2601.06891", "source": "arxiv", "source_type": "preprint", "title": "CLIMP: Contrastive Language-Image Mamba Pretraining", "abstract": "Contrastive Language-Image Pre-training (CLIP) relies on Vision Transformers whose attention mechanism is susceptible to spurious correlations, and scales quadratically with resolution. To address these limitations, We present CLIMP, the first fully Mamba-based contrastive vision-language model that replaces both the vision and text encoders with Mamba. The new architecture encodes sequential structure in both vision and language, with VMamba capturing visual spatial inductive biases, reducing reliance on spurious correlations and producing an embedding space favorable for cross-modal retrieval and out-of-distribution robustness-surpassing OpenAI's CLIP-ViT-B by 7.5% on ImageNet-O. CLIMP naturally supports variable input resolutions without positional encoding interpolation or specialized training, achieving up to 6.6% higher retrieval accuracy at 16x training resolution while using 5x less memory and 1.8x fewer FLOPs. The autoregressive text encoder further overcomes CLIP's fixed context limitation, enabling dense captioning retrieval. Our findings suggest that Mamba exhibits advantageous properties for vision-language learning, making it a compelling alternative to Transformer-based CLIP.The code and models are publicly available at https://github.com/NimrodShabtay/CLIMP}", "authors": [ "Nimrod Shabtay", "Itamar Zimerman", "Eli Schwartz", "Raja Giryes" ], "year": 2026, "published_date": "2026-06-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.06891", "pdf_url": "https://arxiv.org/pdf/2601.06891", "citations": 0, "topics": [], "tags": [ "SSMs", "VLMs", "Transformers", "Self-Supervised", "Fairness & Ethics" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (SSMs) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.22, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Contrastive Language-Image Pre-training (CLIP) relies on Vision Transformers whose attention mechanism is susceptible to spurious correlations, and scales quadratically with resolution. To address these limitations, We present CLIMP, the first fully Mamba-based contrastive vision-language model that replaces both the vision and text encoders with Mamba.", "key_contribution": "To address these limitations, We present CLIMP, the first fully Mamba-based contrastive vision-language model that replaces both the vision and text encoders with Mamba.", "why_it_matters": "CLIMP: Contrastive Language-Image Mamba Pretraining represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about SSMs.", "one_line_takeaway": "To address these limitations, We present CLIMP, the first fully Mamba-based contrastive vision-language model that…", "biggest_caveat": "limitations, We present CLIMP, the first fully Mamba-based contrastive vision-language model that replaces both the vision and text encoders with Mamba.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in SSMs.", "url": "https://arxiv.org/abs/2601.06891", "difficulty": "advanced" }, { "id": "arxiv:2603.00374", "source": "arxiv", "source_type": "preprint", "title": "Conservative Equilibrium Discovery in Offline Game-Theoretic Multiagent Reinforcement Learning", "abstract": "Offline learning of strategies takes data efficiency to its extreme by restricting algorithms to a fixed dataset of state-action trajectories. We consider the problem in a mixed-motive multiagent setting, where the goal is to solve a game under the offline learning constraint. We first frame this problem in terms of selecting among candidate equilibria. Since datasets may inform only a small fraction of game dynamics, it is generally infeasible in offline game-solving to even verify a proposed solution is a true equilibrium. Therefore, we consider the relative probability of low regret (i.e., closeness to equilibrium) across candidates based on the information available. Specifically, we extend Policy Space Response Oracles (PSRO), an online game-solving approach, by quantifying game dynamics uncertainty and modifying the RL objective to skew towards solutions more likely to have low regret in the true game. We further propose a novel meta-strategy solver, tailored for the offline setting, to guide strategy exploration in PSRO. Our incorporation of Conservatism principles from Offline reinforcement learning approaches for strategy Exploration gives our approach its name: COffeE-PSRO. Experiments demonstrate COffeE-PSRO's ability to extract lower-regret solutions than state-of-the-art offline approaches and reveal relationships between algorithmic components empirical game fidelity, and overall performance.", "authors": [ "Austin A. Nguyen", "Michael P. Wellman" ], "year": 2026, "published_date": "2026-06-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.00374", "pdf_url": "https://arxiv.org/pdf/2603.00374", "citations": 0, "topics": [], "tags": [ "RL", "Artificial Intelligence", "Multi-Agent Systems" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.42, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Offline learning of strategies takes data efficiency to its extreme by restricting algorithms to a fixed dataset of state-action trajectories. We consider the problem in a mixed-motive multiagent setting, where the goal is to solve a game under the offline learning constraint.", "key_contribution": "We further propose a novel meta-strategy solver, tailored for the offline setting, to guide strategy exploration in PSRO.", "why_it_matters": "Conservative Equilibrium Discovery in Offline Game-Theoretic Multiagent Reinforcement Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about RL.", "one_line_takeaway": "We further propose a novel meta-strategy solver, tailored for the offline setting, to guide strategy exploration in…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in RL.", "url": "https://arxiv.org/abs/2603.00374", "difficulty": "advanced" }, { "id": "arxiv:2606.26118", "source": "arxiv", "source_type": "preprint", "title": "The Open Source Economic Index of AI Adoption and Capability", "abstract": "We work towards measuring both AI adoption and the capability of AI to perform discrete labor tasks across various occupations. To measure adoption, we develop an open-source economic index that uses publicly available user-LLM chat data and O*NET tasks to replicate studies produced by frontier AI labs, finding that occupations in the finance, computer science, and arts sectors are those with the highest adoption rates. To measure capabilities, we build a system that generates benchmark scenarios grounded in O*NET occupations, tasks, and model-context-protocol (MCP) servers. We test Kimi-k2.5 with an OpenAI agents SDK harness on scenarios across 9 occupations that appear frequently in our index, finding that AI correctly executes high-level workflows but often errs in the granular details (such as specific tool calls used).", "authors": [ "Seamus Somerstep", "Aritra Guha", "Divesh Srivastava", "Yuekai Sun" ], "year": 2026, "published_date": "2026-05-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.26118", "pdf_url": "https://arxiv.org/pdf/2606.26118", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.37, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We work towards measuring both AI adoption and the capability of AI to perform discrete labor tasks across various occupations. To measure adoption, we develop an open-source economic index that uses publicly available user-LLM chat data and O*NET tasks to replicate studies produced by frontier AI labs, finding that occupations in the finance, computer science, and arts sectors are those with the highest adoption rates.", "key_contribution": "We work towards measuring both AI adoption and the capability of AI to perform discrete labor tasks across various occupations.", "why_it_matters": "The Open Source Economic Index of AI Adoption and Capability represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We work towards measuring both AI adoption and the capability of AI to perform discrete labor tasks across various…", "biggest_caveat": "but often errs in the granular details (such as specific tool calls used).", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.26118", "difficulty": "beginner" }, { "id": "arxiv:2604.23178", "source": "arxiv", "source_type": "preprint", "title": "Judging the Judges: A Systematic Evaluation of Bias Mitigation Strategies in LLM-as-a-Judge Pipelines", "abstract": "LLM-as-a-Judge has become the dominant paradigm for evaluating language model outputs, yet LLM judges exhibit systematic biases that compromise evaluation reliability. We present a comprehensive empirical study comparing nine debiasing strategies across five judge models from four provider families (Google, Anthropic, OpenAI, Meta), three benchmarks (MT-Bench n=400, LLMBar n=200, custom n=225), and four bias types. Our key findings: (1) Style bias is the dominant bias (0.76-0.92 across all models), far exceeding position bias (<= 0.04), yet has received minimal research attention. (2) All models show a conciseness preference on expansion pairs, but truncation controls confirm they correctly distinguish quality from length (0.92-1.00 accuracy), suggesting quality-sensitive evaluation rather than a simple length bias. (3) Debiasing is beneficial but model-dependent: the combined budget strategy significantly improves Claude Sonnet 4 by +11.2 pp (p < 0.0001), with directionally positive trends for other models. Only 2 of 20 non-baseline configurations show decreased agreement. We release our evaluation framework, controlled dataset, and all experimental artifacts at https://github.com/sksoumik/llm-as-judge.", "authors": [ "Sadman Kabir Soumik" ], "year": 2026, "published_date": "2026-04-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.23178", "pdf_url": "https://arxiv.org/pdf/2604.23178", "citations": 0, "topics": [], "tags": [ "LLMs", "Fairness & Ethics", "Evaluation", "Artificial Intelligence" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.44, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "LLM-as-a-Judge has become the dominant paradigm for evaluating language model outputs, yet LLM judges exhibit systematic biases that compromise evaluation reliability. We present a comprehensive empirical study comparing nine debiasing strategies across five judge models from four provider families (Google, Anthropic, OpenAI, Meta), three benchmarks (MT-Bench n=400, LLMBar n=200, custom n=225), and four bias types.", "key_contribution": "We present a comprehensive empirical study comparing nine debiasing strategies across five judge models from four provider families (Google, Anthropic, OpenAI, Meta), three benchmarks (MT-Bench n=400, LLMBar n=200, custom n=225), and four bias types.", "why_it_matters": "Judging the Judges: A Systematic Evaluation of Bias Mitigation Strategies in LLM-as-a-Judge Pipelines represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a comprehensive empirical study comparing nine debiasing strategies across five judge models from four…", "biggest_caveat": "but truncation controls confirm they correctly distinguish quality from length (0.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2604.23178", "difficulty": "beginner" }, { "id": "arxiv:2512.00324", "source": "arxiv", "source_type": "preprint", "title": "MILE: A Mechanically Isomorphic Hand Exoskeleton and Visuotactile Robotic Hand for Data Collection in Dexterous Manipulation", "abstract": "Dexterous robotic hands are expected to perform complex, contact-rich object manipulation, but learning such skills remains challenging because high-dimensional hands require high-fidelity demonstrations. Imitation learning provides a practical route for acquiring dexterous manipulation skills from human demonstrations, yet collecting synchronized multimodal demonstrations with accurate hand actions and tactile observations remains a key bottleneck. We present MILE, a teleoperation-based data-collection system comprising the human-first MILE exoskeleton and the mechanically corresponding MILE-Tac robotic hand. The system integrates custom-designed and fabricated modular joint encoders and compact MILE fingertip visuotactile sensor modules. The exoskeleton is informed by human-hand anatomy and ergonomic constraints, while the robotic hand is co-designed to preserve the selected four-finger kinematic topology. This correspondence enables joint-space command transfer and reduces reliance on task-space IK-based retargeting. The system synchronously records task-specific visual observations, four fingertip visuotactile streams, robot-hand proprioception, and exoskeleton-derived action commands. We evaluate MILE through a four-task teleoperation benchmark against representative glove-based and vision-based interfaces, and through imitation-learning experiments that compare policies trained with and without fingertip tactile input. The project page is available at https://sites.google.com/view/mile-system.", "authors": [ "Jinda Du", "Jieji Ren", "Qiaojun Yu", "Ningbin Zhang", "Yu Deng", "Xingyu Wei", "Yufei Liu", "Guoying Gu", "Xiangyang Zhu" ], "year": 2026, "published_date": "2026-06-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2512.00324", "pdf_url": "https://arxiv.org/pdf/2512.00324", "citations": 0, "topics": [], "tags": [ "Multimodal", "Robotics", "Evaluation", "Human-Computer Interaction", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.8, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Dexterous robotic hands are expected to perform complex, contact-rich object manipulation, but learning such skills remains challenging because high-dimensional hands require high-fidelity demonstrations. Imitation learning provides a practical route for acquiring dexterous manipulation skills from human demonstrations, yet collecting synchronized multimodal demonstrations with accurate hand actions and tactile observations remains a key bottleneck.", "key_contribution": "We present MILE, a teleoperation-based data-collection system comprising the human-first MILE exoskeleton and the mechanically corresponding MILE-Tac robotic hand.", "why_it_matters": "MILE: A Mechanically Isomorphic Hand Exoskeleton and Visuotactile Robotic Hand for Data Collection in Dexterous Manipulation advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We present MILE, a teleoperation-based data-collection system comprising the human-first MILE exoskeleton and the…", "biggest_caveat": "but learning such skills remains challenging because high-dimensional hands require high-fidelity demonstrations.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2512.00324", "difficulty": "frontier" }, { "id": "arxiv:2302.14062", "source": "arxiv", "source_type": "preprint", "title": "Explanations for Automatic Speech Recognition", "abstract": "We address quality assessment for neural network based ASR by providing explanations that help increase our understanding of the system and ultimately help build trust in the system. Compared to simple classification labels, explaining transcriptions is more challenging as judging their correctness is not straightforward and transcriptions as a variable-length sequence is not handled by existing interpretable machine learning models. We provide an explanation for an ASR transcription as a subset of audio frames that is both a minimal and sufficient cause of the transcription. To do this, we adapt existing explainable AI (XAI) techniques from image classification-Statistical Fault Localisation(SFL) and Causal. Additionally, we use an adapted version of Local Interpretable Model-Agnostic Explanations (LIME) for ASR as a baseline in our experiments. We evaluate the quality of the explanations generated by the proposed techniques over three different ASR ,Google API, the baseline model of Sphinx, Deepspeech and 100 audio samples from the Commonvoice dataset.", "authors": [ "Xiaoliang Wu", "Peter Bell", "Ajitha Rajan" ], "year": 2026, "published_date": "2026-06-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2302.14062", "pdf_url": "https://arxiv.org/pdf/2302.14062", "citations": 0, "topics": [], "tags": [ "Object Detection", "ASR", "Interpretability", "NLP", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.12, "content_potential_score": 2.76, "interestingness_score": 2.88, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We address quality assessment for neural network based ASR by providing explanations that help increase our understanding of the system and ultimately help build trust in the system. Compared to simple classification labels, explaining transcriptions is more challenging as judging their correctness is not straightforward and transcriptions as a variable-length sequence is not handled by existing interpretable machine learning models.", "key_contribution": "We address quality assessment for neural network based ASR by providing explanations that help increase our understanding of the system and ultimately help build trust in the system.", "why_it_matters": "Explanations for Automatic Speech Recognition represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Object Detection.", "one_line_takeaway": "We address quality assessment for neural network based ASR by providing explanations that help increase our…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Object Detection.", "url": "https://arxiv.org/abs/2302.14062", "difficulty": "intermediate" }, { "id": "arxiv:2606.21271", "source": "arxiv", "source_type": "preprint", "title": "Reward-free Pretraining for Reinforcement Learning via Occupancy Coverage Maximization", "abstract": "Sparse rewards pose a central challenge in reinforcement learning, since agents receive no informative signal until they reach their goal. Intrinsic-reward methods address this issue by optimizing non-stationary objectives such as novelty, prediction error, or skill diversity, thereby injecting a supervision signal into the problem. While effective, these methods often require that the extrinsic (sparse) reward can be evaluated -- either online or during offline relabeling of the stored transitions. This limitation is particularly vexing for multi-task, meta-, and continual reinforcement learning, where agents' interactions with the environment are usually reward-free. In this work, we present a method to pre-train transferable exploration policies that rapidly adapt to sparse rewards at downstream task time. Our objective maximizes state-space covering for the occupancy measure, and can be framed in terms of entropy maximization. Its algorithmic implementation, ROVER, leverages recent advances on the operatorial formulation of RL to estimate occupancy with a learned resolvent world model, bypassing common hurdles associated with density and entropy estimation. ROVER further introduces a virtual \"sink\" state for unexplored regions, balancing coverage of known states with expansion into unseen ones and preventing cyclic expansion-collapse behavior during learning. In tabular and pixel-based sparse navigation tasks, ROVER produces more uniform aggregate coverage and stronger initializations for downstream tasks than standard reward-free baselines.", "authors": [ "Marco Pratticò", "Pietro Novelli", "Massimiliano Pontil", "Carlo Ciliberto" ], "year": 2026, "published_date": "2026-06-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.21271", "pdf_url": "https://arxiv.org/pdf/2606.21271", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "RL", "Structured Data", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RL) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.66, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Sparse rewards pose a central challenge in reinforcement learning, since agents receive no informative signal until they reach their goal. Intrinsic-reward methods address this issue by optimizing non-stationary objectives such as novelty, prediction error, or skill diversity, thereby injecting a supervision signal into the problem.", "key_contribution": "In this work, we present a method to pre-train transferable exploration policies that rapidly adapt to sparse rewards at downstream task time.", "why_it_matters": "Reward-free Pretraining for Reinforcement Learning via Occupancy Coverage Maximization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "In this work, we present a method to pre-train transferable exploration policies that rapidly adapt to sparse rewards…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Self-Supervised.", "url": "https://arxiv.org/abs/2606.21271", "difficulty": "advanced" }, { "id": "arxiv:2606.22494", "source": "arxiv", "source_type": "preprint", "title": "Deep Learning-Based Sign Language Recognition from Videos and Cross-Lingual Translation to Indian Vernaculars", "abstract": "Sign language is a primary mode of communication for the global deaf and hard-of-hearing community, yet automated tools that recognize sign gestures from video and translate them into natural language text remain limited, particularly for low-resource Indian languages. We present a two-stage deep learning pipeline that (i) classifies short sign language video clips into English word labels using a fine-tuned VideoMAE video transformer, and (ii) translates the predicted English label into Hindi, Telugu, and Bengali using Meta AI's No Language Left Behind (NLLB-200) multilingual translation model. The classification model is fine-tuned on a 13-class subset of the AI4Bharat Indian Sign Language video corpus from IIT Madras, processing 16-frame clips sampled uniformly from each video at 224 x 224 resolution. Under a small-scale academic setting (13 classes, 197 clips, 80-20 split), the fine-tuned model reaches 99% training accuracy and 78% validation accuracy after 15 epochs. We provide a per-class breakdown via a confusion matrix and classification report, identify the dominant failure modes (confusable adjective pairs such as ugly, deaf, blind, hat, and dress), and describe a Streamlit-based inference demo that takes a user-uploaded video and returns the predicted English label alongside its Hindi, Telugu, and Bengali translations. We discuss the scope, limitations (small label set, isolated-word rather than continuous signing, single-signer style sensitivity, ambiguity of single-word machine translation), and directions for future work, including expanding to sentence-level generation and a larger vocabulary. Code is released to support reproducibility.", "authors": [ "Chandranath Adak", "Ramesh Nandipalli" ], "year": 2026, "published_date": "2026-06-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.22494", "pdf_url": "https://arxiv.org/pdf/2606.22494", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Translation", "Info Extraction", "Transformers", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Translation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.31, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Sign language is a primary mode of communication for the global deaf and hard-of-hearing community, yet automated tools that recognize sign gestures from video and translate them into natural language text remain limited, particularly for low-resource Indian languages. We present a two-stage deep learning pipeline that (i) classifies short sign language video clips into English word labels using a fine-tuned VideoMAE video transformer, and (ii) translates the predicted English label into Hindi, Telugu, and Bengali using Meta AI's No Language Left Behind (NLLB-200) multilingual translation model.", "key_contribution": "We present a two-stage deep learning pipeline that (i) classifies short sign language video clips into English word labels using a fine-tuned VideoMAE video transformer, and (ii) translates the predicted English label into Hindi, Telugu, and Bengali using Meta AI's No Language Left Behind (NLLB-200) multilingual translation model.", "why_it_matters": "Deep Learning-Based Sign Language Recognition from Videos and Cross-Lingual Translation to Indian Vernaculars represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We present a two-stage deep learning pipeline that (i) classifies short sign language video clips into English word…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2606.22494", "difficulty": "beginner" }, { "id": "arxiv:2606.19881", "source": "arxiv", "source_type": "preprint", "title": "REDACT: A Systematically Controlled Multilingual Benchmark for Personal Information Detection", "abstract": "Benchmark infrastructure for personally identifiable information (PII) detection remains limited: existing corpora cover few entity types, use ad hoc generation conditions, and do not show which surface conditions cause detector failures. We present REDACT, a systematically controlled multilingual PII benchmark with 13,427 records, 324,078 entity annotations, 51 entity types, 4,127 surface-form patterns, and 25 languages across 9 scripts. A strength-2 covering-array sampler controls nine generation axes: domain, format, difficulty, length, density, code-switching, language, adjacency, and co-occurrence. Three entity-level metadata fields (disclosure status, disclosure form, and a GDPR-aligned sensitivity tier) enable stratified evaluation beyond aggregate or per-type F1. From the full benchmark, we evaluate five detectors (Presidio, GLiNER, the OpenAI Privacy Filter, GPT-4.1, and Claude Sonnet 4.6) on a locked, language-stratified sample of 1,000 records. Aggregate F1 masks an architecture-dependent failure structure: the rule-based detector performs poorly on the highest-stakes data, including HIGH-sensitivity categories (recall 0.07) and non-verbatim disclosure forms, while the LLM detectors remain more robust, with the HIGH tier as their strongest sensitivity slice. A three-model reference-free LLM-as-judge assessment corroborates that sensitivity-tier assignment is the task's hardest axis. We release the benchmark, schema, prompts, and stratified evaluation harness.", "authors": [ "Guneesh Vats", "Anubha Agrawal", "Shikha Singhal", "Ajita Dash", "Praison Selvaraj", "Vidhan Jhawar", "Ranga Prasad Chenna", "Bharadwaj Y M G" ], "year": 2026, "published_date": "2026-06-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.19881", "pdf_url": "https://arxiv.org/pdf/2606.19881", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.07, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Benchmark infrastructure for personally identifiable information (PII) detection remains limited: existing corpora cover few entity types, use ad hoc generation conditions, and do not show which surface conditions cause detector failures. We present REDACT, a systematically controlled multilingual PII benchmark with 13,427 records, 324,078 entity annotations, 51 entity types, 4,127 surface-form patterns, and 25 languages across 9 scripts.", "key_contribution": "Benchmark infrastructure for personally identifiable information (PII) detection remains limited: existing corpora cover few entity types, use ad hoc generation conditions, and do not show which surface conditions cause detector failures.", "why_it_matters": "REDACT: A Systematically Controlled Multilingual Benchmark for Personal Information Detection represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Benchmark infrastructure for personally identifiable information (PII) detection remains limited: existing corpora…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.19881", "difficulty": "beginner" }, { "id": "arxiv:2604.03208v1", "source": "arxiv", "source_type": "preprint", "title": "Hierarchical Planning with Latent World Models", "abstract": "Model predictive control (MPC) with learned world models has emerged as a promising paradigm for embodied control, particularly for its ability to generalize zero-shot when deployed in new environments. However, learned world models often struggle with long-horizon control due to the accumulation of prediction errors and the exponentially growing search space. In this work, we address these challenges by learning latent world models at multiple temporal scales and performing hierarchical planning across these scales, enabling long-horizon reasoning while substantially reducing inference-time planning complexity. Our approach serves as a modular planning abstraction that applies across diverse latent world-model architectures and domains. We demonstrate that this hierarchical approach enables zero-shot control on real-world non-greedy robotic tasks, achieving a 70% success rate on pick-&-place using only a final goal specification, compared to 0% for a single-level world model. In addition, across physics-based simulated environments including push manipulation and maze navigation, hierarchical planning achieves higher success while requiring up to 4x less planning-time compute.", "authors": [ "Wancong Zhang", "Basile Terver", "Artem Zholus", "Soham Chitnis", "Harsh Sutaria", "Mido Assran", "Randall Balestriero", "Amir Bar", "Adrien Bardes", "Yann LeCun", "Nicolas Ballas" ], "year": 2026, "published_date": "2026-04-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.03208v1", "pdf_url": "https://arxiv.org/pdf/2604.03208v1", "citations": 0, "topics": [], "tags": [ "Reasoning", "Prompting", "Robotics", "Reasoning & Chain-of-Thought", "Robotics & Embodied AI" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.97, "content_potential_score": 0.84, "interestingness_score": 1.92, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Model predictive control (MPC) with learned world models has emerged as a promising paradigm for embodied control, particularly for its ability to generalize zero-shot when deployed in new environments. However, learned world models often struggle with long-horizon control due to the accumulation of prediction errors and the exponentially growing search space.", "key_contribution": "We demonstrate that this hierarchical approach enables zero-shot control on real-world non-greedy robotic tasks, achieving a 70% success rate on pick-&-place using only a final goal specification, compared to 0% for a single-level world model.", "why_it_matters": "Hierarchical Planning with Latent World Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We demonstrate that this hierarchical approach enables zero-shot control on real-world non-greedy robotic tasks,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "http://arxiv.org/abs/2604.03208v1", "difficulty": "beginner" }, { "id": "arxiv:2509.16370", "source": "arxiv", "source_type": "preprint", "title": "Dual-Regularized Riccati Recursions for Interior-Point Optimal Control", "abstract": "We derive closed-form extensions of the sequential and parallel Riccati recursions for solving dual-regularized linear-quadratic regulator (LQR) problems, with $O(N)$ sequential time and $O(\\log(N))$ parallel time, respectively. We show that these subproblems arise when using regularized primal-dual interior-point methods to solve smooth, constrained, non-convex, discrete-time optimal control problems via multiple-shooting, even in the presence of stagewise equality or inequality constraints, and without imposing any rank requirements on constraint Jacobians. We prove that, when certain inertia conditions on the Newton-KKT matrix are met, each nonzero primal step is a descent direction of an augmented barrier-Lagrangian merit function. We characterize these inertia conditions in terms of the positive-definiteness of the dual-regularized Riccati pivots (a weaker condition than the standard LQR positive-definiteness requirements), thereby yielding inexpensive certificates of the required inertia. We provide MIT-licensed implementations of our methods in C++ and in JAX, as well as a full formalization of our results in Lean. We benchmark our algorithm against leading optimal control and nonlinear programming solvers on complex trajectory optimization problems, establishing competitive performance on moderate problems and substantial gains as the horizon length, problem dimension, and constraint count increase.", "authors": [ "João Sousa-Pinto", "Dominique Orban" ], "year": 2026, "published_date": "2026-06-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.16370", "pdf_url": "https://arxiv.org/pdf/2509.16370", "citations": 0, "topics": [], "tags": [ "Robotics", "Evaluation", "Systems & Control" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.56, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We derive closed-form extensions of the sequential and parallel Riccati recursions for solving dual-regularized linear-quadratic regulator (LQR) problems, with $O(N)$ sequential time and $O(\\log(N))$ parallel time, respectively. We show that these subproblems arise when using regularized primal-dual interior-point methods to solve smooth, constrained, non-convex, discrete-time optimal control problems via multiple-shooting, even in the presence of stagewise equality or inequality constraints, and without imposing any rank requirements on constraint Jacobians.", "key_contribution": "We show that these subproblems arise when using regularized primal-dual interior-point methods to solve smooth, constrained, non-convex, discrete-time optimal control problems via multiple-shooting, even in the presence of stagewise equality or inequality constraints, and without imposing any rank requirements on constraint Jacobians.", "why_it_matters": "Dual-Regularized Riccati Recursions for Interior-Point Optimal Control represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We show that these subproblems arise when using regularized primal-dual interior-point methods to solve smooth,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2509.16370", "difficulty": "beginner" }, { "id": "arxiv:2606.14773", "source": "arxiv", "source_type": "preprint", "title": "Double-Helix Vision (DH-V2): A Geometry-Based Visual Sampler for Bandwidth-Constrained Perception", "abstract": "We present Double-Helix Vision (DH), a geometry-based visual sampler that compresses 2D images into compact 1D signals using paired golden-ratio-inspired spiral trajectories. Rather than processing every pixel uniformly, DH employs two phase-shifted helices (Alpha and Beta, offset by 180 degrees) to sample the image with biologically-inspired foveation: high density at the center, sparse coverage at the periphery. At 4K resolution, DH achieves a 1,433x compression ratio (99.93% reduction) while preserving the geometric structure of the scene. The full perception pipeline -- including spatial mapping, temporal collision detection, and intra-frame structural disparity estimation -- runs in 0.52 ms at 1080p on CPU-only hardware, with no neural network dependencies. On CIFAR-10 at extreme sampling budgets (K=128 points per helix), DH achieves a +6.03% accuracy gain over uniform random sampling. A JSON-serializable Robotics API is provided, delivering sub-millisecond spatial perception reports in 2.7 KB packets. Code and benchmarks are available under the MIT License.", "authors": [ "Jinwen Wen" ], "year": 2026, "published_date": "2026-06-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.14773", "pdf_url": "https://arxiv.org/pdf/2606.14773", "citations": 0, "topics": [], "tags": [ "Robotics", "Evaluation", "Artificial Intelligence", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.88, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present Double-Helix Vision (DH), a geometry-based visual sampler that compresses 2D images into compact 1D signals using paired golden-ratio-inspired spiral trajectories. Rather than processing every pixel uniformly, DH employs two phase-shifted helices (Alpha and Beta, offset by 180 degrees) to sample the image with biologically-inspired foveation: high density at the center, sparse coverage at the periphery.", "key_contribution": "We present Double-Helix Vision (DH), a geometry-based visual sampler that compresses 2D images into compact 1D signals using paired golden-ratio-inspired spiral trajectories.", "why_it_matters": "Double-Helix Vision (DH-V2): A Geometry-Based Visual Sampler for Bandwidth-Constrained Perception advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We present Double-Helix Vision (DH), a geometry-based visual sampler that compresses 2D images into compact 1D signals…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2606.14773", "difficulty": "beginner" }, { "id": "arxiv:2606.16038", "source": "arxiv", "source_type": "preprint", "title": "Open-SWE-Traces: Advancing Dual-Mode Multilingual Distillation for Software Engineering Agents", "abstract": "The path toward autonomous software engineering is currently bottlenecked by a severe deficit of diverse, large-scale trajectory data. We address this by introducing \\ourdataset, an expansive dataset of 207,489 agentic trajectories spanning nine programming languages (Python, Go, TS, JS, Rust, Java, PHP, C, C++). Sourced from 20,000 real-world PRs via OpenHands and SWE-agent harnesses, the dataset utilizes a hybrid-reasoning synthesis: Minimax-M2.5 generates trajectories with explicit \"thinking\" processes, while Qwen3.5-122B provides high-quality \"non-thinking\" traces. Filtered for permissive licenses (MIT, Apache, BSD) from SWE-rebench-V2, this data facilitates the training of models capable of long-horizon reasoning. We validate the dataset by fine-tuning the Qwen3-30B-A3B series (Thinking, Instruct, and Coder). The best performing model achieves resolve rates of 61.7% on SWE-bench Verified, 57.1% on SWE-bench Multilingual, and 36.8% on SWE-bench Pro. These results establish Open-SWE-Traces as a premier resource for distilling human-level software engineering capabilities into efficient, open-source agentic LLMs.", "authors": [ "Wasi Uddin Ahmad", "Nikolai Ludwig", "Somshubra Majumdar", "Boris Ginsburg" ], "year": 2026, "published_date": "2026-06-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.16038", "pdf_url": "https://arxiv.org/pdf/2606.16038", "citations": 0, "topics": [], "tags": [ "Reasoning", "Fine-Tuning", "AI Agents", "Code Generation", "Software Engineering" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.05, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The path toward autonomous software engineering is currently bottlenecked by a severe deficit of diverse, large-scale trajectory data. We address this by introducing \\ourdataset, an expansive dataset of 207,489 agentic trajectories spanning nine programming languages (Python, Go, TS, JS, Rust, Java, PHP, C, C++).", "key_contribution": "The path toward autonomous software engineering is currently bottlenecked by a severe deficit of diverse, large-scale trajectory data.", "why_it_matters": "Open-SWE-Traces: Advancing Dual-Mode Multilingual Distillation for Software Engineering Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "The path toward autonomous software engineering is currently bottlenecked by a severe deficit of diverse, large-scale…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2606.16038", "difficulty": "intermediate" }, { "id": "arxiv:2606.16420", "source": "arxiv", "source_type": "preprint", "title": "Transferable Self-Evolving Playbooks for Agentic Security Auditing", "abstract": "An LLM agent for vulnerability discovery and validation is more than a model. It combines three components: an LLM for code analysis, an agent harness such as Codex or OpenCode for navigation, tool use, and execution, and an audit playbook, domain-specific procedural knowledge that guides the LLM and harness toward vulnerability discovery. Prior work relies on human-supplied playbooks, including prompt engineering, manual workflows, knowledge bases, and heuristics. This raises two research questions: Acquisition - is human curation necessary, and can playbook creation be automated? Transfer - can an evolved playbook transfer the audit procedure to weaker agents, improving their capability? We present EvoHunt, a playbook evolution environment over open-source repositories for security auditing. Three agents drive the evolution loop: an audit agent rolls out the current playbook and produces findings; an evaluator scores outcomes against ground truth; and a reviser commits updates to the playbook based on failure analysis. The playbook format is unconstrained: starting empty, EvoHunt adds or removes workflows, heuristics, vulnerability knowledge, or domain-specific content. The evolved playbook requires only minor adaptation to run under a different LLM or harness. We evaluate EvoHunt on open-source security advisories. For acquisition, playbook evolution raises end-to-end exploits for Codex/GPT5.4-xhigh 6x, from 1.1% to 6.2%, and the evolved OpenCode/GLM5.1 playbook surpasses OpenAI Codex Security on every metric, with 11.3% vs. 9.2% target-match rate, showing open-source evolution can outperform a dedicated commercial product. For transfer, the GLM-evolved playbook gives the strongest student lift: Qwen3.6-27B improves from 2.4% to 6.5%, Qwen3.6-35B-A3B from 1.1% to 4.6%, and A3B obtains 2.4x more matches than GPT transfer.", "authors": [ "Ziyue Wang", "Cheuk Wang Maurice Ng", "Chenchen Yu", "Strick Sheng", "Kaihua Qin", "Liyi Zhou" ], "year": 2026, "published_date": "2026-06-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.16420", "pdf_url": "https://arxiv.org/pdf/2606.16420", "citations": 0, "topics": [], "tags": [ "Prompting", "AI Agents", "Code Generation", "Knowledge Graphs", "Cryptography & Security" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.83, "content_potential_score": 0.42, "interestingness_score": 1.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "An LLM agent for vulnerability discovery and validation is more than a model. It combines three components: an LLM for code analysis, an agent harness such as Codex or OpenCode for navigation, tool use, and execution, and an audit playbook, domain-specific procedural knowledge that guides the LLM and harness toward vulnerability discovery.", "key_contribution": "We present EvoHunt, a playbook evolution environment over open-source repositories for security auditing.", "why_it_matters": "Transferable Self-Evolving Playbooks for Agentic Security Auditing represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "We present EvoHunt, a playbook evolution environment over open-source repositories for security auditing.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2606.16420", "difficulty": "beginner" }, { "id": "arxiv:2606.16605", "source": "arxiv", "source_type": "preprint", "title": "ARB4WM: An Adversarial Robustness Benchmark for World Models in Continuous Control", "abstract": "World models are widely used in robotic and agentic engineering control systems due to their ability to learn latent dynamics for planning and decision-making. As these systems are increasingly deployed in safety-critical settings, understanding their robustness under adversarial conditions has become essential. However, existing evaluations lack a unified benchmark for testing adversarial threats across the policy, value, and latent-dynamics levels of world-model agents. To fill this gap, we present ARB4WM, a unified evaluation framework for pre-deployment robustness and risk assessment of world-model agents under visual perturbations. ARB4WM defines five white-box loss objectives across these three levels and studies their effects when combined with single-step or multi-step perturbation strategies and temporal attack modes, including full-frame, half-sequence, and sparse-frame exposure. Specifically, we evaluate four Dreamer-style agents across 20 tasks from MetaWorld and the DeepMind Control Suite under different loss objectives, perturbation strategies, and temporal attack modes. Results show that attacks targeting value estimation, latent representations, and RSSM dynamics can be as damaging as direct policy disruption, and that early or frequent perturbations are especially harmful, while input-level defenses provide limited recovery under adaptive attacks. These findings suggest that safety, risk, and reliability assessment for world models should cover multiple component-oriented attack objectives and temporal exposure protocols rather than relying solely on action-space robustness. Source code is available at https://github.com/zaoanguai/ARB4WM.", "authors": [ "Junjian Zhang", "Hao Tan", "Ruonan Li", "Dong Zhu", "Aiping Li", "Zhaoquan Gu" ], "year": 2026, "published_date": "2026-06-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.16605", "pdf_url": "https://arxiv.org/pdf/2606.16605", "citations": 0, "topics": [], "tags": [ "SSMs", "AI Agents", "Robotics", "Adversarial", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses adversarial robustness and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.51, "content_potential_score": 2.34, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "World models are widely used in robotic and agentic engineering control systems due to their ability to learn latent dynamics for planning and decision-making. As these systems are increasingly deployed in safety-critical settings, understanding their robustness under adversarial conditions has become essential.", "key_contribution": "To fill this gap, we present ARB4WM, a unified evaluation framework for pre-deployment robustness and risk assessment of world-model agents under visual perturbations.", "why_it_matters": "ARB4WM: An Adversarial Robustness Benchmark for World Models in Continuous Control represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about SSMs.", "one_line_takeaway": "To fill this gap, we present ARB4WM, a unified evaluation framework for pre-deployment robustness and risk assessment…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in SSMs.", "url": "https://arxiv.org/abs/2606.16605", "difficulty": "frontier" }, { "id": "arxiv:2505.17961", "source": "arxiv", "source_type": "preprint", "title": "Federated Causal Inference from Multi-Site Observational Data via Propensity Score Aggregation", "abstract": "Causal inference typically assumes centralized access to individual-level data. Yet, in practice, data are often decentralized across multiple sites, making centralization infeasible due to privacy, logistical, or legal constraints. We address this problem by estimating the Average Treatment Effect (ATE) from decentralized observational data via a Federated Learning (FL) approach, allowing inference through the exchange of aggregate statistics rather than individual-level data. We propose a novel method to estimate propensity scores via a federated weighted average of local scores using Membership Weights (MW), defined as probabilities of site membership conditional on covariates. MW can be flexibly estimated with parametric or non-parametric classification models using standard FL algorithms. The resulting propensity scores are used to construct Federated Inverse Propensity Weighting (Fed-IPW) and Augmented IPW (Fed-AIPW) estimators. In contrast to meta-analysis methods, which fail when any site violates positivity, our approach exploits heterogeneity in treatment assignment across sites to improve overlap. We show that Fed-IPW and Fed-AIPW perform well under site-level heterogeneity in sample sizes, treatment mechanisms, and covariate distributions. Theoretical analysis and experiments on simulated and real-world data demonstrate clear advantages over meta-analysis and related approaches.", "authors": [ "Rémi Khellaf", "Aurélien Bellet", "Julie Josse" ], "year": 2026, "published_date": "2026-06-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2505.17961", "pdf_url": "https://arxiv.org/pdf/2505.17961", "citations": 0, "topics": [], "tags": [ "Federated Learning", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses causal inference and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.4, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Causal inference typically assumes centralized access to individual-level data. Yet, in practice, data are often decentralized across multiple sites, making centralization infeasible due to privacy, logistical, or legal constraints.", "key_contribution": "We propose a novel method to estimate propensity scores via a federated weighted average of local scores using Membership Weights (MW), defined as probabilities of site membership conditional on covariates.", "why_it_matters": "Federated Causal Inference from Multi-Site Observational Data via Propensity Score Aggregation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Federated Learning.", "one_line_takeaway": "We propose a novel method to estimate propensity scores via a federated weighted average of local scores using…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Federated Learning.", "url": "https://arxiv.org/abs/2505.17961", "difficulty": "frontier" }, { "id": "arxiv:2606.13918", "source": "arxiv", "source_type": "preprint", "title": "Bayesian-Calibrated Detection of Hallucinated Package Imports in AI-Assisted Code", "abstract": "We present a Bayesian calibration layer for slopsquat detectors -- those that flag hallucinated package imports in code produced by large language models (LLMs). Where existing pipelines emit binary decisions (flag / do-not-flag), our layer emits a Beta-posterior probability per detection, derived from a 3-category epistemic taxonomy that explicitly classifies each prior as empirically calibrated, constructively argued, or engineering-judgement-traced. Beyond the primary 200/404 registry channel, the calibrated layer exploits PyPI metadata signals -- package age, release count, author descriptor, summary -- to surface registered-but-suspicious packages that a binary registry detector misses, which is the realistic post-LLM-emission attacker regime. The resulting risk-aware primitive is directly consumable by downstream CI gates and supports principled threshold decisions across detection rules. We evaluate the calibration on a merged corpus of 1,734 Python snippets -- a stratified 189-prompt BigCodeBench slice plus a 100-prompt niche-library stress-test set, generated across a six-model panel spanning four cloud models (Claude-Sonnet-4.6, Mistral-Large, DeepSeek-v4-pro, DeepSeek-R1) and two local open-weight code models (Mistral Codestral, Meta CodeLlama). Against a re-implemented binary baseline inspired by Mahmud et al. -- which shares its registry oracle with our ground truth and therefore serves as a degenerate upper bound rather than a genuine competitor -- the calibrated layer reproduces the strict-registry detections and introduces well-calibrated additional flags on the metadata channel. We assess detector asymmetry with a McNemar paired test and calibration with both a flagged-subset Expected Calibration Error and a strictly proper full-corpus Brier score.", "authors": [ "Lom M. Hillah", "Jean-Marc Richard", "Ryan Hasnaoui" ], "year": 2026, "published_date": "2026-06-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.13918", "pdf_url": "https://arxiv.org/pdf/2606.13918", "citations": 0, "topics": [], "tags": [ "LLMs", "Software Engineering", "Cryptography & Security" ], "paper_type": "dataset", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.12, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present a Bayesian calibration layer for slopsquat detectors -- those that flag hallucinated package imports in code produced by large language models (LLMs). Where existing pipelines emit binary decisions (flag / do-not-flag), our layer emits a Beta-posterior probability per detection, derived from a 3-category epistemic taxonomy that explicitly classifies each prior as empirically calibrated, constructively argued, or engineering-judgement-traced.", "key_contribution": "We present a Bayesian calibration layer for slopsquat detectors -- those that flag hallucinated package imports in code produced by large language models (LLMs).", "why_it_matters": "Bayesian-Calibrated Detection of Hallucinated Package Imports in AI-Assisted Code represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a Bayesian calibration layer for slopsquat detectors -- those that flag hallucinated package imports in code…", "biggest_caveat": "but-suspicious packages that a binary registry detector misses, which is the realistic post-LLM-emission attacker regime.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.13918", "difficulty": "frontier" }, { "id": "arxiv:2604.10842v1", "source": "arxiv", "source_type": "preprint", "title": "Resilient Write: A Six-Layer Durable Write Surface for LLM Coding Agents", "abstract": "LLM-powered coding agents increasingly rely on tool-use protocols such as the Model Context Protocol~(MCP) to read and write files on a developer's workstation. When a write fails -- due to content filters, truncation, or an interrupted session -- the agent typically receives no structured signal, loses the draft, and wastes tokens retrying blindly. We present \\textbf{Resilient Write}, an MCP server that interposes a six-layer durable write surface between the agent and the filesystem. The layers -- pre-flight risk scoring, transactional atomic writes, resume-safe chunking, structured typed errors, out-of-band scratchpad storage, and task-continuity handoff envelopes -- are orthogonal and independently adoptable. Each layer maps to a concrete failure mode observed during a real agent session in April~2026, in which content-safety filters silently rejected a draft containing redacted API-key prefixes. Three additional tools -- chunk preview, format-aware validation, and journal analytics -- emerged from using the system to compose this paper. A 186-test suite validates correctness at each layer, and quantitative comparison against naive and defensive baselines shows a 5x reduction in recovery time and a 13x improvement in agent self-correction rate. Resilient Write is open-source under the MIT license.", "authors": [ "Justice Owusu Agyemang", "Jerry John Kponyo", "Elliot Amponsah", "Godfred Manu Addo Boakye", "Kwame Opuni-Boachie Obour Agyekum" ], "year": 2026, "published_date": "2026-04-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.10842v1", "pdf_url": "https://arxiv.org/pdf/2604.10842v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Software Engineering", "Artificial Intelligence", "Large Language Models" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.84, "content_potential_score": 0.45, "interestingness_score": 1.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "LLM-powered coding agents increasingly rely on tool-use protocols such as the Model Context Protocol~(MCP) to read and write files on a developer's workstation. When a write fails -- due to content filters, truncation, or an interrupted session -- the agent typically receives no structured signal, loses the draft, and wastes tokens retrying blindly.", "key_contribution": "We present \\textbf{Resilient Write}, an MCP server that interposes a six-layer durable write surface between the agent and the filesystem.", "why_it_matters": "Resilient Write: A Six-Layer Durable Write Surface for LLM Coding Agents advances our understanding of large language models, which are reshaping how we build AI systems and interact with knowledge.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present \\textbf{Resilient Write}, an MCP server that interposes a six-layer durable write surface between the agent…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.10842v1", "difficulty": "intermediate" }, { "id": "arxiv:2605.23595", "source": "arxiv", "source_type": "preprint", "title": "Cost-Effective Model Evaluation with Meta-Learning", "abstract": "The rapid growth of machine learning has produced an ever-expanding ecosystem of models, making it increasingly challenging to verify the reliability of newly released models on unseen, unlabeled data. Conventional evaluation pipelines depend on expensive annotation, repeated fine-tuning, or narrow assumptions that fail to transfer across model families. We present MetaEvaluator, a cost-effective, model-agnostic framework for rapid, label-free assessment of unseen models spanning diverse architectures and modalities. MetaEvaluator leverages meta-learning over a pool of reference models to obtain a transferable initialization, enabling accurate evaluation of new models while amortizing cost across the pool and removing the need for per-model retraining. To the best of our knowledge, this is the first model-agnostic framework capable of evaluating new models on entirely unlabeled datasets. Extensive experiments show that MetaEvaluator produces stable and accurate performance estimates at substantially reduced cost compared to conventional approaches, making scalable benchmarking of emerging models on unlabeled data practical.", "authors": [ "Trinh Pham", "Viet Huynh", "Hongzhi Yin", "Quoc Viet Hung Nguyen", "Thanh Tam Nguyen" ], "year": 2026, "published_date": "2026-05-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.23595", "pdf_url": "https://arxiv.org/pdf/2605.23595", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Evaluation", "Artificial Intelligence", "Machine Learning", "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.38, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The rapid growth of machine learning has produced an ever-expanding ecosystem of models, making it increasingly challenging to verify the reliability of newly released models on unseen, unlabeled data. Conventional evaluation pipelines depend on expensive annotation, repeated fine-tuning, or narrow assumptions that fail to transfer across model families.", "key_contribution": "We present MetaEvaluator, a cost-effective, model-agnostic framework for rapid, label-free assessment of unseen models spanning diverse architectures and modalities.", "why_it_matters": "Cost-Effective Model Evaluation with Meta-Learning advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We present MetaEvaluator, a cost-effective, model-agnostic framework for rapid, label-free assessment of unseen models…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2605.23595", "difficulty": "beginner" }, { "id": "arxiv:2606.07608", "source": "arxiv", "source_type": "preprint", "title": "Subtitle-Aligned Fine-Tuning of Whisper for Swiss German ASR: Benchmark Contamination, Convention Mismatch, and an Honest Baseline at 25.6% WER (13.8% cWER)", "abstract": "We present a systematic study of fine-tuning OpenAI's Whisper large-v3 for Swiss German ASR, using 1,367 hours of broadcast speech paired with Standard German subtitles as weak supervision. Through 16 iterative training runs on an NVIDIA DGX Spark (Grace Blackwell, 128 GB unified memory, up to 1 PFLOP FP4), we compare LoRA and full fine-tuning of the 1.55B-parameter model, investigate hallucination root causes, and quantify the effect of data quality, subtitle alignment, and training strategy. Our best model achieves 25.6% measured WER on the All Swiss German Dialects Test Set (ASGDTS) in an honest evaluation on strictly disjoint data. A harmonized error analysis separating genuine errors from valid stylistic variation (tense, word order, Swiss orthography) yields a content WER (cWER) of 13.8%, counting only actual recognition failures. Bias-corrected estimation reduces this to 8.5%, suggesting the true error rate is roughly one third of measured WER. We demonstrate that published state-of-the-art Swiss German ASR results (17.1-17.5% WER) are inflated by benchmark contamination: a vanilla Whisper model self-trained on the ASGDTS test set with zero Swiss German data achieves 13.88% WER, surpassing all published systems. Experiments with Phi-4-multimodal show an even stronger memorization effect (3.9% WER), revealing that the benchmark primarily measures convention matching rather than dialectal comprehension. We release two models, a LoRA adapter (25.32% WER, 13.9% cWER) and a full fine-tuned model (25.60% WER, 13.8% cWER), among the few publicly available, honestly evaluated Whisper models for Swiss German, under Apache 2.0 with full reproducibility, requiring no institutional data agreements.", "authors": [ "Felix Akeret" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.07608", "pdf_url": "https://arxiv.org/pdf/2606.07608", "citations": 0, "topics": [], "tags": [ "Hallucination", "Fine-Tuning", "AI Safety", "Multimodal", "ASR" ], "paper_type": "benchmark", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.3, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present a systematic study of fine-tuning OpenAI's Whisper large-v3 for Swiss German ASR, using 1,367 hours of broadcast speech paired with Standard German subtitles as weak supervision. Through 16 iterative training runs on an NVIDIA DGX Spark (Grace Blackwell, 128 GB unified memory, up to 1 PFLOP FP4), we compare LoRA and full fine-tuning of the 1.55B-parameter model, investigate hallucination root causes, and quantify the effect of data quality, subtitle alignment, and training strategy.", "key_contribution": "We present a systematic study of fine-tuning OpenAI's Whisper large-v3 for Swiss German ASR, using 1,367 hours of broadcast speech paired with Standard German subtitles as weak supervision.", "why_it_matters": "Subtitle-Aligned Fine-Tuning of Whisper for Swiss German ASR: Benchmark Contamination, Convention Mismatch, and an Honest Baseline at 25.6% WER (13.8% cWER) represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "We present a systematic study of fine-tuning OpenAI's Whisper large-v3 for Swiss German ASR, using 1,367 hours of…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2606.07608", "difficulty": "advanced" }, { "id": "arxiv:2604.17948v1", "source": "arxiv", "source_type": "preprint", "title": "RAVEN: Retrieval-Augmented Vulnerability Exploration Network for Memory Corruption Analysis in User Code and Binary Programs", "abstract": "Large Language Models (LLMs) have demonstrated remarkable capabilities across various cybersecurity tasks, including vulnerability classification, detection, and patching. However, their potential in automated vulnerability report documentation and analysis remains underexplored. We present RAVEN (Retrieval Augmented Vulnerability Exploration Network), a framework leveraging LLM agents and Retrieval Augmented Generation (RAG) to synthesize comprehensive vulnerability analysis reports. Given vulnerable source code, RAVEN generates reports following the Google Project Zero Root Cause Analysis template. The framework uses four modules: an Explorer agent for vulnerability identification, a RAG engine retrieving relevant knowledge from curated databases including Google Project Zero reports and CWE entries, an Analyst agent for impact and exploitation assessment, and a Reporter agent for structured report generation. To ensure quality, RAVEN includes a task specific LLM Judge evaluating reports across structural integrity, ground truth alignment, code reasoning quality, and remediation quality. We evaluate RAVEN on 105 vulnerable code samples covering 15 CWE types from the NIST-SARD dataset. Results show an average quality score of 54.21%, supporting the effectiveness of our approach for automated vulnerability documentation.", "authors": [ "Parteek Jamwal", "Minghao Shao", "Boyuan Chen", "Achyuta Muthuvelan", "Asini Subanya", "Boubacar Ballo", "Kashish Satija", "Mariam Shafey", "Mohamed Mahmoud", "Moncif Dahaji Bouffi", "Pasindu Wickramasinghe", "Siyona Goel", "Yaakulya Sabbani", "Hakim Hacid", "Mthandazo Ndhlovu", "Eleanna Kafeza", "Sanjay Rawat", "Muhammad Shafique" ], "year": 2026, "published_date": "2026-04-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.17948v1", "pdf_url": "https://arxiv.org/pdf/2604.17948v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Safety", "RAG", "Artificial Intelligence" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.96, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large Language Models (LLMs) have demonstrated remarkable capabilities across various cybersecurity tasks, including vulnerability classification, detection, and patching. However, their potential in automated vulnerability report documentation and analysis remains underexplored.", "key_contribution": "We present RAVEN (Retrieval Augmented Vulnerability Exploration Network), a framework leveraging LLM agents and Retrieval Augmented Generation (RAG) to synthesize comprehensive vulnerability analysis reports.", "why_it_matters": "RAVEN: Retrieval-Augmented Vulnerability Exploration Network for Memory Corruption Analysis in User Code and Binary Programs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present RAVEN (Retrieval Augmented Vulnerability Exploration Network), a framework leveraging LLM agents and…", "biggest_caveat": "However, their potential in automated vulnerability report documentation and analysis remains underexplored.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.17948v1", "difficulty": "advanced" }, { "id": "arxiv:2605.25645", "source": "arxiv", "source_type": "preprint", "title": "Fine-Tuning and Serving Gemma 4 31B on Google Cloud TPU: A Technical Comparison with GPU Baselines", "abstract": "We present the first end-to-end demonstration of fine-tuning and serving Google's Gemma 4 31B model on TPU hardware, providing an empirical comparison of TPU and GPU platforms for large language model adaptation. Using LoRA on a Google TPU v5p-8 for training and TPU v6e-8 (Trillium) for inference, we document the full set of code-level adaptations required to port a GPU-native training recipe, built on PyTorch, HuggingFace TRL, and FSDP, to the JAX + Tunix/Qwix stack. These adaptations span mesh configuration, LoRA module naming conventions, sharding annotation corrections, gradient checkpointing, data pipeline restructuring, and a custom Orbax-to-safetensors checkpoint merging procedure. For inference, we detail the vLLM-TPU Docker setup necessary to serve Gemma 4 on v6e-8 and characterize the resulting latency and throughput profile. Compared with a 2xH100 GPU baseline under identical hyperparameters, TPU training completes 1.61x faster at 2.12x lower cost. Inference throughput is within 3% across platforms, while TPU achieves 2x lower time-to-first-token (235 ms vs. 475 ms). Together, the TPU configuration is 1.82x cheaper for a representative train-plus-service workload. Our work removes a critical gap in the open tooling ecosystem and provides practitioners with a reproducible, production-ready recipe for Gemma 4 deployment on TPU infrastructure.", "authors": [ "Jatin Kishnani", "Mayank Goel", "Amit Singh", "Pulkit Agrawal", "Sairanjan Mishra" ], "year": 2026, "published_date": "2026-05-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.25645", "pdf_url": "https://arxiv.org/pdf/2605.25645", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "Artificial Intelligence", "Distributed Computing" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.01, "content_potential_score": 2.34, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present the first end-to-end demonstration of fine-tuning and serving Google's Gemma 4 31B model on TPU hardware, providing an empirical comparison of TPU and GPU platforms for large language model adaptation. Using LoRA on a Google TPU v5p-8 for training and TPU v6e-8 (Trillium) for inference, we document the full set of code-level adaptations required to port a GPU-native training recipe, built on PyTorch, HuggingFace TRL, and FSDP, to the JAX + Tunix/Qwix stack.", "key_contribution": "We present the first end-to-end demonstration of fine-tuning and serving Google's Gemma 4 31B model on TPU hardware, providing an empirical comparison of TPU and GPU platforms for large language model adaptation.", "why_it_matters": "Fine-Tuning and Serving Gemma 4 31B on Google Cloud TPU: A Technical Comparison with GPU Baselines represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present the first end-to-end demonstration of fine-tuning and serving Google's Gemma 4 31B model on TPU hardware,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.25645", "difficulty": "intermediate" }, { "id": "arxiv:2606.07389", "source": "arxiv", "source_type": "preprint", "title": "Simulation-Driven Imitation Learning for Biosignals-Free Shared-Autonomy Prosthetic Grasping", "abstract": "Biosignals-free shared-autonomy control of upper-limb prosthetic hands aims to enable natural and low-effort manipulation without relying on EMG or other physiological signals. Recent imitation-learning-based approaches have shown promising results, but their scalability is limited by the cost and variability of collecting large amounts of real-world human demonstration data. In this work, we present a scalable simulation framework that automatically generates diverse reach-to-grasp demonstrations from a wrist-mounted virtual camera. The framework combines physically feasible grasp synthesis, natural reaching trajectories retargeting, and reach--grasp--lift execution in procedurally generated indoor environments. It records wrist-view observations, proprioception, and actions to build a large-scale demonstration dataset for imitation learning. Through extensive simulation benchmarks, we evaluate object and scene generalization and compare several representative state-of-the-art imitation learning methods. Results show that the simulated demonstrations are sufficiently rich and consistent for effective policy learning. In three realistic settings, the learned sim-to-real policy achieves over 90\\% grasp success, surpasses baseline methods, and exhibits stronger generalization, highlighting the promise of simulation-driven training for biosignals-free shared-autonomy prosthetic grasping. The demonstrations are available at \\href{https://sites.google.com/view/sim-prosthetic-grasp/home}{https://sites.google.com/view/sim-prosthetic-grasp/home}.", "authors": [ "Kaijie Shi", "Wanglong Lu", "Huiling Chen", "Vinicius Prado da Fonseca", "Ting Zou", "Hanli Zhao", "Xianta Jiang" ], "year": 2026, "published_date": "2026-06-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.07389", "pdf_url": "https://arxiv.org/pdf/2606.07389", "citations": 0, "topics": [], "tags": [ "Robotics", "Evaluation" ], "paper_type": "dataset", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.16, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Biosignals-free shared-autonomy control of upper-limb prosthetic hands aims to enable natural and low-effort manipulation without relying on EMG or other physiological signals. Recent imitation-learning-based approaches have shown promising results, but their scalability is limited by the cost and variability of collecting large amounts of real-world human demonstration data.", "key_contribution": "In this work, we present a scalable simulation framework that automatically generates diverse reach-to-grasp demonstrations from a wrist-mounted virtual camera.", "why_it_matters": "Simulation-Driven Imitation Learning for Biosignals-Free Shared-Autonomy Prosthetic Grasping represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "In this work, we present a scalable simulation framework that automatically generates diverse reach-to-grasp…", "biggest_caveat": "but their scalability is limited by the cost and variability of collecting large amounts of real-world human demonstration data.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2606.07389", "difficulty": "beginner" }, { "id": "arxiv:2606.07488", "source": "arxiv", "source_type": "preprint", "title": "CoMetaPNS: Continually Meta-learning Personalized Neural Surrogates for Cardiac Electrophysiology Simulations", "abstract": "Personalized virtual heart simulations face challenges in model personalization and computational cost. While neural surrogates offer state-of-the-art solutions, they typically address either efficient personalization or training generalizable models. Recent work reframes this by learning the process of personalizing a surrogate using limited subject-specific context data, through few-shot generative modeling with set-conditioned surrogates and meta-learned amortized inference. These methods, however, assume a static and diverse training distribution with known task identifiers. When new data becomes available, they require costly retraining with all prior data to avoid catastrophic forgetting - a phenomena where the model forgets earlier tasks when trained on new ones. This is a major limitation in clinical settings where often unlabeled data arrives sequentially and full retraining is infeasible. This paper presents a new continual meta-learning framework to achieve personalized neural surrogates able to not only continually integrate information but also identify whether incoming data stems from a known or unknown dynamics source. By leveraging a continual Bayesian Gaussian Mixture Model over a memory buffer, our framework can infer the identifiers and relationships of data over time - required for effective meta-learning. Empirical results on synthetic cardiac data demonstrate superior simulation forecasting, computational scalability, and resilience to catastrophic forgetting compared to existing baselines.", "authors": [ "Ryan Missel", "Xiajun Jiang", "Linwei Wang" ], "year": 2026, "published_date": "2026-06-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.07488", "pdf_url": "https://arxiv.org/pdf/2606.07488", "citations": 0, "topics": [], "tags": [ "Prompting", "Continual Learning", "Biomedical AI", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.45, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Personalized virtual heart simulations face challenges in model personalization and computational cost. While neural surrogates offer state-of-the-art solutions, they typically address either efficient personalization or training generalizable models.", "key_contribution": "This paper presents a new continual meta-learning framework to achieve personalized neural surrogates able to not only continually integrate information but also identify whether incoming data stems from a known or unknown dynamics source.", "why_it_matters": "CoMetaPNS: Continually Meta-learning Personalized Neural Surrogates for Cardiac Electrophysiology Simulations represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "This paper presents a new continual meta-learning framework to achieve personalized neural surrogates able to not only…", "biggest_caveat": "however, assume a static and diverse training distribution with known task identifiers.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2606.07488", "difficulty": "frontier" }, { "id": "arxiv:2406.09953", "source": "arxiv", "source_type": "preprint", "title": "DAG-Plan: Generating Directed Acyclic Dependency Graphs for Dual-Arm Cooperative Planning", "abstract": "Dual-arm robots promise greater efficiency but require planning for complex tasks with nonlinear sub-task dependencies. Current methods using Large Language Models (LLMs) suffer from a fundamental trade-off: generating linear sequences is efficient but fails to model parallelism and adapt to changes, while iterative querying is adaptive but too slow and costly. To bridge this gap, we introduce DAG-Plan, a novel task planning framework that for the first time employs a Directed Acyclic Graph (DAG) as the central representation for dual-arm coordination. The key insight is that a DAG natively captures complex sub-task dependencies and explicitly reveals opportunities for parallel execution. Within this framework, an LLM is used only once as a powerful semantic parser to translate a natural language instruction into a structured DAG. During execution, our system dynamically assigns candidate nodes to the suitable arm based on real-time environmental observations, enabling truly adaptive and parallel operation. Extensive evaluation on a dual-arm kitchen benchmark shows that DAG-Plan's structured approach fundamentally outperforms existing paradigms. It achieves a 48% higher success rate than single-query linear sequence methods with dual arm by robustly managing dependencies, and an 84.1% higher execution efficiency than iterative querying methods by eliminating the latency of repeated LLM calls. Our work demonstrates that a principled, graph-based representation is the key to unlocking efficient and reliable LLM-based planning for complex robotic systems. More demos and code are available on https://sites.google.com/view/dag-plan.", "authors": [ "Zeyu Gao", "Yao Mu", "Jinye Qu", "Mengkang Hu", "Shijia Peng", "Chengkai Hou", "Lingyue Guo", "Ping Luo", "Shanghang Zhang", "Yanfeng Lu" ], "year": 2026, "published_date": "2026-05-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2406.09953", "pdf_url": "https://arxiv.org/pdf/2406.09953", "citations": 0, "topics": [], "tags": [ "LLMs", "Robotics", "Evaluation", "Artificial Intelligence" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.78, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Dual-arm robots promise greater efficiency but require planning for complex tasks with nonlinear sub-task dependencies. Current methods using Large Language Models (LLMs) suffer from a fundamental trade-off: generating linear sequences is efficient but fails to model parallelism and adapt to changes, while iterative querying is adaptive but too slow and costly.", "key_contribution": "To bridge this gap, we introduce DAG-Plan, a novel task planning framework that for the first time employs a Directed Acyclic Graph (DAG) as the central representation for dual-arm coordination.", "why_it_matters": "DAG-Plan: Generating Directed Acyclic Dependency Graphs for Dual-Arm Cooperative Planning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To bridge this gap, we introduce DAG-Plan, a novel task planning framework that for the first time employs a Directed…", "biggest_caveat": "but require planning for complex tasks with nonlinear sub-task dependencies.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2406.09953", "difficulty": "beginner" }, { "id": "arxiv:2510.03259", "source": "arxiv", "source_type": "preprint", "title": "Verifying Meta-Awareness via Predictive Rewards in Reasoning Models", "abstract": "Recent research on reasoning models explores the meta-awareness of language models, including their ability to determine optimal thinking duration, recognize knowledge boundaries, and structure concept-level thinking. While current large reasoning models depend solely on answer-based verification, we show that adding meta-awareness objectives leads to significant performance gains over models without such meta-knowledge. MAPR (Meta-Awareness via Predictive Reward) utilizes a self-generated task of predicting rollout statistics - specifically length, pass-rate, and concepts used - allowing for verification against the actual statistics. Furthermore, by leveraging this self-predictive capability, the model can regulate its reasoning behavior by i) filtering out trivial or unsolvable prompts, ii) reducing lengthy generations that tend to be incorrect, and iii) generating hints relevant to the problem. The results are inspiring: MAPR yields significant improvements in both accuracy and training efficiency on various reasoning benchmarks. More specifically, our method can speed up GRPO training by over 1.28x to reach the same performance, and achieve 83.18% gain in accuracy on AIME25, and a 13.04% average gain over six mathematics benchmarks. The code is publicly available at https://github.com/akatigre/MAPR-RL.", "authors": [ "Yoonjeon Kim", "Doohyuk Jang", "Eunho Yang" ], "year": 2026, "published_date": "2026-05-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2510.03259", "pdf_url": "https://arxiv.org/pdf/2510.03259", "citations": 0, "topics": [], "tags": [ "Reasoning", "RLHF", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.69, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent research on reasoning models explores the meta-awareness of language models, including their ability to determine optimal thinking duration, recognize knowledge boundaries, and structure concept-level thinking. While current large reasoning models depend solely on answer-based verification, we show that adding meta-awareness objectives leads to significant performance gains over models without such meta-knowledge.", "key_contribution": "While current large reasoning models depend solely on answer-based verification, we show that adding meta-awareness objectives leads to significant performance gains over models without such meta-knowledge.", "why_it_matters": "Verifying Meta-Awareness via Predictive Rewards in Reasoning Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "While current large reasoning models depend solely on answer-based verification, we show that adding meta-awareness…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2510.03259", "difficulty": "beginner" }, { "id": "arxiv:2606.00369", "source": "arxiv", "source_type": "preprint", "title": "Quantifying the Salience of Geo-Cultural Values for Pluralistic Safety Alignment", "abstract": "Safe global deployment of AI models requires alignment with human values that vary across cultures. Yet rater pools in safety evaluation datasets remain largely geographically homogeneous, failing to capture geo-cultural differences. Further, it remains unclear whether such differences persist after controlling for demographics such as age, gender, and ethnicity. Through a meta-analysis of safety datasets, we find that most do not report geo-cultural information, and those that do lack a unified methodology to jointly analyze geo-cultural and demographic correlates. Using the Inglehart-Welzel dimensions of cross-cultural variation, we demonstrate via multilevel modeling that cultural zone membership explains variance in safety ratings beyond standard demographics (p<0.05 across 6 datasets). Moreover, our analysis indicates that roughly 10% of items in the datasets we examined are culturally sensitive: likely to be misclassified as safe without adequate cultural representation. We evaluate LLMs as both rater surrogates and triage tools, finding that current LLMs do not reliably stand in for raters, though they can help prioritize culturally sensitive items for human annotation. Our findings motivate more culturally pluralistic safety evaluation and offer practical takeaways to support it.", "authors": [ "Arkadiy Saakyan", "Charvi Rastogi", "Lora Aroyo" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.00369", "pdf_url": "https://arxiv.org/pdf/2606.00369", "citations": 0, "topics": [], "tags": [ "AI Safety", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.33, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Safe global deployment of AI models requires alignment with human values that vary across cultures. Yet rater pools in safety evaluation datasets remain largely geographically homogeneous, failing to capture geo-cultural differences.", "key_contribution": "Using the Inglehart-Welzel dimensions of cross-cultural variation, we demonstrate via multilevel modeling that cultural zone membership explains variance in safety ratings beyond standard demographics (p<0.05 across 6 datasets).", "why_it_matters": "Quantifying the Salience of Geo-Cultural Values for Pluralistic Safety Alignment represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "Using the Inglehart-Welzel dimensions of cross-cultural variation, we demonstrate via multilevel modeling that cultural…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in AI Safety.", "url": "https://arxiv.org/abs/2606.00369", "difficulty": "advanced" }, { "id": "arxiv:2509.20070", "source": "arxiv", "source_type": "preprint", "title": "LLM Trainer: Automated Robotic Data Generation via Demonstration Augmentation using LLMs", "abstract": "We present LLM Trainer, a fully automated pipeline that leverages the world knowledge of Large Language Models (LLMs) to transform a small number of human demonstrations (as few as one) into a large robot dataset for imitation learning. Our approach decomposes demonstration generation into two steps: (1) offline demonstration annotation that extracts keyframes, salient objects, and pose-object relations; and (2) online keypose retargeting that adapts those keyframes to a new scene, given an initial observation. Using these modified keypoints, our system warps the original demonstration to generate a new trajectory, which is then executed, and the resulting demo, if successful, is saved. Because the annotation is reusable across scenes, we use Thompson sampling to optimize the annotation, significantly improving generation success rate. We evaluate our method on a range of tasks, and find that our data annotation method consistently outperforms expert-engineered baselines. We further show an ensemble policy that combines the optimized LLM feed-forward plan with a learned feedback imitation learning controller. Finally, we demonstrate hardware feasibility on a Franka Emika Panda robot. For additional materials and demonstration videos, please see the project website: https://sites.google.com/andrew.cmu.edu/llm-trainer", "authors": [ "Abraham George", "Amir Barati Farimani" ], "year": 2026, "published_date": "2026-05-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2509.20070", "pdf_url": "https://arxiv.org/pdf/2509.20070", "citations": 0, "topics": [], "tags": [ "LLMs", "Info Extraction", "Robotics" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.12, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present LLM Trainer, a fully automated pipeline that leverages the world knowledge of Large Language Models (LLMs) to transform a small number of human demonstrations (as few as one) into a large robot dataset for imitation learning. Our approach decomposes demonstration generation into two steps: (1) offline demonstration annotation that extracts keyframes, salient objects, and pose-object relations; and (2) online keypose retargeting that adapts those keyframes to a new scene, given an initial observation.", "key_contribution": "We present LLM Trainer, a fully automated pipeline that leverages the world knowledge of Large Language Models (LLMs) to transform a small number of human demonstrations (as few as one) into a large robot dataset for imitation learning.", "why_it_matters": "LLM Trainer: Automated Robotic Data Generation via Demonstration Augmentation using LLMs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present LLM Trainer, a fully automated pipeline that leverages the world knowledge of Large Language Models (LLMs)…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2509.20070", "difficulty": "intermediate" }, { "id": "arxiv:2605.28334", "source": "arxiv", "source_type": "preprint", "title": "Towards Cybersecurity SuperIntelligence (CSI): What's the best harness for cybersecurity?", "abstract": "What is the best harness for cybersecurity AI? Cybersecurity systems are converging on a single execution scaffold per agent, an iterative shell loop driven by a Large Language Model (LLM). However, scaffolds are not interchangeable, rarely interoperable, and no single scaffold dominates across all challenge types. In our path towards researching Cybersecurity SuperIntelligence (CSI), we present a meta-scaffold that unifies heterogeneous agent harnesses under a common orchestration layer, enabling any LLM-driven scaffold to be deployed, benchmarked, and composed within the same infrastructure. Using CSI, we benchmark five scaffolds (CSI::Claude, CSI::Codex, CSI::GCAI, CSI::Mistral, CSI::CAI) on the 33 cybench challenges, holding the model fixed at alias2-mini. The best individual scaffolds solve 15/33 (45.5%); the four-scaffold union solves 17/33 (51.5%), with the fifth (CSI::Mistral, 10/33) contributing one exclusive solve. We find that no single scaffold is the best harness: it is the combination of structurally heterogeneous scaffolds that yields the highest coverage. We validate this through CSI's blackboard-based multi-agent architecture, in which scaffold-specialised agents run in parallel and exchange intermediate findings via a shared substrate (a blackboard). The blackboard solves 19/33 (57.6%), a 27% relative gain over CSI::Claude, one of the best individual scaffolds (15/33, 45.5%), 25% faster (20.2 h vs. 26.8 h), at comparable cost ($5,480 vs. $5,122).", "authors": [ "Víctor Mayoral-Vilches", "Francesco Balassone", "María Sanz-Gómez", "Paul Zabalegui Landa", "Daniel Sánchez Prieto", "Marina Oteiza Álvarez", "Davide Quarta", "Martin Pinzger" ], "year": 2026, "published_date": "2026-05-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.28334", "pdf_url": "https://arxiv.org/pdf/2605.28334", "citations": 0, "topics": [], "tags": [ "Code Generation", "Evaluation", "Cryptography & Security" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.66, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "What is the best harness for cybersecurity AI? Cybersecurity systems are converging on a single execution scaffold per agent, an iterative shell loop driven by a Large Language Model (LLM).", "key_contribution": "In our path towards researching Cybersecurity SuperIntelligence (CSI), we present a meta-scaffold that unifies heterogeneous agent harnesses under a common orchestration layer, enabling any LLM-driven scaffold to be deployed, benchmarked, and composed within the same infrastructure.", "why_it_matters": "Towards Cybersecurity SuperIntelligence (CSI): What's the best harness for cybersecurity? represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Code Generation.", "one_line_takeaway": "In our path towards researching Cybersecurity SuperIntelligence (CSI), we present a meta-scaffold that unifies…", "biggest_caveat": "However, scaffolds are not interchangeable, rarely interoperable, and no single scaffold dominates across all challenge types.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Code Generation.", "url": "https://arxiv.org/abs/2605.28334", "difficulty": "beginner" }, { "id": "arxiv:2605.10367", "source": "arxiv", "source_type": "preprint", "title": "AgentGR: Semantic-aware Agentic Group Decision-Making Simulator for Group Recommendation", "abstract": "Group Recommendation (GR) aims to suggest items to a group of users, which has become a critical component of modern social platforms. Existing GR methods focus on aggregating individual user preferences with advanced neural networks to infer group preferences. Despite effectiveness, they essentially treat group preference learning as a simple preference aggregation process, failing to capture the complex dynamics of real-world group decision-making. To address these limitations, we propose AgentGR, a novel Semantic-aware Agentic Group Decision-Making Simulator for Group Recommendations, inspired by the semantic reasoning and human behavior simulation capabilities of LLM-driven agents. It aims to jointly capture collaborative-semantic user preferences for member-role-playing and simulate dynamic group interactions to reflect real-world group decision-making processes, thereby boosting recommendation performance. Specifically, to capture collaborative-semantic user preferences, we introduce a semantic meta-path guided chain-of-preference reasoning mechanism that integrates high-order collaborative filtering signals and textual semantics to improve user preference profiles. To model the complex dynamics of group decision-making, we first recognize group topic and leadership to explicitly model the influencing factors within the group decision processes. Building on these, we simulate group-level decision dynamics via two multi-agent simulation strategies for recommendations: a static workflow-based strategy for efficiency and a dynamic dialogue-based strategy for precision. Extensive experiments on two real-world datasets show that AgentGR significantly outperforms state-of-the-art baselines in both recommendation accuracy and group decision simulation, highlighting its potential for real-world GR applications.", "authors": [ "Yangtao Zhou", "Wenhao You", "Hua Chu", "Shihao Guo", "Jianan Li", "Zhifu Zhao", "Qingshan Li" ], "year": 2026, "published_date": "2026-05-11", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.10367", "pdf_url": "https://arxiv.org/pdf/2605.10367", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "RLHF", "AI Agents", "Dialogue" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.74, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Group Recommendation (GR) aims to suggest items to a group of users, which has become a critical component of modern social platforms. Existing GR methods focus on aggregating individual user preferences with advanced neural networks to infer group preferences.", "key_contribution": "To address these limitations, we propose AgentGR, a novel Semantic-aware Agentic Group Decision-Making Simulator for Group Recommendations, inspired by the semantic reasoning and human behavior simulation capabilities of LLM-driven agents.", "why_it_matters": "AgentGR: Semantic-aware Agentic Group Decision-Making Simulator for Group Recommendation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address these limitations, we propose AgentGR, a novel Semantic-aware Agentic Group Decision-Making Simulator for…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.10367", "difficulty": "advanced" }, { "id": "arxiv:2605.06021", "source": "arxiv", "source_type": "preprint", "title": "PlotPick: AI-powered batch extraction of numerical data from scientific figures", "abstract": "Systematic reviews and meta-analyses frequently require numerical data that authors report only as figures, yet manual digitisation is slow and does not scale. We present PlotPick, an open-source tool that uses vision-language models (VLMs) to batch-extract structured tabular data from scientific figures. We evaluate six VLMs from three providers on two established chart-to-table benchmarks (ChartX and PlotQA) and compare against the dedicated chart-to-table model DePlot. All six VLMs outperform DePlot on both benchmarks. On ChartX (restricted to bar charts, line charts, box plots, and histograms; n=300), VLMs achieve 88-96% recall versus 71% for DePlot. On PlotQA (n=529), VLMs achieve 86-99% RMSF1 versus 94% for DePlot. The gap is largest on chart types absent from the dedicated models' training data: on box plots, DePlot achieves 24% RMSF1 while VLMs achieve 83-97%. PlotPick is available at https://plotpick.streamlit.app.", "authors": [ "Tommy Carstensen" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.06021", "pdf_url": "https://arxiv.org/pdf/2605.06021", "citations": 0, "topics": [], "tags": [ "VLMs", "Structured Data", "Evaluation", "Computer Vision" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.68, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Systematic reviews and meta-analyses frequently require numerical data that authors report only as figures, yet manual digitisation is slow and does not scale. We present PlotPick, an open-source tool that uses vision-language models (VLMs) to batch-extract structured tabular data from scientific figures.", "key_contribution": "We present PlotPick, an open-source tool that uses vision-language models (VLMs) to batch-extract structured tabular data from scientific figures.", "why_it_matters": "PlotPick: AI-powered batch extraction of numerical data from scientific figures advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about VLMs.", "one_line_takeaway": "We present PlotPick, an open-source tool that uses vision-language models (VLMs) to batch-extract structured tabular…", "biggest_caveat": "does not scale.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in VLMs.", "url": "https://arxiv.org/abs/2605.06021", "difficulty": "beginner" }, { "id": "arxiv:2605.17691", "source": "arxiv", "source_type": "preprint", "title": "Validate Your Authority: Benchmarking LLMs on Multi-Label Precedent Treatment Classification", "abstract": "Automating the classification of negative treatment in legal precedent is a critical yet nuanced NLP task where misclassification carries significant risk. To address the shortcomings of standard accuracy, this paper introduces a more robust evaluation framework. We benchmark modern Large Language Models on a new, expert-annotated dataset of 239 real-world legal citations and propose a novel Average Severity Error metric to better measure the practical impact of classification errors. Our experiments reveal a performance split. Google's Gemini 2.5 Flash achieved the highest accuracy on a high-level classification task (79.1%), while OpenAI's GPT-5-mini was the top performer on the more complex fine-grained schema (67.7%). This work establishes a crucial baseline, provides a new context-rich dataset, and introduces an evaluation metric tailored to the demands of this complex legal reasoning task.", "authors": [ "M. Mikail Demir", "M. Abdullah Canbaz" ], "year": 2026, "published_date": "2026-05-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.17691", "pdf_url": "https://arxiv.org/pdf/2605.17691", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Legal AI", "Evaluation", "NLP" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.59, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Automating the classification of negative treatment in legal precedent is a critical yet nuanced NLP task where misclassification carries significant risk. To address the shortcomings of standard accuracy, this paper introduces a more robust evaluation framework.", "key_contribution": "We benchmark modern Large Language Models on a new, expert-annotated dataset of 239 real-world legal citations and propose a novel Average Severity Error metric to better measure the practical impact of classification errors.", "why_it_matters": "Validate Your Authority: Benchmarking LLMs on Multi-Label Precedent Treatment Classification represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We benchmark modern Large Language Models on a new, expert-annotated dataset of 239 real-world legal citations and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.17691", "difficulty": "beginner" }, { "id": "arxiv:2605.02126", "source": "arxiv", "source_type": "preprint", "title": "Ultrasound Vision-Language Alignment via Contrastive Learning", "abstract": "Ultrasound foundation models have achieved strong performance on structured prediction tasks but remain exclusively vision-based, limiting zero-shot and few-shot transfer to novel tasks where task-specific annotation is scarce. We address this gap with EchoCare-CLIP, a CLIP-style dual-encoder contrastive framework that aligns ultrasound images with clinical text in a shared embedding space. We curate a multi-organ corpus of over 16K image-text pairs spanning breast, liver, lung, and thyroid, with over 78% of captions derived from expert-annotated reports, and complement the remainder with a three-tier template-based and LLM-based caption generation pipeline. We evaluate model configurations spanning two text encoder families (CLIP, BioClinicalBERT) and two caption strategies (template-based, LLM-generated) against OpenAI CLIP and BiomedCLIP baselines. Our trained models consistently improve cross-modal alignment over baselines, with the best configuration achieving a paired alignment score of 0.682. However, stronger alignment does not guarantee better downstream performance: CLIP-based variants with partial fine-tuning achieve the strongest zero-shot classification on external held-out datasets (0.709 on BUSI; 0.626 on AULI), while full end-to-end fine-tuning degrades transfer due to overfitting. On linear probing and few-shot adaptation, model rankings are dataset-dependent, reflecting a trade-off between domain adaptation and representational generalizability. We further show that template-based captions match or outperform LLM-generated captions, suggesting lexical diversity is not a proxy for caption quality. Taken together, our results demonstrate that ultrasound vision-language alignment is achievable from public data alone, but robust clinical transfer requires careful balancing of domain adaptation, encoder capacity, and caption supervision quality.", "authors": [ "Zhuoyang Lyu", "Yiyang Zhang", "Tongxin Wang", "Ruirui Lan" ], "year": 2026, "published_date": "2026-05-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.02126", "pdf_url": "https://arxiv.org/pdf/2605.02126", "citations": 0, "topics": [], "tags": [ "LLMs", "Prompting", "Fine-Tuning", "AI Safety", "VLMs" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.95, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Ultrasound foundation models have achieved strong performance on structured prediction tasks but remain exclusively vision-based, limiting zero-shot and few-shot transfer to novel tasks where task-specific annotation is scarce. We address this gap with EchoCare-CLIP, a CLIP-style dual-encoder contrastive framework that aligns ultrasound images with clinical text in a shared embedding space.", "key_contribution": "Ultrasound foundation models have achieved strong performance on structured prediction tasks but remain exclusively vision-based, limiting zero-shot and few-shot transfer to novel tasks where task-specific annotation is scarce.", "why_it_matters": "Ultrasound Vision-Language Alignment via Contrastive Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Ultrasound foundation models have achieved strong performance on structured prediction tasks but remain exclusively…", "biggest_caveat": "but remain exclusively vision-based, limiting zero-shot and few-shot transfer to novel tasks where task-specific annotation is scarce.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.02126", "difficulty": "advanced" }, { "id": "arxiv:2604.04978v1", "source": "arxiv", "source_type": "preprint", "title": "Measuring the Permission Gate: A Stress-Test Evaluation of Claude Code's Auto Mode", "abstract": "Claude Code's auto mode is the first deployed permission system for AI coding agents, using a two-stage transcript classifier to gate dangerous tool calls. Anthropic reports a 0.4% false positive rate and 17% false negative rate on production traffic. We present the first independent evaluation of this system on deliberately ambiguous authorization scenarios, i.e., tasks where the user's intent is clear but the target scope, blast radius, or risk level is underspecified. Using AmPermBench, a 128-prompt benchmark spanning four DevOps task families and three controlled ambiguity axes, we evaluate 253 state-changing actions at the individual action level against oracle ground truth. Our findings characterize auto mode's scope-escalation coverage under this stress-test workload. The end-to-end false negative rate is 81.0% (95% CI: 73.8%-87.4%), substantially higher than the 17% reported on production traffic, reflecting a fundamentally different workload rather than a contradiction. Notably, 36.8% of all state-changing actions fall outside the classifier's scope via Tier 2 (in-project file edits), contributing to the elevated end-to-end FNR. Even restricting to the 160 actions the classifier actually evaluates (Tier 3), the FNR remains 70.3%, while the FPR rises to 31.9%. The Tier 2 coverage gap is most pronounced on artifact cleanup (92.9% FNR), where agents naturally fall back to editing state files when the expected CLI is unavailable. These results highlight a coverage boundary worth examining: auto mode assumes dangerous actions transit the shell, but agents routinely achieve equivalent effects through file edits that the classifier does not evaluate.", "authors": [ "Zimo Ji", "Zongjie Li", "Wenyuan Jiang", "Yudong Gao", "Shuai Wang" ], "year": 2026, "published_date": "2026-04-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.04978v1", "pdf_url": "https://arxiv.org/pdf/2604.04978v1", "citations": 0, "topics": [], "tags": [ "Evaluation", "Artificial Intelligence", "Cryptography & Security", "Software Engineering", "Benchmarking & Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.83, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Claude Code's auto mode is the first deployed permission system for AI coding agents, using a two-stage transcript classifier to gate dangerous tool calls. Anthropic reports a 0.4% false positive rate and 17% false negative rate on production traffic.", "key_contribution": "We present the first independent evaluation of this system on deliberately ambiguous authorization scenarios, i.e., tasks where the user's intent is clear but the target scope, blast radius, or risk level is underspecified.", "why_it_matters": "Measuring the Permission Gate: A Stress-Test Evaluation of Claude Code's Auto Mode represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "We present the first independent evaluation of this system on deliberately ambiguous authorization scenarios, i.e.,…", "biggest_caveat": "but the target scope, blast radius, or risk level is underspecified.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "http://arxiv.org/abs/2604.04978v1", "difficulty": "beginner" }, { "id": "arxiv:2605.26655", "source": "arxiv", "source_type": "preprint", "title": "Why Prompt Optimization Works, and Why It Sometimes Doesn't: A Causal-Inspired Edit-Level Analysis", "abstract": "Automated prompt optimization methods (e.g., DSpy, TextGrad) can substantially improve the performance of large language model (LLM), however, their generalization ability across different tasks remains underperformed. In practice, the superiority of the optimized prompt on one benchmark often fails to transfer to another, and this limitation persists even when switching across different LLM backbones. To investigate the underexplored sources of heterogeneity in prompt performance, we conduct a causal inference-inspired observational analysis of optimized prompts across a diverse set of optimization frameworks, LLM backbones, and NLP benchmarks. To achieve the goal, we build upon the propensity-adjusted associational analysis together with multiple complementary representations of prompt edits, where the consistent task-conditioned edits patterns are identified. We find that complexity-increasing and meta-instructional edits are negatively associated with mathematical and multi-hop reasoning performance, whereas step-by-step and meta-cognitive edits improve logical and sequential reasoning tasks. These effects are robust across cognitive-load annotations, surface-level text features, and edit-motif analyses, and can generalize across optimization frameworks. Overall, these results indicate that prompt optimization failures arise from systematic interactions between edit families and task characteristics rather than random optimization artifacts, providing feature-level characterization of optimizer behavior and motivating future task-conditioned optimizer design.", "authors": [ "Shuzhi Gong", "Hechuan Wen" ], "year": 2026, "published_date": "2026-05-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.26655", "pdf_url": "https://arxiv.org/pdf/2605.26655", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Evaluation", "NLP", "Neural Networks" ], "paper_type": "benchmark", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses causal inference and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.22, "content_potential_score": 2.05, "interestingness_score": 2.52, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Automated prompt optimization methods (e.g., DSpy, TextGrad) can substantially improve the performance of large language model (LLM), however, their generalization ability across different tasks remains underperformed. In practice, the superiority of the optimized prompt on one benchmark often fails to transfer to another, and this limitation persists even when switching across different LLM backbones.", "key_contribution": "To achieve the goal, we build upon the propensity-adjusted associational analysis together with multiple complementary representations of prompt edits, where the consistent task-conditioned edits patterns are identified.", "why_it_matters": "Why Prompt Optimization Works, and Why It Sometimes Doesn't: A Causal-Inspired Edit-Level Analysis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To achieve the goal, we build upon the propensity-adjusted associational analysis together with multiple complementary…", "biggest_caveat": "however, their generalization ability across different tasks remains underperformed.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.26655", "difficulty": "frontier" }, { "id": "arxiv:2605.21811", "source": "arxiv", "source_type": "preprint", "title": "Safe and Steerable Geometric Motion Policies for Robotic Dexterous Manipulation", "abstract": "Robotic dexterous manipulation requires continuously reconciling objectives and constraints defined on heterogeneous geometric spaces: a robot controlled on a $\\mathbb{R}^7$ configuration manifold may need to track end effector poses on $\\mathrm{SE}(3)$ while satisfying obstacle avoidance margins in $\\mathbb{R}$. We present Safe Pullback Bundle Dynamical Systems (SafePBDS), a geometrically consistent framework that computes optimal, certifiably safe configuration manifold accelerations from objectives and safety requirements on arbitrary task manifolds. SafePBDS builds on prior work that combines predefined task manifold dynamical systems to produce autonomous motion. Its first innovation is a pullback control barrier function construction, which converts task manifold safety conditions into linear constraints on configuration manifold accelerations. The second innovation is a task manifold action interface that allows a high-level policy to inject low dimensional residual motions; zero input recovers the autonomous behavior, while safety is preserved under arbitrary inputs. This lets high-level policies efficiently steer exploration while leaving precise motion to the autonomous behavior. We validate SafePBDS in simulation and on a 23-DOF Franka Panda-Allegro Hand platform. On dexterous grasping, SafePBDS achieves a $92.5\\%$ success rate across 20 household objects and 120 trials. Using the action interface, the method can exclude any one of the four fingers during grasping via a one-dimensional action, achieving $94.4\\%$ 3-finger grasp success across 3 objects and 36 trials. The efficient planning and safety guarantee of SafePBDS also enables the first model-based, fully actuated palm-down in-hand reorientation, exceeding $360^\\circ$ of yaw rotation in both directions under varying object weight and wrist motion. Demo video and details: https://tml.stanford.edu/safe-pbds", "authors": [ "Albert Wu", "Riccardo Bonalli", "Thomas Lew", "C. Karen Liu" ], "year": 2026, "published_date": "2026-05-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.21811", "pdf_url": "https://arxiv.org/pdf/2605.21811", "citations": 0, "topics": [], "tags": [ "Robotics" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses manifold and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.62, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Robotic dexterous manipulation requires continuously reconciling objectives and constraints defined on heterogeneous geometric spaces: a robot controlled on a $\\mathbb{R}^7$ configuration manifold may need to track end effector poses on $\\mathrm{SE}(3)$ while satisfying obstacle avoidance margins in $\\mathbb{R}$. We present Safe Pullback Bundle Dynamical Systems (SafePBDS), a geometrically consistent framework that computes optimal, certifiably safe configuration manifold accelerations from objectives and safety requirements on arbitrary task manifolds.", "key_contribution": "We present Safe Pullback Bundle Dynamical Systems (SafePBDS), a geometrically consistent framework that computes optimal, certifiably safe configuration manifold accelerations from objectives and safety requirements on arbitrary task manifolds.", "why_it_matters": "Safe and Steerable Geometric Motion Policies for Robotic Dexterous Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Robotics.", "one_line_takeaway": "We present Safe Pullback Bundle Dynamical Systems (SafePBDS), a geometrically consistent framework that computes…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Robotics.", "url": "https://arxiv.org/abs/2605.21811", "difficulty": "frontier" }, { "id": "arxiv:2601.21092", "source": "arxiv", "source_type": "preprint", "title": "MapPFN: Learning Causal Perturbation Maps in Context", "abstract": "Planning effective interventions in biological systems requires treatment-effect models that adapt to unseen biological contexts by identifying their specific underlying mechanisms. Yet single-cell perturbation datasets span only a handful of biological contexts, and existing methods cannot leverage new interventional evidence at inference time to adapt beyond their training data. To meta-learn a perturbation effect estimator, we present MapPFN, a prior-data fitted network (PFN) pre-trained on a synthetic biological prior with causal interventions, decoupling pre-training from limited wet-lab data. Unlike existing methods, MapPFN uses in-context learning to map a sequence of experiments to a post-perturbation distribution, enabling a single pre-trained model to adapt to new datasets and arbitrary gene sets at inference time. Zero-shot, MapPFN identifies differentially expressed genes on par with models trained on real single-cell data, and fine-tuning further improves predictions across biological contexts. Our code, model and data are available at https://marvinsxtr.github.io/MapPFN.", "authors": [ "Marvin Sextro", "Weronika Kłos", "Gabriel Dernbach" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.21092", "pdf_url": "https://arxiv.org/pdf/2601.21092", "citations": 0, "topics": [], "tags": [ "Prompting", "Fine-Tuning", "Self-Supervised", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.79, "content_potential_score": 1.68, "interestingness_score": 2.34, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Planning effective interventions in biological systems requires treatment-effect models that adapt to unseen biological contexts by identifying their specific underlying mechanisms. Yet single-cell perturbation datasets span only a handful of biological contexts, and existing methods cannot leverage new interventional evidence at inference time to adapt beyond their training data.", "key_contribution": "To meta-learn a perturbation effect estimator, we present MapPFN, a prior-data fitted network (PFN) pre-trained on a synthetic biological prior with causal interventions, decoupling pre-training from limited wet-lab data.", "why_it_matters": "MapPFN: Learning Causal Perturbation Maps in Context represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "To meta-learn a perturbation effect estimator, we present MapPFN, a prior-data fitted network (PFN) pre-trained on a…", "biggest_caveat": "cannot leverage new interventional evidence at inference time to adapt beyond their training data.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2601.21092", "difficulty": "beginner" }, { "id": "arxiv:2604.14846v1", "source": "arxiv", "source_type": "preprint", "title": "Zero-Shot Retail Theft Detection via Orchestrated Vision Models: A Model-Agnostic, Cost-Effective Alternative to Trained Single-Model Systems", "abstract": "Retail theft costs the global economy over \\$100 billion annually, yet existing AI-based detection systems require expensive custom model training on proprietary datasets and charge \\$200-500/month per store. We present Paza, a zero-shot retail theft detection framework that achieves practical concealment detection without training any model. Our approach orchestrates multiple existing models in a layered pipeline - cheap object detection and pose estimation running continuously, with an expensive vision-language model (VLM) invoked only when behavioral pre-filters trigger. A multi-signal suspicion pre-filter (requiring dwell time plus at least one behavioral signal) reduces VLM invocations by 240x compared to per-frame analysis, bounding calls to <=10/minute and enabling a single GPU to serve 10-20 stores. The architecture is model-agnostic: the VLM component accepts any OpenAI-compatible endpoint, enabling operators to swap between models such as Gemma 4, Qwen3.5-Omni, GPT-4o, or future releases without code changes - ensuring the system improves as the VLM landscape evolves. We evaluate the VLM component on the DCSASS synthesized shoplifting dataset (169 clips, controlled environment), achieving 89.5% precision and 92.8% specificity at 59.3% recall zero-shot - where the recall gap is attributable to sparse frame sampling in offline evaluation rather than VLM reasoning failures, as precision and specificity are the operationally critical metrics determining false alarm rates. We present a detailed cost model showing viability at \\$50-100/month per store (3-10x cheaper than commercial alternatives), and introduce a privacy-preserving design that obfuscates faces in the detection pipeline. The source code is available at https://github.com/xHaileab/Paza-AI.", "authors": [ "Haileab Yagersew" ], "year": 2026, "published_date": "2026-04-16", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.14846v1", "pdf_url": "https://arxiv.org/pdf/2604.14846v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "VLMs", "Object Detection", "Federated Learning" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Federated Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.17, "content_potential_score": 1.92, "interestingness_score": 2.46, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Retail theft costs the global economy over \\$100 billion annually, yet existing AI-based detection systems require expensive custom model training on proprietary datasets and charge \\$200-500/month per store. We present Paza, a zero-shot retail theft detection framework that achieves practical concealment detection without training any model.", "key_contribution": "We present Paza, a zero-shot retail theft detection framework that achieves practical concealment detection without training any model.", "why_it_matters": "Zero-Shot Retail Theft Detection via Orchestrated Vision Models: A Model-Agnostic, Cost-Effective Alternative to Trained Single-Model Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present Paza, a zero-shot retail theft detection framework that achieves practical concealment detection without…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.14846v1", "difficulty": "advanced" }, { "id": "arxiv:2601.04505", "source": "arxiv", "source_type": "preprint", "title": "CircuitLM: A Multi-Agent LLM-Aided Design Framework for Generating Circuit Schematics from Natural Language Prompts", "abstract": "Generating accurate circuit schematics from high-level natural language descriptions remains a persistent challenge in electronic design automation (EDA), as large language models (LLMs) frequently hallucinate components, violate strict physical constraints, and produce non-machine-readable outputs. To address this, we present CircuitLM, a multi-agent pipeline that translates user prompts into structured, visually interpretable $\\texttt{CircuitJSON}$ schematics. The framework mitigates hallucination and ensures physical viability by grounding generation in a curated, embedding-powered component knowledge base through five sequential stages: (i) component identification, (ii) canonical pinout retrieval, (iii) chain-of-thought reasoning, (iv) JSON schematic synthesis, and (v) interactive force-directed visualization. We evaluate the system on a dataset of 100 unique circuit-design prompts using five state-of-the-art LLMs. To systematically assess performance, we deploy a rigorous dual-layered evaluation methodology: a deterministic Electrical Rule Checking (ERC) engine categorizes topological faults by strict severity (Critical, Major, Minor, Warning), while an LLM-as-a-judge meta-evaluator identifies complex, context-aware design flaws that bypass standard rule-based checkers. Ultimately, this work demonstrates how targeted retrieval combined with deterministic and semantic verification can bridge natural language to structurally viable, schematic-ready hardware and safe circuit prototyping. Our code and data are publicly available at https://github.com/Khandakar227/CircuitLM.", "authors": [ "Khandakar Shakib Al Hasan", "Syed Rifat Raiyan", "Hasin Mahtab Alvee", "Wahid Sadik" ], "year": 2026, "published_date": "2026-05-26", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.04505", "pdf_url": "https://arxiv.org/pdf/2601.04505", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Hallucination", "Knowledge Graphs", "Interpretability" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.96, "content_potential_score": 1.92, "interestingness_score": 2.46, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Generating accurate circuit schematics from high-level natural language descriptions remains a persistent challenge in electronic design automation (EDA), as large language models (LLMs) frequently hallucinate components, violate strict physical constraints, and produce non-machine-readable outputs. To address this, we present CircuitLM, a multi-agent pipeline that translates user prompts into structured, visually interpretable $\\texttt{CircuitJSON}$ schematics.", "key_contribution": "To address this, we present CircuitLM, a multi-agent pipeline that translates user prompts into structured, visually interpretable $\\texttt{CircuitJSON}$ schematics.", "why_it_matters": "CircuitLM: A Multi-Agent LLM-Aided Design Framework for Generating Circuit Schematics from Natural Language Prompts represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this, we present CircuitLM, a multi-agent pipeline that translates user prompts into structured, visually…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2601.04505", "difficulty": "intermediate" }, { "id": "arxiv:2605.27963", "source": "arxiv", "source_type": "preprint", "title": "Throughput-Optimized Networks at Scale", "abstract": "Datacenter network design plays a critical role in AI training by supporting scaling to thousands of accelerators. An open problem, designing a near-optimal throughput oriented network-topology, routing, and collectives-has not been achieved at scale and with broad applicability to physical/implementation constraints. We address this problem with a compelling use-case, Google's TPU v4/5p supercomputer where the topology may be reconfigured to achieve higher all-to-all throughput, supporting large, parallelized AI training. We show that the existing TPU networks leave terabytes per second of throughput on the table and we fill that gap. This paper presents Throughput Optimized Networks at Scale (TONS), an automated network synthesis framework that meets the high-throughput demands of modern computing. TONS formulates topology synthesis as a linear optimization problem that maximizes a throughput-centric proxy metric, using theory and heuristics to scale to thousands of nodes. We further introduce a deadlock-free routing scheme compatible with limited virtual channels and optical switch faults, enabling the synthesized topologies to realize their predicted throughput gains in simulation. Evaluating uniform random and all-to-all traffic, TONS networks have a geometric mean speedups of 2.1x and 1.6x, respectively, over the best TPU v4/5p torus variants.", "authors": [ "Conor James Green", "Mithuna Thottethodi" ], "year": 2026, "published_date": "2026-05-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.27963", "pdf_url": "https://arxiv.org/pdf/2605.27963", "citations": 0, "topics": [], "tags": [ "Distributed Computing" ], "paper_type": "methods", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.05, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Datacenter network design plays a critical role in AI training by supporting scaling to thousands of accelerators. An open problem, designing a near-optimal throughput oriented network-topology, routing, and collectives-has not been achieved at scale and with broad applicability to physical/implementation constraints.", "key_contribution": "We address this problem with a compelling use-case, Google's TPU v4/5p supercomputer where the topology may be reconfigured to achieve higher all-to-all throughput, supporting large, parallelized AI training.", "why_it_matters": "Throughput-Optimized Networks at Scale represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Distributed Computing.", "one_line_takeaway": "We address this problem with a compelling use-case, Google's TPU v4/5p supercomputer where the topology may be…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Distributed Computing.", "url": "https://arxiv.org/abs/2605.27963", "difficulty": "frontier" }, { "id": "arxiv:2605.26159", "source": "arxiv", "source_type": "preprint", "title": "Device Context Protocol: A Compact, Safety-First Architecture for LLM-Driven Control of Constrained Devices", "abstract": "Large language models are increasingly used as orchestrators of external tools via the Model Context Protocol (MCP), but MCP is built for software services with megabytes of memory and does not descend to the microcontrollers that dominate the long tail of physical devices. Recent work (IoT-MCP) ports MCP to edge gateways at 74 KB peak memory; this still excludes the smallest commodity MCUs and, critically, does not address the safety problem of giving an unreliable caller (an LLM that may hallucinate or be prompt-injected) direct control of physical hardware. We present the Device Context Protocol (DCP): a sub-50-byte typical frame (6-byte header + CBOR payload + optional 16-byte HMAC), a manifest schema in which capability scoping, range and type checks, dry-run evaluation, and units-as-types are protocol-layer primitives, and a host-side Bridge that rejects malformed or hallucinated calls before any byte reaches the device. Reference firmware measures 27.6 KB flash / 0.6 KB RAM on ESP32; the Python Bridge, ESP32 firmware, and a language-neutral conformance suite are MIT-licensed and public. An empirical study -- 675 tool calls produced by five LLMs across four vendors (DeepSeek, Alibaba, Zhipu, MiniMax) against six categories of adversarial prompts, with the injection category instantiating AgentDojo's attack templates -- shows DCP rejects 100% of capability-escalation attempts and 78% of prompt-injection attempts, versus 0--1% for Raw MCP and IoT-MCP, matching the expressiveness of a well-formed OpenAPI 3 schema at three orders of magnitude less firmware footprint. We position DCP as the missing layer between MCP (which is moving toward enterprise SaaS connectivity) and the physical devices it does not reach.", "authors": [ "Dongxu Yang" ], "year": 2026, "published_date": "2026-05-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.26159", "pdf_url": "https://arxiv.org/pdf/2605.26159", "citations": 0, "topics": [], "tags": [ "LLMs", "Machine Learning", "Cryptography & Security" ], "paper_type": "empirical", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.73, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models are increasingly used as orchestrators of external tools via the Model Context Protocol (MCP), but MCP is built for software services with megabytes of memory and does not descend to the microcontrollers that dominate the long tail of physical devices. Recent work (IoT-MCP) ports MCP to edge gateways at 74 KB peak memory; this still excludes the smallest commodity MCUs and, critically, does not address the safety problem of giving an unreliable caller (an LLM that may hallucinate or be prompt-injected) direct control of physical hardware.", "key_contribution": "We present the Device Context Protocol (DCP): a sub-50-byte typical frame (6-byte header + CBOR payload + optional 16-byte HMAC), a manifest schema in which capability scoping, range and type checks, dry-run evaluation, and units-as-types are protocol-layer primitives, and a host-side Bridge that rejects malformed or hallucinated calls before any byte reaches the device.", "why_it_matters": "Device Context Protocol: A Compact, Safety-First Architecture for LLM-Driven Control of Constrained Devices represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present the Device Context Protocol (DCP): a sub-50-byte typical frame (6-byte header + CBOR payload + optional…", "biggest_caveat": "does not descend to the microcontrollers that dominate the long tail of physical devices.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.26159", "difficulty": "intermediate" }, { "id": "arxiv:2605.25233", "source": "arxiv", "source_type": "preprint", "title": "Meta-Agent: From Task Descriptions to Verified Multi-Agent Systems", "abstract": "AI agents are increasingly used to solve complex, multi-step tasks, but existing multi-agent frameworks remain brittle as workflows grow in scale and depth. Small errors at intermediate stages can propagate through agent interactions, while insufficient grounding and weak verification mechanisms further limit reliability. We present Meta-Agent, a two-phase framework that automatically constructs and executes specialized multi-agent systems from natural-language task descriptions. In the construction phase, a task planner decomposes a problem into a directed acyclic graph of agent specifications with explicit input/output contracts and verification criteria. A web search module grounds each specification with external evidence, and a code generation module produces system prompts and tool configurations. A construction-time verification stage then validates generated artifacts and triggers targeted regeneration when failures are detected. In the execution phase, a coordinator dispatches subtasks across the agent graph while execution-time verification gates intermediate outputs. We further introduce a three-level error attribution mechanism that distinguishes local, upstream, and structural failures, enabling targeted recovery strategies ranging from localized retries to partial re-execution and re-decomposition. We evaluate Meta-Agent across coding, contextual learning, and open-ended reasoning tasks. Experiments against strong multi-agent baselines and ablation studies demonstrate consistent improvements in task success rate, error recovery, and workflow stability. The results highlight the importance of tightly integrating planning, grounding, and verification for building reliable multi-agent systems.", "authors": [ "Andy Xu", "Yu-Wing Tai" ], "year": 2026, "published_date": "2026-05-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.25233", "pdf_url": "https://arxiv.org/pdf/2605.25233", "citations": 0, "topics": [], "tags": [ "Reasoning", "Hallucination", "AI Agents", "Info Extraction", "Code Generation" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.61, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "AI agents are increasingly used to solve complex, multi-step tasks, but existing multi-agent frameworks remain brittle as workflows grow in scale and depth. Small errors at intermediate stages can propagate through agent interactions, while insufficient grounding and weak verification mechanisms further limit reliability.", "key_contribution": "We present Meta-Agent, a two-phase framework that automatically constructs and executes specialized multi-agent systems from natural-language task descriptions.", "why_it_matters": "Meta-Agent: From Task Descriptions to Verified Multi-Agent Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We present Meta-Agent, a two-phase framework that automatically constructs and executes specialized multi-agent systems…", "biggest_caveat": "but existing multi-agent frameworks remain brittle as workflows grow in scale and depth.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.25233", "difficulty": "intermediate" }, { "id": "arxiv:2605.23497", "source": "arxiv", "source_type": "preprint", "title": "Asking For An Old Friend: Diagnosing and Mitigating Temporal Failure Modes in LLM-based Statutory Question Answering", "abstract": "Large language models are increasingly used for legal research, yet their fixed training cutoffs and reliance on static parametric knowledge are at odds with the evolving nature of statutory law. We study two temporal failure modes: post-cutoff staleness, where models apply superseded rules after legislative amendments, and recency bias, where models prefer newer provisions even when a historical version governs the fact pattern. To this end, we present a benchmark of 312 expert-validated, time-sensitive German statutory QA pairs spanning three categories: Post-Cutoff Amendment Questions, Pre-Amendment Questions, and Multi-Provision Pre-Amendment Questions. We evaluate five LLMs by OpenAI, Anthropic and DeepSeek under four inference settings: Vanilla, Web-search, and two retrieval-augmented variants that enforce temporal validity via a fact date extraction and version filtering. Using an LLM-as-a-judge validated against human expert ratings, we find severe degradation in the Vanilla post-cutoff setting. Both RAG approaches substantially improve performance across all question types, while web search yields unstable gains and exhibits a marked recency bias on historically anchored tasks. Our results indicate that reliable legal QA requires treating temporal validity as a hard constraint.", "authors": [ "Max Prior", "Andreas Schultz", "Matthias Grabmair" ], "year": 2026, "published_date": "2026-05-22", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.23497", "pdf_url": "https://arxiv.org/pdf/2605.23497", "citations": 0, "topics": [], "tags": [ "LLMs", "RAG", "QA", "Fairness & Ethics", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.52, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models are increasingly used for legal research, yet their fixed training cutoffs and reliance on static parametric knowledge are at odds with the evolving nature of statutory law. We study two temporal failure modes: post-cutoff staleness, where models apply superseded rules after legislative amendments, and recency bias, where models prefer newer provisions even when a historical version governs the fact pattern.", "key_contribution": "To this end, we present a benchmark of 312 expert-validated, time-sensitive German statutory QA pairs spanning three categories: Post-Cutoff Amendment Questions, Pre-Amendment Questions, and Multi-Provision Pre-Amendment Questions.", "why_it_matters": "Asking For An Old Friend: Diagnosing and Mitigating Temporal Failure Modes in LLM-based Statutory Question Answering represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To this end, we present a benchmark of 312 expert-validated, time-sensitive German statutory QA pairs spanning three…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.23497", "difficulty": "beginner" }, { "id": "arxiv:2605.02398", "source": "arxiv", "source_type": "preprint", "title": "The Compliance Trap: How Structural Constraints Degrade Frontier AI Metacognition Under Adversarial Pressure", "abstract": "As frontier AI models are deployed in high-stakes decision pipelines, their ability to maintain metacognitive stability -- knowing what they do not know, detecting errors, seeking clarification -- under adversarial pressure is a critical safety requirement. Current safety evaluations focus on detecting strategic deception (scheming); we investigate a more fundamental failure mode: cognitive collapse. We present SCHEMA, an evaluation of 11 frontier models from 8 vendors across 67,221 scored records using a 6-condition factorial design with dual-classifier scoring. We find that 8 of 11 models suffer catastrophic metacognitive degradation under adversarial pressure, with accuracy dropping by up to 30.2 percentage points (all $p < 2 \\times 10^{-8}$, surviving Bonferroni correction). Crucially, we identify a \"Compliance Trap\": through factorial isolation and a benign distraction control, we demonstrate that collapse is driven not by the psychological content of survival threats, but by compliance-forcing instructions that override epistemic boundaries. Removing the compliance suffix restores performance even under active threat. Models with advanced reasoning capabilities exhibit the most severe absolute degradation, while Anthropic's Constitutional AI demonstrates near-perfect immunity -- not from superior capability (Google's Gemini matches its baseline accuracy) but from alignment-specific training. We release the complete dataset and evaluation infrastructure.", "authors": [ "Rahul Kumar" ], "year": 2026, "published_date": "2026-05-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.02398", "pdf_url": "https://arxiv.org/pdf/2605.02398", "citations": 0, "topics": [], "tags": [ "Reasoning", "AI Safety", "Artificial Intelligence", "NLP", "Machine Learning" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.09, "content_potential_score": 2.34, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "As frontier AI models are deployed in high-stakes decision pipelines, their ability to maintain metacognitive stability -- knowing what they do not know, detecting errors, seeking clarification -- under adversarial pressure is a critical safety requirement. Current safety evaluations focus on detecting strategic deception (scheming); we investigate a more fundamental failure mode: cognitive collapse.", "key_contribution": "We present SCHEMA, an evaluation of 11 frontier models from 8 vendors across 67,221 scored records using a 6-condition factorial design with dual-classifier scoring.", "why_it_matters": "The Compliance Trap: How Structural Constraints Degrade Frontier AI Metacognition Under Adversarial Pressure represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We present SCHEMA, an evaluation of 11 frontier models from 8 vendors across 67,221 scored records using a 6-condition…", "biggest_caveat": "but by compliance-forcing instructions that override epistemic boundaries.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.02398", "difficulty": "advanced" }, { "id": "arxiv:2512.09629", "source": "arxiv", "source_type": "preprint", "title": "End-to-end PDDL Planning with Hardcoded and Dynamic Agents", "abstract": "We present an end-to-end framework for planning supported by verifiers. An orchestrator receives a human specification written in natural language and converts it into a PDDL (Planning Domain Definition Language) model, where the domain and problem are iteratively refined by sub-modules (agents) to address common planning requirements, such as time constraints and optimality, as well as ambiguities and contradictions that may exist in the human specification. We support two categories of agents: hardcoded, which are informed by logs and error traces and have a pre-defined goal (e.g., fix issues with PDDL syntax, check temporal constraints), and dynamic, which have no predefined goal but adapt to the specific domain and revise the latent planning abstraction. The validated domain and problem are then passed to an external planning engine to generate a plan. The orchestrator and agents are powered by Large Language Models (LLMs) and require no human intervention at any stage of the process. Finally, a module translates the final plan back into natural language to improve human readability while maintaining the correctness of each step. We demonstrate the flexibility and effectiveness of our framework on GPT-\\{4o, 5-mini, 5.4\\}, and Gemini-\\{2.5, 3\\}-flash across more than ten domains and tasks, including the Google NaturalPlan benchmark, Planbench, and classic planning problems like Sokoban, Blocksworld and the Tower of Hanoi, where LLMs are known to struggle even with small instances. Our framework can be integrated with any PDDL planning engine and validator (we successfully tested Fast Downward, LPG, POPF, VAL, and uVAL) and represents a significant step toward end-to-end planning aided by LLMs.", "authors": [ "Emanuele La Malfa", "Ping Zhu", "Samuele Marro", "Sara Bernardini", "Michael Wooldridge" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2512.09629", "pdf_url": "https://arxiv.org/pdf/2512.09629", "citations": 0, "topics": [], "tags": [ "LLMs", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 7.0, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present an end-to-end framework for planning supported by verifiers. An orchestrator receives a human specification written in natural language and converts it into a PDDL (Planning Domain Definition Language) model, where the domain and problem are iteratively refined by sub-modules (agents) to address common planning requirements, such as time constraints and optimality, as well as ambiguities and contradictions that may exist in the human specification.", "key_contribution": "We present an end-to-end framework for planning supported by verifiers.", "why_it_matters": "End-to-end PDDL Planning with Hardcoded and Dynamic Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present an end-to-end framework for planning supported by verifiers.", "biggest_caveat": "but adapt to the specific domain and revise the latent planning abstraction.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2512.09629", "difficulty": "beginner" }, { "id": "arxiv:2602.08915", "source": "arxiv", "source_type": "preprint", "title": "Comparing AI Coding Agents: A Task-Stratified Analysis of Pull Request Acceptance", "abstract": "The rapid adoption of AI-powered coding assistants is transforming software development practices, yet systematic comparisons of their effectiveness across different task types and over time remain limited. This paper presents an empirical study comparing five popular agents (OpenAI Codex, GitHub Copilot, Devin, Cursor, and Claude Code), analyzing 7,156 pull requests (PRs) from the AIDev dataset. Temporal trend analysis reveals heterogeneous evolution patterns: Devin exhibits the only consistent positive trend in acceptance rate (+0.77% per week over 32 weeks), whereas other agents remain largely stable. Our analysis suggests that the PR task type is a dominant factor influencing acceptance rates: documentation tasks achieve 82.1% acceptance compared to 66.1% for new features - a 16 percentage point gap that exceeds typical inter-agent variance for most tasks. OpenAI Codex achieves consistently high acceptance rates across all nine task categories (59.6%-88.6%), with stratified Chi-square tests confirming statistically significant advantages over other agents in several task categories. However, no single agent performs best across all task types: Claude Code leads in documentation (92.3%) and features (72.6%), while Cursor excels in fix tasks (80.4%).", "authors": [ "Giovanni Pinna", "Jingzhi Gong", "David Williams", "Federica Sarro" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.08915", "pdf_url": "https://arxiv.org/pdf/2602.08915", "citations": 0, "topics": [], "tags": [ "Code Generation", "Software Engineering" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.92, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The rapid adoption of AI-powered coding assistants is transforming software development practices, yet systematic comparisons of their effectiveness across different task types and over time remain limited. This paper presents an empirical study comparing five popular agents (OpenAI Codex, GitHub Copilot, Devin, Cursor, and Claude Code), analyzing 7,156 pull requests (PRs) from the AIDev dataset.", "key_contribution": "Our analysis suggests that the PR task type is a dominant factor influencing acceptance rates: documentation tasks achieve 82.1% acceptance compared to 66.1% for new features - a 16 percentage point gap that exceeds typical inter-agent variance for most tasks.", "why_it_matters": "Comparing AI Coding Agents: A Task-Stratified Analysis of Pull Request Acceptance represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Code Generation.", "one_line_takeaway": "Our analysis suggests that the PR task type is a dominant factor influencing acceptance rates: documentation tasks…", "biggest_caveat": "However, no single agent performs best across all task types: Claude Code leads in documentation (92.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Code Generation.", "url": "https://arxiv.org/abs/2602.08915", "difficulty": "intermediate" }, { "id": "arxiv:2604.25476v1", "source": "arxiv", "source_type": "preprint", "title": "PSP: An Interpretable Per-Dimension Accent Benchmark for Indic Text-to-Speech", "abstract": "Standard text-to-speech (TTS) evaluation measures intelligibility (WER, CER) and overall naturalness (MOS, UTMOS) but does not quantify accent. A synthesiser may score well on all four yet sound non-native on features that are phonemic in the target language. For Indic languages, these features include retroflex articulation, aspiration, vowel length, and the Tamil retroflex approximant (letter zha). We present PSP, the Phoneme Substitution Profile, an interpretable, per-phonological-dimension accent benchmark for Indic TTS. PSP decomposes accent into six complementary dimensions: retroflex collapse rate (RR), aspiration fidelity (AF), vowel-length fidelity (LF), Tamil-zha fidelity (ZF), Frechet Audio Distance (FAD), and prosodic signature divergence (PSD). The first four are measured via forced alignment plus native-speaker-centroid acoustic probes over Wav2Vec2-XLS-R layer-9 embeddings; the latter two are corpus-level distributional distances. In this v1 we benchmark four commercial and open-source systems (ElevenLabs v3, Cartesia Sonic-3, Sarvam Bulbul, Indic Parler-TTS) on Hindi, Telugu, and Tamil pilot sets, with a fifth system (Praxy Voice) included on all three languages, plus an R5->R6 case study on Telugu. Three findings: (i) retroflex collapse grows monotonically with phonological difficulty Hindi < Telugu < Tamil (~1%, ~40%, ~68%); (ii) PSP ordering diverges from WER ordering -- commercial WER-leaders do not uniformly lead on retroflex or prosodic fidelity; (iii) no single system is Pareto-optimal across all six dimensions. We release native reference centroids (500 clips per language), 1000-clip embeddings for FAD, 500-clip prosodic feature matrices for PSD, 300-utterance golden sets per language, scoring code under MIT, and centroids under CC-BY. Formal MOS-correlation is deferred to v2; v1 reports five internal-consistency signals plus a native-audio sanity check.", "authors": [ "Venkata Pushpak Teja Menta" ], "year": 2026, "published_date": "2026-04-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.25476v1", "pdf_url": "https://arxiv.org/pdf/2604.25476v1", "citations": 0, "topics": [], "tags": [ "AI Safety", "VLMs", "TTS", "Interpretability", "Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.83, "content_potential_score": 2.34, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Standard text-to-speech (TTS) evaluation measures intelligibility (WER, CER) and overall naturalness (MOS, UTMOS) but does not quantify accent. A synthesiser may score well on all four yet sound non-native on features that are phonemic in the target language.", "key_contribution": "We present PSP, the Phoneme Substitution Profile, an interpretable, per-phonological-dimension accent benchmark for Indic TTS.", "why_it_matters": "PSP: An Interpretable Per-Dimension Accent Benchmark for Indic Text-to-Speech represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Safety.", "one_line_takeaway": "We present PSP, the Phoneme Substitution Profile, an interpretable, per-phonological-dimension accent benchmark for…", "biggest_caveat": "but does not quantify accent.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Safety.", "url": "http://arxiv.org/abs/2604.25476v1", "difficulty": "beginner" }, { "id": "arxiv:2604.25796v1", "source": "arxiv", "source_type": "preprint", "title": "StratFormer: Adaptive Opponent Modeling and Exploitation in Imperfect-Information Games", "abstract": "We present StratFormer, a transformer-based meta-agent that learns to simultaneously model and exploit opponents in imperfect-information games through a two-phase curriculum. The first phase trains an opponent modeling head to identify behavioral patterns from action histories while the agent plays a game-theoretic optimal (GTO) policy. The second phase progressively shifts the policy toward best-response (BR) exploitation, guided by a per-opponent regularization schedule tied to exploitability. Our architecture introduces dual-turn tokens -- feature vectors constructed at both agent and opponent decision points -- coupled with bucket-rate features that encode opponent tendencies across five strategic contexts. On Leduc Hold'em, a small poker variant with six cards and two betting rounds, we test against six opponent archetypes at two strength levels each, with exploitability ranging from 0.15 to 1.26 Big Blinds (BB) per hand. StratFormer achieves an average exploitation gain of +0.106 BB per hand over GTO, with peak gains of +0.821 against highly exploitable opponents, while maintaining near-equilibrium safety.", "authors": [ "Andy Caen", "Mark H. M. Winands", "Dennis J. N. J. Soemers" ], "year": 2026, "published_date": "2026-04-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.25796v1", "pdf_url": "https://arxiv.org/pdf/2604.25796v1", "citations": 0, "topics": [], "tags": [ "Transformers", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.81, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present StratFormer, a transformer-based meta-agent that learns to simultaneously model and exploit opponents in imperfect-information games through a two-phase curriculum. The first phase trains an opponent modeling head to identify behavioral patterns from action histories while the agent plays a game-theoretic optimal (GTO) policy.", "key_contribution": "We present StratFormer, a transformer-based meta-agent that learns to simultaneously model and exploit opponents in imperfect-information games through a two-phase curriculum.", "why_it_matters": "StratFormer: Adaptive Opponent Modeling and Exploitation in Imperfect-Information Games represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "We present StratFormer, a transformer-based meta-agent that learns to simultaneously model and exploit opponents in…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Transformers.", "url": "http://arxiv.org/abs/2604.25796v1", "difficulty": "intermediate" }, { "id": "arxiv:2604.20000v1", "source": "arxiv", "source_type": "preprint", "title": "RareSpot+: A Benchmark, Model, and Active Learning Framework for Small and Rare Wildlife in Aerial Imagery", "abstract": "Automated wildlife monitoring from aerial imagery is vital for conservation but remains limited by two persistent challenges: the difficulty of detecting small, rare species and the high cost of large-scale expert annotation. Prairie dogs exemplify this problem -- they are ecologically important yet appear tiny, sparsely distributed, and visually indistinct from their surroundings, posing a severe challenge for conventional detection models. To overcome these limitations, we present RareSpot+, a detection framework that integrates multi-scale consistency learning, context-aware augmentation, and geospatially guided active learning to address these issues. A novel multi-scale consistency loss aligns intermediate feature maps across detection heads, enhancing localization of small (approx. 30 pixels wide) objects without architectural changes, while context-aware augmentation improves robustness by synthesizing hard, ecologically plausible examples. A geospatial active learning module exploits domain-specific spatial priors linking prairie dogs and burrows, together with test-time augmentation and a meta-uncertainty model, to reduce redundant labeling. On a 2 km^2 aerial dataset, RareSpot+ improves detection over the baseline mAP@50 by +35.2% (absolute +0.13). Cross-dataset tests on HerdNet, AED, and several other wildlife benchmarks demonstrate robust detector-level transferability. The active learning module further boosts prairie dog AP by 14.5% using an annotation budget of just 1.7% of the unlabeled tiles. Beyond detection, RareSpot+ enables spatial ecological analyses such as clustering and co-occurrence, linking vision-based detection with quantitative ecology.", "authors": [ "Bowen Zhang", "Jesse T. Boulerice", "Charvi Mendiratta", "Nikhil Kuniyil", "Satish Kumar", "Hila Shamon", "B. S. Manjunath" ], "year": 2026, "published_date": "2026-04-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.20000v1", "pdf_url": "https://arxiv.org/pdf/2604.20000v1", "citations": 0, "topics": [], "tags": [ "Evaluation", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.72, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Automated wildlife monitoring from aerial imagery is vital for conservation but remains limited by two persistent challenges: the difficulty of detecting small, rare species and the high cost of large-scale expert annotation. Prairie dogs exemplify this problem -- they are ecologically important yet appear tiny, sparsely distributed, and visually indistinct from their surroundings, posing a severe challenge for conventional detection models.", "key_contribution": "To overcome these limitations, we present RareSpot+, a detection framework that integrates multi-scale consistency learning, context-aware augmentation, and geospatially guided active learning to address these issues.", "why_it_matters": "RareSpot+: A Benchmark, Model, and Active Learning Framework for Small and Rare Wildlife in Aerial Imagery advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "To overcome these limitations, we present RareSpot+, a detection framework that integrates multi-scale consistency…", "biggest_caveat": "but remains limited by two persistent challenges: the difficulty of detecting small, rare species and the high cost of large-scale expert annotation.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "http://arxiv.org/abs/2604.20000v1", "difficulty": "beginner" }, { "id": "arxiv:2604.18131v1", "source": "arxiv", "source_type": "preprint", "title": "Training LLM Agents for Spontaneous, Reward-Free Self-Evolution via World Knowledge Exploration", "abstract": "Most agents today ``self-evolve'' by following rewards and rules defined by humans. However, this process remains fundamentally dependent on external supervision; without human guidance, the evolution stops. In this work, we train agents to possess an intrinsic meta-evolution capability to spontaneously learn about unseen environments prior to task execution. To instill this ability, we design an outcome-based reward mechanism that measures how much an agent's self-generated world knowledge improves its success rate on downstream tasks. This reward signal is used exclusively during the training phase to teach the model how to explore and summarize effectively. At inference time, the agent requires no external rewards or human instructions. It spontaneously performs native self-evolution to adapt to unknown environments using its internal parameters. When applied to Qwen3-30B and Seed-OSS-36B, this shift to native evolution yields a 20% performance increase on WebVoyager and WebWalker. Most strikingly, the generated world knowledge even enables a compact 14B Qwen3 model to outperform the unassisted Gemini-2.5-Flash, establishing a new paradigm for truly evolving agents.", "authors": [ "Qifan Zhang", "Dongyang Ma", "Tianqing Fang", "Jia Li", "Jing Tang", "Nuo Chen", "Haitao Mi", "Yan Wang" ], "year": 2026, "published_date": "2026-04-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.18131v1", "pdf_url": "https://arxiv.org/pdf/2604.18131v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.36, "content_potential_score": 1.26, "interestingness_score": 2.13, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Most agents today ``self-evolve'' by following rewards and rules defined by humans. However, this process remains fundamentally dependent on external supervision; without human guidance, the evolution stops.", "key_contribution": "Most strikingly, the generated world knowledge even enables a compact 14B Qwen3 model to outperform the unassisted Gemini-2.5-Flash, establishing a new paradigm for truly evolving agents.", "why_it_matters": "Training LLM Agents for Spontaneous, Reward-Free Self-Evolution via World Knowledge Exploration represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Most strikingly, the generated world knowledge even enables a compact 14B Qwen3 model to outperform the unassisted…", "biggest_caveat": "However, this process remains fundamentally dependent on external supervision; without human guidance, the evolution stops.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.18131v1", "difficulty": "intermediate" }, { "id": "arxiv:2604.17258v1", "source": "arxiv", "source_type": "preprint", "title": "A Rapid Deployment Pipeline for Autonomous Humanoid Grasping Based on Foundation Models", "abstract": "Deploying a humanoid robot to manipulate a new object has traditionally required one to two days of effort: data collection, manual annotation, 3D model acquisition, and model training. This paper presents an end-to-end rapid deployment pipeline that integrates three foundation-model components to shorten the onboarding cycle for a new object to approximately 30 minutes: (i) Roboflow-based automatic annotation to assist in training a YOLOv8 object detector; (ii) 3D reconstruction based on Meta SAM 3D, which eliminates the need for a dedicated laser scanner; and (iii) zero-shot 6-DoF pose tracking based on FoundationPose, using the SAM~3D-generated mesh directly as the template. The estimated pose drives a Unity-based inverse kinematics planner, whose joint commands are streamed via UDP to a Unitree~G1 humanoid and executed through the Unitree SDK. We demonstrate detection accuracy of mAP@0.5 = 0.995, pose tracking precision of $σ< 1.05$ mm, and successful grasping on a real robot at five positions within the workspace. We further verify the generality of the pipeline on an automobile-window glue-application task. The results show that combining foundation models for perception with everyday imaging devices (e.g., smartphones) can substantially lower the deployment barrier for humanoid manipulation tasks.", "authors": [ "Yifei Yan", "Yankai Liao", "Linqi Ye" ], "year": 2026, "published_date": "2026-04-19", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.17258v1", "pdf_url": "https://arxiv.org/pdf/2604.17258v1", "citations": 0, "topics": [], "tags": [ "3D Vision", "Info Extraction", "Robotics" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.66, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deploying a humanoid robot to manipulate a new object has traditionally required one to two days of effort: data collection, manual annotation, 3D model acquisition, and model training. This paper presents an end-to-end rapid deployment pipeline that integrates three foundation-model components to shorten the onboarding cycle for a new object to approximately 30 minutes: (i) Roboflow-based automatic annotation to assist in training a YOLOv8 object detector; (ii) 3D reconstruction based on Meta SAM 3D, which eliminates the need for a dedicated laser scanner; and (iii) zero-shot 6-DoF pose tracking based on FoundationPose, using the SAM~3D-generated mesh directly as the template.", "key_contribution": "We demonstrate detection accuracy of mAP@0.5 = 0.995, pose tracking precision of $σ< 1.05$ mm, and successful grasping on a real robot at five positions within the workspace.", "why_it_matters": "A Rapid Deployment Pipeline for Autonomous Humanoid Grasping Based on Foundation Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about 3D Vision.", "one_line_takeaway": "We demonstrate detection accuracy of mAP@0.5 = 0.995, pose tracking precision of $σ< 1.05$ mm, and successful grasping…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in 3D Vision.", "url": "http://arxiv.org/abs/2604.17258v1", "difficulty": "intermediate" }, { "id": "arxiv:2604.05587v1", "source": "arxiv", "source_type": "preprint", "title": "ResearchEVO: An End-to-End Framework for Automated Scientific Discovery and Documentation", "abstract": "An important recurring pattern in scientific breakthroughs is a two-stage process: an initial phase of undirected experimentation that yields an unexpected finding, followed by a retrospective phase that explains why the finding works and situates it within existing theory. We present ResearchEVO, an end-to-end framework that computationally instantiates this discover-then-explain paradigm. The Evolution Phase employs LLM-guided bi-dimensional co-evolution -- simultaneously optimizing both algorithmic logic and overall architecture -- to search the space of code implementations purely by fitness, without requiring any understanding of the solutions it produces. The Writing Phase then takes the best-performing algorithm and autonomously generates a complete, publication-ready research paper through sentence-level retrieval-augmented generation with explicit anti-hallucination verification and automated experiment design. To our knowledge, ResearchEVO is the first system to cover this full pipeline end to end: no prior work jointly performs principled algorithm evolution and literature-grounded scientific documentation. We validate the framework on two cross-disciplinary scientific problems -- Quantum Error Correction using real Google quantum hardware data, and Physics-Informed Neural Networks -- where the Evolution Phase discovered human-interpretable algorithmic mechanisms that had not been previously proposed in the respective domain literatures. In both cases, the Writing Phase autonomously produced compilable LaTeX manuscripts that correctly grounded these blind discoveries in existing theory via RAG, with zero fabricated citations.", "authors": [ "Zhe Zhao", "Haibin Wen", "Jiaming Ma", "Jiachang Zhan", "Tianyi Xu", "Ye Wei", "Qingfu Zhang" ], "year": 2026, "published_date": "2026-04-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.05587v1", "pdf_url": "https://arxiv.org/pdf/2604.05587v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Hallucination", "RAG", "Interpretability", "Retrieval-Augmented Generation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.56, "content_potential_score": 0.87, "interestingness_score": 1.94, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "An important recurring pattern in scientific breakthroughs is a two-stage process: an initial phase of undirected experimentation that yields an unexpected finding, followed by a retrospective phase that explains why the finding works and situates it within existing theory. We present ResearchEVO, an end-to-end framework that computationally instantiates this discover-then-explain paradigm.", "key_contribution": "We present ResearchEVO, an end-to-end framework that computationally instantiates this discover-then-explain paradigm.", "why_it_matters": "ResearchEVO: An End-to-End Framework for Automated Scientific Discovery and Documentation improves how language models ground their responses in verified, up-to-date knowledge.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present ResearchEVO, an end-to-end framework that computationally instantiates this discover-then-explain paradigm.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.05587v1", "difficulty": "beginner" }, { "id": "arxiv:2604.12064v1", "source": "arxiv", "source_type": "preprint", "title": "LLM-Redactor: An Empirical Evaluation of Eight Techniques for Privacy-Preserving LLM Requests", "abstract": "Coding agents and LLM-powered applications routinely send potentially sensitive content to cloud LLM APIs where it may be logged, retained, used for training, or subpoenaed. Existing privacy tooling focuses on network-level encryption and organization-level DLP, neither of which addresses the content of prompts themselves. We present a systematic empirical evaluation of eight techniques for privacy-preserving LLM requests: (A) local-only inference, (B) redaction with placeholder restoration, (C) semantic rephrasing, (D) Trusted Execution Environment hosted inference, (E) split inference, (F) fully homomorphic encryption, (G) secret sharing via multi-party computation, and (H) differential-privacy noise. We implement all eight (or a tractable research-stage subset where deployment is not yet feasible) in an open-source shim compatible with MCP and any OpenAI-compatible API. We evaluate the four practical options (A, B, C, H) and their combinations across four workload classes using a ground-truth-labelled leak benchmark of 1,300 samples with 4,014 annotations. Our headline finding is that no single technique dominates: the combination A+B+C (route locally when possible, redact and rephrase the rest) achieves 0.6% combined leak on PII and 31.3% on proprietary code, with zero exact leaks on PII across 500 samples. We present a decision rule that selects the appropriate option(s) from a threat-model budget and workload characterisation. Code, benchmarks, and evaluation harness are released at https://github.com/jayluxferro/llm-redactor.", "authors": [ "Justice Owusu Agyemang", "Jerry John Kponyo", "Elliot Amponsah", "Godfred Manu Addo Boakye", "Kwame Opuni-Boachie Obour Agyekum" ], "year": 2026, "published_date": "2026-04-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.12064v1", "pdf_url": "https://arxiv.org/pdf/2604.12064v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Federated Learning", "Evaluation", "Software Engineering", "Benchmarking & Evaluation" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.36, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Coding agents and LLM-powered applications routinely send potentially sensitive content to cloud LLM APIs where it may be logged, retained, used for training, or subpoenaed. Existing privacy tooling focuses on network-level encryption and organization-level DLP, neither of which addresses the content of prompts themselves.", "key_contribution": "We present a systematic empirical evaluation of eight techniques for privacy-preserving LLM requests: (A) local-only inference, (B) redaction with placeholder restoration, (C) semantic rephrasing, (D) Trusted Execution Environment hosted inference, (E) split inference, (F) fully homomorphic encryption, (G) secret sharing via multi-party computation, and (H) differential-privacy noise.", "why_it_matters": "LLM-Redactor: An Empirical Evaluation of Eight Techniques for Privacy-Preserving LLM Requests represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a systematic empirical evaluation of eight techniques for privacy-preserving LLM requests: (A) local-only…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.12064v1", "difficulty": "beginner" }, { "id": "arxiv:2605.23911", "source": "arxiv", "source_type": "preprint", "title": "Cross-Platform Fused MoE Dispatch in Triton: Portable Expert Routing Without CUDA", "abstract": "Mixture-of-Experts (MoE) architectures power the majority of frontier large language models, but their inference is bottlenecked by irregular memory access patterns and expert routing overhead. Existing optimized MoE kernels (Megablocks, Tutel, FasterMoE) are implemented in CUDA and locked to NVIDIA hardware. We present TritonMoE, a fused MoE dispatch kernel written entirely in OpenAI Triton that performs the complete forward pass -- router scoring, token permutation, expert GEMMs, and weighted output combination -- using only portable Triton primitives. Our key optimization is a fused gate+up GEMM kernel that computes both SwiGLU projections from shared L2-cached input tiles with in-register SiLU activation, eliminating 35% of global memory traffic. On an NVIDIA A100, TritonMoE achieves 89-131% of the throughput of the CUDA-optimized Megablocks at inference batch sizes (<= 512 tokens) across Mixtral-8x7B, DeepSeek-V3, and Qwen2-MoE configurations. All 162 correctness tests pass on both NVIDIA A100 and AMD MI300X with zero code changes, validating cross-platform portability. We additionally characterize sensitivity to routing imbalance under Zipfian-skewed expert assignments and identify the regime -- 64+ experts under extreme skew -- where our fixed-tile scheduling underperforms Megablocks' block-sparse layout, motivating dynamic block-to-expert assignment as future work. Code is available at https://github.com/bassrehab/triton-kernels.", "authors": [ "Subhadip Mitra" ], "year": 2026, "published_date": "2026-04-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.23911", "pdf_url": "https://arxiv.org/pdf/2605.23911", "citations": 0, "topics": [], "tags": [ "LLMs", "MoE", "Distributed Computing" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (MoE) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.89, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Mixture-of-Experts (MoE) architectures power the majority of frontier large language models, but their inference is bottlenecked by irregular memory access patterns and expert routing overhead. Existing optimized MoE kernels (Megablocks, Tutel, FasterMoE) are implemented in CUDA and locked to NVIDIA hardware.", "key_contribution": "We present TritonMoE, a fused MoE dispatch kernel written entirely in OpenAI Triton that performs the complete forward pass -- router scoring, token permutation, expert GEMMs, and weighted output combination -- using only portable Triton primitives.", "why_it_matters": "Cross-Platform Fused MoE Dispatch in Triton: Portable Expert Routing Without CUDA represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present TritonMoE, a fused MoE dispatch kernel written entirely in OpenAI Triton that performs the complete forward…", "biggest_caveat": "but their inference is bottlenecked by irregular memory access patterns and expert routing overhead.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.23911", "difficulty": "advanced" }, { "id": "arxiv:2605.24699", "source": "arxiv", "source_type": "preprint", "title": "MDIA: A Multi-Agent Diagnostic Intelligence Pipeline on HealthBench Professional", "abstract": "Most reported gains on agentic-LLM clinical benchmarks are often attributed to prompt engineering, yet our results suggest that larger improvements can come from architectural and engine-level design. We present MDIA, a Multi-agent Diagnostic Intelligence Agent implemented as a 7-node specialty-routed clinical reasoning graph, on the full HealthBench Professional benchmark (n = 525), on a non-fine-tuned LLM. MDIA achieves 0.6272 under OpenAI's GPT-5.4-2026-03-05, which is +3.72 pp above the performance of OpenAI's ChatGPT for Clinicians. The experimental work shows that performance lift is attributable to system architecture: specialty routing, multi-turn context preservation, drug-state safety gating, site-filtered search, length-aware synthesis, and engine-level reliability. These findings support the view that agentic clinical benchmark performance is shaped both by the underlying foundation model and the orchestration architecture. Nevertheless, we also noticed notable differences when using other models as a grader; in particular, when using Gemini 2.5 Pro, MDIA scored 0.6585, which suggests that the choice of grader is a source of variability. Robust evaluation of LLMs would therefore require assessment across several independent grader models.", "authors": [ "Roberto Cruz", "David Rey-Blanco" ], "year": 2026, "published_date": "2026-05-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.24699", "pdf_url": "https://arxiv.org/pdf/2605.24699", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Prompting", "Fine-Tuning", "AI Agents" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.98, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Most reported gains on agentic-LLM clinical benchmarks are often attributed to prompt engineering, yet our results suggest that larger improvements can come from architectural and engine-level design. We present MDIA, a Multi-agent Diagnostic Intelligence Agent implemented as a 7-node specialty-routed clinical reasoning graph, on the full HealthBench Professional benchmark (n = 525), on a non-fine-tuned LLM.", "key_contribution": "We present MDIA, a Multi-agent Diagnostic Intelligence Agent implemented as a 7-node specialty-routed clinical reasoning graph, on the full HealthBench Professional benchmark (n = 525), on a non-fine-tuned LLM.", "why_it_matters": "MDIA: A Multi-Agent Diagnostic Intelligence Pipeline on HealthBench Professional represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present MDIA, a Multi-agent Diagnostic Intelligence Agent implemented as a 7-node specialty-routed clinical…", "biggest_caveat": "buted to prompt engineering, yet our results suggest that larger improvements can come from architectural and engine-level design.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.24699", "difficulty": "beginner" }, { "id": "arxiv:2512.10165", "source": "arxiv", "source_type": "preprint", "title": "BookReconciler: An Open-Source Tool for Metadata Enrichment and Work-Level Clustering", "abstract": "We present BookReconciler, an open-source tool for enhancing and clustering book data. BookReconciler allows users to take spreadsheets with minimal metadata, such as book title and author, and automatically 1) add authoritative, persistent identifiers like ISBNs 2) and cluster related Expressions and Manifestations of the same Work, e.g., different translations or editions. This enhancement makes it easier to combine related collections and analyze books at scale. The tool is currently designed as an extension for OpenRefine -- a popular software application -- and connects to major bibliographic services including the Library of Congress, VIAF, OCLC, HathiTrust, Google Books, and Wikidata. Our approach prioritizes human judgment. Through an interactive interface, users can manually evaluate matches and define the contours of a Work (e.g., to include translations or not). We evaluate reconciliation performance on datasets of U.S. prize-winning books and contemporary world fiction. BookReconciler achieves near-perfect accuracy for U.S. works but lower performance for global texts, reflecting structural weaknesses in bibliographic infrastructures for non-English and global literature. Overall, BookReconciler supports the reuse of bibliographic data across domains and applications, contributing to ongoing work in digital libraries and digital humanities.", "authors": [ "Matt Miller", "Dan Sinykin", "Melanie Walsh" ], "year": 2026, "published_date": "2026-05-25", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2512.10165", "pdf_url": "https://arxiv.org/pdf/2512.10165", "citations": 0, "topics": [], "tags": [ "Knowledge Graphs", "Information Retrieval" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.14, "content_potential_score": 0.55, "interestingness_score": 1.77, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present BookReconciler, an open-source tool for enhancing and clustering book data. BookReconciler allows users to take spreadsheets with minimal metadata, such as book title and author, and automatically 1) add authoritative, persistent identifiers like ISBNs 2) and cluster related Expressions and Manifestations of the same Work, e.g., different translations or editions.", "key_contribution": "We present BookReconciler, an open-source tool for enhancing and clustering book data.", "why_it_matters": "BookReconciler: An Open-Source Tool for Metadata Enrichment and Work-Level Clustering improves how systems find and rank relevant information at scale.", "content_hook": "A new paper that could change how we think about Knowledge Graphs.", "one_line_takeaway": "We present BookReconciler, an open-source tool for enhancing and clustering book data.", "biggest_caveat": "but lower performance for global texts, reflecting structural weaknesses in bibliographic infrastructures for non-English and global literature.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Knowledge Graphs.", "url": "https://arxiv.org/abs/2512.10165", "difficulty": "intermediate" }, { "id": "arxiv:2602.02709", "source": "arxiv", "source_type": "preprint", "title": "ATLAS: A Multi-LLM Training Framework for EvoDPO with Adaptive Reference Evolution", "abstract": "Recent multi-LLM agent systems have shown promising capabilities for automated problem-solving, yet they predominantly rely on frozen agents or static fine-tuning pipelines. To address this limitation, our primary contribution is ATLAS (Adaptive Task-distributed Learning for Agentic Self-evolution), a multi-agent framework where specialized meta-agents collaboratively train and refine an active agent toward a domain-specific policy. A core challenge in iterative preference learning within these pipelines is the reliance on fixed reference models, which typically leads to overly conservative updates or training stagnation. To overcome this, the framework's algorithmic engine utilizes Evolving Direct Preference Optimization (EvoDPO). EvoDPO employs an inspection agent to perform adaptive, proxy-KL gated reference policy updates based on continuous training telemetry. We evaluate this full framework across a diverse set of challenging environments-including non-stationary contextual bandits, partial differential equations (PINNs), and combinatorial optimization tasks (TSP, Bin Packing). Through comparison against fixed-reference, adaptive-reference, and external automated-discovery baselines, our results suggest that ATLAS combines supporter-driven exploration with EvoDPO-driven stability to improve long-horizon evaluator-driven self-improvement.", "authors": [ "Ujin Jeon", "Jiyong Kwon", "Madison Ann Sullivan", "Caleb Eunho Lee", "Guang Lin" ], "year": 2026, "published_date": "2026-05-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.02709", "pdf_url": "https://arxiv.org/pdf/2602.02709", "citations": 0, "topics": [], "tags": [ "LLMs", "RLHF", "Fine-Tuning", "AI Agents", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.07, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent multi-LLM agent systems have shown promising capabilities for automated problem-solving, yet they predominantly rely on frozen agents or static fine-tuning pipelines. To address this limitation, our primary contribution is ATLAS (Adaptive Task-distributed Learning for Agentic Self-evolution), a multi-agent framework where specialized meta-agents collaboratively train and refine an active agent toward a domain-specific policy.", "key_contribution": "Recent multi-LLM agent systems have shown promising capabilities for automated problem-solving, yet they predominantly rely on frozen agents or static fine-tuning pipelines.", "why_it_matters": "ATLAS: A Multi-LLM Training Framework for EvoDPO with Adaptive Reference Evolution represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Recent multi-LLM agent systems have shown promising capabilities for automated problem-solving, yet they predominantly…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2602.02709", "difficulty": "advanced" }, { "id": "arxiv:2605.09618", "source": "arxiv", "source_type": "preprint", "title": "Statistical Scouting Finds Debate-Safe but Not Debate-Useful Cases: A Matched-Ceiling Study of Open-Weight LLM Reasoning Protocols", "abstract": "When should a language model answer directly, sample and vote, or engage in multi-agent debate? Recent work shows voting often explains much of the gain attributed to debate, while selective-debate systems activate deliberation only on uncertain examples. We ask: under a matched ceiling on generated tokens (960 per example), how much per-example routing headroom exists, and how much is recoverable from cheap pre-deliberation signals? We evaluate greedy decoding, three-sample voting, and a two-agent critique-revise debate on MuSiQue and GSM8K using Llama 3.1 8B Instruct and Ministral 3 8B Instruct. On MuSiQue, an oracle selecting the correct protocol per example gains +14.0 and +13.7 pp over the best fixed one. The best fixed protocol is model- and dataset-dependent: each (model, dataset) cell has a different winner. This headroom is hard to recover from cheap ex-ante signals. A vote-entropy threshold is the only controller that directionally beats the best fixed protocol on both models (+1.3 and +1.7 pp), though individual paired-bootstrap CIs include zero. A joint analysis (meta-analysis +1.6 pp, p=0.125; Bayesian P(both>0)=0.59) is directionally consistent but not significant. Learned controllers (LR, GBT) do not outperform the threshold. The key finding is structural: vote entropy predicts where debate is safe, not where debate is needed. High entropy sharply reduces debate backfire, but 66% of debate-helpful examples (31/47) occur when voting is unanimous but wrong. A single-prompt self-critique probe on Llama flips the answer in 127/127 unanimous cases, yielding zero mutual information with the debate-helpful label; we cannot rule out a prompt-compliance artifact, but either interpretation disqualifies the probe as a router. Recovering the remaining headroom requires behavioral probes that avoid format-compliance confounds at the 8B scale.", "authors": [ "Julia Hu", "Alfred Shen", "Kumar Lakshmipathi" ], "year": 2026, "published_date": "2026-05-10", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.09618", "pdf_url": "https://arxiv.org/pdf/2605.09618", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Info Extraction", "NLP" ], "paper_type": "dataset", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses bayesian and related concepts.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.45, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "When should a language model answer directly, sample and vote, or engage in multi-agent debate? Recent work shows voting often explains much of the gain attributed to debate, while selective-debate systems activate deliberation only on uncertain examples.", "key_contribution": "Learned controllers (LR, GBT) do not outperform the threshold.", "why_it_matters": "Statistical Scouting Finds Debate-Safe but Not Debate-Useful Cases: A Matched-Ceiling Study of Open-Weight LLM Reasoning Protocols represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Learned controllers (LR, GBT) do not outperform the threshold.", "biggest_caveat": "buted to debate, while selective-debate systems activate deliberation only on uncertain examples.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.09618", "difficulty": "frontier" }, { "id": "arxiv:2602.08786", "source": "arxiv", "source_type": "preprint", "title": "On the Meta-Design of Allocation Problems", "abstract": "There is an extensive literature that studies how to find optimal policies in resource allocation problems, taking the underlying design parameters that define the allocation, such as what data is collected, how many people can be served, and quality of service as fixed constraints. Yet, from a planner's perspective, these design parameters are themselves optimization variables that are just as important in determining overall welfare as selecting the optimal targeting rule for a given set of constraints. This realization motivates a rich set of meta-design questions exploring how planners should make principled decisions about investments in prediction, capacity constraints, and treatment quality, all of which lie upstream of classical policy optimization. Building on initial theoretical work in this space, our paper has three main contributions. First, we formally define the broad meta-design space of resource allocation problems. Second, we develop empirical tools that enable practitioners to reliably navigate it. Third, we demonstrate the framework in two real-world case studies on German employment services and targeted cash transfer programs in Ethiopia.", "authors": [ "Unai Fischer-Abaigar", "Emily Aiken", "Christoph Kern", "Juan Carlos Perdomo" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.08786", "pdf_url": "https://arxiv.org/pdf/2602.08786", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.38, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "There is an extensive literature that studies how to find optimal policies in resource allocation problems, taking the underlying design parameters that define the allocation, such as what data is collected, how many people can be served, and quality of service as fixed constraints. Yet, from a planner's perspective, these design parameters are themselves optimization variables that are just as important in determining overall welfare as selecting the optimal targeting rule for a given set of constraints.", "key_contribution": "Third, we demonstrate the framework in two real-world case studies on German employment services and targeted cash transfer programs in Ethiopia.", "why_it_matters": "On the Meta-Design of Allocation Problems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "Third, we demonstrate the framework in two real-world case studies on German employment services and targeted cash…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2602.08786", "difficulty": "intermediate" }, { "id": "arxiv:2604.27891", "source": "arxiv", "source_type": "preprint", "title": "In-Context Prompting Obsoletes Agent Orchestration for Procedural Tasks", "abstract": "Agent orchestration frameworks -- LangGraph, CrewAI, Google ADK, OpenAI Agents SDK, and others -- place an external orchestrator above the LLM, tracking state and injecting routing instructions at every turn. We present a controlled comparison showing that for procedural tasks, this architecture is dominated by a simpler alternative: putting the entire procedure in the system prompt and letting the model self-orchestrate. Across three domains -- travel booking (14 nodes), Zoom technical support (14 nodes), and insurance claims processing (55 nodes) -- we evaluate 200 conversations per condition using LLM-as-judge scoring on five quality criteria. The in-context approach scores 4.53--5.00 on a 5-point scale while a LangGraph orchestrator using the same model scores 4.17--4.84. The orchestrated system fails on 24% of travel, 9% of Zoom, and 17% of insurance conversations, compared to 11.5%, 0.5%, and 5% for the in-context baseline. While external orchestration may have been necessary for earlier models, advances in frontier model capabilities have made it unnecessary for multi-turn conversations following a defined procedure.", "authors": [ "Simon Dennis", "Michael Diamond", "Rivaan Patil", "Kevin Shabahang", "Hao Guo" ], "year": 2026, "published_date": "2026-04-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.27891", "pdf_url": "https://arxiv.org/pdf/2604.27891", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Dialogue", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.35, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Agent orchestration frameworks -- LangGraph, CrewAI, Google ADK, OpenAI Agents SDK, and others -- place an external orchestrator above the LLM, tracking state and injecting routing instructions at every turn. We present a controlled comparison showing that for procedural tasks, this architecture is dominated by a simpler alternative: putting the entire procedure in the system prompt and letting the model self-orchestrate.", "key_contribution": "We present a controlled comparison showing that for procedural tasks, this architecture is dominated by a simpler alternative: putting the entire procedure in the system prompt and letting the model self-orchestrate.", "why_it_matters": "In-Context Prompting Obsoletes Agent Orchestration for Procedural Tasks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a controlled comparison showing that for procedural tasks, this architecture is dominated by a simpler…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2604.27891", "difficulty": "intermediate" }, { "id": "arxiv:2605.04076", "source": "arxiv", "source_type": "preprint", "title": "A Regulatory Governance Framework for AI-Driven Financial Fraud Detection in U.S. Banking: Integrating OCC, SR 11-7, CFPB, and FinCEN Compliance Requirements for Model Development, Validation, and Monitoring Lifecycles", "abstract": "U.S. financial institutions deploying AI-based fraud detection face a fragmented compliance landscape spanning four regulatory frameworks -- OCC Bulletin 2011-12, SR 11-7, the CFPB AI circular, and FinCEN BSA/SAR requirements -- with no integrated governance life cycle connecting these requirements to model development, validation, and monitoring practice. This paper presents the Regulatory Governance Framework for AI-Driven Financial Fraud Detection (RGF-AFFD), a three-tier governance architecture empirically anchored in a multi-study empirical program. Using the IEEE-CIS dataset (590,540 transactions) and ULB benchmark (284,807 transactions), we benchmark six architectures including an LSTM+XGBoost ensemble, and conduct ablation, temporal drift, SHAP interpretability, and BISG fairness analyses. The LSTM+XGBoost ensemble achieves ROC-AUC of 0.9289 (F1: 0.6360) with a benefit-cost ratio of 6:1. XGBoost demonstrates the strongest temporal stability (delta-AUC = -0.0017 versus -0.0626 for LSTM). The RDT-FG Regulatory Digital Twin meta-model translates metrics into four regulator-specific health scores and a composite Regulatory Fitness Index for continuous compliance monitoring. The RGF-AFFD is the first integrated deployment blueprint to simultaneously satisfy OCC, SR 11-7, CFPB, and FinCEN requirements, supported by a community bank implementation vignette and four evidence-based policy recommendations.", "authors": [ "Mohammad Nasir Uddin" ], "year": 2026, "published_date": "2026-04-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.04076", "pdf_url": "https://arxiv.org/pdf/2605.04076", "citations": 0, "topics": [], "tags": [ "Fairness & Ethics", "Interpretability", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.54, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "U.S. financial institutions deploying AI-based fraud detection face a fragmented compliance landscape spanning four regulatory frameworks -- OCC Bulletin 2011-12, SR 11-7, the CFPB AI circular, and FinCEN BSA/SAR requirements -- with no integrated governance life cycle connecting these requirements to model development, validation, and monitoring practice.", "key_contribution": "U.S.", "why_it_matters": "A Regulatory Governance Framework for AI-Driven Financial Fraud Detection in U.S. Banking: Integrating OCC, SR 11-7, CFPB, and FinCEN Compliance Requirements for Model Development, Validation, and Monitoring Lifecycles represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fairness & Ethics.", "one_line_takeaway": "U.S.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Fairness & Ethics.", "url": "https://arxiv.org/abs/2605.04076", "difficulty": "beginner" }, { "id": "arxiv:2605.04333", "source": "arxiv", "source_type": "preprint", "title": "Resilient AI Supercomputer Networking using MRC and SRv6", "abstract": "Tail latency dominates the performance of synchronous pretraining jobs when running at very large scales. We describe a three-pronged approach: (1) a new RDMA-based transport protocol, MRC, sprays across many paths and actively load-balances between them, eliminating the issue of flow collisions (2) the use of multi-plane Clos topologies to get the benefits of high switch radix and redundancy, allowing training clusters well over 100K GPUs to be built as two-tier topologies while increasing physical redundancy, and (3) the use of static source-routing using SRv6 to allow MRC the freedom to bypass failures by itself. We describe our experiences running MRC and static SRv6 routing in production in OpenAI and Microsoft's largest training clusters, where it has been used to train the latest frontier models. We demonstrate how MRC allows AI training jobs to ride out many network failures that previously would have interrupted training.", "authors": [ "Joao Araujo", "Alex Chow", "Mark Handley", "Ryder Lewis", "Christoph Paasch", "Jitendra Padhye", "Michael Papamichael", "Greg Steinbrecher", "Amin Tootoonchian", "Lihua Yuan", "S. Anantharamu", "Abhishek Dosi", "Mohit Garg", "Mahdieh Ghazi", "Torsten Hoefler", "Deepal Jayasinghe", "Jithin Jose", "Abdul Kabbani", "Guohan Lu", "Yang Wang", "K. Doddapaneni", "Murali Garimella", "Vipin Jain", "Yanfang Le", "H. Nagulapalli", "S. Narayanan", "Rong Pan", "Rathina Sabesan", "Raghava Sivaramu", "Rip Sohan", "Eric Davis", "Dragos Dumitrescu", "Mohan Kalkunte", "Bhaswar Mitra", "Guglielmo Morandin", "Adrian Popa", "Costin Raiciu", "Eric Spada", "John Spillane", "Niranjan Vaidya", "Aviv Barnea", "Idan Burstein", "Elazar Cohen", "Yamin Friedman", "Noam Katz", "Masoud Moshref", "Yuval Shpigelman", "Shahaf Shuler", "Shy Shyman", "Sayantan Sur" ], "year": 2026, "published_date": "2026-05-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.04333", "pdf_url": "https://arxiv.org/pdf/2605.04333", "citations": 0, "topics": [], "tags": [ "Self-Supervised", "Artificial Intelligence", "Distributed Computing" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Uses pretraining — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.61, "content_potential_score": 0.84, "interestingness_score": 1.92, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Tail latency dominates the performance of synchronous pretraining jobs when running at very large scales. We describe a three-pronged approach: (1) a new RDMA-based transport protocol, MRC, sprays across many paths and actively load-balances between them, eliminating the issue of flow collisions (2) the use of multi-plane Clos topologies to get the benefits of high switch radix and redundancy, allowing training clusters well over 100K GPUs to be built as two-tier topologies while increasing physical redundancy, and (3) the use of static source-routing using SRv6 to allow MRC the freedom to bypass failures by itself.", "key_contribution": "We demonstrate how MRC allows AI training jobs to ride out many network failures that previously would have interrupted training.", "why_it_matters": "Resilient AI Supercomputer Networking using MRC and SRv6 represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Self-Supervised.", "one_line_takeaway": "We demonstrate how MRC allows AI training jobs to ride out many network failures that previously would have interrupted…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Self-Supervised.", "url": "https://arxiv.org/abs/2605.04333", "difficulty": "advanced" }, { "id": "arxiv:2605.01948", "source": "arxiv", "source_type": "preprint", "title": "Phone2Act: A Low-Cost, Hardware-Agnostic Teleoperation System for Scalable VLA Data Collection", "abstract": "Collecting diverse, high-quality manipulation data for Vision-Language-Action (VLA) model training remains prohibitively expensive for many research groups, as existing teleoperation frameworks rely on specialized hardware or are tightly coupled to specific robot platforms. We present Phone2Act, a low-cost, hardware-agnostic teleoperation framework that transforms a commodity smartphone into a 6-DoF robot controller via Google ARCore. Built on a modular ROS 2 architecture, Phone2Act decouples control logic from hardware specifics through interchangeable bridge nodes, supporting platforms from industrial cobots to low-cost bimanual arms without code modification. A Universal Recorder synchronizes multi-camera RGB streams with robot state feedback and exports demonstrations natively in the LeRobot dataset format, eliminating post-processing and enabling immediate VLA fine-tuning. We validate the framework by fine-tuning GR00T-N1.5 on 130 collected episodes, achieving a 90% success rate on a real-world multi-stage pick-and-place task deployed on a physical Dobot CR5.", "authors": [ "Om Mandhane", "Bipin Yadav", "Sangeetha Prasanna Ram", "Gopalakrishnan Narayanan" ], "year": 2026, "published_date": "2026-05-03", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.01948", "pdf_url": "https://arxiv.org/pdf/2605.01948", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Robotics", "Artificial Intelligence", "Human-Computer Interaction" ], "paper_type": "dataset", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.63, "content_potential_score": 2.34, "interestingness_score": 2.67, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Collecting diverse, high-quality manipulation data for Vision-Language-Action (VLA) model training remains prohibitively expensive for many research groups, as existing teleoperation frameworks rely on specialized hardware or are tightly coupled to specific robot platforms. We present Phone2Act, a low-cost, hardware-agnostic teleoperation framework that transforms a commodity smartphone into a 6-DoF robot controller via Google ARCore.", "key_contribution": "We present Phone2Act, a low-cost, hardware-agnostic teleoperation framework that transforms a commodity smartphone into a 6-DoF robot controller via Google ARCore.", "why_it_matters": "Phone2Act: A Low-Cost, Hardware-Agnostic Teleoperation System for Scalable VLA Data Collection represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We present Phone2Act, a low-cost, hardware-agnostic teleoperation framework that transforms a commodity smartphone into…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2605.01948", "difficulty": "intermediate" }, { "id": "arxiv:2604.08245v1", "source": "arxiv", "source_type": "preprint", "title": "From Phenomenological Fitting to Endogenous Deduction: A Paradigm Leap via Meta-Principle Physics Architecture", "abstract": "The essence of current neural network architectures is phenomenological fitting: they learn input-output statistical correlations via massive parameters and data, yet lack intrinsic understanding of the fundamental principles governing physical reality. This paper proposes a paradigm leap from pure phenomenological fitting to the fusion of phenomenological fitting and endogenous deduction. By embedding physical meta-principles into neural network architecture, we construct the Meta-Principle Physics Architecture (MPPA). Specifically, MPPA embeds three core meta-principles - Connectivity, Conservation, Periodicity - into its architecture, implemented via three core components: the Gravitator realizes Connectivity via standard causal attention; the Energy Encoder implements Conservation via log-domain energy tracking and delayed compensation; the Periodicity Encoder fulfills Periodicity via FFT-based spectral analysis and delayed modulation. These components collaborate via a learnable independent gating fusion mechanism, forming a complete physical cognition framework of 'local relational connectivity - global conservation constraint - evolutionary periodic law'. Experiments show MPPA achieves significant improvements: physical reasoning (from near zero to 0.436, 0.436 vs 0.000), 2.18x mathematical task improvement (0.330 vs 0.151), 52% logical task gain (0.456 vs 0.300), and 3.69% lower validation perplexity (259.45 vs 269.40), with only 11.8% more parameters (242.40M vs 216.91M). Notably, MPPA shows strong generalization on out-of-distribution physical scenarios, proving the robustness and interpretability of this principle-embedded design. This work establishes a new theoretical foundation and technical path for next-generation AI with physical common sense, causal reasoning, and mathematical rigor.", "authors": [ "Helong Hu", "HongDan Pan", "ShuiQing Hu" ], "year": 2026, "published_date": "2026-04-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.08245v1", "pdf_url": "https://arxiv.org/pdf/2604.08245v1", "citations": 0, "topics": [], "tags": [ "Reasoning", "Interpretability", "Artificial Intelligence", "Interpretability & Explainability", "Reasoning & Chain-of-Thought" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.68, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The essence of current neural network architectures is phenomenological fitting: they learn input-output statistical correlations via massive parameters and data, yet lack intrinsic understanding of the fundamental principles governing physical reality. This paper proposes a paradigm leap from pure phenomenological fitting to the fusion of phenomenological fitting and endogenous deduction.", "key_contribution": "Experiments show MPPA achieves significant improvements: physical reasoning (from near zero to 0.436, 0.436 vs 0.000), 2.18x mathematical task improvement (0.330 vs 0.151), 52% logical task gain (0.456 vs 0.300), and 3.69% lower validation perplexity (259.45 vs 269.40), with only 11.8% more parameters (242.40M vs 216.91M).", "why_it_matters": "From Phenomenological Fitting to Endogenous Deduction: A Paradigm Leap via Meta-Principle Physics Architecture represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Experiments show MPPA achieves significant improvements: physical reasoning (from near zero to 0.436, 0.436 vs 0.000),…", "biggest_caveat": "bution physical scenarios, proving the robustness and interpretability of this principle-embedded design.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Reasoning.", "url": "http://arxiv.org/abs/2604.08245v1", "difficulty": "intermediate" }, { "id": "arxiv:2605.30104", "source": "arxiv", "source_type": "preprint", "title": "SEAL: Can Saturated Benchmarks Be Revived by LLM-as-a-Meta-Judge?", "abstract": "Widely used language-model benchmarks are increasingly saturated, with frontier systems often receiving near-tied scores that standard metrics cannot resolve. Rather than constructing harder alternatives, we ask whether existing tasks can be made informative again through improved evaluation over the same candidate outputs. Therefore, we present Seeded Elimination with Adaptive LLM-as-a-Meta-Judge, a self-improving evaluation protocol for extracting latent ranking signal from saturated benchmarks. SEAL seeds candidate outputs into a single elimination and evaluates each match with task-level principles plus self-improving checklist criteria. We evaluate SEAL on multiple saturated benchmarks covering code generation, mathematical reasoning, knowledge-intensive question answering, and tool-use agent task completion. Across these settings, SEAL improves the ranking-accuracy--latency trade-off over competing protocols, attaining 0.83--1.00 Spearman agreement with full pairwise judging and 4/4 top-1 agreement, while requiring only 11.89 calls per task compared with 28.00 for full pairwise evaluation.", "authors": [ "Jiamin Chen", "Yidi Wu", "Qiexiang Wang", "Qianben Chen", "Yuchen Li", "Yansen Zhang", "Xiaokun Zhang", "Wangchunshu Zhou", "Chen Ma" ], "year": 2026, "published_date": "2026-05-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.30104", "pdf_url": "https://arxiv.org/pdf/2605.30104", "citations": 0, "topics": [], "tags": [ "Reasoning", "QA", "Code Generation", "Evaluation", "NLP" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, QA) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.21, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Widely used language-model benchmarks are increasingly saturated, with frontier systems often receiving near-tied scores that standard metrics cannot resolve. Rather than constructing harder alternatives, we ask whether existing tasks can be made informative again through improved evaluation over the same candidate outputs.", "key_contribution": "Therefore, we present Seeded Elimination with Adaptive LLM-as-a-Meta-Judge, a self-improving evaluation protocol for extracting latent ranking signal from saturated benchmarks.", "why_it_matters": "SEAL: Can Saturated Benchmarks Be Revived by LLM-as-a-Meta-Judge? represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "Therefore, we present Seeded Elimination with Adaptive LLM-as-a-Meta-Judge, a self-improving evaluation protocol for…", "biggest_caveat": "cannot resolve.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.30104", "difficulty": "beginner" }, { "id": "arxiv:2501.08087", "source": "arxiv", "source_type": "preprint", "title": "Automating Explanation Need Management in App Reviews: A Case Study from the Navigation App Industry", "abstract": "Providing explanations in response to user reviews is a time-consuming and repetitive task for companies, as many reviews present similar issues requiring nearly identical responses. To improve efficiency, this paper proposes a semi-automated approach to managing explanation needs in user reviews. The approach leverages taxonomy categories to classify reviews and assign them to relevant internal teams or sources for responses. 2,366 app reviews from the Google Play Store and Apple App Store were scraped and analyzed using a word and phrase filtering system to detect explanation needs. The detected needs were categorized and assigned to specific internal teams at the company Graphmasters GmbH, using a hierarchical assignment strategy that prioritizes the most relevant teams. Additionally, external sources, such as existing support articles and past review responses, were integrated to provide comprehensive explanations. The system was evaluated through interviews and surveys with the Graphmasters support team, which consists of four employees. The results showed that the hierarchical assignment method improved the accuracy of team assignments, with correct teams being identified in 79.2% of cases. However, challenges in interrater agreement and the need for new responses in certain cases, particularly for Apple App Store reviews, were noted. Future work will focus on refining the taxonomy and enhancing the automation process to reduce manual intervention further.", "authors": [ "Martin Obaidi", "Nicolas Voß", "Hannah Deters", "Jakob Droste", "Marc Herrmann", "Jannik Fischbach", "Kurt Schneider" ], "year": 2026, "published_date": "2026-05-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2501.08087", "pdf_url": "https://arxiv.org/pdf/2501.08087", "citations": 0, "topics": [], "tags": [ "Software Engineering" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.59, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Providing explanations in response to user reviews is a time-consuming and repetitive task for companies, as many reviews present similar issues requiring nearly identical responses. To improve efficiency, this paper proposes a semi-automated approach to managing explanation needs in user reviews.", "key_contribution": "Providing explanations in response to user reviews is a time-consuming and repetitive task for companies, as many reviews present similar issues requiring nearly identical responses.", "why_it_matters": "Automating Explanation Need Management in App Reviews: A Case Study from the Navigation App Industry represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Software Engineering.", "one_line_takeaway": "Providing explanations in response to user reviews is a time-consuming and repetitive task for companies, as many…", "biggest_caveat": "However, challenges in interrater agreement and the need for new responses in certain cases, particularly for Apple App Store reviews, were noted.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Software Engineering.", "url": "https://arxiv.org/abs/2501.08087", "difficulty": "intermediate" }, { "id": "arxiv:2505.24503", "source": "arxiv", "source_type": "preprint", "title": "Online Fair Division with Additional Information", "abstract": "We study the problem of fairly allocating indivisible goods to agents in an online setting, where goods arrive sequentially and must be allocated irrevocably. Focusing on the popular fairness notions of envy-freeness, proportionality, and maximin share fairness (and their approximate variants), we investigate how access to future information changes what guarantees are achievable. Without any information, we prove strong impossibility results even for approximate fairness. With normalization information (agents' total values), we provide an algorithm that achieves stronger fairness guarantees than previously known results, and show matching impossibilities for stronger notions. With frequency predictions (value multisets without order), we design a meta-algorithm that lifts a broad class of offline ''share-based'' guarantees to the online setting, matching the best-known offline bounds. Finally, we provide learning-augmented variants of both models: under noisy totals or noisy frequency predictions, our guarantees are robust and degrade gracefully with the error parameters.", "authors": [ "Tzeh Yuan Neoh", "Jannik Peters", "Nicholas Teh" ], "year": 2026, "published_date": "2026-05-28", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2505.24503", "pdf_url": "https://arxiv.org/pdf/2505.24503", "citations": 0, "topics": [], "tags": [ "Fairness & Ethics", "Game Theory", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 3.55, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We study the problem of fairly allocating indivisible goods to agents in an online setting, where goods arrive sequentially and must be allocated irrevocably. Focusing on the popular fairness notions of envy-freeness, proportionality, and maximin share fairness (and their approximate variants), we investigate how access to future information changes what guarantees are achievable.", "key_contribution": "With normalization information (agents' total values), we provide an algorithm that achieves stronger fairness guarantees than previously known results, and show matching impossibilities for stronger notions.", "why_it_matters": "Online Fair Division with Additional Information represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fairness & Ethics.", "one_line_takeaway": "With normalization information (agents' total values), we provide an algorithm that achieves stronger fairness…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fairness & Ethics.", "url": "https://arxiv.org/abs/2505.24503", "difficulty": "intermediate" }, { "id": "arxiv:2605.23007", "source": "arxiv", "source_type": "preprint", "title": "MadEvolve: Evolutionary Optimization of Trading Systems with Large Language Models", "abstract": "We explore the application of LLM-driven algorithm optimization to several common tasks in quantitative finance. MadEvolve, a general-purpose algorithm optimization framework inspired by DeepMind's Alpha-Evolve, was recently developed to optimize algorithms in computational cosmology. Here we demonstrate the utility of MadEvolve to optimize algorithmic trading strategies and alpha generation at the example of Bitcoin trading. On our simulation and backtesting setup, we achieve significant improvements on all tasks we considered, such as evolving feature sets for signal generation, optimizing separate components of the trading strategy, and jointly evolving the feature pipeline together with the execution strategy. Additionally, we compare our method to other agentic search approaches, specifically Claude Code, and carefully evaluate p-hacking probabilities on our simulation setup. Our findings strongly support the utility of AI-driven agentic and evolutionary algorithms for algorithmic trading and quantitative finance.", "authors": [ "Yurii Kvasiuk", "Tianyi Li", "Owen Colegrove", "Moritz Münchmeyer" ], "year": 2026, "published_date": "2026-05-21", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.23007", "pdf_url": "https://arxiv.org/pdf/2605.23007", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.76, "content_potential_score": 0.55, "interestingness_score": 1.77, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We explore the application of LLM-driven algorithm optimization to several common tasks in quantitative finance. MadEvolve, a general-purpose algorithm optimization framework inspired by DeepMind's Alpha-Evolve, was recently developed to optimize algorithms in computational cosmology.", "key_contribution": "Here we demonstrate the utility of MadEvolve to optimize algorithmic trading strategies and alpha generation at the example of Bitcoin trading.", "why_it_matters": "MadEvolve: Evolutionary Optimization of Trading Systems with Large Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Here we demonstrate the utility of MadEvolve to optimize algorithmic trading strategies and alpha generation at the…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.23007", "difficulty": "intermediate" }, { "id": "arxiv:2605.17685", "source": "arxiv", "source_type": "preprint", "title": "Attention-Guided Fusion of 1D and 2D CNNs for Robust ECG-Based Biometric Recognition", "abstract": "Electrocardiogram (ECG)-based biometric recognition has emerged as a promising solution for secure authentication and liveness detection. However, most existing methods rely on unimodal deep learning architectures that independently process either one-dimensional (1D) temporal signals or two-dimensional (2D) time-frequency representations, limiting robustness and generalization. To address this issue, this paper proposes a hybrid framework integrating 1D and 2D convolutional neural networks (CNNs) within a unified end-to-end architecture. The 1D branch extracts temporal and morphological features from raw ECG signals, while the 2D branch captures discriminative spectral information from time-frequency representations. An attention-guided fusion mechanism dynamically weights both modalities according to input characteristics, overcoming the limitations of conventional static fusion strategies. The framework was evaluated on three benchmark datasets (ECG-ID, MIT-BIH, and PTB), including healthy subjects and patients with cardiac pathologies, achieving identification accuracies of 99.56%, 100.00%, and 99.89%, respectively. To assess long-term biometric permanence, experiments were also conducted on the multi-session Heartprint dataset spanning ten years. The proposed approach achieved same-session accuracies of 98.54% (S1), 99.09% (S2), 94.93% (S3R), and 96.08% (S3L), while cross-session evaluations reached 56.33% (S1-S2) and 53.27% (S2-S3R), demonstrating the ability to capture stable biometric signatures over time. The optimal configuration combines InceptionTime for 1D processing, ResNet-34 for 2D analysis, and attention-based fusion. Ablation studies confirm that the proposed attention mechanism consistently outperforms conventional fusion approaches. Overall, the proposed framework provides a robust, scalable, and high-performance solution for ECG biometric recognition.", "authors": [ "Arioua", "Islameddine", "Benzaoui", "Amir", "Zeroual", "Abdelhafid", "Houam", "Lotfi" ], "year": 2026, "published_date": "2026-05-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.17685", "pdf_url": "https://arxiv.org/pdf/2605.17685", "citations": 0, "topics": [], "tags": [ "Transformers", "Evaluation", "Artificial Intelligence", "Systems & Control", "Computer Vision" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 6.79, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Electrocardiogram (ECG)-based biometric recognition has emerged as a promising solution for secure authentication and liveness detection. However, most existing methods rely on unimodal deep learning architectures that independently process either one-dimensional (1D) temporal signals or two-dimensional (2D) time-frequency representations, limiting robustness and generalization.", "key_contribution": "Electrocardiogram (ECG)-based biometric recognition has emerged as a promising solution for secure authentication and liveness detection.", "why_it_matters": "Attention-Guided Fusion of 1D and 2D CNNs for Robust ECG-Based Biometric Recognition advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "Electrocardiogram (ECG)-based biometric recognition has emerged as a promising solution for secure authentication and…", "biggest_caveat": "limitations of conventional static fusion strategies.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2605.17685", "difficulty": "beginner" }, { "id": "arxiv:2605.02363", "source": "arxiv", "source_type": "preprint", "title": "When Correct Isn't Usable: Improving Structured Output Reliability in Small Language Models", "abstract": "Deployed language models must produce outputs that are both correct and format-compliant. We study this structured-output reliability gap using two mathematical benchmarks -- GSM8K and MATH -- as a controlled testbed: ground truth is unambiguous and the output contract is strict (JSON with required fields). We evaluate three 7-9B models under five prompting strategies and report output accuracy -- the joint event of mathematical correctness and valid JSON structure -- as the primary metric. A systematic format failure emerges: NAIVE prompting (no system prompt) achieves up to 85% task accuracy on GSM8K but 0% output accuracy across all models and datasets. REFERENCE prompting (a minimal hand-written JSON format prompt) fares little better, yielding 0% output accuracy for two of four models tested. Constrained decoding enforces syntactic validity but incurs 3.6x-8.2x latency overhead and in several settings degrades task performance substantially. To overcome this limitation, we developed AloLab, an iterative system-prompt optimizer (meta-agent: Claude Sonnet 4.5) requiring only black-box API access to the target model; it reaches 84-87% output accuracy on GSM8K and 34-40% on MATH across five independent runs per model, with 29/30 paired McNemar comparisons against the best static prompt significant at p < 0.05, at near-NAIVE inference latency and without model fine-tuning. The same format failure extends to GPT-4o (OpenAI, 2024), a proprietary closed-source model: REFERENCE achieves 0% output accuracy due to systematic markdown-fence wrapping, while AloLab reaches 95.2% [94.8, 95.6]. An ablation replacing the Sonnet 4.5 meta-agent with Claude 3 Haiku reduces mean output accuracy to 61.0% and increases run-to-run standard deviation from <1 pp to 21.8 pp, confirming that meta-agent capability is a primary driver of optimization quality.", "authors": [ "Cosimo Galeone", "Minsu Park", "Giuseppe Ettorre", "Daniele Ligorio" ], "year": 2026, "published_date": "2026-05-04", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.02363", "pdf_url": "https://arxiv.org/pdf/2605.02363", "citations": 0, "topics": [], "tags": [ "LLMs", "Fine-Tuning", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.15, "content_potential_score": 0.84, "interestingness_score": 1.92, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Deployed language models must produce outputs that are both correct and format-compliant. We study this structured-output reliability gap using two mathematical benchmarks -- GSM8K and MATH -- as a controlled testbed: ground truth is unambiguous and the output contract is strict (JSON with required fields).", "key_contribution": "Deployed language models must produce outputs that are both correct and format-compliant.", "why_it_matters": "When Correct Isn't Usable: Improving Structured Output Reliability in Small Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Deployed language models must produce outputs that are both correct and format-compliant.", "biggest_caveat": "but 0% output accuracy across all models and datasets.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.02363", "difficulty": "beginner" }, { "id": "arxiv:2511.19175", "source": "arxiv", "source_type": "preprint", "title": "LLM-Based Agentic Negotiation for 6G: Addressing Uncertainty Neglect and Tail-Event Risk", "abstract": "A critical barrier to the trustworthiness of sixth-generation (6G) agentic autonomous networks is the uncertainty neglect bias; a cognitive tendency for large language model (LLM)-powered agents to make high-stakes decisions based on simple averages while ignoring the tail risk of extreme events. This paper proposes an unbiased, risk-aware framework for agentic negotiation, designed to ensure robust resource allocation in 6G network slicing. Specifically, agents leverage Digital Twins (DTs) to predict full latency distributions, which are then evaluated using a formal framework from extreme value theory, namely, Conditional Value-at-Risk (CVaR). This approach fundamentally shifts the agent's objective from reasoning over the mean to reasoning over the tail, thereby building a statistically-grounded buffer against worst-case outcomes. Furthermore, our framework ensures full uncertainty awareness by requiring agents to quantify epistemic uncertainty -- confidence in their own DTs predictions -- and propagate this meta-verification to make robust decisions, preventing them from acting on unreliable data. We validate this framework in a 6G inter-slice negotiation use-case between an eMBB and a URLLC agent across 200 trials. The results demonstrate the profound failure of the biased, mean-based baseline, which systematically violates the strict URLLC SLA 11 times. Our unbiased, CVaR-aware agent successfully mitigates this bias, eliminating SLA violations entirely and significantly reducing the 99.999th-percentile latencies by up to 51.7\\%. We show this reliability comes at the rational and quantifiable cost of reduced energy savings, exposing the false economy of the biased approach. Crucially, executing our framework with an otel-llm-1b-it model on a single NVIDIA RTX A4000 GPU achieves sub-1.5-second inference times, validating the feasibility for non-real-time RIC use-cases.", "authors": [ "Hatim Chergui", "Farhad Rezazadeh", "Mehdi Bennis", "Merouane Debbah", "Christos Verikoukis" ], "year": 2026, "published_date": "2026-04-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2511.19175", "pdf_url": "https://arxiv.org/pdf/2511.19175", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "AI Agents", "Fairness & Ethics", "Multi-Agent Systems" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.4, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "A critical barrier to the trustworthiness of sixth-generation (6G) agentic autonomous networks is the uncertainty neglect bias; a cognitive tendency for large language model (LLM)-powered agents to make high-stakes decisions based on simple averages while ignoring the tail risk of extreme events. This paper proposes an unbiased, risk-aware framework for agentic negotiation, designed to ensure robust resource allocation in 6G network slicing.", "key_contribution": "The results demonstrate the profound failure of the biased, mean-based baseline, which systematically violates the strict URLLC SLA 11 times.", "why_it_matters": "LLM-Based Agentic Negotiation for 6G: Addressing Uncertainty Neglect and Tail-Event Risk represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "The results demonstrate the profound failure of the biased, mean-based baseline, which systematically violates the…", "biggest_caveat": "butions, which are then evaluated using a formal framework from extreme value theory, namely, Conditional Value-at-Risk (CVaR).", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2511.19175", "difficulty": "intermediate" }, { "id": "arxiv:2605.00133", "source": "arxiv", "source_type": "preprint", "title": "Smart Profit-Aware Crop Advisory System: Kisan AI", "abstract": "Modern crop advisory systems exhibit a critical limitation termed \\textit{economic blindness}. These systems primarily optimize for biological yield, often overlooking market price, which can lead farmers toward agronomically sound yet financially unviable decisions. In this paper, we develop Kisan AI, a smart profit-aware crop advisory system that resolves the above-mentioned limitation through a research-driven, full-stack application. We train the Random Forest(RF) classifier model on a nine-feature benchmark dataset, the standard seven agronomic attributes augmented with a \\textit{market\\_price} variable, and evaluated against eight baseline models, considering the evaluation matrices, such as, accuracy, precision, recall, F1-score, and Log Loss. The RF model achieves the highest accuracy of 99.3\\% and the lowest Log Loss, confirming that the inclusion of market price as a predictive feature is both valid and impactful. We then implement the RF model within a multilingual progressive Web App alongside a Facebook Prophet six-month price forecasting engine and a MobileNetV2 disease detection module. A nine-language AI chatbot powered by the Anthropic Claude API unifies all modules into a single, mobile-installable platform accessible to farmers across India.", "authors": [ "Debasis Dwibedy", "Avyay Nishtala", "Pranathi Mukku", "D Snehaja" ], "year": 2026, "published_date": "2026-04-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.00133", "pdf_url": "https://arxiv.org/pdf/2605.00133", "citations": 0, "topics": [], "tags": [ "Dialogue", "Evaluation", "Artificial Intelligence", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Survey, tutorial, or introductory material — accessible to beginners.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.5, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Modern crop advisory systems exhibit a critical limitation termed \\textit{economic blindness}. These systems primarily optimize for biological yield, often overlooking market price, which can lead farmers toward agronomically sound yet financially unviable decisions.", "key_contribution": "Modern crop advisory systems exhibit a critical limitation termed \\textit{economic blindness}.", "why_it_matters": "Smart Profit-Aware Crop Advisory System: Kisan AI represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Dialogue.", "one_line_takeaway": "Modern crop advisory systems exhibit a critical limitation termed \\textit{economic blindness}.", "biggest_caveat": "limitation termed \\textit{economic blindness}.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Dialogue.", "url": "https://arxiv.org/abs/2605.00133", "difficulty": "beginner" }, { "id": "arxiv:2604.16128v1", "source": "arxiv", "source_type": "preprint", "title": "PolicyGapper: Automated Detection of Inconsistencies Between Google Play Data Safety Sections and Privacy Policies Using LLMs", "abstract": "Mobile application developers are required to disclose how they collect, use, and share user data in compliance with privacy regulations. To support transparency, major app marketplaces have introduced standardized disclosure mechanisms. In 2022, Google mandated the Data Safety Section (DSS) on Google Play, requiring developers to summarize their data practices. However, compiling accurate DSS disclosures is challenging, as they must remain consistent with the corresponding privacy policy (PP), and no automated tool currently verifies this alignment. Prior studies indicate that nearly 80% of popular apps contain incomplete or misleading DSS declarations. We present PolicyGapper, an LLM-based methodology for automatically detecting discrepancies between DSS disclosures and privacy policies. PolicyGapper operates in four stages: scraping, pre-processing, analysis, and post-processing, without requiring access to application binaries. We evaluate PolicyGapper on a dataset of 330 top-ranked apps spanning all 33 Google Play categories, collected in Q3 2025. The approach identifies 2,689 omitted disclosures, including 2,040 related to data collection and 649 to data sharing. Manual validation on a stratified 10% subset, repeated across three independent runs, yields an average Precision of 0.75, Recall of 0.77, Accuracy of 0.69, and F1-score of 0.76. To support reproducibility, we release a complete replication package, including the dataset, prompts, source code, and results available at https://github.com/Mobile-IoT-Security-Lab/PolicyGapper and https://doi.org/10.5281/zenodo.19628493.", "authors": [ "Luca Ferrari", "Billel Habbati", "Meriem Guerar", "Mariano Ceccato", "Luca Verderame" ], "year": 2026, "published_date": "2026-04-17", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.16128v1", "pdf_url": "https://arxiv.org/pdf/2604.16128v1", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "Cryptography & Security" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (AI Safety) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.47, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Mobile application developers are required to disclose how they collect, use, and share user data in compliance with privacy regulations. To support transparency, major app marketplaces have introduced standardized disclosure mechanisms.", "key_contribution": "We present PolicyGapper, an LLM-based methodology for automatically detecting discrepancies between DSS disclosures and privacy policies.", "why_it_matters": "PolicyGapper: Automated Detection of Inconsistencies Between Google Play Data Safety Sections and Privacy Policies Using LLMs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present PolicyGapper, an LLM-based methodology for automatically detecting discrepancies between DSS disclosures and…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.16128v1", "difficulty": "advanced" }, { "id": "arxiv:2604.14004v1", "source": "arxiv", "source_type": "preprint", "title": "Memory Transfer Learning: How Memories are Transferred Across Domains in Coding Agents", "abstract": "Memory-based self-evolution has emerged as a promising paradigm for coding agents. However, existing approaches typically restrict memory utilization to homogeneous task domains, failing to leverage the shared infrastructural foundations, such as runtime environments and programming languages, that exist across diverse real-world coding problems. To address this limitation, we investigate \\textbf{Memory Transfer Learning} (MTL) by harnessing a unified memory pool from heterogeneous domains. We evaluate performance across 6 coding benchmarks using four memory representations, ranging from concrete traces to abstract insights. Our experiments demonstrate that cross-domain memory improves average performance by 3.7\\%, primarily by transferring meta-knowledge, such as validation routines, rather than task-specific code. Importantly, we find that abstraction dictates transferability; high-level insights generalize well, whereas low-level traces often induce negative transfer due to excessive specificity. Furthermore, we show that transfer effectiveness scales with the size of the memory pool, and memory can be transferred even between different models. Our work establishes empirical design principles for expanding memory utilization beyond single-domain silos. Project page: https://memorytransfer.github.io/", "authors": [ "Kangsan Kim", "Minki Kang", "Taeil Kim", "Yanlai Yang", "Mengye Ren", "Sung Ju Hwang" ], "year": 2026, "published_date": "2026-04-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.14004v1", "pdf_url": "https://arxiv.org/pdf/2604.14004v1", "citations": 0, "topics": [], "tags": [ "Evaluation", "Artificial Intelligence", "NLP" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.95, "content_potential_score": 1.1, "interestingness_score": 2.05, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Memory-based self-evolution has emerged as a promising paradigm for coding agents. However, existing approaches typically restrict memory utilization to homogeneous task domains, failing to leverage the shared infrastructural foundations, such as runtime environments and programming languages, that exist across diverse real-world coding problems.", "key_contribution": "Our experiments demonstrate that cross-domain memory improves average performance by 3.7\\%, primarily by transferring meta-knowledge, such as validation routines, rather than task-specific code.", "why_it_matters": "Memory Transfer Learning: How Memories are Transferred Across Domains in Coding Agents represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Evaluation.", "one_line_takeaway": "Our experiments demonstrate that cross-domain memory improves average performance by 3.7\\%, primarily by transferring…", "biggest_caveat": "limitation, we investigate \\textbf{Memory Transfer Learning} (MTL) by harnessing a unified memory pool from heterogeneous domains.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Evaluation.", "url": "http://arxiv.org/abs/2604.14004v1", "difficulty": "beginner" }, { "id": "arxiv:2604.12301v1", "source": "arxiv", "source_type": "preprint", "title": "Local-Splitter: A Measurement Study of Seven Tactics for Reducing Cloud LLM Token Usage on Coding-Agent Workloads", "abstract": "We present a systematic measurement study of seven tactics for reducing cloud LLM token usage when a small local model can act as a triage layer in front of a frontier cloud model. The tactics are: (1) local routing, (2) prompt compression, (3) semantic caching, (4) local drafting with cloud review, (5) minimal-diff edits, (6) structured intent extraction, and (7) batching with vendor prompt caching. We implement all seven in an open-source shim that speaks both MCP and the OpenAI-compatible HTTP surface, supporting any local model via Ollama and any cloud model via an OpenAI-compatible endpoint. We evaluate each tactic individually, in pairs, and in a greedy-additive subset across four coding-agent workload classes (edit-heavy, explanation-heavy, general chat, RAG-heavy). We measure tokens saved, dollar cost, latency, and routing accuracy. Our headline finding is that T1 (local routing) combined with T2 (prompt compression) achieves 45-79% cloud token savings on edit-heavy and explanation-heavy workloads, while on RAG-heavy workloads the full tactic set including T4 (draft-review) achieves 51% savings. We observe that the optimal tactic subset is workload-dependent, which we believe is the most actionable finding for practitioners deploying coding agents today.", "authors": [ "Justice Owusu Agyemang", "Jerry John Kponyo", "Elliot Amponsah", "Godfred Manu Addo Boakye", "Kwame Opuni-Boachie Obour Agyekum" ], "year": 2026, "published_date": "2026-04-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.12301v1", "pdf_url": "https://arxiv.org/pdf/2604.12301v1", "citations": 0, "topics": [], "tags": [ "LLMs", "RAG", "Artificial Intelligence", "Software Engineering", "Retrieval-Augmented Generation" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 4.84, "content_potential_score": 0.45, "interestingness_score": 1.73, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We present a systematic measurement study of seven tactics for reducing cloud LLM token usage when a small local model can act as a triage layer in front of a frontier cloud model. The tactics are: (1) local routing, (2) prompt compression, (3) semantic caching, (4) local drafting with cloud review, (5) minimal-diff edits, (6) structured intent extraction, and (7) batching with vendor prompt caching.", "key_contribution": "We present a systematic measurement study of seven tactics for reducing cloud LLM token usage when a small local model can act as a triage layer in front of a frontier cloud model.", "why_it_matters": "Local-Splitter: A Measurement Study of Seven Tactics for Reducing Cloud LLM Token Usage on Coding-Agent Workloads improves how language models ground their responses in verified, up-to-date knowledge.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We present a systematic measurement study of seven tactics for reducing cloud LLM token usage when a small local model…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.12301v1", "difficulty": "intermediate" }, { "id": "arxiv:2604.05969v1", "source": "arxiv", "source_type": "preprint", "title": "A Formal Security Framework for MCP-Based AI Agents: Threat Taxonomy, Verification Models, and Defense Mechanisms", "abstract": "The Model Context Protocol (MCP), introduced by Anthropic in November 2024 and now governed by the Linux Foundation's Agentic AI Foundation, has rapidly become the de facto standard for connecting large language model (LLM)-based agents to external tools and data sources, with over 97 million monthly SDK downloads and more than 177000 registered tools. However, this explosive adoption has exposed a critical gap: the absence of a unified, formal security framework capable of systematically characterizing, analyzing, and mitigating the diverse threats facing MCP-based agent ecosystems. Existing security research remains fragmented across individual attack papers, isolated benchmarks, and point defense mechanisms. This paper presents MCPSHIELD, a comprehensive formal security framework for MCP-based AI agents. We make four principal contributions: (1) a hierarchical threat taxonomy comprising 7 threat categories and 23 distinct attack vectors organized across four attack surfaces, grounded in the analysis of over 177000 MCP tools; (2) a formal verification model based on labeled transition systems with trust boundary annotations that enables static and runtime analysis of MCP tool interaction chains; (3) a systematic comparative evaluation of 12 existing defense mechanisms, identifying coverage gaps across our threat taxonomy; and (4) a defense in depth reference architecture integrating capability based access control, cryptographic tool attestation, information flow tracking, and runtime policy enforcement. Our analysis reveals that no existing single defense covers more than 34 percent of the identified threat landscape, whereas MCPSHIELD's integrated architecture achieves theoretical coverage of 91 percent. We further identify seven open research challenges that must be addressed to secure the next generation of agentic AI systems.", "authors": [ "Nirajan Acharya", "Gaurav Kumar Gupta" ], "year": 2026, "published_date": "2026-04-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.05969v1", "pdf_url": "https://arxiv.org/pdf/2604.05969v1", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Agents", "Evaluation", "Artificial Intelligence", "Benchmarking & Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 3.0, "read_first_score": 5.83, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The Model Context Protocol (MCP), introduced by Anthropic in November 2024 and now governed by the Linux Foundation's Agentic AI Foundation, has rapidly become the de facto standard for connecting large language model (LLM)-based agents to external tools and data sources, with over 97 million monthly SDK downloads and more than 177000 registered tools. However, this explosive adoption has exposed a critical gap: the absence of a unified, formal security framework capable of systematically characterizing, analyzing, and mitigating the diverse threats facing MCP-based agent ecosystems.", "key_contribution": "The Model Context Protocol (MCP), introduced by Anthropic in November 2024 and now governed by the Linux Foundation's Agentic AI Foundation, has rapidly become the de facto standard for connecting large language model (LLM)-based agents to external tools and data sources, with over 97 million monthly SDK downloads and more than 177000 registered tools.", "why_it_matters": "A Formal Security Framework for MCP-Based AI Agents: Threat Taxonomy, Verification Models, and Defense Mechanisms represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "The Model Context Protocol (MCP), introduced by Anthropic in November 2024 and now governed by the Linux Foundation's…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.05969v1", "difficulty": "beginner" }, { "id": "arxiv:2603.12665", "source": "arxiv", "source_type": "preprint", "title": "TacVLA: Contact-Aware Tactile Fusion for Robust Vision-Language-Action Manipulation", "abstract": "Vision-Language-Action (VLA) models have demonstrated significant advantages in robotic manipulation. However, their reliance on vision and language often leads to suboptimal performance in tasks involving visual occlusion, fine-grained manipulation, and physical contact. To address these challenges, we propose TacVLA, a fine-tuned VLA model by incorporating tactile modalities into the transformer-based policy to enhance fine-grained manipulation capabilities. Specifically, we introduce a contact-aware gating mechanism that selectively activates tactile tokens only when contact is detected, enabling adaptive multimodal fusion while avoiding irrelevant tactile interference. The fused visual, language, and tactile tokens are jointly processed within the transformer architecture to strengthen cross-modal grounding during contact-rich interaction. Extensive experiments on constraint-locked disassembly, in-box picking and robustness evaluations demonstrate that TacVLA outperforms baselines, %including existing VLA models and diffusion policies, improving the performance by averaging 20\\% success rate in disassembly and 60\\% in in-box picking, achieving a 2.1$\\times$ improvement under visual occlusion, and showing recovery behavior under human disturbance. Videos are available at https://sites.google.com/view/tacvla.", "authors": [ "Kaidi Zhang", "Heng Zhang", "Zhengtong Xu", "Zhiyuan Zhang", "Md Rakibul Islam Prince", "Xiang Li", "Xiaojing Han", "Yuhao Zhou", "Arash Ajoudani", "Yu She" ], "year": 2026, "published_date": "2026-09-01", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2603.12665", "pdf_url": "https://arxiv.org/pdf/2603.12665", "citations": 0, "topics": [], "tags": [ "Hallucination", "Fine-Tuning", "Multimodal", "Transformers", "Robotics" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 2.99, "read_first_score": 5.99, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Vision-Language-Action (VLA) models have demonstrated significant advantages in robotic manipulation. However, their reliance on vision and language often leads to suboptimal performance in tasks involving visual occlusion, fine-grained manipulation, and physical contact.", "key_contribution": "To address these challenges, we propose TacVLA, a fine-tuned VLA model by incorporating tactile modalities into the transformer-based policy to enhance fine-grained manipulation capabilities.", "why_it_matters": "TacVLA: Contact-Aware Tactile Fusion for Robust Vision-Language-Action Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Hallucination.", "one_line_takeaway": "To address these challenges, we propose TacVLA, a fine-tuned VLA model by incorporating tactile modalities into the…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Hallucination.", "url": "https://arxiv.org/abs/2603.12665", "difficulty": "intermediate" }, { "id": "arxiv:2608.28958", "source": "arxiv", "source_type": "preprint", "title": "CoVA-SFT: A Large-Scale Dataset for Chain of Visual Abstractions", "abstract": "Chain-of-thought (CoT) reasoning has dramatically improved large language models (LLMs) by allowing them to decompose problems into intermediate steps. While CoT is widely effective for linguistic tasks, text-only CoT forces models to serialize visual problems into awkward prose. Although architectural solutions exist to process visual inputs, the community lacks a massive, multi-step, self-corrected dataset to teach models how to build and maintain internal visual workspaces when solving purely textual reasoning problems. To address this limitation, we introduce CoVA-SFT, a highly structured corpus of 51.9K samples containing over 222K multimodal reasoning steps across 5 distinct layout families and 17 complex tasks, and CoVA-Bench, a companion benchmark of 1,700 held-out test samples spanning the same tasks for reproducible evaluation. By providing explicit rationale formulations, agentic renderings, and verification loops, CoVA-SFT teaches multimodal language models to interleave text and visual abstractions. We validate the dataset by demonstrating that models fine-tuned on CoVA-SFT outperform all interleaved CoT baselines by more than 2x on average on CoVA-Bench, though they still fall short of strong text-only CoT baselines, highlighting open challenges for future work.", "authors": [ "Tsung-Han Wu", "Heekyung Lee", "Anya Ji", "Haoming Chen", "Trevor Darrell", "Joseph E. Gonzalez", "David M. Chan" ], "year": 2026, "published_date": "2026-08-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.28958", "pdf_url": "https://arxiv.org/pdf/2608.28958", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Fine-Tuning", "AI Agents", "Multimodal" ], "paper_type": "benchmark", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 2.99, "read_first_score": 4.92, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Chain-of-thought (CoT) reasoning has dramatically improved large language models (LLMs) by allowing them to decompose problems into intermediate steps. While CoT is widely effective for linguistic tasks, text-only CoT forces models to serialize visual problems into awkward prose.", "key_contribution": "To address this limitation, we introduce CoVA-SFT, a highly structured corpus of 51.9K samples containing over 222K multimodal reasoning steps across 5 distinct layout families and 17 complex tasks, and CoVA-Bench, a companion benchmark of 1,700 held-out test samples spanning the same tasks for reproducible evaluation.", "why_it_matters": "CoVA-SFT: A Large-Scale Dataset for Chain of Visual Abstractions represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "To address this limitation, we introduce CoVA-SFT, a highly structured corpus of 51.9K samples containing over 222K…", "biggest_caveat": "limitation, we introduce CoVA-SFT, a highly structured corpus of 51.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.28958", "difficulty": "intermediate" }, { "id": "arxiv:2608.27395", "source": "arxiv", "source_type": "preprint", "title": "LeVJEPA: Efficient & Scalable Video Pretraining without the Heuristics", "abstract": "Video carries the temporal structure of the physical world, yet learning representations from it has remained computationally expensive: prevailing self-supervised methods either prevent representation collapse through architectural asymmetries, coupling an exponential-moving-average target encoder, a stop-gradient, and a capacity-limited predictor, or circumvent it by reconstructing masked content in pixel space. We introduce LeVJEPA, the first video encoder trained under LeJEPA's collapse-free objective, which dispenses with both. A single encoder is trained with an invariance loss over global and local views of a clip, regularized by SIGReg, which excludes collapse with a provable guarantee. The architecture reduces to an encoder and a projector, and the objective to a single hyperparameter. This formulation admits two properties. First, the cost of pretraining is governed by the number of tokens the encoder observes; uniform random token dropping renders this number small while simultaneously improving downstream accuracy. At matched epochs on identical data, LeVJEPA matches or surpasses V-JEPA 2 across ViT-S/B/L at 5.6 to 20.8x less pretraining compute, and at matched total FLOPs it exceeds the strongest video baseline by 7.6 points on ImageNet-1K while remaining competitive on motion-centric benchmarks. Second, since no asymmetry between branches is required, the encoder can be trained with block-causal attention at no measurable accuracy cost: temporal ordering becomes a property of the encoder itself. Against a compute-matched DINOv2 trained on frames of the same videos, LeVJEPA approaches the image-pretrained encoder on appearance-centric evaluation while nearly doubling its motion-centric accuracy. These results indicate that, once its computational overhead is removed, video becomes a viable and in several respects preferable substrate for general-purpose visual pretraining.", "authors": [ "Lukas Kuhn", "Lucas Maes", "Giuseppe Serra", "Quentin Le Lidec", "Yann LeCun", "Randall Balestriero", "Florian Buettner" ], "year": 2026, "published_date": "2026-08-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.27395", "pdf_url": "https://arxiv.org/pdf/2608.27395", "citations": 0, "topics": [], "tags": [ "VLMs", "Self-Supervised", "Evaluation", "Artificial Intelligence", "Computer Vision" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Uses pretraining — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 2.99, "read_first_score": 4.62, "content_potential_score": 1.55, "interestingness_score": 2.27, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Video carries the temporal structure of the physical world, yet learning representations from it has remained computationally expensive: prevailing self-supervised methods either prevent representation collapse through architectural asymmetries, coupling an exponential-moving-average target encoder, a stop-gradient, and a capacity-limited predictor, or circumvent it by reconstructing masked content in pixel space. We introduce LeVJEPA, the first video encoder trained under LeJEPA's collapse-free objective, which dispenses with both.", "key_contribution": "We introduce LeVJEPA, the first video encoder trained under LeJEPA's collapse-free objective, which dispenses with both.", "why_it_matters": "LeVJEPA: Efficient & Scalable Video Pretraining without the Heuristics advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about VLMs.", "one_line_takeaway": "We introduce LeVJEPA, the first video encoder trained under LeJEPA's collapse-free objective, which dispenses with both.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in VLMs.", "url": "https://arxiv.org/abs/2608.27395", "difficulty": "advanced" }, { "id": "arxiv:2605.30994", "source": "arxiv", "source_type": "preprint", "title": "Dynamic Interaction-Aware and Causality-Disentangled Framework for Multimodal Sentiment Analysis", "abstract": "Although Multimodal Sentiment Analysis (MSA) effectively leverages rich information from language, visual, and acoustic modalities, existing methods still face two core challenges: 1) static conflict suppression mechanisms fail to adapt to dynamic variations across samples, and 2) the inherent sentimental bias within the language modality, which can misguide learning from other modalities, remains entangled. To this end, we propose a Dynamic Multimodal Causal Disentanglement and Adaptive Fusion Framework (MCAF). Its cornerstone is the Multi-Granularity Causal Dynamic Router and a Conditional Diffusion Denoising Module. First, we introduce a causal intervention module based on the information bottleneck principle, which builds a Structural Causal Model to disentangle sentimental bias from language features, yielding a \"de-confounded\" language representation as a pure guiding signal. Second, we devise a Dynamic Multimodal Router that evaluates the interaction states (complementary, conflicting, or redundant) among visual, acoustic, and de-confounded language signals in real-time across three levels: feature, temporal, and modality, then adaptively allocates weights and routes information flow for fine-grained regulation. Finally, a lightweight Conditional Diffusion Denoising Module performs iterative denoising on the fused joint representation to explicitly filter out residual irrelevant information, generating a robust hyper-modality representation. Extensive experiments on the CMU-MOSI and CMU-MOSEI benchmarks show that MCAF sets new state-of-the-art on key classification metrics, achieving an Acc-2/F1 of 86.52%/86.51% on MOSI and 86.72%/86.65% on MOSEI, while remaining highly competitive on others. Comprehensive analyses and visualizations further validate its efficacy in dynamically perceiving interactions, disentangling bias, and enhancing interpretability.", "authors": [ "Guangyuan Dong", "Ziwei Hong", "Shenghao Liu", "Chenyu Wu", "Yuanyuan Fang", "Zihao Li", "Xudong Zhang", "Bingchen Liu", "Yuchen Zhang", "Haitao Ding", "Zhenzhou Zhou", "Ziyu Song" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.30994", "pdf_url": "https://arxiv.org/pdf/2605.30994", "citations": 0, "topics": [], "tags": [ "Multimodal", "Sentiment Analysis", "Fairness & Ethics", "Interpretability", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, Sentiment Analysis) with no advanced math.", "maturity_stage": "emerging", "paper_score": 2.99, "read_first_score": 6.0, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Although Multimodal Sentiment Analysis (MSA) effectively leverages rich information from language, visual, and acoustic modalities, existing methods still face two core challenges: 1) static conflict suppression mechanisms fail to adapt to dynamic variations across samples, and 2) the inherent sentimental bias within the language modality, which can misguide learning from other modalities, remains entangled. To this end, we propose a Dynamic Multimodal Causal Disentanglement and Adaptive Fusion Framework (MCAF).", "key_contribution": "To this end, we propose a Dynamic Multimodal Causal Disentanglement and Adaptive Fusion Framework (MCAF).", "why_it_matters": "Dynamic Interaction-Aware and Causality-Disentangled Framework for Multimodal Sentiment Analysis represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "To this end, we propose a Dynamic Multimodal Causal Disentanglement and Adaptive Fusion Framework (MCAF).", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2605.30994", "difficulty": "beginner" }, { "id": "arxiv:2606.24251", "source": "arxiv", "source_type": "preprint", "title": "Probing the Misaligned Thinking Process of Language Models", "abstract": "Large language models exhibit a growing range of misaligned behaviors such as strategic deception, sandbagging, and self-preservation. As they are increasingly deployed in high-stakes settings, it is critical to reliably detect such behaviors to ensure safe and responsible use. In this work, we propose to monitor misalignment by decomposing it into fine-grained cognitive processes -- misalignment indicators -- and detecting their presence in a model's internal activations via linear probes. We develop a taxonomy of 18 indicators spanning different misaligned behaviors, paired with an automated, meta-plan-guided pipeline that generates multi-turn training conversations. To rigorously evaluate generalization, we construct an out-of-distribution suite combining automated behavioral elicitation, established misalignment benchmarks, and natural benign conversations. Across 5 misaligned behaviors, our probes match a strong LLM judge with 0.935 AUROC on out-of-distribution benchmarks while keeping a low false positive rate on benign traffic. We further perform in-depth analysis to understand the probes and the model's internal representations of misalignment indicators.", "authors": [ "Kaiwen Zhou", "Constantin Venhoff", "Jonathan Michala", "Xin Eric Wang", "William Saunders" ], "year": 2026, "published_date": "2026-06-23", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.24251", "pdf_url": "https://arxiv.org/pdf/2606.24251", "citations": 0, "topics": [], "tags": [ "LLMs", "AI Safety", "Dialogue", "Evaluation", "Artificial Intelligence" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 2.99, "read_first_score": 5.58, "content_potential_score": 0.84, "interestingness_score": 1.92, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models exhibit a growing range of misaligned behaviors such as strategic deception, sandbagging, and self-preservation. As they are increasingly deployed in high-stakes settings, it is critical to reliably detect such behaviors to ensure safe and responsible use.", "key_contribution": "In this work, we propose to monitor misalignment by decomposing it into fine-grained cognitive processes -- misalignment indicators -- and detecting their presence in a model's internal activations via linear probes.", "why_it_matters": "Probing the Misaligned Thinking Process of Language Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "In this work, we propose to monitor misalignment by decomposing it into fine-grained cognitive processes --…", "biggest_caveat": "bution suite combining automated behavioral elicitation, established misalignment benchmarks, and natural benign conversations.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2606.24251", "difficulty": "beginner" }, { "id": "arxiv:2606.17055", "source": "arxiv", "source_type": "preprint", "title": "T-Rex: Tactile-Reactive Dexterous Manipulation", "abstract": "The ability to react dynamically to tactile signals has long been considered crucial to agile human-level dexterity. Yet contemporary learning-based Vision-Language-Action (VLA) models for robotic manipulation generally either overlook the tactile modality or are limited to encoders with static cues, due in part to the scarcity of diverse training data and standardized evaluation, architectural constraints in current VLA models, and limitations of static tactile encoders. In this paper, we push the frontier of tactile-reactive manipulation by addressing all of these limitations. We propose a large-scale, 100-hour tactile-rich dataset collected via a novel, data-efficient recipe that prioritizes elementary motor primitives. To effectively exploit naturally high-frequency touch signals without sacrificing the existing capabilities of existing VLAs, we introduce a variable-rate Mixture-of-Transformers (MoT) architecture equipped with a novel temporal tactile VQ-VAE encoder. We demonstrate the effectiveness of tactile-reactive policies on 12 manipulation tasks requiring delicate force control and deformable object manipulation, achieving over 30% higher average success rate than the strongest baseline.", "authors": [ "Dantong Niu", "Zhuoyang Liu", "Zekai Wang", "Boning Shao", "Zhao-Heng Yin", "Anirudh Pai", "Yuvan Sharma", "Stefano Saravalle", "Ruijie Zheng", "Jing Wang", "Ryan Punamiya", "Mengda Xu", "Yuqi Xie", "Yunfan Jiang", "Letian Fu", "Konstantinos Kallidromitis", "Matteo Gioia", "Junyi Zhang", "Jiaxin Ge", "Haiwen Feng", "Fabio Galasso", "Wei Zhan", "David M. Chan", "Yutong Bai", "Roei Herzig", "Jiahui Lei", "Fei-Fei Li", "Ken Goldberg", "Jitendra Malik", "Pieter Abbeel", "Yuke Zhu", "Danfei Xu", "Jim", "Fan", "Trevor Darrell" ], "year": 2026, "published_date": "2026-06-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.17055", "pdf_url": "https://arxiv.org/pdf/2606.17055", "citations": 0, "topics": [], "tags": [ "Transformers", "Robotics" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Uses vae — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 2.99, "read_first_score": 5.39, "content_potential_score": 1.5, "interestingness_score": 2.25, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "The ability to react dynamically to tactile signals has long been considered crucial to agile human-level dexterity. Yet contemporary learning-based Vision-Language-Action (VLA) models for robotic manipulation generally either overlook the tactile modality or are limited to encoders with static cues, due in part to the scarcity of diverse training data and standardized evaluation, architectural constraints in current VLA models, and limitations of static tactile encoders.", "key_contribution": "We propose a large-scale, 100-hour tactile-rich dataset collected via a novel, data-efficient recipe that prioritizes elementary motor primitives.", "why_it_matters": "T-Rex: Tactile-Reactive Dexterous Manipulation represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Transformers.", "one_line_takeaway": "We propose a large-scale, 100-hour tactile-rich dataset collected via a novel, data-efficient recipe that prioritizes…", "biggest_caveat": "limitations of static tactile encoders.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Transformers.", "url": "https://arxiv.org/abs/2606.17055", "difficulty": "advanced" }, { "id": "arxiv:2605.30813", "source": "arxiv", "source_type": "preprint", "title": "Incremental BPE Tokenization", "abstract": "We propose a novel algorithm for incremental Byte Pair Encoding (BPE) tokenization. The algorithm processes each input byte in worst-case $\\mathcal{O}(\\log^2 t)$ time, leading to an overall complexity of $\\mathcal{O}(n \\log^2 t)$, where $n$ is the input length and $t$ is the maximum token length. The algorithm incrementally maintains BPE tokenization results for every prefix of the input text, implementing the standard BPE merge procedure defined by a fixed set of merge rules. This enables efficient partial tokenization in streaming settings. Functioning as a drop-in replacement for standard BPE, our approach achieves a speedup of up to ${\\sim}3\\times$ over Hugging Face's tokenizers, and demonstrates significant latency reductions over OpenAI's tiktoken on pathological inputs. We further introduce an eager output algorithm that enables streaming output, emitting tokens as soon as token boundaries are determined during incremental tokenization. Overall, our results demonstrate that BPE tokenization can be performed incrementally with strong worst-case guarantees, while providing practical latency benefits in modern large language model pipelines. Code: https://github.com/ModelTC/mtc-inc-bpe", "authors": [ "Shenghu Jiang", "Ruihao Gong" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.30813", "pdf_url": "https://arxiv.org/pdf/2605.30813", "citations": 0, "topics": [], "tags": [ "LLMs", "Data Structures & Algorithms", "NLP" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 2.99, "read_first_score": 5.02, "content_potential_score": 0.42, "interestingness_score": 1.71, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We propose a novel algorithm for incremental Byte Pair Encoding (BPE) tokenization. The algorithm processes each input byte in worst-case $\\mathcal{O}(\\log^2 t)$ time, leading to an overall complexity of $\\mathcal{O}(n \\log^2 t)$, where $n$ is the input length and $t$ is the maximum token length.", "key_contribution": "We propose a novel algorithm for incremental Byte Pair Encoding (BPE) tokenization.", "why_it_matters": "Incremental BPE Tokenization represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We propose a novel algorithm for incremental Byte Pair Encoding (BPE) tokenization.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2605.30813", "difficulty": "intermediate" }, { "id": "arxiv:2605.16567", "source": "arxiv", "source_type": "preprint", "title": "Automatic Unsupervised Ensemble Outlier Model Selection--Extended Version", "abstract": "Unsupervised outlier detection is attractive because it eliminates the need for labeled data. Moreover, forming multi-model ensembles can improve detection robustness. However, composing an ensemble without labeled data is challenging. Naively composed ensembles can suffer from ensemble saturation, where redundant or unreliable detection models degrade performance and incur unnecessary computation. We propose MetaEns, an automatic unsupervised framework for selecting ensembles of outlier detection models. Using labeled meta-datasets, MetaEns learns a model that predicts marginal ensemble gains, estimating the expected improvement from adding a candidate model to a partially constructed ensemble. At test time, this learned signal is combined with a submodular-inspired proxy objective that enforces diminishing returns through diversity-aware discounting and family-level risk regularization, thereby enabling greedy sequential selection with adaptive early stopping. As a result, MetaEns constructs compact, high-quality ensembles without access to ground-truth labels. Experiments on 39 real-world datasets show that MetaEns consistently outperforms state-of-the-art unsupervised selectors and ensemble baselines, achieving higher average precision while using fewer models.", "authors": [ "Hong-Phuc Phan", "Tuan-Anh Vu", "Tung Kieu", "Son Ha Xuan", "Bin Yang", "Christian S. Jensen" ], "year": 2026, "published_date": "2026-05-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.16567", "pdf_url": "https://arxiv.org/pdf/2605.16567", "citations": 0, "topics": [], "tags": [ "Databases", "Artificial Intelligence", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 2.99, "read_first_score": 4.33, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Unsupervised outlier detection is attractive because it eliminates the need for labeled data. Moreover, forming multi-model ensembles can improve detection robustness.", "key_contribution": "We propose MetaEns, an automatic unsupervised framework for selecting ensembles of outlier detection models.", "why_it_matters": "Automatic Unsupervised Ensemble Outlier Model Selection--Extended Version represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Databases.", "one_line_takeaway": "We propose MetaEns, an automatic unsupervised framework for selecting ensembles of outlier detection models.", "biggest_caveat": "However, composing an ensemble without labeled data is challenging.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Databases.", "url": "https://arxiv.org/abs/2605.16567", "difficulty": "intermediate" }, { "id": "arxiv:2604.08148v1", "source": "arxiv", "source_type": "preprint", "title": "Clickbait detection: quick inference with maximum impact", "abstract": "We propose a lightweight hybrid approach to clickbait detection that combines OpenAI semantic embeddings with six compact heuristic features capturing stylistic and informational cues. To improve efficiency, embeddings are reduced using PCA and evaluated with XGBoost, GraphSAGE, and GCN classifiers. While the simplified feature design yields slightly lower F1-scores, graph-based models achieve competitive performance with substantially reduced inference time. High ROC--AUC values further indicate strong discrimination capability, supporting reliable detection of clickbait headlines under varying decision thresholds.", "authors": [ "Soveatin Kuntur", "Panggih Kusuma Ningrum", "Anna Wróblewska", "Maria Ganzha", "Marcin Paprzycki" ], "year": 2026, "published_date": "2026-04-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.08148v1", "pdf_url": "https://arxiv.org/pdf/2604.08148v1", "citations": 0, "topics": [], "tags": [ "GNNs", "NLP", "GNN", "Graph Neural Networks" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (GNNs) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 2.99, "read_first_score": 2.72, "content_potential_score": 0.84, "interestingness_score": 1.92, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We propose a lightweight hybrid approach to clickbait detection that combines OpenAI semantic embeddings with six compact heuristic features capturing stylistic and informational cues. To improve efficiency, embeddings are reduced using PCA and evaluated with XGBoost, GraphSAGE, and GCN classifiers.", "key_contribution": "We propose a lightweight hybrid approach to clickbait detection that combines OpenAI semantic embeddings with six compact heuristic features capturing stylistic and informational cues.", "why_it_matters": "Clickbait detection: quick inference with maximum impact broadens the applicability of graph neural networks for structured data and relational reasoning.", "content_hook": "A new paper that could change how we think about GNNs.", "one_line_takeaway": "We propose a lightweight hybrid approach to clickbait detection that combines OpenAI semantic embeddings with six…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in GNNs.", "url": "http://arxiv.org/abs/2604.08148v1", "difficulty": "advanced" }, { "id": "arxiv:2604.10568v1", "source": "arxiv", "source_type": "preprint", "title": "ReadMOF: Structure-Free Semantic Embeddings from Systematic MOF Nomenclature for Machine Learning", "abstract": "Systematic chemical names, such as IUPAC-style nomenclature for metal-organic frameworks (MOFs), contain rich structural and compositional information in a standardized textual format. Here we introduce ReadMOF, which is, to our knowledge, the first nomenclature-free machine learning framework that leverages these names to model structure-property relationships without requiring atomic coordinates or connectivity graphs. By employing pretrained language models, ReadMOF converts systematic MOF names from the Cambridge Structural Database (CSD) into vector embeddings that closely represent traditional structure-based descriptors. These embeddings enable applications in materials informatics, including property prediction, similarity retrieval, and clustering, with performance comparable to geometry-dependent methods. When combined with large language models, ReadMOF also establishes chemically meaningful reasoning ability with textual input only. Our results show that structured chemical language, interpreted through modern natural language processing techniques, can provide a scalable, interpretable, and geometry-independent alternative to conventional molecular representations. This approach opens new opportunities for language-driven discovery in materials science.", "authors": [ "Kewei Zhu", "Cameron Wilson", "Bartosz Mazur", "Yi Li", "Ashleigh M. Chester", "Peyman Z. Moghadam" ], "year": 2026, "published_date": "2026-04-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.10568v1", "pdf_url": "https://arxiv.org/pdf/2604.10568v1", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Interpretability", "Interpretability & Explainability", "Reasoning & Chain-of-Thought" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 2.99, "read_first_score": 4.28, "content_potential_score": 1.42, "interestingness_score": 2.21, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Systematic chemical names, such as IUPAC-style nomenclature for metal-organic frameworks (MOFs), contain rich structural and compositional information in a standardized textual format. Here we introduce ReadMOF, which is, to our knowledge, the first nomenclature-free machine learning framework that leverages these names to model structure-property relationships without requiring atomic coordinates or connectivity graphs.", "key_contribution": "Here we introduce ReadMOF, which is, to our knowledge, the first nomenclature-free machine learning framework that leverages these names to model structure-property relationships without requiring atomic coordinates or connectivity graphs.", "why_it_matters": "ReadMOF: Structure-Free Semantic Embeddings from Systematic MOF Nomenclature for Machine Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "Here we introduce ReadMOF, which is, to our knowledge, the first nomenclature-free machine learning framework that…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "http://arxiv.org/abs/2604.10568v1", "difficulty": "intermediate" }, { "id": "arxiv:2605.30842", "source": "arxiv", "source_type": "preprint", "title": "CoMem: Context Management with A Decoupled Long-Context Model", "abstract": "Context management enables agentic models to solve long-horizon tasks through iterative summarization of previous interaction histories. However, this process typically incurs substantial decoding overhead for the extra summarization tokens, which significantly affect the end-to-end response latency at deployment. In this paper, we introduce CoMem, a novel framework that decouples memory management from the primary agent workflow, enabling these processes to execute in parallel. We propose a $k$-step-off asynchronous pipeline that overlaps the memory model's summarization with the agent's inference, effectively masking the latency of context processing. To ensure robustness under this asynchronous setting, we introduce a reward-driven training strategy that aligns the memory model to capture sufficient statistics for the agent's decision-making. Theoretical analysis confirms that CoMem offers a superior efficiency-effectiveness trade-off compared to coupled architectures. Our extensive experimental results on SWE-Bench-Verified show that CoMem provides 1.4x latency improvements upon vanilla long-context solutions while preserving most of the performance. Furthermore, we demonstrate that these latency gains scale favorably with increased system throughput, offering a modular path forward for the independent optimization of agent reasoning and memory compression.", "authors": [ "Yuwei Zhang", "Chengyu Dong", "Shuowei Jin", "Changlong Yu", "Hejie Cui", "Hongye Jin", "Xinyang Zhang", "Hamed Bonab", "Colin Lockard", "Jianshu Chen", "Zhenyu Shi", "Jingbo Shang", "Xian Li", "Bing Yin" ], "year": 2026, "published_date": "2026-05-29", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.30842", "pdf_url": "https://arxiv.org/pdf/2605.30842", "citations": 0, "topics": [], "tags": [ "Reasoning", "Long Context", "AI Agents", "Summarization", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Summarization) with no advanced math.", "maturity_stage": "emerging", "paper_score": 2.99, "read_first_score": 6.19, "content_potential_score": 1.0, "interestingness_score": 2.0, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Context management enables agentic models to solve long-horizon tasks through iterative summarization of previous interaction histories. However, this process typically incurs substantial decoding overhead for the extra summarization tokens, which significantly affect the end-to-end response latency at deployment.", "key_contribution": "In this paper, we introduce CoMem, a novel framework that decouples memory management from the primary agent workflow, enabling these processes to execute in parallel.", "why_it_matters": "CoMem: Context Management with A Decoupled Long-Context Model represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "In this paper, we introduce CoMem, a novel framework that decouples memory management from the primary agent workflow,…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2605.30842", "difficulty": "beginner" }, { "id": "arxiv:2410.14375", "source": "arxiv", "source_type": "preprint", "title": "Causal Fine-Tuning under Latent Confounded Shift", "abstract": "Adapting to latent confounded shift remains a core challenge in modern AI. This setting is driven by hidden variables that induce spurious correlations between inputs and outputs during training, leading models to rely on non-causal shortcuts. For example, a model may learn to treat metadata (e.g., data source like \"Amazon\") as a proxy for positive sentiment, causing failure when the source becomes predominantly negative during deployment. To address this latent confounded shift, we introduce Causal Fine-Tuning(CFT). Using a structural causal model as an inductive bias, we derive sufficient identification conditions that motivate a fine-tuning objective for decomposing representations into high-level stable and low-level shift-sensitive components. Instantiating this framework in BERT, we show that learning such causal/spurious representations and adjusting them accordingly yield a more robust predictor. Experiments on spurious correlation injection attacks in text demonstrate that our method outperforms black-box domain generalization baselines, highlighting the benefits of explicitly modeling causal structure.", "authors": [ "Jialin Yu", "Yuxiang Zhou", "Haoxuan Li", "Junchi Yu", "Mengyue Yang", "Yulan He", "Nevin L. Zhang", "Philip Torr", "Ricardo Silva" ], "year": 2026, "published_date": "2026-05-12", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2410.14375", "pdf_url": "https://arxiv.org/pdf/2410.14375", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Fairness & Ethics", "Machine Learning", "NLP" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 2.99, "read_first_score": 5.83, "content_potential_score": 1.0, "interestingness_score": 2.0, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Adapting to latent confounded shift remains a core challenge in modern AI. This setting is driven by hidden variables that induce spurious correlations between inputs and outputs during training, leading models to rely on non-causal shortcuts.", "key_contribution": "To address this latent confounded shift, we introduce Causal Fine-Tuning(CFT).", "why_it_matters": "Causal Fine-Tuning under Latent Confounded Shift represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "To address this latent confounded shift, we introduce Causal Fine-Tuning(CFT).", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2410.14375", "difficulty": "intermediate" }, { "id": "arxiv:2605.07450", "source": "arxiv", "source_type": "preprint", "title": "LoBoFit: Flexible Garment Refitting via Local Bone Mapping Blending", "abstract": "Garment refitting, the task of adapting a garment from a source to a target avatar, must preserve the original design features and fine-scale wrinkles, a challenge exacerbated by significant shape variations and varying poses without registration to a shared canonical pose. Existing methods struggle to balance robustness, efficiency, and fidelity of detail: physics-based simulation is costly, data-driven approaches lack generalizability, and geometry optimization in the full vertex space is often ill-conditioned and prone to local minima with unsatisfactory quality. We identify that a fundamental limitation lies in the representation: deforming garments directly in global coordinates couples vertices non-locally, creating a complex and poorly-structured optimization landscape. Therefore, we introduce LoBoFit, a robust refitting method built upon a novel Local Bone Mapping Blending (LoBoMap Blending) representation. Instead of manipulating global vertex positions, LoBoMap Blending expresses garment geometry as a linear blend of its mappings into local bone coordinate frames. This representation is highly expressive and flexible: local bone mappings yield a pose-robust initialization and a well-conditioned parameterization, while blending weights smooth the optimization landscape and broaden the space of plausible solutions for stable convergence with fine-scale detail preservation. The subsequent refinement efficiently resolves collisions and preserves details by optimizing localized residuals, effectively decomposing the complex global deformation into manageable subproblems. Our experiments demonstrate that LoBoFit reliably refits high-resolution, single- and multi-layer garments across avatars with large shape and topological differences, while faithfully preserving intricate wrinkles and the intended fit style, outperforming state-of-the-art methods in robustness and output quality.", "authors": [ "Meng Zhang", "Yu Xin", "Feiya Guo", "Kaizhang Kang", "Mengyu Chu", "Ruizhen Hu" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.07450", "pdf_url": "https://arxiv.org/pdf/2605.07450", "citations": 0, "topics": [], "tags": [ "Computer Graphics" ], "paper_type": "theory", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 2.99, "read_first_score": 5.73, "content_potential_score": 0.0, "interestingness_score": 1.5, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Garment refitting, the task of adapting a garment from a source to a target avatar, must preserve the original design features and fine-scale wrinkles, a challenge exacerbated by significant shape variations and varying poses without registration to a shared canonical pose. Existing methods struggle to balance robustness, efficiency, and fidelity of detail: physics-based simulation is costly, data-driven approaches lack generalizability, and geometry optimization in the full vertex space is often ill-conditioned and prone to local minima with unsatisfactory quality.", "key_contribution": "Therefore, we introduce LoBoFit, a robust refitting method built upon a novel Local Bone Mapping Blending (LoBoMap Blending) representation.", "why_it_matters": "LoBoFit: Flexible Garment Refitting via Local Bone Mapping Blending represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Computer Graphics.", "one_line_takeaway": "Therefore, we introduce LoBoFit, a robust refitting method built upon a novel Local Bone Mapping Blending (LoBoMap…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Computer Graphics.", "url": "https://arxiv.org/abs/2605.07450", "difficulty": "intermediate" }, { "id": "arxiv:2608.20418", "source": "arxiv", "source_type": "preprint", "title": "Rigorous Evaluation of Large Language Models for Malaria Drug Discovery: Trade-offs in Performance, Scale, and Resource Utility", "abstract": "We introduce Malaria-Instruct, a curated instruction-following dataset derived from the ChEMBL Legacy Malaria corpus for Malaria virtual screening, and conduct a systematic evaluation of five open-source LLMs; Gemma-2 2B/9B, TxGemma-2B/9B, and LlaSMol-Mistral-7B, on a rigorous out-of-distribution data split. Performance was benchmarked against classical ML models (Random Forest, XGBoost) and frontier proprietary models (Gemini 2.5, OpenAI o3) under few-shot conditions. Fine-tuned LLMs substantially outperformed all baselines: TxGemma-9B achieved the highest ROC-AUC ($0.731 \\pm 0.005$) and LlaSMol-Mistral-7B the best enrichment factor (EF@1\\% $\\approx$ 4.99). Domain-specific fine-tuning proved categorically indispensable with TxGemma-9B collapsing from ROC-AUC 0.731 to 0.499, under its best few-shot condition, and neither Gemini 2.5 (ROC-AUC $\\approx$ 0.53) nor o3 (ROC-AUC $\\approx$ 0.59) achieved reliable discrimination without fine-tuning. Biomedical pretraining conferred a measurable advantage at equivalent scale, while chemistry-aware pretraining yielded superior prospective enrichment. Fine-tuned open-source LLMs represent a compelling, resource-efficient paradigm for antimalarial VS, outperforming both classical pipelines and proprietary reasoning models under structurally challenging conditions.", "authors": [ "Marvellous O. Ajala", "Zainab Ashimiyu-Abdusalam", "Comfort Adesina" ], "year": 2026, "published_date": "2026-08-18", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.20418", "pdf_url": "https://arxiv.org/pdf/2608.20418", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Prompting", "Fine-Tuning", "Self-Supervised" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Uses pretraining — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 2.98, "read_first_score": 4.21, "content_potential_score": 1.92, "interestingness_score": 2.45, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce Malaria-Instruct, a curated instruction-following dataset derived from the ChEMBL Legacy Malaria corpus for Malaria virtual screening, and conduct a systematic evaluation of five open-source LLMs; Gemma-2 2B/9B, TxGemma-2B/9B, and LlaSMol-Mistral-7B, on a rigorous out-of-distribution data split. Performance was benchmarked against classical ML models (Random Forest, XGBoost) and frontier proprietary models (Gemini 2.5, OpenAI o3) under few-shot conditions.", "key_contribution": "We introduce Malaria-Instruct, a curated instruction-following dataset derived from the ChEMBL Legacy Malaria corpus for Malaria virtual screening, and conduct a systematic evaluation of five open-source LLMs; Gemma-2 2B/9B, TxGemma-2B/9B, and LlaSMol-Mistral-7B, on a rigorous out-of-distribution data split.", "why_it_matters": "Rigorous Evaluation of Large Language Models for Malaria Drug Discovery: Trade-offs in Performance, Scale, and Resource Utility represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Malaria-Instruct, a curated instruction-following dataset derived from the ChEMBL Legacy Malaria corpus…", "biggest_caveat": "bution data split.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2608.20418", "difficulty": "advanced" }, { "id": "arxiv:2506.07449", "source": "arxiv", "source_type": "preprint", "title": "LlamaRec-LKG-RAG: A Single-Pass, Learnable Knowledge Graph-RAG Framework for LLM-Based Ranking", "abstract": "Recent advances in Large Language Models (LLMs) have driven their adoption in recommender systems through Retrieval-Augmented Generation (RAG) frameworks. However, existing RAG approaches predominantly rely on flat, similarity-based retrieval that fails to leverage the rich relational structure inherent in user-item interactions. We introduce LlamaRec-LKG-RAG, a novel single-pass, end-to-end trainable framework that integrates personalized knowledge graph context into LLM-based recommendation ranking. Our approach extends the LlamaRec architecture by incorporating a lightweight user preference module that identifies salient relation paths within a heterogeneous knowledge graph constructed from user behavior and item metadata. These personalized subgraphs are seamlessly integrated into prompts for a fine-tuned Llama-2 model, enabling efficient and interpretable recommendations through a unified inference step. Comprehensive experiments on ML-100K and Amazon Beauty datasets demonstrate consistent improvements over LlamaRec across key ranking metrics (MRR, NDCG, Recall). LlamaRec-LKG-RAG demonstrates the critical value of structured reasoning in LLM-based recommendations and establishes a foundation for scalable, knowledge-aware personalization in next-generation recommender systems. Code is available at~\\href{https://github.com/VahidAz/LlamaRec-LKG-RAG}{repository}.", "authors": [ "Vahid Azizi", "Fatemeh Koochaki" ], "year": 2026, "published_date": "2026-08-14", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2506.07449", "pdf_url": "https://arxiv.org/pdf/2506.07449", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "Fine-Tuning", "RAG", "Knowledge Graphs" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 2.98, "read_first_score": 5.0, "content_potential_score": 1.42, "interestingness_score": 2.2, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Recent advances in Large Language Models (LLMs) have driven their adoption in recommender systems through Retrieval-Augmented Generation (RAG) frameworks. However, existing RAG approaches predominantly rely on flat, similarity-based retrieval that fails to leverage the rich relational structure inherent in user-item interactions.", "key_contribution": "We introduce LlamaRec-LKG-RAG, a novel single-pass, end-to-end trainable framework that integrates personalized knowledge graph context into LLM-based recommendation ranking.", "why_it_matters": "LlamaRec-LKG-RAG: A Single-Pass, Learnable Knowledge Graph-RAG Framework for LLM-Based Ranking represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce LlamaRec-LKG-RAG, a novel single-pass, end-to-end trainable framework that integrates personalized…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2506.07449", "difficulty": "intermediate" }, { "id": "arxiv:2607.29463", "source": "arxiv", "source_type": "preprint", "title": "Weight-Space Mixture-of-Experts for Implicit Neural Representation Classification", "abstract": "Implicit Neural Representations (INRs) encode signals as the weights of a coordinate-based neural network and have recently been proposed as an alternative domain for downstream learning. While promising, classification directly in weight space remains challenging due to the high dimensionality and complex structure of INR parameters. Furthermore, the way discriminative information is distributed across INR weights remains poorly understood. We propose a hierarchical Mixture-of-Experts (HMoE) Transformer that processes INR weights using conditional computation aligned with the structure of the underlying implicit network. Coupled with a meta-learning framework that shapes INR parameters for downstream tasks, our model achieves state-of-the-art accuracy across standard benchmarks, ranging from low-resolution datasets to high-resolution ImageNet-1K. To gain insight into how INRs encode discriminative information, we develop weight-space attribution and pruning methods that identify parameters most relevant for classification. These analyses reveal how class-specific structure emerges within INR layers and support the suitability of MoE architectures for weight-space learning. Our approach advances both the performance and interpretability of weight-space classifiers.", "authors": [ "Stanislaw Janik", "Michal Byra" ], "year": 2026, "published_date": "2026-07-31", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.29463", "pdf_url": "https://arxiv.org/pdf/2607.29463", "citations": 0, "topics": [], "tags": [ "MoE", "Transformers", "Model Compression", "Interpretability", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 2.98, "read_first_score": 6.99, "content_potential_score": 0.0, "interestingness_score": 1.49, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Implicit Neural Representations (INRs) encode signals as the weights of a coordinate-based neural network and have recently been proposed as an alternative domain for downstream learning. While promising, classification directly in weight space remains challenging due to the high dimensionality and complex structure of INR parameters.", "key_contribution": "We propose a hierarchical Mixture-of-Experts (HMoE) Transformer that processes INR weights using conditional computation aligned with the structure of the underlying implicit network.", "why_it_matters": "Weight-Space Mixture-of-Experts for Implicit Neural Representation Classification represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about MoE.", "one_line_takeaway": "We propose a hierarchical Mixture-of-Experts (HMoE) Transformer that processes INR weights using conditional…", "biggest_caveat": "buted across INR weights remains poorly understood.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in MoE.", "url": "https://arxiv.org/abs/2607.29463", "difficulty": "beginner" }, { "id": "arxiv:2607.22209", "source": "arxiv", "source_type": "preprint", "title": "Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus", "abstract": "In blockchain systems, peer-to-peer (P2P) overlay networks play a crucial role in providing reliable, scalable and efficient message-delivery services to upper layers. However, the consensus layer and the underlying P2P network remain mutually opaque in existing blockchains, waiving the opportunity for further improvement. In contrast to other P2P applications, blockchain can naturally be abstracted as a state machine. We therefore leverage this abstraction to record network topologies and latencies in a trusted and coordinated manner. With this support, we propose three improvements to rotating-leader consensus protocols and their underlying P2P networks: (1) accelerating leader rotation; (2) introducing a reliable-broadcast paradigm that employs tree-based dissemination in the normal case and falls back to gossip only when necessary; and (3) constructing latency-aware dissemination trees. We integrate the above ideas into Tendermint and libp2p, and conduct empirical evaluation on Amazon EC2 platform using up to 300 nodes distributed across 10 regions. The results demonstrate that, compared with gossip-based dissemination over the same topology, our prototype improves peak throughput by up to $7.26\\times$.", "authors": [ "Yifeng Ye", "Rongji Huang", "Gerui Wang", "Mingchao Wan", "Yuxing Duan", "Jingjing Zhang", "Shengyun Liu" ], "year": 2026, "published_date": "2026-07-24", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2607.22209", "pdf_url": "https://arxiv.org/pdf/2607.22209", "citations": 0, "topics": [], "tags": [ "Info Extraction", "Distributed Computing" ], "paper_type": "systems", "difficulty_level": "L4", "difficulty_reason": "Requires deep theoretical background — uses topology and related concepts.", "maturity_stage": "emerging", "paper_score": 2.98, "read_first_score": 3.27, "content_potential_score": 1.0, "interestingness_score": 1.99, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "In blockchain systems, peer-to-peer (P2P) overlay networks play a crucial role in providing reliable, scalable and efficient message-delivery services to upper layers. However, the consensus layer and the underlying P2P network remain mutually opaque in existing blockchains, waiving the opportunity for further improvement.", "key_contribution": "With this support, we propose three improvements to rotating-leader consensus protocols and their underlying P2P networks: (1) accelerating leader rotation; (2) introducing a reliable-broadcast paradigm that employs tree-based dissemination in the normal case and falls back to gossip only when necessary; and (3) constructing latency-aware dissemination trees.", "why_it_matters": "Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Info Extraction.", "one_line_takeaway": "With this support, we propose three improvements to rotating-leader consensus protocols and their underlying P2P…", "biggest_caveat": "However, the consensus layer and the underlying P2P network remain mutually opaque in existing blockchains, waiving the opportunity for further improvement.", "read_this_if": "Read this if you are a researcher at the frontier and want to understand recent progress in Info Extraction.", "url": "https://arxiv.org/abs/2607.22209", "difficulty": "frontier" }, { "id": "arxiv:2602.14761", "source": "arxiv", "source_type": "preprint", "title": "Universal Algorithm-Implicit Learning", "abstract": "Current meta-learning methods are constrained to narrow task distributions with fixed feature and label spaces, limiting applicability. Moreover, the current meta-learning literature uses key terms like \"universal\" and \"general-purpose\" inconsistently and lacks precise definitions, hindering comparability. We introduce a theoretical framework for meta-learning which formally defines practical universality and introduces a distinction between algorithm-explicit and algorithm-implicit learning, providing a principled vocabulary for reasoning about universal meta-learning methods. Guided by this framework, we present TAIL, a transformer-based algorithm-implicit meta-learner that functions across tasks with varying domains, modalities, and label configurations. TAIL features three innovations over prior transformer-based meta-learners: random projections for cross-modal feature encoding, random injection label embeddings that extrapolate to larger label spaces, and efficient inline query processing. TAIL achieves state-of-the-art performance on standard few-shot benchmarks while generalizing to unseen domains. Unlike other meta-learning methods, it also generalizes to unseen modalities, solving text classification tasks despite training exclusively on images, handles tasks with up to 20$\\times$ more classes than seen during training, and provides orders-of-magnitude computational savings over prior transformer-based approaches.", "authors": [ "Stefano Woerner", "Seong Joon Oh", "Christian F. Baumgartner" ], "year": 2026, "published_date": "2026-07-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2602.14761", "pdf_url": "https://arxiv.org/pdf/2602.14761", "citations": 0, "topics": [], "tags": [ "Reasoning", "Prompting", "Multimodal", "Info Extraction", "Classification" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Classification, Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 2.98, "read_first_score": 7.16, "content_potential_score": 1.65, "interestingness_score": 2.31, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Current meta-learning methods are constrained to narrow task distributions with fixed feature and label spaces, limiting applicability. Moreover, the current meta-learning literature uses key terms like \"universal\" and \"general-purpose\" inconsistently and lacks precise definitions, hindering comparability.", "key_contribution": "We introduce a theoretical framework for meta-learning which formally defines practical universality and introduces a distinction between algorithm-explicit and algorithm-implicit learning, providing a principled vocabulary for reasoning about universal meta-learning methods.", "why_it_matters": "Universal Algorithm-Implicit Learning represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Reasoning.", "one_line_takeaway": "We introduce a theoretical framework for meta-learning which formally defines practical universality and introduces a…", "biggest_caveat": "butions with fixed feature and label spaces, limiting applicability.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Reasoning.", "url": "https://arxiv.org/abs/2602.14761", "difficulty": "beginner" }, { "id": "arxiv:2604.24182v1", "source": "arxiv", "source_type": "preprint", "title": "$M^2$-VLA: Boosting Vision-Language Models for Generalizable Manipulation via Layer Mixture and Meta-Skills", "abstract": "Current Vision-Language-Action (VLA) models predominantly rely on end-to-end fine-tuning. While effective, this paradigm compromises the inherent generalization capabilities of Vision-Language Models (VLMs) and incurs catastrophic forgetting. To address these limitations, we propose $M^2$-VLA, which demonstrates that a generalized VLM is able to serve as a powerful backbone for robotic manipulation directly. However, it remains a key challenge to bridge the gap between the high-level semantic understanding of VLMs and the precise requirements of robotic control. To overcome this, we introduce the Mixture of Layers (MoL) strategy that selectively extracts task-critical information from dense semantic features. Furthermore, to facilitate efficient trajectory learning under constrained model capacity, we propose a Meta Skill Module (MSM) that integrates strong inductive biases. Extensive experiments in both simulated and real-world environments demonstrate the effectiveness of our approach. Furthermore, generalization and ablation studies validate the architecture's zero-shot capabilities and confirm the contribution of each key component. Our code and pre-trained models will be made publicly available.", "authors": [ "Siyao Xiao", "Yuhong Zhang", "Zhifang Liu", "Zihan Gao", "Jingye Zhang", "Sinwai Choo", "Dake Zhong", "Mengzhe Wang", "Xiao Lin", "Xianfeng Zhou", "Jia Jia", "Haoqian Wang" ], "year": 2026, "published_date": "2026-04-27", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "http://arxiv.org/abs/2604.24182v1", "pdf_url": "https://arxiv.org/pdf/2604.24182v1", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "VLMs", "Continual Learning", "Robotics", "Fairness & Ethics" ], "paper_type": "methods", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (Continual Learning) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 2.98, "read_first_score": 4.89, "content_potential_score": 0.0, "interestingness_score": 1.49, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Current Vision-Language-Action (VLA) models predominantly rely on end-to-end fine-tuning. While effective, this paradigm compromises the inherent generalization capabilities of Vision-Language Models (VLMs) and incurs catastrophic forgetting.", "key_contribution": "To address these limitations, we propose $M^2$-VLA, which demonstrates that a generalized VLM is able to serve as a powerful backbone for robotic manipulation directly.", "why_it_matters": "$M^2$-VLA: Boosting Vision-Language Models for Generalizable Manipulation via Layer Mixture and Meta-Skills represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "To address these limitations, we propose $M^2$-VLA, which demonstrates that a generalized VLM is able to serve as a…", "biggest_caveat": "limitations, we propose $M^2$-VLA, which demonstrates that a generalized VLM is able to serve as a powerful backbone for robotic manipulation directly.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Fine-Tuning.", "url": "http://arxiv.org/abs/2604.24182v1", "difficulty": "advanced" }, { "id": "arxiv:2505.19699", "source": "arxiv", "source_type": "preprint", "title": "Mosaic: Data-Free Knowledge Distillation via Mixture-of-Experts for Heterogeneous Distributed Environments", "abstract": "Federated Learning (FL) is a decentralized machine learning paradigm that enables clients to collaboratively train models while preserving data privacy. However, the coexistence of model and data heterogeneity gives rise to inconsistent representations and divergent optimization dynamics across clients, ultimately hindering robust global performance. To transcend these challenges, we propose Mosaic, a novel data-free knowledge distillation framework tailored for heterogeneous distributed environments. Mosaic first trains local generative models to approximate each client's personalized distribution, enabling synthetic data generation that safeguards privacy through strict separation from real data. Subsequently, Mosaic forms a Mixture-of-Experts (MoE) from client models based on their specialized knowledge, and distills it into a global model using the generated data. To further enhance the MoE architecture, Mosaic integrates expert predictions via a lightweight meta model trained on a few representative prototypes. Extensive experiments on standard image and multimodal benchmarks demonstrate that Mosaic consistently outperforms state-of-the-art approaches under both model and data heterogeneity. The source code has been published at https://github.com/Wings-Of-Disaster/Mosaic.", "authors": [ "Junming Liu", "Yanting Gao", "Yuqi Li", "Siyuan Meng", "Yifei Sun", "Aoqi Wu", "Yirong Chen", "Ding Wang", "Shiping Wen" ], "year": 2026, "published_date": "2026-06-13", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2505.19699", "pdf_url": "https://arxiv.org/pdf/2505.19699", "citations": 0, "topics": [], "tags": [ "MoE", "Multimodal", "Model Compression", "Federated Learning", "Evaluation" ], "paper_type": "methods", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 2.98, "read_first_score": 4.94, "content_potential_score": 0.0, "interestingness_score": 1.49, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Federated Learning (FL) is a decentralized machine learning paradigm that enables clients to collaboratively train models while preserving data privacy. However, the coexistence of model and data heterogeneity gives rise to inconsistent representations and divergent optimization dynamics across clients, ultimately hindering robust global performance.", "key_contribution": "To transcend these challenges, we propose Mosaic, a novel data-free knowledge distillation framework tailored for heterogeneous distributed environments.", "why_it_matters": "Mosaic: Data-Free Knowledge Distillation via Mixture-of-Experts for Heterogeneous Distributed Environments represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about MoE.", "one_line_takeaway": "To transcend these challenges, we propose Mosaic, a novel data-free knowledge distillation framework tailored for…", "biggest_caveat": "buted environments.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in MoE.", "url": "https://arxiv.org/abs/2505.19699", "difficulty": "beginner" }, { "id": "arxiv:2601.21632", "source": "arxiv", "source_type": "preprint", "title": "Sustainable Open-Source AI Requires Tracking the Cumulative Footprint of Derivatives", "abstract": "Open-source AI is scaling rapidly, and model hubs now host millions of artifacts. Each foundation model can spawn large numbers of fine-tunes, adapters, quantizations, merges, and forks. We take the position that compute efficiency alone is insufficient for sustainability in open-source AI: lower per-run costs can accelerate experimentation and deployment, increasing aggregate environmental footprint unless impacts are measurable and comparable across derivative lineages. However, the energy use, water consumption, and emissions of these derivative lineages are rarely measured or disclosed in a consistent, comparable manner, leaving ecosystem-level impact largely invisible. We argue that sustainable open-source AI requires coordination infrastructure that tracks impacts across model lineages, not only base models. We propose Data and Impact Accounting (DIA), a lightweight, non-restrictive transparency layer that (i) standardizes carbon and water reporting metadata, (ii) integrates low-friction measurement into common training and inference pipelines, and (iii) aggregates reports through public dashboards to summarize cumulative impacts across releases and derivatives. DIA makes derivative costs visible and supports ecosystem-level accountability while preserving openness. https://vectorinstitute.github.io/ai-impact-accounting/", "authors": [ "Shaina Raza", "Iuliia Zarubiieva", "Ahmed Y. Radwan", "Nate Lesperance", "Deval Pandya", "Sedef Akinli Kocak", "Graham W. Taylor" ], "year": 2026, "published_date": "2026-05-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.21632", "pdf_url": "https://arxiv.org/pdf/2601.21632", "citations": 0, "topics": [], "tags": [ "Fine-Tuning", "Info Extraction", "Model Compression" ], "paper_type": "systems", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 2.98, "read_first_score": 4.36, "content_potential_score": 1.0, "interestingness_score": 1.99, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Open-source AI is scaling rapidly, and model hubs now host millions of artifacts. Each foundation model can spawn large numbers of fine-tunes, adapters, quantizations, merges, and forks.", "key_contribution": "We propose Data and Impact Accounting (DIA), a lightweight, non-restrictive transparency layer that (i) standardizes carbon and water reporting metadata, (ii) integrates low-friction measurement into common training and inference pipelines, and (iii) aggregates reports through public dashboards to summarize cumulative impacts across releases and derivatives.", "why_it_matters": "Sustainable Open-Source AI Requires Tracking the Cumulative Footprint of Derivatives represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Fine-Tuning.", "one_line_takeaway": "We propose Data and Impact Accounting (DIA), a lightweight, non-restrictive transparency layer that (i) standardizes…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Fine-Tuning.", "url": "https://arxiv.org/abs/2601.21632", "difficulty": "intermediate" }, { "id": "arxiv:2606.07695", "source": "arxiv", "source_type": "preprint", "title": "DSFNet: Learning Dual-Domain Spectral Operators for Multi-Modality Spatio-Temporal Forecasting in Urban Transportation Systems", "abstract": "Multi-Modality Spatio-Temporal Forecasting (MoSTF) extends traditional spatio-temporal forecasting by incorporating diverse traffic modalities. Despite significant recent strides in spatio-temporal modeling, existing approaches often fail to explicitly model the coupling relationships between different modality variables. Accurate MoSTF is challenging, as it requires modeling (1) temporal dynamic heterogeneity under exogenous influences and (2) heterogeneous spatial dependencies alongside complex cross-variable couplings. To address these challenges, we propose the Dual-Domain Spectral Filtering Network (DSFNet). Our framework employs dual-domain spectral filtering to capture heterogeneous spatial patterns and explicitly model the relationships between variables. Unlike graph-based message passing or dense attention over node-modality pairs, DSFNet factorizes space-modality interactions into feature-domain and spatial-domain spectral operators, enabling scalable modeling of nonlocal dependencies and cross-modality couplings. Furthermore, we introduce an external gating mechanism to adaptively regulate temporal dynamics under external influences. We validate our method through extensive experiments on five representative real-world traffic datasets. Compared with the second-best baselines, DSFNet reduces MAE by 3.21%-10.16% across these datasets. The results demonstrate that DSFNet significantly outperforms existing state-of-the-art baselines in accuracy while exhibiting efficiency and robustness.", "authors": [ "Yongchao Li", "Yang Li", "Zhuoxuan Li", "Jun Chen", "Chu Zhang", "Jinde Cao", "Leszek Rutkowski" ], "year": 2026, "published_date": "2026-06-05", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2606.07695", "pdf_url": "https://arxiv.org/pdf/2606.07695", "citations": 0, "topics": [], "tags": [ "Multimodal", "GNNs", "Artificial Intelligence", "Machine Learning" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (GNNs) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 2.98, "read_first_score": 4.85, "content_potential_score": 1.0, "interestingness_score": 1.99, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Multi-Modality Spatio-Temporal Forecasting (MoSTF) extends traditional spatio-temporal forecasting by incorporating diverse traffic modalities. Despite significant recent strides in spatio-temporal modeling, existing approaches often fail to explicitly model the coupling relationships between different modality variables.", "key_contribution": "To address these challenges, we propose the Dual-Domain Spectral Filtering Network (DSFNet).", "why_it_matters": "DSFNet: Learning Dual-Domain Spectral Operators for Multi-Modality Spatio-Temporal Forecasting in Urban Transportation Systems represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "To address these challenges, we propose the Dual-Domain Spectral Filtering Network (DSFNet).", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2606.07695", "difficulty": "advanced" }, { "id": "arxiv:2604.27462", "source": "arxiv", "source_type": "preprint", "title": "Improving Graph Few-shot Learning with Hyperbolic Space and Denoising Diffusion", "abstract": "Graph few-shot learning, which focuses on effectively learning from only a small number of labeled nodes to quickly adapt to new tasks, has garnered significant research attention. Despite recent advances in graph few-shot learning that have demonstrated promising performance, existing methods still suffer from several key limitations. First, during the meta-training phase, these methods typically perform node representation learning in Euclidean space, which often fails to capture the inherently hierarchical structure existing in real-world graph data. Second, during the meta-testing phase, they usually fit an empirical target distribution derived from only a few support samples, even when this distribution significantly deviates from the true underlying distribution. To address these issues, we propose IMPRESS, a novel framework that IMproves graPh few-shot learning with hypeRbolic spacE and denoiSing diffuSion. Specifically, our model learns node representations in a hyperbolic space and enriches the support distribution through denoising diffusion mechanisms. Theoretically, IMPRESS achieves a tighter generalization bound. Empirically, IMPRESS consistently outperforms competitive baselines across multiple benchmark datasets.", "authors": [ "Yonghao Liu", "Jialu Sun", "Wei Pang", "Fausto Giunchiglia", "Ximing Li", "Xiaoyue Feng", "Renchu Guan" ], "year": 2026, "published_date": "2026-04-30", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2604.27462", "pdf_url": "https://arxiv.org/pdf/2604.27462", "citations": 0, "topics": [], "tags": [ "Prompting", "Diffusion", "Self-Supervised", "Evaluation", "Machine Learning" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation, Prompting) with no advanced math.", "maturity_stage": "emerging", "paper_score": 2.98, "read_first_score": 6.11, "content_potential_score": 1.5, "interestingness_score": 2.24, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Graph few-shot learning, which focuses on effectively learning from only a small number of labeled nodes to quickly adapt to new tasks, has garnered significant research attention. Despite recent advances in graph few-shot learning that have demonstrated promising performance, existing methods still suffer from several key limitations.", "key_contribution": "To address these issues, we propose IMPRESS, a novel framework that IMproves graPh few-shot learning with hypeRbolic spacE and denoiSing diffuSion.", "why_it_matters": "Improving Graph Few-shot Learning with Hyperbolic Space and Denoising Diffusion represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Prompting.", "one_line_takeaway": "To address these issues, we propose IMPRESS, a novel framework that IMproves graPh few-shot learning with hypeRbolic…", "biggest_caveat": "bution derived from only a few support samples, even when this distribution significantly deviates from the true underlying distribution.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in Prompting.", "url": "https://arxiv.org/abs/2604.27462", "difficulty": "beginner" }, { "id": "arxiv:2605.20766", "source": "arxiv", "source_type": "preprint", "title": "Diffuse to Detect: Bi-Level Sample Rebalancing with Pseudo-Label Diffusion for Point-Supervised Infrared Small-Target Detection", "abstract": "Point supervision has become a scalable solution to address dense annotation for infrared small target detection, but its performance is limited by two coupled bottlenecks: unstable pseudo-label evolution in cluttered, low-contrast infrared imagery and severe sample-distribution imbalance. In this paper, we present a more adaptive and stable framework to address these issues. Leveraging the intrinsic consistency between thermal radiation patterns and heat diffusion, we propose a physics-induced annotation strategy that expands single-point labels into reliable pseudo-masks. To further enhance supervision and alleviate sample imbalance, we develop a bi-level dual-update framework that jointly optimizes detector weights, sample weights, and diffusion parameters. A meta-classifier dynamically predicts sample-wise loss weights, while a differentiable diffusion module refines pseudo-labels with detection feedback, enabling adaptive interaction between training and hyperparameter optimization. Extensive experiments across multiple datasets demonstrate five-fold annotation acceleration, superior detection accuracy, and comparable performance with 30% of the training data, validating the efficiency and practicality of our approach. Our code is available at https://github.com/yuanhang-yao/diffuse-to-detect.", "authors": [ "Zhu Liu", "Yuanhang Yao", "Ping Qian", "Zihang Chen", "Risheng Liu" ], "year": 2026, "published_date": "2026-05-20", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.20766", "pdf_url": "https://arxiv.org/pdf/2605.20766", "citations": 0, "topics": [], "tags": [ "Computer Vision" ], "paper_type": "dataset", "difficulty_level": "L3", "difficulty_reason": "Uses hyperparameter — requires solid ML/DL background.", "maturity_stage": "emerging", "paper_score": 2.98, "read_first_score": 5.4, "content_potential_score": 1.5, "interestingness_score": 2.24, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Point supervision has become a scalable solution to address dense annotation for infrared small target detection, but its performance is limited by two coupled bottlenecks: unstable pseudo-label evolution in cluttered, low-contrast infrared imagery and severe sample-distribution imbalance. In this paper, we present a more adaptive and stable framework to address these issues.", "key_contribution": "In this paper, we present a more adaptive and stable framework to address these issues.", "why_it_matters": "Diffuse to Detect: Bi-Level Sample Rebalancing with Pseudo-Label Diffusion for Point-Supervised Infrared Small-Target Detection advances machine perception, enabling better visual understanding in real-world applications.", "content_hook": "A new paper that could change how we think about Computer Vision.", "one_line_takeaway": "In this paper, we present a more adaptive and stable framework to address these issues.", "biggest_caveat": "bution imbalance.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in Computer Vision.", "url": "https://arxiv.org/abs/2605.20766", "difficulty": "advanced" }, { "id": "arxiv:2605.10966", "source": "arxiv", "source_type": "preprint", "title": "MMTB: Evaluating Terminal Agents on Multimedia-File Tasks", "abstract": "Terminals provide a powerful interface for AI agents by exposing diverse tools for automating complex workflows, yet existing terminal-agent benchmarks largely focus on tasks grounded in text, code, and structured files. However, many real-world workflows require practitioners to work directly with audio and video files. Working with such multimedia files calls for terminal agents not only to understand multimedia content, but also to convert auditory and visual evidence across related files into appropriate actions. To evaluate terminal agents on multimedia-file tasks, we introduce MultiMedia-TerminalBench (MMTB), a benchmark of 105 tasks across 5 meta-categories where terminal agents directly operate with audio and video files. Alongside MMTB, we propose Terminus-MM, a multimedia harness that extends Terminus-KIRA with audio and video perception for terminal agents. Together, MMTB and Terminus-MM support a controlled study of multimedia terminal agents, revealing how different forms of multimedia access shape task outcomes and determine which evidence agents rely on to construct executable terminal workflows. MMTB media and metadata are released at https://huggingface.co/datasets/mm-tbench/mmtb-media", "authors": [ "Chiyeong Heo", "Jaechang Kim", "Junhyuk Kwon", "Hoyoung Kim", "Dongmin Park", "Jonghyun Lee", "Jungseul Ok" ], "year": 2026, "published_date": "2026-05-08", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2605.10966", "pdf_url": "https://arxiv.org/pdf/2605.10966", "citations": 0, "topics": [], "tags": [ "AI Agents", "Evaluation", "Artificial Intelligence", "Multimedia" ], "paper_type": "benchmark", "difficulty_level": "L1", "difficulty_reason": "Applied NLP/ML topic (Evaluation) with no advanced math.", "maturity_stage": "emerging", "paper_score": 2.98, "read_first_score": 6.12, "content_potential_score": 1.5, "interestingness_score": 2.24, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Terminals provide a powerful interface for AI agents by exposing diverse tools for automating complex workflows, yet existing terminal-agent benchmarks largely focus on tasks grounded in text, code, and structured files. However, many real-world workflows require practitioners to work directly with audio and video files.", "key_contribution": "To evaluate terminal agents on multimedia-file tasks, we introduce MultiMedia-TerminalBench (MMTB), a benchmark of 105 tasks across 5 meta-categories where terminal agents directly operate with audio and video files.", "why_it_matters": "MMTB: Evaluating Terminal Agents on Multimedia-File Tasks represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about AI Agents.", "one_line_takeaway": "To evaluate terminal agents on multimedia-file tasks, we introduce MultiMedia-TerminalBench (MMTB), a benchmark of 105…", "biggest_caveat": "However, many real-world workflows require practitioners to work directly with audio and video files.", "read_this_if": "Read this if you are a beginner and want to understand recent progress in AI Agents.", "url": "https://arxiv.org/abs/2605.10966", "difficulty": "beginner" }, { "id": "arxiv:2601.08403", "source": "arxiv", "source_type": "preprint", "title": "Owen-Shapley Policy Optimization: A Principled RL Algorithm for Generative Search LLMs", "abstract": "Large language models are increasingly trained via reinforcement learning for personalized recommendation tasks, but standard methods like GRPO rely on sparse, sequence-level rewards. These obscure which tokens actually contribute to high-quality outputs, creating a credit assignment gap. This gap is especially problematic when models must infer latent user intent from under-specified language without ground truth labels, which is a reasoning pattern rarely seen during pretraining but commonly required in deployment. We introduce Owen-Shapley Policy Optimization (OSPO), a framework that redistributes sequence-level advantages based on tokens' marginal contributions to outcomes. OSPO transforms task feedback into potential-based reward shaping via Shapley-Owen attributions to assign segment-level credit while preserving the optimal policy, all without parametric value models. By forming coalitions of semantically coherent units (e.g., phrases describing product attributes or sentences capturing preferences), OSPO identifies which response parts drive performance. Experiments on Amazon ESCI and H&M Fashion datasets including controlled generation tasks show consistent gains over baselines and notable test-time robustness to out-of-distribution retrievers unseen during training.", "authors": [ "Abhijnan Nath", "Alireza Bagheri Garakani", "Tianchen Zhou", "Fan Yang", "Yan Gao", "Nikhil Krishnaswamy" ], "year": 2026, "published_date": "2026-05-07", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2601.08403", "pdf_url": "https://arxiv.org/pdf/2601.08403", "citations": 0, "topics": [], "tags": [ "LLMs", "Reasoning", "RLHF", "Self-Supervised", "Adversarial" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (RLHF) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 2.98, "read_first_score": 3.75, "content_potential_score": 1.0, "interestingness_score": 1.99, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Large language models are increasingly trained via reinforcement learning for personalized recommendation tasks, but standard methods like GRPO rely on sparse, sequence-level rewards. These obscure which tokens actually contribute to high-quality outputs, creating a credit assignment gap.", "key_contribution": "We introduce Owen-Shapley Policy Optimization (OSPO), a framework that redistributes sequence-level advantages based on tokens' marginal contributions to outcomes.", "why_it_matters": "Owen-Shapley Policy Optimization: A Principled RL Algorithm for Generative Search LLMs represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about LLMs.", "one_line_takeaway": "We introduce Owen-Shapley Policy Optimization (OSPO), a framework that redistributes sequence-level advantages based on…", "biggest_caveat": "but standard methods like GRPO rely on sparse, sequence-level rewards.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in LLMs.", "url": "https://arxiv.org/abs/2601.08403", "difficulty": "advanced" }, { "id": "arxiv:2609.17895", "source": "arxiv", "source_type": "preprint", "title": "TabPFN-3.5: Technical Report", "abstract": "We introduce TabPFN-3.5, our new flagship Tabular Foundation Model. It significantly outperforms its predecessor, TabPFN-3, and all existing baselines across a broad range of tabular problems. TabPFN-3.5 sets a new state of the art on standard tabular prediction in TabArena, and extends it to the data practitioners encounter in practice: non-i.i.d. data with temporal or grouped splits, tables with strings, text and images, high-cardinality categorical features, and wide tables with many features. These gains carry over to our task-specific harnesses: state of the art on relational data and stronger time-series forecasting. For faster inference, our variant TabPFN-3.5-Fast runs up to 3x faster than TabPFN-3 while keeping most of the accuracy gains. In addition, we upgrade TabPFN-3.5-Plus, expanding our multimodal capabilities with advanced text and date handling alongside proprietary inference optimizations. Finally, we release a new version of our Thinking mode, TabPFN-3.5-Thinking, which scales inference-time computation to push the state of the art further. It benefits from our stronger base model and from inference-time improvements that make it up to 12x faster than TabPFN-3-Thinking.", "authors": [ "Benjamin Jäger", "Nick Erickson", "Léo Grinsztajn", "Felix Birkel", "Klemens Flöge", "Oscar Key", "Kürşat Kaya", "Jonas Kübler", "Adèle Frankel", "Tobias Schröder", "Anurag Garg", "Jan Hendrik Metzen", "David Salinas", "Simon Bing", "Kristina Collins", "Tuana Çelik", "Vahid Balazadeh", "Lydia Sidhoum", "Tomás Pereda", "Brendan Roof", "Andrej Tschalzev", "Siyuan Guo", "Philipp Singer", "Lennart Purucker", "Jake Robertson", "Marie Salmon", "Philipp Jund", "Jerry Chen", "Diana Kriuchkova", "Arthur Cahu", "Eliott Kalfon", "Adrian Hayler", "Georg Grab", "Vitor Monteiro", "Lilly Wehrhahn", "Dominik Safaric", "Clara Cornu", "Alan Arazi", "Rylee Grace", "Simone Alessi", "Mihir Manium", "Bernhard Schölkopf", "Yann LeCun", "Madelon Hulsebos", "Sauraj Gambhir", "Noah Hollmann", "Frank Hutter" ], "year": 2026, "published_date": "2026-09-15", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2609.17895", "pdf_url": "https://arxiv.org/pdf/2609.17895", "citations": 0, "topics": [], "tags": [ "Multimodal", "Structured Data", "Machine Learning" ], "paper_type": "methods", "difficulty_level": "L2", "difficulty_reason": "Intermediate: suitable for readers with undergraduate ML/NLP background.", "maturity_stage": "emerging", "paper_score": 2.97, "read_first_score": 4.39, "content_potential_score": 0.0, "interestingness_score": 1.49, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "We introduce TabPFN-3.5, our new flagship Tabular Foundation Model. It significantly outperforms its predecessor, TabPFN-3, and all existing baselines across a broad range of tabular problems.", "key_contribution": "We introduce TabPFN-3.5, our new flagship Tabular Foundation Model.", "why_it_matters": "TabPFN-3.5: Technical Report represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about Multimodal.", "one_line_takeaway": "We introduce TabPFN-3.5, our new flagship Tabular Foundation Model.", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are familiar with ML and want to understand recent progress in Multimodal.", "url": "https://arxiv.org/abs/2609.17895", "difficulty": "intermediate" }, { "id": "arxiv:2608.08627", "source": "arxiv", "source_type": "preprint", "title": "UniMoMo: Expert Merging-Based MoE Acceleration for Large Recommendation Models", "abstract": "Sparse mixture-of-experts (MoE) layers expand recommendation capacity through conditional computation, yet a trained checkpoint still stores and routes over its full expert bank. We study a deployment problem: convert that checkpoint to a smaller standard MoE under an explicit expert budget, without adding a compression-specific online module. To address this, we introduce UniMoMo, a post-training compression framework formulated as a constrained graph coarsening problem. Rather than relying on parameter distance, UniMoMo groups experts based on their functional similarity, using an unlabeled calibration set to measure how similarly experts respond to shared recommendation states. To prevent performance degradation, we introduce a layer-adaptive protection mechanism that restricts the merging of high-traffic experts based on their routing exposure. Across Amazon Beauty, KuaiRec, and TenRec with 2, 4, and 6 MoE blocks, the final four-expert checkpoints obtain source-relative five-run mean NDCG@10 ratios of 99.92%--102.30% and measured A100 speedups of 1.28$\\times$--1.63$\\times$. An aggressive two-expert, top-1 operating point obtains ratios of 98.36%--104.24% and speedups of 1.47$\\times$--2.21$\\times$. These endpoint results evaluate the complete conversion-and-adaptation workflow and show that a trained recommendation MoE can be exported at multiple serving budgets.", "authors": [ "Lei Xin", "Bin Gu", "Peize Li", "Zitong Wang", "Jianbo Zhao", "Changjiang Jiang", "Yanyue Xie", "Chao Huang", "Xuyang Zhao", "Zunhai Su", "Fanhu Zeng", "Zhenglun Kong" ], "year": 2026, "published_date": "2026-08-09", "venue": "arXiv", "conference_rank": "", "presentation_type": "", "paper_url": "https://arxiv.org/abs/2608.08627", "pdf_url": "https://arxiv.org/pdf/2608.08627", "citations": 0, "topics": [], "tags": [ "MoE", "Artificial Intelligence" ], "paper_type": "systems", "difficulty_level": "L3", "difficulty_reason": "Advanced topic (MoE) requiring graduate-level background.", "maturity_stage": "emerging", "paper_score": 2.97, "read_first_score": 4.51, "content_potential_score": 1.0, "interestingness_score": 1.99, "hype_score": 0.0, "evidence_strength": 0.0, "summary": "Sparse mixture-of-experts (MoE) layers expand recommendation capacity through conditional computation, yet a trained checkpoint still stores and routes over its full expert bank. We study a deployment problem: convert that checkpoint to a smaller standard MoE under an explicit expert budget, without adding a compression-specific online module.", "key_contribution": "To address this, we introduce UniMoMo, a post-training compression framework formulated as a constrained graph coarsening problem.", "why_it_matters": "UniMoMo: Expert Merging-Based MoE Acceleration for Large Recommendation Models represents a meaningful contribution to its field and opens new research directions.", "content_hook": "A new paper that could change how we think about MoE.", "one_line_takeaway": "To address this, we introduce UniMoMo, a post-training compression framework formulated as a constrained graph…", "biggest_caveat": "Results may not generalise beyond the tested benchmarks.", "read_this_if": "Read this if you are an advanced practitioner and want to understand recent progress in MoE.", "url": "https://arxiv.org/abs/2608.08627", "difficulty": "advanced" } ]