Machine Learning
DIA-CLIP: a universal representation learning framework for zero-shot DIA proteomics
Yucheng Liao, Han Wen, Weinan E et al. (+1 more)
Data-independent acquisition mass spectrometry (DIA-MS) has established itself as a cornerstone of proteomic profiling and large-scale systems biology, offering unparalleled depth and reproducibility. Current DIA analysis frameworks, however, require semi-supervised training within each run for peptide-spectrum match (PSM) re-scoring. This approach is prone to overfitting and lacks generalizability across diverse species and experimental conditions. Here, we present DIA-CLIP, a pre-trained model shifting the DIA analysis paradigm from semi-supervised training to universal cross-modal representation learning. By integrating dual-encoder contrastive learning framework with encoder-decoder architecture, DIA-CLIP establishes a unified cross-modal representation for peptides and corresponding spectral features, achieving high-precision, zero-shot PSM inference. Extensive evaluations across diverse
benchmarks demonstrate that DIA-CLIP consistently outperforms state-of-the-art tools, yielding up to a 45% increase in
protein identification while achieving a 12% reduction in entrapment identifications. Moreover, DIA-CLIP holds immense potential for diverse practical applications, such as single-
cell and spatial proteomics, where its enhanced identification depth facilitates the discovery of novel biomarkers and the elucidates of intricate cellular mechanisms.
Read the full abstract ▾
All authors Yucheng Liao, Han Wen, Weinan E, Weijie Zhang
Machine Learning
IRIS: Implicit Reward-Guided Internal Sifting for Mitigating Multimodal Hallucination
Yuanshuai Li, Yuping Yan, Jirui Han et al. (+3 more)
Hallucination remains a fundamental challenge for
Multimodal Large
Language Models (MLLMs). While Direct Preference Optimization (DPO) is a key
alignment framework, existing approaches often rely heavily on costly external evaluators for scoring or rewriting, incurring off-policy learnability gaps and discretization loss. Due to the lack of access to internal states, such feedback overlooks the fine-grained conflicts between different modalities that lead to
hallucinations during generation. To address this issue, we propose IRIS (Implicit Reward-Guided Internal Sifting), which leverages continuous implicit rewards in the native log-probability space to preserve full information density and capture internal modal competition. This on-policy paradigm eliminates learnability gaps by utilizing self-generated preference pairs. By sifting these pairs based on
multimodal implicit rewards, IRIS ensures that optimization is driven by signals that directly resolve modal conflicts. Extensive experiments demonstrate that IRIS achieves highly competitive performance on key
hallucination benchmarks using only 5.7k samples, without requiring any external feedback during preference
alignment. These results confirm that IRIS provides an efficient and principled paradigm for mitigating MLLM
hallucinations.
Read the full abstract ▾
All authors Yuanshuai Li, Yuping Yan, Jirui Han, Fei Ming, Lingjuan Lv, Yaochu Jin
Machine Learning
CoMeT: Collaborative Memory Transformer for Efficient Long Context Modeling
Runsong Zhao, Shilei Liu, Jiwei Tang et al. (+8 more)
The quadratic complexity and indefinitely growing key-value (KV) cache of standard
Transformers pose a major barrier to long-context processing. To overcome this, we introduce the Collaborative
Memory Transformer (CoMeT), a novel architecture that enables LLMs to handle arbitrarily long sequences with constant
memory usage and linear time complexity. Designed as an efficient, plug-in module, CoMeT can be integrated into pre-trained models with only minimal fine-tuning. It operates on sequential data chunks, using a dual-
memory system to manage context: a temporary
memory on a FIFO queue for recent events, and a global
memory with a gated update rule for long-range dependencies. These
memories then act as a dynamic soft
prompt for the next chunk. To enable efficient fine-tuning on extremely long contexts, we introduce a novel layer-level pipeline parallelism strategy. The effectiveness of our approach is remarkable: a model equipped with CoMeT and fine-tuned on 32k contexts can accurately retrieve a passkey from any position within a 1M
token sequence. On the SCROLLS
benchmark, CoMeT surpasses other efficient methods and achieves performance comparable to a full-
attention baseline on summarization tasks. Its practical effectiveness is further validated on real-world
agent and user behavior QA tasks. The code is available at: https://github.com/LivingFutureLab/Comet
Read the full abstract ▾
All authors Runsong Zhao, Shilei Liu, Jiwei Tang, Langming Liu, Haibin Chen, Weidong Zhang, Yujin Yuan, Tong Xiao, Jingbo Zhu, Wenbo Su, Bo Zheng
Machine Learning
A Provable Expressiveness Hierarchy in Hybrid Linear-Full Attention
Xiaowei Ye, Xiaoyu He, Chao Liao et al. (+2 more)
Transformers serve as the foundation of most modern large
language models. To mitigate the quadratic complexity of standard full
attention, various efficient
attention mechanisms, such as linear and hybrid
attention, have been developed. A fundamental gap remains: their expressive power relative to full
attention lacks a rigorous theoretical characterization. In this work, we theoretically characterize the performance differences among these
attention mechanisms. Our theory applies to all linear
attention variants that can be formulated as a recurrence, including Mamba, DeltaNet, etc. Specifically, we establish an expressiveness hierarchy: for the sequential function composition-a multi-step
reasoning task that must occur within a model's forward pass, an ($L+1$)-layer full
attention network is sufficient, whereas any hybrid network interleaving $L-1$ layers of full
attention with a substantially larger number ($2^{3L^2}$) of linear
attention layers cannot solve it. This result demonstrates a clear separation in expressive power between the two types of
attention. Our work provides the first provable separation between hybrid
attention and standard full
attention, offering a theoretical perspective for understanding the fundamental capabilities and limitations of different
attention mechanisms.
Read the full abstract ▾
All authors Xiaowei Ye, Xiaoyu He, Chao Liao, Chen Wu, Pinyan Lu
Machine Learning · Cross-listed from cs.AI
PRISM: Parametrically Refactoring Inference for Speculative Sampling Draft Models
Xuliang Wang, Yuetao Chen, Maochan Zhen et al. (+5 more)
Large
Language Models (LLMs), constrained by their auto-regressive nature, suffer from slow decoding. Speculative decoding methods have emerged as a promising solution to accelerate LLM decoding, attracting
attention from both systems and AI research communities. Recently, the pursuit of better draft quality has driven a trend toward parametrically larger draft models, which inevitably introduces substantial computational overhead. While existing work attempts to balance the trade-off between prediction accuracy and compute latency, we address this fundamental dilemma through architectural innovation. We propose PRISM, which disaggregates the computation of each predictive step across different parameter sets, refactoring the computational pathways of draft models to successfully decouple model capacity from inference cost. Through extensive experiments, we demonstrate that PRISM outperforms all existing draft architectures, achieving exceptional acceptance lengths while maintaining minimal draft latency for superior end-to-end speedup. We also re-examine scaling laws with PRISM, revealing that PRISM scales more effectively with expanding data volumes than other draft architectures. Through rigorous and fair comparison, we show that PRISM boosts the decoding throughput of an already highly optimized inference engine by more than 2.6x.
Read the full abstract ▾
All authors Xuliang Wang, Yuetao Chen, Maochan Zhen, Fang Liu, Xinzhou Zheng, Xingwu Liu, Hong Xu, Ming Li
Machine Learning · Cross-listed from cs.CL
Zero2Text: Zero-Training Cross-Domain Inversion Attacks on Textual Embeddings
Doohyun Kim, Donghwa Kang, Kyungjae Lee et al. (+2 more)
The proliferation of
retrieval-augmented generation (RAG) has established vector databases as critical infrastructure, yet they introduce severe
privacy risks via
embedding inversion attacks. Existing paradigms face a fundamental trade-off: optimization-based methods require computationally prohibitive queries, while
alignment-based approaches hinge on the unrealistic assumption of accessible in-domain training data. These constraints render them ineffective in strict black-box and cross-domain settings. To dismantle these barriers, we introduce Zero2Text, a novel training-free framework based on recursive online
alignment. Unlike methods relying on static
datasets, Zero2Text synergizes LLM priors with a dynamic ridge regression mechanism to iteratively align generation to the target
embedding on-the-fly. We further demonstrate that standard defenses, such as differential
privacy, fail to effectively mitigate this adaptive threat. Extensive experiments across diverse
benchmarks validate Zero2Text; notably, on MS MARCO against the OpenAI victim model, it achieves 1.8x higher ROUGE-L and 6.4x higher BLEU-2 scores compared to baselines, recovering sentences from unknown domains without a single leaked data pair.
Read the full abstract ▾
All authors Doohyun Kim, Donghwa Kang, Kyungjae Lee, Hyeongboo Baek, Brent Byunghoon Kang
Machine Learning
MGKAN: Predicting Asymmetric Drug-Drug Interactions via a Multimodal Graph Kolmogorov-Arnold Network
Kunyi Fan, Mengjie Chen, Longlong Li et al. (+1 more)
Predicting drug-drug interactions (DDIs) is essential for safe pharmacological treatments. Previous graph neural network (GNN) models leverage molecular structures and interaction networks but mostly rely on linear aggregation and symmetric assumptions, limiting their ability to capture nonlinear and heterogeneous patterns. We propose MGKAN, a Graph Kolmogorov-Arnold Network that introduces learnable basis functions into asymmetric DDI prediction. MGKAN replaces conventional MLP transformations with KAN-driven basis functions, enabling more expressive and nonlinear modeling of drug relationships. To capture pharmacological dependencies, MGKAN integrates three network views-an asymmetric DDI network, a co-interaction network, and a biochemical similarity network-with role-specific
embeddings to preserve directional semantics. A fusion module combines linear
attention and nonlinear transformation to enhance representational capacity. On two
benchmark datasets, MGKAN outperforms seven state-of-the-art baselines. Ablation studies and case studies confirm its predictive accuracy and effectiveness in modeling directional drug effects.
Read the full abstract ▾
All authors Kunyi Fan, Mengjie Chen, Longlong Li, Cunquan Qu
Machine Learning · Cross-listed from cs.AI
Adversarial Reward Auditing for Active Detection and Mitigation of Reward Hacking
Mohammad Beigi, Ming Jin, Junshan Zhang et al. (+2 more)
Reinforcement Learning from Human Feedback (RLHF) remains vulnerable to reward hacking, where models exploit spurious correlations in learned reward models to achieve high scores while violating human intent. Existing mitigations rely on static defenses that cannot adapt to novel exploitation strategies. We propose
Adversarial Reward
Auditing (ARA), a framework that reconceptualizes reward hacking as a dynamic, competitive game. ARA operates in two stages: first, a Hacker policy discovers reward model vulnerabilities while an Auditor learns to detect exploitation from latent representations; second, Auditor-Guided RLHF (AG-RLHF) gates reward signals to penalize detected hacking, transforming reward hacking from an unobservable failure into a measurable, controllable signal. Experiments across three hacking scenarios demonstrate that ARA achieves the best
alignment-utility tradeoff among all baselines: reducing sycophancy to near-SFT levels while improving helpfulness, decreasing verbosity while achieving the highest ROUGE-L, and suppressing code gaming while improving Pass@1. Beyond single-domain evaluation, we show that reward hacking, detection, and mitigation all generalize across domains – a Hacker trained on code gaming exhibits increased sycophancy despite no reward for this behavior, and an Auditor trained on one domain effectively suppresses exploitation in others, enabling efficient multi-domain defense with a single model.
Read the full abstract ▾
All authors Mohammad Beigi, Ming Jin, Junshan Zhang, Qifan Wang, Lifu Huang
Machine Learning · Cross-listed from cs.AI
Controlling Exploration-Exploitation in GFlowNets via Markov Chain Perspectives
Lin Chen, Samuel Drapeau, Fanghao Shao et al. (+5 more)
Generative Flow Network (GFlowNet) objectives implicitly fix an equal mixing of forward and backward policies, potentially constraining the exploration-exploitation trade-off during training. By further exploring the link between GFlowNets and Markov chains, we establish an equivalence between GFlowNet objectives and Markov chain reversibility, thereby revealing the origin of such constraints, and provide a framework for adapting Markov chain properties to GFlowNets. Building on these theoretical findings, we propose $\alpha$-GFNs, which generalize the mixing via a tunable parameter $\alpha$. This generalization enables direct control over exploration-exploitation dynamics to enhance mode discovery capabilities, while ensuring convergence to unique flows. Across various
benchmarks, including Set, Bit Sequence, and Molecule Generation, $\alpha$-GFN objectives consistently outperform previous GFlowNet objectives, achieving up to a $10 \times$ increase in the number of discovered modes.
Read the full abstract ▾
All authors Lin Chen, Samuel Drapeau, Fanghao Shao, Xuekai Zhu, Bo Xue, Yunchong Song, Mathieu Laurière, Zhouhan Lin
Machine Learning · Cross-listed from cs.CL
Enhancing Automated Essay Scoring With Three Techniques: Two-Stage Fine-Tuning, Score Alignment, and Self-Training
Hongseok Choi, Serynn Kim, Wencke Liermann et al. (+2 more)
Automated Essay Scoring (AES) plays a crucial role in education by providing scalable and efficient assessment tools. However, in real-world settings, the extreme scarcity of labeled data severely limits the development and practical adoption of robust AES systems. This study proposes a novel approach to enhance AES performance in both limited-data and full-data settings by introducing three key techniques. First, we introduce a Two-Stage fine-tuning strategy that leverages low-rank adaptations to better adapt an AES model to target
prompt essays. Second, we introduce a Score
Alignment technique to improve consistency between predicted and true score distributions. Third, we employ uncertainty-aware self-training using unlabeled data, effectively expanding the training set with pseudo-labeled samples while mitigating label noise propagation. We implement the above three key techniques on DualBERT. We conduct extensive experiments on the ASAP++
dataset, and additionally evaluate the proposed techniques on two other
datasets, TOEFL11 and ELLIPSE, to examine their generalizability. In the 32-data setting on ASAP++, all three key techniques improve performance, and their integration achieves 91.2% of the full-data performance trained on approximately 1,000 labeled samples. In addition, the proposed Score
Alignment technique consistently improves performance in both limited-data and full-data settings: e.g., it achieves state-of-the-art results in the full-data setting on ASAP++ when integrated into DualBERT.
Read the full abstract ▾
All authors Hongseok Choi, Serynn Kim, Wencke Liermann, Jin Seong, Jin-Xia Huang
Machine Learning
Rethinking LoRA for Data Heterogeneous Federated Learning: Subspace and State Alignment
Hongyi Peng, Han Yu, Xiaoxiao Li et al. (+1 more)
Low-Rank Adaptation (LoRA) is widely used for
federated fine-tuning. Yet under non-IID settings, it can substantially underperform full-parameter fine-tuning. Through with-high-probability robustness analysis, we uncover that this gap can be attributed to two coupled mismatches: (i) update-space mismatch, where clients optimize in a low-rank subspace but aggregation occurs in the full space; and (ii) optimizer-state mismatch, where unsynchronized adaptive states amplify drift across rounds. We propose FedGaLore, which combines client-side GaLore-style gradient-subspace optimization with server-side drift-robust synchronization of projected second-moment states via spectral shared-signal extraction, to address this challenge. Across NLU,
vision, and NLG
benchmarks, FedGaLore improves robustness and accuracy over state-of-the-art
federated LoRA baselines in non-IID settings.
Read the full abstract ▾
All authors Hongyi Peng, Han Yu, Xiaoxiao Li, Qiang Yang
Machine Learning
Probability-Entropy Calibration: An Elastic Indicator for Adaptive Fine-tuning
Wenhao Yu, Shaohang Wei, Jiahong Liu et al. (+5 more)
Token-level reweighting is a simple yet effective mechanism for controlling supervised fine-tuning, but common indicators are largely one-dimensional: the ground-truth probability reflects downstream
alignment, while
token entropy reflects intrinsic uncertainty induced by the pre-training prior. Ignoring
entropy can misidentify noisy or easily replaceable
tokens as learning-critical, while ignoring probability fails to reflect target-specific
alignment. RankTuner introduces a probability–
entropy calibration signal, the Relative Rank Indicator, which compares the rank of the ground-truth
token with its expected rank under the prediction distribution. The inverse indicator is used as a
token-wise Relative Scale to reweight the fine-tuning objective, focusing updates on truly under-learned
tokens without over-penalizing intrinsically uncertain positions. Experiments on multiple backbones show consistent improvements on mathematical
reasoning benchmarks, transfer gains on out-of-distribution
reasoning, and pre code generation performance over probability-only or
entropy-only reweighting baselines.
Read the full abstract ▾
All authors Wenhao Yu, Shaohang Wei, Jiahong Liu, Yifan Li, Minda Hu, Aiwei Liu, Hao Zhang, Irwin King
Machine Learning
Softmax Linear Attention: Reclaiming Global Competition
Mingwei Xu, Xuan Lin, Xinnan Guo et al. (+2 more)
While linear
attention reduces the quadratic complexity of standard
Transformers to linear time, it often lags behind in expressivity due to the removal of softmax normalization. This omission eliminates global competition, a critical mechanism that enables models to sharply focus on relevant information amidst long-context noise. In this work, we propose Softmax Linear
Attention (SLA), a framework designed to restore this competitive selection without sacrificing efficiency. By lifting the softmax operation from the
token level to the head level, SLA leverages
attention heads as coarse semantic slots, applying a competitive gating mechanism to dynamically select the most relevant subspaces. This reintroduces the “winner-take-all” dynamics essential for precise
retrieval and robust long-context understanding. Distinct from prior methods that focus on refining local kernel functions, SLA adopts a broader perspective by exploiting the higher-level multi-head aggregation structure. Extensive experiments demonstrate that SLA consistently enhances state-of-the-art linear baselines (RetNet, GLA, GDN) across
language modeling and long-context
benchmarks, particularly in challenging
retrieval scenarios where it significantly boosts robustness against noise, validating its capability to restore precise focus while maintaining linear complexity.
Read the full abstract ▾
All authors Mingwei Xu, Xuan Lin, Xinnan Guo, Wanqing Xu, Wanyun Cui
Machine Learning · Cross-listed from cs.AI
MACD: Model-Aware Contrastive Decoding via Counterfactual Data
Qixin Xiao and Kun Zhou
Video language models (
Video-LLMs) are prone to
hallucinations, generating plausible but ungrounded content when visual evidence is weak, ambiguous, or biased. Existing methods, such as contrastive decoding (CD), rely on random perturbations to construct contrastive data for
hallucination mitigation, but often fail to target the visual cues that drive
hallucination or align with model weaknesses. We propose Model-Aware Counterfactual Data based Contrastive Decoding (MACD), an inference strategy that combines model-guided counterfactual construction with contrastive decoding. MACD uses the
Video-LLM's own feedback to identify object regions most responsible for
hallucination, generating targeted object-level counterfactual inputs rather than arbitrary frame or temporal modifications. These counterfactual inputs are integrated into CD to enforce evidence-grounded
token selection during decoding. Experiments on EventHallusion, MVBench, Perception-test, and
Video-MME show that MACD consistently reduces
hallucination while maintaining or improving task accuracy across diverse
Video-LLMs, including Qwen and InternVL, with especially strong gains in scenarios involving small, occluded, or co-occurring objects.
Read the full abstract ▾
Machine Learning · Cross-listed from physics.flu-dyn
Physics-Informed Chebyshev Polynomial Neural Operator for Parametric Partial Differential Equations
Biao Chen, Jing Wang, Hairun Xie et al. (+4 more)
Neural operators have emerged as powerful deep learning frameworks for approximating solution operators of parameterized partial differential equations (PDE). However, current methods predominantly rely on multilayer perceptrons (MLPs) for mapping inputs to solutions, which impairs training robustness in physics-informed settings due to inherent spectral biases and fixed activation functions. To overcome the architectural limitations, we introduce the Physics-Informed Chebyshev
Polynomial Neural Operator (CPNO), a novel mesh-free framework that leverages a basis transformation to replace unstable monomial expansions with the numerically stable Chebyshev spectral basis. By integrating parameter dependent modulation mechanism to main net, CPNO constructs PDE solutions in a near-optimal functional space, decoupling the model from MLP-specific constraints and enhancing multi-scale representation. Theoretical analysis demonstrates the Chebyshev basis's near-minimax uniform approximation properties and superior conditioning, with Lebesgue constants growing logarithmically with degree, thereby mitigating spectral bias and ensuring stable gradient flow during optimization. Numerical experiments on
benchmark parameterized PDEs show that CPNO achieves superior accuracy, faster convergence, and enhanced robustness to hyperparameters. The experiment of transonic airfoil flow has demonstrated the capability of CPNO in characterizing complex
geometric problems.
Read the full abstract ▾
All authors Biao Chen, Jing Wang, Hairun Xie, Qineng Wang, Shuai Zhang, Yifan Xia, Jifa Zhang
Machine Learning
Position: The Inevitable End of One-Architecture-Fits-All-Domains in Time Series Forecasting
Qinwei Ma, Jingzhe Shi, Jiahao Qiu et al. (+1 more)
Recent work has questioned the effectiveness and robustness of neural network architectures for time series
forecasting tasks. We summarize these concerns and analyze groundly their inherent limitations: i.e. the irreconcilable conflict between single (or few similar) domains SOTA and generalizability over general domains for time series
forecasting neural network architecture designs. Moreover, neural networks architectures for general domain time series
forecasting are becoming more and more complicated and their performance has almost saturated in recent years. As a result, network architectures developed aiming at fitting general time series domains are almost not inspiring for real world practices for certain single (or few similar) domains such as Finance, Weather, Traffic, etc: each specific domain develops their own methods that rarely utilize advances in neural network architectures of time series community in recent 2-3 years. As a result, we call for the time series community to shift focus away from research on time series neural network architectures for general domains: these researches have become saturated and away from domain-specific SOTAs over time. We should either (1) focus on deep learning methods for certain specific domain(s), or (2) turn to the development of meta-learning methods for general domains.
Read the full abstract ▾
All authors Qinwei Ma, Jingzhe Shi, Jiahao Qiu, Zaiwen Yang
Machine Learning
MSign: An Optimizer Preventing Training Instability in Large Language Models via Stable Rank Restoration
Lianhai Ren, Yucheng Ding, Xiao Liu et al. (+2 more)
Training instability remains a critical challenge in large
language model (LLM) pretraining, often manifesting as sudden gradient explosions that waste significant computational resources. We study training failures in a 5M-parameter NanoGPT model scaled via $\mu$P, identifying two key phenomena preceding collapse: (1) rapid decline in weight
matrix stable rank (ratio of squared Frobenius norm to squared spectral norm), and (2) increasing
alignment between adjacent layer Jacobians. We prove theoretically that these two conditions jointly cause exponential gradient norm growth with network depth. To break this instability mechanism, we propose MSign, a new optimizer that periodically applies
matrix sign operations to restore stable rank. Experiments on models from 5M to 3B parameters demonstrate that MSign effectively prevents training failures with a computational overhead of less than 7.0%.
Read the full abstract ▾
All authors Lianhai Ren, Yucheng Ding, Xiao Liu, Peng Cheng, Yeyun Gong
Machine Learning · Cross-listed from stat.ML
Improving Backward Conformal Prediction via Non-Conformity Score Transformation
Junxian Liu, Hao Zeng and Hongxin Wei
Conformal Prediction (CP) provides a statistical framework for uncertainty quantification that constructs prediction sets with coverage guarantees. While CP yields uncontrolled prediction set sizes, Backward Conformal Prediction (BCP) inverts this paradigm by enforcing a predefined upper bound on set size and estimating the resulting coverage guarantee. However, the looseness induced by Markov's inequality within the BCP framework causes a significant gap between the estimated coverage bound and the empirical coverage. In this work, we introduce ST-BCP, a novel method that introduces a data-dependent transformation of nonconformity scores to narrow the coverage gap. In particular, we develop a computable transformation and prove that it outperforms the baseline identity transformation. Extensive experiments demonstrate the effectiveness of our method, reducing the average coverage gap from 4.20% to 1.12% on common
benchmarks.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.SI
Cross-Domain Fake News Detection on Unseen Domains via LLM-Based Domain-Aware User Modeling
Xuankai Yang, Yan Wang, Jiajie Zhu et al. (+4 more)
Cross-domain fake news detection (CD-FND) transfers knowledge from a source domain to a target domain and is crucial for real-world fake news mitigation. This task becomes particularly important yet more challenging when the target domain is previously unseen (e.g., the COVID-19 outbreak or the Russia-Ukraine war). However, existing CD-FND methods overlook such scenarios and consequently suffer from the following two key limitations: (1) insufficient modeling of high-level semantics in news and user engagements; and (2) scarcity of labeled data in unseen domains. Targeting these limitations, we find that large
language models (LLMs) offer strong potential for CD-FND on unseen domains, yet their effective use remains non-trivial. Nevertheless, two key challenges arise: (1) how to capture high-level semantics from both news content and user engagements using LLMs; and (2) how to make LLM-generated features more reliable and transferable for CD-FND on unseen domains. To tackle these challenges, we propose DAUD, a novel LLM-Based Domain-Aware framework for fake news detection on Unseen Domains. DAUD employs LLMs to extract high-level semantics from news content. It models users' single- and cross-domain engagements to generate domain-aware behavioral representations. In addition, DAUD captures the relations between original data-driven features and LLM-derived features of news, users, and user engagements. This allows it to extract more reliable domain-shared representations that improve knowledge transfer to unseen domains. Extensive experiments on real-world
datasets demonstrate that DAUD outperforms state-of-the-art baselines in both general and unseen-domain CD-FND settings.
Read the full abstract ▾
All authors Xuankai Yang, Yan Wang, Jiajie Zhu, Pengfei Ding, Hongyang Liu, Xiuzhen Zhang, Huan Liu
Machine Learning · Cross-listed from cs.CL
SafePred: A Predictive Guardrail for Computer-Using Agents via World Models
Yurun Chen, Zeyi Liao, Ping Yin et al. (+3 more)
With the widespread deployment of Computer-using
Agents (CUAs) in complex real-world environments, prevalent long-term risks often lead to severe and irreversible consequences. Most existing guardrails for CUAs adopt a reactive approach, constraining
agent behavior only within the current observation space. While these guardrails can prevent immediate short-term risks (e.g., clicking on a phishing link), they cannot proactively avoid long-term risks: seemingly reasonable actions can lead to high-risk consequences that emerge with a delay (e.g., cleaning logs leads to future audits being untraceable), which reactive guardrails cannot identify within the current observation space. To address these limitations, we propose a predictive guardrail approach, with the core idea of aligning predicted future risks with current decisions. Based on this approach, we present SafePred, a predictive guardrail framework for CUAs that establishes a risk-to-decision loop to ensure safe
agent behavior. SafePred supports two key abilities: (1) Short- and long-term risk prediction: by using safety policies as the basis for risk prediction, SafePred leverages the prediction capability of the world model to generate semantic representations of both short-term and long-term risks, thereby identifying and
pruning actions that lead to high-risk states; (2) Decision optimization: translating predicted risks into actionable safe decision guidances through step-level interventions and task-level re-planning. Extensive experiments show that SafePred significantly reduces high-risk behaviors, achieving over 97.6% safety performance and improving task utility by up to 21.4% compared with reactive baselines.
Read the full abstract ▾
All authors Yurun Chen, Zeyi Liao, Ping Yin, Taotao Xie, Keting Yin, Shengyu Zhang
Machine Learning
Generalization Measures under Controlled Covariate Shift: A Regime-Aware Benchmark
Sora Nakai, Youssef Fadhloun, Kacem Mathlouthi et al. (+4 more)
Predicting generalization from quantities available before target-test evaluation remains a central challenge in deep learning. The systematic
benchmark of Jiang et al. (2020) evaluated many generalization measures, but it focused on independent and identically distributed (IID) settings. We revisit this problem for image classifiers evaluated under controlled corruptions and perturbations. Our study uses CIFAR-10-C/P, where the label space and task remain fixed while the input images are degraded or perturbed. This setting also allows us to revisit the robustness concerns raised by Dziugaite et al. (2020), who showed that the apparent reliability of generalization measures can depend strongly on experimental conditions. Our experiments show that the usefulness of generalization measures is strongly regime-dependent. In our exploratory decision analysis across three CNN-style architectures, sharpness- and input-gradient-based measures are among the leading individual signals, whereas family results are close and architecture dependent. Optimization-based measures, Information Criteria, and Sharpness-based measures provide additional regime-dependent signals in correlation or local-reliability analyses. Together, these findings suggest that model selection should not rely only on measures favored by IID evaluation. Instead, within the evaluated CIFAR-10-C/P setting and architectures, generalization measures should be treated as regime-dependent ranking signals whose utility must be evaluated for the intended corruption or perturbation setting.
Read the full abstract ▾
All authors Sora Nakai, Youssef Fadhloun, Kacem Mathlouthi, Kotaro Yoshida, Ganesh Talluri, Ioannis Mitliagkas, Hiroki Naganuma
Machine Learning · Cross-listed from cs.AI
Optimizing Prompts for Large Language Models: A Causal Approach
Wei Chen, Yanbin Fang, Shuran Fu et al. (+2 more)
Large
Language Models (LLMs) are increasingly embedded in enterprise workflows, yet their performance remains highly sensitive to
prompt design. Automatic
Prompt Optimization (APO) seeks to mitigate this instability, but existing approaches face two persistent challenges. First, commonly used
prompt strategies rely on static instructions that perform well on average but fail to adapt to heterogeneous queries. Second, more dynamic approaches depend on offline reward models that are fundamentally correlational, confounding
prompt effectiveness with query characteristics. We propose Causal
Prompt Optimization (CPO), a framework that reframes
prompt design as a problem of causal estimation. CPO operates in two stages. First, it learns an offline causal reward model by applying Double Machine Learning (DML) to semantic
embeddings of
prompts and queries, isolating the causal effect of
prompt variations from confounding query attributes. Second, it utilizes this unbiased reward signal to guide a resource-efficient search for query-specific
prompts without relying on costly online evaluation. We evaluate CPO across
benchmarks in mathematical
reasoning, visualization, and data analytics. CPO consistently outperforms human-engineered
prompts and state-of-the-art automated optimizers. The gains are driven primarily by improved robustness on hard queries, where existing methods tend to deteriorate. Beyond performance, CPO fundamentally reshapes the economics of
prompt optimization: by shifting evaluation from real-time model execution to an offline causal model, it enables high-precision, per-query customization at a fraction of the inference cost required by online methods. Together, these results establish causal inference as a scalable foundation for reliable and cost-efficient
prompt optimization in enterprise LLM deployments.
Read the full abstract ▾
All authors Wei Chen, Yanbin Fang, Shuran Fu, Fasheng Xu, Xuan Wei
Machine Learning
LaDi-RL: Latent Diffusion Reasoning Prevents Entropy Collapse in Reinforcement Learning
Haoqiang Kang, Yizhe Zhang, Nikki Lijing Kuang et al. (+2 more)
Reinforcement learning has become a central paradigm for improving LLM
reasoning, but most existing methods optimize policies over discrete
token sequences. This creates a mismatch between the optimization space and the structure of
reasoning: many important decisions are semantic, global, and trajectory-level rather than local
token choices. Continuous latent-space RL offers a promising alternative by allowing policies to explore higher-level
reasoning representations. However, simply moving to latent space is not sufficient. The resulting policy must model a complex, multi-modal distribution over valid
reasoning trajectories. We therefore propose Latent
Diffusion Reasoning with Reinforcement Learning (LaDi-RL), where a
diffusion model generates latent
reasoning trajectories through iterative denoising. This formulation enables structured exploration and expressive distribution modeling, but also introduces a fundamental credit-assignment challenge: the policy acts in latent space, while rewards are observed only after the latent is decoded into text. A naive rollout strategy therefore entangles latent
reasoning quality with text decoding quality, making it unclear whether an incorrect answer results from a poor latent trajectory or from an imperfect textual realization. To address this, we introduce hierarchical latent-text rollouts. We sample multiple text completions for each latent trajectory and aggregate their rewards to obtain a decoder-marginalized estimate of latent utility. This provides a cleaner and lower-variance reward signal for optimizing the
diffusion policy. Empirically, LaDi-RL outperforms
token-level RL by 9.4% on code generation and 5.7% on math
reasoning in pass@1, and even surpasses the base model's pass@k performance.
Read the full abstract ▾
All authors Haoqiang Kang, Yizhe Zhang, Nikki Lijing Kuang, Yi-An Ma, Lianhui Qin
Machine Learning
$\textbf{AGT$^{AO}$}$: Robust and Stabilized LLM Unlearning via Adversarial Gating Training with Adaptive Orthogonality
Pengyu Li, Lingling Zhang, Zhitao Gao et al. (+5 more)
While Large
Language Models (LLMs) have achieved remarkable capabilities, they unintentionally memorize sensitive data, posing critical
privacy and security risks. Machine unlearning is pivotal for mitigating these risks, yet existing paradigms face a fundamental dilemma: aggressive unlearning often induces catastrophic forgetting that degrades model utility, whereas conservative strategies risk superficial forgetting, leaving models vulnerable to
adversarial recovery. To address this trade-off, we propose $\textbf{AGT$^{AO}$}$ (
Adversarial Gating Training with Adaptive Orthogonality), a unified framework designed to reconcile robust erasure with utility preservation. Specifically, our approach introduces $\textbf{Adaptive Orthogonality (AO)}$ to dynamically mitigate
geometric gradient conflicts between forgetting and retention objectives, thereby minimizing unintended knowledge degradation. Concurrently, $\textbf{Adversarial Gating Training (AGT)}$ formulates unlearning as a latent-space min-max game, employing a curriculum-based gating mechanism to simulate and counter internal recovery attempts. Extensive experiments demonstrate that $\textbf{AGT$^{AO}$}$ achieves a superior trade-off between unlearning efficacy (KUR $\approx$ 0.01) and model utility (MMLU 58.30). Code is available at https://github.com/TiezMind/AGT-unlearning.
Read the full abstract ▾
All authors Pengyu Li, Lingling Zhang, Zhitao Gao, Yanrui Wu, Yuxuan Dong, Huan Liu, Bifan Wei, Jun Liu
Machine Learning · Cross-listed from cs.CL
Restoring Exploration after Post-Training: Latent Exploration Decoding for Large Reasoning Models
Wenhui Tan, Fiorenzo Parascandolo, Enver Sangineto et al. (+6 more)
Large
Reasoning Models (LRMs) have recently achieved strong mathematical and code
reasoning performance through Reinforcement Learning (RL) post-training. However, we show that modern
reasoning post-training induces an unintended exploration collapse: temperature-based sampling no longer increases pass@$n$ accuracy. Empirically, the final-layer posterior of post-trained LRMs exhibit sharply reduced
entropy, while the
entropy of intermediate layers remains relatively high. Motivated by this
entropy asymmetry, we propose Latent Exploration Decoding (LED), a depth-conditioned decoding strategy. LED aggregates intermediate posteriors via cumulative sum and selects depth configurations with maximal
entropy as exploration candidates. Without additional training or parameters, LED consistently improves pass@1 and pass@16 accuracy by 0.61 and 1.03 percentage points across multiple
reasoning benchmarks and models. Furthermore, integrating LED into reinforcement learning, e.g., using GRPO as the rollout strategy, yields faster reward improvement and higher final performance, due to the efficient exploration capability of LED. Project page: https://github.com/AlbertTan404/LED.
Read the full abstract ▾
All authors Wenhui Tan, Fiorenzo Parascandolo, Enver Sangineto, Jianzhong Ju, Zhenbo Luo, Qian Cao, Rita Cucchiara, Ruihua Song, Jian Luan
Machine Learning · Cross-listed from cs.AI
Beyond Dense States: Sparse Transcoders as Causally Testable Operators for LLM Latent Reasoning
Yadong Wang, Haodong Chen, Yu Tian et al. (+3 more)
Latent
reasoning reduces the
token-generation cost of chain-of-thought
reasoning by replacing explicit intermediate
tokens with continuous latent transitions. However, existing latent
reasoning methods usually rely on dense and entangled transitions, making their
reasoning trajectories difficult to inspect or intervene on. We introduce LSTR (Latent Sparse Transcoder
Reasoning), a framework that turns sparse transcoders from post-hoc diagnostic tools into in-loop, intervenable transition components for latent
reasoning. At each latent step, a Latent Transition Transcoder (LTT) combines a linear skip path with a Top-k sparse innovation path, exposing a small set of active sparse features. Under matched compression settings, LSTR offers a mechanistically inspectable alternative to dense latent
reasoning. On GSM8K-Aug, ablating only a few top-active sparse features reduces accuracy by up to 16.5%, whereas analogous interventions have much smaller effects in dense latent baselines. These results indicate that the active sparse features are causally involved in the latent transition process, rather than merely post-hoc descriptors. Additional experiments on mathematical
benchmarks and StrategyQA suggest that sparse latent transitions can preserve the compression benefits of latent
reasoning while making the resulting trajectories more inspectable and intervenable.
Read the full abstract ▾
All authors Yadong Wang, Haodong Chen, Yu Tian, Chuanxing Geng, Dong Liang, Xiang Chen
Machine Learning · Cross-listed from cs.AI
What LLMs Think When You Don't Tell Them What to Think About?
Yongchan Kwon and James Zou
Characterizing the behavior of large
language models (LLMs) across diverse settings is critical for reliable monitoring and AI safety. However, most existing analyses rely on topic- or task-specific
prompts, which can substantially limit what can be observed. In this work, we study what LLMs generate from minimal, topic-neutral inputs and probe their near-unconstrained generative behavior. Despite the absence of explicit topics, model outputs cover a broad semantic space, and surprisingly, each model family exhibits strong and systematic topical preferences. GPT-OSS predominantly generates programming (27.1%) and mathematical content (24.6%), whereas Llama most frequently generates literary content (9.1%). DeepSeek often generates religious content, while Qwen frequently generates multiple-choice questions. Beyond topical preferences, we also observe differences in content specialization and depth: GPT-OSS often generates more technically advanced content (e.g., dynamic programming) compared with other models (e.g., basic Python). Furthermore, we find that the near-unconstrained generation often degenerates into repetitive phrases, revealing interesting behaviors unique to each model family. For instance, degenerate outputs from Llama include multiple URLs pointing to personal Facebook and Instagram accounts. We release the complete
dataset of 256,000 samples from 16 LLMs, along with a reproducible codebase.
Read the full abstract ▾
Machine Learning
Semantic-aware Wasserstein Policy Regularization for Large Language Model Alignment
Byeonghu Na, Hyungho Na, Yeongmin Kim et al. (+4 more)
Large
language models (LLMs) are commonly aligned with human preferences using reinforcement learning from human feedback (RLHF). In this method, LLM policies are generally optimized through reward maximization with Kullback-Leibler (KL) divergence regularization of the reference policy. However, KL and its $f$-divergence variants only compare
token probabilities at identical indices, failing to capture semantic similarity. We propose Wasserstein Policy Regularization (WPR), a semantic-aware regularization for the RLHF framework based on the
entropy-regularized Wasserstein distance, which incorporates the geometry of the
token space. The dual formulation of the distance expresses the regularization as penalty terms applied to the reward via optimal dual variables, which yield a tractable objective compatible with standard RL
algorithms. Empirically, our method outperforms KL- and $f$-divergence-based baselines, demonstrating the benefits of semantic-aware policy distances for
alignment. Our code is available at https://github.com/aailab-kaist/WPR.
Read the full abstract ▾
All authors Byeonghu Na, Hyungho Na, Yeongmin Kim, Suhyeon Jo, HeeSun Bae, Mina Kang, Il-Chul Moon
Machine Learning
Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
Taihei Oki and Shinsaku Sakaue
We study online inverse linear optimization, also known as contextual recommendation, where a learner sequentially infers an
agent's hidden objective vector from observed optimal actions over feasible sets that change over time. The learner aims to recommend actions that perform well under the
agent's true objective, and the performance is measured by the regret, defined as the cumulative gap between the
agent's optimal values and those achieved by the learner's recommended actions. Prior work has established a regret bound of $O(d\log T)$, as well as a finite but exponentially large bound of $\exp(O(d\log d))$, where $d$ is the dimension of the optimization problem and $T$ is the time horizon, while a regret lower bound of $\Omega(d)$ is known (Gollapudi et al. 2021; Sakaue et al. 2025). Whether a finite regret bound
polynomial in $d$ is achievable or not has remained an open question. We partially resolve this by showing that when the feasible sets are M-convex – a broad class that includes matroids – a finite regret bound of $O(d\log d)$ is possible. We achieve this by combining a structural characterization of optimal solutions on M-convex sets with a
geometric volume argument. Moreover, we extend our approach to adversarially corrupted feedback in up to $C$ rounds. We obtain a regret bound of $O((C+1)d\log d)$ without prior knowledge of $C$, by monitoring directed graphs induced by the observed feedback to detect corruptions adaptively.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.RO
Towards Autonomous Instrument Tray Assembly for Sterile Processing Applications
Raghavasimhan Sankaranarayanan, Paul Stuart, Nicholas Ahn et al. (+2 more)
The Sterile Processing and Distribution (SPD) department is responsible for cleaning, disinfecting, inspecting, and assembling
surgical instruments between surgeries. Manual inspection and preparation of instrument trays is a time-consuming, error-prone task, often prone to contamination and instrument breakage. In this work, we present a fully automated robotic system that sorts and structurally packs
surgical instruments into sterile trays, focusing on automation of the SPD assembly stage. A custom
dataset comprising 31
surgical instruments and 6,975 annotated images was collected to train a hybrid perception pipeline using YOLO12 for detection and a cascaded ResNet-based model for fine-grained classification. The system integrates a calibrated
vision module, a 6-DOF Staubli TX2-60L robotic arm with a custom dual electromagnetic gripper, and a rule-based packing
algorithm that reduces instrument collisions during transport. The packing framework uses 3D printed dividers and holders to physically isolate instruments, reducing collision and friction during transport. Experimental evaluations show high perception accuracy and statistically significant reduction in tool-to-tool collisions compared to human-assembled trays. This work serves as the scalable first step toward automating SPD workflows, improving safety, and consistency of
surgical preparation while reducing SPD processing times.
Read the full abstract ▾
All authors Raghavasimhan Sankaranarayanan, Paul Stuart, Nicholas Ahn, Arno Sungarian, Yash Chitalia