Machine Learning · Cross-listed from cs.SD
Leveraging Prediction Entropy for Automatic Prompt Weighting in Zero-Shot Audio-Language Classification
Karim El Khoury, Maxime Zanella, Tiffanie Godelaine et al. (+2 more)
Audio-
language models have recently demonstrated strong zero-shot capabilities by leveraging natural-
language supervision to classify audio events without labeled training data. Yet, their performance is highly sensitive to the wording of text
prompts, with small variations leading to large fluctuations in accuracy. Prior work has mitigated this issue through
prompt learning or
prompt ensembling. However, these strategies either require annotated data or fail to account for the fact that some
prompts may negatively impact performance. In this work, we present an
entropy-guided
prompt weighting approach that aims to find a robust combination of
prompt contributions to maximize prediction confidence. To this end, we formulate a tailored objective function that minimizes prediction
entropy to yield new
prompt weights, utilizing low-
entropy as a proxy for high confidence. Our approach can be applied to individual samples or a batch of audio samples, requiring no additional labels and incurring negligible computational overhead. Experiments on five audio classification
datasets covering environmental, urban, and vocal sounds, demonstrate consistent gains compared to classical
prompt ensembling methods in a zero-shot setting, with accuracy improvements 5-times larger across the whole
benchmark.
Read the full abstract ▾
All authors Karim El Khoury, Maxime Zanella, Tiffanie Godelaine, Christophe De Vleeschouwer, Benoit Macq
Machine Learning
On the Hidden Objective Biases of Group-based Reinforcement Learning
Aleksandar Fontana, Marco Simoni, Giulio Rossolini et al. (+2 more)
Group-based reinforcement learning methods, like Group Relative Policy Optimization (GRPO), are widely used nowadays to post-train large
language models. Despite their empirical success, they exhibit structural mismatches between reward optimization and the underlying training objective. In this paper, we present a theoretical analysis of GRPO style methods by studying them within a unified surrogate formulation. This perspective reveals recurring properties that affect all the methods under analysis: (i) non-uniform group weighting induces systematic gradient biases on shared prefix
tokens; (ii) interactions with the AdamW optimizer make training dynamics largely insensitive to reward scaling; and (iii) optimizer momentum can push policy updates beyond the intended clipping region under repeated optimization steps. We believe that these findings highlight fundamental limitations of current approaches and provide principled guidance for the design of future formulations.
Read the full abstract ▾
All authors Aleksandar Fontana, Marco Simoni, Giulio Rossolini, Andrea Saracino, Paolo Mori
Machine Learning
On the Definition and Detection of Cherry-Picking in Counterfactual Explanations
James Hinns, Sofie Goethals, Stephan Van der Veeken et al. (+2 more)
Counterfactual explanations are widely used to communicate how inputs must change for a model to alter its prediction. For a single instance, many valid counterfactuals can exist, which leaves open the possibility for an explanation provider to cherry-pick explanations that better suit a narrative of their choice, highlighting favourable behaviour and withholding examples that reveal problematic behaviour. We formally define cherry-picking for counterfactual explanations in terms of an admissible explanation space, specified by the generation procedure, and a utility function. We then study to what extent an external auditor can detect such manipulation. Considering three levels of access to the explanation process: full procedural access, partial procedural access, and explanation-only access, we show that detection is extremely limited in practice. Even with full procedural access, cherry-picked explanations can remain difficult to distinguish from non cherry-picked explanations, because the multiplicity of valid counterfactuals and flexibility in the explanation specification provide sufficient degrees of freedom to mask deliberate selection. Empirically, we demonstrate that this variability often exceeds the effect of cherry-picking on standard counterfactual quality metrics such as proximity, plausibility, and sparsity, making cherry-picked explanations statistically indistinguishable from baseline explanations. We argue that safeguards should therefore prioritise reproducibility, standardisation, and procedural constraints over post-hoc detection, and we provide recommendations for
algorithm developers, explanation providers, and auditors.
Read the full abstract ▾
All authors James Hinns, Sofie Goethals, Stephan Van der Veeken, Theodoros Evgeniou, David Martens
Machine Learning
Precision over Diversity: High-Precision Reward Generalizes to Robust Instruction Following
Yirong Zeng, Yufei Liu, Xiao Ding et al. (+9 more)
A central belief in scaling reinforcement learning with verifiable rewards for instruction following (IF) tasks is that, a diverse mixture of verifiable hard and unverifiable soft constraints is essential for generalizing to unseen instructions. In this work, we challenge this prevailing consensus through a systematic empirical investigation. Counter-intuitively, we find that models trained on hard-only constraints consistently outperform those trained on mixed
datasets. Extensive experiments reveal that reward precision, rather than constraint diversity, is the primary driver of effective
alignment. The LLM judge suffers from a low recall rate in detecting false response, which leads to severe reward hacking, thereby undermining the benefits of diversity. Furthermore, analysis of the
attention mechanism reveals that high-precision rewards develop a transferable meta-skill for IF. Motivated by these insights, we propose a simple yet effective data-centric refinement strategy that prioritizes reward precision. Evaluated on five
benchmarks, our approach outperforms competitive baselines by 13.4% in performance while achieving a 58% reduction in training time, maintaining strong generalization beyond instruction following. Our findings advocate for a paradigm shift: moving away from the indiscriminate pursuit of data diversity toward high-precision rewards.
Read the full abstract ▾
All authors Yirong Zeng, Yufei Liu, Xiao Ding, Yutai Hou, Yuxian Wang, Haonan Song, Wu Ning, Dandan Tu, Qixun Zhang, Bibo Cai, Yuxiang He, Ting Liu
Machine Learning
Cardinality augmented loss functions
Miguel O'Malley
Class imbalance is a common and pernicious issue for the training of neural networks. Often, an imbalanced majority class can dominate training to skew classifier performance towards the majority outcome. To address this problem we introduce cardinality augmented loss functions, derived from cardinality-like invariants in modern mathematics literature such as magnitude and the spread. These invariants enrich the concept of cardinality by evaluating the `effective diversity' of a metric space, and as such represent a natural solution to overly homogeneous training data. In this work, we establish a methodology for applying cardinality augmented loss functions in the training of neural networks and report results on both artificially imbalanced
datasets as well as a real-world imbalanced material science
dataset. We observe significant performance improvement among minority classes, as well as improvement in overall performance metrics.
Read the full abstract ▾
Machine Learning
Distributed Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower bounds
Sifan Yang, Wenhao Yang, Wei Jiang et al. (+1 more)
We investigate distributed online convex optimization with compressed communication, where $n$ learners connected by a network collaboratively minimize a sequence of global loss functions using only local information and compressed data from neighbors. Prior work has established regret bounds of $O(\max\{\omega^{-2}\rho^{-4}n^{1/2},\omega^{-4}\rho^{-8}\}n\sqrt{T})$ and $O(\max\{\omega^{-2}\rho^{-4}n^{1/2},\omega^{-4}\rho^{-8}\}n\ln{T})$ for convex and strongly convex functions, respectively, where $\omega\in(0,1]$ is the compression quality factor ($\omega=1$ means no compression) and $\rho<1$ is the spectral gap of the communication
matrix. However, these regret bounds suffer from a quadratic or even quartic dependence on $\omega^{-1}$. Moreover, the super-linear dependence on $n$ is also undesirable. To overcome these limitations, we propose a novel
algorithm that achieves improved regret bounds of $\tilde{O}(\omega^{-1/2}\rho^{-1}n\sqrt{T})$ and $\tilde{O}(\omega^{-1}\rho^{-2}n\ln{T})$ for convex and strongly convex functions, respectively. The primary idea is to design a two-level blocking update framework incorporating two novel ingredients: an online gossip strategy and an error compensation scheme, which collaborate to achieve a better consensus among learners. Furthermore, we establish the first lower bounds for this problem, justifying the optimality of our results with respect to both $\omega$ and $T$. Additionally, we consider the bandit feedback scenario, and extend our method with the classic gradient
estimators to enhance existing regret bounds.
Read the full abstract ▾
All authors Sifan Yang, Wenhao Yang, Wei Jiang, Lijun Zhang
Machine Learning · Cross-listed from cs.CV
Rotation-Robust Regression with Convolutional Model Trees
Hongyi Li, William Ward Armstrong and Jun Xu
We study rotation-robust learning for image inputs using Convolutional Model Trees (CMTs) [1], whose split and leaf coefficients can be structured on the image grid and transformed geometrically at deployment time. In a controlled MNIST setting with a rotation-invariant regression target, we introduce three geometry-aware inductive biases for split directions – convolutional smoothing, a tilt dominance constraint, and importance-based
pruning – and quantify their impact on robustness under in-plane rotations. We further evaluate a deployment-time orientation search that selects a discrete rotation maximizing a forest-level confidence proxy without updating model parameters. Orientation search improves robustness under severe rotations but can be harmful near the canonical orientation when confidence is misaligned with correctness. Finally, we observe consistent trends on MNIST digit recognition implemented as one-vs-rest regression, highlighting both the promise and limitations of confidence-based orientation selection for model-tree ensembles.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
V-FAT: Benchmarking Visual Fidelity Against Text-bias
Ziteng Wang, Yujie He, Guanliang Li et al. (+3 more)
Recent advancements in
Multimodal Large
Language Models (MLLMs) have demonstrated impressive performance on standard visual
reasoning benchmarks. However, there is growing concern that these models rely excessively on linguistic shortcuts rather than genuine visual grounding, a phenomenon we term Text Bias. In this paper, we investigate the fundamental tension between visual perception and linguistic priors. We decouple the sources of this bias into two dimensions: Internal Corpus Bias, stemming from statistical correlations in pretraining, and External Instruction Bias, arising from the
alignment-induced tendency toward sycophancy. To quantify this effect, we introduce V-FAT (Visual Fidelity Against Text-bias), a diagnostic
benchmark comprising 4,026 VQA instances across six semantic domains. V-FAT employs a Three-Level Evaluation Framework that systematically increases the conflict between visual evidence and textual information: (L1) internal bias from atypical images, (L2) external bias from misleading instructions, and (L3) synergistic bias where both coincide. We introduce the Visual Robustness Score (VRS), a metric designed to penalize "lucky" linguistic guesses and reward true visual fidelity. Our evaluation of 12 frontier MLLMs reveals that while models excel in existing
benchmarks, they experience significant visual collapse under high linguistic dominance.
Read the full abstract ▾
All authors Ziteng Wang, Yujie He, Guanliang Li, Siqi Yang, Jiaqi Xiong, Songxiang Liu
Machine Learning · Cross-listed from cs.CV
Scaling Vision Language Models for Pharmaceutical Long Form Video Reasoning on Industrial GenAI Platform
Suyash Mishra, Qiang Li, Srikanth Patil et al. (+2 more)
Vision Language Models (VLMs) have shown strong performance on
multimodal reasoning tasks, yet most evaluations focus on short
videos and assume unconstrained computational resources. In industrial settings such as pharmaceutical content understanding, practitioners must process long-form
videos under strict GPU, latency, and cost constraints, where many existing approaches fail to scale. In this work, we present an industrial GenAI framework that processes over 200,000 PDFs, 25,326
videos across eight formats (e.g., MP4, M4V, etc.), and 888
multilingual audio files in more than 20
languages. Our study makes three contributions: (i) an industrial large-scale architecture for
multimodal reasoning in pharmaceutical domains; (ii) empirical analysis of over 40 VLMs on two leading
benchmarks (
Video-MME and MMBench) and proprietary
dataset of 25,326
videos across 14 disease areas; and (iii) four findings relevant to long-form
video reasoning: the role of multimodality,
attention mechanism trade-offs, temporal
reasoning limits, and challenges of
video splitting under GPU constraints. Results show 3-8 times efficiency gains with SDPA
attention on commodity GPUs, multimodality improving up to 8/12 task domains (especially length-dependent tasks), and clear bottlenecks in temporal
alignment and keyframe detection across open- and closed-source VLMs. Rather than proposing a new "A+B" model, this paper characterizes practical limits, trade-offs, and failure patterns of current VLMs under realistic deployment constraints, and provide actionable guidance for both researchers and practitioners designing scalable
multimodal systems for long-form
video understanding in industrial domains.
Read the full abstract ▾
All authors Suyash Mishra, Qiang Li, Srikanth Patil, Satyanarayan Pati, Baddu Narendra
Machine Learning
Learnable Multipliers: Freeing the Scale of Language Model Matrix Layers
Maksim Velikanov, Ilyas Chahed, Jingwei Zuo et al. (+3 more)
Applying weight decay (WD) to
matrix layers is standard practice in large-
language-model pretraining. Prior work suggests that
stochastic gradient noise induces a Brownian-like expansion of the weight
matrices W, whose growth is counteracted by WD, leading to a WD-noise
equilibrium with a certain weight norm ||W||. In this work, we view the
equilibrium norm as a harmful artifact of the training procedure, and address it by introducing learnable multipliers to learn the optimal scale. First, we attach a learnable scalar multiplier to W and confirm that the WD-noise
equilibrium norm is suboptimal: the learned scale adapts to data and improves performance. We then argue that individual row and column norms are similarly constrained, and free their scale by introducing learnable per-row and per-column multipliers. Our method can be viewed as a learnable, more expressive generalization of muP multipliers. It outperforms a well-tuned muP baseline, reduces the computational overhead of multiplier tuning, and surfaces practical questions such as forward-pass
symmetries and the width-scaling of the learned multipliers. Finally, we validate learnable multipliers with both Adam and
Muon optimizers, where it shows improvement in downstream evaluations matching the improvement of the switching from Adam to
Muon.
Read the full abstract ▾
All authors Maksim Velikanov, Ilyas Chahed, Jingwei Zuo, Dhia Eddine Rhaiem, Younes Belkada, Hakim Hacid
Machine Learning · Cross-listed from cs.CL
CuMA: Aligning LLMs with Sparse Cultural Values via Demographic-Aware Mixture of Adapters
Ao Sun, Xiaoyu Wang, Zhe Tan et al. (+4 more)
As Large
Language Models (LLMs) serve a global audience,
alignment must transition from enforcing universal consensus to respecting cultural pluralism. We demonstrate that dense models, when forced to fit conflicting value distributions, suffer from Mean Collapse, converging to a generic average that fails to represent diverse groups. We attribute this to Cultural Sparsity, where gradient interference prevents dense parameters from spanning distinct cultural modes. To resolve this, we propose \textbf{CuMA} (Cultural Mixture of Adapters), a framework that frames
alignment as a conditional capacity separation problem. By incorporating demographic-aware routing, CuMA internalizes a Latent Cultural
Topology to explicitly disentangle conflicting gradients into specialized expert subspaces. Extensive evaluations on WorldValuesBench, Community
Alignment, and PRISM demonstrate that CuMA achieves state-of-the-art performance, significantly outperforming both dense baselines and semantic-only MoEs. Crucially, our analysis confirms that CuMA effectively mitigates mean collapse, preserving cultural diversity. Our code is available at https://github.com/Throll/CuMA.
Read the full abstract ▾
All authors Ao Sun, Xiaoyu Wang, Zhe Tan, Yu Li, Jiachen Zhu, Yuheng Jia, Shu Su
Machine Learning · Cross-listed from cs.AI
Higher-Order Knowledge Representations for Agentic Scientific Reasoning
Isabella A. Stewart and Markus J. Buehler
Scientific inquiry requires systems-level
reasoning that integrates heterogeneous experimental data, cross-domain knowledge, and mechanistic evidence into coherent explanations. While Large
Language Models (LLMs) offer inferential capabilities, they often depend on
retrieval-augmented contexts that lack structural depth. Traditional Knowledge Graphs (KGs) attempt to bridge this gap, yet their pairwise constraints fail to capture the irreducible higher-order interactions that govern emergent physical behavior. To address this, we introduce a methodology for constructing hypergraph-based knowledge representations that faithfully encode multi-entity relationships. Applied to a corpus of ~1,100 manuscripts on biocomposite scaffolds, our framework constructs a global hypergraph of 161,172 nodes and 320,201 hyperedges, revealing a scale-free
topology (power law exponent ~1.23) organized around highly connected conceptual hubs. This representation prevents the combinatorial explosion typical of pairwise expansions and explicitly preserves the co-occurrence context of scientific formulations. We further demonstrate that equipping agentic systems with hypergraph traversal tools, specifically using node-intersection constraints, enables them to bridge semantically distant concepts. By exploiting these higher-order pathways, the system successfully generates grounded mechanistic hypotheses for novel composite materials, such as linking cerium
oxide to PCL scaffolds via chitosan intermediates. This work establishes a "teacherless" agentic
reasoning system where hypergraph
topology acts as a verifiable guardrail, accelerating scientific discovery by uncovering relationships obscured by traditional graph methods.
Read the full abstract ▾
Machine Learning
FibreCastML: An Open Web Platform for Predicting Electrospun Nanofibre Diameter Distributions
Elisa Roldan, Kirstie Andrews, Stephen M. Richardson et al. (+5 more)
Electrospinning is a scalable technique for producing fibrous scaffolds with tunable micro- and nanoscale architectures for applications in tissue engineering, drug delivery, and wound care. While machine learning (ML) has been used to support electrospinning process optimisation, most existing approaches predict only mean fibre diameters, neglecting the full diameter distribution that governs scaffold performance. This work presents FibreCastML, an open, distribution-aware ML framework that predicts complete fibre diameter spectra from routinely reported electrospinning parameters and provides interpretable insights into process structure relationships. A meta-
dataset comprising 68538 individual fibre diameter measurements extracted from 1778 studies across 16 biomedical
polymers was curated. Six standard processing parameters, namely solution concentration, applied voltage, flow rate, tip to collector distance, needle diameter, and collector rotation speed, were used to train seven ML models using nested cross validation with leave one study out external folds. Model interpretability was achieved using variable importance analysis, SHapley Additive exPlanations, correlation
matrices, and three dimensional parameter maps. Non linear models consistently outperformed linear baselines, achieving coefficients of determination above 0.91 for several widely used
polymers. Solution concentration emerged as the dominant global driver of fibre diameter distributions. Experimental validation across different electrospinning systems demonstrated close agreement between predicted and measured distributions. FibreCastML enables more reproducible and data driven optimisation of electrospun scaffold architectures.
Read the full abstract ▾
All authors Elisa Roldan, Kirstie Andrews, Stephen M. Richardson, Reyhaneh Fatahian, Glen Cooper, Rasool Erfani, Tasneem Sabir, Neil D. Reeves
Machine Learning · Cross-listed from eess.AS
Gradient-based Optimisation of Modulation Effects
Alistair Carson, Alec Wright and Stefan Bilbao
Modulation effects such as phasers, flangers and chorus effects are heavily used in conjunction with the electric guitar. Machine learning based emulation of analog modulation units has been investigated in recent years, but most methods have either been limited to one class of effect or suffer from a high computational cost or latency compared to canonical digital implementations. Here, we build on previous work and present a framework for modelling flanger, chorus and phaser effects based on differentiable digital signal processing. The model is trained in the time-frequency domain, but at inference operates in the time-domain, requiring zero latency. We investigate the challenges associated with gradient-based optimisation of such effects, and show that low-frequency weighting of loss functions avoids convergence to local minima when learning delay times. We show that when trained against analog effects units, sound output from the model is in some cases perceptually indistinguishable from the reference, but challenges still remain for effects with long delay times and feedback.
Read the full abstract ▾
Machine Learning
Rethinking GNNs and Missing Features: Challenges, Evaluation and a Robust Solution
Francesco Ferrini, Veronica Lachi, Antonio Longa et al. (+5 more)
Handling missing node features is a key challenge for deploying Graph Neural Networks (GNNs) in real-world domains such as healthcare and sensor networks. Existing studies mostly address relatively benign scenarios, namely
benchmark datasets with (a) high-dimensional but sparse node features and (b) incomplete data generated under Missing Completely At Random (MCAR) mechanisms. For (a), we theoretically prove that high sparsity substantially limits the information loss caused by missingness, making all models appear robust and preventing a meaningful comparison of their performance. To overcome this limitation, we introduce one synthetic and three real-world
datasets with dense, semantically meaningful features. For (b), we move beyond MCAR and design evaluation protocols with more realistic missingness mechanisms. Moreover, we provide a theoretical background to state explicit assumptions on the missingness process and analyze their implications for different methods. Building on this analysis, we propose GNNmim, a simple yet effective baseline for node classification with incomplete feature data. Experiments show that GNNmim is competitive with respect to specialized architectures across diverse
datasets and missingness regimes.
Read the full abstract ▾
All authors Francesco Ferrini, Veronica Lachi, Antonio Longa, Bruno Lepri, Matono Akiyoshi, Andrea Passerini, Xin Liu, Manfred Jaeger
Machine Learning · Cross-listed from cs.CL
Projected Autoregression: Autoregressive Language Generation in Continuous State Space
Oshri Naparstek
Standard autoregressive
language models generate text by repeatedly selecting a discrete next
token, coupling prediction with irreversible commitment at every step. We show that
token selection is not the only viable autoregressive interface. Projected Autoregression replaces
token selection with continuous prediction in
embedding space followed by discrete projection at commitment time. The model predicts next-
token vectors via regression and contrastive objectives, while discrete
tokens arise only by nearest-neighbor projection. An optional mutable suffix (“
liquid tail”) enables iterative refinement before commitment, but the central change is more basic: next-step prediction is continuous, and discrete
tokens are produced only as a downstream interface. Projected Autoregression establishes a concrete alternative to
token-selection autoregression:
language generation can be organized around continuous-state prediction with delayed discrete commitment. Refinement remains local to a short causal suffix within a left-to-right causal process, rather than a sequence-wide denoising process. This separation has two consequences. First, it induces a distinct generation regime: even with immediate projection ($K{=}1$), continuous prediction yields text structure and dynamics that differ from tested
token-space AR baselines, including a compute-matched best-of-16 reranking baseline. Second, it exposes a continuous control surface inside autoregressive generation: direction rate, history noise, delayed commitment, state-space guidance, and
embedding geometry act directly on the evolving generative state before
token commitment. Taken together, these results place repeated
token selection within a larger family of autoregressive interfaces and expose continuous state space as a broader algorithmic design space for
language generation.
Read the full abstract ▾
Machine Learning · Cross-listed from physics.optics
Illumination Angular Spectrum Encoding for Controlling the Functionality of Diffractive Networks
Matan Kleiner, Lior Michaeli and Tomer Michaeli
Diffractive neural networks have recently emerged as a promising framework for all-optical computing. However, these networks are typically trained for a single task, limiting their potential adoption in systems requiring multiple functionalities. Existing approaches to achieving multi-task functionality either modify the mechanical configuration of the network per task or use a different illumination wavelength or polarization state for each task. In this work, we propose a new control mechanism, which is based on the illumination's angular spectrum. Specifically, we shape the illumination using an amplitude mask that selectively controls its angular spectrum. We employ different illumination masks for achieving different network functionalities, so that the mask serves as a unique task encoder. Interestingly, we show that effective control can be achieved over a very narrow angular range, within the paraxial regime. We numerically illustrate the proposed approach by training a single diffractive network to perform multiple image-to-image translation tasks. In particular, we demonstrate translating handwritten digits into typeset digits of different values, and translating handwritten English letters into typeset numbers and typeset Greek letters, where the type of the output is determined by the illumination's angular components. As we show, the proposed framework can work under different coherence conditions, and can be combined with existing control strategies, such as different wavelengths. Our results establish the illumination angular spectrum as a powerful degree of freedom for controlling diffractive networks, enabling a scalable and versatile framework for multi-task all-optical computing.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.AP
Comparison of Maximum Likelihood Classification Before and After Applying Weierstrass Transform
Muhammad Shoaib, Zaka Ur Rehman and Muhammad Qasim
The aim of this paper is to use Maximum Likelihood (ML) Classification on multispectral data by means of qualitative and quantitative approaches. Maximum Likelihood is a supervised classification
algorithm which is based on the Classical Bayes
theorem. It makes use of a discriminant function to assign pixel to the class with the highest likelihood. Class means vector and covariance
matrix are the key inputs to the function and can be estimated from training pixels of a particular class. As Maximum Likelihood need some assumptions before it has to be applied on the data. In this paper we will compare the results of Maximum Likelihood Classification (ML) before apply the Weierstrass Transform and apply Weierstrass Transform and will see the difference between the accuracy on training pixels of high resolution Quickbird satellite image. Principle Component analysis (PCA) is also used for dimension reduction and also used to check the variation in bands. The results shows that the separation between mean of the classes in the decision space is to be the main factor that leads to the high classification accuracy of Maximum Likelihood (ML) after using Weierstrass Transform than without using it.
Read the full abstract ▾
Machine Learning
Parallelizing Node-Level Explainability in Graph Neural Networks
Oscar Llorente, Jaime Boal, Eugenio F. Sánchez-Úbeda et al. (+2 more)
Graph Neural Networks (GNNs) have demonstrated remarkable performance in a wide range of tasks, such as node classification, link prediction, and graph classification, by exploiting the structural information in graph-structured data. However, in node classification, computing node-level explainability becomes extremely time-consuming as the size of the graph increases, while batching strategies often degrade explanation quality. This paper introduces a novel approach to parallelizing node-level explainability in GNNs through graph partitioning. By decomposing the graph into disjoint subgraphs, we enable parallel computation of explainability for node neighbors, significantly improving the scalability and efficiency without affecting the correctness of the results, provided sufficient
memory is available. For scenarios where
memory is limited, we further propose a dropout-based reconstruction mechanism that offers a controllable trade-off between
memory usage and explanation fidelity. Experimental results on real-world
datasets demonstrate substantial speedups, enabling scalable and transparent explainability for large-scale GNN models.
Read the full abstract ▾
All authors Oscar Llorente, Jaime Boal, Eugenio F. Sánchez-Úbeda, Antonio Diaz-Cano, Miguel Familiar
Machine Learning · Cross-listed from cs.AR
MPM-LLM4DSE: Reaching the Pareto Frontier in HLS with Multimodal Learning and LLM-Driven Exploration
Lei Xu, Shanshan Wang and Chenglong Xiao
High-Level Synthesis (HLS) design space exploration (DSE) seeks Pareto-optimal designs within expansive pragma configuration spaces. To accelerate HLS DSE, graph neural networks (GNNs) are commonly employed as surrogates for HLS tools to predict quality of results (QoR) metrics, while multi-objective optimization
algorithms expedite the exploration. However, GNN-based prediction methods may not fully capture the rich semantic features inherent in behavioral descriptions, and conventional multi-objective optimization
algorithms often do not explicitly account for the domain-specific knowledge regarding how pragma directives influence QoR. To address these limitations, this paper proposes the MPM-LLM4DSE framework, which incorporates a
multimodal prediction model (MPM) that simultaneously fuses features from behavioral descriptions and control and data flow graphs. Furthermore, the framework employs a large
language model (LLM) as an optimizer, accompanied by a tailored
prompt engineering methodology. This methodology incorporates pragma impact analysis on QoR to guide the LLM in generating high-quality configurations (LLM4DSE). Experimental results demonstrate that our
multimodal predictive model significantly outperforms state-of-the-art work ProgSG by up to 10.25$\times$. Furthermore, in DSE tasks, the proposed LLM4DSE achieves an average performance gain of 39.90% over prior methods, validating the effectiveness of our prompting methodology. Code and models are available at https://github.com/wslcccc/MPM-LLM4DSE.
Read the full abstract ▾
Machine Learning
Neural-Symbolic Integration with Evolvable Policies
Marios Thoma, Vassilis Vassiliades and Loizos Michael
Neural-Symbolic (NeSy) Artificial Intelligence has emerged as a promising approach for combining the learning capabilities of neural networks with the interpretable
reasoning of symbolic systems. However, existing NeSy frameworks typically require either predefined symbolic policies or policies that are differentiable, limiting their applicability when domain expertise is unavailable or when policies are inherently non-differentiable. We propose a framework that addresses this limitation by enabling the concurrent learning of both non-differentiable symbolic policies and neural network weights through an evolutionary process. Our approach casts NeSy systems as organisms in a population that evolve through mutations (both symbolic rule additions and neural weight changes), with fitness-based selection guiding convergence toward hidden target policies. The framework extends the NEUROLOG architecture to make symbolic policies trainable, adapts Valiant's Evolvability framework to the NeSy context, and employs Machine Coaching semantics for mutable symbolic representations. Neural networks are trained through abductive
reasoning from the symbolic component, eliminating differentiability requirements. Through extensive experimentation, we demonstrate that NeSy systems starting with empty policies and random neural weights can successfully approximate hidden non-differentiable target policies, achieving median correct performance approaching 100%. This work represents a step toward enabling NeSy research in domains where the acquisition of symbolic knowledge from experts is challenging or infeasible.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Measurement-Consistent Langevin Corrector for Stabilizing Latent Diffusion Inverse Problem Solvers
Lee Hyoseok, Sohwi Lim, Eunju Cha et al. (+1 more)
While latent
diffusion models (LDMs) have emerged as powerful priors for inverse problems, existing LDM-based solvers frequently suffer from instability. In this work, we first identify the instability as a discrepancy between the solver dynamics and stable reverse
diffusion dynamics learned by the
diffusion model, and show that reducing this gap stabilizes the solver. Building on this, we introduce Measurement-Consistent Langevin Corrector (MCLC), a theoretically grounded plug-and-play stabilization module that remedies the LDM-based inverse problem solvers through measurement-consistent Langevin updates. Compared to prior approaches that rely on linear
manifold assumptions, which often fail to hold in latent space, MCLC provides a principled stabilization mechanism, leading to more stable and reliable behavior in latent space.
Read the full abstract ▾
All authors Lee Hyoseok, Sohwi Lim, Eunju Cha, Tae-Hyun Oh
Machine Learning
AgentOCR: Reimagining Agent History via Optical Self-Compression
Lang Feng, Fuchao Yang, Feng Chen et al. (+5 more)
Recent advances in large
language models (LLMs) enable agentic systems trained with reinforcement learning (RL) over multi-turn interaction, but practical deployment is bottlenecked by rapidly growing textual histories that inflate
token and
memory costs. We introduce AgentOCR, a framework that exploits visual
tokens' superior information density by representing the accumulated observation-action history as a compact rendered image. To make multi-turn rollouts scalable, AgentOCR proposes segment optical caching. By decomposing history into hashable segments and maintaining a visual cache, this mechanism eliminates redundant re-rendering. Beyond fixed rendering, AgentOCR introduces agentic self-compression, where the
agent actively emits a compression rate and is trained with compression-aware reward to adaptively balance task success and
token efficiency. We conduct extensive experiments on challenging agentic
benchmarks, ALFWorld and search-based QA. Remarkably, AgentOCR preserves over 95% of text-based
agent performance while substantially reducing
token consumption (>50%), yielding consistent
token and
memory efficiency. Further analysis validates a 20$\times$ rendering speedup from optical caching and effective self-compression balancing. Our code is available at https://github.com/langfengQ/AgentOCR.
Read the full abstract ▾
All authors Lang Feng, Fuchao Yang, Feng Chen, Xin Cheng, Haiyang Xu, Zhenglin Wan, Ming Yan, Bo An
Machine Learning · Cross-listed from cs.CL
Differential syntactic and semantic encoding in LLMs
Santiago Acevedo, Alessandro Laio and Marco Baroni
We study how syntactic and semantic information is encoded in inner layer representations of Large
Language Models (LLMs), focusing on the very large DeepSeek-V3. We find that, by averaging hidden-representation vectors of sentences sharing syntactic structure or meaning, we obtain vectors that capture a significant proportion of the syntactic and semantic information contained in the representations. In particular, subtracting these syntactic and semantic “centroids” from sentence vectors strongly affects their similarity with syntactically and semantically matched sentences, respectively, suggesting that syntax and semantics are, at least partially, linearly encoded. We also find that the cross-layer encoding profiles of syntax and semantics are different, and that the two signals can to some extent be decoupled, suggesting differential encoding of these two types of linguistic information in LLM representations.
Read the full abstract ▾
Machine Learning
Smart IoT-Based Wearable Device for Detection and Monitoring of Common Cow Diseases Using a Novel Machine Learning Technique
Rupsa Rani Mishra, D. Chandrasekhar Rao and Ajaya Kumar Tripathy
Manual observation and monitoring of individual cows for disease detection present significant challenges in large-scale farming operations, as the process is labor-intensive, time-consuming, and prone to reduced accuracy. The reliance on human observation often leads to delays in identifying symptoms, as the sheer number of animals can hinder timely
attention to each cow. Consequently, the accuracy and precision of disease detection are significantly compromised, potentially affecting animal health and overall farm productivity. Furthermore, organizing and managing human resources for the manual observation and monitoring of cow health is a complex and economically demanding task. It necessitates the involvement of skilled personnel, thereby contributing to elevated farm maintenance costs and operational inefficiencies. Therefore, the development of an automated, low-cost, and reliable smart system is essential to address these challenges effectively. Although several studies have been conducted in this domain, very few have simultaneously considered the detection of multiple common diseases with high prediction accuracy. However, advancements in Internet of Things (IoT), Machine Learning (ML), and Cyber-Physical Systems have enabled the automation of cow health monitoring with enhanced accuracy and reduced operational costs. This study proposes an IoT-enabled Cyber-Physical System framework designed to monitor the daily activities and health status of cow. A novel ML
algorithm is proposed for the diagnosis of common cow diseases using collected physiological and behavioral data. The
algorithm is designed to predict multiple diseases by analyzing a comprehensive set of recorded physiological and behavioral features, enabling accurate and efficient health assessment.
Read the full abstract ▾
Machine Learning
Intraday spatiotemporal PV power prediction at national scale using satellite-based solar forecast models
Luca Lanzilao and Angela Meyer
We present a novel framework for spatiotemporal photovoltaic (PV) power
forecasting and use it to evaluate the reliability, sharpness, and overall performance of seven intraday PV power nowcasting models. The model suite includes satellite-based deep learning and optical-flow approaches and physics-based numerical weather prediction models, covering both deterministic and probabilistic formulations. Forecasts are first validated against satellite-derived surface
solar irradiance (SSI). Irradiance fields are then converted into PV power using station-specific machine learning models, enabling comparison with production data from 6434 PV stations across Switzerland. To our knowledge, this is the first study to investigate spatiotemporal PV
forecasting at a national scale. We additionally provide the first visualizations of how mesoscale cloud systems shape national PV production on hourly and sub-hourly timescales. Our results show that satellite-based approaches outperform the Integrated Forecast System (IFS-ENS), particularly at short lead times. Among them, SolarSTEPS and SHADECast deliver the most accurate SSI and PV power predictions, with SHADECast providing the most reliable ensemble spread. The deterministic model IrradianceNet achieves the lowest root mean square error, while probabilistic forecasts of SolarSTEPS and SHADECast provide better-calibrated uncertainty. Forecast skill generally decreases with elevation. At a national scale, satellite-based models forecast the daily total PV generation with relative errors below 10% for 82% of the days in 2019-2020, demonstrating robustness and their potential for operational use.
Read the full abstract ▾
Machine Learning
Fast Mining and Dynamic Time-to-Event Prediction over Multi-sensor Data Streams
Kota Nakamura, Koki Kawabata, Yasuko Matsubara et al. (+1 more)
Given real-time sensor data streams obtained from machines, how can we continuously predict when a machine failure will occur? This work aims to continuously forecast the timing of future events by analyzing multi-sensor data streams. A key characteristic of real-world data streams is their dynamic nature, where the underlying patterns evolve over time. To address this, we present TimeCast, a dynamic prediction framework designed to adapt to these changes and provide accurate, real-time predictions of future event time. Our proposed method has the following properties: (a) Dynamic: it identifies the distinct time-evolving patterns (i.e., stages) and learns individual models for each, enabling us to make adaptive predictions based on pattern shifts. (b) Practical: it finds meaningful stages that capture time-varying interdependencies between multiple sensors and improve prediction performance; (c) Scalable: our
algorithm scales linearly with the input size and enables online model updates on data streams. Extensive experiments on real
datasets demonstrate that TimeCast provides higher prediction accuracy than state-of-the-art methods while finding dynamic changes in data streams with a great reduction in computational time.
Read the full abstract ▾
All authors Kota Nakamura, Koki Kawabata, Yasuko Matsubara, Yasushi Sakurai
Machine Learning · Cross-listed from quant-ph
The Role of Quantum in Hybrid Quantum-Classical Neural Networks: An Empirical Assessment
Dominik Freinberger and Philipp Moser
Quantum machine learning has emerged as a promising application domain for near-term
quantum hardware, particularly through hybrid
quantum-classical models that leverage both classical and
quantum processing. Although numerous hybrid architectures have been proposed and demonstrated successfully on
benchmark tasks, a significant open question remains regarding the specific contribution of
quantum components to the overall performance of these models. In this work, we aim to shed light on the impact of
quantum processing within hybrid
quantum-classical neural network architectures through a rigorous statistical study under ideal, noise-free simulation. We systematically assess a selection of commonly used HQNN architectures on three binary medical classification tasks covering medical signal data as well as planar and volumetric images. In doing so, we examine the influence attributable to classical and
quantum aspects such as encoding schemes,
entanglement, and
circuit size. Within this experimental setting, we find that in best-case scenarios, hybrid models show performance comparable to their classical counterparts. However, in most cases, performance metrics deteriorate when the investigated QNN components replace matched classical processing layers. Our multi-modal analysis provides empirical insights into the contributions of the tested
quantum components and advocates for cautious claims and design choices for hybrid models in near-term applications.
Read the full abstract ▾
Machine Learning
Excess Description Length of Learning Generalizable Predictors
Elizabeth Donoway, Hailey Joren, Fabien Roger et al. (+1 more)
Understanding whether fine-tuning elicits latent capabilities or teaches new ones is a fundamental question for
language model evaluation and safety. We develop a formal information-theoretic framework for quantifying how much predictive structure fine-tuning extracts from the train
dataset and writes into a model's parameters. Our central quantity, Excess Description Length (EDL), is defined via prequential coding and measures the gap between the bits required to encode training labels sequentially using an evolving model (trained online) and the residual encoding cost under the final trained model. We establish that EDL is non-negative in expectation, converges to surplus description length in the infinite-data limit, and provides bounds on expected generalization gain. Through a series of toy models, we clarify common confusions about information in learning: why random labels yield EDL near zero, how a single example can eliminate many bits of uncertainty about the underlying rule(s) that describe the data distribution, why structure learned on rare inputs contributes proportionally little to expected generalization, and how format learning creates early transients distinct from capability acquisition. This framework provides rigorous foundations for the empirical observation that capability elicitation and teaching exhibit qualitatively distinct scaling signatures.
Read the full abstract ▾
All authors Elizabeth Donoway, Hailey Joren, Fabien Roger, Jan Leike
Machine Learning
GPU-Accelerated INT8 Quantization for KV Cache Compression in Large Language Models
Maanas Taneja and Purab Shingvi
The key-value (KV) cache in large
language models presents a significant
memory bottleneck during inference, growing linearly with sequence length and often exceeding the
memory footprint of model weights themselves. We implement and evaluate GPU-accelerated INT8 quantization for KV cache compression, achieving 4$\times$
memory reduction with minimal accuracy degradation. We develop four CUDA kernel variants – naive, tiled, coarsened, and vectorized – and
benchmark them across realistic workload sizes up to 1 billion elements. Our vectorized kernel achieves up to 1,694$\times$ speedup over CPU baselines while maintaining reconstruction error below 0.004 and
attention score error below 0.1 even for 8K-dimensional heads. These results demonstrate that INT8 quantization provides a practical approach for reducing
memory pressure in LLM inference with negligible computational overhead (6–58ms) and minimal impact on downstream model behavior
Read the full abstract ▾