Machine Learning
Root Cause Analysis of Measurement and Mechanistic Anomalies
Hendrik Suhr, David Kaltenpoth and Jilles Vreeken
Root cause analysis of anomalies aims to identify how and why a sample deviates from the normal process. Existing methods primarily focus on telling which features are responsible, ignoring that anomalies can arise through two fundamentally different processes: measurement errors, where the sample is generated normally but one or more values is recorded incorrectly, and mechanism shifts, where the causal process that generated the sample was changed. While measurement errors can often be safely corrected, mechanistic anomalies require careful consideration. In this paper, we formally define a causal model that explicitly captures both types by treating outliers as latent interventions on latent ("true") and observed ("measured") variables and show under which conditions the distinction is possible. Based on this model, we develop an efficient inference procedure for localizing root causes and distinguishing anomaly types. Experiments on synthetic and real-world data show that our method provides state-of-the-art and highly robust performance in both root cause localization and classification of anomaly types.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.HC
Integrating Multi-Label Classification and Generative AI for Scalable Analysis of User Feedback
Sandra Loop, Erik Bertram, Sebastian Juhl et al. (+1 more)
In highly competitive software
markets, user experience (UX) evaluation is crucial for ensuring software quality and fostering long-term product success. Such UX evaluations typically combine quantitative metrics from standardized questionnaires with qualitative feedback collected through open-ended questions. While open-ended feedback offers valuable insights for improvement and helps explain quantitative results, analyzing large volumes of user comments is challenging and time-consuming. In this paper, we present techniques developed during a long-term UX measurement project at a major software company to efficiently process and interpret extensive volumes of user comments. To provide a high-level overview of the collected comments, we employ a supervised machine learning approach that assigns meaningful, pre-defined topic labels to each comment. Additionally, we demonstrate how generative AI (GenAI) can be leveraged to create concise and informative summaries of user feedback, facilitating effective communication of findings to the organization and especially upper management. Finally, we investigate whether the sentiment expressed in user comments can serve as an indicator for overall product satisfaction. Our results show that sentiment analysis alone does not reliably reflect user satisfaction. Instead, product satisfaction needs to be assessed explicitly in surveys to measure the user's perception of the product.
Read the full abstract ▾
All authors Sandra Loop, Erik Bertram, Sebastian Juhl, Martin Schrepp
Machine Learning
Mem-T: Densifying Rewards for Long-Horizon Memory Agents
Yanwei Yue, Boci Peng, Xuanbo Fan et al. (+3 more)
Memory agents, which depart from predefined
memory-processing pipelines by endogenously managing the processing, storage, and
retrieval of
memories, have garnered increasing
attention for their autonomy and adaptability. However, existing training paradigms remain constrained:
agents often traverse long-horizon sequences of
memory operations before receiving sparse and delayed rewards, which hinders truly end-to-end optimization of
memory management policies. To address this limitation, we introduce Mem-T, an autonomous
memory agent that interfaces with a lightweight hierarchical
memory database to perform dynamic updates and multi-turn
retrieval over streaming inputs. To effectively train long-horizon
memory management capabilities, we further propose MoT-GRPO, a tree-guided reinforcement learning framework that transforms sparse terminal feedback into dense, step-wise supervision via
memory operation tree backpropagation and hindsight credit assignment, thereby enabling the joint optimization of
memory construction and
retrieval. Extensive experiments demonstrate that Mem-T is (1) high-performing, surpassing frameworks such as A-Mem and Mem0 by up to $14.92\%$, and (2) economical, operating on a favorable accuracy-efficiency Pareto frontier and reducing inference
tokens per query by $\sim24.45\%$ relative to GAM without sacrificing performance.
Read the full abstract ▾
All authors Yanwei Yue, Boci Peng, Xuanbo Fan, Jiaxin Guo, Qiankun Li, Yan Zhang
Machine Learning
Leveraging Convolutional Sparse Autoencoders for Robust Movement Classification from Low-Density sEMG
Blagoj Hristov, Zoran Hadzi-Velkov, Katerina Hadzi-Velkova Saneva et al. (+2 more)
Reliable control of myoelectric prostheses is often hindered by high inter-subject variability and the clinical impracticality of high-density sensor arrays. This study proposes a deep learning framework for accurate gesture recognition using only two surface electromyography (sEMG) channels. The method employs a Convolutional Sparse Autoencoder (CSAE) to extract temporal feature representations directly from raw signals, eliminating the need for heuristic feature engineering. On a 6-class gesture set, our model achieved a multi-subject F1-score of 94.3% $\pm$ 0.3%. To address subject-specific differences, we present a few-shot transfer learning protocol that improved performance on unseen subjects from a baseline of 35.1% $\pm$ 3.1% to 92.3% $\pm$ 0.9% with minimal calibration data. Furthermore, the system supports functional extensibility through an incremental learning strategy, allowing for expansion to a 10-class set with a 90.0% $\pm$ 0.2% F1-score without full model retraining. By combining high precision with minimal computational and sensor overhead, this framework provides a scalable and efficient approach for the next generation of affordable and adaptive prosthetic systems.
Read the full abstract ▾
All authors Blagoj Hristov, Zoran Hadzi-Velkov, Katerina Hadzi-Velkova Saneva, Gorjan Nadzinski, Vesna Ojleska Latkoska
Machine Learning
Automatic Constraint Policy Optimization based on Continuous Constraint Interpolation Framework for Offline Reinforcement Learning
Xinchen Han, Qiuyang Fang, Hossam Afifi et al. (+1 more)
Offline Reinforcement Learning (RL) relies on policy constraints to mitigate extrapolation error, where both the constraint form and constraint strength critically shape performance. However, most existing methods commit to a single constraint family: weighted behavior cloning, density regularization, or support constraints, without a unified principle that explains their connections or trade-offs. In this work, we propose Continuous Constraint Interpolation (CCI), a unified optimization framework in which these three constraint families arise as special cases along a common constraint spectrum. The CCI framework introduces a single interpolation parameter that enables smooth transitions and principled combinations across constraint types. Building on CCI, we develop Automatic Constraint Policy Optimization (ACPO), a practical primal–dual
algorithm that adapts the interpolation parameter via a Lagrangian dual update. Moreover, we establish a maximum-
entropy performance difference lemma and derive performance lower bounds for both the closed-form optimal policy and its parametric projection. Experiments on D4RL and NeoRL2 demonstrate robust gains across diverse domains, achieving state-of-the-art performance overall.
Read the full abstract ▾
All authors Xinchen Han, Qiuyang Fang, Hossam Afifi, Michel Marot
Machine Learning
Mano: Restriking Manifold Optimization for LLM Training
Yufei Gu and Zeke Xie
While large
language models (LLMs) have emerged as a significant advancement in artificial intelligence, the hardware and computational costs for training LLMs are also significantly burdensome. Among the state-of-the-art optimizers, AdamW relies on diagonal
curvature estimates and ignores structural properties, while
Muon applies global spectral normalization at the expense of losing
curvature information. In this study, we restriked
manifold optimization methods for training LLMs, which may address both optimizers' limitations, while conventional
manifold optimization methods have been largely overlooked due to the poor performance in large-scale model optimization. By innovatively projecting the momentum onto the tangent space of model parameters and constraining it on a rotational Oblique
manifold, we propose a novel, powerful, and efficient optimizer **Mano** that is the first to bridge the performance gap between
manifold optimization and modern optimizers. Extensive experiments on the LLaMA and Qwen3 models demonstrate that Mano consistently and significantly outperforms AdamW and
Muon even with less
memory consumption and computational complexity, respectively, suggesting an expanded Pareto frontier in terms of space and time efficiency.
Read the full abstract ▾
Machine Learning
Cantelli Constrained Policy Optimization
Rohan Tangri and Jan-Peter Calliess
We introduce Canary, a risk-averse method designed to optimize Value-at-Risk (VaR) constrained reinforcement learning (RL) problems. We employ Cantelli's inequality to obtain a tractable, conservative and smooth bound on the VaR constraint based on the first two moments of the cost return. This yields a constraint
estimator that remains stable with tight violation thresholds in dense cost regimes. Extending the trust-region framework of the Constrained Policy Optimization (CPO) method, we further provide worst-case bounds for both policy improvement and constraint violation during the training process. Empirically during training, Canary is the only method that reliably satisfies the VaR constraint in every environment tested.
Read the full abstract ▾
Machine Learning
dgMARK: Decoding-Guided Watermarking for Diffusion Language Models
Pyo Min Hong and Albert No
We propose dgMARK, a decoding-guided watermarking method for discrete
diffusion language models (dLLMs). Unlike autoregressive models, dLLMs can generate
tokens in arbitrary order. While an ideal conditional predictor would be invariant to this order, practical dLLMs exhibit strong sensitivity to the unmasking order, creating a new channel for watermarking. dgMARK steers the unmasking order toward positions whose high-reward candidate
tokens satisfy a simple parity constraint induced by a binary hash, without explicitly reweighting the model's learned probabilities. The method is plug-and-play with common decoding strategies (e.g., confidence,
entropy, and margin-based ordering) and can be strengthened with a one-step lookahead variant. Watermarks are detected via elevated parity-matching statistics, and a sliding-window detector ensures robustness under post-editing operations including insertion, deletion, substitution, and paraphrasing. Project website: https://dgmark-watermarking.github.io
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CR
PIDSMaker: Building and Evaluating Provenance-based Intrusion Detection Systems
Tristan Bilot, Baoxiang Jiang and Thomas Pasquier
Recent provenance-based intrusion detection systems (PIDSs) have demonstrated strong potential for detecting advanced persistent threats (APTs) by applying machine learning to system provenance graphs. However, evaluating and comparing PIDSs remains difficult: prior work uses inconsistent preprocessing pipelines, non-standard
dataset splits, and incompatible ground-truth labeling and metrics. These discrepancies undermine reproducibility, impede fair comparison, and impose substantial re-implementation overhead on researchers. We present PIDSMaker, an open-source framework for developing and evaluating PIDSs under consistent protocols. PIDSMaker consolidates eight state-of-the-art systems into a modular, extensible architecture with standardized preprocessing and ground-truth labels, enabling consistent experiments and apples-to-apples comparisons. A YAML-based configuration interface supports rapid prototyping by composing components across systems without code changes. PIDSMaker also includes utilities for ablation studies, hyperparameter tuning, multi-run instability measurement, and visualization, addressing methodological gaps identified in prior work. We demonstrate PIDSMaker through concrete use cases and release it with preprocessed
datasets and labels to support shared evaluation for the PIDS community.
Read the full abstract ▾
Machine Learning
Learnable Permutation for Structured Sparsity on Transformer Models
Zekai Li, Ji Liu, Guanchen Li et al. (+5 more)
Structured sparsity has emerged as a popular model
pruning technique, widely adopted in various architectures, including CNNs,
Transformer models, and especially large
language models (LLMs) in recent years. A promising direction to further improve post-
pruning performance is weight permutation, which reorders model weights into patterns more amenable to
pruning. However, the exponential growth of the permutation search space with the scale of
Transformer architectures forces most methods to rely on greedy or heuristic
algorithms, limiting the effectiveness of reordering. In this work, we propose a novel end-to-end learnable permutation framework. Our method introduces a learnable permutation cost
matrix to quantify the cost of swapping any two input channels of a given weight
matrix, a differentiable bipartite matching solver to obtain the optimal binary permutation
matrix given a cost
matrix, and a sparsity optimization loss function to directly optimize the permutation operator. We extensively validate our approach on
vision and
language Transformers, demonstrating that our method achieves state-of-the-art permutation results for structured sparsity.
Read the full abstract ▾
All authors Zekai Li, Ji Liu, Guanchen Li, Yixing Xu, Ziqiong Liu, Xuanwu Yin, Dong Li, Emad Barsoum
Machine Learning
Stabilizing the Q-Gradient Field for Policy Smoothness in Actor-Critic Methods
Jeong Woon Lee, Kyoleen Kwak, Daeho Kim et al. (+1 more)
Policies learned via continuous actor-critic methods often exhibit erratic, high-frequency oscillations, making them unsuitable for physical deployment. Current approaches attempt to enforce smoothness by directly regularizing the policy's output. We argue that this approach treats the symptom rather than the cause. In this work, we theoretically establish that policy non-smoothness is fundamentally governed by the differential geometry of the critic. By applying implicit differentiation to the actor-critic objective, we prove that the sensitivity of the optimal policy is bounded by the ratio of the Q-function's mixed-partial derivative (noise sensitivity) to its action-space
curvature (signal distinctness). To empirically validate this theoretical insight, we introduce PAVE (Policy-Aware Value-field Equalization), a critic-centric regularization framework that treats the critic as a scalar field and stabilizes its induced action-gradient field. PAVE rectifies the learning signal by minimizing the Q-gradient
volatility while preserving local
curvature. Experimental results demonstrate that PAVE achieves smoothness comparable to policy-side smoothness regularization methods, while maintaining competitive task performance, without modifying the actor.
Read the full abstract ▾
All authors Jeong Woon Lee, Kyoleen Kwak, Daeho Kim, Hyoseok Hwang
Machine Learning
Improved Algorithms for Nash Welfare in Linear Bandits
Dhruv Sarkar, Nishant Pandey and Sayak Ray Chowdhury
Nash regret has recently emerged as a principled
fairness-aware performance metric for
stochastic multi-armed bandits, motivated by the Nash Social Welfare objective. Although this notion has been extended to linear bandits, existing results suffer from suboptimality in ambient dimension $d$, stemming from proof techniques that rely on restrictive concentration inequalities. In this work, we resolve this open problem by introducing new analytical tools that yield an order-optimal Nash regret bound in linear bandits. Beyond Nash regret, we initiate the study of $p$-means regret in linear bandits, a unifying framework that interpolates between
fairness and utility objectives and strictly generalizes Nash regret. We propose a generic algorithmic framework, FairLinBandit, that works as a meta-
algorithm on top of any linear bandit strategy. We instantiate this framework using two bandit
algorithms: Phased Elimination and Upper Confidence Bound, and prove that both achieve sublinear $p$-means regret for the entire range of $p$. Extensive experiments on linear bandit instances generated from real-world
datasets demonstrate that our methods consistently outperform the existing state-of-the-art baseline.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
OneFlowSBI: One Model, Many Queries for Simulation-Based Inference
Mayank Nautiyal, Li Ju, Melker Ernfors et al. (+5 more)
Simulation-based inference (SBI) methods typically amortize a single query, usually the posterior, so each further conditional or marginal needs its own model. Existing generalists amortize many queries in one
transformer with one
token per variable, so their
attention cost grows quadratically with the number of variables. We introduce OneFlowSBI, a masked flow matching framework that trains one network on the joint distribution of parameters and observations. A ternary mask marks each coordinate as observed, generated or absent, so any conditional or marginal is sampled by changing the mask. The mask is an input, rather than a tokenization, so the backbone can follow the data's structure and scale to many variables. On high-dimensional image denoising and shallow water inference, OneFlowSBI achieves lower posterior error than the baselines, samples far faster than a
transformer-based generalist, and handles missing regions and partial observation windows without retraining. On most of the ten SBIBM tasks at the largest simulation budget, it matches or exceeds neural posterior estimation and is comparable to
transformer-based generalists, while also providing the likelihood and marginals.
Read the full abstract ▾
All authors Mayank Nautiyal, Li Ju, Melker Ernfors, Klara Hagland, Ville Holma, Maximilian Werkö Söderholm, Andreas Hellander, Prashant Singh
Machine Learning
Perplexity Cannot Always Tell Right from Wrong
Petar Veličković, Federico Barbero, Christos Perivolaropoulos et al. (+2 more)
Perplexity – a function measuring a model's overall level of "surprise" when encountering a particular output – has gained significant traction in recent years, both as a loss function and as a simple-to-compute metric of model quality. Prior studies have pointed out several limitations of perplexity, often from an empirical manner. Here we leverage recent results on
Transformer continuity to show in a rigorous manner how perplexity may be an unsuitable metric for model selection. Specifically, we prove that, if there is any sequence that a compact decoder-only
Transformer model predicts accurately and confidently – a necessary pre-requisite for strong generalisation – it must imply existence of another sequence with very low perplexity, but not predicted correctly by that same model. Further, by analytically studying iso-perplexity plots, we find that perplexity will not always select for the more accurate model – rather, any increase in model confidence must be accompanied by a commensurate rise in accuracy for the new model to be selected.
Read the full abstract ▾
All authors Petar Veličković, Federico Barbero, Christos Perivolaropoulos, Simon Osindero, Razvan Pascanu
Machine Learning · Cross-listed from cs.CL
Reconsidering Positional Supervision in Masked Diffusion Language Model Training
Mengyu Ye, Keito Kudo, Ryosuke Takahashi et al. (+1 more)
Masked
diffusion language models (MDLMs) generate text by unmasking
tokens in parallel and have recently emerged as alternatives to autoregressive
language models. They can be viewed as parallel decoders trained with a position-wise cross-
entropy (CE) loss, the same setup as non-autoregressive translation (NAT). In NAT, CE-trained parallel decoders have been argued to be sensitive to small positional shifts, since CE penalizes them harshly. We ask whether CE-trained MDLMs are similarly sensitive to such shifts under iterative decoding. To probe this, we apply a controlled intervention that introduces them during decoding. On LLaDA-8B-Instruct with Arena-Hard, displacing as little as 1% of generated
tokens by one position substantially reduces win rates against the unintervened model, showing that MDLMs are sensitive to such small shifts under iterative parallel decoding. Motivated by this, we adapt connectionist temporal classification (CTC), an
alignment-flexible objective known to mitigate it there, to MDLM supervised fine-tuning. By relaxing the strict position-wise match that CE imposes, CTC gives the loss room to absorb small positional shifts; concretely, we modified CTC objective to use a special <slack>
token that absorbs positional uncertainty between target
tokens and output positions, and a updated collapse map that preserves target surface forms. Across four open-ended generation
benchmarks, the resulting model consistently improves over both the original model and a matched cross-
entropy-trained baseline, with statistically significant gains on all four. These results identify training-side
alignment flexibility as a useful design dimension for MDLM SFT, complementary to the inference-time approaches explored in prior work.
Read the full abstract ▾
All authors Mengyu Ye, Keito Kudo, Ryosuke Takahashi, Jun Suzuki
Machine Learning · Cross-listed from cs.CR
From Data Leak to Secret Misses: The Impact of Data Leakage on Secret Detection Models
Farnaz Soltaniani and Mohammad Ghafari
Machine learning models are increasingly used for software security tasks. These models are commonly trained and evaluated on large Internet-derived
datasets, which often contain duplicated or highly similar samples. When such samples are split across training and test sets, data leakage may occur, allowing models to memorize patterns instead of learning to generalize. We investigate duplication in a widely used
benchmark dataset of hard coded secrets and show how data leakage can substantially inflate the reported performance of AI-based secret detectors, resulting in a misleading picture of their real-world effectiveness.
Read the full abstract ▾
Machine Learning
Environment-Conditioned Tail Reweighting for Invariant Learning under Mixed Shifts
Yuanchao Wang, Tianqi Zhong, Fengnan Li et al. (+1 more)
Out-of-distribution generalization becomes challenging when spurious correlations vary across environments while difficult or underrepresented samples remain insufficiently emphasized within them. Invariant learning and reweighting address complementary aspects of this mixed-shift problem, yet applying reweighting only to prediction leaves the invariance constraint evaluated on a different training risk. We introduce Environment-Conditioned Tail Reweighting (ECTR), which couples cross-environment TV invariance with within-environment
adversarial tail weighting through a shared weighted risk. Sample weights are normalized within each environment, and the resulting risk is used consistently for both predictive learning and the total-variation (TV) stationarity penalty, while an environment-wise KL term controls
adversarial concentration. Our analysis characterizes the stationarity-dependent weighting signal and its KL-regularized distributional interpretation, alongside conditional-risk and optimization properties under the stated assumptions. Controlled mixed-shift ablations consistently support the shared-risk coupling across three difficulty settings. Across synthetic and real-world
benchmarks, ECTR achieves favorable results under both observed- and inferred-environment settings, including improvements over TV-based parent methods and strong performance against additional invariant-learning baselines. Training-corruption experiments further show that ECTR assigns less excess weight to corrupted samples than the tested fixed-tail rules. Together, these results provide a unified theoretical and empirical account of environment-conditioned tail reweighting for invariant learning under mixed shifts.
Read the full abstract ▾
All authors Yuanchao Wang, Tianqi Zhong, Fengnan Li, Zhao-Rong Lai
Machine Learning
Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms
Xiang Wu, Rong-Hua Li, Xunkai Li et al. (+3 more)
Graph coarsening reduces the size of a graph while preserving certain properties. Most existing methods preserve either spectral or spatial characteristics. Recent research shows that
topology-preserving coarsening methods maintain GNN performance on coarsened graphs but suffer from exponential time complexity. To address these problems, we propose Scalable
Topology-Preserving Graph Coarsening (STPGC) by introducing the concepts of graph strong collapse and graph edge collapse extended from algebraic
topology. STPGC comprises three new
algorithms, GStrongCollapse, GEdgeCollapse, and NeighborhoodConing based on these two concepts, which eliminate dominated nodes and edges while rigorously preserving topological features. We further prove that STPGC preserves the GNN receptive field and develop approximate
algorithms to accelerate GNN training. Experiments on node classification with GNNs demonstrate the efficiency and effectiveness of STPGC.
Read the full abstract ▾
All authors Xiang Wu, Rong-Hua Li, Xunkai Li, Kangfei Zhao, Hongchao Qin, Guoren Wang
Machine Learning
DC-LA: Difference-of-Convex Langevin Algorithm
Hoang Phuc Hau Luu and Zhongjian Wang
We study a sampling problem whose target distribution is $\pi \propto \exp(-f-r)$ where the data fidelity term $f$ is Lipschitz smooth while the regularizer term $r=r_1-r_2$ is a non-smooth difference-of-convex (DC) function, i.e., $r_1,r_2$ are convex. By leveraging the DC structure of $r$, we can smooth out $r$ by applying Moreau envelopes to $r_1$ and $r_2$ separately. In line with DC programming, we then redistribute the concave part of the regularizer to the data fidelity and study its corresponding proximal Langevin
algorithm (termed DC-LA). We establish convergence of DC-LA to the target distribution $\pi$, up to discretization and smoothing errors, in the $q$-Wasserstein distance for all $q \in \mathbb{N}^*$, under the assumption that $V$ is distant dissipative. Our results improve previous work on non-log-concave sampling in terms of a more general framework and assumptions. Numerical experiments show that DC-LA produces accurate distributions in synthetic settings and provides qualitatively reasonable uncertainty quantification in a real-world Computed
Tomography application.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.RO
MTDrive: Multi-turn Interactive Reinforcement Learning for Autonomous Driving
Xidong Li, Mingyu Guo, Chenchao Xu et al. (+5 more)
Trajectory planning is a core task in autonomous driving, requiring the prediction of safe and comfortable paths across diverse scenarios. Integrating Multi-modal Large
Language Models (MLLMs) with Reinforcement Learning (RL) has shown promise in addressing "long-tail" scenarios. However, existing methods are constrained to single-turn
reasoning, limiting their ability to handle complex tasks requiring iterative refinement. To overcome this limitation, we present MTDrive, a multi-turn framework that enables MLLMs to iteratively refine trajectories based on environmental feedback. MTDrive introduces Multi-Turn Group Relative Policy Optimization (mtGRPO), which mitigates reward sparsity by computing relative advantages across turns. We further construct an interactive trajectory understanding
dataset from closed-loop simulation to support multi-turn training. Experiments on the NAVSIM
benchmark demonstrate superior performance compared to existing methods, validating the effectiveness of our multi-turn
reasoning paradigm. Additionally, we implement system-level optimizations to reduce data transfer overhead caused by high-resolution images and multi-turn sequences, achieving 2.5x training throughput. Our data, models, and code will be made available soon.
Read the full abstract ▾
All authors Xidong Li, Mingyu Guo, Chenchao Xu, Bailin Li, Wenjing Zhu, Yangang Zou, Rui Chen, Zehuan Wang
Machine Learning · Cross-listed from cs.CL
LLMs Explain't: A Post-Mortem on Semantic Interpretability in Transformer Models
Alhassan Abdelhalim, Janick Edinger, Sören Laue et al. (+1 more)
Large
Language Models (LLMs) are becoming increasingly popular in pervasive computing due to their versatility and strong performance. However, despite their ubiquitous use, the exact mechanisms underlying their outstanding performance remain unclear. Different methods for LLM explainability exist, and many are, as a method, not fully understood themselves. We started with the question of how linguistic abstraction emerges in LLMs, aiming to detect it across different LLM modules (
attention heads and input
embeddings). For this, we used methods well-established in the literature: (1) probing for
token-level relational structures, and (2) feature-mapping using
embeddings as carriers of human-interpretable properties. Both attempts failed for different methodological reasons:
Attention-based explanations collapsed once we tested the core assumption that later-layer representations still correspond to
tokens. Property-inference methods applied to
embeddings also failed because their high predictive scores were driven by methodological artifacts and
dataset structure rather than meaningful semantic knowledge. These failures matter because both techniques are widely treated as evidence for what LLMs supposedly understand, yet our results show such conclusions are unwarranted. These limitations are particularly relevant in pervasive and distributed computing settings where LLMs are deployed as system components and interpretability methods are relied upon for debugging, compression, and explaining models.
Read the full abstract ▾
All authors Alhassan Abdelhalim, Janick Edinger, Sören Laue, Michaela Regneri
Machine Learning · Cross-listed from cs.IR
BEAR: Towards Beam-Search-Aware Optimization for Recommendation with Large Language Models
Weiqin Yang, Bohao Wang, Zhenxiang Xu et al. (+5 more)
Recent years have seen a rapid surge in research leveraging Large
Language Models (LLMs) for recommendation. These methods typically employ supervised fine-tuning (SFT) to adapt LLMs to recommendation scenarios, and utilize beam search during inference to efficiently retrieve $B$ top-ranked recommended items. However, we identify a critical training-inference inconsistency: while SFT optimizes the overall probability of positive items, it does not guarantee that such items will be retrieved by beam search even if they possess high overall probabilities. Due to the greedy
pruning mechanism, beam search can prematurely discard a positive item once its prefix probability is insufficient. To address this inconsistency, we propose BEAR (Beam-SEarch-Aware Regularization), a novel fine-tuning objective that explicitly accounts for beam search behavior during training. Rather than directly simulating beam search for each instance during training, which is computationally prohibitive, BEAR enforces a relaxed necessary condition: each
token in a positive item must rank within the top-$B$ candidate
tokens at each decoding step. This objective effectively mitigates the risk of incorrect
pruning while incurring negligible computational overhead compared to standard SFT. Extensive experiments across four real-world
datasets demonstrate that BEAR significantly outperforms strong baselines. Code is available at https://github.com/Tiny-Snow/BEAR-SIGIR-2026 .
Read the full abstract ▾
All authors Weiqin Yang, Bohao Wang, Zhenxiang Xu, Jiawei Chen, Shengjia Zhang, Jingbang Chen, Canghong Jin, Can Wang
Machine Learning · Cross-listed from cs.CR
Evaluating Large Language Models for Security Bug Report Prediction
Farnaz Soltaniani, Shoaib Razzaq and Mohammad Ghafari
Early detection of security bug reports (SBRs) is critical for timely vulnerability mitigation. We present an evaluation of
prompt-based engineering and fine-tuning approaches for predicting SBRs using Large
Language Models (LLMs). Our findings reveal a distinct trade-off between the two approaches. Prompted proprietary models demonstrate the highest sensitivity to SBRs, achieving a G-measure of 77% and a recall of 74% on average across all the
datasets, albeit at the cost of a higher false-positive rate, resulting in an average precision of only 22%. Fine-tuned models, by contrast, exhibit the opposite behavior, attaining a lower overall G-measure of 51% but substantially higher precision of 75% at the cost of reduced recall of 36%. Though a one-time investment in building fine-tuned models is necessary, the inference on the largest
dataset is up to 50 times faster than that of proprietary models. These findings suggest that further investigations to harness the power of LLMs for SBR prediction are necessary.
Read the full abstract ▾
Machine Learning
FlexLoRA: Entropy-Guided Flexible Low-Rank Adaptation
Muqing Liu, Chongjie Si and Yuheng Jia
Large pre-trained models achieve remarkable success across diverse domains, yet fully fine-tuning incurs prohibitive computational and
memory costs. Parameter-efficient fine-tuning (PEFT) has thus become a mainstream paradigm. Among them, Low-Rank Adaptation (LoRA) introduces trainable low-rank
matrices and shows strong performance, nevertheless, its fixed-rank design limits flexibility. Dynamic rank allocation methods mitigate this issue by
pruning redundant directions; however, they often rely on heuristic, element-level metrics that globally sort rank directions without
matrix-wise distinction, and they lack mechanisms to expand capacity in layers requiring additional adaptation. To overcome these limitations, we propose FlexLoRA, an
entropy-guided flexible low-rank adaptation framework that (i) evaluates
matrix importance via spectral energy
entropy, (ii) supports rank
pruning and expansion under a global budget, and (iii) employs zero-impact initialization for newly added singular directions to ensure stability. By addressing granularity, flexibility, and stability limitations, FlexLoRA provides a more principled solution for PEFT. Extensive experiments show that FlexLoRA consistently outperforms state-of-the-art baselines across
benchmarks. Codes are available at https://github.com/Chongjie-Si/Subspace-Tuning.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
Hyperspherical Autoencoder for High-Fidelity Image Reconstruction and Generation
Hun Chang, Byunghee Cha and Jong Chul Ye
Recent studies have explored using pretrained
Vision Foundation Models (VFMs) such as DINO for generative autoencoders, showing strong generative performance. Unfortunately, existing approaches often suffer from limited reconstruction fidelity due to the loss of high-frequency details. In this work, we present the \em Hyperspherical Autoencoder (HAE), a framework that bridges semantic representation and pixel-level reconstruction. Our key insight is that while semantic information in contrastive representations is primarily directional, enforcing strict magnitude matching hinders the preservation of fine-grained details. To address this, we introduce a Directional Feature
Alignment objective that enforces semantic consistency while allowing flexible feature magnitudes for detail retention, alongside a Hierarchical Convolutional Patch
Embedding module to enhance local structure preservation. Furthermore, observing that SSL-based representations intrinsically lie on a hypersphere, we employ Riemannian Flow Matching to train a
Diffusion Transformer (DiT) directly on this spherical latent
manifold. Notably, our
manifold-aware DiT exhibits highly efficient convergence, achieving an exceptional gFID of 1.96 alongside a reconstruction rFID of 0.78 and a PSNR of 25.2 dB, validating the advantages of our
manifold-aware approach.
Read the full abstract ▾
Machine Learning
Uncertainty-Aware Extrapolation in Bayesian Oblique Trees
Viktor Andonovikj, Sašo Džeroski and Pavle Boškoski
Decision trees are widely used due to their interpretability and efficiency, but they struggle in regression tasks that require reliable extrapolation and well-calibrated uncertainty. Piecewise-constant leaf predictions are bounded by the training targets and often become overconfident under distribution shift. We propose a single-tree
Bayesian model that extends VSPYCT by equipping each leaf with a GP predictor.
Bayesian oblique splits provide uncertainty-aware partitioning of the input space, while GP leaves model local functional behaviour and enable principled extrapolation beyond the observed target range. We present an efficient inference and prediction scheme that combines posterior sampling of split parameters with \gls{gp} posterior predictions, and a gating mechanism that activates GP-based extrapolation when inputs fall outside the training support of a leaf. Experiments on
benchmark regression tasks show improvements in the predictive performance compared to standard variational oblique trees, and substantial performance gains in extrapolation scenarios.
Read the full abstract ▾
Machine Learning
Calibrated Multivariate Distributional Regression with Pre-Rank Regularization
Aya Laajil, Elnura Zhalieva, Naomi Desobry et al. (+1 more)
The goal of probabilistic prediction is to issue predictive distributions that are as informative as possible, subject to being calibrated. Despite substantial progress in the univariate setting, achieving multivariate calibration remains challenging. Recent work has introduced pre-rank functions, scalar projections of multivariate forecasts and observations, as flexible diagnostics for assessing specific aspects of multivariate calibration, but their use has largely been limited to post-hoc evaluation. We propose a regularization-based calibration method that enforces multivariate calibration during training of multivariate distributional regression models using pre-rank functions. We further introduce a novel PCA-based pre-rank that projects predictions onto principal directions of the predictive distribution. Through simulation studies and experiments on 18 real-world multi-output regression
datasets, we show that the proposed approach substantially improves multivariate pre-rank calibration without compromising predictive accuracy, and that the PCA pre-rank reveals dependence-structure misspecifications that are not detected by existing pre-ranks.
Read the full abstract ▾
All authors Aya Laajil, Elnura Zhalieva, Naomi Desobry, Souhaib Ben Taieb
Machine Learning
PlatoLTL: Scaling LTL-Guided Multi-Task RL
Jacques Cloete, Mathias Jackermeier, Ioannis Havoutis et al. (+1 more)
Linear temporal logic (LTL) has emerged as a powerful formalism for specifying structured, temporally extended tasks in multi-task reinforcement learning (RL). However, while existing approaches in LTL-guided multi-task RL demonstrate success in simple environments, they suffer from challenges in representation learning and exploration efficiency when applied to high-dimensional environments with parameterized specifications. We present PlatoLTL, which elevates state-of-the-art methods to address both challenges. We model atomic propositions as instances of atomic predicates and inject task parameters directly into the goal
embedding to enable efficient generalization. We also leverage simple priors on closeness to predicate satisfaction to enable and accelerate learning of complex tasks without biasing the optimal policy. We validate our approach on challenging environments including robotic manipulation and multi-drone
navigation.
Read the full abstract ▾
All authors Jacques Cloete, Mathias Jackermeier, Ioannis Havoutis, Alessandro Abate
Machine Learning · Cross-listed from cs.CL
DiffuSpeech: Silent Thought, Spoken Answer via Unified Speech-Text Diffusion
Yuxuan Lou, Ziming Wu, Yaochen Wang et al. (+6 more)
Current
speech language models generate responses directly without explicit
reasoning, leading to errors that cannot be corrected once audio is produced. We introduce “Silent Thought, Spoken Answer” – a paradigm where
speech LLMs generate internal text
reasoning alongside spoken responses, with thinking traces informing
speech quality. To realize this, we present \method{}, the first
diffusion-based
speech-text
language model supporting both understanding and generation, unifying discrete text and tokenized
speech under a single masked
diffusion framework. Unlike autoregressive approaches, \method{} jointly generates
reasoning traces and
speech tokens through iterative denoising, with modality-specific masking schedules. We also construct \dataset{}, the first
speech QA
dataset with paired text
reasoning traces, containing 26K samples totaling 319 hours. Experiments show \method{} achieves state-of-the-art
speech-to-
speech QA accuracy, outperforming the best baseline by up to 9 points, while attaining the best TTS quality among generative models (6.2% WER) and preserving
language understanding (66.2% MMLU). Ablations confirm that both the
diffusion architecture and thinking traces contribute to these gains.
Read the full abstract ▾
All authors Yuxuan Lou, Ziming Wu, Yaochen Wang, Yong Liu, Yingxuan Ren, Fuming Lai, Shaobing Lian, Jie Tang, Yang You
Machine Learning
MoVE: Mixture of Value Embeddings – A New Axis for Scaling Parametric Memory in Autoregressive Models
Yangyan Li
Autoregressive sequence modeling stands as the cornerstone of modern Generative AI, powering results across diverse modalities ranging from text generation to image generation. However, a fundamental limitation of this paradigm is the rigid structural coupling of model capacity to computational cost: expanding a model's parametric
memory – its repository of factual knowledge or visual patterns – traditionally requires deepening or widening the network, which incurs a proportional rise in active FLOPs. In this work, we introduce $\textbf{MoVE (Mixture of Value Embeddings)}$, a mechanism that breaks this coupling and establishes a new axis for scaling capacity. MoVE decouples
memory from compute by introducing a global bank of learnable value
embeddings shared across all
attention layers. For every step in the sequence, the model employs a differentiable soft gating mechanism to dynamically mix retrieved concepts from this bank into the standard value projection. This architecture allows parametric
memory to be scaled independently of network depth by simply increasing the number of
embedding slots. We validate MoVE through strictly controlled experiments on two representative applications of autoregressive modeling: Text Generation and Image Generation. In both domains, MoVE yields consistent performance improvements over standard and layer-wise
memory baselines, enabling the construction of "
memory-dense" models that achieve lower perplexity and higher fidelity than their dense counterparts at comparable compute budgets.
Read the full abstract ▾