Machine Learning
Super Agents and Confounders: Influence of surrounding agents on vehicle trajectory prediction
Daniel Jost, Luca Paparusso, Martin Stoll et al. (+3 more)
In highly interactive driving scenes, trajectory prediction is conditioned on information from surrounding traffic participants such as cars and pedestrians. Our main contribution is a comprehensive analysis of state-of-the-art trajectory predictors, which reveals a surprising and critical flaw: many surrounding
agents degrade prediction accuracy rather than improve it. Using Shapley-based attribution, we rigorously demonstrate that models learn unstable and non-causal decision-making schemes that vary significantly across training runs. Building on these insights, we propose to integrate a Conditional Information Bottleneck (CIB), which does not require additional supervision and is trained to effectively compress
agent features as well as ignore those that are not beneficial for the prediction task. Comprehensive experiments using multiple
datasets and model architectures demonstrate that this simple yet effective approach not only improves overall trajectory prediction performance in many cases but also increases robustness to different perturbations. Our results highlight the importance of selectively integrating contextual information, which can often contain spurious or misleading signals, in trajectory prediction. Moreover, we provide interpretable metrics for identifying non-robust behavior and present a promising avenue towards a solution.
Read the full abstract ▾
All authors Daniel Jost, Luca Paparusso, Martin Stoll, Jörg Wagner, Raghu Rajan, Joschka Bödecker
Machine Learning · Cross-listed from physics.ao-ph
Physics-Constrained Adaptive Flow Matching for Climate Downscaling
Kevin Debeire, Aytaç Paçal, Pierre Gentine et al. (+3 more)
Regional
climate information at kilometer scales is essential for assessing the impacts of
climate change, but generating it with global
climate models is too expensive due to their high computational costs. Machine learning models offer a fast alternative, yet they often violate basic physical laws and degrade when applied to climates outside of their training distribution. We present Physics-Constrained Adaptive Flow Matching (PC-AFM), a generative downscaling model that addresses both problems. Building on the Adaptive Flow Matching (AFM) model of Fotiadis et al. (2025) as our baseline, we add soft conservation constraints that keep the downscaled output consistent with the large-scale input for precipitation and humidity, and use gradient surgery via the ConFIG
algorithm to prevent these constraints from interfering with the generative objective. We train the model on Central Europe
climate data, evaluate it on a 10-time downscaling task (63km to 6.3km) over six variables (near-surface temperature, precipitation, specific humidity, surface pressure, and horizontal wind components) across a comprehensive set of metrics including bias, ensemble skill scores, power spectra, and conservation error, and test the generalization on two held-out
climate regions. Within the training distribution, PC-AFM reduces conservation errors and improves ensemble calibration while matching the baseline on standard skill metrics. Outside the training distribution, where unconstrained models develop large systematic errors by extrapolating learned statistics, PC-AFM halves precipitation wet bias, reduces conservation error and improves extreme-
quantile accuracy, all without any information about the target
climate at inference time. These results indicate that physical consistency is a practical requirement for deploying generative downscaling models in real-world applications.
Read the full abstract ▾
All authors Kevin Debeire, Aytaç Paçal, Pierre Gentine, Luis Medrano-Navarro, Nils Thuerey, Veronika Eyring
Machine Learning
Earth Embeddings Reveal Diverse Urban Signals from Space
Wenjing Gong, Udbhav Srivastava, Yuchen Wang et al. (+6 more)
Conventional urban indicators derived from censuses, surveys, and administrative records are often costly, spatially inconsistent, and slow to update. Recent geospatial foundation models enable Earth
embeddings, compact satellite image representations transferable across downstream tasks, but their utility for neighborhood-scale urban monitoring remains unclear. Here, we
benchmark three Earth
embedding families, AlphaEarth, Prithvi, and Clay, for urban signal prediction across six U.S. metropolitan areas from 2020 to 2023. Using a unified supervised-learning framework, we predict 14 neighborhood-level indicators spanning crime, income, health, and travel behavior, and evaluate performance under four settings: global, city-wise, year-wise, and city-year. Results show that Earth
embeddings capture substantial urban variation, with the highest predictive skill for outcomes more directly tied to built-environment structure, including chronic health burdens and dominant commuting modes. By contrast, indicators shaped more strongly by fine-scale behavior and local policy, such as cycling, remain difficult to infer. Predictive performance varies markedly across cities but remains comparatively stable across years, indicating strong spatial heterogeneity alongside temporal robustness. Exploratory analysis suggests that cross-city variation in predictive performance is associated with urban form in task-specific ways. Controlled dimensionality experiments show that representation efficiency is critical: compact 64-dimensional AlphaEarth
embeddings remain more informative than 64-dimensional reductions of Prithvi and Clay. This study establishes a
benchmark for evaluating Earth
embeddings in urban remote sensing and demonstrates their potential as scalable, low-cost features for SDG-aligned neighborhood-scale urban monitoring.
Read the full abstract ▾
All authors Wenjing Gong, Udbhav Srivastava, Yuchen Wang, Yuhao Jia, Qifan Wu, Weishan Bai, Yifan Yang, Xiao Huang, Xinyue Ye
Machine Learning · Cross-listed from cs.IR
Lightweight Query Routing for Adaptive RAG: A Baseline Study on RAGRouter-Bench
Prakhar Bansal and Shivangi Agarwal
Retrieval-Augmented Generation pipelines span a wide range of
retrieval strategies that differ substantially in
token cost and capability. Selecting the right strategy per query is a practical efficiency problem, yet no routing classifiers have been trained on RAGRouter-Bench \citep{wang2026ragrouterbench}, a recently released
benchmark of $7,727$ queries spanning four knowledge domains, each annotated with one of three canonical query types: factual,
reasoning, and summarization. We present the first systematic evaluation of lightweight classifier-based routing on this
benchmark. Five classical classifiers are evaluated under three feature regimes, namely, TF-IDF, MiniLM sentence
embeddings \citep{reimers2019sbert}, and hand-crafted structural features, yielding 15 classifier feature combinations. Our best configuration, TF-IDF with an SVM, achieves a macro-averaged F1 of $\mathbf{0.928}$ and an accuracy of $\mathbf{93.2\%}$, while simulating $\mathbf{28.1\%}$
token savings relative to always using the most expensive paradigm. Lexical TF-IDF features outperform semantic sentence
embeddings by $3.1$ macro-F1 points, suggesting that surface keyword patterns are strong predictors of query-type complexity. Domain-level analysis reveals that medical queries are hardest to route and legal queries most tractable. These results establish a reproducible query-side baseline and highlight the gap that corpus-aware routing must close.
Read the full abstract ▾
Machine Learning
Neural Operators for Multi-Task Control and Adaptation
David Sewell, Xingjian Li, Stepan Tretiakov et al. (+2 more)
Neural operator methods have emerged as powerful tools for learning mappings between infinite-dimensional function spaces, yet their potential in optimal control remains largely unexplored. We focus on multi-task control problems, whose solution is a mapping from task description (e.g., cost or dynamics functions) to optimal control law (e.g., feedback policy). We approximate these solution operators using a permutation-invariant neural operator architecture. Across a range of parametric optimal control environments and a locomotion
benchmark, a single operator trained via behavioral cloning accurately approximates the solution operator and generalizes to unseen tasks, out-of-distribution settings, and varying amounts of task observations. We further show that the branch-trunk structure of our neural operator architecture enables efficient and flexible adaptation to new tasks. We develop structured adaptation strategies ranging from lightweight updates to full-network fine-tuning, achieving strong performance across different data and compute settings. Finally, we introduce meta-trained operator variants that optimize the initialization for few-shot adaptation. These methods enable rapid task adaptation with limited data and consistently outperform a popular meta-learning baseline. Together, our results demonstrate that neural operators provide a unified and efficient framework for multi-task control and adaptation.
Read the full abstract ▾
All authors David Sewell, Xingjian Li, Stepan Tretiakov, Krishna Kumar, David Fridovich-Keil
Machine Learning · Cross-listed from cs.CV
ExpressEdit: Fast Editing of Stylized Facial Expressions with Diffusion Models in Photoshop
Kenan Tang, Jiasheng Guo, Jeffrey Lin et al. (+1 more)
Facial expressions of characters are a vital component of visual storytelling. While current AI image editing models hold promise for assisting artists in the task of stylized expression editing, these models introduce global noise and pixel drift into the edited image, preventing the integration of these models into professional image editing software and workflows. To bridge this gap, we introduce ExpressEdit, a fully open-source Photoshop plugin that is free from common artifacts of proprietary image editing models and robustly synergizes with native Photoshop operations such as Liquify. ExpressEdit seamlessly edits an expression within 3 seconds on a single consumer-grade GPU, significantly faster than popular proprietary models. Moreover, to support the generation of diverse expressions according to different narrative needs, we compile a comprehensive expression database of 135 expression tags enriched with example stories and images designed for
retrieval-augmented generation. We open source the code and
dataset to facilitate future research and artistic exploration.
Read the full abstract ▾
All authors Kenan Tang, Jiasheng Guo, Jeffrey Lin, Yao Qin
Machine Learning
Olmo Hybrid: From Theory to Practice and Back
William Merrill, Yanhong Li, Tyler Romero et al. (+19 more)
Recent work has demonstrated the potential of non-
transformer language models, especially linear recurrent neural networks (RNNs) and hybrid models that mix recurrence and
attention. Yet there is no consensus on whether the potential benefits of these new architectures justify the risk and effort of scaling them up. To address this, we provide evidence for the advantages of hybrid models over pure
transformers on several fronts. First, theoretically, we show that hybrid models do not merely inherit the expressivity of
transformers and linear RNNs, but can express tasks beyond both, such as code execution. Putting this theory to practice, we train Olmo Hybrid, a 7B-parameter model largely comparable to Olmo 3 7B but with the sliding window layers replaced by Gated DeltaNet layers. We show that Olmo Hybrid outperforms Olmo 3 across standard pretraining and mid-training evaluations, demonstrating the benefit of hybrid models in a controlled, large-scale setting. We find that the hybrid model scales significantly more efficiently than the
transformer, explaining its higher performance. However, its unclear why greater expressivity on specific formal problems should result in better scaling or superior performance on downstream tasks unrelated to those problems. To explain this apparent gap, we return to theory and argue why increased expressivity should translate to better scaling efficiency, completing the loop. Overall, our results suggest that hybrid models mixing
attention and recurrent layers are a powerful extension to the
language modeling paradigm: not merely to reduce
memory during inference, but as a fundamental way to obtain more expressive models that scale better during pretraining.
Read the full abstract ▾
All authors William Merrill, Yanhong Li, Tyler Romero, Anej Svete, Caia Costello, Pradeep Dasigi, Dirk Groeneveld, David Heineman, Bailey Kuehl, Nathan Lambert, Chuan Li, Kyle Lo, Saumya Malik, DJ Matusz, Benjamin Minixhofer, Jacob Morrison, Luca Soldaini, Finbarr Timbers, Pete Walsh, Noah A. Smith, Hannaneh Hajishirzi, Ashish Sabharwal
Machine Learning · Cross-listed from cs.SE
Agile Story-Point Estimation: Is RAG a Better Way to Go?
Lamyea Maha, Tajmilur Rahman and Chanchal Roy
The sprint-based iterative approach in the Agile software development method allows continuous feedback and adaptation. One of the crucial Agile software development activities is the sprint planning session where developers estimate the effort required to complete tasks through a consensus-based estimation technique such as Planning Poker. In the Agile software development method, a common unit of measuring development effort is Story Point (SP) which is assigned to tasks to understand the complexity and development time needed to complete them. Despite the benefits of this process, it is an extremely time-consuming manual process. To mitigate this issue, in this study, we investigated if this manual process can be automated using
Retrieval Augmented Generation (RAG) which comprises a "Retriever" and a "Generator". We applied two
embedding models - bge-large-en-v1.5, and Sentence-
Transformers' all-mpnet-base-v2 on 23 open-source software projects of varying sizes and examined four key aspects: 1) how
retrieval hyper-parameters influence the performance, 2) whether estimation accuracy differs across different sizes of the projects, 3) whether
embedding model choice affects accuracy, and 4) how the RAG-based approach compares to the existing baselines. Although the RAG-based approach outperformed the baseline models in several occasions, our results did not exhibit statistically significant differences in performance across the projects or across the
embedding models. This highlights the need for further studies and refinement of the RAG, and model adaptation strategies for better accuracy in automatically estimating user stories.
Read the full abstract ▾
Machine Learning
MetaSAEs: Joint Training with a Decomposability Penalty Produces More Atomic Sparse Autoencoder Latents
Matthew Levinson
Sparse autoencoders (SAEs) are increasingly used for safety-relevant applications including
alignment detection and model steering. These use cases require SAE latents to be as atomic as possible. Each latent should represent a single coherent concept drawn from a single underlying representational subspace. In practice, SAE latents blend representational subspaces together. A single feature can activate across semantically distinct contexts that share no true common representation, muddying an already complex picture of model computation. We introduce a joint training objective that directly penalizes this subspace blending. A small meta SAE is trained alongside the primary SAE to sparsely reconstruct the primary SAE's decoder columns; the primary SAE is penalized whenever its decoder directions are easy to reconstruct from the meta dictionary. This occurs whenever latent directions lie in a subspace spanned by other primary directions. This creates gradient pressure toward more mutually independent decoder directions that resist sparse meta-compression. On GPT-2 large (layer 20), the selected configuration reduces mean $|\varphi|$ by 7.5% relative to an identical solo SAE trained on the same data. Automated interpretability (fuzzing) scores improve by 7.6%, providing external validation of the atomicity gain independent of the training and co-occurrence metrics. Reconstruction overhead is modest. Results on Gemma 2 9B are directional. On not-fully-converged SAEs, the same parameterization yields the best results, a $+8.6\%$ $\Delta$Fuzz. Though directional, this is an encouraging sign that the method transfers to a larger model. Qualitative analysis confirms that features firing on polysemantic
tokens are split into semantically distinct sub-features, each specializing in a distinct representational subspace.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Inference-Path Optimization via Circuit Duplication in Frozen Visual Transformers for Marine Species Classification
Thomas Manuel Rost
Automated
underwater species classification is constrained by annotation cost and environmental variation that limits the transferability of fully supervised models. Recent work has shown that frozen
embeddings from self-supervised
vision foundation models already provide a strong label-efficient baseline for marine image classification. Here we investigate whether this frozen-
embedding regime can be improved at inference time, without fine-tuning or changing model weights. We apply
Circuit Duplication, an inference-time method originally proposed for Large
Language Models, in which a selected range of
transformer layers is traversed twice during the forward pass. We evaluate on the class-imbalanced AQUA20
benchmark using frozen DINOv3
embeddings under two settings: global
circuit selection, where a single duplicated
circuit is chosen for the full
dataset, and class-specific
circuit selection, where each species may receive a different optimal
circuit. Both settings use simple semi-supervised downstream classifiers.
Circuit Duplication consistently improves over the standard frozen forward pass. At the maximum label budget, class-specific selection reaches a macro F1 of 0.875, closing the gap to the fully supervised ConvNeXt
benchmark (0.889) to 1.4 points without any gradient-based training. Four species exceed their fully supervised reference, with octopus improving by +12.1 F1 points. Across all budgets, roughly 75% of classes prefer a class-specific
circuit, indicating a genuinely class-dependent benefit. To our knowledge, this is the first application of
Circuit Duplication to computer
vision.
Read the full abstract ▾
Machine Learning
Sribalaji C. Anand and George J. Pappas
State-space model (SSM) for time-series
forecasting have demonstrated strong empirical performance on
benchmark datasets, yet their robustness under
adversarial perturbations is poorly understood. We address this gap through a control-theoretic lens, focusing on the recently proposed Spacetime SSM forecaster. We first establish that the decoder-only Spacetime architecture can represent the optimal Kalman predictor when the underlying data-generating process is autoregressive - a property no other SSM possesses. Building on this, we formulate robust forecaster design as a Stackelberg game against worst-case stealthy adversaries constrained by a detection budget, and solve it via
adversarial training. We derive closed-form bounds on
adversarial forecasting error that expose how open-loop instability, closed-loop instability, and decoder state dimension each amplify vulnerability - offering actionable principles towards robust forecaster design. Finally, we show that even adversaries with no access to the forecaster can nonetheless construct effective attacks by exploiting the model's locally linear input-output behavior, bypassing gradient computations entirely. Experiments on the Monash
benchmark datasets highlight that model-free attacks, without any gradient computation, can cause at least 33% more error than projected gradient descent with a small step size.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Zero-Shot Quantization via Weight-Space Arithmetic
Daniele Solombrino, Antonio Andrea Gargiulo, Alessandro Zirilli et al. (+3 more)
We show that robustness to post-training quantization (PTQ) is a transferable direction in weight space. We call this direction the quantization vector: extracted from a donor task by simple weight-space arithmetic, it can be used to patch a receiver model and improve PTQ Top-1 accuracy by up to 60% in a 3-bit setting, without receiver-side quantization-aware training (QAT). When using no receiver validation data, the method provides a zero-shot, low-cost alternative to QAT for extremely low-bit deployment. Across multiple
vision and
language models and more than 30 tasks, donor quantization vectors often yield substantial gains even when donor and receiver tasks differ markedly. We further prove rigorously that quantization vectors are well-defined and do not suffer from reparameterization
symmetries, and provide a local
geometric account of their effect. Together, these results suggest that quantization robustness can be partially isolated, reused, and transferred through simple weight-space
algebra.
Read the full abstract ▾
All authors Daniele Solombrino, Antonio Andrea Gargiulo, Alessandro Zirilli, Luca Zhou, Adrian Robert Minut, Emanuele Rodolà
Machine Learning
Adaptive Threshold-Driven Continuous Greedy Method for Scalable Submodular Optimization
Mohammadreza Rostami and Solmaz S. Kia
Submodular maximization under matroid constraints is a fundamental problem in combinatorial optimization with applications in sensing, data summarization, active learning, and resource allocation. While the Sequential Greedy (SG)
algorithm achieves only a $\frac{1}{2}$-approximation due to irrevocable selections, Continuous Greedy (CG) attains the optimal $\bigl(1-\frac{1}{e}\bigr)$-approximation via the multilinear relaxation, at the cost of a progressively dense decision vector that forces
agents to exchange feature
embeddings for nearly every ground-set element. We propose ATCG (\underline{A}daptive \underline{T}hresholded \underline{C}ontinuous \underline{G}reedy), which gates gradient evaluations behind a per-partition progress ratio $\eta_i$, expanding each
agent's active set only when current candidates fail to capture sufficient marginal gain, thereby directly bounding which feature
embeddings are ever transmitted. Theoretical analysis establishes a
curvature-aware approximation guarantee with effective factor $\tau_{\mathrm{eff}}=\max\{\tau,1-c\}$, interpolating between the threshold-based guarantee and the low-
curvature regime where ATCG recovers the performance of CG. This shows that the problem structure, as captured by
curvature, determines the amount of coordination and communication required to approach full-CG performance. Experiments on a class-balanced prototype selection problem over a subset of the CIFAR-10 animal
dataset show that ATCG achieves objective values comparable to those of the full CG method while substantially reducing communication overhead through adaptive active-set expansion.
Read the full abstract ▾
Machine Learning
Beauty in the Eye of AI: Aligning LLMs and Vision Models with Human Aesthetics in Network Visualization
Peng Zhang, Xuefeng Li, Xiaoqi Wang et al. (+2 more)
Network visualization has traditionally relied on heuristic metrics, such as stress, under the assumption that optimizing them leads to aesthetic and informative layouts. However, no single metric consistently produces the most effective results. A data-driven alternative is to learn from human preferences, where annotators select their favored visualization among multiple layouts of the same graphs. These human-preference labels can then be used to train a generative model that approximates human aesthetic preferences. However, obtaining human labels at scale is costly and time-consuming. As a result, this generative approach has so far been tested only with machine-labeled data. In this paper, we explore the use of large
language models (LLMs) and
vision models (VMs) as proxies for human judgment. Through a carefully designed user study involving 27 participants, we curated a large set of human preference labels. We used this data both to better understand human preferences and to bootstrap LLM/VM labelers. We show that
prompt engineering that combines few-shot examples and diverse input formats, such as image
embeddings, significantly improves LLM-human
alignment, and additional filtering by the confidence score of the LLM pushes the
alignment to human-human levels. Furthermore, we demonstrate that carefully trained VMs can achieve VM-human
alignment at a level comparable to that between human annotators. Our results suggest that AI can feasibly serve as a scalable proxy for human labelers.
Read the full abstract ▾
All authors Peng Zhang, Xuefeng Li, Xiaoqi Wang, Han-Wei Shen, Yifan Hu
Machine Learning · Cross-listed from cs.RO
Diffusion Policy with Bayesian Expert Selection for Active Multi-Target Tracking
Haotian Xiang, Qin Lu and Yaakov Bar-Shalom
Active multi-target tracking requires a mobile
robot to balance exploration for undetected targets with exploitation of uncertain tracked ones.
Diffusion policies have emerged as a powerful approach for capturing diverse behavioral strategies by learning action sequences from expert demonstrations. However, existing methods implicitly select among strategies through the denoising process, without uncertainty quantification over which strategy to execute. We formulate expert selection for
diffusion policies as an offline contextual bandit problem and propose a
Bayesian framework for pessimistic, uncertainty-aware strategy selection. A multi-head Variational
Bayesian Last Layer (VBLL) model predicts the expected tracking performance of each expert strategy given the current belief state, providing both a point estimate and predictive uncertainty. Following the pessimism principle for offline decision-making, a Lower Confidence Bound (LCB) criterion then selects the expert whose worst-case predicted performance is best, avoiding overcommitment to experts with unreliable predictions. The selected expert conditions a
diffusion policy to generate corresponding action sequences. Experiments on simulated indoor tracking scenarios demonstrate that our approach outperforms both the base
diffusion policy and standard gating methods, including Mixture-of-Experts selection and deterministic regression baselines.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Banana100: Breaking NR-IQA Metrics by 100 Iterative Image Replications with Nano Banana Pro
Kenan Tang, Praveen Arunshankar, Andong Hua et al. (+2 more)
The multi-step, iterative image editing capabilities of multi-modal agentic systems have transformed digital content creation. Although latest image editing models faithfully follow instructions and generate high-quality images in single-turn edits, we identify a critical weakness in multi-turn editing, which is the iterative degradation of image quality. As images are repeatedly edited, minor artifacts accumulate, rapidly leading to a severe accumulation of visible noise and a failure to follow simple editing instructions. To systematically study these failures, we introduce Banana100, a comprehensive
dataset of 28,000 degraded images generated through 100 iterative editing steps, including diverse textures and image content. Alarmingly, image quality evaluators fail to detect the degradation. Among 21 popular no-reference image quality assessment (NR-IQA) metrics, none of them consistently assign lower scores to heavily degraded images than to clean ones. The dual failures of generators and evaluators may threaten the stability of future model training and the safety of deployed agentic systems, if the low-quality synthetic data generated by multi-turn edits escape quality filters. We release the full code and data to facilitate the development of more robust models, helping to mitigate the fragility of multi-modal agentic systems.
Read the full abstract ▾
All authors Kenan Tang, Praveen Arunshankar, Andong Hua, Anthony Yang, Yao Qin
Machine Learning · Cross-listed from eess.SY
Learning Families of Fixed-Wing Aircraft Control Policies with Hypernetwork-Conditioned Reinforcement Learning
Dennis Marquis and Mazen Farhood
This paper investigates whether it is more effective to condition reinforcement learning policies across changing dynamics using standard input augmentation or hypernetwork-based parameter modulation. We use a small fixed-wing uncrewed aircraft under actuator failures as a demanding test case, as these failures introduce distinctly different closed-loop dynamics. We evaluate parameter-efficient hypernetwork formulations based on Feature-wise Linear Modulation (FiLM) and Low-Rank Adaptation (LoRA), trained using proximal policy optimization. High-fidelity six-degree-of-freedom simulations demonstrate that hypernetwork-conditioned policies improve robustness compared to standard multilayer perceptron policies trained with augmented inputs. Most notably, the hypernetwork policies generalize effectively to time-varying actuator failure modes not encountered during training, indicating that modulating internal parameters provides significant advantages over standard input augmentation for this class of highly coupled dynamics.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.SE
SDVDiag: Using Context-Aware Causality Mining for the Diagnosis of Connected Vehicle Functions
Matthias Weiß, Falk Dettinger, Elias Detrois et al. (+2 more)
Real-world implementations of connected vehicle functions are spreading steadily, yet operating these functions reliably remains challenging due to their distributed nature and the complexity of the underlying cloud, edge, and networking infrastructure. Quick diagnosis of problems and understanding the error chains that lead to failures is essential for reducing downtime. However, diagnosing these systems is still largely performed manually, as automated analysis techniques are predominantly data-driven and struggle with hidden relationships and the integration of context information. This paper addresses this gap by introducing a
multimodal approach that integrates human feedback and system-specific information into the causal analysis process. Reinforcement Learning from Human Feedback is employed to continuously train a causality mining model while incorporating expert knowledge. Additional modules leverage distributed tracing data to prune false-positive causal links and enable the injection of domain-specific relationships to further refine the causal graph.Evaluation is performed using an automated valet parking application operated in a connected vehicle test field. Results demonstrate a significant increase in precision from 14% to 100% for the detection of causal edges and improved system interpretability compared to purely data-driven approaches, highlighting the potential for system operators in the connected vehicle domain.
Read the full abstract ▾
All authors Matthias Weiß, Falk Dettinger, Elias Detrois, Nasser Jazdi, Michael Weyrich
Machine Learning
Scalable Variational Bayesian Fine-Tuning of LLMs via Orthogonalized Low-Rank Adapters
Haotian Xiang, Bingcong Li and Qin Lu
When deploying large
language models (LLMs) to safety-critical applications, uncertainty quantification (UQ) is of utmost importance to self-assess the reliability of the LLM-based decisions. However, such decisions typically suffer from overconfidence, particularly after parameter-efficient fine-tuning (PEFT) for downstream domain-specific tasks with limited data. Existing methods to alleviate this issue either rely on Laplace approximation based post-hoc framework, which may yield suboptimal calibration depending on the training trajectory, or variational
Bayesian training that requires multiple complete forward passes through the entire LLM backbone at inference time for Monte Carlo estimation, posing scalability challenges for deployment. To address these limitations, we build on the
Bayesian last layer (BLL) model, where the LLM-based deterministic feature extractor is followed by random last layer parameters for uncertainty
reasoning. Since existing low-rank adapters (LoRA) for PEFT have limited expressiveness due to rank collapse, we address this with Polar-decomposed Low-rank Adapter Representation (PoLAR), an orthogonalized parameterization paired with Riemannian optimization to enable more stable and expressive adaptation. Building on this PoLAR-BLL model, we leverage the variational (V) inference framework to put forth a scalable
Bayesian fine-tuning approach which jointly seeks the PoLAR parameters and approximate posterior of the last layer parameters via alternating optimization. The resulting PoLAR-VBLL is a flexible framework that nicely integrates architecture-enhanced optimization with scalable
Bayesian inference to endow LLMs with well-calibrated UQ. Our empirical results verify the effectiveness of PoLAR-VBLL in terms of generalization and uncertainty estimation on both in-distribution and out-of-distribution data for various common-sense
reasoning tasks.
Read the full abstract ▾
Machine Learning
The limits of bio-molecular modeling with large language models : a cross-scale evaluation
Yaxin Xu, Yue Zhou, Tianyu Zhao et al. (+2 more)
The modeling of bio-molecular system across molecular scales remains a central challenge in scientific research. Large
language models (LLMs) are increasingly applied to bio-molecular discovery, yet systematic evaluation across multi-scale biological problems and rigorous assessment of their tool-augmented capabilities remain limited. We reveal a systematic gap between LLM performance and mechanistic understanding through the proposed cross-scale bio-molecular
benchmark: BioMol-LLM-Bench, a unified framework comprising 26 downstream tasks that covers 4 distinct difficulty levels, and computational tools are integrated for a more comprehensive evaluation. Evaluation on 13 representative models reveals 4 main findings: chain-of-thought data provides limited benefit and may even reduce performance on biological tasks; hybrid mamba-
attention architectures are more effective for long bio-molecular sequences; supervised fine-tuning improves specialization at the cost of generalization; and current LLMs perform well on classification tasks but remain weak on challenging regression tasks. Together, these findings provide practical guidance for future LLM-based modeling of molecular systems.
Read the full abstract ▾
All authors Yaxin Xu, Yue Zhou, Tianyu Zhao, Fengwei An, Zhixiang Ren
Machine Learning
From Model-Based Screening to Data-Driven Surrogates: A Multi-Stage Workflow for Exploring Stochastic Agent-Based Models
Paul Saves, Matthieu Mastio, Nicolas Verstaevel et al. (+1 more)
Systematic exploration of
Agent-Based Models (ABMs) is challenged by the curse of dimensionality and their inherent stochasticity. We present a multi-stage pipeline integrating the systematic design of experiments with machine learning surrogates. Using a predator-prey case study, our methodology proceeds in two steps. First, an automated model-based screening identifies dominant variables, assesses outcome variability, and segments the parameter space. Second, we train Machine Learning models to map the remaining nonlinear interaction effects. This approach automates the discovery of unstable regions where system outcomes are highly dependent on nonlinear interactions between many variables. Thus, this work provides modelers with a rigorous, hands-off framework for sensitivity analysis and policy testing, even when dealing with high-dimensional
stochastic simulators.
Read the full abstract ▾
All authors Paul Saves, Matthieu Mastio, Nicolas Verstaevel, Benoit Gaudou
Machine Learning
Hardware-Oriented Inference Complexity of Kolmogorov-Arnold Networks
Bilal Khalid, Pedro Freire, Sergei K. Turitsyn et al. (+1 more)
Kolmogorov-Arnold Networks (KANs) have recently emerged as a powerful architecture for various machine learning applications. However, their unique structure raises significant concerns regarding their computational overhead. Existing studies primarily evaluate KAN complexity in terms of Floating-Point Operations (FLOPs) required for GPU-based training and inference. However, in many latency-sensitive and power-constrained deployment scenarios, such as neural network-driven non-linearity mitigation in optical communications or channel state estimation in wireless communications, training is performed offline and dedicated hardware accelerators are preferred over GPUs for inference. Recent hardware implementation studies report KAN complexity using platform-specific resource consumption metrics, such as Look-Up Tables, Flip-Flops, and Block RAMs. However, these metrics require a full hardware design and synthesis stage that limits their utility for early-stage architectural decisions and cross-platform comparisons. To address this, we derive generalized, platform-independent formulae for evaluating the hardware inference complexity of KANs in terms of Real Multiplications (RM), Bit Operations (BOP), and Number of Additions and Bit-Shifts (NABS). We extend our analysis across multiple KAN variants, including B-spline, Gaussian Radial Basis Function (GRBF), Chebyshev, and
Fourier KANs. The proposed metrics can be computed directly from the network structure and enable a fair and straightforward inference complexity comparison between KAN and other neural network architectures.
Read the full abstract ▾
All authors Bilal Khalid, Pedro Freire, Sergei K. Turitsyn, Jaroslaw E. Prilepsky
Machine Learning
Towards Intelligent Energy Security: A Unified Spatio-Temporal and Graph Learning Framework for Scalable Electricity Theft Detection in Smart Grids
AbdulQoyum A. Olowookere, Usman A. Oguntola, Ebenezer. Leke Odekanle et al. (+2 more)
Electricity theft and non-technical losses (NTLs) remain critical challenges in modern smart grids, causing significant economic losses and compromising grid reliability. This study introduces the SmartGuard Energy Intelligence System (SGEIS), an integrated artificial intelligence framework for electricity theft detection and intelligent energy monitoring. The proposed system combines supervised machine learning, deep learning-based time-series modeling, Non-Intrusive Load Monitoring (NILM), and graph-based learning to capture both temporal and spatial consumption patterns. A comprehensive data processing pipeline is developed, incorporating feature engineering, multi-scale temporal analysis, and rule-based anomaly labeling. Deep learning models, including Long Short-Term
Memory (LSTM), Temporal Convolutional Networks (TCN), and Autoencoders, are employed to detect abnormal usage patterns. In parallel, ensemble learning methods such as Random Forest, Gradient Boosting, XGBoost, and LightGBM are utilized for classification. To model grid
topology and spatial dependencies, Graph Neural Networks (GNNs) are applied to identify correlated anomalies across interconnected nodes. The NILM module enhances interpretability by disaggregating appliance-level consumption from aggregate signals. Experimental results demonstrate strong performance, with Gradient Boosting achieving a ROC-AUC of 0.894, while graph-based models attain over 96% accuracy in identifying high-risk nodes. The hybrid framework improves detection robustness by integrating temporal, statistical, and spatial intelligence. Overall, SGEIS provides a scalable and practical solution for electricity theft detection, offering high accuracy, improved interpretability, and strong potential for real-world smart grid deployment.
Read the full abstract ▾
All authors AbdulQoyum A. Olowookere, Usman A. Oguntola, Ebenezer. Leke Odekanle, Maridiyah A. Madehin, Aisha A. Adesope
Machine Learning
NativeTernary: A Self-Delimiting Binary Encoding with Unary Run-Length Hierarchy Markers for Ternary Neural Network Weights, Structured Data, and General Computing Infrastructure
Maharshi Savdhariya
BitNet b1.58 (Ma et al., 2024) demonstrates that large
language models can operate entirely on ternary weights {-1, 0, +1}, yet no native binary wire format exists for such models. NativeTernary closes this gap. Benchmarked against GGUF on the real BitNet b1.58 2B4T architecture (24 layers, ~170 tensors, 2B parameters): NativeTernary encodes ternary weights at exactly 2.000 bits per weight – 1.31x smaller than GGUF Q2_K and 4.0x smaller than GGUF int8 – while reducing boundary and framing overhead by 460x (91 bytes vs ~42KB of GGUF tensor headers). Encode throughput: 47–69 MB/s. Decode throughput: 35–45 MB/s on commodity hardware. The decoder is a 10-line stateless state machine resilient to bitstream corruption.
Read the full abstract ▾
Machine Learning
Apparent Age Estimation: Challenges and Outcomes
Justin Rainier Go, Lorenz Bernard Marqueses, Mikaella Kaye Martinez et al. (+2 more)
Apparent age estimation is a valuable tool for business personalization, yet current models frequently exhibit demographic biases. We review prior works on the DEX method by applying distribution learning techniques such as Mean-Variance Loss (MVL) and Adaptive Mean-Residue Loss (AMRL), and evaluate them in both accuracy and
fairness. Using IMDB-WIKI, APPA-REAL, and FairFace, we demonstrate that while AMRL achieves state-of-the-art accuracy, trade-offs between precision and demographic equity persist. Despite clear age clustering in UMAP
embeddings, our saliency maps indicate inconsistent feature focus across demographics, leading to significant performance degradation for Asian and African American populations. We argue that technical improvements alone are insufficient; accurate and fair apparent age estimation requires the integration of localized and diverse
datasets, and strict adherence to
fairness validation protocols.
Read the full abstract ▾
All authors Justin Rainier Go, Lorenz Bernard Marqueses, Mikaella Kaye Martinez, John Kevin Patrick Sarmiento, Abien Fred Agarap
Machine Learning
Enhancing Robustness of Federated Learning via Server Learning
Van Sy Mai, Kushal Chakrabarti, Richard J. La et al. (+1 more)
This paper explores the use of server learning for enhancing the robustness of
federated learning against malicious attacks even when clients' training data are not independent and identically distributed. We propose a heuristic
algorithm that uses server learning and client update filtering in combination with
geometric median aggregation. We demonstrate via experiments that this approach can achieve significant improvement in model accuracy even when the fraction of malicious clients is high, even more than $50\%$ in some cases, and the
dataset utilized by the server is small and could be synthetic with its distribution not necessarily close to that of the clients' aggregated data.
Read the full abstract ▾
All authors Van Sy Mai, Kushal Chakrabarti, Richard J. La, Dipankar Maity
Machine Learning
Hierarchical Planning with Latent World Models
Wancong Zhang, Basile Terver, Artem Zholus et al. (+7 more)
World models are a promising path to zero-shot
embodied control through planning. However, existing world model planners struggle on long-horizon, multi-stage tasks: prediction errors compound and naive search is exponential in the planning horizon. Hierarchy mitigates both by decomposing tasks into shorter, tractable subproblems; yet prior hierarchical approaches either amortize control into task-specific policies (hierarchical RL) or assume low-dimensional states and known dynamics (classical hierarchical MPC). We present Hierarchical Planning with Latent World Models (HWM), an architecture and planning paradigm for hierarchical model predictive control directly on visual world models trained solely via next-latent prediction. HWM learns world models at multiple temporal scales within a shared latent space, so predictions from the long horizon model serve as subgoals for the short horizon model via latent matching, without task-specific rewards or hierarchical policies. To keep long-horizon search tractable, HWM learns an action encoder that compresses primitive action chunks into latent macro-actions. On real-world Franka manipulation, HWM solves pick-and-place from a single goal image at 70% success vs. 0% for single-level planning. Across simulated push manipulation and maze
navigation, HWM consistently improves performance on long-horizon tasks while requiring up to 3x less planning compute.
Read the full abstract ▾
All authors Wancong Zhang, Basile Terver, Artem Zholus, Soham Chitnis, Harsh Sutaria, Mido Assran, Randall Balestriero, Amir Bar, Yann LeCun, Nicolas Ballas
Machine Learning · Cross-listed from cs.CR
A Tsetlin Machine-driven Intrusion Detection System for Next-Generation IoMT Security
Rahul Jaiswal, Per-Arne Andersen, Linga Reddy Cenkeramaddi et al. (+2 more)
The rapid adoption of the Internet of Medical Things (IoMT) is transforming healthcare by enabling seamless connectivity among medical devices, systems, and services. However, it also introduces serious cybersecurity and patient safety concerns as attackers increasingly exploit new methods and emerging vulnerabilities to infiltrate IoMT networks. This paper proposes a novel Tsetlin Machine (TM)-based Intrusion Detection System (IDS) for detecting a wide range of cyberattacks targeting IoMT networks. The TM is a rule-based and interpretable machine learning (ML) approach that models attack patterns using propositional logic. Extensive experiments conducted on the CICIoMT-2024
dataset, which includes multiple IoMT protocols and cyberattack types, demonstrate that the proposed TM-based IDS outperforms traditional ML classifiers. The proposed model achieves an accuracy of 99.5% in binary classification and 90.7% in multi-class classification, surpassing existing state-of-the-art approaches. Moreover, to enhance model trust and interpretability, the proposed TM-based model presents class-wise vote scores and clause activation heatmaps, providing clear insights into the most influential clauses and the dominant class contributing to the final model decision.
Read the full abstract ▾
All authors Rahul Jaiswal, Per-Arne Andersen, Linga Reddy Cenkeramaddi, Lei Jiao, Ole-Christoffer Granmo
Machine Learning · Cross-listed from cs.CV
PR3DICTR: A modular AI framework for medical 3D image-based detection and outcome prediction
Daniel C. MacRae, Luuk van der Hoek, Robert van der Wal et al. (+5 more)
Three-dimensional medical image data and computer-aided decision making, particularly using deep learning, are becoming increasingly important in the medical field. To aid in these developments we introduce PR3DICTR: Platform for Research in 3D Image Classification and sTandardised tRaining. Built using community-standard distributions (PyTorch and MONAI), PR3DICTR provides an open-access, flexible and convenient framework for prediction model development, with an explicit focus on classification using three-dimensional medical image data. By combining modular design principles and standardization, it aims to alleviate developmental burden whilst retaining adjustability. It provides users with a wealth of pre-established functionality, for instance in model architecture design options, hyper-parameter solutions and training methodologies, but still gives users the opportunity and freedom to “plug in” their own solutions or modules. PR3DICTR can be applied to any binary or event-based three-dimensional classification task and can work with as little as two lines of code.
Read the full abstract ▾
All authors Daniel C. MacRae, Luuk van der Hoek, Robert van der Wal, Suzanne P.M. de Vette, Hendrike Neh, Baoqiang Ma, Peter M.A. van Ooijen, Lisanne V. van Dijk
Machine Learning · Cross-listed from cs.CL
Learning the Signature of Memorization in Autoregressive Language Models
David Ilić, Kostadin Cvejoski, David Stanojević et al. (+1 more)
All prior membership inference attacks for fine-tuned
language models use hand-crafted heuristics (e.g., loss thresholding, Min-K%, reference calibration), each bounded by the designer's intuition. We introduce the first transferable learned attack, enabled by the observation that fine-tuning any model on any corpus yields unlimited labeled data, since membership is known by construction. This removes the shadow model bottleneck and brings membership inference into the deep learning era: learning what matters rather than designing it, with generalization through training diversity and scale. We discover that fine-tuning
language models produces an invariant signature of memorization detectable across architectural families and data domains. We train a membership inference classifier exclusively on
transformer-based models. It transfers zero-shot to Mamba (state-space), RWKV-4 (linear
attention), and RecurrentGemma (gated recurrence), achieving 0.963, 0.972, and 0.936 AUC respectively. Each evaluation combines an architecture and
dataset never seen during training, yet all three exceed performance on held-out
transformers (0.908 AUC). These four families share no computational mechanisms, their only commonality is gradient descent on cross-
entropy loss. Even simple likelihood-based methods exhibit strong transfer, confirming the signature exists independently of the detection method. Our method, Learned Transfer MIA (LT-MIA), captures this signal most effectively by reframing membership inference as sequence classification over per-
token distributional statistics. On
transformers, LT-MIA achieves 2.8$\times$ higher TPR at 0.1% FPR than the strongest baseline. The method also transfers to code (0.865 AUC) despite training only on natural
language texts. Code and trained classifier available at https://github.com/JetBrains-Research/learned-mia.
Read the full abstract ▾
All authors David Ilić, Kostadin Cvejoski, David Stanojević, Evgeny Grigorenko