Machine Learning
Mixtures of Transparent Local Models
Niffa Cheick Oumar Diaby, Thierry Duchesne and Mario Marchand
The predominance of machine learning models in many spheres of human activity has led to a growing demand for their transparency. The transparency of models makes it possible to discern some factors, such as security or non-discrimination. In this paper, we propose a mixture of transparent local models as an alternative solution for designing interpretable (or transparent) models. Our approach is designed for the situations where a simple and transparent function is suitable for modeling the label of instances in some localities/regions of the input space, but may change abruptly as we move from one locality to another. Consequently, the proposed
algorithm is to learn both the transparent labeling function and the locality of the input space where the labeling function achieves a small risk in its assigned locality. By using a new multi-predictor (and multi-locality) loss function, we established rigorous PAC-
Bayesian risk bounds for the case of binary linear classification problem and that of linear regression. In both cases, synthetic data sets were used to illustrate how the learning
algorithms work. The results obtained from real data sets highlight the competitiveness of our approach compared to other existing methods as well as certain opaque models. Keywords: PAC-Bayes, risk bounds, local models, transparent models, mixtures of local transparent models.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.HC
CoGen: Creation of Reusable UI Components in Figma via Textual Commands
Ishani Kanapathipillai and Obhasha Priyankara
The
evolution of User Interface design has emphasized the need for efficient, reusable, and editable components to ensure an efficient design process. This research introduces CoGen, a system that uses machine learning techniques to generate reusable UI components directly in Figma, one of the most popular UI design tools. Addressing gaps in current systems, CoGen focuses on creating atomic components such as buttons, labels, and input fields using structured JSON and natural
language prompts. The project integrates Figma API data extraction, Seq2Seq models, and fine-tuned T5
transformers for component generation. The key results demonstrate the efficiency of the T5 model in
prompt generation, with an accuracy of 98% and a BLEU score of 0.2668, which ensures the mapping of JSON to descriptive
prompts. For JSON creation, CoGen achieves a success rate of up to 100% in generating simple JSON outputs for specified component types.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
Coarsening Causal DAG Models
Francisco Madaleno, Pratik Misra and Alex Markham
Directed acyclic graphical (DAG) models are a powerful tool for representing causal relationships among jointly distributed random variables, especially concerning data from across different experimental settings. However, it is not always practical or desirable to estimate a causal model at the granularity of given features in a particular
dataset. There is a growing body of research on causal abstraction to address such problems. We contribute to this line of research by (i) providing novel graphical identifiability results for practically-relevant interventional settings, (ii) proposing an efficient, provably consistent
algorithm for directly learning abstract causal graphs from interventional data with unknown intervention targets, and (iii) uncovering theoretical insights about the
lattice structure of the underlying search space, with connections to the field of causal discovery more generally. As proof of concept, we apply our
algorithm on synthetic and real
datasets with known ground truths, including measurements from a controlled physical system with interacting light intensity and polarization.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
A Safety Report on GPT-5.2, Gemini 3 Pro, Qwen3-VL, Grok 4.1 Fast, Nano Banana Pro, and Seedream 4.5
Xingjun Ma, Yixu Wang, Hengyuan Xu et al. (+18 more)
The rapid
evolution of Large
Language Models (LLMs) and
Multimodal Large
Language Models (MLLMs) has driven major gains in
reasoning, perception, and generation across
language and
vision, yet whether these advances translate into comparable improvements in safety remains unclear, partly due to fragmented evaluations that focus on isolated modalities or threat models. In this report, we present an integrated safety evaluation of six frontier models–GPT-5.2, Gemini 3 Pro, Qwen3-VL, Grok 4.1 Fast, Nano Banana Pro, and Seedream 4.5–assessing each across
language,
vision-
language, and image generation using a unified protocol that combines
benchmark,
adversarial,
multilingual, and compliance evaluations. By aggregating results into safety leaderboards and model profiles, we reveal a highly uneven safety landscape: while GPT-5.2 demonstrates consistently strong and balanced performance, other models exhibit clear trade-offs across
benchmark safety,
adversarial robustness,
multilingual generalization, and regulatory compliance. Despite strong results under standard
benchmarks, all models remain highly vulnerable under
adversarial testing, with worst-case safety rates dropping below 6%. Text-to-image models show slightly stronger
alignment in regulated visual risk categories, yet remain fragile when faced with
adversarial or semantically ambiguous
prompts. Overall, these findings highlight that safety in frontier models is inherently multidimensional–shaped by modality,
language, and evaluation design–underscoring the need for standardized, holistic safety assessments to better reflect real-world risk and guide responsible deployment.
Read the full abstract ▾
All authors Xingjun Ma, Yixu Wang, Hengyuan Xu, Yutao Wu, Yifan Ding, Yunhan Zhao, Zilong Wang, Jiabin Hua, Ming Wen, Jianan Liu, Ranjie Duan, Yifeng Gao, Yingshui Tan, Yunhao Chen, Hui Xue, Xin Wang, Wei Cheng, Jingjing Chen, Zuxuan Wu, Bo Li, Yu-Gang Jiang
Machine Learning
Transformer-Based Cognitive Radio: Adaptive Modulation Strategies Using Transformer Models
Andrea Melis, Andrea Piroddi and Roberto Girau
Cognitive
Radio (CR) systems, which dynamically adapt to changing spectrum environments, could benefit significantly from advancements in machine learning technologies. These systems can be enhanced in terms of spectral efficiency, robustness, and security through innovative approaches such as the use of
Transformer models. This work investigates the application of
Transformer models, specifically the GPT-2 architecture, to generate novel modulation schemes for wireless communications. By training a GPT-2 model on a
dataset of existing modulation formulas, new modulation schemes has been created. These generated schemes are then compared to traditional methods using key performance metrics such as Signal-to-Noise Ratio (SNR) and Power Spectrum Density (PSD). The results show that
Transformer-generated modulation schemes can achieve performance comparable to, and in some cases outperforming, traditional methods. This demonstrates that advanced CR systems could greatly benefit from the implementation of
Transformer models, leading to more efficient, robust, and secure communication systems.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
SatMap: Revisiting Satellite Maps as Prior for Online HD Map Construction
Kanak Mazumder and Fabian B. Flohr
Online high-definition (HD) map construction is an essential part of a safe and robust end-to-end autonomous driving (AD) pipeline. Onboard camera-based approaches suffer from limited depth perception and degraded accuracy due to occlusion. In this work, we propose SatMap, an online vectorized HD map estimation method that integrates satellite maps with multi-view camera observations and directly predicts a vectorized HD map for downstream prediction and planning modules. Our method leverages lane-level semantics and texture from satellite imagery captured from a Bird's Eye View (BEV) perspective as a global prior, effectively mitigating depth ambiguity and occlusion. In our experiments on the nuScenes
dataset, SatMap achieves 34.8% mAP performance improvement over the camera-only baseline and 8.5% mAP improvement over the camera-
LiDAR fusion baseline. Moreover, we evaluate our model in long-range and adverse weather conditions to demonstrate the advantages of using a satellite prior map. Source code will be available at https://iv.ee.hm.edu/satmap/.
Read the full abstract ▾
Machine Learning
PROMA: Projected Microbatch Accumulation for Reference-Free Proximal Policy Updates
Nilin Abrahamsen
This note introduces Projected Microbatch Accumulation (PROMA), a reference-free proximal policy method that controls KL divergence by projecting away high-variance components of the policy gradient. Two variants are presented. In the accumulation-based variant, the running gradient is projected orthogonal to the sequence-wise log-probability gradients of each microbatch. In the intra-microbatch variant, a factored projection using dominant subspaces of activations and gradient outputs is applied independently within each microbatch, making it compatible with standard data-parallel training. Empirically, the accumulation variant achieves tighter per-step KL control than GRPO with PPO clipping, while the intra-microbatch variant achieves the best validation performance.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
CROCS: A Two-Stage Clustering Framework for Behaviour-Centric Consumer Segmentation with Smart Meter Data
Luke W. Yerbury, Ricardo J. G. B. Campello, G. C. Livingston Jr et al. (+2 more)
With grid operators confronting rising uncertainty from renewable integration and a broader push toward electrification, Demand-Side Management (DSM) – particularly Demand Response (DR) – has attracted significant
attention as a cost-effective mechanism for balancing modern electricity systems. Unprecedented volumes of consumption data from a continuing global deployment of smart meters enable consumer
segmentation based on real usage behaviours, promising to inform the design of more effective DSM and DR programs. However, existing clustering-based
segmentation methods insufficiently reflect the behavioural diversity of consumers, often relying on rigid temporal
alignment, and faltering in the presence of anomalies, missing data, or large-scale deployments. To address these challenges, we propose a novel two-stage clustering framework – Clustered Representations Optimising Consumer
Segmentation (CROCS). In the first stage, each consumer's daily load profiles are clustered independently to form a Representative Load Set (RLS), providing a compact summary of their typical diurnal consumption behaviours. In the second stage, consumers are clustered using the Weighted Sum of Minimum Distances (WSMD), a novel set-to-set measure that compares RLSs by accounting for both the prevalence and similarity of those behaviours. Finally, community detection on the WSMD-induced graph reveals higher-order prototypes that embody the shared diurnal behaviours defining consumer groups, enhancing the interpretability of the resulting clusters. Extensive experiments on both synthetic and real Australian smart meter
datasets demonstrate that CROCS captures intra-consumer variability, uncovers both synchronous and asynchronous behavioural similarities, and remains robust to anomalies and missing data, while scaling efficiently through natural parallelisation. These results...
Read the full abstract ▾
All authors Luke W. Yerbury, Ricardo J. G. B. Campello, G. C. Livingston Jr, Mark Goldsworthy, Lachlan O'Neil
Machine Learning
Communication-Efficient Federated Learning by Exploiting Spatio-Temporal Correlations of Gradients
Shenlong Zheng, Zhen Zhang, Yuhui Deng et al. (+2 more)
Communication overhead is a critical challenge in
federated learning, particularly in bandwidth-constrained networks. Although many methods have been proposed to reduce communication overhead, most focus solely on compressing individual gradients, overlooking the temporal correlations among them. Prior studies have shown that gradients exhibit spatial correlations, typically reflected in low-rank structures. Through empirical analysis, we further observe a strong temporal correlation between client gradients across adjacent rounds. Based on these observations, we propose GradESTC, a compression technique that exploits both spatial and temporal gradient correlations. GradESTC exploits spatial correlations to decompose each full gradient into a compact set of basis vectors and corresponding combination coefficients. By exploiting temporal correlations, only a small portion of the basis vectors need to be dynamically updated in each round. GradESTC significantly reduces communication overhead by transmitting lightweight combination coefficients and a limited number of updated basis vectors instead of the full gradients. Extensive experiments show that, upon reaching a target accuracy level near convergence, GradESTC reduces uplink communication by an average of 39.79% compared to the strongest baseline, while maintaining comparable convergence speed and final accuracy to uncompressed FedAvg. By effectively leveraging spatio-temporal gradient structures, GradESTC offers a practical and scalable solution for communication-efficient
federated learning.
Read the full abstract ▾
All authors Shenlong Zheng, Zhen Zhang, Yuhui Deng, Geyong Min, Lin Cui
Machine Learning · Cross-listed from quant-ph
H-EFT-VA: An Effective-Field-Theory Variational Ansatz with Provable Barren Plateau Avoidance
Eyad I.B Hamid
Variational
Quantum Algorithms (VQAs) are critically threatened by the Barren Plateau (BP) phenomenon. In this work, we introduce the H-EFT Variational Ansatz (H-EFT-VA), an architecture inspired by Effective Field Theory (EFT). By enforcing a hierarchical "UV-cutoff" on initialization, we theoretically restrict the
circuit's state exploration, preventing the formation of approximate
unitary 2-designs. We provide a rigorous proof that this localization guarantees an inverse-
polynomial lower bound on the gradient variance: $Var[\partial\theta] \in \Omega(1/poly(N))$. Crucially, unlike approaches that avoid BPs by limiting
entanglement, we demonstrate that H-EFT-VA maintains volume-law
entanglement and near-Haar purity, ensuring sufficient expressibility for complex
quantum states. Extensive benchmarking across 16 experiments on the Transverse Field Ising Model confirms a 109x improvement in energy convergence and a 10.7x increase in ground-state fidelity over standard Hardware-Efficient Ansätze (HEA), with statistical significance of $p < 10^{-88}$. The static framework is most effective for
Hamiltonians with moderate reference-state overlap; extension to systems with larger reference-state gaps is addressed through dynamic UV-cutoff relaxation strategies explored in concurrent work.
Read the full abstract ▾
Machine Learning
DeFlow: Decoupling Behavior-Prior Modeling and Value Maximization for Offline Policy Extraction
Zhancun Mu and Chi Zhang
We present DeFlow, a decoupled offline RL framework that leverages flow matching to faithfully capture complex behavior
manifolds. Optimizing generative policies is computationally prohibitive, typically necessitating backpropagation through ODE solvers. We address this by learning a lightweight refinement module within an explicit, data-derived trust region of the flow
manifold, rather than sacrificing the iterative generation capability via single-step
distillation. This way, we bypass solver differentiation and eliminate the need for balancing loss terms, ensuring stable improvement while fully preserving the flow's iterative expressivity. Empirically, DeFlow achieves superior performance on the challenging OGBench
benchmark and demonstrates efficient offline-to-online adaptation.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
Contextual StereoSet: Stress-Testing Bias Alignment Robustness in Large Language Models
Abhinaba Basu and Pavan Chakraborty
A model that avoids stereotypes in a lab
benchmark may not avoid them in deployment. We show that measured bias shifts dramatically when
prompts mention different places, times, or audiences – no
adversarial prompting required. We introduce Contextual StereoSet, a
benchmark that holds stereotype content fixed while systematically varying contextual framing. Testing 13 models across two protocols, we find striking patterns: anchoring to 1990 (vs. 2030) raises stereotype selection in all models tested on this contrast (p<0.05); gossip framing raises it in 5 of 6 full-grid models; out-group observer framing shifts it by up to 13 percentage points. These effects replicate in hiring, lending, and help-seeking vignettes. We propose Context Sensitivity Fingerprints (CSF): a compact profile of per-dimension dispersion and paired contrasts with bootstrap CIs and FDR correction. Two evaluation tracks support different use cases – a 360-context diagnostic grid for deep analysis and a budgeted protocol covering 4,229 items for production screening. The implication is methodological: bias scores from fixed-condition tests may not generalize.This is not a claim about ground-truth bias rates; it is a stress test of evaluation robustness. CSF forces evaluators to ask, "Under what conditions does bias appear?" rather than "Is this model biased?" We release our
benchmark, code, and results.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.HC
LangLasso: Interactive Cluster Descriptions through LLM Explanation
Raphael Buchmüller, Dennis Collaris, Linhao Meng et al. (+1 more)
Dimensionality reduction is a powerful technique for revealing structure and potential clusters in data. However, as the axes are complex, non-linear combinations of features, they often lack semantic interpretability. Existing visual analytics (VA) methods support cluster interpretation through feature comparison and interactive exploration, but they require technical expertise and intense human effort. We present LangLasso, a novel method that complements VA approaches through interactive, natural
language descriptions of clusters using large
language models (LLMs). It produces human-readable descriptions that make cluster interpretation accessible to non-experts and allow integration of external contextual knowledge beyond the
dataset. We systematically evaluate the reliability of these explanations and demonstrate that \langlasso provides an effective first step for engaging broader audiences in cluster interpretation. The tool is available at https://langlasso.vercel.app
Read the full abstract ▾
All authors Raphael Buchmüller, Dennis Collaris, Linhao Meng, Angelos Chatzimparmpas
Machine Learning · Cross-listed from cs.SD
Stable Differentiable Modal Synthesis for Learning Nonlinear Dynamics
Victor Zheleznov, Stefan Bilbao, Alec Wright et al. (+1 more)
Modal methods are a long-standing approach to physical modelling synthesis. Extensions to nonlinear problems are possible, leading to coupled nonlinear systems of ordinary differential equations. Recent work in scalar auxiliary variable techniques has enabled construction of explicit and stable numerical solvers for such systems. On the other hand, neural ordinary differential equations have been successful in modelling nonlinear systems from data. In this work, we examine how scalar auxiliary variable techniques can be combined with neural ordinary differential equations to yield a stable differentiable model capable of learning nonlinear dynamics. The proposed approach leverages the analytical solution for linear vibration of the system's modes so that physical parameters of a system remain easily accessible after the training without the need for a parameter encoder in the model architecture. Compared to our previous work that used multilayer perceptrons to parametrise nonlinear dynamics, we employ gradient networks that allow an interpretation in terms of a closed-form and non-negative potential required by scalar auxiliary variable techniques. As a proof of concept, we generate synthetic data for the nonlinear transverse vibration of a string and show that the model can be trained to reproduce the nonlinear dynamics of the system. Sound examples are presented.
Read the full abstract ▾
All authors Victor Zheleznov, Stefan Bilbao, Alec Wright, Simon King
Machine Learning · Cross-listed from cs.CR
AgentGuardian: Learning Access Control Policies to Govern AI Agent Behavior
Nadya Abaev, Denis Klimov, Gerard Levinov et al. (+3 more)
Artificial intelligence (AI)
agents are increasingly used in a variety of domains to automate tasks, interact with users, and make decisions based on data inputs. Ensuring that AI
agents perform only authorized actions and handle inputs appropriately is essential for maintaining system integrity and preventing misuse. In this study, we introduce the AgentGuardian, a novel security framework that governs and protects AI
agent operations by enforcing context-aware access-control policies. During a controlled staging phase, the framework monitors execution traces to learn legitimate
agent behaviors and input patterns. From this phase, it derives adaptive policies that regulate tool calls made by the
agent, guided by both real-time input context and the control flow dependencies of multi-step
agent actions. Evaluation across two real-world AI
agent applications demonstrates that AgentGuardian effectively detects malicious or misleading inputs while preserving normal
agent functionality. Moreover, its control-flow-based governance mechanism mitigates
hallucination-driven errors and other orchestration-level malfunctions.
Read the full abstract ▾
All authors Nadya Abaev, Denis Klimov, Gerard Levinov, David Mimran, Yuval Elovici, Asaf Shabtai
Machine Learning
Reinforcement Learning with Multi-Step Lookahead Information Via Adaptive Batching
Nadav Merlis
We study tabular finite-horizon reinforcement learning problems with multiple steps of lookahead information. Before acting, the learner observes $\ell$ steps of future transition and reward realizations: the exact state the
agent would reach and the rewards it would collect under any possible course of action. While it has been shown that such information can drastically boost the value, finding the optimal policy is NP-hard, and it is common to apply one of two tractable heuristics: processing the lookahead in chunks of predefined sizes ('fixed batching policies'), and model predictive control. We first illustrate the problems with these two approaches and propose utilizing the lookahead in adaptive (state-dependent) batches; we refer to such policies as adaptive batching policies (ABPs). We derive the optimal Bellman equations for these strategies and design an optimistic regret-minimizing
algorithm that enables learning the optimal ABP when interacting with unknown environments. Our regret bounds are order-optimal up to a potential factor of the lookahead horizon $\ell$, which can usually be considered a small constant.
Read the full abstract ▾
Machine Learning
CS-GBA: A Critical Sample-based Gradient-guided Backdoor Attack for Offline Reinforcement Learning
Yuanjie Zhao, Junnan Qiu, Yue Ding et al. (+1 more)
Offline Reinforcement Learning (RL) enables policy optimization from static
datasets but is inherently vulnerable to
backdoor attacks. Existing attack strategies typically struggle against safety-constrained
algorithms (e.g., CQL) due to inefficient random poisoning and the use of easily detectable Out-of-Distribution (OOD) triggers. In this paper, we propose CS-GBA (Critical Sample-based Gradient-guided
Backdoor Attack), a novel framework designed to achieve high stealthiness and destructiveness under a strict budget. Leveraging the theoretical insight that samples with high Temporal Difference (TD) errors are pivotal for value function convergence, we introduce an adaptive Critical Sample Selection strategy that concentrates the attack budget on the most influential transitions. To evade OOD detection, we propose a Correlation-Breaking Trigger mechanism that exploits the physical mutual exclusivity of state features (e.g., 95th percentile boundaries) to remain statistically concealed. Furthermore, we replace the conventional label inversion with a Gradient-Guided Action Generation mechanism, which searches for worst-case actions within the data
manifold using the victim Q-network's gradient. Empirical results on D4RL
benchmarks demonstrate that our method significantly outperforms state-of-the-art baselines, achieving high attack success rates against representative safety-constrained
algorithms with a minimal 5% poisoning budget, while maintaining the
agent's performance in clean environments.
Read the full abstract ▾
All authors Yuanjie Zhao, Junnan Qiu, Yue Ding, Jie Li
Machine Learning
Discrete Feynman-Kac Correctors
Mohsin Hasan, Viktor Ohanesian, Artem Gazizov et al. (+5 more)
Discrete
diffusion models have recently emerged as a promising alternative to the autoregressive approach for generating discrete sequences. Sample generation via gradual denoising or demasking processes allows them to capture hierarchical non-sequential interdependencies in the data. These custom processes, however, do not assume a flexible control over the distribution of generated samples. We propose Discrete Feynman-Kac Correctors, a framework that allows for controlling the generated distribution of discrete masked
diffusion models at inference time. We derive Sequential Monte Carlo (SMC)
algorithms that, given a trained discrete
diffusion model, control the temperature of the sampled distribution (i.e. perform annealing), sample from the product of marginals of several
diffusion processes (e.g. differently conditioned processes), and sample from the product of the marginal with an external reward function, producing likely samples from the target distribution that also have high reward. Notably, our framework does not require any training of additional models or fine-tuning of the original model. We illustrate the utility of our framework in several applications including: efficient sampling from the annealed Boltzmann distribution of the Ising model, improving the performance of
language models for code generation and amortized learning, as well as reward-tilted
protein sequence generation.
Read the full abstract ▾
All authors Mohsin Hasan, Viktor Ohanesian, Artem Gazizov, Yoshua Bengio, Alán Aspuru-Guzik, Roberto Bondesan, Marta Skreta, Kirill Neklyudov
Machine Learning
PLGC: Pseudo-Labeled Graph Condensation
Jay Nandy, Arnab Kumar Mondal, Anuj Rathore et al. (+1 more)
Large graph
datasets make training graph neural networks (GNNs) computationally costly. Graph condensation methods address this by generating small synthetic graphs that approximate the original data. However, existing approaches rely on clean, supervised labels, which limits their reliability when labels are scarce, noisy, or inconsistent. We propose Pseudo-Labeled Graph Condensation (PLGC), a self-supervised framework that constructs latent pseudo-labels from node
embeddings and optimizes condensed graphs to match the original graph's structural and feature statistics – without requiring ground-truth labels. PLGC offers three key contributions: (1) A diagnosis of why supervised condensation fails under label noise and distribution shift. (2) A label-free condensation method that jointly learns latent prototypes and node assignments. (3) Theoretical guarantees showing that pseudo-labels preserve latent structural statistics of the original graph and ensure accurate
embedding alignment. Empirically, across node classification and link prediction tasks, PLGC achieves competitive performance with state-of-the-art supervised condensation methods on clean
datasets and exhibits substantial robustness under label noise, often outperforming all baselines by a significant margin. Our findings highlight the practical and theoretical advantages of self-supervised graph condensation in noisy or weakly-labeled environments.
Read the full abstract ▾
All authors Jay Nandy, Arnab Kumar Mondal, Anuj Rathore, Mahesh Chandran
Machine Learning
EvoMorph: Counterfactual Explanations for Continuous Time-Series Extrinsic Regression Applied to Photoplethysmography
Mesut Ceylan, Alexis Tabin, Patrick Langer et al. (+2 more)
Wearable devices enable continuous, population-scale monitoring of physiological signals, such as photoplethysmography (PPG), creating new opportunities for data-driven clinical assessment. Time-series extrinsic regression (TSER) models increasingly leverage PPG signals to estimate clinically relevant outcomes, including heart rate, respiratory rate, and oxygen saturation. For clinical
reasoning and trust, however, single point estimates alone are insufficient: clinicians must also understand whether predictions are stable under physiologically plausible variations and to what extent realistic, attainable changes in physiological signals would meaningfully alter a model's prediction. Counterfactual explanations (CFE) address these "what-if" questions, yet existing time series CFE generation methods are largely restricted to classification, overlook waveform morphology, and often produce physiologically implausible signals, limiting their applicability to continuous biomedical time series. To address these limitations, we introduce EvoMorph, a multi-objective evolutionary framework for generating physiologically plausible and diverse CFE for TSER applications. EvoMorph optimizes morphology-aware objectives defined on interpretable signal descriptors and applies transformations to preserve the waveform structure. We evaluated EvoMorph on three PPG
datasets (heart rate, respiratory rate, and oxygen saturation) against a nearest-unlike-neighbor baseline. In addition, in a case study, we evaluated EvoMorph as a tool for uncertainty quantification by relating counterfactual sensitivity to bootstrap-ensemble uncertainty and data-density measures. Overall, EvoMorph enables the generation of physiologically-aware counterfactuals for continuous biomedical signals and supports uncertainty-aware interpretability, advancing trustworthy model analysis for clinical time-series applications.
Read the full abstract ▾
All authors Mesut Ceylan, Alexis Tabin, Patrick Langer, Elgar Fleisch, Filipe Barata
Machine Learning
SuS: Strategy-aware Surprise for Intrinsic Exploration
Mark Kashirskiy and Ilya Makarov
We propose Strategy-aware Surprise (SuS), a novel intrinsic motivation framework that uses pre-post prediction mismatch as a novelty signal for exploration in reinforcement learning. Unlike traditional curiosity-driven methods that rely solely on state prediction error, SuS introduces two complementary components: Strategy Stability (SS) and Strategy Surprise (SuS). SS measures consistency in behavioral strategy across temporal steps, while SuS captures unexpected outcomes relative to the
agent's current strategy representation. Our combined reward formulation leverages both signals through learned weighting coefficients. We evaluate SuS on mathematical
reasoning tasks using large
language models, demonstrating significant improvements in both accuracy and solution diversity. Ablation studies confirm that removing either component results in at least 10% performance degradation, validating the synergistic nature of our approach. SuS achieves 17.4% improvement in Pass@1 and 26.4% improvement in Pass@5 compared to baseline methods, while maintaining higher strategy diversity throughout training.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
Training-Trajectory-Aware Token Selection
Zhanming Shen, Jiaqi Hu, Zeyu Qin et al. (+7 more)
Efficient
distillation is a key pathway for converting expensive
reasoning capability into deployable efficiency, yet in the frontier regime where the student already has strong
reasoning ability, naive continual
distillation often yields limited gains or even degradation. We observe a characteristic training phenomenon: even as loss decreases monotonically, all performance metrics can drop sharply at almost the same bottleneck, before gradually recovering. We further uncover a
token-level mechanism: confidence bifurcates into steadily increasing Imitation-Anchor
Tokens that quickly anchor optimization and other yet-to-learn
tokens whose confidence is suppressed until after the bottleneck. And the characteristic that these two types of
tokens cannot coexist is the root cause of the failure in continual
distillation. To this end, we propose Training-Trajectory-Aware
Token Selection (T3S) to reconstruct the training objective at the
token level, clearing the optimization path for yet-to-learn
tokens. T3S yields consistent gains in both AR and dLLM settings: with only hundreds of examples, Qwen3-8B surpasses DeepSeek-R1 on competitive
reasoning benchmarks, Qwen3-32B approaches Qwen3-235B, and T3-trained LLaDA-2.0-Mini exceeds its AR baseline, achieving state-of-the-art performance among all of 16B-scale no-think models.
Read the full abstract ▾
All authors Zhanming Shen, Jiaqi Hu, Zeyu Qin, Hao Chen, Wentao Ye, Zenan Huang, Yihong Zhuang, Guoshan Lu, Junlin Zhou, Junbo Zhao
Machine Learning · Cross-listed from cs.CV
An analytic theory of convolutional neural network inverse problems solvers
Minh Hai Nguyen, Quoc Bao Do, Edouard Pauwels et al. (+1 more)
Supervised convolutional neural networks (CNNs) are widely used to solve imaging inverse problems, achieving state-of-the-art performance in numerous applications. However, despite their empirical success, these methods are poorly understood from a theoretical perspective and often treated as black boxes. To bridge this gap, we analyze trained neural networks through the lens of the Minimum Mean Square Error (MMSE)
estimator, incorporating functional constraints that capture two fundamental inductive biases of CNNs: translation equivariance and locality via finite receptive fields. Under the empirical training distribution, we derive an analytic, interpretable, and tractable formula for this constrained variant, termed Local-Equivariant MMSE (LE-MMSE). Through extensive numerical experiments across various inverse problems (denoising, inpainting, deconvolution),
datasets (FFHQ, CIFAR-10, FashionMNIST), and architectures (U-Net, ResNet, PatchMLP), we demonstrate that our theory matches the neural networks outputs (PSNR $\gtrsim25$dB). Furthermore, we provide insights into the differences between physics-aware and physics-agnostic
estimators, the impact of high-density regions in the training (patch) distribution, and the influence of other factors (
dataset size, patch size, etc).
Read the full abstract ▾
All authors Minh Hai Nguyen, Quoc Bao Do, Edouard Pauwels, Pierre Weiss
Machine Learning
Meta Dynamic Graph for Traffic Flow Prediction
Yiqing Zou, Hanning Yuan, Qianyu Yang et al. (+3 more)
Traffic flow prediction is a typical spatio-temporal prediction problem and has a wide range of applications. The core challenge lies in modeling the underlying complex spatio-temporal dependencies. Various methods have been proposed, and recent studies show that the modeling of dynamics is useful to meet the core challenge. While handling spatial dependencies and temporal dependencies using separate base model structures may hinder the modeling of spatio-temporal correlations, the modeling of dynamics can bridge this gap. Incorporating spatio-temporal heterogeneity also advances the main goal, since it can extend the parameter space and allow more flexibility. Despite these advances, two limitations persist: 1) the modeling of dynamics is often limited to the dynamics of spatial
topology (e.g., adjacency
matrix changes), which, however, can be extended to a broader scope; 2) the modeling of heterogeneity is often separated for spatial and temporal dimensions, but this gap can also be bridged by the modeling of dynamics. To address the above limitations, we propose a novel framework for traffic prediction, called Meta Dynamic Graph (MetaDG). MetaDG leverages dynamic graph structures of node representations to explicitly model spatio-temporal dynamics. This generates both dynamic adjacency
matrices and meta-parameters, extending dynamic modeling beyond
topology while unifying the capture of spatio-temporal heterogeneity into a single dimension. Extensive experiments on four real-world
datasets validate the effectiveness of MetaDG.
Read the full abstract ▾
All authors Yiqing Zou, Hanning Yuan, Qianyu Yang, Ziqiang Yuan, Shuliang Wang, Sijie Ruan
Machine Learning · Cross-listed from cs.CL
An Efficient Long-Context Ranking Architecture With Calibrated LLM Distillation: Application to Person-Job Fit
Warren Jouanneau, Emma Jouffroy and Marc Palyart
Finding the most relevant person for a job proposal in real time is challenging, especially when resumes are long, structured, and
multilingual. In this paper, we propose a re-ranking model based on a new generation of late cross-
attention architecture, that decomposes both resumes and project briefs to efficiently handle long-context inputs with minimal computational overhead. To mitigate historical data biases, we use a generative large
language model (LLM) as a teacher, generating fine-grained, semantically grounded supervision. This signal is distilled into our student model via an enriched
distillation loss function. The resulting model produces skill-fit scores that enable consistent and interpretable person-job matching. Experiments on relevance, ranking, and calibration metrics demonstrate that our approach outperforms state-of-the-art baselines.
Read the full abstract ▾
Machine Learning
We Need a More Robust Classifier: Dual Causal Learning Empowers Domain-Incremental Time Series Classification
Zhipeng Liu, Peibo Duan, Xuan Tang et al. (+6 more)
The World Wide Web thrives on intelligent services that rely on accurate time series classification, which has recently witnessed significant progress driven by advances in deep learning. However, existing studies face challenges in domain incremental learning. In this paper, we propose a lightweight and robust dual-causal disentanglement framework (DualCD) to enhance the robustness of models under domain incremental scenarios, which can be seamlessly integrated into time series classification models. Specifically, DualCD first introduces a temporal feature disentanglement module to capture class-causal features and spurious features. The causal features can offer sufficient predictive power to support the classifier in domain incremental learning settings. To accurately capture these causal features, we further design a dual-causal intervention mechanism to eliminate the influence of both intra-class and inter-class confounding features. This mechanism constructs variant samples by combining the current class's causal features with intra-class spurious features and with causal features from other classes. The causal intervention loss encourages the model to accurately predict the labels of these variant samples based solely on the causal features. Extensive experiments on multiple
datasets and models demonstrate that DualCD effectively improves performance in domain incremental scenarios. We summarize our rich experiments into a comprehensive
benchmark to facilitate research in domain incremental time series classification.
Read the full abstract ▾
All authors Zhipeng Liu, Peibo Duan, Xuan Tang, Haodong Jing, Mingyang Geng, Yongsheng Huang, Jialu Xu, Bin Zhang, Binwu Wang
Machine Learning
SPIKE: Sparse Koopman Regularization for Physics-Informed Neural Networks
Jose Marie Antonio Miñoza
Physics-Informed Neural Networks (PINNs) provide a mesh-free approach for solving differential equations by
embedding physical constraints into neural network training. However, PINNs tend to overfit within the training domain, leading to poor generalization when extrapolating beyond trained spatiotemporal regions. This work presents SPIKE (Sparse Physics-Informed Koopman-Enhanced), a framework that regularizes PINNs with continuous-time Koopman operators to learn parsimonious dynamics representations. By enforcing linear dynamics $dz/dt = Az$ in a learned observable space, both PIKE (without explicit sparsity) and SPIKE (with L1 regularization on $A$) learn sparse generator
matrices, embodying the parsimony principle that complex dynamics admit low-dimensional structure. Experiments across
parabolic,
hyperbolic, dispersive, and stiff PDEs, including fluid dynamics (Navier-Stokes) and chaotic ODEs (Lorenz), demonstrate consistent improvements in temporal extrapolation, spatial generalization, and long-term prediction accuracy. The continuous-time formulation with
matrix exponential integration provides unconditional stability for stiff systems while avoiding diagonal dominance issues inherent in discrete-time Koopman operators.
Read the full abstract ▾
Machine Learning
Queueing-Aware Optimization of Reasoning Tokens for Accuracy-Latency Trade-offs in LLM Servers
Emre Ozbas and Melih Bastopcu
We consider a single large
language model (LLM) server that serves a heterogeneous stream of queries belonging to $N$ distinct task types. Queries arrive according to a Poisson process, and each type occurs with a known prior probability. For each task type, the server allocates a fixed number of internal thinking
tokens, which determines the computational effort devoted to that query. The
token allocation induces an accuracy-latency trade-off: the service time follows an approximately affine function of the allocated
tokens, while the probability of a correct response exhibits diminishing returns. Under a first-in, first-out (FIFO) service discipline, the system operates as an $M/G/1$ queue, and the mean system time depends on the first and second moments of the resulting service-time distribution. We formulate a constrained optimization problem that maximizes a weighted average accuracy objective penalized by the mean system time, subject to architectural
token-budget constraints and queue-stability conditions. The objective function is shown to be strictly concave over the stability region, which ensures existence and uniqueness of the optimal
token allocation. The first-order optimality conditions yield a coupled projected fixed-point characterization of the optimum, together with an iterative solution and an explicit sufficient condition for contraction. Moreover, a projected gradient method with a computable global step-size bound is developed to guarantee convergence beyond the contractive regime. Finally, integer-valued
token allocations are attained via rounding of the continuous solution, and the resulting performance loss is evaluated in simulation results.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
MoST: Mixing Speech and Text with Modality-Aware Mixture of Experts
Yuxuan Lou, Kai Yang and Yang You
We present MoST (Mixture of
Speech and Text), a novel
multimodal large
language model that seamlessly integrates
speech and text processing through our proposed Modality-Aware Mixture of Experts (MAMoE) architecture. While current
multimodal models typically process diverse modality representations with identical parameters, disregarding their inherent representational differences, we introduce specialized routing pathways that direct
tokens to modality-appropriate experts based on input type. MAMoE simultaneously enhances modality-specific learning and cross-modal understanding through two complementary components: modality-specific expert groups that capture domain-specific patterns and shared experts that facilitate information transfer between modalities. Building on this architecture, we develop an efficient transformation pipeline that adapts the pretrained MoE
language model through strategic post-training on ASR and TTS
datasets, followed by fine-tuning with a carefully curated
speech-text instruction
dataset. A key feature of this pipeline is that it relies exclusively on fully accessible, open-source
datasets to achieve strong performance and data efficiency. Comprehensive evaluations across ASR, TTS, audio
language modeling, and spoken question answering
benchmarks show that MoST consistently outperforms existing models of comparable parameter counts. Our ablation studies confirm that the modality-specific routing mechanism and shared experts design significantly contribute to performance gains across all tested domains. To our knowledge, MoST represents the first fully open-source
speech-text LLM built on a Mixture of Experts architecture. \footnote{We release MoST model, training code, inference code, and training data at https://github.com/NUS-HPC-AI-Lab/MoST
Read the full abstract ▾
Machine Learning
Early Fault Detection on CMAPSS with Unsupervised LSTM Autoencoders
P. Sánchez, K. Reyes, B. Radu et al. (+1 more)
This paper introduces an unsupervised health-monitoring framework for turbofan engines that does not require run-to-failure labels. First, operating-condition effects in NASA CMAPSS sensor streams are removed via regression-based normalisation; then a Long Short-Term
Memory (LSTM) autoencoder is trained only on the healthy portion of each trajectory. Persistent reconstruction error, estimated using an adaptive data-driven threshold, triggers real-time alerts without hand-tuned rules.
Benchmark results show high recall and low false-alarm rates across multiple operating regimes, demonstrating that the method can be deployed quickly, scale to diverse fleets, and serve as a complementary early-warning layer to Remaining Useful Life models.
Read the full abstract ▾
All authors P. Sánchez, K. Reyes, B. Radu, E. Fernández