Machine Learning
SIEVE: Sample-Efficient Parametric Learning from Natural Language
Parth Asawa, Alexandros G. Dimakis and Matei Zaharia
Natural
language context-such as instructions, knowledge, or feedback-contains rich signal for adapting
language models. While in-context learning provides adaptation via the
prompt, parametric learning persists into model weights and can improve performance further, though is data hungry and heavily relies on either high-quality traces or automated verifiers. We propose SIEVE, a method for sample-efficient parametric learning from natural
language context that requires as few as three query examples. SIEVE uses a novel synthetic data generation pipeline, SIEVE-GEN, that leverages the insight that context is decomposable. Decomposing context allows us to generate higher quality rollouts by pairing synthetic queries with only the applicable context rather than the entirety, then using context
distillation to internalize context into the model. We evaluate in
reasoning settings where context is necessary, including custom domains and the RuleArena and Machine Translation from One Book tasks. Our results show that SIEVE outperforms prior context
distillation methods using just three query examples, demonstrating how to achieve sample-efficient parametric learning from natural
language.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.IR
Isotonic Layer: A Unified Framework for Recommendation Calibration and Debiasing
Hailing Cheng, Yafang Yang, Hemeng Tao et al. (+1 more)
Model calibration and debiasing are fundamental yet operationally expensive challenges in large-scale recommendation systems. Existing approaches treat them as separate problems requiring distinct infrastructure: post-hoc calibration pipelines, propensity estimation workflows, and per-segment model farms. We introduce the Isotonic Layer, a differentiable piecewise linear module that unifies both problems within a single, lightweight architectural component - requiring no additional data preprocessing, no propensity estimation, and no separate calibration pipelines. The core insight is elegant: by parameterizing non-negative bucket weights as learnable context
embeddings, the model automatically learns all calibration and debiasing functions end-to-end from standard training data. Swapping in a different
embedding (position, device type, advertiser ID, or any combination) instantly yields calibration tailored to that sub-segment at arbitrary granularity in any high-dimensional feature space, with no engineering changes beyond a single
embedding lookup. The same layer handles post-hoc calibration, position debiasing, and heterogeneous multi-task bias correction within one unified framework. This paper offers a principled, practical simplification: a plug-and-play solution that replaces fragmented, high-maintenance calibration infrastructure with a single end-to-end trainable component. Extensive production A/B tests confirm significant improvements in predictive accuracy, calibration fidelity, and ranking consistency.
Read the full abstract ▾
All authors Hailing Cheng, Yafang Yang, Hemeng Tao, Fengyu Zhang
Machine Learning
vLLM Hook v1: A Plug-in for Programming Model Internals on vLLM
Ching-Yun Ko, Yunhua Fang and Pin-Yu Chen
Modern artificial intelligence models are deployed on inference engines to optimize runtime efficiency and resource allocation, particularly for
transformer-based large
language models. The vLLM project is a major open-source library to support model serving and inference. However, the current implementation of vLLM limits programmability of the internal states of deployed models. This prevents the use of popular test-time model
alignment and enhancement methods. For example, it prevents the detection of
adversarial prompts based on
attention patterns or the adjustment of model responses based on activation steering. To bridge this critical gap, we present vLLM Hook, an opensource plug-in to enable the programming of internal states for vLLM models. Based on a configuration file specifying which internal states to capture, vLLM Hook provides seamless integration to vLLM and supports two essential features: passive programming and active programming. For passive programming, vLLM Hook probes the selected internal states for subsequent analysis, while keeping the model generation intact. For active programming, vLLM Hook enables efficient intervention of model generation by altering the selected internal states. In version 1 (named vLLM Hook MIA), the plugin runs on vLLM's V2 model runner and preserves the engine's CUDA graphs, so that capturing and steering internal states incurs only a small decoding overhead. It supports both offline use and serving through vllm serve. In addition to presenting the core functions of vLLM Hook, we demonstrate use cases including
prompt injection detection,
attention-based re-ranking for
retrieval-augmented generation, activation steering, hidden-state probing,
hallucination detection, schema linking for text-to-SQL, and tool-call risk assessment. Finally, we welcome the community's contribution to improve vLLM Hook via https://github.com/IBM/vLLM-Hook.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
Architecture-Agnostic Curriculum Learning for Document Understanding: Empirical Evidence from Text-Only and Multimodal
Mohammed Hamdan, Vincenzo Dentamaro, Giuseppe Pirlo et al. (+1 more)
We investigate whether progressive data scheduling – a curriculum learning strategy that incrementally increases training data exposure (33%$\rightarrow$67%$\rightarrow$100%) – yields consistent efficiency gains across architecturally distinct document understanding models. By evaluating BERT (text-only, 110M parameters) and LayoutLMv3 (
multimodal, 126M parameters) on the FUNSD and CORD
benchmarks, we establish that this schedule reduces wall-clock training time by approximately 33%, commensurate with the reduction from 6.67 to 10.0 effective epoch-equivalents of data. To isolate curriculum effects from compute reduction, we introduce matched-compute baselines (Standard-7) that control for total gradient updates. On the FUNSD
dataset, the curriculum significantly outperforms the matched-compute baseline for BERT ($\Delta$F1 = +0.023, $p=0.022$, $d_z=3.83$), constituting evidence for a genuine scheduling benefit in capacity-constrained models. In contrast, no analogous benefit is observed for LayoutLMv3 ($p=0.621$), whose
multimodal representations provide sufficient inductive bias. On the CORD
dataset, all conditions converge to equivalent F1 scores ($\geq$0.947) irrespective of scheduling, indicating a performance ceiling. Schedule ablations comparing progressive, two-phase, reverse, and random pacing confirm that the efficiency gain derives from reduced data volume rather than ordering. Taken together, these findings demonstrate that progressive scheduling is a reliable compute-reduction strategy across model families, with curriculum-specific benefits contingent on the interaction between model capacity and task complexity.
Read the full abstract ▾
All authors Mohammed Hamdan, Vincenzo Dentamaro, Giuseppe Pirlo, Mohamed Cheriet
Machine Learning · Cross-listed from cs.CL
Make Every Draft Count: Hidden State based Speculative Decoding
Yuetao Chen, Xuliang Wang, Xinzhou Zheng et al. (+3 more)
Speculative decoding has emerged as a pivotal technique to accelerate LLM inference by employing a lightweight draft model to generate candidate
tokens that are subsequently verified by the target model in parallel. However, while this paradigm successfully increases the arithmetic intensity of
memory-bound inference, it causes significant compute inefficiency: the majority of draft
tokens fail verification and are discarded, resulting in waste of computation. Motivated by the goal of recollecting this wasted computation, we propose a novel system that transforms discarded drafts into reusable
tokens. Our key insight is to perform auto-regressive prediction at the hidden states level and postpone the integrating
token information after the hidden states generation, so the draft hidden states are not contaminated by incorrect
tokens, enabling hidden state reuse. To implement such a system, first we introduce a draft model architecture based on auto-regressive hidden states, which preserves richer semantics than
token-based drafters to facilitate draft repurposing. Second, we design an efficient
token information injection mechanism that leverages our specialized draft model to construct high-quality draft
token trees and enables resampling
tokens from verification failures. Third, we eliminate the overhead hidden in our design to further maximize hardware utilization. We conducted extensive evaluations against various baselines, demonstrating up to a 3.3x speedup against standard speculative decoding.
Read the full abstract ▾
All authors Yuetao Chen, Xuliang Wang, Xinzhou Zheng, Ming Li, Peng Wang, Hong Xu
Machine Learning
Genetic Generalized Additive Models
Kaaustaaub Shankar and Kelly Cohen
Generalized Additive Models (GAMs) balance predictive accuracy and interpretability, but manually configuring their structure is challenging. We propose using the multi-objective genetic
algorithm NSGA-II to automatically optimize GAMs, jointly minimizing prediction error (RMSE) and a Complexity Penalty that captures sparsity, smoothness, and uncertainty. Experiments on the California Housing
dataset show that NSGA-II discovers GAMs that outperform baseline LinearGAMs in accuracy or match performance with substantially lower complexity. The resulting models are simpler, smoother, and exhibit narrower confidence intervals, enhancing interpretability. This framework provides a general approach for automated optimization of transparent, high-performing models. The code can be found at https://github.com/KaaustaaubShankar/GeneticAdditiveModels.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
P-RAG: Prompt-Enhanced Parametric RAG with LoRA and Selective CoT for Biomedical and Multi-Hop QA
Xingda Lyu, Gongfu Lyu, Zitai Yan et al. (+1 more)
Large
Language Models (LLMs) demonstrate remarkable capabilities but remain limited by their reliance on static training data.
Retrieval-Augmented Generation (RAG) addresses this constraint by retrieving external knowledge during inference, though it still depends heavily on knowledge base quality. To explore potential improvements, we evaluated three RAG variants-Standard RAG, DA-RAG, and our proposed
Prompt-Enhanced Parametric RAG (P-RAG), a hybrid architecture that integrates parametric knowledge within the LLM and retrieved evidence, guided by Chain-of-Thought (CoT) prompting and Low-Rank Adaptation (LoRA) fine-tuning-on both general and biomedical
datasets. Using LLaMA-3.2-1B-Instruct fine-tuned via LoRA, we evaluate on PubMedQA and 2WikiMultihopQA. P-RAG outperforms Standard RAG on PubMedQA by 10.47 percentage points in F1 (93.33% vs. 82.86%; 12.64% relative). On 2WikiMultihopQA, P-RAG nearly doubles the overall score vs. Standard RAG (33.44% vs. 17.83%) and achieves 44.03% on the Compare subset (with 42.74% Bridge, 21.84% Inference, 8.60% Compose). CoT prompting substantially improves multi-hop
reasoning but yields mixed results for simpler, single-hop queries. These findings underscore P-RAG's potential for accurate, scalable, and contextually adaptive biomedical question answering. Our contributions include: (1) LoRA-based fine-tuning of LLaMA-3.2-1B-Instruct for biomedical QA, (2) introduction of P-RAG with Chain-of-Thought prompting, and (3) state-of-the-art results on PubMedQA and 2WikiMultihopQA.
Read the full abstract ▾
All authors Xingda Lyu, Gongfu Lyu, Zitai Yan, Yuxin Jiang
Machine Learning · Cross-listed from q-bio.BM
A Systematic Evaluation of Co-folding Model Representations for Small-Molecule Learning
Hyosoon Jang, Hyunjin Seo, Honghui Kim et al. (+4 more)
Small-molecule foundation models are typically pretrained on standalone molecular data, unlike
vision and
language models that often benefit from cross-modal or relational supervision.
Protein-ligand co-folding provides a molecular analogue of such supervision by exposing models to atom-level ligand-
protein interactions, raising the question of whether co-folding models can yield strong small-molecule representations. We study this question using Boltz2, a modern co-folding model, by transferring its atom-level ligand representations to standalone small-molecule tasks. Through systematic probing and
distillation, we show that Boltz2 representations match or outperform existing models on the ADMET
benchmark, accelerate molecular generative modeling, and improve sample efficiency in structure-guided ligand optimization. We further find that Boltz2 representations are complementary to those learned from conventional standalone molecular supervision, including 3D conformers, bioassay labels, and
quantum-chemical properties. Finally, we extend representation
alignment to reinforcement learning, showing that dense representation-level supervision can complement scalar rewards in molecular discovery. These results identify
protein-ligand co-folding as a promising pretraining paradigm for small-molecule representation learning and position Boltz2 as a strong, off-the-shelf molecular foundation model.
Read the full abstract ▾
All authors Hyosoon Jang, Hyunjin Seo, Honghui Kim, Seonghyun Park, Taewon Kim, Yunhui Jang, Sungsoo Ahn
Machine Learning
Neural Sabermetrics with World Model: Play-by-play Predictive Modeling with Large Language Model
Young Jin Ahn, Yiyang Du, Zheyuan Zhang et al. (+1 more)
Classical sabermetrics has profoundly shaped baseball analytics by summarizing long histories of play into compact statistics. While these metrics are invaluable for valuation and retrospective analysis, they do not define a generative model of how baseball games unfold pitch by pitch, leaving most existing approaches limited to single-step prediction or post-hoc analysis. In this work, we present Neural Sabermetrics with World Model, a Large
Language Model (LLM) based play-by-play world model for baseball. We cast baseball games as long auto-regressive sequences of events and continuously pretrain a single LLM on more than ten years of Major League Baseball (MLB) tracking data, comprising over seven million pitch sequences and approximately three billion
tokens. The resulting model is capable of predicting multiple aspects of game
evolution within a unified framework. We evaluate our model on both in-distribution regular-season data and out-of-distribution postseason games and compare against strong neural baselines from prior work. Despite using a single backbone model, our approach outperforms the performance of existing baselines, (1) correctly predicting approximately 64% of next pitches within a plate appearance and (2) 78% of batter swing decisions, suggesting that LLMs can serve as effective world models for sports.
Read the full abstract ▾
All authors Young Jin Ahn, Yiyang Du, Zheyuan Zhang, Haisen Kang
Machine Learning · Cross-listed from cs.CV
Fair Context Learning for Evidence-Balanced Test-Time Adaptation in Vision-Language Models
Sanggeon Yun, Ryozo Masukawa, SungHeon Jeong et al. (+3 more)
Vision-
Language Models (VLMs) such as CLIP enable strong zero-shot recognition but suffer substantial degradation under distribution shifts. Test-Time Adaptation (TTA) aims to improve robustness using only unlabeled test samples, yet most
prompt-based TTA methods rely on
entropy minimization – an approach that can amplify spurious correlations and induce overconfident errors when classes share visual features. We propose Fair Context Learning (FCL), an episodic TTA framework that avoids
entropy minimization by explicitly addressing shared-evidence bias. Motivated by our additive evidence decomposition assumption, FCL decouples adaptation into (i) augmentation-based exploration to identify plausible class candidates, and (ii)
fairness-driven calibration that adapts text contexts to equalize sensitivity to common visual evidence. This
fairness constraint mitigates partial feature obsession and enables effective calibration of text
embeddings without relying on
entropy reduction. Through extensive evaluation, we empirically validate our theoretical motivation and show that FCL achieves competitive adaptation performance relative to state-of-the-art TTA methods across diverse domain-shift and fine-grained
benchmarks.
Read the full abstract ▾
All authors Sanggeon Yun, Ryozo Masukawa, SungHeon Jeong, Wenjun Huang, Hanning Chen, Mohsen Imani
Machine Learning · Cross-listed from eess.IV
Condition Errors Refinement in Autoregressive Image Generation with Diffusion Loss
Yucheng Zhou, Hao Li and Jianbing Shen
Recent studies have explored autoregressive models for image generation, with promising results, and have combined
diffusion models with autoregressive frameworks to optimize image generation via
diffusion losses. In this study, we present a theoretical analysis of
diffusion and autoregressive models with
diffusion loss, highlighting the latter's advantages. We present a theoretical comparison of conditional
diffusion and autoregressive
diffusion with
diffusion loss, demonstrating that patch denoising optimization in autoregressive models effectively mitigates condition errors and leads to a stable condition distribution. Our analysis also reveals that autoregressive condition generation refines the condition, causing the condition error influence to decay exponentially. In addition, we introduce a novel condition refinement approach based on Optimal Transport (OT) theory to address “condition inconsistency”. We theoretically demonstrate that formulating condition refinement as a Wasserstein Gradient Flow ensures convergence toward the ideal condition distribution, effectively mitigating condition inconsistency. Experiments demonstrate the superiority of our method over
diffusion and autoregressive models with
diffusion loss methods.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CY
AI for Sustainable Data Protection and Fair Algorithmic Management in Environmental Regulation
Sahibpreet Singh and Saksham Sharma
Integration of AI into environmental regulation represents a significant advancement in data management. It offers promising results in both data protection plus algorithmic
fairness. This research addresses the critical need for sustainable data protection in the era of ever evolving cyber threats. Traditional encryption methods face limitations in handling the dynamic nature of environmental data. This necessitates the exploration of advanced cryptographic techniques. The objective of this study is to evaluate how AI can enhance these techniques to ensure robust data protection while facilitating fair algorithmic management. The methodology involves a comprehensive review of current advancements in AI-enhanced homomorphic encryption (HE) and multi-party computation (MPC). It is coupled with an analysis of how these techniques can be applied to environmental data regulation. Key findings indicate that AI-driven dynamic key management, adaptive encryption schemes, and optimized computational efficiency in HE, alongside AI-enhanced protocol optimization and fault mitigation in MPC, significantly improve the security of environmental data processing. These findings highlight a crucial research gap in the intersection of AI, cyber laws, and environmental regulation, particularly in terms of addressing algorithmic bias, transparency, and accountability. The implications of this research underscore the need for stricter cyber laws. Also, the development of comprehensive regulations to safeguard sensitive environmental data. Future efforts should focus on refining AI systems to balance security with
privacy and ensuring that regulatory frameworks can adapt to technological advancements. This study provides a foundation for future research aimed at achieving secure sustainable environmental data management through AI innovations.
Read the full abstract ▾
Machine Learning · Cross-listed from q-fin.ST
Financial Bond Similarity Search Using Representation Learning
Amin Haeri, Mahdi Ghelichi, Nishant Agrawal et al. (+2 more)
Finding similar bonds remains challenging in fixed-income analytics, as numerical financial attributes often overshadow categorical non-financial ones such as issuer sector and domicile. This paper shows that these categorical attributes dominate the predictability of spread curves and proposes
embedding models to capture their semantic similarities, outperforming one-hot and many other baselines. Evaluated via sparse-issuer augmentation, the approach improves risk modeling and curve construction.
Read the full abstract ▾
All authors Amin Haeri, Mahdi Ghelichi, Nishant Agrawal, David Li, Catalina Gomez Sanchez
Machine Learning · Cross-listed from cs.DC
HQP: Sensitivity-Aware Hybrid Quantization and Pruning for Ultra-Low-Latency Edge AI Inference
Dinesh Gopalan and Ratul Ali
The escalating demand for high-fidelity, real-time inference in distributed edge-cloud environments necessitates aggressive model optimization to counteract severe latency and energy constraints. This paper introduces the Hybrid Quantization and
Pruning (HQP) framework, a novel, integrated methodology designed to achieve synergistic model acceleration while adhering to strict quality guarantees. We detail a sensitivity-aware structural
pruning algorithm that employs a dynamic weight sensitivity metric, derived from a highly efficient approximation of the Fisher Information
Matrix (FIM), to guide the iterative removal of redundant filters. This
pruning is strictly conditional, enforcing an adherence to a maximum permissible accuracy drop (Delta ax) before the model proceeds to 8-bit post-training quantization. This rigorous coordination is critical, as it ensures the resultant sparse model structure is maximally robust to quantization error and hardware-specific kernel optimization. Exhaustive evaluation across heterogeneous NVIDIA Jetson edge platforms, utilizing resource-efficient architectures like MobileNetV3 and ResNet-18, demonstrates that the HQP framework achieves a peak performance gain of 3.12 times inference speedup and a 55 percent model size reduction, while rigorously containing the accuracy drop below the 1.5 percent constraint. A comprehensive comparative analysis against conventional single-objective compression techniques validates the HQP framework as a superior, hardware-agnostic solution for deploying ultra-low-latency AI in resource-limited edge infrastructures.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
DiGAN: Diffusion-Guided Attention Network for Early Alzheimer's Disease Detection
Maxx Richard Rahman, Mostafa Hammouda and Wolfgang Maass
Early diagnosis of Alzheimer's disease (AD) remains a major challenge due to the subtle and temporally irregular progression of structural
brain changes in the prodromal stages. Existing deep learning approaches require large longitudinal
datasets and often fail to model the temporal continuity and modality irregularities inherent in real-world clinical data. To address these limitations, we propose the
Diffusion-Guided
Attention Network (DiGAN), which integrates latent
diffusion modelling with an
attention-guided convolutional network. The
diffusion model synthesizes realistic longitudinal neuroimaging trajectories from limited training data, enriching temporal context and improving robustness to unevenly spaced visits. The
attention-convolutional layer then captures discriminative structural-temporal patterns that distinguish cognitively normal subjects from those with mild cognitive impairment and subjective cognitive decline. Experiments on the ADNI
dataset demonstrate that DiGAN outperforms existing state-of-the-art baselines, showing its potential for early-stage AD detection.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
TruKAN: Towards More Efficient Kolmogorov-Arnold Networks Using Truncated Power Functions
Ali Bayeh, Samira Sadaoui and Malek Mouhoub
To address the trade-off between computational efficiency and adherence to Kolmogorov-Arnold Network (KAN) principles, we propose TruKAN, a new architecture based on the KAN structure and learnable activation functions. TruKAN replaces the B-spline basis in KAN with a family of truncated power functions derived from k-order spline theory. This change maintains the KAN's expressiveness while enhancing accuracy and training time. Each TruKAN layer combines a truncated power term with a
polynomial term and employs either shared or individual
knots. TruKAN exhibits greater interpretability than other KAN variants due to its simplified basis functions and
knot configurations. By prioritizing interpretable basis functions, TruKAN aims to balance approximation efficacy with transparency. We develop the TruKAN model and integrate it into an advanced EfficientNet-V2-based framework, which is then evaluated on computer
vision benchmark datasets. To ensure a fair comparison, we develop various models: MLP-, KAN-, SineKAN and TruKAN-based EfficientNet frameworks and assess their training time and accuracy across small and deep architectures. The training phase uses hybrid optimization to improve convergence stability. Additionally, we investigate layer normalization techniques for all the models and assess the impact of shared versus individual
knots in TruKAN. Overall, TruKAN outperforms other KAN models in terms of accuracy, computational efficiency and
memory usage on the complex
vision task, demonstrating advantages beyond the limited settings explored in prior KAN studies.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
Training-Free Self-Correction for Multimodal Masked Diffusion Models
Yidong Ouyang, Panwen Hu, Zhengyan Wan et al. (+7 more)
Masked
diffusion models have emerged as a powerful framework for text and
multimodal generation. However, their sampling procedure updates multiple
tokens simultaneously and treats generated
tokens as immutable, which may lead to error accumulation when early mistakes cannot be revised. In this work, we revisit existing self-correction methods and identify limitations stemming from additional training requirements or reliance on misaligned likelihood estimates. We propose a training-free self-correction framework that exploits the inductive biases of pre-trained masked
diffusion models. Without modifying model parameters or introducing auxiliary evaluators, our method significantly improves generation quality on text-to-image generation and
multimodal understanding tasks with reduced sampling steps. Moreover, the proposed framework generalizes across different masked
diffusion architectures, highlighting its robustness and practical applicability. Code can be found in https://github.com/huge123/FreeCorrection.
Read the full abstract ▾
All authors Yidong Ouyang, Panwen Hu, Zhengyan Wan, Zhe Wang, Liyan Xie, Dmitriy Bespalov, Ying Nian Wu, Guang Cheng, Hongyuan Zha, Qiang Sun
Machine Learning
Refining Decision Boundaries In Anomaly Detection Using Similarity Search Within the Feature Space
Sidahmed Benabderrahmane, Petko Valtchev, James Cheney et al. (+1 more)
Detecting rare and diverse anomalies in highly imbalanced
datasets-such as Advanced Persistent Threats (APTs) in cybersecurity-remains a fundamental challenge for machine learning systems. Active learning offers a promising direction by strategically querying an oracle to minimize labeling effort, yet conventional approaches often fail to exploit the intrinsic
geometric structure of the feature space for model refinement. In this paper, we introduce SDA2E, a Sparse Dual
Adversarial Attention-based AutoEncoder designed to learn compact and discriminative latent representations from imbalanced, high-dimensional data. We further propose a similarity-guided active learning framework that integrates three novel strategies to refine decision boundaries efficiently: mormal-like expansion, which enriches the training set with points similar to labeled normals to improve reconstruction fidelity; anomaly-like prioritization, which boosts ranking accuracy by focusing on points resembling known anomalies; and a hybrid strategy that combines both for balanced model refinement and ranking. A key component of our framework is a new similarity measure, Normalized Matching 1s (SIM_NM1), tailored for sparse binary
embeddings. We evaluate SDA2E extensively across 52 imbalanced
datasets, including multiple DARPA Transparent Computing scenarios, and
benchmark it against 15 state-of-the-art anomaly detection methods. Results demonstrate that SDA2E consistently achieves superior ranking performance (nDCG up to 1.0 in several cases) while reducing the required labeled data by up to 80% compared to passive training. Statistical tests confirm the significance of these improvements. Our work establishes a robust, efficient, and statistically validated framework for anomaly detection that is particularly suited to cybersecurity applications such as APT detection.
Read the full abstract ▾
All authors Sidahmed Benabderrahmane, Petko Valtchev, James Cheney, Talal Rahwan
Machine Learning
How Does the Lagrangian Guide Safe Reinforcement Learning through Diffusion Models?
Xiaoyuan Cheng, Wenxuan Yuan, Boyang Li et al. (+7 more)
Diffusion policy sampling enables reinforcement learning (RL) to represent
multimodal action distributions beyond suboptimal unimodal Gaussian policies. However, existing
diffusion-based RL methods primarily focus on offline settings for reward maximization, with limited consideration of safety in online settings. To address this gap, we propose Augmented Lagrangian-Guided
Diffusion (ALGD), a novel
algorithm for off-policy safe RL. By revisiting optimization theory and energy-based model, we show that the instability of primal-dual methods arises from the non-convex Lagrangian landscape. In
diffusion-based safe RL, the Lagrangian can be interpreted as an energy function guiding the denoising dynamics. Counterintuitively, direct usage destabilizes both policy generation and training. ALGD resolves this issue by introducing an augmented Lagrangian that locally convexifies the energy landscape, yielding a stabilized policy generation and training process without altering the distribution of the optimal policy. Theoretical analysis and extensive experiments demonstrate that ALGD is both theoretically grounded and empirically effective, achieving strong and stable performance across diverse environments.
Read the full abstract ▾
All authors Xiaoyuan Cheng, Wenxuan Yuan, Boyang Li, Yuanchao Xu, Yiming Yang, Hao Liang, Bei Peng, Robert Loftin, Zhuo Sun, Yukun Hu
Machine Learning
A Reproducible Framework for Bias-Resistant Machine Learning on Small-Sample Neuroimaging Data
Jagan Mohan Reddy Dwarampudi, Jennifer L Purks, Joshua Wong et al. (+2 more)
We introduce a reproducible, bias-resistant machine learning framework that integrates domain-informed feature engineering, nested cross-validation, and calibrated decision-threshold optimization for small-sample neuroimaging data. Conventional cross-validation frameworks that reuse the same folds for both model selection and performance estimation yield optimistically biased results, limiting reproducibility and generalization. Demonstrated on a high-dimensional structural MRI
dataset of deep
brain stimulation cognitive outcomes, the framework achieved a nested-CV balanced accuracy of 0.660\,$\pm$\,0.068 using a compact, interpretable subset selected via importance-guided ranking. By combining interpretability and unbiased evaluation, this work provides a generalizable computational blueprint for reliable machine learning in data-limited biomedical domains.
Read the full abstract ▾
All authors Jagan Mohan Reddy Dwarampudi, Jennifer L Purks, Joshua Wong, Renjie Hu, Tania Banerjee