Machine Learning
GGMPs: Generalized Gaussian Mixture Processes
Vardaan Tekriwal, Mark D. Risser, Hengrui Luo et al. (+1 more)
Conditional density estimation is complicated by multimodality, heteroscedasticity, and strong non-Gaussianity. Gaussian processes (GPs) provide a principled nonparametric framework with calibrated uncertainty, but standard GP regression is limited by its unimodal Gaussian predictive form. We introduce the Generalized Gaussian Mixture Process (GGMP), a GP-based method for
multimodal conditional density estimation in settings where each input may be associated with a complex output distribution rather than a single scalar response. GGMP combines local Gaussian mixture fitting, cross-input component
alignment and per-component heteroscedastic GP training to produce a closed-form Gaussian mixture predictive density. The method is tractable, compatible with standard GP solvers and scalable methods, and avoids the exponentially large latent-assignment structure of naive
multimodal GP formulations. Empirically, GGMPs improve distributional approximation on synthetic and real-world
datasets with pronounced non-Gaussianity and multimodality.
Read the full abstract ▾
All authors Vardaan Tekriwal, Mark D. Risser, Hengrui Luo, Marcus M. Noack
Machine Learning · Cross-listed from stat.ML
Adaptive Active Learning for Regression via Reinforcement Learning
Simon D. Nguyen, Troy Russo, Kentaro Hoffman et al. (+1 more)
Active learning for regression reduces labeling costs by selecting the most informative samples. Improved Greedy Sampling is a prominent method that balances feature-space diversity and output-space uncertainty using a static, multiplicative rule. We propose Weighted improved Greedy Sampling (WiGS), which replaces this framework with a dynamic, additive criterion. We formulate weight selection as a reinforcement learning problem, enabling an
agent to adapt the exploration-investigation balance throughout learning. Experiments on 18
benchmark datasets and a synthetic environment show WiGS outperforms iGS and other baseline methods in both accuracy and labeling efficiency, particularly in domains with irregular data density where the baseline's multiplicative rule ignores high-error samples in dense regions.
Read the full abstract ▾
All authors Simon D. Nguyen, Troy Russo, Kentaro Hoffman, Tyler H. McCormick
Machine Learning
Domain-Adaptive Health Indicator Learning with Degradation-Stage Synchronized Sampling and Cross-Domain Autoencoder
Jungho Choo, Hanbyeol Park, Gawon Lee et al. (+2 more)
The construction of high quality health indicators (HIs) is crucial for effective prognostics and health management. Although deep learning has significantly advanced HI modeling, existing approaches often struggle with distribution mismatches resulting from varying operating conditions. Although domain adaptation is typically employed to mitigate these shifts, two critical challenges remain: (1) the misalignment of degradation stages during random mini-batch sampling, resulting in misleading discrepancy losses, and (2) the structural limitations of small-kernel 1D-CNNs in capturing long-range temporal dependencies within complex vibration signals. To address these issues, we propose a domain-adaptive framework comprising degradation stage synchronized batch sampling (DSSBS) and the cross-domain aligned fusion large autoencoder (CAFLAE). DSSBS utilizes kernel change-point detection to segment degradation stages, ensuring that source and target mini-batches are synchronized by their failure phases during
alignment. Complementing this, CAFLAE integrates large-kernel temporal feature extraction with cross-
attention mechanisms to learn superior domain-invariant representations. The proposed framework was rigorously validated on a Korean defense system
dataset and the XJTU-SY bearing
dataset, achieving an average performance enhancement of 24.1% over state-of-the-art methods. These results demonstrate that DSSBS improves cross-domain
alignment through stage-consistent sampling, whereas CAFLAE offers a high-performance backbone for long-term industrial condition monitoring.
Read the full abstract ▾
All authors Jungho Choo, Hanbyeol Park, Gawon Lee, Yunkyung Park, Hyerim Bae
Machine Learning
Effective Dataset Distillation for Spatio-Temporal Forecasting with Bi-dimensional Compression
Taehyung Kwon, Yeonje Choi, Yeongho Kim et al. (+1 more)
Spatio-temporal time series are widely used in real-world applications, including traffic prediction and weather
forecasting. They are sequences of observations over extensive periods and multiple locations, naturally represented as multidimensional data.
Forecasting is a central task in spatio-temporal analysis, and numerous deep learning methods have been developed to address it. However, as
dataset sizes and model complexities continue to grow in practice, training deep learning models has become increasingly time- and resource-intensive. A promising solution to this challenge is
dataset distillation, which synthesizes compact
datasets that can effectively replace the original data for model training. Although successful in various domains, including time series analysis, existing
dataset distillation methods compress only one dimension, making them less suitable for spatio-temporal
datasets, where both spatial and temporal dimensions jointly contribute to the large data volume. To address this limitation, we propose STemDist, the first
dataset distillation method specialized for spatio-temporal time series
forecasting. A key idea of our solution is to compress both temporal and spatial dimensions in a balanced manner, reducing training time and
memory. We further reduce the
distillation cost by performing
distillation at the cluster level rather than the individual location level, and we complement this coarse-grained approach with a subset-based granular
distillation technique that enhances
forecasting performance. On five real-world
datasets, we show empirically that, compared to both general and time-series
dataset distillation methods,
datasets distilled by our STemDist method enable model training (1) faster (up to 6X) (2) more
memory-efficient (up to 8X), and (3) more effective (with up to 12% lower prediction error).
Read the full abstract ▾
All authors Taehyung Kwon, Yeonje Choi, Yeongho Kim, Kijung Shin
Machine Learning
Designing Service Systems from Textual Evidence
Ruicheng Ao, Hongyu Chen, Siyang Gao et al. (+2 more)
Designing service systems requires selecting among alternative configurations – choosing the best chatbot variant, the optimal routing policy, or the most effective quality control procedure. In many service systems, the primary evidence of performance quality is textual – customer support transcripts, complaint narratives, compliance review reports – rather than the scalar measurements assumed by classical optimization methods. Large
language models (LLMs) can read such textual evidence and produce standardized quality scores, but these automated judges exhibit systematic biases that vary across alternatives and evaluation instances. Human expert review remains accurate but costly. We study how to identify the best service configuration with high confidence while minimizing expensive human audits, given that automated evaluation is cheap but biased. We formalize this as a sequential decision problem where a biased proxy score is observed for every evaluation, and a verified outcome can be acquired selectively at additional cost. We prove that LLM-only selection fails under arm-dependent bias, and that naive selective-audit
estimators can be asymptotically biased. We develop an
estimator combining proxy scores with inverse-propensity-weighted residuals and construct anytime-valid confidence sequences. Our
algorithm, PP-LUCB, jointly decides which alternatives to evaluate and whether to request human audits, concentrating reviews where the LLM judge is least reliable. We prove correctness and establish instance-dependent cost bounds showing near-optimal efficiency. On a customer support ticket classification task, our
algorithm correctly identifies the best model in 40/40 trials while achieving 90% audit cost reduction.
Read the full abstract ▾
All authors Ruicheng Ao, Hongyu Chen, Siyang Gao, Hanwei Li, David Simchi-Levi
Machine Learning
On the Learning Dynamics of Two-layer Linear Networks with Label Noise SGD
Tongcheng Zhang, Zhanpeng Zhou, Mingze Wang et al. (+4 more)
One crucial factor behind the success of deep learning lies in the implicit bias induced by noise inherent in gradient-based training
algorithms. Motivated by empirical observations that training with noisy labels improves model generalization, we delve into the underlying mechanisms behind
stochastic gradient descent (SGD) with label noise. Focusing on a two-layer over-parameterized linear network, we analyze the learning dynamics of label noise SGD, unveiling a two-phase learning behavior. In Phase I, the magnitudes of model weights progressively diminish, and the model escapes the lazy regime; enters the rich regime. In Phase II, the
alignment between model weights and the ground-truth interpolator increases, and the model eventually converges. Our analysis highlights the critical role of label noise in driving the transition from the lazy to the rich regime and minimally explains its empirical success. Furthermore, we extend these insights to Sharpness-Aware Minimization (SAM), showing that the principles governing label noise SGD also apply to broader optimization
algorithms. Extensive experiments, conducted under both synthetic and real-world setups, strongly support our theory. Our code is released at https://github.com/a-usually/Label-Noise-SGD.
Read the full abstract ▾
All authors Tongcheng Zhang, Zhanpeng Zhou, Mingze Wang, Andi Han, Wei Huang, Taiji Suzuki, Junchi Yan
Machine Learning
Graph-GRPO: Training Graph Flow Models with Reinforcement Learning
Baoheng Zhu, Deyu Bo, Delvin Ce Zhang et al. (+1 more)
Graph generation is a fundamental task with broad applications, such as drug discovery. Recently, discrete flow matching-based graph generation, \aka, graph flow model (GFM), has emerged due to its superior performance and flexible sampling. However, effectively aligning GFMs with complex human preferences or task-specific objectives remains a significant challenge. In this paper, we propose Graph-GRPO, an online reinforcement learning (RL) framework for training GFMs under verifiable rewards. Our method makes two key contributions: (1) We derive an analytical expression for the transition probability of GFMs, replacing the Monte Carlo sampling and enabling fully differentiable rollouts for RL training; (2) We propose a refinement strategy that randomly perturbs specific nodes and edges in a graph, and regenerates them, allowing for localized exploration and self-improvement of generation quality. Extensive experiments on both synthetic and real
datasets demonstrate the effectiveness of Graph-GRPO. With only 50 denoising steps, our method achieves 95.0% and 97.5% Valid-Unique-Novelty scores on the planar and tree
datasets, respectively. Moreover, Graph-GRPO achieves state-of-the-art performance on the molecular optimization tasks, outperforming graph-based and fragment-based RL methods as well as classic genetic
algorithms.
Read the full abstract ▾
All authors Baoheng Zhu, Deyu Bo, Delvin Ce Zhang, Xiao Wang
Machine Learning
Variance-Aware Adaptive Weighting for Diffusion Model Training
Nanlong Sun and Lei Shi
Diffusion models have recently achieved remarkable success in generative modeling, yet their training dynamics across different noise levels remain highly imbalanced, which can lead to inefficient optimization and unstable learning behavior. In this work, we investigate this imbalance from the perspective of loss variance across log-SNR levels and propose a variance-aware adaptive weighting strategy to address it. The proposed approach dynamically adjusts training weights based on the observed variance distribution, encouraging a more balanced optimization process across noise levels. Extensive experiments on CIFAR-10 and CIFAR-100 demonstrate that the proposed method consistently improves generative performance over standard training schemes, achieving lower Fréchet Inception Distance (FID) while also reducing performance variance across random seeds. Additional analysis, including loss-log-SNR visualization, variance heatmaps, and ablation studies, further reveal that the adaptive weighting effectively stabilizes training dynamics. These results highlight the potential of variance-aware training strategies for improving
diffusion model optimization.
Read the full abstract ▾
Machine Learning
Optimal Expert-Attention Allocation in Mixture-of-Experts: A Scalable Law for Dynamic Model Design
Junzhuo Li, Peijie Jiang, Changxin Tian et al. (+3 more)
This paper presents a novel extension of neural scaling laws to Mixture-of-Experts (MoE) models, focusing on the optimal allocation of compute between expert and
attention sub-layers. As MoE architectures have emerged as an efficient method for scaling model capacity without proportionally increasing computation, determining the optimal expert-
attention compute ratio becomes critical. We define the ratio $r$ as the fraction of total FLOPs per
token dedicated to the expert layers versus the
attention layers, and explore how this ratio interacts with the overall compute budget and model sparsity. Through extensive experiments with GPT-style MoE
Transformers, we empirically find that the optimal ratio $r^*$ follows a power-law relationship with total compute and varies with sparsity. Our analysis leads to an explicit formula for $r^*$, enabling precise control over the expert-
attention compute allocation. We generalize the Chinchilla scaling law by incorporating this architectural parameter, providing a new framework for tuning MoE models beyond size and data. Our findings offer practical guidelines for designing efficient MoE models, optimizing performance while respecting fixed compute budgets.
Read the full abstract ▾
All authors Junzhuo Li, Peijie Jiang, Changxin Tian, Jia Liu, Zhiqiang Zhang, Xuming Hu
Machine Learning
Causal Concept Graphs in LLM Latent Space for Stepwise Reasoning
Md Muntaqim Meherab, Noor Islam S. Mohammad and Faiza Feroz
Sparse autoencoders can localize where concepts live in
language models, but not how they interact during multi-step
reasoning. We propose Causal Concept Graphs (CCG): a directed acyclic graph over sparse, interpretable latent features, where edges capture learned causal dependencies between concepts. We combine task-conditioned sparse autoencoders for concept discovery with DAGMA-style differentiable structure learning for graph recovery and introduce the Causal Fidelity Score (CFS) to evaluate whether graph-guided interventions induce larger downstream effects than random ones. On ARC-Challenge, StrategyQA, and LogiQA with GPT-2 Medium, across five seeds ($n{=}15$ paired runs), CCG achieves $\CFS=5.654\pm0.625$, outperforming ROME-style tracing ($3.382\pm0.233$), SAE-only ranking ($2.479\pm0.196$), and a random baseline ($1.032\pm0.034$), with $p<0.0001$ after Bonferroni correction. Learned graphs are sparse (5-6% edge density), domain-specific, and stable across seeds.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
Wenjing Zhang, Jiangze Yan, Jieyun Huang et al. (+7 more)
Distilling
reasoning capabilities from Large
Reasoning Models (LRMs) into smaller models is typically constrained by the limitations of rejection sampling. Standard methods treat the teacher as a static filter, discarding complex "corner-case" problems where the teacher fails to explore valid solutions independently, thereby creating an artificial "Teacher Ceiling" for the student. In this work, we propose Hindsight
Entropy-Assisted Learning (HEAL), an RL-free framework designed to bridge this
reasoning gap. Drawing on the educational theory of the Zone of Proximal Development (ZPD), HEAL synergizes three core modules: (1) Guided
Entropy-Assisted Repair (GEAR), an active intervention mechanism that detects critical
reasoning breakpoints via
entropy dynamics and injects targeted hindsight hints to repair broken trajectories; (2) Perplexity-Uncertainty Ratio
Estimator (PURE), a ratio-based filtering heuristic that reduces high-anomaly shortcut-like rationales; and (3) Progressive Answer-guided Curriculum
Evolution (PACE), a three-stage
distillation strategy that organizes training from foundational
alignment to hard-case adaptation. Extensive experiments on multiple
benchmarks demonstrate that HEAL significantly outperforms traditional SFT
distillation and other baselines.
Read the full abstract ▾
All authors Wenjing Zhang, Jiangze Yan, Jieyun Huang, Yi Shen, Shuming Shi, Ping Chen, Ning Wang, Zhaoxiang Liu, Kai Wang, Shiguo Lian
Machine Learning · Cross-listed from stat.ML
On the Complexity of Best-Arm Identification in Non-Stationary Linear Bandits
Leo Maynard-Zhang, Zhihan Xiong, Kevin Jamieson et al. (+1 more)
We study the fixed-budget best-arm identification (BAI) problem in non-stationary linear bandits. Concretely, given a fixed time budget $T\in \mathbb{N}$, finite arm set $\mathcal{X} \subset \mathbb{R}^d$, and a potentially
adversarial sequence of unknown parameters $\lbrace \theta_t\rbrace_{t=1}^{T}$ (hence non-stationary), a learner aims to identify the arm with the largest cumulative reward $x_* = \arg\max_{x \in \mathcal{X}} x^\top\sum_{t=1}^T \theta_t$ with high probability. In this setting, it is well-known that i.i.d. sampling arms from the G-optimal design yields a minimax-optimal error probability of $\exp\left(-\Theta\left(T / H_{G}\right)\right)$, where $H_{G}$ scales proportionally with the dimension $d$. However, this notion of complexity is overly pessimistic, as it is derived from a lower bound in which the arm set consists only of the standard basis vectors, thus masking any potential advantages arising from arm sets with richer
geometric structure. To address this, we establish an arm-set-dependent lower bound that, in contrast, holds for any arm set. Motivated by the ideas underlying our lower bound, we propose the Adjacent-optimal design, a specialization of the well-known $\mathcal{X}\mathcal{Y}$-optimal design, and develop the $\textsf{Adjacent-BAI}$
algorithm. We prove that the error probability of $\textsf{Adjacent-BAI}$ matches our lower bound up to constants, verifying the tightness of our lower bound, and establishing the arm-set-dependent complexity of this setting.
Read the full abstract ▾
All authors Leo Maynard-Zhang, Zhihan Xiong, Kevin Jamieson, Maryam Fazel
Machine Learning
Federated Active Learning Under Extreme Non-IID and Global Class Imbalance
Chen-Chen Zong and Sheng-Jun Huang
Federated active learning (FAL) seeks to reduce annotation cost under
privacy constraints, yet its effectiveness degrades in realistic settings with severe global class imbalance and highly heterogeneous clients. We conduct a systematic study of query-model selection in FAL and uncover a central insight: the model that achieves more class-balanced sampling, especially for minority classes, consistently leads to better final performance. Moreover, global-model querying is beneficial only when the global distribution is highly imbalanced and client data are relatively homogeneous; otherwise, the local model is preferable. Based on these findings, we propose FairFAL, an adaptive class-fair FAL framework. FairFAL (1) infers global imbalance and local-global divergence via lightweight prediction discrepancy, enabling adaptive selection between global and local query models; (2) performs prototype-guided pseudo-labeling using global features to promote class-aware querying; and (3) applies a two-stage uncertainty-diversity balanced sampling strategy with k-center refinement. Experiments on five
benchmarks show that FairFAL consistently outperforms state-of-the-art approaches under challenging long-tailed and non-IID settings. The code is available at https://github.com/chenchenzong/FairFAL.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.HC
NasoVoce: A Nose-Mounted Low-Audibility Speech Interface for Always-Available Speech Interaction
Jun Rekimoto, Yu Nishimura and Bojian Yang
Silent and whispered
speech offer promise for always-available voice interaction with AI, yet existing methods struggle to balance vocabulary size, wearability, silence, and noise robustness. We present NasoVoce, a nose-bridge-mounted interface that integrates a microphone and a vibration sensor. Positioned at the nasal pads of smart glasses, it unobtrusively captures both acoustic and vibration signals. The nasal bridge, close to the mouth, allows access to bone- and skin-conducted
speech and enables reliable capture of low-volume utterances such as whispered
speech. While the microphone captures high-quality audio, it is highly sensitive to environmental noise. Conversely, the vibration sensor is robust to noise but yields lower signal quality. By fusing these complementary inputs, NasoVoce generates high-quality
speech robust against interference. Evaluation with Whisper Large-v2, PESQ, STOI, and MUSHRA ratings confirms improved recognition and quality. NasoVoce demonstrates the feasibility of a practical interface for always-available, continuous, and discreet AI voice conversations.
Read the full abstract ▾
Machine Learning
Data-Driven Integration Kernels for Interpretable Nonlocal Operator Learning
Savannah L. Ferretti, Jerry Lin, Sara Shamekh et al. (+3 more)
Machine learning models can represent
climate processes that are nonlocal in horizontal space, height, and time, often by combining information across these dimensions in highly nonlinear ways. While this can improve predictive skill, it makes learned relationships difficult to interpret and prone to overfitting as the extent of nonlocal information grows. We address this challenge by introducing data-driven integration kernels, a framework that adds structure to nonlocal operator learning by explicitly separating nonlocal information aggregation from local nonlinear prediction. Each spatiotemporal predictor field is first integrated using learnable kernels (defined as continuous weighting functions over horizontal space, height, and/or time), after which a local nonlinear mapping is applied only to the resulting kernel-integrated features and optional local inputs. This design confines nonlinear interactions to a small set of integrated features and makes each kernel directly interpretable as a weighting pattern that reveals which horizontal locations, vertical levels, and/or past timesteps contribute most to the prediction. We demonstrate the framework for South Asian monsoon precipitation using a hierarchy of neural network models with increasing structure, including baseline, nonparametric kernel, and parametric kernel models. Across this hierarchy, kernel models achieve near-baseline performance with far fewer trainable parameters, indicating that much of the relevant nonlocal information can be captured through a small set of interpretable integrations when appropriate structural constraints are imposed.
Read the full abstract ▾
All authors Savannah L. Ferretti, Jerry Lin, Sara Shamekh, Jane W. Baldwin, Michael S. Pritchard, Tom Beucler
Machine Learning
How to make the most of your masked language model for protein engineering
Calvin McCarter, Nick Bhattacharya, Sebastian W. Ober et al. (+1 more)
A plethora of
protein language models have been released in recent years. Yet comparatively little work has addressed how to best sample from them to optimize desired biological properties. We fill this gap by proposing a flexible, effective sampling method for masked
language models (MLMs), and by systematically evaluating models and methods both in silico and in vitro on actual antibody therapeutics campaigns. Firstly, we propose sampling with
stochastic beam search, exploiting the fact that MLMs are remarkably efficient at evaluating the pseudo-perplexity of the entire 1-edit neighborhood of a sequence. Reframing generation in terms of entire-sequence evaluation enables flexible guidance with multiple optimization objectives. Secondly, we report results from our extensive in vitro head-to-head evaluation for the antibody engineering setting. This reveals that the choice of sampling method can have a substantial impact, motivating future research into this under-explored area.
Read the full abstract ▾
All authors Calvin McCarter, Nick Bhattacharya, Sebastian W. Ober, Hunter Elliott
Machine Learning
What do near-optimal learning rate schedules look like?
Hiroki Naganuma, Atish Agarwala, Priya Kasimbeg et al. (+1 more)
A basic unanswered question in neural network training is: what is the best learning rate schedule shape for a given workload? The choice of learning rate schedule is a key factor in the success or failure of the training process, but beyond having some kind of warmup and decay, there is no consensus on what makes a good schedule shape. To answer this question, we designed a search procedure to find the best shapes within a parameterized schedule family. Our approach factors out the schedule shape from the base learning rate, which otherwise would dominate cross-schedule comparisons. We applied our search procedure to a variety of schedule families on three workloads: linear regression, image classification on CIFAR-10, and small-scale
language modeling on Wikitext103. We showed that our search procedure indeed generally found near-optimal schedules. We found that warmup and decay are robust features of good schedules, and that commonly used schedule families are not optimal on these workloads. Finally, we explored how the outputs of our shape search depend on other optimization hyperparameters, and found that weight decay can have a strong effect on the optimal schedule shape. To the best of our knowledge, our results represent the most comprehensive results on near-optimal schedule shapes for deep neural network training, to date.
Read the full abstract ▾
All authors Hiroki Naganuma, Atish Agarwala, Priya Kasimbeg, George E. Dahl
Machine Learning
Regime-aware financial volatility forecasting via in-context learning
Saba Asaad, Shayan Mohajer Hamidi and Ali Bereyhi
This work introduces a regime-aware in-context learning framework that leverages large
language models (LLMs) for financial
volatility forecasting under nonstationary
market conditions. The proposed approach deploys pretrained LLMs to reason over historical
volatility patterns and adjust their predictions without parameter fine-tuning. We develop an oracle-guided refinement procedure that constructs regime-aware demonstrations from training data. An LLM is then deployed as an in-context learner that predicts the next-step
volatility from the input sequence using demonstrations sampled conditional to the estimated
market label. This conditional sampling strategy enables the LLM to adapt its predictions to regime-dependent
volatility dynamics through contextual
reasoning alone. Experiments with multiple financial
datasets show that the proposed regime-aware in-context learning framework outperforms both classical
volatility forecasting approaches and direct one-shot learning, especially during high-
volatility periods.
Read the full abstract ▾
Machine Learning
GaLoRA: Parameter-Efficient Graph-Aware LLMs for Node Classification
Mayur Choudhary, Saptarshi Sengupta and Katerina Potika
The rapid rise of large
language models (LLMs) and their ability to capture semantic relationships has led to their adoption in a wide range of applications. Text-attributed graphs (TAGs) are a notable example where LLMs can be combined with Graph Neural Networks to improve the performance of node classification. In TAGs, each node is associated with textual content and such graphs are commonly seen in various domains such as social networks, citation graphs, recommendation systems, etc. Effectively learning from TAGs would enable better representations of both structural and textual representations of the graph and improve decision-making in relevant domains. We present GaLoRA, a parameter-efficient framework that integrates structural information into LLMs. GaLoRA demonstrates competitive performance on node classification tasks with TAGs, performing on par with state-of-the-art models with just 0.24% of the parameter count required by full LLM fine-tuning. We experiment with three real-world
datasets to showcase GaLoRA's effectiveness in combining structural and semantical information on TAGs.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.AI
Hybrid Self-evolving Structured Memory for GUI Agents
Sibo Zhu, Wenyi Wu, Kun Zhou et al. (+2 more)
The remarkable progress of
vision-
language models (VLMs) has enabled GUI
agents to interact with computers in a human-like manner. Yet real-world computer-use tasks remain difficult due to long-horizon workflows, diverse interfaces, and frequent intermediate errors. Prior work equips
agents with external
memory built from large collections of trajectories, but relies on flat
retrieval over discrete summaries or continuous
embeddings, falling short of the structured organization and self-evolving characteristics of human
memory. Inspired by the
brain, we propose Hybrid Self-evolving Structured
Memory (HyMEM), a graph-based
memory that couples discrete high-level symbolic nodes with continuous trajectory
embeddings. HyMEM maintains a graph structure to support multi-hop
retrieval, self-
evolution via node update operations, and on-the-fly working-
memory refreshing during inference. Extensive experiments show that HyMEM consistently improves open-source GUI
agents, enabling 7B/8B backbones to match or surpass strong closed-source models; notably, it boosts Qwen2.5-VL-7B by +22.5% and outperforms Gemini2.5-Pro-
Vision and GPT-4o.
Read the full abstract ▾
All authors Sibo Zhu, Wenyi Wu, Kun Zhou, Stephen Wang, Biwei Huang
Machine Learning · Cross-listed from quant-ph
Peiyong Wang, Kieran Hymas and James Quach
Whether uniquely
quantum resources confer advantages in fully classical, competitive environments remains an open question. Competitive zero-sum reinforcement learning is particularly challenging, as success requires modelling dynamic interactions between opposing
agents rather than static state-action mappings. Here, we conduct a controlled study isolating the role of
quantum entanglement in a
quantum-classical hybrid
agent trained on Pong, a competitive Markov game. An 8-
qubit parameterised
quantum circuit serves as a feature extractor within a proximal policy optimisation framework, allowing direct comparison between separable
circuits and architectures incorporating fixed (CZ) or trainable (IsingZZ) entangling gates. Entangled
circuits consistently outperform separable counterparts with comparable parameter counts and, in low-capacity regimes, match or exceed classical multilayer perceptron baselines. Representation similarity analysis further shows that entangled
circuits learn structurally distinct features, consistent with improved modelling of interacting state variables. These findings establish
entanglement as a function resource for representation learning in competitive reinforcement learning.
Read the full abstract ▾
Machine Learning · Cross-listed from stat.ML
MultiwayPAM: Multiway Partitioning Around Medoids for LLM-as-a-Judge Score Analysis
Chihiro Watanabe and Jingyu Sun
LLM-as-a-Judge is a flexible framework for text evaluation, which allows us to obtain scores for the quality of a given text from various perspectives by changing the
prompt template. Two main challenges in using LLM-as-a-Judge are computational cost of inference using a large
language model (LLM), especially when evaluating a large number of instances, and inherent bias of an LLM evaluator. To address these issues and reveal the structure of score bias caused by an LLM evaluator, we propose to apply a tensor clustering method to a given LLM-as-a-Judge score tensor, whose entries are the scores for different combinations of questions, answerers, and evaluators. Specifically, we develop a new tensor clustering method MultiwayPAM, with which we can simultaneously estimate the cluster membership and the medoids for each mode of a given data tensor. By observing the medoids obtained by MultiwayPAM, we can gain knowledge about the membership of each question/answerer/evaluator cluster. We experimentally show the effectiveness of MultiwayPAM by applying it to the score tensors for two practical
datasets.
Read the full abstract ▾
Machine Learning
Copula-ResLogit: A Deep-Copula Framework for Unobserved Confounding Effects
Kimia Kamal and Bilal Farooq
A key challenge in travel demand analysis is the presence of unobserved factors that may generate non-causal dependencies, obscuring the true causal effects. To address the issue, the study introduces a novel deep learning based fully interpretable joint modelling framework, Copula-ResLogit, which integrates the flexibility of Residual Neural Network (ResNet) architectures with the dependence capturing capabilities of copula models. This hybrid structure enables us to first detect unobserved confounding through traditional copula function based joint modelling and then mitigate these hidden associations by incorporating deep learning components. The study applies this framework to two case studies, including the relationship between stress levels and wait time of pedestrians when crossing mid block in VR and the dependencies between travel mode choice and travel distance in London travel behaviour data. Results show that Copula-ResLogit substantially reduces or eliminates the dependencies, demonstrating the ability of residual layers to account for hidden confounding effects.
Read the full abstract ▾