Machine Learning · Cross-listed from cs.IR
Hierarchical Book Organization for Learning-Resource Discovery using Dual-Path Graph Convolutions
Suraj Kumar, Utsav Kumar Nareti, Soumi Chattopadhyay et al. (+2 more)
The growing availability of books and textual materials in digital learning environments necessitates reliable semantic organization to support scalable resource management and discovery. However, existing book classification approaches typically formulate genre prediction as a flat classification problem, overlooking both the hierarchical organization of literary categories and the semantic discrepancy between authoritative book descriptions and subjective crowd-sourced reviews. We propose {\titleabbr}, a hierarchical book classification framework for structured learning-resource organization that reformulates genre prediction as coarse-to-fine semantic
reasoning over heterogeneous textual evidence. HiGeMine first performs blurb-guided semantic refinement to preserve semantically consistent reviews while suppressing noisy and genre-irrelevant interpretations. It then performs semantic-role-separated hierarchical graph
reasoning through independent propagation branches for blurbs and reviews, enabling separate modeling of narrative and interpretive semantics during hierarchical inference. A coarse-grained level-1 classifier first distinguishes fiction from non-fiction, followed by domain-specialized level-2 multi-label classifiers for fine-grained genre prediction. HiGeMine captures relationships among fine-grained resource categories through a structured label co-occurrence graph and genre-conditioned semantic representations. To facilitate systematic evaluation, we curate a new hierarchical multi-label Goodreads
benchmark containing paired blurbs and reviews. Experiments against hierarchical classifiers, graph-based approaches, pretrained LMs, and LLMs demonstrate the effectiveness of HiGeMine for reliable hierarchical book classification, thereby providing a scalable foundation for organizing and discovering textual resources in digital learning environments.
Read the full abstract ▾
All authors Suraj Kumar, Utsav Kumar Nareti, Soumi Chattopadhyay, Chandranath Adak, Prolay Mallick
Machine Learning
Feature Learning Dynamics in Infinite-Depth Neural Networks
Zihan Yao, Ruoyu Wu and Tianxiang Gao
Deep neural networks have achieved remarkable success in practice, yet a mechanistic understanding of how features evolve during training remains incomplete, especially in the large-depth limit. For ResNets under depth-$\mu$P scaling, prior work treats the layer index $\ell$ as a continuous time $t_\ell = \ell/L$, yielding SDE descriptions of the training dynamics. A key unresolved issue is that backpropagation reuses each forward weight
matrix $W_\ell$ through its transpose $W_\ell^\top$, creating correlations between forward features and backward gradients whose behavior and role in feature learning remain unclear. We study this reused-weight forward–backward coupling in one-layer ResNets under depth-$\mu$P. Using conditional Gaussian representations, we explicitly separate the coupling terms induced by weight reuse from decoupled Gaussian fluctuations before taking any network limit. At initialization, we prove that the coupling is a finite-width effect and vanishes at rate $O(n^{-1})$, uniformly over depth. During training, however, SGD induces a nontrivial forward–backward correlation term that survives the infinite-width limit. The key depth effect is that, under depth-$\mu$P scaling, this surviving term is higher order in depth and its accumulated contribution over layers becomes negligible as $L\to\infty$. This depth-induced suppression motivates Neural Feature Dynamics (NFD), a forward–backward SDE system with decoupled backward weights that retains the feature-gradient covariance structure generated during training. Under nondegeneracy assumptions, we prove that the finite-network training dynamics converge to its NFD limit with an $O(L^{-1})$ depth-discretization error, while the reused-weight coupling term has a faster $O(L^{-2})$ decay. These results provide a rigorous infinite-depth limit for the feature-learning dynamics of one-layer ResNets under depth-$\mu$P.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
DexAvatar: 3D Sign Language Reconstruction with Hand and Body Pose Priors
Kaustubh Kundu, Hrishav Bakul Barua, Lucy Robertson-Bell et al. (+2 more)
The trend in sign
language generation is centered around data-driven generative methods that require vast amounts of precise 2D and 3D human pose data to achieve an acceptable generation quality. However, currently, most sign
language datasets are
video-based and limited to automatically reconstructed 2D human poses (i.e., keypoints) and lack accurate 3D information. Furthermore, existing state-of-the-art for automatic 3D human pose estimation from sign
language videos is prone to self-occlusion, noise, and motion blur effects, resulting in poor reconstruction quality. In response to this, we introduce DexAvatar, a novel framework to reconstruct bio-mechanically accurate fine-grained hand articulations and body movements from in-the-wild
monocular sign
language videos, guided by learned 3D hand and body priors. DexAvatar achieves strong performance in the SGNify motion capture
dataset, the only
benchmark available for this task, reaching an improvement of 35.11% in the estimation of body and hand poses compared to the state-of-the-art. The official website of this work is: https://github.com/kaustesseract/DexAvatar.
Read the full abstract ▾
All authors Kaustubh Kundu, Hrishav Bakul Barua, Lucy Robertson-Bell, Zhixi Cai, Kalin Stefanov
Machine Learning · Cross-listed from cs.CR
zkFL-Health: Blockchain-Enabled Zero-Knowledge Federated Learning for Medical AI Privacy
Savvy Sharma, George Petrovic and Sarthak Kaushik
Healthcare AI needs large, diverse
datasets, yet strict
privacy and governance constraints prevent raw data sharing across institutions.
Federated learning (FL) mitigates this by training where data reside and exchanging only model updates, but practical deployments still face two core risks: (1)
privacy leakage via gradients or updates (membership inference, gradient inversion) and (2) trust in the aggregator, a single point of failure that can drop, alter, or inject contributions undetected. We present zkFL-Health, an architecture that combines FL with zero-knowledge proofs (ZKPs) and Trusted Execution Environments (TEEs) to deliver
privacy-preserving, verifiably correct collaborative training for medical AI. Clients locally train and commit their updates; the aggregator operates within a TEE to compute the global update and produces a succinct ZK proof (via
Halo2/Nova) that it used exactly the committed inputs and the correct aggregation rule, without revealing any client update to the host. Verifier nodes validate the proof and record cryptographic commitments on-chain, providing an immutable audit trail and removing the need to trust any single party. We outline system and threat models tailored to healthcare, the zkFL-Health protocol, security/
privacy guarantees, and a performance evaluation plan spanning accuracy,
privacy risk, latency, and cost. This framework enables multi-institutional medical AI with strong confidentiality, integrity, and auditability, key properties for clinical adoption and regulatory compliance.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.IR
Agentic Multi-Persona Framework for Evidence-Aware Fake News Detection
Roopa Bukke, Soumya Pandey, Suraj Kumar et al. (+2 more)
The rapid proliferation of online misinformation threatens the stability of digital social systems and poses significant risks to public trust, policy, and safety, necessitating reliable automated fake news detection. Existing methods often struggle with
multimodal content, domain generalization, and explainability. We propose AMPEND-LS, an agentic multi-persona evidence-grounded framework with LLM-SLM synergy for
multimodal fake news detection. AMPEND-LS integrates textual, visual, and contextual signals through a structured
reasoning pipeline powered by LLMs, augmented with reverse image search, knowledge graph paths, and persuasion strategy analysis. To improve reliability, we introduce a credibility fusion mechanism combining semantic similarity, domain trustworthiness, and temporal context, and a complementary SLM classifier to mitigate LLM uncertainty and
hallucinations. Extensive experiments across three
benchmark datasets demonstrate that AMPEND-LS consistently outperformed state-of-the-art baselines in accuracy, F1 score, and robustness. Qualitative case studies further highlight its transparent
reasoning and resilience against evolving misinformation. This work advances the development of adaptive, explainable, and evidence-aware systems for safeguarding online information integrity.
Read the full abstract ▾
All authors Roopa Bukke, Soumya Pandey, Suraj Kumar, Soumi Chattopadhyay, Chandranath Adak
Machine Learning · Cross-listed from math.AG
Critical Points of Degenerate Metrics on Algebraic Varieties: A Tale of Overparametrization
Giovanni Luca Marchetti, Erin Connelly, Paul Breiding et al. (+1 more)
We study the critical points over an algebraic variety of an optimization problem defined by a quadratic objective that is degenerate. This scenario arises in machine learning when the
dataset size is small with respect to the model, and is typically referred to as overparametrization. Our main result relates the degenerate optimization problem to a nondegenerate one via a projection. In the highly-degenerate regime, we find that a central role is played by the ramification locus of the projection. Additionally, we provide tools for counting the number of critical points over projective varieties, and discuss specific cases arising from deep learning. Our work bridges tools from algebraic geometry with ideas from machine learning, and it extends the line of literature around the Euclidean distance degree to the degenerate setting.
Read the full abstract ▾
All authors Giovanni Luca Marchetti, Erin Connelly, Paul Breiding, Kathlén Kohn
Machine Learning · Cross-listed from cs.IR
Towards Better Search with Domain-Aware Text Embeddings for C2C Marketplaces
Andre Rusli, Miao Cao, Shoma Ishimoto et al. (+2 more)
Consumer-to-consumer (C2C) marketplaces pose distinct
retrieval challenges: short, ambiguous queries; noisy, user-generated listings; and strict production constraints. This paper reports our experiment to build a domain-aware Japanese text-
embedding approach to improve the quality of search at Mercari, Japan's largest C2C marketplace. We experimented with fine-tuning on purchase-driven query-title pairs, using role-specific prefixes to model query-item asymmetry. To meet production constraints, we apply Matryoshka Representation Learning to obtain compact, truncation-robust
embeddings. Offline evaluation on historical search logs shows consistent gains over a strong generic encoder, with particularly large improvements when replacing PCA compression with Matryoshka truncation. A manual assessment further highlights better handling of proper nouns, marketplace-specific semantics, and term-importance
alignment. Additionally, an initial online A/B test demonstrates statistically significant improvements in revenue per user and search-flow efficiency, with transaction frequency maintained. Results show that domain-aware
embeddings improve relevance and efficiency at scale and form a practical foundation for richer LLM-era search experiences.
Read the full abstract ▾
All authors Andre Rusli, Miao Cao, Shoma Ishimoto, Sho Akiyama, Max Frenzel
Machine Learning · Cross-listed from stat.ML
Enhancing diffusion models with Gaussianization preprocessing
Li Cunzhi, Louis Kang and Hideaki Shimazaki
Diffusion models are a class of generative models that have demonstrated remarkable success in tasks such as image generation. However, one of the bottlenecks of these models is slow sampling due to the delay before the onset of trajectory bifurcation, at which point substantial reconstruction begins. This issue degrades generation quality, especially in the early stages. Our primary objective is to mitigate bifurcation-related issues by preprocessing the training data to enhance reconstruction quality, particularly for small-scale network architectures. Specifically, we propose applying Gaussianization preprocessing to the training data to make the target distribution more closely resemble an independent Gaussian distribution, which serves as the initial density of the reconstruction process. This preprocessing step simplifies the model's task of learning the target distribution, thereby improving generation quality even in the early stages of reconstruction with small networks. The proposed method is, in principle, applicable to a broad range of generative tasks, enabling more stable and efficient sampling processes.
Read the full abstract ▾
Machine Learning
LLM Swiss Round: Aggregating Multi-Benchmark Performance via Competitive Swiss-System Dynamics
Jiashuo Liu, Jiayun Wu, Chunjie Wu et al. (+5 more)
The rapid proliferation of Large
Language Models (LLMs) and diverse specialized
benchmarks necessitates a shift from fragmented, task-specific metrics to a holistic, competitive ranking system that effectively aggregates performance across multiple ability dimensions. Primarily using static scoring, current evaluation methods are fundamentally limited. They struggle to determine the proper mix ratio across diverse
benchmarks, and critically, they fail to capture a model's dynamic competitive fitness or its vulnerability when confronted with sequential, high-stakes tasks. To address this, we introduce the novel Competitive Swiss-System Dynamics (CSD) framework. CSD simulates a multi-round, sequential contest where models are dynamically paired across a curated sequence of
benchmarks based on their accumulated win-loss record. And Monte Carlo Simulation ($N=100,000$ iterations) is used to approximate the statistically robust Expected Win Score ($E[S_m]$), which eliminates the noise of random pairing and early-round luck. Furthermore, we implement a Failure Sensitivity Analysis by parameterizing the per-round elimination quantity ($T_k$), which allows us to profile models based on their risk appetite–distinguishing between robust generalists and aggressive specialists. We demonstrate that CSD provides a more nuanced and context-aware ranking than traditional aggregate scoring and static pairwise models, representing a vital step towards risk-informed, next-generation LLM evaluation.
Read the full abstract ▾
All authors Jiashuo Liu, Jiayun Wu, Chunjie Wu, Jingkai Liu, Zaiyuan Wang, Huan Zhou, Wenhao Huang, Hongseok Namkoong
Machine Learning · Cross-listed from stat.ML
Learning from Neighbors with PHIBP: Predicting Infectious Disease Dynamics in Data-Sparse Environments
Edwin Fong, Lancelot F. James and Juho Lee
Modeling sparse count data, which arise across numerous scientific fields, presents significant statistical challenges. This chapter addresses these challenges in the context of infectious disease prediction, with a focus on predicting outbreaks in geographic regions that have historically reported zero cases. To this end, we present the detailed computational framework and experimental application of the Poisson Hierarchical Indian Buffet Process (PHIBP), with demonstrated success in handling sparse count data in microbiome and ecological studies. The PHIBP's architecture, grounded in the concept of absolute abundance, systematically borrows statistical strength from related regions and circumvents the known sensitivities of relative-rate methods to zero counts. Through a series of experiments on infectious disease data, we show that this principled approach provides a robust foundation for generating coherent predictive distributions and for the effective use of comparative measures such as alpha and beta diversity. The chapter's emphasis on algorithmic implementation and experimental results confirms that this unified framework delivers both accurate outbreak predictions and meaningful epidemiological insights in data-sparse settings.
Read the full abstract ▾
Machine Learning
CoSeNet: A Novel Approach for Optimal Segmentation of Correlation Matrices
Alberto. Palomo-Alonso, David Casillas-Perez, Silvia Jimenez-Fernandez et al. (+2 more)
In this paper, we propose a novel approach for the optimal identification of correlated segments in noisy correlation
matrices. The proposed model is known as CoSeNet (Correlation Seg-mentation Network) and is based on a four-layer algorithmic architecture that includes several processing layers: input, formatting, re-scaling, and
segmentation layer. The proposed model can effectively identify correlated segments in such
matrices, better than previous approaches for similar problems. Internally, the proposed model utilizes an overlapping technique and uses pre-trained Machine Learning (ML)
algorithms, which makes it robust and generalizable. CoSeNet approach also includes a method that optimizes the parameters of the re-scaling layer using a heuristic
algorithm and fitness based on a Window Difference-based metric. The output of the model is a binary noise-free
matrix representing optimal
segmentation as well as its seg-mentation points and can be used in a variety of applications, obtaining compromise solutions between efficiency,
memory, and speed of the proposed deployment model.
Read the full abstract ▾
All authors Alberto. Palomo-Alonso, David Casillas-Perez, Silvia Jimenez-Fernandez, Antonio Portilla-Figueras, Sancho Salcedo-Sanz
Machine Learning · Cross-listed from cs.CL
Automatic Replication of LLM Mistakes in Medical Conversations
Oleksii Proniakin, Diego Fajardo, Ruslan Nazarenko et al. (+1 more)
Large
language models (LLMs) are increasingly evaluated in clinical settings using multi-dimensional rubrics which quantify
reasoning quality, safety, and patient-centeredness. Yet, replicating specific mistakes in other LLM models is not straightforward and often requires manual effort. We introduce MedMistake, an automatic pipeline that extracts mistakes LLMs make in patient-doctor conversations and converts them into a
benchmark of single-shot QA pairs. Our pipeline (1) creates complex, conversational data between an LLM patient and LLM doctor, (2) runs an evaluation with a committee of 2 LLM judges across a variety of dimensions and (3) creates simplified single-shot QA scenarios from those mistakes. We release MedMistake-All, a
dataset of 3,390 single-shot QA pairs where GPT-5 and Gemini 2.5 Pro are currently failing to answer correctly, as judged by two LLM judges. We used medical experts to validate a subset of 211/3390 questions (MedMistake-Bench), which we used to run a final evaluation of 12 frontier LLMs: Claude Opus 4.5, Claude Sonnet 4.5, DeepSeek-Chat, Gemini 2.5 Pro, Gemini 3 Pro, GPT-4o, GPT-5, GPT-5.1, GPT-5.2, Grok 4, Grok 4.1, Mistral Large. We found that GPT models, Claude and Grok obtained the best performance on MedMistake-Bench. We release both the doctor-validated
benchmark (MedMistake-Bench), as well as the full
dataset (MedMistake-All) at https://huggingface.co/
datasets/TheLumos/MedicalMistakeBenchmark.
Read the full abstract ▾
All authors Oleksii Proniakin, Diego Fajardo, Ruslan Nazarenko, Razvan Marinescu
Machine Learning · Cross-listed from eess.AS
GenTSE: Enhancing Target Speaker Extraction via a Coarse-to-Fine Generative Language Model
Haoyang Li, Xuyi Zhuang, Azmat Adnan et al. (+6 more)
Language Model (LM)-based generative modeling has emerged as a promising direction for TSE, offering potential for improved generalization and high-fidelity
speech. We propose GenTSE, a two-stage decoder-only generative LM for TSE: Stage-1 predicts coarse semantic
tokens, and Stage-2 generates fine acoustic
tokens. Separating semantics and acoustics stabilizes decoding and yields more accurate target
speech. Both stages use continuous SSL or codec
embeddings, offering richer context than discretized-
prompt methods. To reduce exposure bias, we employ a Frozen-LM Conditioning training strategy that conditions the LMs on predicted
tokens from earlier checkpoints to reduce the gap between teacher-forcing training and autoregressive inference. We further apply DPO to better align outputs with perceptual preferences. Experiments on Libri2Mix show that GenTSE surpasses previous LM-based systems in
speech quality, intelligibility, and speaker consistency.
Read the full abstract ▾
All authors Haoyang Li, Xuyi Zhuang, Azmat Adnan, Ye Ni, Wei Rao, Shreyas Gopal, Eng Siong Chng, Boon Siew Han, Yuanjin Zheng
Machine Learning
Meta-RL with Bayesian Linear Task Models
Jingyang You and Hanna Kurniawati
Deep
Bayesian reinforcement learning adapts to unseen tasks by inferring latent transition and reward models, but existing methods typically rely on variational posteriors and evidence lower bounds, introducing approximation error and unstable task representations. We introduce GLiBRL, a deep
Bayesian RL framework that combines generalised linear task models with learnable non-linear basis functions. GLiBRL features conjugate
Bayesian inference, yielding exact, sequential posterior updates over task parameters and model noise, together with a closed-form marginal likelihood that eliminates variational inference. The update is naturally permutation-invariant, allowing GLiBRL to integrate with both off- and on-policy
algorithms. GLiBRL also learns task representation admitting an exact kernel identity, relating distances between task representations to kernel discrepancies over the task contexts. Compared against eight representative or recent meta reinforcement learning methods, GLiBRL achieves the highest aggregate zero-shot test performance on both the MuJoCo locomotion and MetaWorld manipulation
benchmarks.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.DC
Deadline-Aware Online Scheduling for LLM Fine-Tuning with Spot Market Predictions
Linggao Kong, Yuedong Xu, Lei Jiao et al. (+1 more)
As foundation models grow in size, fine-tuning them becomes increasingly expensive. While GPU spot instances offer a low-cost alternative to on-demand resources, their volatile prices and availability make deadline-aware scheduling particularly challenging. We tackle this difficulty by using a mix of spot and on-demand instances. Distinctively, we show the predictability of prices and availability in a spot instance
market, the power of prediction in enabling cost-efficient scheduling and its sensitivity to estimation errors. An integer programming problem is formulated to capture the use of mixed instances under both the price and availability dynamics. We propose an online allocation
algorithm with prediction based on the committed horizon control approach that leverages a commitment level to enforce the partial sequence of decisions. When this prediction becomes inaccurate, we further present a complementary online
algorithm without predictions. An online policy selection
algorithm is developed that learns the best policy from a pool constructed by varying the parameters of both
algorithms. We prove that the prediction-based
algorithm achieves tighter performance bounds as prediction error decreases, while the policy selection
algorithm possesses a regret bound of $\mathcal{O}(\sqrt{T})$. Experimental results demonstrate that our online framework can adaptively select the best policy under varying spot
market dynamics and prediction quality, consistently outperforming baselines and improving utility by up to 54.8%.
Read the full abstract ▾
All authors Linggao Kong, Yuedong Xu, Lei Jiao, Chuan Xu
Machine Learning
Generalization of Diffusion Models Arises with a Balanced Representation Space
Zekai Zhang, Xiao Li, Xiang Li et al. (+4 more)
Diffusion models excel at generating high-quality, diverse samples, yet they risk memorizing training data when overfit to the training objective. We analyze the distinctions between memorization and generalization in
diffusion models through the lens of representation learning. By investigating a two-layer ReLU denoising autoencoder (DAE), we prove that (i) memorization corresponds to the model storing raw training samples in the learned weights for encoding and decoding, yielding localized spiky representations, whereas (ii) generalization arises when the model captures local data statistics, producing balanced representations. Furthermore, we validate these theoretical findings on real-world unconditional and text-to-image
diffusion models, demonstrating that the same representation structures emerge in deep generative models with significant practical implications. Building on these insights, we propose a representation-based method for detecting memorization and a training-free editing technique that allows precise control via representation steering. Together, our results highlight that learning good representations is central to novel and meaningful generative modeling.
Read the full abstract ▾
All authors Zekai Zhang, Xiao Li, Xiang Li, Lianghe Shi, Meng Wu, Molei Tao, Qing Qu
Machine Learning
Can Agentic AI Match the Performance of Human Data Scientists?
An Luo, Jin Du, Fangqiao Tian et al. (+9 more)
Data science plays a critical role in transforming complex data into actionable insights across numerous domains. Recent developments in large
language models (LLMs) have significantly automated data science workflows, but a fundamental question persists: Can these agentic AI systems truly match the performance of human data scientists who routinely leverage domain-specific knowledge? We explore this question by designing a prediction task where a crucial latent variable is hidden in relevant image data instead of tabular features. As a result, agentic AI that generates generic codes for modeling tabular data cannot perform well, while human experts could identify the important hidden variable using domain knowledge. We demonstrate this idea with a synthetic
dataset for property insurance. Our experiments show that agentic AI that relies on generic analytics workflow falls short of methods that use domain-specific insights. This highlights a key limitation of the current agentic AI for data science and underscores the need for future research to develop agentic AI systems that can better recognize and incorporate domain knowledge.
Read the full abstract ▾
All authors An Luo, Jin Du, Fangqiao Tian, Xun Xian, Robert Specht, Ganghua Wang, Xuan Bi, Charles Fleming, Jayanth Srinivasa, Ashish Kundu, Mingyi Hong, Jie Ding
Machine Learning
ReACT-Drug: Reaction-Template Guided Reinforcement Learning for de novo Drug Design
R Yadunandan and Nimisha Ghosh
De novo drug design is a crucial component of modern drug development, yet navigating the vast chemical space to find synthetically accessible, high-affinity candidates remains a significant challenge. Reinforcement Learning (RL) enhances this process by enabling multi-objective optimization and exploration of novel chemical space - capabilities that traditional supervised learning methods lack. In this work, we introduce ReACT-Drug, a fully integrated, target-agnostic molecular design framework based on Reinforcement Learning. Unlike models requiring target-specific fine-tuning, ReACT-Drug utilizes a generalist approach by leveraging ESM-2
protein embeddings to identify similar
proteins for a given target from a knowledge base such as
Protein Data Base (PDB). Thereafter, the known drug ligands corresponding to such
proteins are decomposed to initialize a fragment-based search space, biasing the
agent towards biologically relevant subspaces. For each such fragment, the pipeline employs a Proximal Policy Optimization (PPO)
agent guiding a ChemBERTa-encoded molecule through a dynamic action space of chemically valid, reaction-template-based transformations. This results in the generation of de novo drug candidates with competitive binding affinities and high synthetic accessibility, while ensuring 100% chemical validity and novelty as per MOSES benchmarking. This architecture highlights the potential of integrating structural biology, deep representation learning, and chemical synthesis rules to automate and accelerate rational drug design. The
dataset and code are available at https://github.com/YadunandanRaman/ReACT-Drug/.
Read the full abstract ▾
Machine Learning
Solving Functional PDEs with Gaussian Processes and Applications to Functional Renormalization Group Equations
Xianjin Yang, Matthieu Darcy, Matthew Hudes et al. (+3 more)
We present an operator learning framework for solving non-perturbative functional renormalization group equations, which are integro-differential equations defined on functionals. Our proposed approach uses Gaussian process operator learning to construct a flexible functional representation formulated directly on function space, making it independent of a particular equation or discretization. Our method is flexible, and can apply to a broad range of functional differential equations while still allowing for the incorporation of physical priors in either the prior mean or the kernel design. We demonstrate the performance of our method on several relevant equations, such as the Wetterich and Wilson–Polchinski equations, showing that it achieves equal or better performance than existing approximations such as the local-potential approximation, while being significantly more flexible. In particular, our method can handle non-constant fields, making it promising for the study of more complex field configurations, such as instantons.
Read the full abstract ▾
All authors Xianjin Yang, Matthieu Darcy, Matthew Hudes, Francis J. Alexander, Gregory Eyink, Houman Owhadi
Machine Learning · Cross-listed from cs.CL
MultiMind at SemEval-2025 Task 7: Crosslingual Fact-Checked Claim Retrieval via Multi-Source Alignment
Mohammad Mahdi Abootorabi, Alireza Ghahramani Kure, Mohammadali Mohammadkhani et al. (+2 more)
This paper presents our system for SemEval-2025 Task 7:
Multilingual and Crosslingual Fact-Checked Claim
Retrieval. In an era where misinformation spreads rapidly, effective fact-checking is increasingly critical. We introduce TriAligner, a novel approach that leverages a dual-encoder architecture with contrastive learning and incorporates both native and English translations across different modalities. Our method effectively retrieves claims across multiple
languages by learning the relative importance of different sources in
alignment. To enhance robustness, we employ efficient data preprocessing and augmentation using large
language models while incorporating hard negative sampling to improve representation learning. We evaluate our approach on monolingual and crosslingual
benchmarks, demonstrating significant improvements in
retrieval accuracy and fact-checking performance over baselines.
Read the full abstract ▾
All authors Mohammad Mahdi Abootorabi, Alireza Ghahramani Kure, Mohammadali Mohammadkhani, Sina Elahimanesh, Mohammad Ali Ali Panah
Machine Learning · Cross-listed from cs.GR
AirGS: Real-Time 4D Gaussian Streaming for Free-Viewpoint Video Experiences
Zhe Wang, Jinghang Li and Yifei Zhu
Free-viewpoint
video (FVV) enables immersive viewing experiences by allowing users to view scenes from arbitrary perspectives. As a prominent reconstruction technique for FVV generation, 4D Gaussian Splatting (4DGS) models dynamic scenes with time-varying 3D Gaussian ellipsoids and achieves high-quality rendering via fast rasterization. However, existing 4DGS approaches suffer from quality degradation over long sequences and impose substantial bandwidth and storage overhead, limiting their applicability in real-time and wide-scale deployments. Therefore, we present AirGS, a streaming-optimized 4DGS framework that rearchitects the training and delivery pipeline to enable high-quality, low-latency FVV experiences. AirGS converts Gaussian
video streams into multi-channel 2D formats and intelligently identifies keyframes to enhance frame reconstruction quality. It further combines temporal coherence with inflation loss to reduce training time and representation size. To support communication-efficient transmission, AirGS models 4DGS delivery as an integer linear programming problem and design a lightweight
pruning level selection
algorithm to adaptively prune the Gaussian updates to be transmitted, balancing reconstruction quality and bandwidth consumption. Extensive experiments demonstrate that AirGS reduces quality deviation in PSNR by more than 20% when scene changes, maintains frame-level PSNR consistently above 30, accelerates training by 6 times, reduces per-frame transmission size by nearly 50% compared to the SOTA 4DGS approaches.
Read the full abstract ▾
Machine Learning
A Multi-fidelity Double-Delta Wing Dataset and Empirical Scaling Laws for GNN-based Aerodynamic Field Surrogate
Yiren Shen and Juan J. Alonso
Data-driven surrogate models are increasingly adopted to accelerate vehicle design. However, open-source multi-fidelity
datasets and empirical guidelines linking
dataset size to model performance remain limited. This study investigates the relationship between training data size and prediction accuracy for a graph neural network (GNN) based surrogate model for aerodynamic field prediction. We release an open-source, multi-fidelity aerodynamic
dataset for double-delta wings, comprising 2448 flow snapshots across 272 geometries evaluated at angles of attack from 11 (degree) to 19 (degree) at Ma=0.3 using both
Vortex Lattice Method (VLM) and Reynolds-Averaged Navier-Stokes (RANS) solvers. The geometries are generated using a nested Saltelli sampling scheme to support future
dataset expansion and variance-based sensitivity analysis. Using this
dataset, we conduct a preliminary empirical scaling study of the MF-VortexNet surrogate by constructing six training
datasets with sizes ranging from 40 to 1280 snapshots and training models with 0.1 to 2.4 million parameters under a fixed training budget. We find that the test error decreases with data size with a power-law exponent of -0.6122, indicating efficient data utilization. Based on this scaling law, we estimate that the optimal sampling density is approximately eight samples per dimension in a d-dimensional design space. The results also suggest improved data utilization efficiency for larger surrogate models, implying a potential trade-off between
dataset generation cost and model training budget.
Read the full abstract ▾
Machine Learning
Guardrailed Elasticity Pricing: A Churn-Aware Forecasting Playbook for Subscription Strategy
Deepit Sapru
This paper presents a marketing analytics framework that operationalizes subscription pricing as a dynamic, guardrailed decision system, uniting multivariate demand
forecasting, segment-level price elasticity, and churn propensity to optimize revenue, margin, and retention. The approach blends seasonal time-series models with tree-based learners, runs Monte Carlo scenario tests to map risk envelopes, and solves a constrained optimization that enforces business guardrails on customer experience, margin floors, and allowable churn. Validated across heterogeneous SaaS portfolios, the method consistently outperforms static tiers and uniform uplifts by reallocating price moves toward segments with higher willingness-to-pay while protecting price-sensitive cohorts. The system is designed for real-time recalibration via modular APIs and includes model explainability for governance and compliance. Managerially, the framework functions as a strategy playbook that clarifies when to shift from flat to dynamic pricing, how to align pricing with CLV and MRR targets, and how to embed ethical guardrails, enabling durable growth without eroding customer trust.
Read the full abstract ▾
Machine Learning · Cross-listed from q-bio.BM
Clever Hans in Chemistry: Chemist Style Signals Confound Activity Prediction on Public Benchmarks
Andrew D. Blevins and Ian K. Quigley
Can machine learning models identify which chemist made a molecule from structure alone? If so, models trained on literature data may exploit chemist intent rather than learning causal structure-activity relationships. We test this by linking CHEMBL assays to publication authors and training a 1,815-class classifier to predict authors from molecular fingerprints, achieving 60% top-5 accuracy under scaffold-based splitting. We then train an activity model that receives only a
protein identifier and an author-probability vector derived from structure, with no direct access to molecular descriptors. This author-only model achieves predictive power comparable to a simple baseline that has access to structure. This reveals a "Clever Hans" failure mode: models can predict bioactivity largely by inferring chemist goals and favorite targets without requiring a lab-independent understanding of chemistry. We analyze the sources of this leakage, propose author-disjoint splits, and recommend
dataset practices to decouple chemist intent from biological outcomes.
Read the full abstract ▾
Machine Learning
RevFFN: Memory-Efficient Full-Parameter Fine-Tuning of Mixture-of-Experts LLMs with Reversible Blocks
Ningyuan Liu, Jing Yang, Kaitong Cai et al. (+1 more)
Full parameter fine tuning is a key technique for adapting large
language models (LLMs) to downstream tasks, but it incurs substantial
memory overhead due to the need to cache extensive intermediate activations for backpropagation. This bottleneck makes full fine tuning of contemporary large scale LLMs challenging in practice. Existing distributed training frameworks such as DeepSpeed alleviate this issue using techniques like ZeRO and FSDP, which rely on multi GPU
memory or CPU offloading, but often require additional hardware resources and reduce training speed. We introduce RevFFN, a
memory efficient fine tuning paradigm for mixture of experts (MoE) LLMs. RevFFN employs carefully designed reversible
Transformer blocks that allow reconstruction of layer input activations from outputs during backpropagation, eliminating the need to store most intermediate activations in
memory. While preserving the expressive capacity of MoE architectures, this approach significantly reduces peak
memory consumption for full parameter fine tuning. As a result, RevFFN enables efficient full fine tuning on a single consumer grade or server grade GPU.
Read the full abstract ▾
All authors Ningyuan Liu, Jing Yang, Kaitong Cai, Keze Wang
Machine Learning
Towards a General Framework for Predicting and Explaining the Hardness of Graph-based Combinatorial Optimization Problems using Machine Learning and Association Rule Mining
Bharat Sharman and Elkafi Hassini
This study introduces GCO-HPIF, a general machine-learning-based framework to predict and explain the computational hardness of combinatorial optimization problems that can be represented on graphs. The framework consists of two stages. In the first stage, a
dataset is created comprising problem-agnostic graph features and hardness classifications of problem instances. Machine-learning-based classification
algorithms are trained to map graph features to hardness categories. In the second stage, the framework explains the predictions using an association rule mining
algorithm. Additionally, machine-learning-based regression models are trained to predict algorithmic computation times. The GCO-HPIF framework was applied to a
dataset of 3287 maximum clique problem instances compiled from the COLLAB, IMDB, and TWITTER graph
datasets using five state-of-the-art
algorithms, namely three exact branch-and-bound-based
algorithms (Gurobi, CliSAT, and MOMC) and two graph-neural-network-based
algorithms (EGN and HGS). The framework demonstrated excellent performance in predicting instance hardness, achieving a weighted F1 score of 0.9921, a minority-class F1 score of 0.878, and an ROC-AUC score of 0.9083 using only three graph features. The best association rule found by the FP-Growth
algorithm for explaining the hardness predictions had a support of 0.8829 for hard instances and an overall accuracy of 87.64 percent, underscoring the framework's usefulness for both prediction and explanation. Furthermore, the best-performing regression model for predicting computation times achieved a percentage RMSE of 5.12 and an R2 value of 0.991.
Read the full abstract ▾
Machine Learning
DiEC: Diffusion Embedded Clustering
Haidong Hu, Xiaoyu Zheng, Jin Zhou et al. (+8 more)
Deep clustering methods typically rely on a single, well-defined representation for clustering. In contrast, pretrained
diffusion models provide abundant and diverse multi-scale representations across network layers and noise timesteps. However, a key challenge is how to efficiently identify the most clustering-friendly representation in the layer*timestep space. To address this issue, we propose
Diffusion Embedded Clustering (DiEC), an unsupervised framework that performs clustering by leveraging optimal intermediate representations from pretrained
diffusion models. DiEC systematically evaluates the clusterability of representations along the trajectory of network depth and noise timesteps. Meanwhile, an unsupervised search strategy is designed for recognizing the Clustering-optimal Layer (COL) and Clustering-optimal Timestep (COT) in the layer*timestep space of pretrained
diffusion models, aiming to promote clustering performance and reduce computational overhead. DiEC is fine-tuned primarily with a structure-preserving DEC-style KL-divergence objective at the fixed COL + COT, together with a random-timestep
diffusion denoising objective to maintain the generative capability of the pretrained model. Without relying on augmentation-based consistency constraints or contrastive learning, DiEC achieves excellent clustering performance across multiple
benchmark datasets.
Read the full abstract ▾
All authors Haidong Hu, Xiaoyu Zheng, Jin Zhou, Yingxu Wang, Rui Wang, Pei Dong, Shiyuan Han, Lin Wang, C. L. Philip Chen, Tong Zhang, Yuehui Chen
Machine Learning
Time-Efficient Evaluation and Enhancement of Adversarial Robustness in Deep Neural Networks
Runqi Lin
With deep neural networks (DNNs) increasingly embedded in modern society, ensuring their safety has become a critical and urgent issue. In response, substantial efforts have been dedicated to the red-blue
adversarial framework, where the red team focuses on identifying vulnerabilities in DNNs and the blue team on mitigating them. However, existing approaches from both teams remain computationally intensive, constraining their applicability to large-scale models. To overcome this limitation, this thesis endeavours to provide time-efficient methods for the evaluation and enhancement of
adversarial robustness in DNNs.
Read the full abstract ▾
Machine Learning
From GNNs to Symbolic Surrogates via Kolmogorov-Arnold Networks for Delay Prediction
Sami Marouani, Kamal Singh, Baptiste Jeudy et al. (+1 more)
Accurate prediction of flow delay is essential for optimizing and managing modern communication networks. We investigate three levels of modeling for this task. First, we implement a heterogeneous GNN with
attention-based message passing, establishing a strong neural baseline. Second, we propose FlowKANet in which Kolmogorov-Arnold Networks replace standard MLP layers, reducing trainable parameters while maintaining competitive predictive performance. FlowKANet integrates KAMP-Attn (Kolmogorov-Arnold Message Passing with
Attention),
embedding KAN operators directly into message-passing and
attention computation. Finally, we distill the model into symbolic surrogate models using block-wise regression, producing closed-form equations that eliminate trainable weights while preserving graph-structured dependencies. The results show that KAN layers provide a favorable trade-off between efficiency and accuracy and that symbolic surrogates emphasize the potential for lightweight deployment and enhanced transparency.
Read the full abstract ▾
All authors Sami Marouani, Kamal Singh, Baptiste Jeudy, Amaury Habrard
Machine Learning · Cross-listed from cs.CL
Architectural Trade-offs in Small Language Models Under Compute Constraints
Shivraj Singh Bhatti
We present a systematic empirical study of small
language models under strict compute constraints, analyzing how architectural choices and training budget interact to determine performance. Starting from a linear next-
token predictor, we progressively introduce nonlinearities, self-
attention, and multi-layer
transformer architectures, evaluating each on character-level modeling of Tiny Shakespeare and word-level modeling of Penn Treebank (PTB) and WikiText-2. We compare models using test negative log-likelihood (NLL), parameter count, and approximate training FLOPs to characterize accuracy-efficiency trade-offs. Our results show that
attention-based models dominate MLPs in per-FLOP efficiency even at small scale, while increasing depth or context without sufficient optimization can degrade performance. We further examine rotary positional
embeddings (RoPE), finding that architectural techniques successful in large
language models do not necessarily transfer to small-model regimes.
Read the full abstract ▾