Machine Learning
Translational Gaps in Graph Transformers for Longitudinal EHR Prediction: A Critical Appraisal of GT-BEHRT
Krish Tadigotla
Transformer-based models have improved predictive modeling on longitudinal electronic health records through large-scale self-supervised pretraining. However, most EHR
transformer architectures treat each clinical encounter as an unordered collection of codes, which limits their ability to capture meaningful relationships within a visit. Graph-
transformer approaches aim to address this limitation by modeling visit-level structure while retaining the ability to learn long-term temporal patterns. This paper provides a critical review of GT-BEHRT, a graph-
transformer architecture evaluated on MIMIC-IV intensive care outcomes and heart failure prediction in the All of Us Research Program. We examine whether the reported performance gains reflect genuine architectural benefits and whether the evaluation methodology supports claims of robustness and clinical relevance. We analyze GT-BEHRT across seven dimensions relevant to modern machine learning systems, including representation design, pretraining strategy, cohort construction transparency, evaluation beyond discrimination,
fairness assessment, reproducibility, and deployment feasibility. GT-BEHRT reports strong discrimination for heart failure prediction within 365 days, with AUROC 94.37 +/- 0.20, AUPRC 73.96 +/- 0.83, and F1 64.70 +/- 0.85. Despite these results, we identify several important gaps, including the lack of calibration analysis, incomplete
fairness evaluation, sensitivity to cohort selection, limited analysis across phenotypes and prediction horizons, and limited discussion of practical deployment considerations. Overall, GT-BEHRT represents a meaningful architectural advance in EHR representation learning, but more rigorous evaluation focused on calibration,
fairness, and deployment is needed before such models can reliably support clinical decision-making.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
Evaluating Few-Shot Temporal Reasoning of LLMs for Human Activity Prediction in Smart Environments
Maral Doctorarastoo, Katherine A. Flanigan, Mario Bergés et al. (+1 more)
Anticipating human activities and their durations is essential in applications such as smart-home automation, simulation-based architectural and urban design, activity-based transportation system simulation, and human-
robot collaboration, where adaptive systems must respond to human activities. Existing data-driven
agent-based models–from rule-based to deep learning–struggle in low-data environments, limiting their practicality. This paper investigates whether large
language models, pre-trained on broad human knowledge, can fill this gap by
reasoning about everyday activities from compact contextual cues. We adopt a
retrieval-augmented prompting strategy that integrates four sources of context–temporal, spatial, behavioral history, and persona–and evaluate it on the CASAS Aruba smart-home
dataset. The evaluation spans two complementary tasks: next-activity prediction with duration estimation, and multi-step daily sequence generation, each tested with various numbers of few-shot examples provided in the
prompt. Analyzing few-shot effects reveals how much contextual supervision is sufficient to balance data efficiency and predictive accuracy, particularly in low-data environments. Results show that large
language models exhibit strong inherent temporal understanding of human behavior: even in zero-shot settings, they produce coherent daily activity predictions, while adding one or two demonstrations further refines duration calibration and categorical accuracy. Beyond a few examples, performance saturates, indicating diminishing returns. Sequence-level evaluation confirms consistent temporal
alignment across few-shot conditions. These findings suggest that pre-trained
language models can serve as promising temporal reasoners, capturing both recurring routines and context-dependent behavioral variations, thereby strengthening the behavioral modules of
agent-based models.
Read the full abstract ▾
All authors Maral Doctorarastoo, Katherine A. Flanigan, Mario Bergés, Christopher McComb
Machine Learning
Sparse Adapter Fusion for Continual Learning in NLP
Min Zeng, Xi Chen, Haiqin Yang et al. (+1 more)
Continual learning in natural
language processing plays a crucial role in adapting to evolving data and preventing catastrophic forgetting. Despite significant progress, existing methods still face challenges, such as inefficient parameter reuse across tasks, risking catastrophic forgetting when tasks are dissimilar, and the unnecessary introduction of new parameters for each task, which hampers knowledge sharing among similar tasks. To tackle these issues, we propose a Sparse Adapter Fusion Method (SAFM), which dynamically fuses old and new adapters to address these challenges. SAFM operates in two stages: the decision stage and the tuning stage. In the decision stage, SAFM determines whether to incorporate a new adapter, reuse an existing one, or add an empty adapter. The architecture search procedure, designed to prioritize reusing or adding empty adapters, minimizes parameter consumption and maximizes reuse. In the tuning stage, SAFM especially facilitates a layer-wise loss to encourage differentiation between adapters, effectively capturing knowledge within the same task. Experimental results consistently show that SAFM outperforms state-of-the-art (SOTA) methods, achieving comparable performance while utilizing less than 60% of the parameters.
Read the full abstract ▾
All authors Min Zeng, Xi Chen, Haiqin Yang, Yike Guo
Machine Learning · Cross-listed from q-fin.ST
Test-Time Adaptation for Non-stationary Time Series: From Synthetic Regime Shifts to Financial Markets
Yurui Wu, Qingying Deng, Wonou Chung et al. (+1 more)
Time series encountered in practice are rarely stationary. When the data distribution changes, a
forecasting model trained on past observations can lose accuracy. We study a small-footprint test-time adaptation (TTA) framework for causal timeseries
forecasting and direction classification. The backbone is frozen, and only normalization affine parameters are updated using recent unlabeled windows. For classification we minimize
entropy and enforce temporal consistency; for regression we minimize prediction variance across weak time-preserving augmentations and optionally distill from an EMA teacher. A quadratic drift penalty and an uncertainty triggered fallback keep updates stable. We evaluate this framework in two stages: synthetic regime shifts on ETT
benchmarks, and daily equity and FX series (SPY, QQQ, EUR/USD) across pandemic, high-inflation, and recovery regimes. On synthetic gradual drift, normalization-based TTA improves
forecasting error, while in financial
markets a simple batch-normalization statistics update is a robust default and more aggressive norm-only adaptation can even hurt. Our results provide practical guidance for deploying TTA on non-stationary time series.
Read the full abstract ▾
All authors Yurui Wu, Qingying Deng, Wonou Chung, Mairui Li
Machine Learning
Generative AI-enhanced Probabilistic Multi-Fidelity Surrogate Modeling Via Transfer Learning
Jice Zeng, David Barajas-Solano and Hui Chen
The performance of machine learning surrogates is critically dependent on data quality and quantity. This presents a major challenge, as high-fidelity (HF) data is often scarce and computationally expensive to acquire, while low-fidelity (LF) data is abundant but less accurate. To address this data-scarcity problem, we propose a probabilistic multi-fidelity surrogate modeling framework that integrates transfer learning with generative modeling. We employ a normalizing flow (NF) generative model as the backbone, which is trained in two phases: (i) the NF is first pretrained on a large LF
dataset to learn a probabilistic forward model; (ii) the pretrained model is then fine-tuned on a small HF
dataset, allowing it to correct for LF–HF discrepancies via knowledge transfer. To relax the dimension-preserving constraint of standard bijective NFs, we integrate surjective (dimension-reducing) layers with standard coupling blocks. This architecture enables learned dimension reduction while preserving the ability to train with exact likelihoods. The resulting surrogate provides fast probabilistic predictions with quantified uncertainty and significantly outperforms LF-only baselines while using fewer HF evaluations. We validate the approach for two
benchmark systems: a rail-sleeper-ballast and a reinforced concrete slab. For both applications, we combine many coarse-mesh (LF) simulations with a limited set of fine-mesh (HF) simulations. The proposed model achieves probabilistic predictions with HF accuracy, demonstrating a practical path toward data-efficient, generative AI-driven surrogates for complex engineering systems.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CY
FoundationalASSIST: An Educational Dataset for Foundational Knowledge Tracing and Pedagogical Grounding of LLMs
Eamon Worden, Cristina Heffernan, Neil Heffernan et al. (+1 more)
Can Large
Language Models understand how students learn? As LLMs are deployed for adaptive testing and personalized tutoring, this question becomes urgent – yet we cannot answer it with existing resources. Current educational
datasets provide only question identifiers and binary correctness labels, rendering them opaque to LLMs that reason in natural
language. We address this gap with FoundationalASSIST, the first English educational
dataset providing the complete information needed for research on LLMs in education: full question text, actual student responses (not just right/wrong), records of which wrong answers students chose, and
alignment to Common Core K-12 standards. These 1.7 million interactions from 5,000 students enable research directions that were previously impossible to pursue, from fine-tuning student models to analyzing misconception patterns. To demonstrate the
dataset's utility, we evaluate four frontier models (GPT-OSS-120B, Llama-3.3-70B, Qwen3-Next-80B variants) on two complementary task families: Knowledge Tracing, testing whether LLMs can predict student performance on questions, and the exact answer a student will give; and Pedagogical Grounding, testing whether LLMs understand the properties that make assessment items effective. Our evaluation reveals significant gaps in current LLM capabilities. Every model barely achieves a trivial baseline on knowledge tracing. All models fall below random chance on item discrimination, indicating that LLMs do not understand what makes one problem more diagnostic than another. Models do show competence at judging relative difficulty (up to 68.6%), but this partial success only highlights the gaps elsewhere. These results establish that substantial advances are needed before LLMs can reliably support personalized learning at scale. We release FoundationalASSIST to support progress on these foundational challenges.
Read the full abstract ▾
All authors Eamon Worden, Cristina Heffernan, Neil Heffernan, Shashank Sonkar
Machine Learning · Cross-listed from math.FA
On finite-dimensional encoding/decoding theorems for neural operators
Vinícius Luz Oliveira and Vladimir G. Pestov
Recently, versions of neural networks with infinite-dimensional affine operators inside the computational units (“neural operator” networks) have been applied to learn solutions to differential equations. To enable practical computations, one employs finite-dimensional encoding/decoding
theorems of the following kind: every continuous mapping $f$ between function spaces $E$ and $F$ is approximated in the
topology of uniform convergence on compacta by continuous mappings factoring through two finite dimensional
Banach spaces. Such a result is known (Kovachki et al., 2023) for $E,F$ being
Banach spaces having the approximation property. We point out that the result needs no assumptions on $E,F$ whatsoever and remains true not only for all normed spaces, but for arbitrary locally convex spaces as well. At the same time, an analogous result for $C^k$-smooth mappings and the $C^k$ compact open
topology, $k\geq 1$, holds if and only if the space $E$ has the approximation property. This analysis may be useful already because non-normable locally convex function spaces are common in the theory of differential equations, the main field of applications for the emerging theory.
Read the full abstract ▾
Machine Learning
Modality as Heterogeneity: Node Splitting and Graph Rewiring for Multimodal Graph Learning
Yihan Zhang and Ercan E. Kuruoglu
Multimodal graphs are gaining increasing
attention due to their rich representational power and wide applicability, yet they introduce substantial challenges arising from severe modality confusion. To address this issue, we propose NSG (Node Splitting Graph)-MoE, a
multimodal graph learning framework that integrates a node-splitting and graph-rewiring mechanism with a structured Mixture-of-Experts (MoE) architecture. It explicitly decomposes each node into modality-specific components and assigns relation-aware experts to process heterogeneous message flows, thereby preserving structural information and
multimodal semantics while mitigating the undesirable mixing effects commonly observed in general-purpose GNNs. Extensive experiments on three
multimodal benchmarks demonstrate that NSG-MoE consistently surpasses strong baselines. Despite incorporating MoE – which is typically computationally heavy – our method achieves competitive training efficiency. Beyond empirical results, we provide a spectral analysis revealing that NSG performs adaptive filtering over modality-specific subspaces, thus explaining its disentangling behavior. Furthermore, an information-theoretic analysis shows that the architectural constraints imposed by NSG reduces mutual information between data and parameters and improving generalization capability.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.SE
IntentCoding: Amplifying User Intent in Code Generation
Zheng Fang, Yihong Dong, Lili Mou et al. (+3 more)
Large
Language Models (LLMs) have shown strong capabilities in code generation, but their adherence to fine-grained user intent with multiple constraints remains a significant challenge. Our empirical analysis reveals two key observations: 1) Model performance deteriorates quickly as the number of constraints in the user intent increases, and 2) While user intent does influence the model's logits, such an influence may not be strong enough to effectively steer the decoding process. To this end, we propose Intent-Amplified Code Generation (IntentCoding), a novel decoding strategy that enhances an LLM's ability to follow user intent. IntentCoding captures the influence of user intent by masking out the intent, and applies a multi-strength ensemble mechanism to amplify the effect of user intent during generation. IntentCoding is model-agnostic, requires no additional training, and integrates seamlessly with existing decoding procedures. To enable systematic evaluation, we also construct CodeConstraints, a
benchmark dataset specifically designed to test user intent compliance under varying numbers of constraints. Experiments on our constructed Constraints, as well as popular IFEvalCode, HumanEval and LiveCodeBench
datasets, show that our IntentCoding model significantly improves both constraint satisfaction and functional correctness compared to standard decoding approaches. IntentCoding achieves up to 71.0% relative improvement on CodeConstraints, achieves up to 67.3% relative improvement on IFEvalCode and achieves up to 29.3% relative improvement in pass@1 on HumanEval and LiveCodeBench compared with greedy decoding.
Read the full abstract ▾
All authors Zheng Fang, Yihong Dong, Lili Mou, Dongming Jin, Zhi Jin, Ge Li
Machine Learning
SPGCL: Simple yet Powerful Graph Contrastive Learning via SVD-Guided Structural Perturbation
Hao Deng, Zhang Guo, Shuiping Gou et al. (+1 more)
Graph Neural Networks (GNNs) are sensitive to structural noise from
adversarial attacks or imperfections. Existing graph contrastive learning (GCL) methods typically rely on either random perturbations (e.g., edge dropping) for diversity or spectral augmentations (e.g., SVD) to preserve structural priors. However, random perturbations are structure-agnostic and may remove critical edges, while SVD-based views often lack sufficient diversity. Integrating these paradigms is challenging as they operate on discrete edge removal and continuous
matrix factorization, respectively.We propose SPGCL, a framework for robust GCL via SVD-guided structural perturbation. Leveraging a recently developed SVD-based method that generalizes structural perturbation theory to arbitrary graphs, we design a two-stage strategy: (1) lightweight
stochastic edge removal to inject diversity, and (2) truncated SVD to derive a structure-aware scoring
matrix for sparse top-$P$ edge recovery. This integration offers three advantages: (1) Robustness to accidental deletion, as important edges can be recovered by SVD-guided scoring; (2) Enrichment with missing links, creating more informative contrastive views by introducing semantically meaningful edges; and (3) Controllable structural discrepancy, ensuring contrastive signals stem from semantic differences rather than edge-number gaps.Furthermore, we incorporate a contrastive fusion module with a global similarity constraint to align
embeddings. Extensive experiments on ten
benchmark datasets demonstrate that SPGCL consistently improves the robustness and accuracy of GNNs, outperforming state-of-the-art GCL and structure learning methods, validating its effectiveness in integrating previously disparate paradigms.
Read the full abstract ▾
All authors Hao Deng, Zhang Guo, Shuiping Gou, Bo Liu
Machine Learning
The Impact of Machine Learning Uncertainty on the Robustness of Counterfactual Explanations
Leonidas Christodoulou and Chang Sun
Counterfactual explanations are widely used to interpret machine learning predictions by identifying minimal changes to input features that would alter a model's decision. However, most existing counterfactual methods have not been tested when model and data uncertainty change, resulting in explanations that may be unstable or invalid under real-world variability. In this work, we investigate the robustness of common combinations of machine learning models and counterfactual generation
algorithms in the presence of both aleatoric and epistemic uncertainty. Through experiments on synthetic and real-world tabular
datasets, we show that counterfactual explanations are highly sensitive to model uncertainty. In particular, we find that even small reductions in model accuracy - caused by increased noise or limited data - can lead to large variations in the generated counterfactuals on average and on individual instances. These findings underscore the need for uncertainty-aware explanation methods in domains such as finance and the social sciences.
Read the full abstract ▾
Machine Learning
SCPL: Enhancing Neural Network Training Throughput with Decoupled Local Losses and Model Parallelism
Ming-Yao Ho, Cheng-Kai Wang, You-Teng Lin et al. (+1 more)
Adopting large-scale AI models in enterprise information systems is often hindered by high training costs and long development cycles, posing a significant managerial challenge. The standard end-to-end backpropagation (BP)
algorithm is a primary driver of modern AI, but it is also the source of inefficiency in training deep networks. This paper introduces a new training methodology, Supervised Contrastive Parallel Learning (SCPL), that addresses this issue by decoupling BP and transforming a long gradient flow into multiple short ones. This design enables the simultaneous computation of parameter gradients in different layers, achieving superior model parallelism and enhancing training throughput. Detailed experiments are presented to demonstrate the efficiency and effectiveness of our model compared to BP, Early Exit, GPipe, and Associated Learning (AL), a state-of-the-art method for decoupling backpropagation. By mitigating a fundamental performance bottleneck, SCPL provides a practical pathway for organizations to develop and deploy advanced information systems more cost-effectively and with greater agility. The experimental code is released for reproducibility. https://github.com/minyaho/scpl/
Read the full abstract ▾
All authors Ming-Yao Ho, Cheng-Kai Wang, You-Teng Lin, Hung-Hsuan Chen
Machine Learning · Cross-listed from cs.CY
A longitudinal geospatial multimodal dataset of post-discharge frailty, physiology, mobility, and neighborhoods
Ali Abedi, Charlene H. Chu and Shehroz S. Khan
Frailty in older adults is associated with increased vulnerability to functional decline, reduced mobility, social isolation, and challenges during the transition from hospital to community living. These factors are associated with rehospitalization and may adversely influence recovery. Neighborhood environments can further shape recovery trajectories by affecting mobility opportunities, social engagement, and access to community resources.
Multimodal sensing technologies combined with data-driven analytical approaches offer the potential to continuously monitor these multidimensional factors in real-world settings. This Data Descriptor presents GEOFRAIL, a longitudinal geospatial
multimodal dataset collected from community-dwelling frail older adults following hospital discharge. The
dataset is organized into interconnected tables capturing participant demographics, features derived from
multimodal sensors, biweekly clinical assessments of frailty, physical function, and social isolation, and temporal location records linked to neighborhood amenities, crime rates, and census-based socioeconomic indicators. Data were collected over an eight-week post-discharge period using standardized pipelines with
privacy-preserving spatial aggregation. Technical validation demonstrates internal consistency across geospatial, sensor-derived, and clinical measures and reports baseline performance of machine learning models for characterizing recovery trajectories.
Read the full abstract ▾
Machine Learning
TextBFGS: A Case-Based Reasoning Approach to Code Optimization via Error-Operator Retrieval
Zizheng Zhang, Yuyang Liao, Chen Chen et al. (+8 more)
Iterative code generation with Large
Language Models (LLMs) can be viewed as an optimization process guided by textual feedback. However, existing LLM self-correction methods predominantly operate in a stateless, trial-and-error manner akin to first-order search, failing to leverage past problem-solving experiences. To bridge this gap, we introduce TextBFGS, a Case-Based
Reasoning (CBR) framework inspired by the Quasi-Newton optimization method. Instead of retrieving raw, unstructured textual instances, TextBFGS maintains a dynamic Case Base of historical "Error-to-Operator" correction trajectories to approximate the semantic
curvature (inverse Hessian
matrix) of the task. Specifically, given a textual error feedback (the target problem), TextBFGS retrieves analogous historical correction patterns (Retrieve) and applies these abstract operators to refine the current code (Reuse/Revise). Furthermore, successful adaptations are continuously retained back into the Case Base (Retain), enabling a self-evolving system. Empirical evaluations on Python code optimization tasks (HumanEval, MBPP) demonstrate that TextBFGS significantly outperforms stateless baselines. It achieves superior pass rates with fewer model calls, establishing an efficient, experience-driven paradigm for LLM-based code optimization.
Read the full abstract ▾
All authors Zizheng Zhang, Yuyang Liao, Chen Chen, Jian He, Dun Wu, Qianjin Yu, Yanqin Gao, Jin Yang, Kailai Zhang, Eng Siong Chng, Xionghu Zhong
Machine Learning · Cross-listed from cs.CR
Comparison of Multiple Classifiers for Android Malware Detection with Emphasis on Feature Insights Using CICMalDroid 2020 Dataset
Md Min-Ha-Zul Abedin and Tazqia Mehrub
Accurate Android malware detection was critical for protecting users at scale. Signature scanners lagged behind fast release cycles on public app stores. We aimed to build a trustworthy detector by pairing a comprehensive
dataset with a rigorous, transparent evaluation, and to identify interpretable drivers of decisions. We used CICMalDroid2020, which contained 17,341 apps across Benign, Adware, Banking, SMS malware, and Riskware. We extracted 301 static and 263 dynamic features into a 564 dimensional hybrid vector, then evaluated seven classifiers under three schemes, original features, principal component analysis, PCA, and linear discriminant analysis, LDA, with a 70 percent training and 30 percent test split. Results showed that gradient boosting on the original features performed best. XGBoost achieved 0.9747 accuracy, 0.9703 precision, 0.9731 recall, and 0.9716 F1, and the confusion
matrix indicated rare benign labels for malicious apps. HistGradientBoosting reached 0.9741 accuracy and 0.9708 F1, while CatBoost and Random Forest were slightly lower at 0.9678 and 0.9687 accuracy with 0.9636 and 0.9637 F1. KNN and SVM lagged. PCA reduced performance for all models, with XGBoost dropping to 0.9164 accuracy and 0.8988 F1. LDA maintained mid 90s accuracy and clarified separable clusters in projections. A depth two surrogate tree highlighted package name, main activity, and target SDK as key drivers. These findings established high fidelity supervised baselines for Android malware detection and indicated that rich hybrid features with gradient boosting offered a practical and interpretable foundation for deployment.
Read the full abstract ▾
Machine Learning · Cross-listed from q-bio.NC
Explore Brain-Inspired Machine Intelligence for Connecting Dots on Graphs Through Holographic Blueprint of Oscillatory Synchronization
Tingting Dan, Jiaqi Ding and Guorong Wu
Neural coupling in both neuroscience and artificial intelligence emerges as dynamic oscillatory patterns that encode abstract concepts. To this end, we hypothesize that a deeper understanding of the neural mechanisms governing
brain rhythms can inspire next-generation design principles for machine learning
algorithms, leading to improved efficiency and robustness. Building on this idea, we first model evolving
brain rhythms through the interference of spontaneously synchronized neural oscillations, termed HoloBrain. The success of modeling
brain rhythms using an artificial dynamical system of coupled oscillations motivates a "first principle" for
brain-inspired machine intelligence based on a shared synchronization mechanism, termed HoloGraph. This principle enables graph neural networks to move beyond conventional heat
diffusion paradigms toward modeling oscillatory synchronization. Our HoloGraph framework not only effectively mitigates the over-smoothing problem in graph neural networks but also demonstrates strong potential for
reasoning and solving challenging problems on graphs.
Read the full abstract ▾
Machine Learning
Variational Quantum Circuit-Based Reinforcement Learning for Dynamic Portfolio Optimization
Vincent Gurgul, Ying Chen and Stefan Lessmann
This paper presents a
Quantum Reinforcement Learning (QRL) solution to the dynamic portfolio optimization problem based on Variational
Quantum Circuits. The implemented QRL approaches are
quantum analogues of the classical neural-network-based Deep Deterministic Policy Gradient and Deep Q-Network
algorithms. Through an empirical evaluation on real-world financial data, we show that our
quantum agents achieve risk-adjusted performance comparable to, and in some cases exceeding, that of classical Deep RL models with several orders of magnitude more parameters. However, while
quantum circuit execution is inherently fast at the hardware level, practical deployment on cloud-based
quantum systems introduces substantial latency, making end-to-end runtime currently dominated by infrastructural overhead and limiting practical applicability. Taken together, our results suggest that QRL is theoretically competitive with state-of-the-art classical reinforcement learning and may become practically advantageous as deployment overheads diminish. This positions QRL as a promising paradigm for dynamic decision-making in complex, high-dimensional, and non-stationary environments such as financial
markets. The complete codebase is released as open source at: https://github.com/VincentGurgul/qrl-dpo-public
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Atomic Depth Estimation From Noisy Electron Microscopy Data Via Deep Learning
Matan Leibovich, Mai Tan, Ramon Manzorro et al. (+4 more)
We present a novel approach for extracting 3D atomic-level information from transmission electron microscopy (TEM) images affected by significant noise. The approach is based on formulating depth estimation as a semantic
segmentation problem. We address the resulting
segmentation problem by training a deep convolutional neural network to generate pixel-wise depth
segmentation maps using simulated data corrupted by synthetic noise. The proposed method was applied to estimate the depth of atomic columns in CeO2 nanoparticles from simulated images and real-world TEM data. Our experiments show that the resulting depth estimates are accurate, calibrated and robust to noise.
Read the full abstract ▾
All authors Matan Leibovich, Mai Tan, Ramon Manzorro, Adria Marcos-Morales, Sreyas Mohan, Peter A. Crozier, Carlos Fernandez-Granda
Machine Learning · Cross-listed from cs.CV
Hybrid Deep Feature Extraction and ML for Construction and Demolition Debris Classification
Obai Alashram, Nejad Alagha, Mahmoud AlKakuri et al. (+2 more)
The construction industry produces significant volumes of debris, making effective sorting and classification critical for sustainable waste management and resource recovery. This study presents a hybrid
vision-based pipeline that integrates deep feature extraction with classical machine learning (ML) classifiers for automated construction and demolition (C&D) debris classification. A novel
dataset comprising 1,800 balanced, high-quality images representing four material categories, Ceramic/Tile, Concrete, Trash/Waste, and Wood was collected from real construction sites in the UAE, capturing diverse real-world conditions. Deep features were extracted using a pre-trained Xception network, and multiple ML classifiers, including SVM, kNN, Bagged Trees, LDA, and Logistic Regression, were systematically evaluated. The results demonstrate that hybrid pipelines using Xception features with simple classifiers such as Linear SVM, kNN, and Bagged Trees achieve state-of-the-art performance, with up to 99.5% accuracy and macro-F1 scores, surpassing more complex or end-to-end deep learning approaches. The analysis highlights the operational benefits of this approach for robust, field-deployable debris identification and provides pathways for future integration with robotics and onsite automation systems.
Read the full abstract ▾
All authors Obai Alashram, Nejad Alagha, Mahmoud AlKakuri, Zeeshan Swaveel, Abigail Copiaco
Machine Learning · Cross-listed from cs.SD
SoundBreak: A Systematic Study of Audio-Only Adversarial Attacks on Trimodal Models
Aafiya Hussain, Gaurav Srivastava, Alvi Ishmam et al. (+2 more)
Multimodal foundation models that integrate audio,
vision, and
language achieve strong performance on
reasoning and generation tasks, yet their robustness to
adversarial manipulation remains poorly understood. We study a realistic and underexplored threat model: untargeted, audio-only
adversarial attacks on trimodal audio-
video-
language models. We analyze six complementary attack objectives that target different stages of
multimodal processing, including audio encoder representations, cross-modal
attention, hidden states, and output likelihoods. Across three state-of-the-art models and multiple
benchmarks, we show that audio-only perturbations can induce severe
multimodal failures, achieving up to 96% attack success rate. We further show that attacks can be successful at low perceptual distortions (LPIPS <= 0.08, SI-SNR >= 0) and benefit more from extended optimization than increased data scale. Transferability across models and encoders remains limited, while
speech recognition systems such as Whisper primarily respond to perturbation magnitude, achieving >97% attack success under severe distortion. These results expose a previously overlooked single-modality attack surface in
multimodal systems and motivate defenses that enforce cross-modal consistency.
Read the full abstract ▾
All authors Aafiya Hussain, Gaurav Srivastava, Alvi Ishmam, Zaber Hakim, Chris Thomas
Machine Learning · Cross-listed from q-bio.MN
Latent Causal Diffusions for Single-Cell Perturbation Modeling
Lars Lorch, Jiaqi Zhang, Charlotte Bunne et al. (+3 more)
Perturbation screens hold the potential to systematically map regulatory processes at single-
cell resolution, yet modeling and predicting transcriptome-wide responses to perturbations remains a major computational challenge. Existing methods often underperform simple baselines, fail to disentangle measurement noise from biological signal, and provide limited insight into the causal structure governing cellular responses. Here, we present the latent causal
diffusion (LCD), a generative model that frames single-
cell gene expression as a stationary
diffusion process observed under measurement noise. LCD outperforms established approaches in predicting the distributional shifts of unseen perturbation combinations in single-
cell RNA-sequencing screens while simultaneously learning a mechanistic dynamical system of gene regulation. To interpret these learned dynamics, we develop an approach we call causal linearization via perturbation responses (CLIPR), which yields an approximation of the direct causal effects between all genes modeled by the
diffusion. CLIPR provably identifies causal effects under a linear drift assumption and recovers causal structure in both simulated systems and a genome-wide perturbation screen, where it clusters genes into coherent functional modules and resolves causal relationships that standard differential expression analysis cannot. The LCD-CLIPR framework bridges generative modeling with causal inference to predict unseen perturbation effects and map the underlying regulatory mechanisms of the transcriptome.
Read the full abstract ▾
All authors Lars Lorch, Jiaqi Zhang, Charlotte Bunne, Andreas Krause, Bernhard Schölkopf, Caroline Uhler
Machine Learning · Cross-listed from cond-mat.dis-nn
Learning Nonlinear Heterogeneity in Physical Kolmogorov-Arnold Networks
Fabiana Taglietti, Andrea Pulici, Maxwell Roxburgh et al. (+10 more)
Physical neural networks typically train linear synaptic weights while treating device nonlinearities as fixed. We show the opposite - by training the synaptic nonlinearity itself, as in Kolmogorov-Arnold Network (KAN) architectures, we yield markedly higher task performance per physical resource and improved performance-parameter scaling than conventional linear weight-based networks, demonstrating ability of KAN
topologies to exploit reconfigurable nonlinear physical dynamics. We experimentally realise physical KANs in silicon-on-
insulator devices we term 'Synaptic Nonlinear Elements' (SYNEs), operating at room temperature, microampere currents, 2 MHz speeds and ~750 fJ per nonlinear operation, with no observed degradation over 10^13 measurements and months-long timescales. We demonstrate nonlinear function regression, classification, and prediction of Li-Ion battery dynamics from noisy real-world multi-sensor data. Physical KANs outperform equivalently-parameterised software multilayer perceptron networks across all tasks, with up to two orders of magnitude fewer parameters, and two orders of magnitude fewer devices than linear weight based physical networks. These results establish learned physical nonlinearity as a hardware-native computational primitive for compact and efficient learning systems, and SYNE devices as effective substrates for heterogenous nonlinear computing.
Read the full abstract ▾
All authors Fabiana Taglietti, Andrea Pulici, Maxwell Roxburgh, Gabriele Seguini, Ian Vidamour, Stephan Menzel, Edoardo Franco, Michele Laus, Eleni Vasilaki, Michele Perego, Thomas J. Hayward, Marco Fanciulli, Jack C. Gartside
Machine Learning
Shourya Jain and Paras Chopra
Users should not be systemically disadvantaged by the
language they use for interacting with LLMs; i.e. users across
languages should get responses of similar quality irrespective of
language used. In this work, we create a set of real-world open-ended questions based on our analysis of the WildChat
dataset and use it to evaluate whether responses vary by
language, specifically, whether answer quality depends on the
language used to query the model. We also investigate how
language and culture are entangled in LLMs such that choice of
language changes the cultural information and context used in the response by using LLM-as-a-Judge to identify the cultural context present in responses. To further investigate this, we evaluate LLMs on a translated subset of the CulturalBench
benchmark across multiple
languages. Our evaluations reveal that LLMs consistently provide lower quality answers to open-ended questions in low resource
languages. We find that
language significantly impacts the cultural context used by the model. This difference in context impacts the quality of the downstream answer.
Read the full abstract ▾
Machine Learning
Empowering LLMs for Structure-Based Drug Design via Exploration-Augmented Latent Inference
Xuanning Hu, Anchen Li, Qianli Xing et al. (+3 more)
Large
Language Models (LLMs) possess strong representation and
reasoning capabilities, but their application to structure-based drug design (SBDD) is limited by insufficient understanding of
protein structures and unpredictable molecular generation. To address these challenges, we propose Exploration-Augmented Latent Inference for LLMs (ELILLM), a framework that reinterprets the LLM generation process as an encoding, latent space exploration, and decoding workflow. ELILLM explicitly explores portions of the design problem beyond the model's current knowledge while using a decoding module to handle familiar regions, generating chemically valid and synthetically reasonable molecules. In our implementation,
Bayesian optimization guides the systematic exploration of latent
embeddings, and a position-aware surrogate model efficiently predicts binding affinity distributions to inform the search. Knowledge-guided decoding further reduces randomness and effectively imposes chemical validity constraints. We demonstrate ELILLM on the CrossDocked2020
benchmark, showing strong controlled exploration and high binding affinity scores compared with seven baseline methods. These results demonstrate that ELILLM can effectively enhance LLMs capabilities for SBDD.
Read the full abstract ▾
All authors Xuanning Hu, Anchen Li, Qianli Xing, Jinglong Ji, Hao Tuo, Bo Yang
Machine Learning · Cross-listed from cs.CL
RECAP: A Resource-Efficient Method for Adversarial Prompting in Large Language Models
Rishit Chugh
The deployment of large
language models (LLMs) has raised security concerns due to their susceptibility to producing harmful or policy-violating outputs when exposed to
adversarial prompts. While
alignment and guardrails mitigate common misuse, they remain vulnerable to automated jailbreaking methods such as GCG, PEZ, and GBDA, which generate
adversarial suffixes via training and gradient-based search. Although effective, these methods particularly GCG are computationally expensive, limiting their practicality for organisations with constrained resources. This paper introduces a resource-efficient
adversarial prompting approach that eliminates the need for retraining by matching new
prompts to a database of pre-trained
adversarial prompts. A
dataset of 1,000
prompts was classified into seven harm-related categories, and GCG, PEZ, and GBDA were evaluated on a Llama 3 8B model to identify the most effective attack method per category. Results reveal a correlation between
prompt type and
algorithm effectiveness. By retrieving semantically similar successful
adversarial prompts, the proposed method achieves competitive attack success rates with significantly reduced computational cost. This work provides a practical framework for scalable red-teaming and security evaluation of aligned LLMs, including in settings where model internals are inaccessible.
Read the full abstract ▾
Machine Learning
Report for NSF Workshop on AI for Electronic Design Automation
Deming Chen, Vijay Ganesh, Weikai Li et al. (+7 more)
This report distills the discussions and recommendations from the NSF Workshop on AI for Electronic Design Automation (EDA), held on December 10, 2024 in Vancouver alongside NeurIPS 2024. Bringing together experts across machine learning and EDA, the workshop examined how AI-spanning large
language models (LLMs), graph neural networks (GNNs), reinforcement learning (RL), neurosymbolic methods, etc.-can facilitate EDA and shorten design turnaround. The workshop includes four themes: (1) AI for physical synthesis and design for manufacturing (DFM), discussing challenges in physical manufacturing process and potential AI applications; (2) AI for high-level and logic-level synthesis (HLS/LLS), covering pragma insertion, program transformation, RTL code generation, etc.; (3) AI toolbox for optimization and design, discussing frontier AI developments that could potentially be applied to EDA tasks; and (4) AI for test and verification, including LLM-assisted verification tools, ML-augmented SAT solving, security/reliability challenges, etc. The report recommends NSF to foster AI/EDA collaboration, invest in foundational AI for EDA, develop robust data infrastructures, promote scalable compute infrastructure, and invest in workforce development to democratize hardware design and enable next-generation hardware systems. The workshop information can be found on the website https://ai4eda-workshop.github.io/.
Read the full abstract ▾
All authors Deming Chen, Vijay Ganesh, Weikai Li, Yingyan Celine Lin, Yong Liu, Subhasish Mitra, David Z. Pan, Ruchir Puri, Jason Cong, Yizhou Sun
Machine Learning
engGNN: A Dual-Graph Neural Network for Omics-Based Disease Classification and Feature Selection
Tiantian Yang, Yuxuan Wang, Zhenwei Zhou et al. (+1 more)
Omics data, such as transcriptomics, proteomics, and metabolomics, provide critical insights into disease mechanisms and clinical outcomes. However, their high dimensionality, small sample sizes, and intricate biological networks pose major challenges for reliable prediction and meaningful interpretation. Graph Neural Networks (GNNs) offer a promising way to integrate prior knowledge by encoding feature relationships as graphs. Yet, existing methods typically rely solely on either an externally curated feature graph or a data-driven generated one, which limits their ability to capture complementary information. To address this, we propose the external and generated Graph Neural Network (engGNN), a dual-graph framework that jointly leverages both external known biological networks and data-driven generated graphs. Specifically, engGNN constructs a biologically informed undirected feature graph from established network databases and complements it with a directed feature graph derived from tree-ensemble models. This dual-graph design produces more comprehensive
embeddings, thereby improving predictive performance and interpretability. Through extensive simulations and real-world applications to gene expression data, engGNN consistently outperforms state-of-the-art baselines. Beyond classification, engGNN provides interpretable feature importance scores that facilitate biologically meaningful discoveries, such as pathway enrichment analysis. Taken together, these results highlight engGNN as a robust, flexible, and interpretable framework for disease classification and biomarker discovery in high-dimensional omics contexts.
Read the full abstract ▾
All authors Tiantian Yang, Yuxuan Wang, Zhenwei Zhou, Ching-Ti Liu
Machine Learning
Search over Self-Edit Strategies for LLM Adaptation
Alistair Cheong, Haolin Cong, Tyler Yang et al. (+1 more)
Many LLM-based open-ended search systems freeze the foundation model that proposes improvements to existing solutions, which may bottleneck long-run progress. Recent work has explored updating the proposal model at test time [arXiv:2511.23473], but the update strategy is still typically hand-specified. Therefore, this study investigated whether an LLM can use task feedback to decide how it should update its weights. For tractability, we focused on the simpler case where there is only one round of self-improvement, and restricted the update operator to self-supervised next
token prediction (NTP), leaving the model freedom in choosing its training data and key NTP hyperparameters. Using the Self-Adapting
Language Models (SEAL) [arXiv:2506.10943] framework as a testbed, we relaxed its fixed human template constraint and allowed the model to generate its own self-edit templates, thereby giving it more control over its training data and hyperparameters. Two variants were studied, differing in whether template generation was conditioned on a lightweight archive of past templates. In SEAL's Single-Passage Knowledge Incorporation setting with Qwen3-8B on SQuAD [arXiv:1606.05250], the no-archive variant performed comparably to the weaker "Implications" baseline, while the archive variant outperformed "Implications" and approached the strongest human-designed "Rewrite" baseline without surpassing it. Further analysis of collapse in the model's exploration revealed that a naive archive can confer some short-term robustness but can also accelerate homogenization, suggesting that explicit novelty pressure may be required to consistently advance beyond carefully optimized human strategies. Our code is available at https://github.com/cheongalc/search-self-edit-strategies .
Read the full abstract ▾
All authors Alistair Cheong, Haolin Cong, Tyler Yang, Dustin Miao
Machine Learning · Cross-listed from cs.CR
LLM Security and Safety: Insights from Homotopy-Inspired Prompt Obfuscation
Luis Lazo, Hamed Jelodar and Roozbeh Razavi-Far
In this study, we propose a homotopy-inspired
prompt obfuscation framework to enhance understanding of security and safety vulnerabilities in Large
Language Models (LLMs). By systematically applying carefully engineered
prompts, we demonstrate how latent model behaviors can be influenced in unexpected ways. Our experiments encompassed 15,732
prompts, including 10,000 high-priority cases, across LLama, Deepseek, KIMI for code generation, and Claude to verify. The results reveal critical insights into current LLM safeguards, highlighting the need for more robust defense mechanisms, reliable detection strategies, and improved resilience. Importantly, this work provides a principled framework for analyzing and mitigating potential weaknesses, with the goal of advancing safe, responsible, and trustworthy AI technologies.
Read the full abstract ▾