Machine Learning
Weather-Aware Transformer for Real-Time Route Optimization in Drone-as-a-Service Operations
Kamal Mohamed, Lillian Wassim, Ali Hamdi et al. (+1 more)
This paper presents a novel framework to accelerate route prediction in Drone-as-a-Service operations through weather-aware deep learning models. While classical path-planning
algorithms, such as A* and Dijkstra, provide optimal solutions, their computational complexity limits real-time applicability in dynamic environments. We address this limitation by training machine learning and deep learning models on synthetic
datasets generated from classical
algorithm simulations. Our approach incorporates
transformer-based and
attention-based architectures that utilize weather heuristics to predict optimal next-node selections while accounting for meteorological conditions affecting drone operations. The
attention mechanisms dynamically weight environmental factors including wind patterns, wind bearing, and temperature to enhance routing decisions under adverse weather conditions. Experimental results demonstrate that our weather-aware models achieve significant computational speedup over traditional
algorithms while maintaining route optimization performance, with
transformer-based architectures showing superior adaptation to dynamic environmental constraints. The proposed framework enables real-time, weather-responsive route optimization for large-scale DaaS operations, representing a substantial advancement in the efficiency and safety of autonomous drone systems.
Read the full abstract ▾
All authors Kamal Mohamed, Lillian Wassim, Ali Hamdi, Khaled Shaban
Machine Learning
Enhancing Small Dataset Classification Using Projected Quantum Kernels with Convolutional Neural Networks
A.M.A.S.D. Alagiyawanna, Asoka Karunananda, A. Mahasinghe et al. (+1 more)
Convolutional Neural Networks (CNNs) have shown promising results in efficiency and accuracy in image classification. However, their efficacy often relies on large, labeled
datasets, posing challenges for applications with limited data availability. Our research addresses these challenges by introducing an innovative approach that leverages projected
quantum kernels (PQK) to enhance feature extraction for CNNs, specifically tailored for small
datasets. Projected
quantum kernels, derived from
quantum computing principles, offer a promising avenue for capturing complex patterns and intricate data structures that traditional CNNs might miss. By incorporating these kernels into the feature extraction process, we improved the representational ability of CNNs. Our experiments demonstrated that, with 1000 training samples, the PQK-enhanced CNN achieved 95% accuracy on the MNIST
dataset and 90% on the CIFAR-10
dataset, significantly outperforming the classical CNN, which achieved only 60% and 12% accuracy on the respective
datasets. This research reveals the potential of
quantum computing in overcoming data scarcity issues in machine learning and paves the way for future exploration of
quantum-assisted neural networks, suggesting that projected
quantum kernels can serve as a powerful approach for enhancing CNN-based classification in data-constrained environments.
Read the full abstract ▾
All authors A.M.A.S.D. Alagiyawanna, Asoka Karunananda, A. Mahasinghe, Thushari Silva
Machine Learning · Cross-listed from cs.CL
A path to natural language through tokenisation and transformers
David S. Berman and Alexander G. Stapleton
Natural
languages exhibit striking regularities in their statistical structure, including notably the emergence of Zipf's and Heaps' laws. Despite this, it remains broadly unclear how these properties relate to the modern tokenisation schemes used in contemporary
transformer models. In this note, we analyse the information content (as measured by the Shannon
entropy) of various corpora under the assumption of a Zipfian frequency distribution, and derive a closed-form expression for the slot
entropy expectation value. We then empirically investigate how byte–pair encoding (BPE) transforms corpus statistics, showing that recursive applications of BPE drive
token frequencies toward a Zipfian power law while inducing a characteristic growth pattern in empirical
entropy. Utilizing the ability of
transformers to learn context dependent
token probability distributions, we train
language models on corpora tokenised at varying BPE depths, revealing that the model predictive
entropies increasingly agree with Zipf-derived predictions as the BPE depth increases.
Attention-based diagnostics further indicate that deeper tokenisation reduces local
token dependencies, bringing the empirical distribution closer to the weakly dependent (near IID) regime. Together, these results clarify how BPE acts not only as a compression mechanism but also as a statistical transform that reconstructs key informational properties of natural
language.
Read the full abstract ▾
Machine Learning
Physics-Informed Gaussian Process Regression for the Constitutive Modeling of Concrete: A Data-Driven Improvement to Phenomenological Models
Chenyang Li, Himanshu Sharma, Youcai Wu et al. (+3 more)
Understanding and modeling the constitutive behavior of concrete is crucial for civil and defense applications, yet widely used phenomenological models such as Karagozian & Case concrete (KCC) model depend on empirically calibrated failure surfaces that lack flexibility in model form and associated uncertainty quantification. This work develops a physics-informed framework that retains the modular elastoplastic structure of KCC model while replacing its empirical failure surface with a constrained Gaussian Process Regression (GPR) surrogate that can be learned directly from experimentally accessible observables. Triaxial compression data under varying confinement levels are used for training, and the surrogate is then evaluated at confinement levels not included in the training set to assess its generalization capability. Results show that an unconstrained GPR interpolates well near training conditions but deteriorates and violates essential physical constraints under extrapolation, even when augmented with simulated data. In contrast, a physics-informed GPR that incorporates derivative-based constraints aligned with known material behavior yields markedly better accuracy and reliability, including at higher confinement levels beyond the training range. Probabilistic enforcement of these constraints also reduces predictive variance, producing tighter confidence intervals in data-scarce regimes. Overall, the proposed approach delivers a robust, uncertainty-aware surrogate that improves generalization and streamlines calibration without sacrificing the interpretability and numerical efficiency of the KCC model, offering a practical path toward an improved constitutive models for concrete.
Read the full abstract ▾
All authors Chenyang Li, Himanshu Sharma, Youcai Wu, Joseph Magallanes, K.T. Ramesh, Michael D. Shields
Machine Learning
LUT-KAN: Segment-wise LUT Quantization for Fast KAN Inference
Oleksandr Kuznetsov
Kolmogorov–Arnold Networks (KAN) replace scalar weights by learnable univariate functions, often implemented with B-splines. This design can be accurate and interpretable, but it makes inference expensive on CPU because each layer requires many spline evaluations. Standard quantization toolchains are also hard to apply because the main computation is not a
matrix multiply but repeated spline basis evaluation. This paper introduces LUT-KAN, a segment-wise lookup-table (LUT) compilation and quantization method for PyKAN-style KAN layers. LUT-KAN converts each edge function into a per-segment LUT with affine int8/uint8 quantization and linear interpolation. The method provides an explicit and reproducible inference contract, including boundary conventions and out-of-bounds (OOB) policies. We propose an “honest baseline” methodology for speed evaluation: B-spline evaluation and LUT evaluation are compared under the same backend optimization (NumPy vs NumPy and Numba vs Numba), which separates representation gains from vectorization and JIT effects. Experiments include controlled sweeps over LUT resolution L in 16, 32, 64, 128 and two quantization schemes (symmetric int8 and asymmetric uint8). We report accuracy, speed, and
memory metrics with mean and standard deviation across multiple seeds. A two-by-two OOB robustness
matrix evaluates behavior under different boundary modes and OOB policies. In a case study, we compile a trained KAN model for DoS attack detection (CICIDS2017 pipeline) into LUT artifacts. The compiled model preserves classification quality (F1 drop below 0.0002) while reducing steady-state CPU inference latency by 12x under NumPy and 10x under Numba backends (honest baseline). The
memory overhead is approximately 10x at L=64. All code and artifacts are publicly available with fixed release tags for reproducibility.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Yang Shi, Yifeng Xie, Minzhe Guo et al. (+6 more)
Recent advances in
Vision-
Language Models (VLMs) have improved performance in multi-modal learning, raising the question of whether these models truly understand the content they process. Crucially, can VLMs detect when a
reasoning process is wrong and identify its error type? To answer this, we present MMErroR, a multi-modal
benchmark of 1997 samples, each
embedding a single coherent
reasoning error. These samples span 24 subdomains across six top-level domains, ensuring broad coverage and taxonomic richness. Unlike existing
benchmarks that focus on answer correctness, MMErroR targets a process-level, error-centric evaluation that requires models to detect incorrect
reasoning and classify the error type within both visual and linguistic contexts. We evaluate 12 representative VLMs, and even the best model, Gemini-3-Pro-Preview, classifies the error correctly in only 66.65% of cases, underscoring the challenge of identifying erroneous
reasoning. Furthermore, the ability to accurately identify errors offers valuable insights into the capabilities of multi-modal models. Project Page: https://mmerror-
benchmark.github.io
Read the full abstract ▾
All authors Yang Shi, Yifeng Xie, Minzhe Guo, Liangsi Lu, Mingxuan Huang, Jingchao Wang, Zhihong Zhu, Boyan Xu, Zhiqi Huang
Machine Learning
Attention mechanisms in neural networks
Hasi Hays
Attention mechanisms represent a fundamental paradigm shift in neural network architectures, enabling models to selectively focus on relevant portions of input sequences through learned weighting functions. This monograph provides a comprehensive and rigorous mathematical treatment of
attention mechanisms, encompassing their theoretical foundations, computational properties, and practical implementations in contemporary deep learning systems. Applications in natural
language processing, computer
vision, and
multimodal learning demonstrate the versatility of
attention mechanisms. We examine
language modeling with autoregressive
transformers, bidirectional encoders for representation learning, sequence-to-sequence translation,
Vision Transformers for image classification, and cross-modal
attention for
vision-
language tasks. Empirical analysis reveals training characteristics, scaling laws that relate performance to model size and computation,
attention pattern visualizations, and performance
benchmarks across standard
datasets. We discuss the interpretability of learned
attention patterns and their relationship to linguistic and visual structures. The monograph concludes with a critical examination of current limitations, including computational scalability, data efficiency, systematic generalization, and interpretability challenges.
Read the full abstract ▾
Machine Learning
Extreme-value forest fire prediction A study of the Loss Function in an Ordinality Scheme
Nicolas Caron, Christophe Guyeux, Hassan Noura et al. (+1 more)
Wildfires are highly imbalanced natural hazards in both space and severity, making the prediction of extreme events particularly challenging. In this work, we introduce the first ordinal classification framework for
forecasting wildfire severity levels directly aligned with operational decision-making in France. Our study investigates the influence of loss-function design on the ability of neural models to predict rare yet critical high-severity fire occurrences. We compare standard cross-
entropy with several ordinal-aware objectives, including the proposed probabilistic TDeGPD loss derived from a truncated discrete exponentiated Generalized Pareto Distribution. Through extensive benchmarking over multiple architectures and real operational data, we show that ordinal supervision substantially improves model performance over conventional approaches. In particular, the Weighted Kappa Loss (WKLoss) achieves the best overall results, with more than +0.1 IoU (Intersection Over Union) gain on the most extreme severity classes while maintaining competitive calibration quality. However, performance remains limited for the rarest events due to their extremely low representation in the
dataset. These findings highlight the importance of integrating both severity ordering, data imbalance considerations, and seasonality risk into wildfire
forecasting systems. Future work will focus on incorporating seasonal dynamics and uncertainty information into training to further improve the reliability of extreme-event prediction.
Read the full abstract ▾
All authors Nicolas Caron, Christophe Guyeux, Hassan Noura, Benjamin Aynes
Machine Learning · Cross-listed from cs.CV
Higher order PCA-like rotation-invariant features for detailed shape descriptors modulo rotation
Jarek Duda
PCA can be used for rotation invariant features, describing a shape with its $p_{ab}=E[(x_i-E[x_a])(x_b-E[x_b])]$ covariance
matrix approximating shape by ellipsoid, allowing for rotation invariants like its traces of powers. However, real shapes are usually much more complicated, hence there is proposed its extension to e.g. $p_{abc}=E[(x_a-E[x_a])(x_b-E[x_b])(x_c-E[x_c])]$ order-3 or higher tensors describing central moments, or
polynomial times Gaussian allowing decodable shape descriptors of arbitrarily high accuracy, and their analogous rotation invariants. Its practical applications could be rotation-invariant features to include shape modulo rotation e.g. for molecular shape descriptors, or for up to rotation object recognition in 2D images/3D scans maybe also for 3D scene understanding, or shape similarity metric allowing inexpensive comparison of objects modulo rotation avoiding costly optimization over rotations.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
On the Identifiability of Regime-Switching Models with Multi-Lag Dependencies
Carles Balsells-Rodas, Toshiko Matsui, Pedro A.M. Mediano et al. (+2 more)
Identifiability is central to the interpretability of deep latent variable models, ensuring parameterisations are uniquely determined by the data-generating distribution. However, it remains underexplored for deep regime-switching time series. We develop a general theoretical framework for multi-lag Regime-Switching Models (RSMs), encompassing Markov Switching Models (MSMs) and Switching Dynamical Systems (SDSs). For MSMs, we formulate the model as a temporally structured finite mixture and prove identifiability of both the number of regimes and the multi-lag transitions in a nonlinear-Gaussian setting. For SDSs, we establish identifiability of the latent variables up to permutation and scaling via temporal structure, which in turn yields conditions for identifiability of regime-dependent latent causal graphs (up to regime/node permutations). Our results hold in a fully unsupervised setting through architectural and noise assumptions that are directly enforceable via neural network design. We complement the theory with a flexible variational
estimator that satisfies the assumptions and validate the results on synthetic
benchmarks. Across real-world
datasets from neuroscience, finance, and
climate, identifiability leads to more trustworthy interpretability analysis, which is crucial for scientific discovery.
Read the full abstract ▾
All authors Carles Balsells-Rodas, Toshiko Matsui, Pedro A.M. Mediano, Yixin Wang, Yingzhen Li
Machine Learning · Cross-listed from cs.CL
Bare-Metal Tensor Virtualization: Overcoming the Memory Wall in Edge-AI Inference on ARM64
Bugra Kilictas and Faruk Alpay
The deployment of Large
Language Models (LLMs) on edge devices is fundamentally constrained by the "
Memory Wall" the bottleneck where data movement latency outstrips arithmetic throughput. Standard inference runtimes often incur significant overhead through high-level abstractions, dynamic dispatch, and unaligned
memory access patterns. In this work, we present a novel "Virtual Tensor Core" architecture implemented in software, optimized specifically for ARM64 microarchitectures (Apple Silicon). By bypassing standard library containers in favor of direct
memory mapping (mmap) and implementing hand-tuned NEON SIMD kernels, we achieve a form of "Software-Defined Direct
Memory Access (DMA)." Our proposed Tensor Virtualization Layout (TVL) guarantees 100% cache line utilization for weight
matrices, while our zero-copy loader eliminates initialization latency. Experimental results on a 110M parameter model demonstrate a stable throughput of >60
tokens/second on M2 hardware. While proprietary hardware accelerators (e.g., Apple AMX) can achieve higher peak throughput, our architecture provides a fully open, portable, and deterministic reference implementation for studying the
memory bottleneck on general-purpose ARM silicon, meeting the 200ms psycholinguistic latency threshold without opaque dependencies.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.GR
Listen to Rhythm, Choose Movements: Autoregressive Multimodal Dance Generation via Diffusion and Mamba with Decoupled Dance Dataset
Oran Duan, Yinghua Shen, Yingzhu Lv et al. (+3 more)
Advances in generative models and sequence learning have greatly promoted research in dance motion generation, yet current methods still suffer from coarse semantic control and poor coherence in long sequences. In this work, we present Listen to Rhythm, Choose Movements (LRCM), a
multimodal-guided
diffusion framework supporting both diverse input modalities and autoregressive dance motion generation. We explore a feature decoupling paradigm for dance
datasets and generalize it to the Motorica Dance
dataset, separating motion capture data, audio rhythm, and professionally annotated global and local text descriptions. Our
diffusion architecture integrates an audio-latent Conformer and a text-latent Cross-Conformer, and incorporates a Motion Temporal Mamba Module (MTMM) to enable smooth, long-duration autoregressive synthesis. Experimental results indicate that LRCM delivers strong performance in both functional capability and quantitative metrics, demonstrating notable potential in
multimodal input scenarios and extended sequence generation. The project page is available at https://oranduanstudy.github.io/LRCM/.
Read the full abstract ▾
All authors Oran Duan, Yinghua Shen, Yingzhu Lv, Luyang Jie, Yaxin Liu, Qiong Wu
Machine Learning
Shanglin Li, Shiwen Chu, Okan Koç et al. (+4 more)
Electroencephalography (
EEG)-based
brain-computer interfaces facilitate direct communication with a computer, enabling promising applications in human-computer interactions. However, their utility is currently limited because
EEG decoding often suffers from poor generalization due to distribution shifts across domains (e.g., subjects). Learning robust representations that capture underlying task-relevant information would mitigate these shifts and improve generalization. One promising approach is to exploit the underlying hierarchical structure in
EEG, as recent studies suggest that hierarchical cognitive processes, such as visual processing, can be encoded in
EEG. While many decoding methods still rely on Euclidean
embeddings, recent work has begun exploring
hyperbolic geometry for
EEG.
Hyperbolic spaces, regarded as the continuous analogue of tree structures, provide a natural geometry for representing hierarchical data. In this study, we first empirically demonstrate that
EEG data exhibit hyperbolicity and show that
hyperbolic embeddings improve generalization. Motivated by these findings, we propose HEEGNet, a hybrid
hyperbolic network architecture to capture the hierarchical structure in
EEG and learn domain-invariant
hyperbolic embeddings. To this end, HEEGNet combines both Euclidean and
hyperbolic encoders and employs a novel coarse-to-fine domain adaptation strategy. Extensive experiments on multiple public
EEG datasets, covering visual evoked potentials,
emotion recognition, and intracranial
EEG, demonstrate that HEEGNet achieves state-of-the-art performance. The code is available at https://github.com/fightlesliefigt/HEEGNet
Read the full abstract ▾
All authors Shanglin Li, Shiwen Chu, Okan Koç, Yi Ding, Qibin Zhao, Motoaki Kawanabe, Ziheng Chen
Machine Learning
HERO: Hierarchical Evidential Reasoning Optimization for Radiology Report Generation via Reason-then-Summarize
Kun Zhao, Guodong Liu, Hui Ji et al. (+7 more)
Multimodal Large
Language Models (MLLMs) have substantially advanced Radiology Report Generation (RRG), yet aligning them through reinforcement learning (RL) remains challenging due to heterogeneous medical supervision. Vanilla Group Relative Policy Optimization (GRPO) assigns uniform credit across the entire generation, leading to segment interference,
token dilution, and rationale-diagnosis decoupling, which exacerbates clinical
hallucinations. We propose HERO (Hierarchical rationalE
Reasoning Optimization), a factorized policy optimization framework that aligns heterogeneous supervision with three optimization granularities. HERO separately optimizes
reasoning, diagnosis, and rationale faithfulness through complementary segment-,
token-, and completion-level optimization with a heterogeneous reward formulation covering diagnostic accuracy,
reasoning quality, and think-answer consistency. Experiments on MIMIC-CXR and IU-Xray show that HERO outperforms strong supervised and reinforcement learning baselines, achieving state-of-the-art clinical efficacy while producing more rationale-supported and think-answer-consistent reports, thereby substantially mitigating clinical
hallucinations.
Read the full abstract ▾
All authors Kun Zhao, Guodong Liu, Hui Ji, Siyuan Dai, Pan Wang, Jifeng Song, Heng Huang, Chenghua Lin, Liang Zhan, Haoteng Tang
Machine Learning
Ratio-Variance Regularized Policy Optimization for Efficient LLM Fine-tuning
Yu Luo, Shuo Han, Yihan Hu et al. (+2 more)
On-policy reinforcement learning (RL), particularly Proximal Policy Optimization (PPO) and Group Relative Policy Optimization (GRPO), has become the dominant paradigm for fine-tuning large
language models (LLMs). While policy ratio clipping stabilizes training, this heuristic hard constraint incurs a fundamental cost: it indiscriminately truncates gradients from high-return yet high-divergence actions, suppressing rare but highly informative "eureka moments" in complex
reasoning. Moreover, once data becomes slightly stale, hard clipping renders it unusable, leading to severe sample inefficiency. In this work, we revisit the trust-region objective in policy optimization and show that explicitly constraining the variance (second central moment) of the policy ratio provides a principled and smooth relaxation of hard clipping. This distributional constraint stabilizes policy updates while preserving gradient signals from valuable trajectories. Building on this insight, we propose $R^2VPO$ (Ratio-Variance Regularized Policy Optimization), a novel primal-dual framework that supports stable on-policy learning and enables principled off-policy data reuse by dynamically reweighting stale samples rather than discarding them. We extensively evaluate $R^2VPO$ on fine-tuning state-of-the-art LLMs, including DeepSeek-Distill-Qwen-1.5B and the openPangu-Embedded series (1B and 7B), across challenging mathematical
reasoning benchmarks. Experimental results show that $R^2VPO$ consistently achieves superior asymptotic performance, with average relative gains of up to 17% over strong clipping-based baselines, while requiring approximately 50% fewer rollouts to reach convergence. These findings establish ratio-variance control as a promising direction for improving both stability and data efficiency in RL-based LLM
alignment.
Read the full abstract ▾
All authors Yu Luo, Shuo Han, Yihan Hu, Dong Li, Jianye Hao
Machine Learning · Cross-listed from cs.GR
CaricatureGS: Exaggerating 3D Gaussian Splatting Faces With Gaussian Curvature
Eldad Matmon, Amit Bracha, Noam Rotstein et al. (+1 more)
A photorealistic and controllable 3D caricaturization framework for faces is introduced. We start with an intrinsic Gaussian
curvature-based surface exaggeration technique, which, when coupled with texture, tends to produce over-smoothed renders. To address this, we resort to 3D Gaussian Splatting (3DGS), which has recently been shown to produce realistic free-viewpoint avatars. Given a multiview sequence, we extract a FLAME mesh, solve a
curvature-weighted Poisson equation, and obtain its exaggerated form. However, directly deforming the Gaussians yields poor results, necessitating the synthesis of pseudo-ground-truth caricature images by warping each frame to its exaggerated 2D representation using local affine transformations. We then devise a training scheme that alternates real and synthesized supervision, enabling a single Gaussian collection to represent both natural and exaggerated avatars. This scheme improves fidelity, supports local edits, and allows continuous control over the intensity of the caricature. In order to achieve real-time deformations, an efficient interpolation between the original and exaggerated surfaces is introduced. We further analyze and show that it has a bounded deviation from closed-form solutions. In both quantitative and qualitative evaluations, our results outperform prior work, delivering photorealistic, geometry-controlled caricature avatars.
Read the full abstract ▾
All authors Eldad Matmon, Amit Bracha, Noam Rotstein, Ron Kimmel
Machine Learning
Why LLMs Aren't Scientists Yet: Lessons from Four Autonomous Research Attempts
Dhruv Trehan and Paras Chopra
We report a case study of four end-to-end attempts to autonomously generate ML research papers using a pipeline of six LLM
agents mapped to stages of the scientific workflow. Of these four, three attempts failed during implementation or evaluation. One completed the pipeline and was accepted to
Agents4Science 2025, an experimental inaugural venue that required AI systems as first authors, passing both human and multi-AI review. From these attempts, we document six recurring failure modes: bias toward training data defaults, implementation drift under execution pressure,
memory and context degradation across long-horizon tasks, overexcitement that declares success despite obvious failures, insufficient domain intelligence, and weak scientific taste in experimental design. We conclude by discussing four design principles for more robust AI-scientist systems, implications for autonomous scientific discovery, and we release all
prompts, artifacts, and outputs at https://github.com/Lossfunk/ai-scientist-artefacts-v1
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
Mastering the Game of Go with Self-play Experience Replay
Jingbin Liu and Xuechun Wang
The game of Go has long served as a
benchmark for artificial intelligence, demanding sophisticated strategic
reasoning and long-term planning. Previous approaches such as AlphaGo and its successors, have predominantly relied on model-based Monte-Carlo Tree Search (MCTS). In this work, we present QZero, a novel model-free reinforcement learning
algorithm that forgoes search during training and learns a Nash
equilibrium policy through self-play and off-policy experience replay. Built upon
entropy-regularized Q-learning, QZero utilizes a single Q-value network to unify policy evaluation and improvement. Starting tabula rasa without human data and trained for 5 months with modest compute resources (7 GPUs), QZero achieved a performance level comparable to that of AlphaGo. This demonstrates, for the first time, the efficiency of using model-free reinforcement learning to master the game of Go, as well as the feasibility of off-policy reinforcement learning in solving large-scale and complex environments.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CR
TRYLOCK: Defense-in-Depth Against LLM Jailbreaks via Layered Preference and Representation Engineering
Scott Thornton
Large
language models remain vulnerable to jailbreak attacks, and single-layer defenses often trade security for usability. We present TRYLOCK, the first defense-in-depth architecture that combines four heterogeneous mechanisms across the inference stack: weight-level safety
alignment via DPO, activation-level control via Representation Engineering (RepE) steering, adaptive steering strength selected by a lightweight sidecar classifier, and input canonicalization to neutralize encoding-based bypasses. On Mistral-7B-Instruct evaluated against a 249-
prompt attack set spanning five attack families, TRYLOCK achieves 88.0% relative ASR reduction (46.5% to 5.6%), with each layer contributing unique coverage: RepE blocks 36% of attacks that bypass DPO alone, while canonicalization catches 14% of encoding attacks that evade both. We discover a non-monotonic steering phenomenon – intermediate strength (alpha=1.0) degrades safety below baseline – and provide mechanistic hypotheses explaining RepE-DPO interference. The adaptive sidecar reduces over-refusal from 60% to 48% while maintaining identical attack defense, demonstrating that security and usability need not be mutually exclusive. We release all components – trained adapters, steering vectors, sidecar classifier, preference pairs, and complete evaluation methodology – enabling full reproducibility.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
Self-Supervised Learning from Noisy and Incomplete Data
Julián Tachella and Mike Davies
Many important problems in science and engineering involve inferring a signal from noisy and/or incomplete observations, where the observation process is known. Historically, this problem has been tackled using hand-crafted regularization (e.g., sparsity, total-variation) to obtain meaningful estimates. Recent data-driven methods often offer better solutions by directly learning a solver from examples of ground-truth signals and associated observations. However, in many real-world applications, obtaining ground-truth references for training is expensive or impossible. Self-supervised learning methods offer a promising alternative by learning a solver from measurement data alone, bypassing the need for ground-truth references. This manuscript provides a comprehensive summary of different self-supervised methods for inverse problems, with a special emphasis on their theoretical underpinnings, and presents practical applications in imaging inverse problems.
Read the full abstract ▾
Machine Learning
PET-TURTLE: Deep Unsupervised Support Vector Machines for Imbalanced Data Clusters
Javier Salazar Cavazos
Foundation
vision, audio, and
language models enable zero-shot performance on downstream tasks via their latent representations. Recently, unsupervised learning of data group structure with deep learning methods has gained popularity. TURTLE, a state of the art deep clustering
algorithm, uncovers data labeling without supervision by alternating label and hyperplane updates, maximizing the hyperplane margin, in a similar fashion to support vector machines (SVMs). However, TURTLE assumes clusters are balanced; when data is imbalanced, it yields non-ideal hyperplanes that cause higher clustering error. We propose PET-TURTLE, which generalizes the cost function to handle imbalanced data distributions by a power law prior. Additionally, by introducing sparse logits in the labeling process, PET-TURTLE optimizes a simpler search space that in turn improves accuracy for balanced
datasets. Experiments on synthetic and real data show that PET-TURTLE improves accuracy for imbalanced sources, prevents over-prediction of minority clusters, and enhances overall clustering.
Read the full abstract ▾
Machine Learning · Cross-listed from quant-ph
Shallow-circuit Supervised Learning on a Quantum Processor
Luca Candelori, Swarnadeep Majumder, Antonio Mezzacapo et al. (+6 more)
Quantum computing has long promised transformative advances in data analysis, yet practical
quantum machine learning has remained elusive due to fundamental obstacles such as a steep
quantum cost for the loading of classical data and poor trainability of many
quantum machine learning
algorithms designed for near-term
quantum hardware. In this work, we show that one can overcome these obstacles by using a linear
Hamiltonian-based machine learning method which provides a compact
quantum representation of classical data via ground state problems for k-local
Hamiltonians. We use the recent sample-based Krylov
quantum diagonalization method to compute low-energy states of the data
Hamiltonians, whose parameters are trained to express classical
datasets through local gradients. We demonstrate the efficacy and scalability of the methods by performing experiments on
benchmark datasets using up to 50
qubits of an IBM Heron
quantum processor.
Read the full abstract ▾
All authors Luca Candelori, Swarnadeep Majumder, Antonio Mezzacapo, Javier Robledo Moreno, Kharen Musaelian, Santhanam Nagarajan, Sunil Pinnamaneni, Kunal Sharma, Dario Villani
Machine Learning
From Entropy to Epiplexity: Rethinking Information for Computationally Bounded Intelligence
Marc Finzi, Shikai Qiu, Yiding Jiang et al. (+3 more)
Can we learn more from data than existed in the generating process itself? Can new and useful information be constructed from merely applying deterministic transformations to existing data? Can the learnable content in data be evaluated without considering a downstream task? On these questions, Shannon information and Kolmogorov complexity come up nearly empty-handed, in part because they assume observers with unlimited computational capacity and do not target the useful information content. In this work, we identify and exemplify three seeming paradoxes in information theory: (1) information cannot be increased by deterministic transformations; (2) information is independent of the order of data; (3) likelihood modeling is merely distribution matching. To shed light on the tension between these results and modern practice, and to quantify the value of data, we introduce epiplexity, a formalization of information capturing what computationally bounded observers can learn from data. Epiplexity captures the structural content in data while excluding time-bounded
entropy, the random unpredictable content exemplified by pseudorandom number generators and chaotic dynamical systems. With these concepts, we demonstrate how information can be created with computation, how it depends on the ordering of the data, and how likelihood modeling can produce more complex programs than present in the data generating process itself. We also present practical procedures to estimate epiplexity which we show capture differences across data sources, track with downstream performance, and highlight
dataset interventions that improve out-of-distribution generalization. In contrast to principles of model selection, epiplexity provides a theoretical foundation for data selection, guiding how to select, generate, or transform data for learning systems.
Read the full abstract ▾
All authors Marc Finzi, Shikai Qiu, Yiding Jiang, Pavel Izmailov, J. Zico Kolter, Andrew Gordon Wilson
Machine Learning
Critic-Guided Reinforcement Unlearning in Text-to-Image Diffusion
Mykola Vysotskyi, Zahar Kohut, Mariia Shpir et al. (+2 more)
Machine unlearning in text-to-image
diffusion models aims to remove targeted concepts while preserving overall utility. Prior
diffusion unlearning methods typically rely on supervised weight edits or global penalties; reinforcement-learning (RL) approaches, while flexible, often optimize sparse end-of-trajectory rewards, yielding high-variance updates and weak credit assignment. We present a general RL framework for
diffusion unlearning that treats denoising as a sequential decision process and introduces a timestep-aware critic with noisy-step rewards. Concretely, we train a CLIP-based reward predictor on noisy latents and use its per-step signal to compute advantage estimates for policy-gradient updates of the reverse
diffusion kernel. Our
algorithm is simple to implement, supports off-policy reuse, and plugs into standard text-to-image backbones. Across multiple concepts, the method achieves better or comparable forgetting to strong baselines while maintaining image quality and benign
prompt fidelity; ablations show that (i) per-step critics and (ii) noisy-conditioned rewards are key to stability and effectiveness. We release code and evaluation scripts to facilitate reproducibility and future research on RL-based
diffusion unlearning.
Read the full abstract ▾
All authors Mykola Vysotskyi, Zahar Kohut, Mariia Shpir, Taras Rumezhak, Volodymyr Karpiv
Machine Learning
Counterfactual Fairness with Graph Uncertainty
Davi Valério, Chrysoula Zerva, Mariana Pinto et al. (+2 more)
Evaluating machine learning (ML) model bias is key to building trustworthy and robust ML systems. Counterfactual
Fairness (CF) audits allow the measurement of bias of ML models with a causal framework, yet their conclusions rely on a single causal graph that is rarely known with certainty in real-world scenarios. We propose CF with Graph Uncertainty (CF-GU), a bias evaluation procedure that incorporates the uncertainty of specifying a causal graph into CF. CF-GU (i) bootstraps a Causal Discovery
algorithm under domain knowledge constraints to produce a bag of plausible Directed Acyclic Graphs (DAGs), (ii) quantifies graph uncertainty with the normalized Shannon
entropy, and (iii) provides confidence bounds on CF metrics. Experiments on synthetic data show how contrasting domain knowledge assumptions support or refute audits of CF, while experiments on real-world data (COMPAS and Adult
datasets) pinpoint well-known biases with high confidence, even when supplied with minimal domain knowledge constraints.
Read the full abstract ▾
All authors Davi Valério, Chrysoula Zerva, Mariana Pinto, Ricardo Santos, André Carreiro
Machine Learning
Empowering Reliable Visual-Centric Instruction Following in MLLMs
Weilei He, Feng Ju, Zhiyuan Fan et al. (+3 more)
Evaluating the instruction-following (IF) capabilities of
Multimodal Large
Language Models (MLLMs) is essential for rigorously assessing how faithfully model outputs adhere to user-specified intentions. Nevertheless, existing
benchmarks for evaluating MLLMs' instruction-following capability primarily focus on verbal instructions in the textual modality. These limitations hinder a thorough analysis of instruction-following capabilities, as they overlook the implicit constraints embedded in the semantically rich visual modality. To address this gap, we introduce VC-IFEval, a new
benchmark accompanied by a systematically constructed
dataset that evaluates MLLMs' instruction-following ability under
multimodal settings. Our
benchmark systematically incorporates
vision-dependent constraints into instruction design, enabling a more rigorous and fine-grained assessment of how well MLLMs align their outputs with both visual input and textual instructions. Furthermore, by fine-tuning MLLMs on our
dataset, we achieve substantial gains in visual instruction-following accuracy and adherence. Through extensive evaluation across representative MLLMs, we provide new insights into the strengths and limitations of current models.
Read the full abstract ▾
All authors Weilei He, Feng Ju, Zhiyuan Fan, Rui Min, Minhao Cheng, Yi R. Fung
Machine Learning
Sparse Knowledge Distillation: A Mathematical Framework for Probability-Domain Temperature Scaling and Multi-Stage Compression
Aaron R. Flouro and Shawn P. Chadwick
We develop a unified theoretical framework for sparse knowledge
distillation based on probability-domain softening operators. While the equivalence $p^{1/T} \propto \mathrm{softmax}(z/T)$ is well known, our contribution is an operator-level analytical framework built on this foundation rather than the equivalence itself. The framework comprises four core components: (i) operator-agnostic bias–variance decompositions that characterize when sparse students outperform dense teachers, (ii) a homotopy path formalization of multi-stage
pruning in function space explaining why iterative compression succeeds where one-shot
pruning fails, (iii) convergence guarantees establishing $O(1/n)$ rates for $n$-stage
distillation with explicit parameter dependence, and (iv) equivalence class characterizations identifying distinct probability-domain operators that yield identical student models under capacity constraints. We introduce an axiomatic definition of probability-domain softening operators based on ranking preservation, continuity,
entropy monotonicity, identity, and boundary behavior, and show that multiple non-equivalent operator families satisfy these axioms. All learning-theoretic guarantees are shown to hold uniformly across this operator class, independent of implementation details. These results provide theoretical grounding for black-box teacher
distillation, partial-access settings such as top-$k$ truncation and text-only outputs, and
privacy-preserving model compression.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
AnatomiX, an Anatomy-Aware Grounded Multimodal Large Language Model for Chest X-Ray Interpretation
Anees Ur Rehman Hashmi, Numan Saeed and Christoph Lippert
Multimodal medical large
language models have shown substantial progress in chest X-ray interpretation but continue to face challenges in spatial
reasoning and anatomical understanding. Although existing grounding techniques improve overall performance, they often fail to establish a true anatomical correspondence, resulting in incorrect anatomical understanding in the medical domain. To address this gap, we introduce AnatomiX, a multitask
multimodal large
language model for anatomically grounded chest X-ray interpretation. Inspired by the radiological workflow, AnatomiX adopts a two stage approach: first, it identifies anatomical structures and extracts their features, and then leverages a large
language model to perform diverse downstream tasks such as phrase grounding, report generation, visual question answering, and image understanding. Extensive experiments across multiple
benchmarks demonstrate that AnatomiX achieves superior anatomical
reasoning and delivers over 25% improvement in performance on anatomy grounding, phrase grounding, grounded diagnosis and grounded captioning tasks compared to existing approaches. Code and pretrained model are available at https://aneesurhashmi.github.io/anatomix
Read the full abstract ▾
Machine Learning
Decentralized Autoregressive Generation
Stepan Maschan, Haoxuan Qu and Jun Liu
The decentralization of autoregressive generation has attracted considerable
attention in recent years as a solution to scaling bottlenecks. However, despite promising empirical results, this paradigm currently lacks rigorous theoretical justification. In this work, we formally establish the theoretical equivalence between decentralized and centralized training. To achieve this, we adapt the Discrete Flow Matching framework for autoregressive generation, leveraging its inherent properties to demonstrate that global models naturally decompose into independent experts. Finally, we conduct extensive experiments across diverse
multimodal benchmarks, empirically validating that decentralized training maintains competitive parity with standard centralized architectures.
Read the full abstract ▾
Machine Learning
Predicting Time Pressure of Powered Two-Wheeler Riders for Proactive Safety Interventions
Sumit S. Shevtekar, Chandresh K. Maurya and Gourab Sil
Time pressure critically influences risky maneuvers and crash proneness among powered two-wheeler riders, yet its prediction remains underexplored in intelligent transportation systems. To address this gap, we propose MotoTimePressure (MTPS), a deep learning model combining convolutional preprocessing, dual-stage temporal
attention, and Squeeze-and-Excitation feature recalibration, achieving 91.53% accuracy and 98.93% ROC AUC, outperforming six baselines, with only 172K parameters, 0.66 MB model size, and 0.21 ms inference on CPU. To validate and
benchmark MTPS, we present a
dataset of 129,209 feature windows from 153 simulator sessions by 51 experienced male PTW riders under No, Low, and High Time Pressure conditions. Each sequence captures 63 features spanning vehicle kinematics, control inputs, behavioral violations, and environmental context. Our empirical analysis shows High Time Pressure induces 48% higher speeds, 36.4% greater speed variability, 58% more risky turns at intersections, 36% more sudden braking, and 50% higher rear brake forces versus No Time Pressure. Since time pressure cannot be directly measured in real time, we demonstrate its utility in collision prediction and threshold determination. Using MTPS-predicted time pressure as a feature improves collision risk accuracy for both Informer (91.25% to 93.51%) and TimesNet (92.10% to 93.90%), approaching oracle performance (93.72% and 94.06%, respectively). Thresholded time pressure states capture rider cognitive stress and enable proactive ITS interventions, including adaptive alerts, haptic feedback, V2I signaling, and speed guidance, supporting safer two-wheeler mobility under the Safe System Approach.
Read the full abstract ▾