Machine Learning
FlowSymm: Physics Aware, Symmetry Preserving Graph Attention for Network Flow Completion
Ege Demirci, Francesco Bullo, Ananthram Swami et al. (+1 more)
Recovering missing flows on the edges of a network, while exactly respecting local conservation laws, is a fundamental inverse problem that arises in many systems such as transportation, energy, and mobility. We introduce FlowSymm, a novel architecture that combines (i) a group-action on divergence-free flows, (ii) a graph-
attention encoder to learn feature-conditioned weights over these
symmetry-preserving actions, and (iii) a lightweight Tikhonov refinement solved via implicit bilevel optimization. The method first anchors the given observation on a minimum-norm divergence-free completion. We then compute an orthonormal basis for all admissible group actions that leave the observed flows invariant and parameterize the valid solution subspace, which shows an Abelian group structure under vector addition. A stack of GATv2 layers then encodes the graph and its edge features into per-edge
embeddings, which are pooled over the missing edges and produce per-basis
attention weights. This
attention-guided process selects a set of physics-aware group actions that preserve the observed flows. Finally, a scalar Tikhonov penalty refines the missing entries via a convex least-squares solver, with gradients propagated implicitly through Cholesky factorization. Across three real-world flow
benchmarks (traffic, power, bike), FlowSymm outperforms state-of-the-art baselines in RMSE, MAE and correlation metrics.
Read the full abstract ▾
All authors Ege Demirci, Francesco Bullo, Ananthram Swami, Ambuj Singh
Machine Learning
Gaussian Process Bandit Optimization with Machine Learning Predictions and Application to Hypothesis Generation
Xin Jennifer Chen and Yunjin Tong
Many real-world optimization problems involve an expensive ground-truth oracle (e.g., human evaluation, physical experiments) and a cheap, low-fidelity prediction oracle (e.g., machine learning models, simulations). Meanwhile, abundant offline data (e.g., past experiments and predictions) are often available and can be used to pretrain powerful predictive models, as well as to provide an informative prior. We propose Prediction-Augmented Gaussian Process Upper Confidence Bound (PA-GP-UCB), a novel
Bayesian optimization
algorithm that leverages both oracles and offline data to achieve provable gains in sample efficiency for the ground-truth oracle queries. PA-GP-UCB employs a control-variates
estimator derived from a joint Gaussian process posterior to correct prediction bias and reduce uncertainty. We prove that PA-GP-UCB preserves the standard regret rate of GP-UCB while achieving a strictly smaller leading constant that is explicitly controlled by prediction quality and offline data coverage. Empirically, PA-GP-UCB converges faster than Vanilla GP-UCB and naive prediction-augmented GP-UCB baselines on synthetic
benchmarks and on a real-world hypothesis evaluation task grounded in human behavioral data, where predictions are provided by large
language models. These results establish PA-GP-UCB as a general and sample-efficient framework for hypothesis generation under expensive feedback.
Read the full abstract ▾
Machine Learning
Hair-Trigger Alignment: Black-Box Evaluation Cannot Guarantee Post-Update Alignment
Yavuz Bakman, Duygu Nur Yaldiz, Eleni Triantafillou et al. (+3 more)
Large
Language Models (LLMs) are rarely static and are frequently updated in practice. A growing body of
alignment research has shown that models initially deemed “aligned” can exhibit misaligned behavior after fine-tuning. These works typically assume that the initial model is aligned based on static black-box evaluation, i.e., the absence of undesired responses to a fixed set of queries. However, the limits of black-box evaluation for post-update scenarios is not explored sufficiently. In this work, we formalize model
alignment in both the static and post-update settings and uncover a fundamental limitation of black-box evaluation. We theoretically show that, due to overparameterization, static
alignment provides no guarantee of post-update
alignment for any update
dataset. Moreover, we prove that static black-box probing cannot distinguish a model that is genuinely post-update robust from one that conceals an arbitrary amount of
adversarial behavior which can be activated by even a single benign gradient update. We further validate these findings empirically in LLMs across three core
alignment domains:
privacy, jailbreak safety, and behavioral honesty. We demonstrate the existence of LLMs that pass all standard black-box
alignment tests, yet become severely misaligned after a single benign update. Finally, we show that the capacity to hide such latent
adversarial behavior increases with model scale, confirming our theoretical prediction that post-update misalignment grows with the number of parameters. Together, our results highlight the inadequacy of static evaluation protocols and emphasize the urgent need for post-update–robust
alignment evaluation. Code can be found at: https://github.com/Ybakman/safety_benign_update.
Read the full abstract ▾
All authors Yavuz Bakman, Duygu Nur Yaldiz, Eleni Triantafillou, Peter Kairouz, Salman Avestimehr, Sai Praneeth Karimireddy
Machine Learning
SCALAR: Quantifying Structural Hallucination, Consistency, and Reasoning Gaps in Materials Foundation Models
Can Polat, Erchin Serpedin, Mustafa Kurban et al. (+1 more)
Large
language models are increasingly applied to materials science
reasoning, yet their behavior under physically structured distribution shifts remains poorly understood. We introduce SCALAR (Structural Consistency And Logic Across Regimes), a
benchmark for evaluating
geometric scale generalization and its connection to structural
hallucination, consistency, and
reasoning in materials foundation models. Given canonical
crystal representations, models must reason about derived nanoparticle structures obtained through supercell expansion and
geometric truncation across length scales spanning a few atoms to over 18,000 atoms, totaling $\approx$100,000 structures from DFT-validated unit
cells. SCALAR defines three tasks. (i) CIF to property prediction. (ii) A Chain-of-Thought variant with explicit physics-grounded
reasoning. (iii) Inverse
retrieval identifying
crystals from candidates given target properties. Outputs are evaluated via structured metrics capturing numeric error,
hallucination, cross-
prompt consistency, monotonic
reasoning, output validity, and
retrieval regret. Experiments across diverse foundation models reveal large, model-dependent shifts under explicit
reasoning, often reducing
hallucination and error, but frequently destabilizing consistency or validity. These results demonstrate that
geometric scale generalization cannot be inferred from accuracy alone. Supplementary materials are available at https://github.com/KurbanIntelligenceLab/SCALAR.
Read the full abstract ▾
All authors Can Polat, Erchin Serpedin, Mustafa Kurban, Hasan Kurban
Machine Learning · Cross-listed from cs.AI
Why Reasoning Fails to Plan: A Planning-Centric Analysis of Long-Horizon Decision Making in LLM Agents
Zehong Wang, Fang Wu, Hongru Wang et al. (+8 more)
Large
language model (LLM)-based
agents exhibit strong step-by-step
reasoning capabilities over short horizons, yet often fail to sustain coherent behavior over long planning horizons. We argue that this failure reflects a fundamental mismatch: step-wise
reasoning induces a form of step-wise greedy policy that is adequate for short horizons but fails in long-horizon planning, where early actions must account for delayed consequences. From this planning-centric perspective, we study LLM-based
agents in deterministic, fully structured environments with explicit state transitions and evaluation signals. Our analysis reveals a core failure mode of
reasoning-based policies: locally optimal choices induced by step-wise scoring lead to early myopic commitments that are systematically amplified over time and difficult to recover from. We introduce
FLARE (Future-aware Lookahead with Reward Estimation) as a minimal instantiation of future-aware planning to enforce explicit lookahead, value propagation, and limited commitment in a single model, allowing downstream outcomes to influence early decisions. Across multiple
benchmarks,
agent frameworks, and LLM backbones,
FLARE consistently improves task performance and planning-level behavior, frequently allowing LLaMA-8B with
FLARE to outperform GPT-4o with standard step-by-step
reasoning. These results establish a clear distinction between
reasoning and planning.
Read the full abstract ▾
All authors Zehong Wang, Fang Wu, Hongru Wang, Xiangru Tang, Bolian Li, Zhenfei Yin, Yijun Ma, Yiyang Li, Weixiang Sun, Xiusi Chen, Yanfang Ye
Machine Learning
Stealthy Poisoning Attacks Bypass Defenses in Regression Settings
Javier Carnerero-Cano, Luis Muñoz-González, Phillippa Spencer et al. (+1 more)
Regression models are widely used in industrial processes, engineering, and in natural and physical sciences, yet their robustness to poisoning has received less
attention. When it has, studies often assume unrealistic threat models and are thus less useful in practice. In this paper, we propose a novel optimal stealthy attack formulation that considers different degrees of detectability and show that it bypasses state-of-the-art defenses. We further propose a new methodology based on normalization of objectives to evaluate different trade-offs between effectiveness and detectability. Finally, we develop a novel defense (BayesClean) against stealthy attacks. BayesClean improves on previous defenses when attacks are stealthy and the number of poisoning points is significant.
Read the full abstract ▾
All authors Javier Carnerero-Cano, Luis Muñoz-González, Phillippa Spencer, Emil C. Lupu
Machine Learning
Exact Gaussian Moment Matching for Residual Networks: a Second-Order Method
Simon Kuang and Xinfan Lin
We study the problem of propagating the mean and covariance of a general multivariate Gaussian distribution through a deep (residual) neural network using layer-by-layer moment matching. We close a longstanding gap by deriving exact moment matching for the probit, GeLU, ReLU (as a limit of GeLU), Heaviside (as a limit of probit), and sine activation functions; for both feedforward and generalized residual layers. On large-variance random networks, median KL-divergence improvements over common baselines range from tens to thousands of times. On a variational Bayes neural network, we show that our method improves upon a state-of-the-art deterministic inference method by an order of magnitude in KL divergence from Monte Carlo ground truth. We also give a smooth-distance error bound showing that, under regularity assumptions, moment matching removes the leading low-variance errors and propagates higher-order local accuracy through the layers of a network.
Read the full abstract ▾
Machine Learning
BayesFlow: A Probability Inference Framework for Meta-Agent Assisted Workflow Generation
Bo Yuan, Yun Zhou, Zhichao Xu et al. (+3 more)
Automatic workflow generation is the process of automatically synthesizing sequences of LLM calls, tool invocations, and post-processing steps for complex end-to-end tasks. Most prior methods cast this task as an optimization problem with limited theoretical grounding. We propose to cast workflow generation as
Bayesian inference over a posterior distribution on workflows, and introduce
Bayesian Workflow Generation (BWG), a sampling framework that builds workflows step-by-step using parallel look-ahead rollouts for importance weighting and a sequential in-loop refiner for pool-wide improvements. We prove that, without the refiner, the weighted empirical distribution converges to the target posterior. We instantiate BWG as BayesFlow, a training-free
algorithm for workflow construction. Across six
benchmark datasets, BayesFlow improves accuracy by up to 9 percentage points over SOTA workflow generation baselines and by up to 65 percentage points over zero-shot prompting, establishing BWG as a principled upgrade to search-based workflow design. Code will be available on https://github.com/BoYuanVisionary/BayesFlow.
Read the full abstract ▾
All authors Bo Yuan, Yun Zhou, Zhichao Xu, Kiran Ramnath, Aosong Feng, Balasubramaniam Srinivasan
Machine Learning
ZK-HybridFL: Zero-Knowledge Proof-Enhanced Hybrid Ledger for Federated Learning
Amirhossein Taherpour and Xiaodong Wang
Federated learning (FL) enables collaborative model training while preserving data
privacy, yet both centralized and decentralized approaches face challenges in scalability, security, and update validation. We propose ZK-HybridFL, a secure decentralized FL framework that integrates a directed acyclic graph (DAG) ledger with dedicated sidechains and zero-knowledge proofs (ZKPs) for
privacy-preserving model validation. The framework uses event-driven smart contracts and an oracle-assisted sidechain to verify local model updates without exposing sensitive data. A built-in challenge mechanism efficiently detects
adversarial behavior. In experiments on image classification and
language modeling tasks, ZK-HybridFL achieves faster convergence, higher accuracy, lower perplexity, and reduced latency compared to Blade-FL and ChainFL. It remains robust against substantial fractions of
adversarial and idle nodes, supports sub-second on-chain verification with efficient gas usage, and prevents invalid updates and orphanage-style attacks. This makes ZK-HybridFL a scalable and secure solution for decentralized FL across diverse environments.
Read the full abstract ▾
Machine Learning · Cross-listed from physics.optics
Toward all-optical unsupervised Hebbian learning in deep photonic neuromorphic networks
Xi Li, Disha Biswas, Peng Zhou et al. (+4 more)
We propose a deep photonic neuromorphic network (PNN) architecture based on phase-change material (PCM) synapses and local optical feedback for online, unsupervised Hebbian learning. The proposed architecture combines optical vector-
matrix multiplication, non-volatile PCM synaptic weighting, and local coincidence-driven synaptic adaptation within a multilayer photonic crossbar framework compatible with photonic integrated
circuits. Unlike conventional PNNs that rely on externally computed gradients, repeated optical-electrical-optical conversions, or global backpropagation, the proposed framework employs local Hebbian learning governed directly by correlated pre- and post-synaptic optical activity. To investigate the feasibility of the proposed learning mechanism, we implemented the PNN design using fiber-optic components, programmable variable optical attenuators, and real-time software control that incorporates PCM thermal dynamics. Supervised and unsupervised learning behaviors were experimentally evaluated under both offline and online learning conditions using representative image-recognition tasks. The experimental results demonstrate adaptive synaptic
evolution, successful optical inference, and autonomous pattern encoding through local Hebbian learning under realistic fiber-optic hardware conditions. These results establish a pathway toward future integrated photonic neuromorphic systems capable of scalable and energy-efficient online Hebbian learning.
Read the full abstract ▾
All authors Xi Li, Disha Biswas, Peng Zhou, Wesley H. Brigner, Anna Capuano, Joseph S. Friedman, Qing Gu
Machine Learning
Conformal Prediction for Generative Models via Adaptive Cluster-Based Density Estimation
Qidong Yang, Qianyu Julie Zhu, Jonathan Giezendanner et al. (+3 more)
Conditional generative models map input variables to complex, high-dimensional distributions, enabling realistic sample generation in a diverse set of domains. A critical challenge with these models is the absence of calibrated uncertainty, which undermines trust in individual outputs for high-stakes applications. To address this issue, we propose a systematic conformal prediction approach tailored to conditional generative models, leveraging density estimation on model-generated samples. We introduce a novel method called CP4Gen, which utilizes clustering-based density estimation to construct prediction sets that are less sensitive to outliers, more interpretable, and of lower structural complexity than existing methods. Extensive experiments on synthetic
datasets and real-world applications, including
climate emulation tasks, demonstrate that CP4Gen consistently achieves superior performance in terms of prediction set volume and structural simplicity. Our approach offers practitioners a powerful tool for uncertainty estimation associated with conditional generative models, particularly in scenarios demanding rigorous and interpretable prediction sets.
Read the full abstract ▾
All authors Qidong Yang, Qianyu Julie Zhu, Jonathan Giezendanner, Youssef Marzouk, Stephen Bates, Sherrie Wang
Machine Learning
ParalESN: Enabling parallel information processing in Reservoir Computing
Matteo Pinna, Giacomo Lagomarsini, Andrea Ceni et al. (+1 more)
Reservoir Computing (RC) has established itself as an efficient paradigm for temporal processing. However, its scalability remains severely constrained by the need to process temporal data sequentially and the prohibitive
memory footprint of high-dimensional reservoirs. To address these limitations, we revisit RC through the lens of structured operators and state space modeling, introducing Parallel Echo State Network (ParalESN). Leveraging diagonal linear recurrence in the complex domain, ParalESN enables parallel processing of temporal data and the construction of efficient, high-dimensional reservoirs. A thorough theoretical analysis demonstrates that the Echo State Property and the universality guarantees of traditional Echo State Networks are preserved, while also admitting an equivalent representation of arbitrary linear reservoirs in the complex diagonal form. Empirically, ParalESN achieves competitive predictive accuracy with traditional RC and with fully trainable sequence models, while delivering computational savings by orders of magnitude. Overall, ParalESN offers a scalable and principled pathway for integrating RC within the deep learning landscape.
Read the full abstract ▾
All authors Matteo Pinna, Giacomo Lagomarsini, Andrea Ceni, Claudio Gallicchio
Machine Learning · Cross-listed from cs.MA
Learning Incentive Structures for Cooperative Resilience in Multi-Agent Systems under Social Dilemmas
Manuela Chacon-Chamorro, Luis Felipe Giraldo and Nicanor Quijano
Multi-
agent social dilemmas, such as the tragedy of the commons, capture settings where individual incentives conflict with collective well-being, making these systems highly vulnerable to collapse under disruptions. In this context, this work studies cooperative resilience, understood as the system-level ability to maintain collective well-being under perturbations through adaptive
agent behavior. We propose a framework for learning incentive structures aligned with collective well-being in multi-
agent reinforcement learning systems, where reward functions shape individual decision-making and collective behavior. A resilience metric is used to score and rank
agent trajectories, allowing the inference of reward functions that promote resilient collective behavior. These inferred reward functions are integrated into the multi-
agent reinforcement learning process to shape
agent interactions in social dilemma settings. The approach is evaluated in resource-sharing environments subject to disruptions, using three incentive structures: individual incentives, resilience-aligned incentives, and a hybrid incentive structure that combines both individual and collective components. The results show that the hybrid incentive structure promotes sustained collective behavior, reduces collapse events associated with resource depletion, and preserves system performance under disruption. These findings highlight the role of incentive design as a mechanism for promoting resilient collective behavior and provide a computational framework for multi-
agent social dilemmas under disruptions.
Read the full abstract ▾
Machine Learning
Demystifying Mergeability: Interpretable Properties to Predict Model Merging Success
Luca Zhou, Bo Zhao, Rose Yu et al. (+1 more)
Model merging combines knowledge from separately fine-tuned models, yet the factors driving its success remain poorly understood. While recent work treats mergeability as an intrinsic property of the models, we show with an architecture-agnostic framework that it fundamentally depends on both the merging method and the partner tasks. Using L1-regularized linear optimization over a set of interpretable pairwise metrics (e.g., gradient L_2 distance), we uncover properties correlating with post-merge normalized accuracy across five merging methods. We find architecture- and method-specific variation in success drivers (64.0% average top-5 metric overlap; 79.3% sign agreement), with certain methods, notably TIES, exhibiting distinct “fingerprints” that diverge from the broader consensus. Crucially, however, gradient
alignment metrics consistently emerge as the most fundamental signals of compatibility. These findings provide a diagnostic foundation for understanding mergeability and motivate future merge-aware fine-tuning strategies.
Read the full abstract ▾
All authors Luca Zhou, Bo Zhao, Rose Yu, Emanuele Rodolà
Machine Learning
Riemannian Lyapunov Framework: Optimization as Closed Loop Control on Riemannian Manifolds
Yixuan Wang, Omkar Sudhir Patil and Warren E. Dixon
We introduce the Riemannian Lyapunov Framework (RLF), a unified framework that represents first order optimization as a closed loop controlled dynamical system on a Riemannian parameter
manifold. Within this framework, optimizers are specified by a quadruple $(M, g, \Phi, \eta)$ consisting of a Riemannian metric, an internal state transition map, a direction field generator, and a lifting parameter. Classical and modern methods including SGD, Adam, AdamW, Lion and Shampoo are recovered as specific instantiations of this quadruple. The central structural object of the framework is a time indexed family of target submanifolds in the extended state space of parameters, velocities, and internal
memory, which we call the Normally Attracting Invariant
Manifold (NAIM) family. These submanifolds organize training dynamics into two timescales: a fast contraction of the velocity state onto the current target submanifold, followed by a slow descent along it. Using Riemannian backstepping, we construct a strict Lyapunov function on the extended state space and prove Uniform Ultimate Boundedness (UUB) of the optimization trajectory under a descent
alignment assumption and bounded
stochastic disturbances. Under the additional Polyak-Lojasiewicz (PL) condition, the Lyapunov function converges linearly to a bounded neighborhood of the optimum, defined as the drift of the target direction field between consecutive iterates after parallel transport. To validate the framework's generativity, we derive three concrete instantiations of the quadruple, each exercising a distinct design axis, and show on
geometric diagnostics, image classification
benchmarks, and
language modeling that their empirical behavior matches the theoretical predictions. The framework casts optimizer design as controller synthesis, complementing heuristic perspectives by providing a constructive template with provable guarantees.
Read the full abstract ▾
Machine Learning
SurrogateSHAP: Training-Free Contributor Attribution for Text-to-Image (T2I) Models
Mingyu Lu, Soham Gadgil, Chris Lin et al. (+2 more)
As Text-to-Image (T2I)
diffusion models are increasingly used in real-world creative workflows, a principled framework for valuing contributors who provide a collection of data is essential for fair compensation and sustainable data marketplaces. While the Shapley value offers a theoretically grounded approach to attribution, it faces a dual computational bottleneck: (i) the prohibitive cost of exhaustive model retraining for each sampled subset of players (i.e., data contributors) and (ii) the combinatorial number of subsets needed to estimate marginal contributions due to contributor interactions. To this end, we propose SurrogateSHAP, a retraining-free framework that approximates the expensive retraining game through inference from a pretrained model. To further improve efficiency, we employ a gradient-boosted tree to approximate the utility function and derive Shapley values analytically from the tree-based model. We evaluate SurrogateSHAP across three diverse attribution tasks: (i) image quality for DDPM-CFG on CIFAR-20, (ii) aesthetics for Stable
Diffusion on Post-Impressionist artworks, and (iii) product diversity for FLUX.1 on Fashion-Product data. Across settings, SurrogateSHAP outperforms prior methods while substantially reducing computational overhead, consistently identifying influential contributors across multiple utility metrics. Finally, we demonstrate that SurrogateSHAP effectively localizes data sources responsible for spurious correlations in clinical images, providing a scalable path toward
auditing safety-critical generative models.
Read the full abstract ▾
All authors Mingyu Lu, Soham Gadgil, Chris Lin, Chanwoo Kim, Su-In Lee
Machine Learning
Server-Proximal Aggregation for Federated Domain-Incremental Learning under Partial Participation: Task-Uniform Convergence and Backward Transfer
Longtao Xu and Jian Li
Real-world
federated systems seldom operate on static data: input distributions drift while
privacy rules forbid raw-data sharing. We study this setting as
Federated Domain-Incremental Learning (FDIL), where (i) clients are heterogeneous, (ii) tasks arrive sequentially with shifting domains, yet (iii) the label space remains fixed. Two theoretical pillars remain missing for FDIL under realistic deployment: a guarantee of backward knowledge transfer (BKT) and a convergence rate that holds across the sequence of all tasks with partial participation. We introduce SPECIAL (Server-Proximal Efficient Continual Aggregation for Learning), a simple,
memory-free FDIL
algorithm that adds a single server-side “anchor” to vanilla FedAvg: in each round, the server nudges the uniformly sampled participated clients update toward the previous global model with a lightweight proximal term. This anchor curbs cumulative drift without replay buffers, synthetic data, or task-specific heads, keeping communication and model size unchanged. Our theory shows that SPECIAL (i) preserves earlier tasks: a BKT bound caps any increase in prior-task loss by a drift-controlled term that shrinks with more rounds, local epochs, and participating clients; and (ii) learns efficiently across all tasks: the first communication-efficient non-convex convergence rate for FDIL with partial participation, O((E/NT)^(1/2)), with E local epochs, T communication rounds, and N participated clients per round, matching single-task FedAvg while explicitly separating optimization variance from inter-task drift. Experimental results further demonstrate the effectiveness of SPECIAL.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
JAF: Judge Agent Forest
Sahil Garg, Brad Cheezum, Sridhar Dutta et al. (+1 more)
Judge
agents are fundamental to agentic AI frameworks: they provide automated evaluation, and enable iterative self-refinement of
reasoning processes. We introduce JAF: Judge
Agent Forest, a framework in which the judge
agent conducts joint inference across a cohort of query–response pairs generated by a primary
agent, rather than evaluating each in isolation. This paradigm elevates the judge from a local evaluator to a holistic learner: by simultaneously assessing related responses, the judge discerns cross-instance patterns and inconsistencies, whose aggregate feedback enables the primary
agent to improve by viewing its own outputs through the judge's collective perspective. Conceptually, JAF bridges belief propagation and ensemble-learning principles: overlapping in-context neighborhoods induce a knowledge-graph structure that facilitates propagation of critique, and repeated, randomized evaluations yield a robust ensemble of context-sensitive judgments. JAF can be instantiated entirely via ICL, with the judge prompted for each query using its associated primary-
agent response plus a small, possibly noisy set of peer exemplars. While kNN in
embedding space is a natural starting point for exemplars, this approach overlooks categorical structure, domain metadata, or nuanced distinctions accessible to modern LLMs. To overcome these limitations, we develop a flexible locality-sensitive hashing (LSH)
algorithm that learns informative binary codes by integrating semantic
embeddings, LLM-driven hash predicates, supervision from categorical labels, and relevant side information. These hash codes support efficient, interpretable, and relation-aware selection of diverse exemplars, and further optimize exploration of CoT
reasoning paths. We validate JAF with an empirical study on the demanding task of cloud misconfigs triage in large-scale cloud environments.
Read the full abstract ▾
All authors Sahil Garg, Brad Cheezum, Sridhar Dutta, Vishal Agarwal
Machine Learning
Privacy-Preserving Sensor-Based Human Activity Recognition for Low-Resource Healthcare Using Classical Machine Learning
Ramakant Kumar and Pravin Kumar
Limited access to medical infrastructure forces elderly and vulnerable patients to rely on home-based care, often leading to neglect and poor adherence to therapeutic exercises such as yoga or physiotherapy. To address this gap, we propose a low-cost and automated human activity recognition (HAR) framework based on wearable inertial sensors and machine learning. Activity data, including walking, walking upstairs, walking downstairs, sitting, standing, and lying, were collected using accelerometer and gyroscope measurements. Four classical classifiers, Logistic Regression, Random Forest, Support Vector Machine (SVM), and k-Nearest Neighbors (k-NN), were evaluated and compared with the proposed Support Tensor Machine (STM). Experimental results show that SVM achieved an accuracy of 93.33 percent, while Logistic Regression, Random Forest, and k-NN achieved 91.11 percent. In contrast, STM significantly outperformed these models, achieving a test accuracy of 96.67 percent and the highest cross-validation accuracy of 98.50 percent. Unlike conventional methods, STM leverages tensor representations to preserve spatio-temporal motion dynamics, resulting in robust classification across diverse activities. The proposed framework demonstrates strong potential for remote healthcare, elderly assistance, child activity monitoring, yoga feedback, and smart home wellness, offering a scalable solution for low-resource and rural healthcare settings.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.SE
Predicting Intermittent Job Failure Categories for Diagnosis Using Few-Shot Fine-Tuned Language Models
Henri Aïdasso, Francis Bordeleau and Ali Tizghadam
In principle, Continuous Integration (CI) pipeline failures provide valuable feedback to developers on code-related errors. In practice, however, pipeline jobs often fail intermittently due to non-deterministic tests, network outages, infrastructure failures, resource exhaustion, and other reliability issues. These intermittent (flaky) job failures lead to substantial inefficiencies: wasted computational resources from repeated reruns and significant diagnosis time that distracts developers from core activities and often requires intervention from specialized teams. Prior work has proposed machine learning techniques to detect intermittent failures, but does not address the subsequent diagnosis challenge. To fill this gap, we introduce FlaXifyer, a few-shot learning approach for predicting intermittent job failure categories using pre-trained
language models. FlaXifyer requires only job execution logs and achieves 84.3% Macro F1 and 92.0% Top-2 accuracy with just 12 labeled examples per category. We also propose LogSift, an interpretability technique that identifies influential log statements in under one second, reducing review effort by 74.4% while surfacing relevant failure information in 87% of cases. Evaluation on 2,458 job failures from TELUS demonstrates that FlaXifyer and LogSift enable effective automated triage, accelerate failure diagnosis, and pave the way towards the automated resolution of intermittent job failures.
Read the full abstract ▾
Machine Learning
Tabular Foundation Models Can Do Survival Analysis
Da In Kim, Wei Siang Lai and Kelly W. Zhang
While tabular foundation models have achieved remarkable success in classification and regression, adapting them to model time-to-event outcomes for survival analysis is non-trivial due to right-censoring, where data observations may end before the event of interest occurs. In this work, we systematically study a variety of approaches to utilize off-the-shelf tabular foundation models originally designed for classification for discrete-time survival modeling. We evaluate existing classification formulations, including hazard modeling and multi-class classification approaches, and introduce a new formulation that directly models cumulative failure probabilities at discretized time points, treating censored observations as examples with missing labels at certain time points. We prove that under standard censoring assumptions, minimizing the weighted cross
entropy loss recovers the true survival probabilities as the training set size increases. Across $60$ real-world
datasets ($54$ static and $6$ dynamic), we find that TFMs paired with classification reductions often outperform or are competitive with classical and deep learning survival baselines on average across multiple survival metrics. Our results show that off-the-shelf TFMs provide a flexible approach to survival modeling, allowing time discretization to be adapted at inference without training. Our comparison provides practical guidance on when to use these models and which survival formulation to choose.
Read the full abstract ▾
Machine Learning
Symmetry Breaking in Transformers for Efficient and Interpretable Training
Eva Silverstein, Daniel Kunin and Vasudev Shyam
The
attention mechanism in its standard implementation contains extraneous rotational degrees of freedom that are carried through computation but do not affect model activations or outputs. We introduce a simple
symmetry-breaking protocol that inserts a preferred direction into this rotational space through batchwise-sampled, unlearned query and value biases. This modification has two theoretically motivated and empirically validated consequences. First, it can substantially improve the performance of simple,
memory-efficient optimizers, narrowing – and in some cases closing – the gap to successful but more complex
memory-intensive adaptive methods. We demonstrate this by pretraining 124M parameter
transformer models with four optimization
algorithms (AdamW, SOAP, SGDM, and Energy Conserving Descent(ECD)) and evaluating both validation loss and downstream logical
reasoning. Second, it enables an interpretable use of otherwise redundant rotational degrees of freedom, selectively amplifying semantically meaningful
token classes within individual
attention heads. Overall, our results show that minimal, principled architectural changes can simultaneously improve performance and interpretability.
Read the full abstract ▾
Machine Learning
FunPRM: Function-as-Step Process Reward Model with Meta Reward Correction for Code Generation
Ruiyi Zhang, Peijia Qin, Qi Cao et al. (+2 more)
Code generation is a core application of large
language models (LLMs), yet LLMs still frequently fail on complex programming tasks. Given its success in mathematical
reasoning, test-time scaling approaches such as Process Reward Model (PRM)-based Best-of-N selection offer a promising way to improve performance. However, existing PRMs remain ineffective for code generation due to the lack of meaningful step decomposition in code and the noise of Monte Carlo-estimated partial-solution correctness scores (rewards). To address these challenges, we propose FunPRM. FunPRM
prompts LLMs to encourage modular code generation organized into functions, with functions treated as PRM
reasoning steps. Furthermore, FunPRM introduces a novel meta-learning-based reward correction mechanism that leverages clean final-solution rewards obtained via a unit-test-based evaluation system to purify noisy partial-solution rewards. Experiments on LiveCodeBench and BigCodeBench demonstrate that FunPRM consistently outperforms existing test-time scaling methods across five base LLMs, notably achieving state-of-the-art performance on LiveCodeBench when combined with O4-mini. Furthermore, FunPRM produces code that is more readable and reusable for developers.
Read the full abstract ▾
All authors Ruiyi Zhang, Peijia Qin, Qi Cao, Eric Xue, Pengtao Xie
Machine Learning · Cross-listed from cs.CV
Is Hierarchical Quantization Essential for Optimal Reconstruction?
Shirin Reyhanian and Laurenz Wiskott
Vector-quantized variational autoencoders (VQ-VAEs) are central to models that rely on high reconstruction fidelity, from neural compression to generative pipelines. Hierarchical extensions, such as VQ-VAE2, are often credited with superior reconstruction performance because they split global and local features across multiple levels. However, since higher levels derive all their information from lower levels, they should not carry additional reconstructive content beyond what the lower-level already encodes. Combined with recent advances in training objectives and quantization mechanisms, this leads us to ask whether a single-level VQ-VAE, with matched representational budget and no codebook collapse, can equal the reconstruction fidelity of its hierarchical counterpart. Although the multi-scale structure of hierarchical models may improve perceptual quality in downstream tasks, the effect of hierarchy on reconstruction accuracy, isolated from codebook utilization and overall representational capacity, remains empirically underexamined. We revisit this question by comparing a two-level VQ-VAE and a capacity-matched single-level model on high-resolution ImageNet images. Consistent with prior observations, we confirm that inadequate codebook utilization limits single-level VQ-VAEs and that overly high-dimensional
embeddings destabilize quantization and increase codebook collapse. We show that lightweight interventions such as initialization from data, periodic reset of inactive codebook vectors, and systematic tuning of codebook hyperparameters significantly reduce collapse. Our results demonstrate that when representational budgets are matched, and codebook collapse is mitigated, single-level VQ-VAEs can match the reconstruction fidelity of hierarchical variants, challenging the assumption that hierarchical quantization is inherently superior for high-quality reconstructions.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.MA
Aligning Microscopic Vehicle and Macroscopic Traffic Statistics: Reconstructing Driving Behavior from Partial Data
Zhihao Zhang, Keith Redmill, Chengyang Peng et al. (+1 more)
A driving
algorithm that aligns with good human driving practices, or at the very least collaborates effectively with human drivers, is crucial for developing safe and efficient autonomous vehicles. In practice, two main approaches are commonly adopted: (i) supervised or imitation learning, which requires comprehensive naturalistic driving data capturing all states that influence a vehicle's decisions and corresponding actions, and (ii) reinforcement learning (RL), where the simulated driving environment either matches or is intentionally more challenging than real-world conditions. Both methods depend on high-quality observations of real-world driving behavior, which are often difficult and costly to obtain. State-of-the-art sensors on individual vehicles can gather microscopic data, but they lack context about the surrounding conditions. Conversely, roadside sensors can capture traffic flow and other macroscopic characteristics, but they cannot associate this information with individual vehicles on a microscopic level. Motivated by this complementarity, we propose a framework that reconstructs unobserved microscopic states from macroscopic observations, using microscopic data to anchor observed vehicle behaviors, and learns a shared policy whose behavior is microscopically consistent with the partially observed trajectories and actions and macroscopically aligned with target traffic statistics when deployed population-wide. Such constrained and regularized policies promote realistic flow patterns and safe coordination with human drivers at scale.
Read the full abstract ▾
All authors Zhihao Zhang, Keith Redmill, Chengyang Peng, Bowen Weng
Machine Learning · Cross-listed from cs.CR
A Systematic Literature Review on LLM Defenses Against Prompt Injection and Jailbreaking: Expanding NIST Taxonomy
Pedro H. Barcha Correia, Ryan W. Achjian, Diego E. G. Caetano de Oliveira et al. (+5 more)
The rapid advancement and widespread adoption of generative artificial intelligence (GenAI) and large
language models (LLMs) has been accompanied by the emergence of new security vulnerabilities and challenges, such as jailbreaking and other
prompt injection attacks. These maliciously crafted inputs can exploit LLMs, causing data leaks, unauthorized actions, or compromised outputs, for instance. As both offensive and defensive
prompt injection techniques evolve quickly, a structured understanding of mitigation strategies becomes increasingly important. To address that, this work presents the first systematic literature review on
prompt injection mitigation strategies, comprehending 88 studies. Building upon NIST's report on
adversarial machine learning, this work contributes to the field through several avenues. First, it identifies studies beyond those documented in NIST's report and other academic reviews and surveys. Second, we propose an extension to NIST taxonomy by introducing additional categories of defenses. Third, by adopting NIST's established terminology and taxonomy as a foundation, we promote consistency and enable future researchers to build upon the standardized taxonomy proposed in this work. Finally, we provide a comprehensive catalog of the reviewed
prompt injection defenses, documenting their reported quantitative effectiveness across specific LLMs and attack
datasets, while also indicating which solutions are open-source and model-agnostic. This catalog, together with the guidelines presented herein, aims to serve as a practical resource for researchers advancing the field of
adversarial machine learning and for developers seeking to implement effective defenses in production systems.
Read the full abstract ▾
All authors Pedro H. Barcha Correia, Ryan W. Achjian, Diego E. G. Caetano de Oliveira, Ygor Acacio Maria, Victor Takashi Hayashi, Marcos Lopes, Charles Christian Miers, Marcos A. Simplicio Jr
Machine Learning
JURIST: Training Small Data-Reweighted Reasoning Judges for Test-Time Scaling in Code Generation
Peijia Qin, Ruiyi Zhang, Qi Cao et al. (+1 more)
Best-of-N selection for code generation is only as good as the judge that picks among the candidates, and the judges accurate enough for this role are costly frontier LLMs. A small judge can be trained on abundant earlier data labeled by unit tests, but it is deployed on newer problems: the earlier problems are easier and teach it little, their tasks differ, and their candidates come from weaker policies, while data close to deployment are scarce. We present JURIST, a 1.7B
reasoning judge that uses a small meta set close to deployment to learn how much each earlier training sample should count. In our experiments, we find that training on the meta set alone, or adding it to the training data, does not help, while using it to weight the earlier data through a bi-level objective adds 3.9 Hard points over adding it to the training data. On LiveCodeBench, JURIST reaches 84.7% Overall and matches Claude Sonnet 4.6 on Hard problems (73.8%) at 463x lower cost; on BigCodeBench, it surpasses all test-time scaling baselines (35.9%). Abundant earlier data, guided by a small deployment-aligned meta set, can thus train a compact judge that selects accurately at low cost.
Read the full abstract ▾
All authors Peijia Qin, Ruiyi Zhang, Qi Cao, Pengtao Xie
Machine Learning
Latent Spherical Flow Policy for Reinforcement Learning with Combinatorial Actions
Lingkai Kong, Anagha Satish, Hezi Jiang et al. (+6 more)
Reinforcement learning (RL) with combinatorial action spaces remains challenging because feasible action sets are exponentially large and governed by complex feasibility constraints, making direct policy parameterization impractical. Existing approaches embed task-specific value functions into constrained optimization programs or learn deterministic structured policies, sacrificing generality and policy expressiveness. We propose a solver-induced latent spherical flow policy that brings the expressiveness of modern generative policies to combinatorial RL while guaranteeing feasibility by design. Our method, LSFlow, learns a
stochastic policy in a compact continuous latent space via spherical flow matching, and delegates feasibility to a combinatorial optimization solver that maps each latent sample to a valid structured action. To improve efficiency, we train the value network directly in the latent space, avoiding repeated solver calls during policy optimization. To address the piecewise-constant and discontinuous value landscape induced by solver-based action selection, we introduce a smoothed Bellman operator that yields stable, well-defined learning targets. Empirically, our approach outperforms state-of-the-art baselines by an average of 20.6% across a range of challenging combinatorial RL tasks.
Read the full abstract ▾
All authors Lingkai Kong, Anagha Satish, Hezi Jiang, Akseli Kangaslahti, Andrew Ma, Wenbo Chen, Mingxiao Song, Lily Xu, Milind Tambe
Machine Learning
Causal Imitation Learning Under Measurement Error and Distribution Shift
Shi Bo and AmirEmad Ghassami
We study offline imitation learning (IL) when part of the decision-relevant state is observed only through noisy measurements and the distribution may change between training and deployment. Such settings induce spurious state-action correlations, so standard behavioral cloning (BC) – whether conditioning on raw measurements or ignoring them – can converge to systematically biased policies under distribution shift. We propose a general framework for IL under measurement error, inspired by explicitly modeling the causal relationships among the variables, yielding a target that retains a causal interpretation and is robust to distribution shift. Building on ideas from proximal causal inference, we introduce CausIL, which treats noisy state observations as proxy variables, and we provide identification conditions under which the target policy is recoverable from demonstrations without rewards or interactive expert queries. We develop
estimators for both discrete and continuous state spaces; for continuous settings, we use an
adversarial procedure over RKHS function classes to learn the required parameters. We evaluate CausIL on semi-simulated longitudinal data from the PhysioNet/Computing in Cardiology Challenge 2019 cohort and demonstrate improved robustness to distribution shift compared to BC baselines.
Read the full abstract ▾
Machine Learning
FedAdaVR: Adaptive Variance Reduction for Robust Federated Learning under Limited Client Participation
S M Ruhul Kabir Howlader, Xiao Chen, Yifei Xie et al. (+1 more)
Federated learning (FL) encounters substantial challenges due to heterogeneity, leading to gradient noise, client drift, and partial client participation errors, the last of which is the most pervasive but remains insufficiently addressed in current literature. In this paper, we propose FedAdaVR, a novel FL
algorithm aimed at solving heterogeneity issues caused by partial client participation by incorporating an adaptive optimiser with a variance reduction technique. This method takes advantage of the most recent stored updates from clients, even when they are absent from the current training round, thereby emulating their presence. Furthermore, we propose FedAdaVR-Quant, a server-side
memory compression variant that stores historical client updates in quantised form (while keeping client-server communication in full precision), reducing the server
memory footprint of FedAdaVR by 50% (FP16), 75% (Int8), and 87.5% (Int4) while maintaining highly competitive, and occasionally superior model performance. We analyse the non-convex convergence behaviour of FedAdaVR with Adagrad and prove that our proposed framework eliminates the first-order partial client participation bias while improving monotonically with cohort size. Extensive experiments conducted on multiple
vision and NLP
datasets demonstrate that FedAdaVR consistently outperforms state-of-the-art baseline methods.
Read the full abstract ▾
All authors S M Ruhul Kabir Howlader, Xiao Chen, Yifei Xie, Lu Liu