Machine Learning
SCALE:Scalable Conditional Atlas-Level Endpoint transport for virtual cell perturbation prediction
Shuizhou Chen, Lang Yu, Xueqin Lin et al. (+12 more)
Virtual-
cell models aim to predict how
cell populations respond to perturbations, but control and treated
cells are measured as unpaired populations, complicating the learning of perturbation-specific effects. We present SCALE, a conditional transport model that represents
cells as unordered sets and predicts treated populations without
cell-level matching. A shared set-aware encoder and conditional DiT backbone learn latent transport, making endpoint supervision directly delta-aligned without an auxiliary delta objective. Across genetic, chemical, developmental and immune perturbations, SCALE recovered gene-expression changes, response directions and population structure. In CRISPR data with dominant
cell-line effects, SCALE outperformed competing methods across seven metrics and maintained separation among gene-target representations rather than collapsing them into a shared region. SCALE further prioritized cytokines predicted to produce distinct immune activation and inflammatory responses. Experiments using matched PBMC samples from three donors confirmed these predicted differences. Together, SCALE enables perturbation-specific prediction from unpaired populations and supports experimental prioritization.
Read the full abstract ▾
All authors Shuizhou Chen, Lang Yu, Xueqin Lin, Xinjie Mao, Songming Zhang, Xinyu Gu, Hao Wu, Sheng Xu, Kedu Jin, Lei Bai, Quan Qian, Qin Chen, Qiang Gao, Siqi Sun, Zhangyang Gao
Machine Learning
Efficient Exploration at Scale
Seyed Mohammad Asghari, Chris Chute, Vikranth Dwaracherla et al. (+5 more)
We develop an online learning
algorithm that dramatically improves the data efficiency of reinforcement learning from human feedback (RLHF). Our
algorithm incrementally updates reward and
language models as choice data is received. The reward model is fit to the choice data, while the
language model is updated by a variation of reinforce, with reinforcement signals provided by the reward model. Several features enable the efficiency gains: a small affirmative nudge added to each reinforcement signal, an epistemic neural network that models reward uncertainty, and information-directed exploration. With Gemma large
language models (LLMs), our
algorithm matches the performance of offline RLHF trained on 200K labels using fewer than 20K labels, representing more than a 10x gain in data efficiency. Extrapolating from our results, we expect our
algorithm trained on 1M labels to match offline RLHF trained on 1B labels. This represents a 1,000x gain. To our knowledge, these are the first results to demonstrate that such large improvements are possible.
Read the full abstract ▾
All authors Seyed Mohammad Asghari, Chris Chute, Vikranth Dwaracherla, Xiuyuan Lu, Mehdi Jafarnia, Victor Minden, Zheng Wen, Benjamin Van Roy
Machine Learning
Variational Kernel Design for Internal Noise: Gaussian Chaos Noise, Representation Compatibility, and Reliable Deep Learning
Ziran Liu
Internal noise in deep networks is usually inherited from heuristics such as dropout, hard masking, or additive perturbation. We ask two questions: what correlation geometry should internal noise have, and is the implemented perturbation compatible with the representations it acts on? We answer these questions through Variational Kernel Design (VKD), a framework in which a noise mechanism is specified by a law family, a correlation kernel, and an injection operator, and is derived from learning desiderata. In a solved spatial subfamily, a quadratic maximum-
entropy principle over latent log-fields yields a Gaussian optimizer with precision given by the Dirichlet
Laplacian, so the induced geometry is the Dirichlet Green kernel. Wick normalization then gives a canonical positive mean-one gate, Gaussian Chaos Noise (GCh). For the sample-wise gate used in practice, we prove exact Gaussian control of pairwise log-ratio deformation, margin-sensitive ranking stability, and an exact expected intrinsic roughness budget; hard binary masks instead induce singular or coherence-amplified distortions on positive coherent representations. On ImageNet and ImageNet-C, GCh consistently improves calibration and under shift also improves NLL at competitive accuracy.
Read the full abstract ▾
Machine Learning
Beyond Outliers: A Data-Free Layer-wise Mixed-Precision Quantization Approach Driven by Numerical and Structural Dual-Sensitivity
Hengyuan Zhang, Xinrong Chen, Zunhai Su et al. (+10 more)
Layer-wise mixed-precision quantization (LMPQ) enables effective compression under extreme low-bit settings by allocating higher precision to sensitive layers. However, existing methods typically treat all intra-layer weight modules uniformly and rely on a single numerical property when estimating sensitivity, overlooking their distinct operational roles and structural characteristics. To address this, we propose NSDS, a novel calibration-free LMPQ framework driven by Numerical and Structural Dual-Sensitivity. Specifically, it first mechanistically decomposes each layer into distinct operational roles and quantifies their sensitivity from both numerical and structural perspectives. These dual-aspect scores are then aggregated into a unified layer-wise metric through a robust aggregation scheme based on MAD-Sigmoid and Soft-OR to guide bit allocation. Extensive experiments demonstrate that NSDS consistently achieves superior performance compared to various baselines across diverse models and downstream tasks, without relying on any calibration data.
Read the full abstract ▾
All authors Hengyuan Zhang, Xinrong Chen, Zunhai Su, Xiao Liang, Jing Xiong, Wendong Xu, He Xiao, Chaofan Tao, Wei Zhang, Ruobing Xie, Lei Jiang, Hayden Kwok-Hay So, Ngai Wong
Machine Learning
Learning Permutation Distributions via Reflected Diffusion on Ranks
Sizhuang He, Yangtian Zhang, Shiyang Zhang et al. (+1 more)
The finite symmetric group S_n provides a natural domain for permutations, yet learning probability distributions on S_n is challenging due to its factorially growing size and discrete, non-Euclidean structure. Recent permutation
diffusion methods define forward noising via shuffle-based random walks (e.g., riffle shuffles) and learn reverse transitions with Plackett-Luce (PL) variants, but the resulting trajectories can be abrupt and increasingly hard to denoise as n grows. We propose Soft-Rank
Diffusion, a discrete
diffusion framework that replaces shuffle-based corruption with a structured soft-rank forward process: we lift permutations to a continuous latent representation of order by relaxing discrete ranks into soft ranks, yielding smoother and more tractable trajectories. For the reverse process, we introduce contextualized generalized Plackett-Luce (cGPL) denoisers that generalize prior PL-style parameterizations and improve expressivity for sequential decision structures. Experiments on sorting and combinatorial optimization
benchmarks show that Soft-Rank
Diffusion consistently outperforms prior
diffusion baselines, with particularly strong gains in long-sequence and intrinsically sequential settings.
Read the full abstract ▾
All authors Sizhuang He, Yangtian Zhang, Shiyang Zhang, David van Dijk
Machine Learning · Cross-listed from cs.AI
A Progressive Visual-Logic-Aligned Framework for Ride-Hailing Adjudication
Weiming Wu, Zi-Jian Cheng, Jie Meng et al. (+5 more)
The efficient adjudication of responsibility disputes is pivotal for maintaining marketplace
fairness. However, the exponential surge in ride-hailing volume renders manual review intractable, while conventional automated methods lack the
reasoning transparency required for quasi-judicial decisions. Although
Multimodal LLMs offer a promising paradigm, they fundamentally struggle to bridge the gap between general visual semantics and rigorous evidentiary protocols, often leading to perceptual
hallucinations and logical looseness. To address these systemic misalignments, we introduce RideJudge, a Progressive Visual-Logic-Aligned Framework. Instead of relying on generic pre-training, we bridge the semantic gap via SynTraj, a synthesis engine that grounds abstract liability concepts into concrete trajectory patterns. To resolve the conflict between massive regulation volume and limited context windows, we propose an Adaptive Context Optimization strategy that distills expert knowledge, coupled with a Chain-of-Adjudication mechanism to enforce active evidentiary inquiry. Furthermore, addressing the inadequacy of sparse binary feedback for complex liability assessment, we implement a novel Ordinal-Sensitive Reinforcement Learning mechanism that calibrates decision boundaries against hierarchical severity. Extensive experiments show that our RideJudge-8B achieves 88.41% accuracy, surpassing 32B-scale baselines and establishing a new standard for interpretable adjudication.
Read the full abstract ▾
All authors Weiming Wu, Zi-Jian Cheng, Jie Meng, Peng Zhen, Shan Huang, Qun Li, Guobin Wu, Lan-Zhe Guo
Machine Learning · Cross-listed from cs.AI
ShuttleEnv: An Interactive Data-Driven RL Environment for Badminton Strategy Modeling
Ang Li, Xinyang Gong, Bozhou Chen et al. (+5 more)
We present ShuttleEnv, an interactive and data-driven simulation environment for badminton, designed to support reinforcement learning and strategic behavior analysis in fast-paced
adversarial sports. The environment is grounded in elite-player match data and employs explicit probabilistic models to simulate rally-level dynamics, enabling realistic and interpretable
agent-opponent interactions without relying on physics-based simulation. In this demonstration, we showcase multiple trained
agents within ShuttleEnv and provide live, step-by-step visualization of badminton rallies, allowing attendees to explore different play styles, observe emergent strategies, and interactively analyze decision-making behaviors. ShuttleEnv serves as a reusable platform for research, visualization, and demonstration of intelligent
agents in sports AI. Our ShuttleEnv demo
video URL: https://drive.google.com/file/d/1hTR4P16U27H2O0-w316bR73pxE2ucczX/view
Read the full abstract ▾
All authors Ang Li, Xinyang Gong, Bozhou Chen, Yunlong Lu, Jiaming Ji, Yongyi Wang, Yaodong Yang, Wenxin Li
Machine Learning · Cross-listed from cs.AI
Physics-informed offline reinforcement learning eliminates catastrophic fuel waste in maritime routing
Aniruddha Bora, Julie Chalfant and Chryssostomos Chryssostomidis
International shipping produces approximately 3% of global greenhouse gas emissions, yet voyage routing remains dominated by heuristic methods. We present PIER (Physics-Informed, Energy-efficient, Risk-aware routing), an offline reinforcement learning framework that learns fuel-efficient, safety-aware routing policies from physics-calibrated environments grounded in historical vessel tracking data and ocean reanalysis products, requiring no online simulator. Validated on one full year (2023) of AIS data across seven Gulf of Mexico routes (840 episodes per method), PIER reduces mean CO2 emissions by 10% relative to great-circle routing. However, PIER's primary contribution is eliminating catastrophic fuel waste: great-circle routing incurs extreme fuel consumption (>1.5x median) in 4.8% of voyages; PIER reduces this to 0.5%, a 9-fold reduction. Per-voyage fuel variance is 3.5x lower (p<0.001), with bootstrap 95% CI for mean savings [2.9%, 15.7%]. Partial validation against observed AIS vessel behavior confirms consistency with the fastest real transits while exhibiting 23.1x lower variance. Crucially, PIER is forecast-independent: unlike A* path optimization whose wave protection degrades 4.5x under realistic forecast uncertainty, PIER maintains constant performance using only local observations. The framework combines physics-informed state construction, demonstration-augmented offline data, and a decoupled post-hoc safety shield, an architecture that transfers to wildfire evacuation, aircraft trajectory optimization, and autonomous
navigation in unmapped terrain.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AR
ReLMXEL: Adaptive RL-Based Memory Controller with Explainable Energy and Latency Optimization
Panuganti Chirag Sai, Gandholi Sarat, R. Raghunatha Sarma et al. (+2 more)
Reducing latency and energy consumption is critical to improving the efficiency of
memory systems in modern computing. This work introduces ReLMXEL (Reinforcement Learning for
Memory Controller with Explainable Energy and Latency Optimization), a explainable multi-
agent online reinforcement learning framework that dynamically optimizes
memory controller parameters using reward decomposition. ReLMXEL operates within the
memory controller, leveraging detailed
memory behavior metrics to guide decision-making. Experimental evaluations across diverse workloads demonstrate consistent performance gains over baseline configurations, with refinements driven by workload-specific
memory access behaviour. By incorporating explainability into the learning process, ReLMXEL not only enhances performance but also increases the transparency of control decisions, paving the way for more accountable and adaptive
memory system designs.
Read the full abstract ▾
All authors Panuganti Chirag Sai, Gandholi Sarat, R. Raghunatha Sarma, Venkata Kalyan Tavva, Naveen M
Machine Learning · Cross-listed from cs.AI
Contrastive Reasoning Alignment: Reinforcement Learning from Hidden Representations
Haozheng Luo, Yimin Wang, Jiahao Yu et al. (+2 more)
We propose CRAFT, a red-teaming
alignment framework that leverages model
reasoning capabilities and hidden representations to improve robustness against jailbreak attacks. Unlike prior defenses that operate primarily at the output level, CRAFT aligns large
reasoning models to generate safety-aware
reasoning traces by explicitly optimizing objectives defined over the hidden state space. Methodologically, CRAFT integrates contrastive representation learning with reinforcement learning to separate safe and unsafe
reasoning trajectories, yielding a latent-space geometry that supports robust,
reasoning-level safety
alignment. Theoretically, we show that incorporating latent-textual consistency into GRPO eliminates superficially aligned policies by ruling them out as local optima. Empirically, we evaluate CRAFT on multiple safety
benchmarks using two strong
reasoning models, Qwen3-4B-Thinking and R1-Distill-Llama-8B, where it consistently outperforms state-of-the-art defenses such as IPO and SafeKey. Notably, CRAFT delivers an average 79.0% improvement in
reasoning safety and 87.7% improvement in final-response safety over the base models, demonstrating the effectiveness of hidden-space
reasoning alignment.
Read the full abstract ▾
All authors Haozheng Luo, Yimin Wang, Jiahao Yu, Binghui Wang, Yan Chen
Machine Learning
WINFlowNets: Warm-up Integrated Networks Training of Generative Flow Networks for Robotics and Machine Fault Adaptation
Zahin Sufiyan, Shadan Golestan, Yoshihiro Mitsuka et al. (+2 more)
Generative Flow Networks for continuous scenarios (CFlowNets) have shown promise in solving sequential decision-making tasks by learning
stochastic policies using a flow and a
retrieval network. Despite their demonstrated efficiency compared to state-of-the-art Reinforcement Learning (RL)
algorithms, their practical application in robotic control tasks is constrained by the reliance on pre-training the
retrieval network. This dependency poses challenges in dynamic robotic environments, where pre-training data may not be readily available or representative of the current environment. This paper introduces WINFlowNets, a novel CFlowNets framework that enables the co-training of flow and
retrieval networks. WINFlowNets begins with a warm-up phase for the
retrieval network to bootstrap its policy, followed by a shared training architecture and a shared replay buffer for co-training both networks. Experiments in simulated robotic environments demonstrate that WINFlowNets surpasses CFlowNets and state-of-the-art RL
algorithms in terms of average reward and training stability. Furthermore, WINFlowNets exhibits strong adaptive capability in fault environments, making it suitable for tasks that demand quick adaptation with limited sample data. These findings highlight WINFlowNets' potential for deployment in dynamic and malfunction-prone robotic systems, where traditional pre-training or sample inefficient data collection may be impractical.
Read the full abstract ▾
All authors Zahin Sufiyan, Shadan Golestan, Yoshihiro Mitsuka, Shotaro Miwa, Osmar Zaiane
Machine Learning
Classifier Pooling for Modern Ordinal Classification
Noam H. Rotenberg, Andreia V. Faria and Brian Caffo
Ordinal data is widely prevalent in clinical and other domains, yet there is a lack of both modern, machine-learning based methods and publicly available software to address it. In this paper, we present a model-agnostic method of ordinal classification, which can apply any non-ordinal classification method in an ordinal fashion. We also provide an open-source implementation of these
algorithms, in the form of a Python package. We apply these models on multiple real-world
datasets to show their performance across domains. We show that they often outperform non-ordinal classification methods, especially when the number of datapoints is relatively small or when there are many classes of outcomes. This work, including the developed software, facilitates the use of modern, more powerful machine learning
algorithms to handle ordinal data.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ME
Wasserstein-type Gaussian Process Regressions for Input Measurement Uncertainty
Hengrui Luo, Xiaoye S. Li, Yang Liu et al. (+3 more)
Gaussian process (GP) regression is widely used for uncertainty quantification, yet the standard formulation assumes noise-free
covariates. When inputs are measured with error, this errors-in-variables (EIV) setting can lead to optimistically narrow posterior intervals and biased decisions. We study GP regression under input measurement uncertainty by representing each noisy input as a probability measure and defining covariance through Wasserstein distances between these measures. Building on this perspective, we instantiate a deterministic projected Wasserstein ARD (PWA) kernel whose one-dimensional components admit closed-form expressions and whose product structure yields a scalable, positive-definite kernel on distributions. Unlike latent-input GP models, PWA-based GPs (\PWAGPs) handle input noise without introducing unobserved
covariates or Monte Carlo projections, making uncertainty quantification more transparent and robust.
Read the full abstract ▾
All authors Hengrui Luo, Xiaoye S. Li, Yang Liu, Marcus Noack, Ji Qiang, Mark D. Risser
Machine Learning
Variational Rectification Inference for Learning with Noisy Labels
Haoliang Sun, Qi Wei, Lei Feng et al. (+4 more)
Label noise has been broadly observed in real-world
datasets. To mitigate the negative impact of overfitting to label noise for deep models, effective strategies (e.g., re-weighting, or loss rectification) have been broadly applied in prevailing approaches, which have been generally learned under the meta-learning scenario. Despite the robustness of noise achieved by the probabilistic meta-learning models, they usually suffer from model collapse that degenerates generalization performance. In this paper, we propose variational rectification inference (VRI) to formulate the adaptive rectification for loss functions as an amortized variational inference problem and derive the evidence lower bound under the meta-learning framework. Specifically, VRI is constructed as a hierarchical Bayes by treating the rectifying vector as a latent variable, which can rectify the loss of the noisy sample with the extra randomness regularization and is, therefore, more robust to label noise. To achieve the inference of the rectifying vector, we approximate its conditional posterior with an amortization meta-network. By introducing the variational term in VRI, the conditional posterior is estimated accurately and avoids collapsing to a Dirac delta function, which can significantly improve the generalization performance. The elaborated meta-network and prior network adhere to the smoothness assumption, enabling the generation of reliable rectification vectors. Given a set of clean meta-data, VRI can be efficiently meta-learned within the bi-level optimization programming. Besides, theoretical analysis guarantees that the meta-network can be efficiently learned with our
algorithm. Comprehensive comparison experiments and analyses validate its effectiveness for robust learning with noisy labels, particularly in the presence of open-set noise.
Read the full abstract ▾
All authors Haoliang Sun, Qi Wei, Lei Feng, Yupeng Hu, Fan Liu, Hehe Fan, Yilong Yin
Machine Learning
Pathology-Aware Multi-View Contrastive Learning for Patient-Independent ECG Reconstruction
Youssef Youssef and Jitin Singla
Reconstructing a 12-lead electrocardiogram (ECG) from a reduced lead set is an ill-posed inverse problem due to anatomical variability. Standard deep learning methods often ignore underlying cardiac pathology losing vital morphology in precordial leads. We propose Pathology-Aware Multi-View Contrastive Learning, a framework that regularizes the latent space through a pathological
manifold. Our architecture integrates high-fidelity time-domain waveforms with pathology-aware
embeddings learned via supervised contrastive
alignment. By maximizing mutual information between latent representations and clinical labels, the framework learns to filter anatomical "nuisance" variables. On the PTB-XL
dataset, our method achieves approx. 76% reduction in RMSE compared to state-of-the-art model in patient-independent setting. Cross-
dataset evaluation on the PTB Diagnostic Database confirms superior generalization, bridging the gap between hardware portability and diagnostic-grade reconstruction.
Read the full abstract ▾
Machine Learning
Binary Latent Protein Fitness Landscapes for Quantum Annealing Optimization
Truong-Son Hy
We propose Q-BIOLAT, a framework for modeling and optimizing
protein fitness landscapes in binary latent spaces. Starting from
protein sequences, we leverage pretrained
protein language models to obtain continuous
embeddings, which are then transformed into compact binary latent representations. In this space,
protein fitness is approximated using a quadratic unconstrained binary optimization (QUBO) model, enabling efficient combinatorial search via classical heuristics such as simulated annealing and genetic
algorithms. On the ProteinGym
benchmark, we demonstrate that Q-BIOLAT captures meaningful structure in
protein fitness landscapes and enables the identification of high-fitness variants. Despite using a simple binarization scheme, our method consistently retrieves sequences whose nearest neighbors lie within the top fraction of the training fitness distribution, particularly under the strongest configurations. We further show that different optimization strategies exhibit distinct behaviors, with evolutionary search performing better in higher-dimensional latent spaces and local search remaining competitive in preserving realistic sequences. Beyond its empirical performance, Q-BIOLAT provides a natural bridge between
protein representation learning and combinatorial optimization. By formulating
protein fitness as a QUBO problem, our framework is directly compatible with emerging
quantum annealing hardware, opening new directions for
quantum-assisted
protein engineering. Our implementation is publicly available at: https://github.com/HySonLab/Q-BIOLAT
Read the full abstract ▾
Machine Learning
On the Cone Effect and Modality Gap in Medical Vision-Language Embeddings
David Restrepo, Miguel L Martins, Chenwei Wu et al. (+5 more)
Vision-
Language Models (VLMs) exhibit a characteristic "cone effect" in which nonlinear encoders map
embeddings into highly concentrated regions of the representation space, contributing to cross-modal separation known as the modality gap. While this phenomenon has been widely observed, its practical impact on supervised
multimodal learning – particularly in medical domains – remains unclear. In this work, we introduce a lightweight post-hoc mechanism that keeps pretrained VLM encoders frozen while continuously controlling cross-modal separation through a single hyperparameter {{\lambda}}. This enables systematic analysis of how the modality gap affects downstream
multimodal performance without expensive retraining. We evaluate generalist (CLIP, SigLIP) and medically specialized (BioMedCLIP, MedSigLIP) models across diverse medical and natural
datasets in a supervised
multimodal settings. Results consistently show that reducing excessive modality gap improves downstream performance, with medical
datasets exhibiting stronger sensitivity to gap modulation; however, fully collapsing the gap is not always optimal, and intermediate, task-dependent separation yields the best results. These findings position the modality gap as a tunable property of
multimodal representations rather than a quantity that should be universally minimized.
Read the full abstract ▾
All authors David Restrepo, Miguel L Martins, Chenwei Wu, Luis Filipe Nakayama, Diego M Lopez, Stergios Christodoulidis, Maria Vakalopoulou, Enzo Ferrante
Machine Learning · Cross-listed from cs.CV
From Drop-off to Recovery: A Mechanistic Analysis of Segmentation in MLLMs
Boyong Wu, Sanghwan Kim and Zeynep Akata
Multimodal Large
Language Models (MLLMs) are increasingly applied to pixel-level
vision tasks, yet their intrinsic capacity for spatial understanding remains poorly understood. We investigate
segmentation capacity through a layerwise linear probing evaluation across the entire MLLM pipeline:
vision encoder, adapter, and LLM. We further conduct an intervention based
attention knockout analysis to test whether cross-
token attention progressively refines visual representations, and an evaluation of bidirectional
attention among image
tokens on spatial consistency. Our analysis reveals that the adapter introduces a
segmentation representation drop-off, but LLM layers progressively recover through
attention-mediated refinement, where correctly classified
tokens steer misclassified neighbors toward the correct label. At early image
token positions, this recovery is bounded by causal
attention, which bidirectional
attention among image
tokens alleviates. These findings provide a mechanistic account of how MLLMs process visual information for
segmentation, informing the design of future
segmentation-capable models.
Read the full abstract ▾