Machine Learning · Cross-listed from math.OC
Adaptive decision-making for stochastic service network design
Javier Durán-Micco and Bilge Atasoy
This paper addresses the Service Network Design (SND) problem for a logistics service provider (LSP) operating in a
multimodal freight transport network, considering uncertain travel times and limited truck fleet availability. A two-stage optimization approach is proposed, which combines metaheuristics, simulation and machine learning components. This solution framework integrates tactical decisions, such as transport request acceptance and capacity booking for scheduled services, with operational decisions, including dynamic truck allocation, routing, and re-planning in response to disruptions. A simulated annealing (SA) metaheuristic is employed to solve the tactical problem, supported by an adaptive surrogate model trained using a discrete-event simulation model that captures operational complexities and cascading effects of uncertain travel times. The performance of the proposed method is evaluated using
benchmark instances. First, the SA is tested on a deterministic version of the problem and compared to state-of-the-art results, demonstrating it can improve the solution quality and significantly reduce the computational time. Then, the proposed SA is applied to the more complex
stochastic problem. Compared to a
benchmark algorithm that executes a full simulation for each solution evaluation, the learning-based SA generates high quality solutions while significantly reducing computational effort, achieving only a 5% difference in objective function value while cutting computation time by up to 20 times. These results demonstrate the strong performance of the proposed
algorithm in solving complex versions of the SND. Moreover, they highlight the effectiveness of integrating diverse modeling and optimization techniques, and the potential of such approaches to efficiently address freight transport planning challenges.
Read the full abstract ▾
Machine Learning
CoordLight: Learning Decentralized Coordination for Network-Wide Traffic Signal Control
Yifeng Zhang, Harsh Goel, Peizhuo Li et al. (+3 more)
Adaptive traffic signal control (ATSC) is crucial in alleviating congestion, maximizing throughput and promoting sustainable mobility in ever-expanding cities. Multi-
Agent Reinforcement Learning (MARL) has recently shown significant potential in addressing complex traffic dynamics, but the intricacies of partial observability and coordination in decentralized environments still remain key challenges in formulating scalable and efficient control strategies. To address these challenges, we present CoordLight, a MARL-based framework designed to improve intra-neighborhood traffic by enhancing decision-making at individual junctions (
agents), as well as coordination with neighboring
agents, thereby scaling up to network-level traffic optimization. Specifically, we introduce the Queue Dynamic State Encoding (QDSE), a novel state representation based on vehicle queuing models, which strengthens the
agents' capability to analyze, predict, and respond to local traffic dynamics. We further propose an advanced MARL
algorithm, named Neighbor-aware Policy Optimization (NAPO). It integrates an
attention mechanism that discerns the state and action dependencies among adjacent
agents, aiming to facilitate more coordinated decision-making, and to improve policy learning updates through robust advantage calculation. This enables
agents to identify and prioritize crucial interactions with influential neighbors, thus enhancing the targeted coordination and collaboration among
agents. Through comprehensive evaluations against state-of-the-art traffic signal control methods over three real-world traffic
datasets composed of up to 196 intersections, we empirically show that CoordLight consistently exhibits superior performance across diverse traffic networks with varying traffic flows. The code is available at https://github.com/marmotlab/CoordLight
Read the full abstract ▾
All authors Yifeng Zhang, Harsh Goel, Peizhuo Li, Mehul Damani, Sandeep Chinchali, Guillaume Sartoretti
Machine Learning · Cross-listed from cs.HC
A Neuro-Symbolic System for Interpretable Multimodal Physiological Signals Integration in Human Fatigue Detection
Mohammadreza Jamalifard, Yaxiong Lei, Parasto Azizinezhad et al. (+2 more)
We propose a neuro-symbolic architecture that learns four interpretable physiological concepts, oculomotor dynamics, gaze stability, prefrontal hemodynamics, and
multimodal, from eye-tracking and neural hemodynamics, functional near-infrared spectroscopy, (fNIRS) windows using
attention-based encoders, and combines them with differentiable approximate
reasoning rules using learned weights and soft thresholds, to address both rigid hand-crafted rules and the lack of subject-level
alignment diagnostics. We apply this system to fatigue classification from
multimodal physiological signals, a domain that requires models that are accurate and interpretable, with internal
reasoning that can be inspected for safety-critical use. In leave-one-subject-out evaluation on 18 participants (560 samples), the method achieves 72.1% +/- 12.3% accuracy, comparable to tuned baselines while exposing concept activations and rule firing strengths. Ablations indicate gains from participant-specific calibration (+5.2 pp), a modest drop without the fNIRS concept (-1.2 pp), and slightly better performance with Lukasiewicz operators than product (+0.9 pp). We also introduce concept fidelity, an offline per-subject audit metric from held-out labels, which correlates strongly with per-subject accuracy (r=0.843, p < 0.0001).
Read the full abstract ▾
All authors Mohammadreza Jamalifard, Yaxiong Lei, Parasto Azizinezhad, Javier Fumanal-Idocin, Javier Andreu-Perez
Machine Learning · Cross-listed from cs.RO
Evidence of an Emergent "Self" in Continual Robot Learning
Adidev Jhunjhunwala, Judah Goldfeder and Hod Lipson
A key challenge to understanding self-awareness has been a principled way of quantifying whether an intelligent system has a concept of a "self", and if so how to differentiate the "self" from other cognitive structures. We propose that the "self" can be isolated by seeking the invariant portion of cognitive process that changes relatively little compared to more rapidly acquired cognitive skills - because our self is the most persistent aspect of our experiences. We used this principle to analyze the cognitive structure of
robots under two conditions: One
robot learns a constant task, while a second undergoes continual learning under variable tasks. We find that
robots subjected to continual learning develop an invariant subnetwork that is significantly more stable (p < 0.001) compared to the control, and that this subnetwork is also functionally important: preserving it aids adaptation while damaging it impairs performance. We validate this pattern across three different
robots spanning locomotion and manipulation.
Read the full abstract ▾
Machine Learning
Large Language Model Guided Incentive Aware Reward Design for Cooperative Multi-Agent Reinforcement Learning
Dogan Urgun and Gokhan Gungor
Designing effective auxiliary rewards for cooperative multi-
agent systems remains challenging, as misaligned incentives can induce suboptimal coordination, particularly when sparse task rewards provide insufficient grounding for coordinated behavior. This study introduces an autonomous reward design framework that uses large
language models (LLMs) to synthesize executable reward programs from environment instrumentation. The procedure constrains candidate programs within a formal validity envelope and trains policies from scratch using Multi-
Agent Proximal Policy Optimization (MAPPO) under a fixed computational budget. The candidates are then evaluated on the basis of their performance, and selection across generations solely based on the sparse task returns. The framework is evaluated in four Overcooked-AI layouts characterized by varying levels of corridor congestion, handoff dependencies, and structural asymmetries. The proposed reward design approach consistently yields higher task returns and delivery counts, with the most pronounced gains observed in environments dominated by interaction bottlenecks. Diagnostic analysis of the synthesized shaping components reveals stronger interdependence in action selection and improved signal
alignment in coordination-intensive tasks. These results demonstrate that the proposed LLM-guided reward search framework mitigates the need for manual engineering while producing shaping signals compatible with cooperative learning under finite budgets.
Read the full abstract ▾
Machine Learning · Cross-listed from astro-ph.EP
Connecting Meteorite Spectra to Lunar Surface Composition Using Hyperspectral Imaging and Machine Learning
Fatemeh Fazel Hesar, Mojtaba Raouf, Amirmohammad Chegeni et al. (+5 more)
We present an innovative, cost-effective framework integrating laboratory Hyperspectral Imaging (HSI) of the Bechar010 Lunar meteorite with ground-based lunar HSI and supervised Machine Learning(ML) to generate high-fidelity mineralogical maps. A 3mm thin section of Bechar010 was imaged under a microscope with a 30mm focal length lens at 150mm working distance, using 6x binning to increase the signal-to-noise ratio, producing a data cube (X $\times$ Y $\times$ $\lambda$ = $791 \times 1024 \times 224$, 0.24mm $\times$ 0.2mm resolution) across 400-1000}nm (224 bands, 2.7nm spectral sampling, 5.5nm full width at half maximum spectral resolution) using a Specim FX10 camera. Ground-based lunar HSI was captured with a Celestron 8SE
telescope (3km/pixel), yielded a data cube ($371 \times 1024 \times 224$).
Solar calibration was performed using a Spectralon reference ({99}% reflectance {<2}% error) ensured accurate reflectance spectra. A Support Vector Machine (SVM) with a radial basis function kernel, trained on expert-labeled spectra, achieved {93.7}% classification accuracy(5-fold cross-validation) for olivine ({92}% precision, {90}% recall) and pyroxene ({88}% precision, {86}{%} recall) in Bechar 010. LIME analysis identified key wavelengths (e.g., 485nm, {22.4}% for M3; 715nm, {20.6}% for M6) across 10 pre-selected regions (M1 to M10), indicating olivine-rich (Highland-like) and pyroxene-rich (Mare-like) compositions. SAM analysis revealed angles from 0.26 radian to 0.66 radian, linking M3 and M9 to Highlands and M6 and M10 to Mares. K-means clustering of Lunar data identified 10 mineralogical clusters ({88}% accuracy), validated against Chandrayaan-1 Moon mineralogy Mapper ($\rm M^3$) data (140m/pixel, 10nm spectral resolution).A novel push-broom HSI approach with a
telescope achieves 0.8 arcsec resolution for lunar spectroscopy, inspiring full-sky multi-object spectral mapping.
Read the full abstract ▾
All authors Fatemeh Fazel Hesar, Mojtaba Raouf, Amirmohammad Chegeni, Peyman Soltani, Bernard Foing, Elias Chatzitheodoridis, Michiel J. A. de Dood, Fons J. Verbeek
Machine Learning · Cross-listed from stat.ML
CGRL: Causal-Guided Representation Learning for Node-Level Out-of-Distribution Generalization
Bowen Lu, Lianqiang Yang, Teng Li et al. (+1 more)
Graph Neural Networks (GNNs) deliver strong performance on graph tasks, but their accuracy drops significantly under out-of-distribution (OOD) scenarios. Under distribution shifts, GNNs often fit environmental noise and spurious correlations instead of stable causal mechanisms, leading to weak OOD robustness and unstable predictive representations. Existing solutions based on environment invariance or causal
reasoning are insufficient for node classification, as they do not explicitly model the fine-grained latent geometry required by the task. We further observe a training instability named Info-Jitter, where the mutual information between predictive representations and ground-truth labels fluctuates throughout training. To address these issues, we construct a node-classification-specific causal graph derived from the task's
geometric objective. Using do-calculus to block non-causal paths caused by environmental noise, we derive a deconfounded interventional objective and a variational lower bound to disentangle representations into intra-class and inter-class components. We then propose Causal-Guided Representation Learning (CGRL), a framework with two core modules. First, a multi-branch re-weighted representation learning (RRL) module learns a causal modulation
matrix to amplify causal signals and suppress environmental noise during message passing. Second, an optimization strategy combining intra-class aggregation, inter-class separation, energy-based reconstruction and supervised prediction regularizes the latent space for robust node-level generalization. Experiments on multiple
benchmark datasets show that CGRL outperforms strong baselines across various distribution shifts and effectively mitigates the Info-Jitter phenomenon.
Read the full abstract ▾
All authors Bowen Lu, Lianqiang Yang, Teng Li, Kun Zhang
Machine Learning
Cost-Sensitive Neighborhood Aggregation for Heterophilous Graphs: When Does Per-Edge Routing Help?
Eyal Weiss
Recent work distinguishes two heterophily regimes:
adversarial, where cross-class edges dilute class signal and harm classification, and informative, where the heterophilous structure itself carries useful signal. We ask: when does per-edge message routing help, and when is a uniform spectral channel sufficient? To operationalize this question we introduce Cost-Sensitive Neighborhood Aggregation (CSNA), a GNN layer that computes pairwise distance in a learned projection and uses it to soft-route each message through concordant and discordant channels with independent transformations. Under a contextual
stochastic block model we show that mean aggregation can reverse the label-aligned signal direction under heterophily, and that cost-sensitive weighting with $w_+/w_- > q/p$ preserves the correct sign. On six
benchmarks with uniform tuning, CSNA is competitive with state-of-the-art methods on
adversarial-heterophily
datasets (Texas, Wisconsin, Cornell, Actor) but underperforms on informative-heterophily
datasets (Chameleon, Squirrel) – precisely the regime where per-edge routing has no useful decomposition to exploit. The pattern is itself the finding: the cost function's ability to separate edge types serves as a diagnostic for the heterophily regime, revealing when fine-grained routing adds value over uniform channels and when it does not. Code is available at https://github.com/eyal-weiss/CSNA-public .
Read the full abstract ▾
Machine Learning
Language-Assisted Image Clustering Guided by Discriminative Relational Signals and Adaptive Semantic Centers
Jun Ma, Xu Zhang, Zhengxing Jiao et al. (+4 more)
Language-Assisted Image Clustering (LAIC) augments the input images with additional texts with the help of
vision-
language models (VLMs) to promote clustering performance. Despite recent progress, existing LAIC methods often overlook two issues: (i) textual features constructed for each image are highly similar, leading to weak inter-class discriminability; (ii) the clustering step is restricted to pre-built image-text
alignments, limiting the potential for better utilization of the text modality. To address these issues, we propose a new LAIC framework with two complementary components. First, we exploit cross-modal relations to produce more discriminative self-supervision signals for clustering, as it compatible with most VLMs training mechanisms. Second, we learn category-wise continuous semantic centers via
prompt learning to produce the final clustering assignments. Extensive experiments on eight
benchmark datasets demonstrate that our method achieves an average improvement of 2.6% over state-of-the-art methods, and the learned semantic centers exhibit strong interpretability. Code is available in the supplementary material.
Read the full abstract ▾
All authors Jun Ma, Xu Zhang, Zhengxing Jiao, Yaxin Hou, Hui Liu, Junhui Hou, Yuheng Jia
Machine Learning
DeepDTF: Dual-Branch Transformer Fusion for Multi-Omics Anticancer Drug Response Prediction
Yuhan Zhao, Jacob Tennant, James Yang et al. (+3 more)
Cancer drug response varies widely across tumors due to multi-layer molecular heterogeneity, motivating computational decision support for precision oncology. Despite recent progress in deep CDR models, robust
alignment between high-dimensional multi-omics and chemically structured drugs remains challenging due to cross-modal misalignment and limited inductive bias. We present DeepDTF, an end-to-end dual-branch
Transformer fusion framework for joint log(IC50) regression and drug sensitivity classification. The
cell-line branch uses modality-specific encoders for multi-omics profiles with
Transformer blocks to capture long-range dependencies, while the drug branch represents compounds as molecular graphs and encodes them with a GNN-
Transformer to integrate local
topology with global context. Omics and drug representations are fused by a
Transformer-based module that models cross-modal interactions and mitigates feature misalignment. On public pharmacogenomic
benchmarks under 5-fold cold-start
cell-line evaluation, DeepDTF consistently outperforms strong baselines across omics settings, achieving up to RMSE=1.248, R^2=0.875, and AUC=0.987 with full multi-omics inputs, while reducing classification error (1-ACC) by 9.5%. Beyond accuracy, DeepDTF provides biologically grounded explanations via SHAP-based gene attributions and pathway enrichment with pre-ranked GSEA.
Read the full abstract ▾
All authors Yuhan Zhao, Jacob Tennant, James Yang, Zhishan Guo, Young Whang, Ning Sui
Machine Learning
Forecasting with Guidance: Representation-Level Supervision for Time Series Forecasting
Jiacheng Wang, Liang Fan, Baihua Li et al. (+1 more)
Nowadays, time series
forecasting is predominantly approached through the end-to-end training of deep learning architectures using error-based objectives. While this is effective at minimizing average loss, it encourages the encoder to discard informative yet extreme patterns. This results in smooth predictions and temporal representations that poorly capture salient dynamics. To address this issue, we propose ReGuider, a plug-in method that can be seamlessly integrated into any
forecasting architecture. ReGuider leverages pretrained time series foundation models as semantic teachers. During training, the input sequence is processed together by the target
forecasting model and the pretrained model. Rather than using the pretrained model's outputs directly, we extract its intermediate
embeddings, which are rich in temporal and semantic information, and align them with the target model's encoder
embeddings through representation-level supervision. This
alignment process enables the encoder to learn more expressive temporal representations, thereby improving the accuracy of downstream
forecasting. Extensive experimentation across diverse
datasets and architectures demonstrates that our ReGuider consistently improves
forecasting performance, confirming its effectiveness and versatility.
Read the full abstract ▾
All authors Jiacheng Wang, Liang Fan, Baihua Li, Luyan Zhang
Machine Learning
Beyond Static Uncertainty: Modeling Temporal Uncertainty Dynamics for Probabilistic Time Series Forecasting
Yijun Wang, Qiyuan Zhuang, Larysa Marchanka et al. (+1 more)
Real-world time series exhibit temporally structured uncertainty:
volatility clusters in turbulent regimes, dissipates in stable periods, and shifts abruptly around structural breaks. Yet many probabilistic
forecasting methods estimate predictive uncertainty as an independent per-step quantity, leaving the
evolution and persistence of
volatility regimes under-modeled. We formalize this missing dimension as temporal uncertainty dynamics and instantiate it in the
Volatility Dynamics Variational Autoencoder (VolDy-VAE), a non-autoregressive generative forecaster with a location-scale decoder. VolDy-VAE combines a location path for mean prediction with a recurrent scale path that transfers and evolves a
volatility hidden state from the look-back window to the
forecasting horizon, enabling temporally coherent predictive variances. This design yields an adaptive attenuation mechanism: high-variance observations receive lower influence on the location estimate while their uncertainty is preserved through explicit scale predictions. We further provide a simplified regime-switching analysis showing that, when variances are known or consistently estimated, the
volatility-aware objective reduces to inverse-variance weighting, whereas MSE-based
estimators remain unbiased but statistically inefficient. Experiments on nine
benchmarks show that VolDy-VAE improves
forecasting accuracy and uncertainty calibration over competitive probabilistic and point-
forecasting baselines while maintaining low inference latency; plug-in studies further indicate that the VolDy principle can benefit GAN, Koopman VAE, and
Transformer backbones. The source code is publicly available at https://github.com/wangyijunlyy/VolDy-VAE.
Read the full abstract ▾
All authors Yijun Wang, Qiyuan Zhuang, Larysa Marchanka, Xiu-Shen Wei
Machine Learning · Cross-listed from eess.SY
C-STEP: Continuous Space-Time Empowerment for Physics-informed Safe Reinforcement Learning of Mobile Agents
Guihlerme Daubt and Adrian Redder
Safe
navigation in complex environments remains a central challenge for reinforcement learning (RL) in robotics. This paper introduces Continuous Space-Time Empowerment for Physics-informed (C-STEP) safe RL, a novel measure of
agent-centric safety tailored to deterministic, continuous domains. This measure can be used to design physics-informed intrinsic rewards by augmenting positive
navigation reward functions. The reward incorporates the
agents internal states (e.g., initial velocity) and forward dynamics to differentiate safe from risky behavior. By integrating C-STEP with
navigation rewards, we obtain an intrinsic reward function that jointly optimizes task completion and collision avoidance. Numerical results demonstrate fewer collisions, reduced proximity to obstacles, and only marginal increases in travel time. Overall, C-STEP offers an interpretable, physics-informed approach to reward shaping in RL, contributing to safety for agentic mobile robotic systems.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.PL
DVM: A Bytecode Virtual Machine Approach for Dynamic Tensor Computation
Jingzhi Fang, Xiong Gao, Renwei Zhang et al. (+6 more)
Dynamism is common in AI computation, e.g., the dynamic tensor shapes and the dynamic control flows in models. Due to the long compilation time, existing runtime compilation damages the model efficiency, while the offline compilers either suffer from the long compilation time and device
memory footprint to cover all the possible execution instances of a dynamic model, or sacrifice optimization opportunities for usability. In this paper, we rethink the feasibility of runtime compilation for dynamic models and identify that the key for it to work is to speed up the compilation or hide the compilation overhead. To do this, we propose a real-time compiler, DVM. In DVM, we design a runtime operator compiler based on a bytecode virtual machine to perform effective and efficient compilation for each dynamic operator instance given its input. Specifically, instead of compiling programs into machine code, we encode the operator program into bytecode on the CPU and decode the bytecode into virtual instructions for direct execution on the NPU. Based on the runtime operator compiler, we further propose an operator fuser, which performs symbol-deduction-based fusion on static graphs and runtime fusion on dynamic graphs. Both pattern- and stacking-based fusion are supported to increase fusion opportunities. Evaluation on operators, subgraphs, and models shows that, compared with TorchInductor, PyTorch-eager and MindSpore-graph-O0, we are up to 11.77$\times$ better in terms of the operator/model efficiency and up to 5 orders of magnitude faster in terms of the maximum compilation time.
Read the full abstract ▾
All authors Jingzhi Fang, Xiong Gao, Renwei Zhang, Zichun Ye, Lei Chen, Jie Zhao, Chengnuo Huang, Hui Xu, Xuefeng Jin
Machine Learning
Attack Assessment and Augmented Identity Recognition for Human Skeleton Data
Joseph G. Zalameda, Megan A. Witherow, Alexander M. Glandon et al. (+2 more)
Machine learning models trained on small data sets for security applications are especially vulnerable to
adversarial attacks. Person identification from
LiDAR based skeleton data requires time consuming and expensive data acquisition for each subject identity. Recently, Assessment and Augmented Identity Recognition for Skeletons (AAIRS) has been used to train Hierarchical Co-occurrence Networks for Person Identification (HCN-ID) with small
LiDAR based skeleton data sets. However, AAIRS does not evaluate robustness of HCN-ID to
adversarial attacks or inoculate the model to defend against such attacks. Popular perturbation-based approaches to generating
adversarial attacks are constrained to targeted perturbations added to real training samples, which is not ideal for inoculating models with small training sets. Thus, we propose Attack-AAIRS, a novel addition to the AAIRS framework. Attack-AAIRS leverages a small real data set and a GAN generated synthetic data set to assess and improve model robustness against unseen
adversarial attacks. Rather than being constrained to perturbations of limited real training samples, the GAN learns the distribution of
adversarial attack samples that exploit weaknesses in HCN-ID. Attack samples drawn from this distribution augment training for inoculation of the HCN-ID to improve robustness. Ten-fold cross validation of Attack-AAIRS yields increased robustness to unseen attacks- including FGSM, PGD, Additive Gaussian Noise, MI-FGSM, and BIM. The HCN-ID Synthetic Data Quality Score for Attack-AAIRS indicates that generated attack samples are of similar quality to the original benign synthetic samples generated by AAIRS. Furthermore, inoculated models show consistent final test accuracy with the original model trained on real data, demonstrating that our method improves robustness to
adversarial attacks without reducing test performance on real data.
Read the full abstract ▾
All authors Joseph G. Zalameda, Megan A. Witherow, Alexander M. Glandon, Jose Aguilera, Khan M. Iftekharuddin
Machine Learning
Identification of NMF by choosing maximum-volume basis vectors
Qianqian Qi, Zhongming Chen and Peter G. M. van der Heijden
In nonnegative
matrix factorization (NMF), minimum-volume-constrained NMF is a widely used framework for identifying the solution of NMF by making basis vectors as similar as possible. This typically induces sparsity in the coefficient
matrix, with each row containing zero entries. Consequently, minimum-volume-constrained NMF may fail for highly mixed data, where such sparsity does not hold. Moreover, the estimated basis vectors in minimum-volume-constrained NMF may be difficult to interpret as they may be mixtures of the ground truth basis vectors. To address these limitations, in this paper we propose a new NMF framework, called maximum-volume-constrained NMF, which makes the basis vectors as distinct as possible. We further establish an identifiability
theorem for maximum-volume-constrained NMF and provide an
algorithm to estimate it. Experimental results demonstrate the effectiveness of the proposed method.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.IR
UniScale: Synergistic Entire Space Data and Model Scaling for Search Ranking
Liren Yu, Caiyuan Li, Feiyi Dong et al. (+5 more)
Recent advances in Large
Language Models (LLMs) have inspired a surge of scaling research in industrial search, advertising, and recommendation systems. However, existing approaches focus mainly on architectural improvements, overlooking the critical synergy between data and architecture design. We observe that scaling model parameters alone exhibits diminishing returns, and that the performance degradation caused by complex heterogeneous data distributions is often irrecoverable through model design alone. In this paper, we propose UniScale, a novel co-design framework that jointly optimizes data and architecture to unlock the full potential of model scaling. UniScale includes two core parts: (1) ES$^3$ (Entire-Space Sample System), a high-quality data scaling system that expands the training signal beyond conventional sampling strategies through intra-domain expansion with hierarchical label attribution and cross-domain searchification; and (2) HHSFT (Heterogeneous Hierarchical Sample Fusion
Transformer), a novel architecture that effectively models the complex heterogeneous distribution of scaled data via Heterogeneous Hierarchical Feature Interaction and Entire Space User Interest Fusion, thereby surpassing the performance ceiling of structure-only model tuning. Extensive experiments on large-scale industrial
datasets demonstrate that UniScale achieves significant improvements and exhibits clear scaling trends. Online A/B tests on a real-world E-commerce search platform confirm that UniScale consistently outperforms strong production baselines, achieving 1.70% and 2.04% increases in user purchase and Gross Merchandise Value (GMV).
Read the full abstract ▾
All authors Liren Yu, Caiyuan Li, Feiyi Dong, Tao Zhang, Zhixuan Zhang, Dan Ou, Haihong Tang, Bo Zheng
Machine Learning
Uncovering Memorization in Timeseries Imputation models: LBRM Membership Inference and its link to attribute Leakage
Faiz Taleb, Ivan Gazeau and Maryline Laurent
Deep learning models for time series imputation are now essential in fields such as healthcare, the Internet of Things (IoT), and finance. However, their deployment raises critical
privacy concerns. Beyond the well-known issue of unintended memorization, which has been extensively studied in generative models, we demonstrate that time series models are vulnerable to inference attacks in a black-box setting. In this work, we introduce a two-stage attack framework comprising: (1) a novel membership inference attack based on a reference model that improves detection accuracy, even for models robust to overfitting-based attacks, and (2) the first attribute inference attack that predicts sensitive characteristics of the training data for timeseries imputation model. We evaluate these attacks on
attention-based and autoencoder architectures in two scenarios: models that are trained from scratch, and fine-tuned models where the adversary has access to the initial weights. Our experimental results demonstrate that the proposed membership attack retrieves a significant portion of the training data with a tpr@top25% score significantly higher than a naive attack baseline. We show that our membership attack also provides a good insight of whether attribute inference will work (with a precision of 90% instead of 78% in the genral case).
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
HEART-PFL: Stable Personalized Federated Learning under Heterogeneity with Hierarchical Directional Alignment and Adversarial Knowledge Transfer
Minjun Kim and Minje Kim
Personalized
Federated Learning (PFL) aims to deliver effective client-specific models under heterogeneous distributions, yet existing methods suffer from shallow prototype
alignment and brittle server-side
distillation. We propose HEART-PFL, a dual-sided framework that (i) performs depth-aware Hierarchical Directional
Alignment (HDA) using cosine similarity in the early stage and MSE matching in the deep stage to preserve client specificity, and (ii) stabilizes global updates through
Adversarial Knowledge Transfer (AKT) with symmetric KL
distillation on clean and
adversarial proxy data. Using lightweight adapters with only 1.46M trainable parameters, HEART-PFL achieves state-of-the-art personalized accuracy on CIFAR-100, Flowers-102, and Caltech-101 (63.42%, 84.23%, and 95.67%, respectively) under Dirichlet non-IID partitions, and remains robust to out-of-domain proxy data. Ablation studies further confirm that HDA and AKT provide complementary gains in
alignment, robustness, and optimization stability, offering insights into how the two components mutually reinforce effective personalization. Overall, these results demonstrate that HEART-PFL simultaneously enhances personalization and global stability, highlighting its potential as a strong and scalable solution for PFL(code available at https://github.com/danny0628/HEART-PFL).
Read the full abstract ▾
Machine Learning
IPatch: A Multi-Resolution Transformer Architecture for Robust Time-Series Forecasting
Aymane Harkati, Moncef Garouani, Olivier Teste et al. (+2 more)
Accurate
forecasting of multivariate time series remains challenging due to the need to capture both short-term fluctuations and long-range temporal dependencies.
Transformer-based models have emerged as a powerful approach, but their performance depends critically on the representation of temporal data. Traditional point-wise representations preserve individual time-step information, enabling fine-grained modeling, yet they tend to be computationally expensive and less effective at modeling broader contextual dependencies, limiting their scalability to long sequences. Patch-wise representations aggregate consecutive steps into compact
tokens to improve efficiency and model local temporal dynamics, but they often discard fine-grained temporal details that are critical for accurate predictions in volatile or complex time series. We propose IPatch, a multi-resolution
Transformer architecture that integrates both point-wise and patch-wise
tokens, modeling temporal information at multiple resolutions. Experiments on 7
benchmark datasets demonstrate that IPatch consistently improves
forecasting accuracy, robustness to noise, and generalization across various prediction horizons compared to single-representation baselines.
Read the full abstract ▾
All authors Aymane Harkati, Moncef Garouani, Olivier Teste, Julien Aligon, Mohamed Hamlich
Machine Learning
A Deep Dive into Scaling RL for Code Generation with Synthetic Data and Curricula
Cansu Sancaktar, David Zhang, Gabriel Synnaeve et al. (+1 more)
Reinforcement learning (RL) has emerged as a powerful paradigm for improving large
language models beyond supervised fine-tuning, yet sustaining performance gains at scale remains an open challenge, as data diversity and structure, rather than volume alone, become the limiting factor. We address this by introducing a scalable multi-turn synthetic data generation pipeline in which a teacher model iteratively refines problems based on in-context student performance summaries, producing structured difficulty progressions without any teacher fine-tuning. Compared to single-turn generation, this multi-turn approach substantially improves the yield of valid synthetic problems and naturally produces stepping stones, i.e. easier and harder variants of the same core task, that support curriculum-based training. We systematically study how task difficulty, curriculum scheduling, and environment diversity interact during RL training across the Llama3.1-8B Instruct and Qwen3-8B Base model families, with additional scaling experiments on Qwen2.5-32B. Our results show that synthetic augmentation consistently improves in-domain code and in most cases out-of-domain math performance, and we provide empirical insights into how curriculum design and data diversity jointly shape RL training dynamics.
Read the full abstract ▾
All authors Cansu Sancaktar, David Zhang, Gabriel Synnaeve, Taco Cohen
Machine Learning · Cross-listed from quant-ph
Quantum Neural Physics: Solving Partial Differential Equations on Quantum Simulators using Quantum Convolutional Neural Networks
Jucai Zhai, Muhammad Abdullah, Boyang Chen et al. (+6 more)
Neural Physics recasts local discretisations of partial differential equations (PDEs) as fixed convolutional operators, providing a physics-preserving alternative to data-driven surrogate modelling in scientific machine learning. However, existing realizations remain largely confined to classical AI hardware and do not directly connect to
quantum structured operator design. To bridge this gap, we introduce a
Quantum Neural Physics framework and develop a Hybrid
Quantum-Classical CNN Multigrid Solver (HQC-CNNMG). The proposed method maps analytically prescribed stencil operators to local
quantum convolutional primitives and embeds them within a classical multilevel W-cycle architecture, combining the operator-centric view of scientific ML with the numerical rigor of multigrid solvers. Using amplitude encoding together with the Linear Combination of
Unitaries (LCU) and the
Quantum Fourier Transform (QFT), the resulting local
quantum operators admit logarithmic-depth implementation, with
circuit depth scaling as $\mathcal{O}(\log K)$ for an encoded block of size $K$ under the idealized parallel
circuit model considered here. Numerical experiments on Poisson, transient
diffusion, convection–
diffusion, and incompressible Navier–Stokes problems demonstrate numerical consistency, stable multilevel behaviour, and workflow-level feasibility on noiseless simulators. Comparisons with representative
quantum linear solver paradigms further show that the main strength of HQC-CNNMG lies in its balanced trade-off among local
circuit depth, numerical robustness, and compatibility with PDE structure, rather than in fully
quantum global inversion.
Read the full abstract ▾
All authors Jucai Zhai, Muhammad Abdullah, Boyang Chen, Fazal Chaudry, Paul N. Smith, Claire E. Heaney, Yanghua Wang, Jiansheng Xiang, Christopher C. Pain
Machine Learning
TsetlinWiSARD: On-Chip Training of Weightless Neural Networks using Tsetlin Automata on FPGAs
Shengyu Duan, Marcos L. L. Sartori, Rishad Shafik et al. (+1 more)
Increasing demands for adaptability,
privacy, and security at the edge have persistently pushed the frontiers for a new generation of machine learning (ML)
algorithms with training and inference capabilities on-chip. Weightless Neural Network (WNN) is such an
algorithm that is principled on lookup table based simple
neuron structures. As a result, it offers architectural benefits, such as low-latency, low-complexity inference, compared to deep neural networks that depend heavily on multiply-accumulate operations. However, traditional WNNs rely on memorization-based one-shot training, which either leads to overfitting and reduced accuracy or requires tedious post-training adjustments, limiting their effectiveness for efficient on chip training. In this work, we propose TsetlinWiSARD, a training approach for WNNs that leverages Tsetlin Automata (TAs) to enable probabilistic, feedback-driven learning. It overcomes the overfitting of WiSARD's one-shot training with iterative optimization, while maintaining simple, continuous binary feedback for efficient on-chip training. Central to our approach is a field programmable gate array (FPGA)-based training architecture that delivers state-of-the-art accuracy while significantly improving hardware efficiency. Our approach provides over 1000x faster training when compared with the traditional WiSARD implementation of WNNs. Further, we demonstrate 22% reduced resource usage, 93.3% lower latency, and 64.2% lower power consumption compared to FPGA-based training accelerators implementing other ML
algorithms.
Read the full abstract ▾
All authors Shengyu Duan, Marcos L. L. Sartori, Rishad Shafik, Alex Yakovlev
Machine Learning · Cross-listed from cs.CR
Walma: Learning to See Memory Corruption in WebAssembly
Oussama Draissi, Mark Günzel, Ahmad-Reza Sadeghi et al. (+1 more)
The monolithic linear
memory of WebAssembly (Wasm) creates a bidirectional attack surface: a
memory corruption bug in a module can compromise the host, and a compromised host can corrupt the state of a trusted module. Existing defenses either require custom runtimes or source code changes, and none can verify runtime integrity under an
adversarial host. We present WALMA, the first attestation framework delivering resilience by reaction against data-centric attacks that corrupt a region of
memory. We render linear
memory snapshots as grayscale images and classify them with a convolutional neural network. The network reads the row-aligned structure that compiled code imposes on
memory and detects corruption that byte and texture statistics miss. Our main VGG-16 detector reaches 95%–100% verdict accuracy on four of five CVE-affected applications without a single false alarm, and a 1.9M-parameter ResNet, small enough to run inside the runtime on every host call, stays within a few points of it on the same four. A Shannon-
entropy analysis bounds which out-of-band edits the network can separate from valid state, and black-box evasion requires contiguous overwrites of hundreds of kilobytes to megabytes. On the 53 WABench binaries, boundary attestation costs 1.07x–1.69x, scaling with a module's exposure to the host rather than with its runtime. WALMA thus makes linear
memory integrity a property a Wasm runtime can check continuously: end to end against compromised modules, and against untrusted hosts provided snapshots reach the verifier intact.
Read the full abstract ▾
All authors Oussama Draissi, Mark Günzel, Ahmad-Reza Sadeghi, Lucas Davi
Machine Learning · Cross-listed from cs.CL
A visual observation on the geometry of UMAP projections of the difference vectors of antonym and synonym word pair embeddings
Rami Luisto
Antonyms, or opposites, are sometimes defined as word pairs that have all of the same contextually relevant properties but one. Seeing how
transformer models seem to encode concepts as directions, this begs the question if one can detect “antonymity” in the geometry of the
embedding vectors of word pairs, especially based on their difference vectors. Such geometrical studies are then naturally contrasted by comparing antonymic pairs to their opposites; synonyms. This paper started as an exploratory project on the complexity of the systems needed to detect the geometry of the
embedding vectors of antonymic word pairs. What we now report is a curious “swirl” that appears across
embedding models in a somewhat specific projection configuration.
Read the full abstract ▾
Machine Learning
Linear-Nonlinear Fusion Neural Operator for Partial Differential Equations
Heng Wu, Junjie Wang and Benzhuo Lu
Neural operator learning directly constructs the mapping relationship from the equation parameter space to the solution space, enabling efficient direct inference in practical applications without the need for repeated solution of partial differential equations (PDEs) – an advantage that is difficult to achieve with traditional numerical methods. In this work, we find that explicitly decoupling linear and nonlinear effects within such operator mappings leads to improved learning efficiency. This yields a novel network structure, namely the Linear-Nonlinear Fusion Neural Operator (LNF-NO), which models operator mappings via the multiplicative fusion of a linear component and a nonlinear component, thus achieving a lightweight and interpretable representation. This linear-nonlinear decoupling enables efficient capture of complex solution features at the operator level while maintaining stability and generality. LNF-NO naturally supports multiple functional inputs and is applicable to both regular grids and irregular geometries. Across a diverse suite of PDE operator-learning
benchmarks, including nonlinear Poisson-Boltzmann equations and multi-physics coupled systems, LNF-NO is typically substantially faster to train than several representative neural operator baselines, while achieving comparable or improved accuracy across most tested cases. On the tested 3D Poisson-Boltzmann case, LNF-NO achieves strong accuracy while requiring substantially less training time than the three-dimensional
Fourier Neural Operator and Transolver baselines.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Tutor-Student Reinforcement Learning: A Dynamic Curriculum for Robust Deepfake Detection
Zhanhe Lei, Zhongyuan Wang, Jikang Cheng et al. (+5 more)
Standard supervised training for deepfake detection treats all samples with uniform importance, which can be suboptimal for learning robust and generalizable features. In this work, we propose a novel Tutor-Student Reinforcement Learning (TSRL) framework to dynamically optimize the training curriculum. Our method models the training process as a Markov Decision Process where a “Tutor”
agent learns to guide a “Student” (the deepfake detector). The Tutor, implemented as a Proximal Policy Optimization (PPO)
agent, observes a rich state representation for each training sample, encapsulating not only its visual features but also its historical learning dynamics, such as EMA loss and forgetting counts. Based on this state, the Tutor takes an action by assigning a continuous weight (0-1) to the sample's loss, thereby dynamically re-weighting the training batch. The Tutor is rewarded based on the Student's immediate performance change, specifically rewarding transitions from incorrect to correct predictions. This strategy encourages the Tutor to learn a curriculum that prioritizes high-value samples, such as hard-but-learnable examples, leading to a more efficient and effective training process. We demonstrate that this adaptive curriculum improves the Student's generalization capabilities against unseen manipulation techniques compared to traditional training methods. Code is available at https://github.com/wannac1/TSRL.
Read the full abstract ▾
All authors Zhanhe Lei, Zhongyuan Wang, Jikang Cheng, Baojin Huang, Yuhong Yang, Zhen Han, Chao Liang, Dengpan Ye
Machine Learning
Efficient Controller Learning from Human Preferences and Numerical Data Via Multi-Modal Surrogate Models
Lukas Theiner, Maik Pfefferkorn, Yongpeng Zhao et al. (+2 more)
Tuning control policies manually to meet high-level objectives is often time-consuming.
Bayesian optimization provides a data-efficient framework for automating this process using numerical evaluations of an objective function. However, many systems, particularly those involving humans, require optimization based on subjective criteria. Preferential
Bayesian optimization addresses this by learning from pairwise comparisons instead of quantitative measurements, but relying solely on preference data can be inefficient. We propose a multi-fidelity, multi-modal
Bayesian optimization framework that integrates low-fidelity numerical data with high-fidelity human preferences. Our approach employs Gaussian process surrogate models with both hierarchical, autoregressive and non-hierarchical, coregionalization-based structures, enabling efficient learning from mixed-modality data. We illustrate the framework by tuning an autonomous vehicle's trajectory planner, showing that combining numerical and preference data significantly reduces the need for experiments involving the human decision maker while effectively adapting driving style to individual preferences.
Read the full abstract ▾
All authors Lukas Theiner, Maik Pfefferkorn, Yongpeng Zhao, Sebastian Hirt, Rolf Findeisen
Machine Learning · Cross-listed from cs.CL
MedAidDialog: A Multilingual Multi-Turn Medical Dialogue Dataset for Accessible Healthcare
Shubham Kumar Nigam, Suparnojit Sarkar and Piyush Patel
Conversational artificial intelligence has the potential to assist users in preliminary medical consultations, particularly in settings where access to healthcare professionals is limited. However, many existing medical dialogue systems operate in a single-turn question–answering paradigm or rely on template-based
datasets, limiting conversational realism and
multilingual applicability. In this work, we introduce MedAidDialog, a
multilingual multi-turn medical dialogue
dataset designed to simulate realistic physician–patient consultations. The
dataset extends the MDDial corpus by generating synthetic consultations using large
language models and further expands them into a parallel
multilingual corpus covering seven
languages: English, Hindi, Telugu, Tamil, Bengali, Marathi, and Arabic. Building on this
dataset, we develop MedAidLM, a conversational medical model trained using parameter-efficient fine-tuning on quantized small
language models, enabling deployment without high-end computational infrastructure. Our framework additionally incorporates optional patient pre-context information (e.g., age, gender, allergies) to personalize the consultation process. Experimental results demonstrate that the proposed system can effectively perform symptom elicitation through multi-turn dialogue and generate diagnostic recommendations. We further conduct medical expert evaluation to assess the plausibility and coherence of the generated consultations.
Read the full abstract ▾
Machine Learning
Reservoir-Based Graph Convolutional Networks
Mayssa Soussia, Gita Ayu Salsabila, Mohamed Ali Mahjoub et al. (+1 more)
Message passing is a core mechanism in Graph Neural Networks (GNNs), enabling the iterative update of node
embeddings by aggregating information from neighboring nodes. Graph Convolutional Networks (GCNs) exemplify this approach by adapting convolutional operations for graph structures, allowing features from adjacent nodes to be combined effectively. However, GCNs encounter challenges with complex or dynamic data. Capturing long-range dependencies often requires deeper layers, which not only increase computational costs but also lead to over-smoothing, where node
embeddings become indistinguishable. To overcome these challenges, reservoir computing has been integrated into GNNs, leveraging iterative message-passing dynamics for stable information propagation without extensive parameter tuning. Despite its promise, existing reservoir-based models lack structured convolutional mechanisms, limiting their ability to accurately aggregate multi-hop neighborhood information. To address these limitations, we propose RGC-Net (Reservoir-based Graph Convolutional Network), which integrates reservoir dynamics with structured graph convolution. Key contributions include: (i) a reimagined convolutional framework with fixed-random reservoir weights and a leaky integrator to enhance feature retention; (ii) a robust, adaptable model for graph classification; and (iii) an RGC-Net-powered
transformer for graph generation with application to dynamic
brain connectivity. Extensive experiments show RGC-Net achieves state-of-the-art performance in classification and generative tasks, including
brain graph
evolution, with faster convergence and mitigated over-smoothing. Our source code is available at https://github.com/basiralab/RGC-Net.
Read the full abstract ▾
All authors Mayssa Soussia, Gita Ayu Salsabila, Mohamed Ali Mahjoub, Islem Rekik