Machine Learning · Cross-listed from q-bio.BM
Reinforcement-guided generative protein language models enable de novo design of highly diverse AAV capsids
Lucas Ferraz, Ana F. Rodrigues, Pedro Giesteira Cotovio et al. (+5 more)
Adeno-associated viral (AAV) vectors are widely used delivery platforms in gene therapy, and the design of improved capsids is key to expanding their therapeutic potential. A central challenge in AAV bioengineering, as in
protein design more broadly, is the vast sequence design space relative to the scale of feasible experimental screening. Machine-guided generative approaches provide a powerful means of navigating this landscape and proposing novel
protein sequences that satisfy functional constraints. Here, we develop a generative design framework based on
protein language models and reinforcement learning to generate highly novel yet functionally plausible AAV capsids. A pretrained model was fine-tuned on experimentally validated capsid sequences to learn patterns associated with viability. Reinforcement learning was then used to guide sequence generation, with a reward function that jointly promoted predicted viability and sequence novelty, thereby enabling exploration beyond regions represented in the training data. Comparative analyses showed that fine-tuning alone produces sequences with high predicted viability but remains biased toward the training distribution, whereas reinforcement learining-guided generation reaches more distant regions of sequence space while maintaining high predicted viability. Finally, we propose a candidate selection strategy that integrates predicted viability, sequence novelty, and biophysical properties to prioritize variants for downstream evaluation. This work establishes a framework for the generative exploration of
protein sequence space and advances the application of generative
protein language models to AAV bioengineering.
Read the full abstract ▾
All authors Lucas Ferraz, Ana F. Rodrigues, Pedro Giesteira Cotovio, Mafalda Ventura, Gabriela Silva, Ana Sofia Coroadinha, Miguel Machuqueiro, Catia Pesquita
Machine Learning
Adaptive Layerwise Perturbation: Unifying Off-Policy Corrections for LLM RL
Chenlu Ye, Xuanchang Zhang, Yifan Hao et al. (+6 more)
Off-policy problems such as policy staleness and training–inference mismatch have become a major bottleneck for training stability and further exploration in LLM RL. The distribution gap between the inference and updated policies grows because of the techniques to enhance inference efficiency, leading to heavy-tailed importance ratios. Heavy-tailed ratios arise when the policy is locally sharp, which further inflates gradients and can push updates outside the trust region. To address this, we propose Adaptive Layerwise Perturbation (ALP), which injects small learnable perturbations into the input hidden states of each layer during updates and uses the resulting perturbed policy as the numerator of the importance ratio against the unchanged inference policy in the objective. Intuitively, by adding controlled noise to intermediate representations, ALP prevents the updated policy from deviating too sharply from the inference policy and enlarges the policy family to cover inference-time mismatch noise. Hence, the flattened distribution can naturally tighten the gap between the updated and inference policies and reduce the tail of importance ratios, thus maintaining training stability. This is further validated empirically. Experiments on single-turn math and multi-turn tool-integrated
reasoning tasks show that ALP not only improves final performance, but also avoids blow-up in the importance-ratio tail and KL spikes during iterative training, along with boosted exploration. Ablations show that representation-level perturbations across all layers are most effective, substantially outperforming partial-layer and logits-only variants.
Read the full abstract ▾
All authors Chenlu Ye, Xuanchang Zhang, Yifan Hao, Zhou Yu, Ziji Zhang, Abhinav Gullapalli, Hao Chen, Jing Huang, Tong Zhang
Machine Learning
Global Convergence of Multiplicative Updates for the Matrix Mechanism: A Collaborative Proof with Gemini 3
Keith Rush
We analyze a fixed-point iteration $v \leftarrow \phi(v)$ arising in the optimization of a regularized
nuclear norm objective involving the Hadamard product structure, posed in DMR+22 in the context of an optimization problem over the space of
algorithms in private machine learning. We prove that the iteration $v^{(k+1)} = \text{diag}((D_{v^{(k)}}^{1/2} M D_{v^{(k)}}^{1/2})^{1/2})$ converges monotonically to the unique global optimizer of the potential function $J(v) = 2 \text{Tr}((D_v^{1/2} M D_v^{1/2})^{1/2}) - \sum v_i$, closing a problem left open there. The bulk of this proof was provided by Gemini 3, subject to some corrections and interventions. Gemini 3 also sketched the initial version of this note. Thus, it represents as much a commentary on the practical use of AI in mathematics as it represents the closure of a small gap in the literature. As such, we include a small narrative description of the prompting process, and some resulting principles for working with AI to prove mathematics.
Read the full abstract ▾
Machine Learning
Deep Hilbert–Galerkin Methods for Infinite-Dimensional PDEs and Optimal Control
Samuel N. Cohen, Filippo de Feo, Jackson Hebner et al. (+1 more)
We develop deep learning-based approximation methods for fully nonlinear second-order PDEs on separable
Hilbert spaces, such as HJB equations for infinite-dimensional control, by parameterizing solutions via
Hilbert–Galerkin Neural Operators (HGNOs). We prove the first Universal Approximation
Theorems (UATs) which are sufficiently powerful to address these problems, based on novel
topologies for Hessian terms and corresponding novel continuity assumptions on the fully nonlinear operator. These
topologies are non-sequential and non-metrizable, making the problem delicate. In particular, we prove UATs for functions on
Hilbert spaces, together with their Fréchet derivatives up to second order, and for unbounded operators applied to the first derivative, ensuring that HGNOs are able to approximate all the PDE terms. For control problems, we further prove UATs for optimal feedback controls in terms of our approximating value function HGNO. We develop numerical training methods, which we call Deep
Hilbert–Galerkin and
Hilbert Actor-Critic (reinforcement learning) Methods, for these problems by minimizing the $L^2_\mu(H)$-norm of the residual of the PDE on the whole
Hilbert space, not just a projected PDE to finite dimensions. This is the first paper to propose such an approach. The models considered arise in many applied sciences, such as functional differential equations in physics and Kolmogorov and HJB PDEs related to controlled PDEs, SPDEs, path-dependent systems, partially observed
stochastic systems, and mean-field SDEs. We numerically solve examples of Kolmogorov and HJB PDEs related to the optimal control of deterministic and
stochastic heat and Burgers' equations, demonstrating the promise of our deep learning-based approach.
Read the full abstract ▾
All authors Samuel N. Cohen, Filippo de Feo, Jackson Hebner, Justin Sirignano
Machine Learning
GeoLAN: Geometric Learning of Latent Explanatory Directions in Large Language Models
Tianyu Bell Pan and Damon L. Woodard
Large
language models (LLMs) demonstrate strong performance, but they often lack transparency. We introduce GeoLAN, a training framework that treats
token representations as
geometric trajectories and applies stickiness conditions inspired by recent developments related to the Kakeya
Conjecture. We have developed two differentiable regularizers, Katz-Tao Convex Wolff (KT-CW) and Katz-Tao
Attention (KT-Attn), that promote isotropy and encourage diverse
attention. Our experiments with Gemma-3 (1B, 4B, 12B) and Llama-3-8B show that GeoLAN frequently maintains task accuracy while improving
geometric metrics and reducing certain
fairness biases. These benefits are most significant in mid-sized models. Our findings reveal scale-dependent trade-offs between
geometric precision and performance, suggesting that geometry-aware training is a promising approach to enhance mechanistic interpretability.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
Near-Equivalent Q-learning Policies for Dynamic Treatment Regimes
Sophia Yazzourh and Erica E.M. Moodie
Precision medicine aims to tailor therapeutic decisions to individual patient characteristics. This objective is commonly formalized through dynamic treatment regimes, which use statistical and machine learning methods to derive sequential decision rules adapted to evolving clinical information. In most existing formulations, these approaches produce a single optimal treatment at each stage, leading to a unique decision sequence. However, in many clinical settings, several treatment options may yield similar expected outcomes, and focusing on a single optimal policy may conceal meaningful alternatives. We extend the Q-learning framework for retrospective data by introducing a worst-value tolerance criterion controlled by a hyperparameter $\varepsilon$, which specifies the maximum acceptable deviation from the optimal expected value. Rather than identifying a single optimal policy, the proposed approach constructs sets of $\varepsilon$-optimal policies whose performance remains within a controlled neighborhood of the optimum. This formulation shifts Q-learning from a vector-valued representation to a
matrix-valued one, allowing multiple admissible value functions to coexist during backward recursion. The approach yields families of near-equivalent treatment strategies and explicitly identifies regions of treatment indifference where several decisions achieve comparable outcomes. We illustrate the framework in two settings: a single-stage problem highlighting indifference regions around the decision boundary, and a multi-stage decision process based on a simulated oncology model describing tumor size and treatment toxicity dynamics.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
Subspace Projection Methods for Fast Spectral Embeddings of Evolving Graphs
Mohammad Eini, Abdullah Karaaslanli, Vassilis Kalantzis et al. (+1 more)
Several graph data mining, signal processing, and machine learning downstream tasks rely on information related to the eigenvectors of the associated adjacency or
Laplacian matrix. Classical eigendecomposition methods are powerful when the
matrix remains static but cannot be applied to problems where the
matrix entries are updated or the number of rows and columns increases frequently. Such scenarios occur routinely in graph analytics when the graph is changing dynamically and either edges and/or nodes are being added and removed. This paper puts forth a new algorithmic framework to update the eigenvectors associated with the leading
eigenvalues of an initial adjacency or
Laplacian matrix as the graph evolves dynamically. The proposed
algorithm is based on Rayleigh-Ritz projections, in which the original
eigenvalue problem is projected onto a restricted subspace which ideally encapsulates the invariant subspace associated with the sought eigenvectors. Following ideas from eigenvector perturbation analysis, we present a new methodology to build the projection subspace. The proposed framework features lower computational and
memory complexity with respect to competitive alternatives while empirical results show strong qualitative performance, both in terms of eigenvector approximation and accuracy of downstream learning tasks of central node identification and node clustering.
Read the full abstract ▾
All authors Mohammad Eini, Abdullah Karaaslanli, Vassilis Kalantzis, Panagiotis A. Traganitis
Machine Learning · Cross-listed from cs.CL
Vocabulary shapes cross-lingual variation of word-order learnability in language models
Jonas Mayer Martins, Jaap Jumelet, Viola Priesemann et al. (+1 more)
Why do some
languages like Czech permit free word order, while others like English do not? We address this question by pretraining
transformer language models on a spectrum of synthetic word-order variants of natural
languages. We observe that greater word-order irregularity consistently raises model surprisal, indicating reduced learnability. Sentence reversal, however, affects learnability only weakly. A coarse distinction of free- (e.g., Czech and Finnish) and fixed-word-order
languages (e.g., English and French) does not explain cross-lingual variation. Instead, the structure of the word and subword vocabulary strongly predicts the model surprisal. Overall, vocabulary structure emerges as a key driver of computational word-order learnability across
languages.
Read the full abstract ▾
All authors Jonas Mayer Martins, Jaap Jumelet, Viola Priesemann, Lisa Beinborn
Machine Learning · Cross-listed from cs.CR
The Autonomy Tax: Defense Training Breaks LLM Agents
Shawn Li and Yue Zhao
Large
language model (LLM)
agents increasingly rely on external tools (file operations, API calls, database transactions) to autonomously complete complex multi-step tasks. Practitioners deploy defense-trained models to protect against
prompt injection attacks that manipulate
agent behavior through malicious observations or retrieved content. We reveal a fundamental capability-
alignment paradox: defense training designed to improve safety systematically destroys
agent competence while failing to prevent sophisticated attacks. Evaluating defended models against undefended baselines across 97
agent tasks and 1,000
adversarial prompts, we uncover three systematic biases unique to multi-step
agents.
Agent incompetence bias manifests as immediate tool execution breakdown, with models refusing or generating invalid actions on benign tasks before observing any external content. Cascade amplification bias causes early failures to propagate through retry loops, pushing defended models to timeout on 99% of tasks compared to 13% for baselines. Trigger bias leads to paradoxical security degradation where defended models perform worse than undefended baselines while straightforward attacks bypass defenses at high rates. Root cause analysis reveals these biases stem from shortcut learning: models overfit to surface attack patterns rather than semantic threat understanding, evidenced by extreme variance in defense effectiveness across attack categories. Our findings demonstrate that current defense paradigms optimize for single-turn refusal
benchmarks while rendering multi-step
agents fundamentally unreliable, necessitating new approaches that preserve tool execution competence under
adversarial conditions.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
Pseudo-Labeling for Unsupervised Domain Adaptation with Kernel GLMs
Nathan Weill and Kaizheng Wang
We propose a principled framework for unsupervised domain adaptation under
covariate shift in kernel Generalized Linear Models (GLMs), encompassing kernelized linear, logistic, and Poisson regression with ridge regularization. Our goal is to minimize prediction error in the target domain by leveraging labeled source data and unlabeled target data, despite differences in
covariate distributions. We partition the labeled source data into two batches: one for training a family of candidate models, and the other for building an imputation model. This imputation model generates pseudo-labels for the target data, enabling robust model selection. We establish non-asymptotic excess-risk bounds that characterize adaptation performance through an "effective labeled sample size", explicitly accounting for the unknown
covariate shift. Experiments on synthetic and real
datasets demonstrate consistent performance gains over source-only baselines.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CL
Scalable Prompt Routing via Fine-Grained Latent Task Discovery
Yunyi Zhang, Soji Adeshina, Sheng Guan et al. (+5 more)
Prompt routing dynamically selects the most appropriate large
language model from a pool of candidates for each query, optimizing performance while managing costs. As model pools scale to include dozens of frontier models with narrow performance gaps, existing approaches face significant challenges: manually defined task taxonomies cannot capture fine-grained capability distinctions, while monolithic routers struggle to differentiate subtle differences across diverse tasks. We propose a two-stage routing architecture that addresses these limitations through automated fine-grained task discovery and task-aware quality estimation. Our first stage employs graph-based clustering to discover latent task types and trains a classifier to assign
prompts to discovered tasks. The second stage uses a mixture-of-experts architecture with task-specific prediction heads for specialized quality estimates. At inference, we aggregate predictions from both stages to balance task-level stability with
prompt-specific adaptability. Evaluated on 10
benchmarks with 11 frontier models, our method consistently outperforms existing baselines and surpasses the strongest individual model while incurring less than half its cost.
Read the full abstract ▾
All authors Yunyi Zhang, Soji Adeshina, Sheng Guan, Ashwin Ganesh, Zhen Han, Vassilis N. Ioannidis, Huzefa Rangwala, George Karypis
Machine Learning
Optimizing Resource-Constrained Non-Pharmaceutical Interventions for Multi-Cluster Outbreak Control Using Hierarchical Reinforcement Learning
Xueqiao Peng and Andrew Perrault
Non-pharmaceutical interventions (NPIs), such as diagnostic testing and quarantine, are crucial for controlling infectious disease outbreaks but are often constrained by limited resources, particularly in early outbreak stages. In real-world public health settings, resources must be allocated across multiple outbreak clusters that emerge asynchronously, vary in size and risk, and compete for a shared resource budget. Here, a cluster corresponds to a group of close contacts generated by a single infected index case. Thus, decisions must be made under uncertainty and heterogeneous demands, while respecting operational constraints. We formulate this problem as a constrained restless multi-armed bandit and propose a hierarchical reinforcement learning framework. A global controller learns a continuous action cost multiplier that adjusts global resource demand, while a generalized local policy estimates the marginal value of allocating resources to individuals within each cluster. We evaluate the proposed framework in a realistic
agent-based simulator of SARS-CoV-2 with dynamically arriving clusters. Across a wide range of system scales and testing budgets, our method consistently outperforms RMAB-inspired and heuristic baselines, improving outbreak control effectiveness by 20%-30%. Experiments on up to 40 concurrently active clusters further demonstrate that the hierarchical framework is highly scalable and enables faster decision-making than the RMAB-inspired method.
Read the full abstract ▾
Machine Learning · Cross-listed from eess.SY
Bridging Conformal Prediction and Scenario Optimization: Discarded Constraints and Modular Risk Allocation
Giuseppe C. Calafiore
Scenario optimization and conformal prediction share a common goal, that is, turning finite samples into safety margins. Yet, different terminology often obscures the connection between their respective guarantees. This paper revisits that connection directly from a systems-and-control viewpoint. Building on the recent conformal/scenario bridge of \citet{OSullivanRomaoMargellos2026}, we extend the forward direction to feasible sample-and-discard scenario
algorithms. Specifically, if the final decision is determined by a stable subset of the retained sampled constraints, the classical mean violation law admits a direct exchangeability-based derivation. In this view, discarded samples naturally appear as admissible exceptions. We also introduce a simple modular composition rule that combines several blockwise calibration certificates into a single joint guarantee. This rule proves particularly useful in multi-output prediction and finite-horizon control, where engineers must distribute risk across coordinates, constraints, or prediction steps. Finally, we provide numerical illustrations using a calibrated multi-step tube around an identified predictor. These examples compare alternative stage-wise risk allocations and highlight the resulting performance and safety trade-offs in a standard constraint-tightening problem.
Read the full abstract ▾
Machine Learning · Cross-listed from eess.IV
TuLaBM: Tumor-Biased Latent Bridge Matching for Contrast-Enhanced MRI Synthesis
Atharva Rege, Adinath Madhavrao Dukre, Numan Balci et al. (+2 more)
Contrast-enhanced
magnetic resonance imaging (CE-MRI) plays a crucial role in
brain tumor assessment; however, its acquisition requires gadolinium-based contrast
agents (GBCAs), which increase costs and raise safety concerns. Consequently, synthesizing CE-MRI from non-contrast MRI (NC-MRI) has emerged as a promising alternative. Early Generative
Adversarial Network (GAN)-based approaches suffered from instability and mode collapse, while
diffusion models, despite impressive synthesis quality, remain computationally expensive and often fail to faithfully reproduce critical tumor contrast patterns. To address these limitations, we propose Tumor-Biased Latent Bridge Matching (TuLaBM), which formulates NC-to-CE MRI translation as Brownian bridge transport between source and target distributions in a learned latent space, enabling efficient training and inference. To enhance tumor-region fidelity, we introduce a Tumor-Biased
Attention Mechanism (TuBAM) that amplifies tumor-relevant latent features during bridge
evolution, along with a boundary-aware loss that constrains tumor interfaces to improve margin sharpness. While bridge matching has been explored for medical image translation in pixel space, our latent formulation substantially reduces computational cost and inference time. Experiments on BraTS2023-GLI (BraSyn) and Cleveland Clinic (in-house) liver MRI
dataset show that TuLaBM consistently outperforms state-of-the-art baselines on both whole-image and tumor-region metrics, generalizes effectively to unseen liver MRI data in zero-shot and fine-tuned settings, and achieves inference times under 0.097 seconds per image.
Read the full abstract ▾
All authors Atharva Rege, Adinath Madhavrao Dukre, Numan Balci, Dwarikanath Mahapatra, Imran Razzak
Machine Learning · Cross-listed from cs.CR
Automated Membership Inference Attacks (AutoMIA): Discovering MIA Signal Computations using LLM Agents
Toan Tran, Olivera Kotevska and Li Xiong
Membership inference attacks (MIAs), which enable adversaries to determine whether specific data points were part of a model's training
dataset, have emerged as an important framework to understand, assess, and quantify the potential information leakage associated with machine learning systems. Designing effective MIAs is a challenging task that usually requires extensive manual exploration of model behaviors to identify potential vulnerabilities. In this paper, we introduce AutoMIA – a novel framework that leverages large
language model (LLM)
agents to automate the design and implementation of new MIA signal computations. By utilizing LLM
agents, we can systematically explore a vast space of potential attack strategies, enabling the discovery of novel strategies. Our experiments demonstrate AutoMIA can successfully discover new MIAs that are specifically tailored to user-configured target model and
dataset, resulting in improvements of up to 0.18 in absolute AUC over existing MIAs. This work provides the first demonstration that LLM
agents can serve as an effective and scalable paradigm for designing and implementing MIAs with SOTA performance, opening up new avenues for future exploration.
Read the full abstract ▾
Machine Learning
Warm-Start Flow Matching for Guaranteed Fast Text/Image Generation
Minyoung Kim
Current auto-regressive (AR) LLMs,
diffusion-based text/image generative models, and recent flow matching (FM)
algorithms are capable of generating premium quality text/image samples. However, the inference or sample generation in these models is often very time-consuming and computationally demanding, mainly due to large numbers of function evaluations corresponding to the lengths of
tokens or the numbers of
diffusion steps. This also necessitates heavy GPU resources, time, and electricity. In this work we propose a novel solution to reduce the sample generation time of flow matching
algorithms by a guaranteed speed-up factor, without sacrificing the quality of the generated samples. Our key idea is to utilize computationally lightweight generative models whose generation time is negligible compared to that of the target AR/FM models. The draft samples from a lightweight model, whose quality is not satisfactory but fast to generate, are regarded as an initial distribution for a FM
algorithm. Unlike conventional usage of FM that takes a pure noise (e.g., Gaussian or uniform) initial distribution, the draft samples are already of decent quality, so we can set the starting time to be closer to the end time rather than 0 in the pure noise FM case. This will significantly reduce the number of time steps to reach the target data distribution, and the speed-up factor is guaranteed. Our idea, dubbed Warm-Start FM or WS-FM, can essentially be seen as a learning-to-refine generative model from low-quality draft samples to high-quality samples. As a proof of concept, we demonstrate the idea on some synthetic toy data as well as real-world text and image generation tasks, illustrating that our idea offers guaranteed speed-up in sample generation without sacrificing the quality of the generated samples.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CR
A Novel Solution for Zero-Day Attack Detection in IDS using Self-Attention and Jensen-Shannon Divergence in WGAN-GP
Ziyu Mu, Xiyu Shi and Safak Dogan
The increasing sophistication of cyber threats, especially zero-day attacks, poses a significant challenge to cybersecurity. Zero-day attacks exploit unknown vulnerabilities, making them difficult to detect and defend against. Existing approaches patch flaws and deploy an Intrusion Detection System (IDS). Using advanced Wasserstein GANs with Gradient Penalty (WGAN-GP), this paper makes a novel proposition to synthesize network traffic that mimics zero-day patterns, enriching data diversity and improving IDS generalization. SA-WGAN-GP is first introduced, which adds a Self-
Attention (SA) mechanism to capture long-range cross-feature dependencies by reshaping the feature vector into
tokens after dense projections. A JS-WGAN-GP is then proposed, which adds a Jensen-Shannon (JS) divergence-based auxiliary discriminator that is trained with Binary Cross-
Entropy (BCE), frozen during updates, and used to regularize the generator for smoother gradients and higher sample quality. Third, SA-JS-WGAN-GP is created by combining the SA mechanism with JS divergence, thereby enhancing the data generation ability of WGAN-GP. As data augmentation does not equate with true zero-day attack discovery, we emulate zero-day attacks via the leave-one-attack-type-out method on the NSL-KDD
dataset for training all GANs and IDS models in the assessment of the effectiveness of the proposed solution. The evaluation results show that integrating SA and JS divergence into WGAN-GP yields superior IDS performance and more effective zero-day risk detection.
Read the full abstract ▾
Machine Learning
A Mathematical Theory of Understanding
Bahar Taşkesen
Generative AI has transformed the economics of information production, making explanations, proofs, examples, and analyses available at very low cost. Yet the value of information still depends on whether downstream users can absorb and act on it. A signal conveys meaning only to a learner with the structural capacity to decode it: an explanation that clarifies a concept for one user may be indistinguishable from noise to another who lacks the relevant prerequisites. This paper develops a mathematical model of that learner-side bottleneck. We model the learner as a mind, an abstract learning system characterized by a prerequisite structure over concepts. A mind may represent a human learner, an artificial learner such as a neural network, or any
agent whose ability to interpret signals depends on previously acquired concepts. Teaching is modeled as sequential communication with a latent target. Because instructional signals are usable only when the learner has acquired the prerequisites needed to parse them, the effective communication channel depends on the learner's current state of knowledge and becomes more informative as learning progresses. The model yields two limits on the speed of learning and adoption: a structural limit determined by prerequisite reachability and an epistemic limit determined by uncertainty about the target. The framework implies threshold effects in training and capability acquisition. When the teaching horizon lies below the prerequisite depth of the target, additional instruction cannot produce successful completion of teaching; once that depth is reached, completion becomes feasible. Across heterogeneous learners, a common broadcast curriculum can be slower than personalized instruction by a factor linear in the number of learner types.
Read the full abstract ▾
Machine Learning
Tomasz Wietrzykowski
Current
transformer language models are trained with uniform computational budgets across all layers, implicitly assuming layer homogeneity. We challenge this assumption through empirical analysis of SmolLM2-135M, a 30-layer, 135M-parameter causal
language model, using five diagnostic metrics: weight predictability (R2), ablation degradation, recovery speed, weight manipulation robustness, and structural analysis. We find profound anatomical heterogeneity: (1) Layer weights follow strong mathematical regularity (R2 = 0.91) with a universal oscillatory delta pattern (correlation ~= -0.50), yet predicted weights cause catastrophic failure due to nonlinear error accumulation. (2) Layer importance spans a 10^7 range, from a critical core (L8-11, up to +63,419% PPL degradation) to anti-layers (L14, L17) whose removal improves performance. (3) Recovery speed correlates with layer importance, indicating differential training requirements. (4) Only weight scaling (alpha = 0.9) preserves model quality among five tested manipulation strategies. (5) Growth
Transformer Training, allocating budget by layer importance, achieves ~54% cost reduction. A proof-of-concept experiment confirms this: 4.7x lower validation loss than uniform training at identical parameter count, while being 13% faster.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AR
Exploring the Agentic Frontier of Verilog Code Generation
Patrick Yubeaton, Siddharth Garg and Chinmay Hegde
Large
language models (LLMs) have made rapid advancements in code generation for popular
languages such as Python and C++. Many of these recent gains can be attributed to the use of “
agents” that wrap domain-relevant tools alongside LLMs. Hardware design
languages such as Verilog have also seen improved code generation in recent years, but the impact of agentic frameworks on Verilog code generation tasks remains unclear. In this work, we present the first systematic evaluation of agentic LLMs for Verilog generation, using the recently introduced CVDP
benchmark. We also introduce several open-source hardware design
agent harnesses, providing a model-agnostic baseline for future work. Through controlled experiments across frontier models, we study how structured prompting and tool design affect performance, analyze
agent failure modes and tool usage patterns, compare open-source and closed-source models, and provide qualitative examples of successful and failed
agent runs. Our results show that naive agentic wrapping around frontier models can degrade performance (relative to standard forward passes with optimized
prompts), but that structured harnesses meaningfully match and in some cases exceed non-agentic baselines. We find that the performance gap between open and closed source models is driven by both higher crash rates and weaker tool output interpretation. Our exploration illuminates the path towards designing special-purpose
agents for verilog generation in the future.
Read the full abstract ▾
Machine Learning
Beyond Weighted Summation: Learnable Nonlinear Aggregation Functions for Robust Artificial Neurons
Berke Deniz Bozyigit
Weighted summation has remained the default input aggregation mechanism in artificial
neurons since the earliest neural network models. While computationally efficient, this design implicitly behaves like a mean-based
estimator and is therefore sensitive to noisy or extreme inputs. This paper investigates whether replacing fixed linear aggregation with learnable nonlinear alternatives can improve neural network robustness without sacrificing trainability. Two differentiable aggregation mechanisms are introduced: an F-Mean
neuron based on a learnable power-weighted aggregation rule, and a Gaussian Support
neuron based on distance-aware affinity weighting. To preserve the optimisation stability of standard
neurons, hybrid
neurons are proposed that interpolate between linear and nonlinear aggregation through a learnable blending parameter. Evaluated in multilayer perceptrons and convolutional neural networks on CIFAR-10 and a noisy CIFAR-10 variant with additive Gaussian corruption, hybrid
neurons consistently improve robustness under noise while F-Mean hybrids also yield modest gains on clean data. The three-way hybrid achieves robustness scores of up to 0.991 compared to 0.890 for the standard baseline, and learned parameters converge consistently to sub-linear aggregation (p $\approx$ 0.43–0.50) and high novelty utilisation ($\alpha$ $\approx$ 0.69–0.79). These findings suggest that
neuron-level aggregation is a meaningful and underexplored design dimension for building more noise-tolerant neural networks.
Read the full abstract ▾
Machine Learning
DAPA: Distribution Aware Piecewise Activation Functions for On-Device Transformer Inference and Training
Maoyang Xiang and Bo Wang
Non-linear activation functions play a pivotal role in on-device inference and training, as they not only consume substantial hardware resources but also impose a significant impact on system performance and energy efficiency. In this work, we propose Distribution-Aware Piecewise Activation (DAPA), a differentiable and hardware-friendly activation function for
Transformer architectures by exploiting the distribution of pre-activation data. DAPA employs a non-uniform piecewise approximation that allocates finer segments to high-probability regions of the distribution, improving generalizability over prior piecewise linear methods. The resulting approximation is further quantized using Distribution-Weighted Mean Square Error to reduce latency and resource utilization for hardware deployment. Our HLS implementation demonstrates that DAPA speeds up GELU computation by 16$\times$ and decreases DSP utilization by 16$\times$ while maintaining comparable or better performance across
vision Transformers and GPT-2 models.
Read the full abstract ▾
Machine Learning
Do Post-Training Algorithms Actually Differ? A Controlled Study Across Model Scales Uncovers Scale-Dependent Ranking Inversions
Xiaoyi Li
Post-training
alignment has produced dozens of competing
algorithms – DPO, SimPO, KTO, GRPO, and others – yet practitioners lack controlled comparisons to guide
algorithm selection. We present OXRL, a unified framework implementing 51 post-training
algorithms with identical infrastructure, enabling the first large-scale apples-to-apples evaluation. Our study spans 8
algorithms across 4 model scales (0.5B–7B), 3 evaluation domains, and a 20-variant DPO taxonomy (100 runs at 1.5B, 5 seeds each), totaling $\sim$240 training runs on H100 GPUs. Three headline findings emerge. (1)~
Algorithm rankings are unstable across scale: at 1.5B, online RL (SGRPO) tops all methods at 58.0%~$\pm$0.57 on GSM8K; by 7B, the worst small-scale method (SimPO) becomes the best (85.8%), a complete ranking inversion driven by model scale rather than LoRA regularization (confirmed via 2$\times$2 factorial). (2)~Loss function modifications yield negligible gains: none of 20 DPO variants significantly outperform vanilla DPO after Bonferroni correction; the sole significant outlier, SimPO, is worse ($-$11.5~pp, $p < 10^{-4}$). (3)~
Algorithm leverage is task-specific: the 19.3~pp GSM8K spread collapses to 0.54~pp on MATH ($36\times$) and 0.47~pp on general-domain
benchmarks ($41\times$), confirming that
algorithm choice matters primarily within the training distribution. These findings yield a hierarchy of leverage for practitioners: model scale (${\sim}$50~pp) $\gg$ training paradigm (${\sim}$10~pp) $\gg$ online vs.\ offline (${\sim}$9~pp) $\gg$ loss function (${\sim}$1~pp). We release all code, configs, and evaluation data as a living community
benchmark.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.RO
NavTrust: Benchmarking Trustworthiness for Embodied Navigation
Huaide Jiang, Yash Chaudhary, Yuping Wang et al. (+8 more)
There are two major categories of
embodied navigation:
Vision-
Language Navigation (VLN), where
agents navigate by following natural
language instructions; and Object-Goal
Navigation (OGN), where
agents navigate to a specified target object. However, existing work primarily evaluates model performance under nominal conditions, overlooking the potential corruptions that arise in real-world settings. To address this gap, we present NavTrust, a unified
benchmark that systematically corrupts input modalities, including RGB, depth, and instructions, in realistic scenarios and evaluates their impact on
navigation performance. To our best knowledge, NavTrust is the first
benchmark that exposes
embodied navigation agents to diverse RGB-Depth corruptions and instruction variations in a unified framework. Our extensive evaluation of seven state-of-the-art approaches reveals substantial performance degradation under realistic corruptions, which highlights critical robustness gaps and provides a roadmap toward more trustworthy
embodied navigation systems. Furthermore, we systematically evaluate four distinct mitigation strategies to enhance robustness against RGB-Depth and instruction corruptions. Our base models include Uni-NaVid and ETPNav. We deployed them on a real mobile
robot and observed improved robustness to corruptions. The project website is: https://navtrust.github.io/.
Read the full abstract ▾
All authors Huaide Jiang, Yash Chaudhary, Yuping Wang, Zehao Wang, Raghav Sharma, Manan Mehta, Yang Zhou, Lichao Sun, Zhiwen Fan, Zhengzhong Tu, Jiachen Li
Machine Learning · Cross-listed from cs.CV
Spectrally-Guided Diffusion Noise Schedules
Carlos Esteves and Ameesh Makadia
Denoising
diffusion models are widely used for high-quality image and
video generation. Their performance depends on noise schedules, which define the distribution of noise levels applied during training and the sequence of noise levels traversed during sampling. Noise schedules are typically handcrafted and require manual tuning across different resolutions. In this work, we propose a principled way to design per-instance noise schedules for pixel
diffusion, based on the image's spectral properties. By deriving theoretical bounds on the efficacy of minimum and maximum noise levels, we design “tight” noise schedules that eliminate redundant steps. During inference, we propose to conditionally sample such noise schedules. Experiments show that our noise schedules improve generative quality of single-stage pixel
diffusion models, particularly in the low-step regime.
Read the full abstract ▾
Machine Learning
Online Learning and Equilibrium Computation with Ranking Feedback
Mingyang Liu, Yongshan Chen, Zhiyuan Fan et al. (+3 more)
Online learning in arbitrary, and possibly
adversarial, environments has been extensively studied in sequential decision-making, and it is closely connected to
equilibrium computation in game theory. Most existing online learning
algorithms rely on numeric utility feedback from the environment, which may be unavailable in human-in-the-loop applications and/or may be restricted by
privacy concerns. In this paper, we study an online learning model in which the learner only observes a ranking over a set of proposed actions at each timestep. We consider two ranking mechanisms: rankings induced by the instantaneous utility at the current timestep, and rankings induced by the time-average utility up to the current timestep, under both full-information and bandit feedback settings. Using the standard external-regret metric, we show that sublinear regret is impossible with instantaneous-utility ranking feedback in general. Moreover, when the ranking model is relatively deterministic, i.e., under the Plackett-Luce model with a temperature that is sufficiently small, sublinear regret is also impossible with time-average utility ranking feedback. We then develop new
algorithms that achieve sublinear regret under the additional assumption that the utility sequence has sublinear total variation. Notably, for full-information time-average utility ranking feedback, this additional assumption can be removed. As a consequence, when all players in a normal-form game follow our
algorithms, repeated play yields an approximate coarse correlated
equilibrium. We also demonstrate the effectiveness of our
algorithms in an online large-
language-model routing task.
Read the full abstract ▾
All authors Mingyang Liu, Yongshan Chen, Zhiyuan Fan, Gabriele Farina, Asuman Ozdaglar, Kaiqing Zhang
Machine Learning · Cross-listed from cs.CL
Nemotron-Cascade 2: Post-Training LLMs with Cascade RL and Multi-Domain On-Policy Distillation
Zhuolin Yang, Zihan Liu, Yang Chen et al. (+14 more)
We introduce Nemotron-Cascade 2, an open 30B MoE model with 3B activated parameters that delivers best-in-class
reasoning and strong agentic capabilities. Despite its compact size, its mathematical and coding
reasoning performance approaches that of frontier open models. It is the second open-weight LLM, after DeepSeekV3.2-Speciale-671B-A37B, to achieve Gold Medal-level performance in the 2025 International Mathematical Olympiad (IMO), the International Olympiad in Informatics (IOI), and the ICPC World Finals, demonstrating remarkably high intelligence density with 20x fewer parameters. In contrast to Nemotron-Cascade 1, the key technical advancements are as follows. After SFT on a meticulously curated
dataset, we substantially expand Cascade RL to cover a much broader spectrum of
reasoning and agentic domains. Furthermore, we introduce multi-domain on-policy
distillation from the strongest intermediate teacher models for each domain throughout the Cascade RL process, allowing us to efficiently recover
benchmark regressions and sustain strong performance gains along the way. We release the collection of model checkpoint and training data.
Read the full abstract ▾
All authors Zhuolin Yang, Zihan Liu, Yang Chen, Wenliang Dai, Boxin Wang, Sheng-Chieh Lin, Chankyu Lee, Yangyi Chen, Dongfu Jiang, Jiafan He, Renjie Pi, Grace Lam, Nayeon Lee, Alexander Bukharin, Mohammad Shoeybi, Bryan Catanzaro, Wei Ping
Machine Learning · Cross-listed from cs.CV
DriveTok: 3D Driving Scene Tokenization for Unified Multi-View Reconstruction and Understanding
Dong Zhuo, Wenzhao Zheng, Sicheng Zuo et al. (+4 more)
With the growing adoption of
vision-
language-action models and world models in autonomous driving systems, scalable image tokenization becomes crucial as the interface for the visual modality. However, most existing tokenizers are designed for
monocular and 2D scenes, leading to inefficiency and inter-view inconsistency when applied to high-resolution multi-view driving scenes. To address this, we propose DriveTok, an efficient 3D driving scene tokenizer for unified multi-view reconstruction and understanding. DriveTok first obtains semantically rich visual features from
vision foundation models and then transforms them into the scene
tokens with 3D deformable cross-
attention. For decoding, we employ a multi-view
transformer to reconstruct multi-view features from the scene
tokens and use multiple heads to obtain RGB, depth, and semantic reconstructions. We also add a 3D head directly on the scene
tokens for 3D semantic occupancy prediction for better spatial awareness. With the multiple training objectives, DriveTok learns unified scene
tokens that integrate semantic,
geometric, and textural information for efficient multi-view tokenization. Extensive experiments on the widely used nuScenes
dataset demonstrate that the scene
tokens from DriveTok perform well on image reconstruction, semantic
segmentation, depth prediction, and 3D occupancy prediction tasks.
Read the full abstract ▾
All authors Dong Zhuo, Wenzhao Zheng, Sicheng Zuo, Siming Yan, Lu Hou, Jie Zhou, Jiwen Lu
Machine Learning · Cross-listed from cs.CV
DreamPartGen: Semantically Grounded Part-Level 3D Generation via Collaborative Latent Denoising
Tianjiao Yu, Xinzhuo Li, Muntasir Wahed et al. (+4 more)
Understanding and generating 3D objects as compositions of meaningful parts is fundamental to human perception and
reasoning. However, most text-to-3D methods overlook the semantic and functional structure of parts. While recent part-aware approaches introduce decomposition, they remain largely geometry-focused, lacking semantic grounding and failing to model how parts align with textual descriptions or their inter-part relations. We propose DreamPartGen, a framework for semantically grounded, part-aware text-to-3D generation. DreamPartGen introduces Duplex Part Latents (DPLs) that jointly model each part's geometry and appearance, and Relational Semantic Latents (RSLs) that capture inter-part dependencies derived from
language. A synchronized co-denoising process enforces mutual
geometric and semantic consistency, enabling coherent, interpretable, and text-aligned 3D synthesis. Across multiple
benchmarks, DreamPartGen delivers state-of-the-art performance in
geometric fidelity and text-shape
alignment.
Read the full abstract ▾
All authors Tianjiao Yu, Xinzhuo Li, Muntasir Wahed, Jerry Xiong, Yifan Shen, Ying Shen, Ismini Lourentzou
Machine Learning · Cross-listed from cs.CV
Do VLMs Need Vision Transformers? Evaluating State Space Models as Vision Encoders
Shang-Jui Ray Kuo and Paola Cascante-Bonilla
Large
vision–
language models (VLMs) often use a frozen
vision backbone, whose image features are mapped into a large
language model through a lightweight connector. While
transformer-based encoders are the standard visual backbone, we ask whether state space model (SSM)
vision backbones can be a strong alternative. We systematically evaluate SSM
vision backbones for VLMs in a controlled setting. Under matched ImageNet-1K initialization, the SSM backbone achieves the strongest overall performance across both VQA and grounding/localization. We further adapt both SSM and ViT-family backbones with detection or
segmentation training and find that dense-task tuning generally improves performance across families; after this adaptation, the SSM backbone remains competitive while operating at a substantially smaller model scale. We further observe that (i) higher ImageNet accuracy or larger backbones do not reliably translate into better VLM performance, and (ii) some visual backbones are unstable in localization. Based on these findings, we propose stabilization strategies that improve robustness for both backbone families and highlight SSM backbones as a strong alternative to
transformer-based
vision encoders in VLMs.
Read the full abstract ▾