Machine Learning
Do Instruction-Tuned Models Always Perform Better Than Base Models? Evidence from Math and Domain-Shifted Benchmarks
Prateek Munjal, Clement Christophe, Ronnie Rajan et al. (+1 more)
Instruction finetuning is standard practice for improving LLM performance, yet it remains unclear whether it enhances
reasoning or merely induces surface-level pattern matching. We investigate this by evaluating base and instruction-tuned models on standard math
benchmarks, structurally perturbed variants, and domain-shifted tasks. Our analysis highlights two key (often overlooked) limitations of instruction tuning. First, the performance advantage is unstable and depends heavily on evaluation settings. In zero-shot CoT settings on GSM8K, base models consistently outperform instruction-tuned variants, with drops as high as 32.67% (Llama3-70B). Instruction-tuned models only match or exceed this performance when provided with few-shot exemplars, suggesting a reliance on specific prompting patterns rather than intrinsic
reasoning. Second, tuning gains are brittle under distribution shift. Our results show that base models surpass instruction-tuned variants on the domain-specific MedCalc
benchmark. Additionally, instruction-tuned models show sharp declines on perturbed
datasets, indicating sensitivity to
prompt structure over robust
reasoning.
Read the full abstract ▾
All authors Prateek Munjal, Clement Christophe, Ronnie Rajan, Praveenkumar Kanithi
Machine Learning
A Comprehensive Evaluation of LLM Reasoning: From Single-Model to Multi-Agent Paradigms
Yapeng Li, Jiakuo Yu, Zhixin Liu et al. (+4 more)
Large
Language Models (LLMs) are increasingly deployed as
reasoning systems, where
reasoning paradigms - such as Chain-of-Thought (CoT) and multi-
agent systems (MAS) - play a critical role, yet their relative effectiveness and cost-accuracy trade-offs remain poorly understood. In this work, we conduct a comprehensive and unified evaluation of
reasoning paradigms, spanning direct single-model generation, CoT-augmented single-model
reasoning, and representative MAS workflows, characterizing their
reasoning performance across a diverse suite of closed-form
benchmarks. Beyond overall performance, we probe role-specific capability demands in MAS using targeted role isolation analyses, and analyze cost-accuracy trade-offs to identify which MAS workflows offer a favorable balance between cost and accuracy, and which incur prohibitive overhead for marginal gains. We further introduce MIMeBench, a new open-ended
benchmark that targets two foundational yet underexplored semantic capabilities - semantic abstraction and contrastive discrimination - thereby providing an alternative evaluation axis beyond closed-form accuracy and enabling fine-grained assessment of semantic competence that is difficult to capture with existing
benchmarks. Our results show that increased structural complexity does not consistently lead to improved
reasoning performance, with its benefits being highly dependent on the properties and suitability of the
reasoning paradigm itself. The codes are released at https://gitcode.com/HIT1920/OpenLLMBench.
Read the full abstract ▾
All authors Yapeng Li, Jiakuo Yu, Zhixin Liu, Xinnan Liu, Jing Yu, Songze Li, Tonghua Su
Machine Learning · Cross-listed from cs.SE
KOCO-BENCH: Can Large Language Models Leverage Domain Knowledge in Software Development?
Xue Jiang, Ge Li, Jiaru Qian et al. (+12 more)
Large
language models (LLMs) excel at general programming but struggle with domain-specific software development, necessitating domain specialization methods for LLMs to learn and utilize domain knowledge and data. However, existing domain-specific code
benchmarks cannot evaluate the effectiveness of domain specialization methods, which focus on assessing what knowledge LLMs possess rather than how they acquire and apply new knowledge, lacking explicit knowledge corpora for developing domain specialization methods. To this end, we present KOCO-BENCH, a novel
benchmark designed for evaluating domain specialization methods in real-world software development. KOCO-BENCH contains 6 emerging domains with 11 software frameworks and 25 projects, featuring curated knowledge corpora alongside multi-granularity evaluation tasks including domain code generation (from function-level to project-level with rigorous test suites) and domain knowledge understanding (via multiple-choice Q&A). Unlike previous
benchmarks that only provide test sets for direct evaluation, KOCO-BENCH requires acquiring and applying diverse domain knowledge (APIs, rules, constraints, etc.) from knowledge corpora to solve evaluation tasks. Our evaluations reveal that KOCO-BENCH poses significant challenges to state-of-the-art LLMs. Even with domain specialization methods (e.g., SFT, RAG, kNN-LM) applied, improvements remain marginal. Best-performing coding
agent, Claude Code, achieves only 34.2%, highlighting the urgent need for more effective domain specialization methods. We release KOCO-BENCH, evaluation code, and baselines to advance further research at https://github.com/jiangxxxue/KOCO-bench.
Read the full abstract ▾
All authors Xue Jiang, Ge Li, Jiaru Qian, Xianjie Shi, Chenjie Li, Hao Zhu, Ziyu Wang, Jielun Zhang, Zheyu Zhao, Lingwei Wu, Kechi Zhang, Jia Li, Wenpin Jiao, Zhi Jin, Yihong Dong
Machine Learning · Cross-listed from cs.HC
RubRIX: Rubric-Driven Risk Mitigation in Caregiver-AI Interactions
Drishti Goel, Jeongah Lee, Qiuyue Joy Zhong et al. (+5 more)
Caregivers seeking AI-mediated support express complex needs—information-seeking, emotional validation, and distress cues—that warrant careful evaluation of response safety and appropriateness. Existing AI evaluation frameworks, primarily focused on general risks (toxicity,
hallucinations, policy violations, etc), may not adequately capture the nuanced risks of LLM-responses in caregiving-contexts. We introduce RubRIX (Rubric-based Risk Index), a theory-driven, clinician-validated framework for evaluating risks in LLM caregiving responses. Grounded in the Elements of an Ethic of Care, RubRIX operationalizes five empirically-derived risk dimensions: Inattention, Bias & Stigma, Information Inaccuracy, Uncritical Affirmation, and Epistemic Arrogance. We evaluate six state-of-the-art LLMs on over 20,000 caregiver queries from Reddit and ALZConnected. Rubric-guided refinement consistently reduced risk-components by 45-98% after one iteration across models. This work contributes a methodological approach for developing domain-sensitive, user-centered evaluation frameworks for high-burden contexts. Our findings highlight the importance of domain-sensitive, interactional risk evaluation for the responsible deployment of LLMs in caregiving support contexts. We release
benchmark datasets to enable future research on contextual risk evaluation in AI-mediated support.
Read the full abstract ▾
All authors Drishti Goel, Jeongah Lee, Qiuyue Joy Zhong, Violeta J. Rodriguez, Daniel S. Brown, Ravi Karkar, Dong Whi Yoo, Koustuv Saha
Machine Learning · Cross-listed from cs.CR
Diffusion-Driven Synthetic Tabular Data Generation for Enhanced DoS/DDoS Attack Classification
Aravind B, Anirud R.S., Sai Surya Teja N et al. (+3 more)
Class imbalance refers to a situation where certain classes in a
dataset have significantly fewer samples than oth- ers, leading to biased model performance. Class imbalance in network intrusion detection using Tabular Denoising
Diffusion Probability Models (TabDDPM) for data augmentation is ad- dressed in this paper. Our approach synthesizes high-fidelity minority-class samples from the CIC-IDS2017
dataset through iterative denoising processes. For the minority classes that have smaller samples, synthetic samples were generated and merged with the original
dataset. The augmented training data enables an ANN classifier to achieve near-perfect recall on previously underrepresented attack classes. These results establish
diffusion models as an effective solution for tabular data imbalance in security domains, with potential applications in fraud detection and medical diagnostics.
Read the full abstract ▾
All authors Aravind B, Anirud R.S., Sai Surya Teja N, Bala Subrahmanya Sriranga Navaneeth A, Karthika R, Mohankumar N
Machine Learning · Cross-listed from stat.ML
Empirical Risk Minimization with $f$-Divergence Regularization
Francisco Daunas, Iñaki Esnaola, Samir M. Perlaza et al. (+1 more)
In this paper, the solution to the empirical risk minimization problem with $f$-divergence regularization (ERM-$f$DR) is presented and conditions under which the solution also serves as the solution to the minimization of the expected empirical risk subject to an $f$-divergence constraint are established. The proposed approach extends applicability to a broader class of $f$-divergences than previously reported and yields theoretical results that recover previously known results. Additionally, the difference between the expected empirical risk of the ERM-$f$DR solution and that of its reference measure is characterized, providing insights into previously studied cases of $f$-divergences. A central contribution is the introduction of the normalization function, a mathematical object that is critical in both the dual formulation and practical computation of the ERM-$f$DR solution. This work presents an implicit characterization of the normalization function as a nonlinear ordinary differential equation (ODE), establishes its key properties, and subsequently leverages them to construct a numerical
algorithm for approximating the normalization factor under mild assumptions. Further analysis demonstrates structural equivalences between ERM-$f$DR problems with different $f$-divergences via transformations of the empirical risk. Finally, the proposed
algorithm is used to compute the training and test risks of ERM-$f$DR solutions under different $f$-divergence regularizers. This numerical example highlights the practical implications of choosing different functions $f$ in ERM-$f$DR problems.
Read the full abstract ▾
All authors Francisco Daunas, Iñaki Esnaola, Samir M. Perlaza, H. Vincent Poor
Machine Learning
LAViG-FLOW: Latent Autoregressive Video Generation for Fluid Flow Simulations
Vittoria De Pellegrini and Tariq Alkhalifah
Modeling and
forecasting subsurface multiphase fluid flow fields underpin applications ranging from geological CO2 sequestration (GCS) operations to geothermal production. This is essential for ensuring both operational performance and long-term safety. While high fidelity multiphase simulators are widely used for this purpose, they become prohibitively expensive once many forward runs are required for inversion purposes and to quantify uncertainty. To tackle this challenge, we propose LAViG-FLOW, a latent autoregressive
video generation
diffusion framework that explicitly learns the coupled
evolution of saturation and pressure fields. Each state variable is compressed by a dedicated 2D autoencoder, and a
Video Diffusion Transformer (VDiT) models their coupled distribution across time. We first train the model on a given time horizon to learn their coupled relationship and then fine-tune it autoregressively so it can extrapolate beyond the observed time window. Evaluated on an open-source CO2 sequestration
dataset, LAViG-FLOW generates saturation and pressure fields that stay consistent across time while running two orders of magnitude faster than traditional numerical solvers.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.CV
From 100,000+ images to winning the first brain MRI foundation model challenges: Sharing lessons and models
Pedro M. Gordaliza, Jaume Banus, Benoît Gérin et al. (+4 more)
Developing Foundation Models for medical image analysis is essential to overcome the unique challenges of radiological tasks. The first challenges of this kind for 3D
brain MRI, SSL3D and FOMO25, were held at MICCAI 2025. Our solution ranked first in tracks of both contests. It relies on a U-Net CNN architecture combined with strategies leveraging anatomical priors and neuroimaging domain knowledge. Notably, our models trained 1-2 orders of magnitude faster and were 10 times smaller than competing
transformer-based approaches. Models are available here: https://github.com/jbanusco/BrainFM4Challenges.
Read the full abstract ▾
All authors Pedro M. Gordaliza, Jaume Banus, Benoît Gérin, Maxence Wynen, Nataliia Molchanova, Jonas Richiardi, Meritxell Bach Cuadra
Machine Learning
NeuroShield: A Neuro-Symbolic Framework for Adversarial Robustness
Ali Shafiee Sarvestani, Jason Schmidt and Arman Roohi
Adversarial vulnerability and lack of interpretability are critical limitations of deep neural networks, especially in safety-sensitive settings such as autonomous driving. We introduce \DesignII, a neuro-symbolic framework that integrates symbolic rule supervision into neural networks to enhance both
adversarial robustness and explainability. Domain knowledge is encoded as logical constraints over appearance attributes such as shape and color, and enforced through semantic and symbolic logic losses applied during training. Using the GTSRB
dataset, we evaluate robustness against FGSM and PGD attacks at a standard $\ell_\infty$ perturbation budget of $\varepsilon = 8/255$. Relative to clean training, standard
adversarial training provides modest improvements in robustness ($\sim$10 percentage points). Conversely, our FGSM-Neuro-Symbolic and PGD-Neuro-Symbolic models achieve substantially larger gains, improving
adversarial accuracy by 18.1% and 17.35% over their corresponding
adversarial-training baselines, representing roughly a three-fold larger robustness gain than standard
adversarial training provides when both are measured relative to the same clean-training baseline, without reducing clean-sample accuracy. Compared to
transformer-based defenses such as LNL-MoEx, which require heavy architectures and extensive data augmentation, our PGD-Neuro-Symbolic variant attains comparable or superior robustness using a ResNet18 backbone trained for 10 epochs. These results show that symbolic
reasoning offers an effective path to robust and interpretable AI.
Read the full abstract ▾
Machine Learning
Training instability in deep learning follows low-dimensional dynamical principles
Zhipeng Zhang, Zhenjie Yao, Kai Li et al. (+1 more)
Deep learning systems achieve remarkable empirical performance, yet the stability of the training process itself remains poorly understood. Training unfolds as a high-dimensional dynamical system in which small perturbations to optimization, data, parameters, or learning signals can induce abrupt and irreversible collapse, undermining reproducibility and scalability. We propose a unified dynamical perspective that characterizes training stability as an intrinsic property of learning systems, organized along four interacting dimensions: optimization, environmental/data, parametric, and learning-signal stability. We operationalize this perspective through controlled perturbation
auditing of training trajectories, probing how learning dynamics respond to structured disturbances without modifying learning
algorithms. Across reinforcement learning and large
language model training, we identify three recurring regularities: high final performance is frequently decoupled from training stability; controlled stochasticity consistently buffers learning dynamics across paradigms; and deviations in low-dimensional latent meta-states systematically precede observable performance collapse. Together, these findings establish training stability as a measurable and comparable dynamical property of learning systems, providing a descriptive foundation for studying learning dynamics beyond final performance outcomes.
Read the full abstract ▾
All authors Zhipeng Zhang, Zhenjie Yao, Kai Li, Lei Yang
Machine Learning · Cross-listed from cs.CL
Probe and Skip: Self-Predictive Token Skipping for Efficient Long-Context LLM Inference
Zimeng Wu, Donghao Wang, Chaozhe Jin et al. (+2 more)
Long-context inference enhances the
reasoning capability of Large
Language Models (LLMs), but incurs significant computational overhead.
Token-oriented methods, such as
pruning and skipping, have shown great promise in reducing inference latency, yet still suffer from inherently insufficient structure optimization, outdated selection criteria, and redundancy interference, resulting in suboptimal speed-accuracy trade-off. To address these issues, we propose a novel training-free framework dubbed Self-Predictive
Token Skipping (SPTS), for efficient long-context LLM inference. Specifically, motivated by probing the influence of target layers prior to skipping, we design two selective
token skipping strategies for typical structures, including Partial
Attention Probing (PAP) for multi-head
attention and Low-rank Transformation Probing (LTP) for feed forward network. The former selects informative
tokens via partial forward
attention computation, while the latter constructs a low-rank proxy network to predict
token transformations. In addition, a Multi-Stage Delayed
Pruning (MSDP) strategy reallocates skipping budgets and progressively removes redundant
tokens across layers. Extensive experiments display the effectiveness of our method, achieving up to 2.46$\times$ and 2.29$\times$ speedups for prefilling and end-to-end generation, respectively, while maintaining state-of-the-art accuracy. The source code is available at https://github.com/Wuzimeng/SPTS.
Read the full abstract ▾
All authors Zimeng Wu, Donghao Wang, Chaozhe Jin, Jiaxin Chen, Yunhong Wang
Machine Learning · Cross-listed from astro-ph.SR
SolARED: Solar Active Region Emergence Dataset for Machine Learning Aided Predictions
Spiridon Kasapis, Eren Dogan, Irina N. Kitiashvili et al. (+6 more)
The development of accurate forecasts of
solar eruptive activity has become increasingly important for preventing potential impacts on space technologies and exploration. Therefore, it is crucial to detect Active Regions (ARs) before they start forming on the
solar surface. This will enable the development of early-warning capabilities for upcoming space weather disturbances. For this reason, we prepared the
Solar Active Region Emergence
Dataset (SolARED). The
dataset is derived from full-disk maps of the Doppler velocity,
magnetic field, and continuum intensity, obtained by the Helioseismic and
Magnetic Imager (HMI) onboard the
Solar Dynamics Observatory (SDO). SolARED includes time series of remapped, tracked, and binned data that characterize the
evolution of acoustic power of
solar oscillations, unsigned
magnetic flux, and continuum intensity for 50 large ARs before, during, and after their emergence on the
solar surface, as well as surrounding areas observed on the
solar disc between 2010 and 2023. The resulting ML-ready SolARED
dataset is designed to support enhancements of predictive capabilities, enabling the development of operational forecasts for the emergence of active regions. The SolARED
dataset is available at https://sun.njit.edu/sarportal/, through an interactive visualization web application.
Read the full abstract ▾
All authors Spiridon Kasapis, Eren Dogan, Irina N. Kitiashvili, Alexander G. Kosovichev, John T. Stefan, Jake D. Butler, Jonas Tirona, Sarang Patil, Mengjia Xu
Machine Learning · Cross-listed from astro-ph.SR
Forecasting Continuum Intensity for Solar Active Region Emergence Prediction using Transformers
Jonas Tirona, Sarang Patil, Spiridon Kasapis et al. (+5 more)
Early and accurate prediction of
solar active region (AR) emergence is crucial for space weather
forecasting. Building on established Long Short-Term
Memory (LSTM) based approaches for
forecasting the continuum intensity decrease associated with AR emergence, this work expands the modeling with new architectures and targets. We investigate a sliding-window
Transformer architecture to forecast continuum intensity
evolution up to 12 hours ahead using data from 46 ARs observed by SDO/HMI. We conduct a systematic ablation study to evaluate two key components: (1) the inclusion of a temporal 1D convolutional (Conv1D) front-end and (2) a novel `Early Detection' architecture featuring
attention biases and a timing-aware loss function. Our best-performing model, combining the Early Detection architecture without the Conv1D layer, achieved a Root Mean Square Error (RMSE) of 0.1189 (representing a 10.6% improvement over the LSTM baseline) and an average advance warning time of 4.73 hours (timing difference of -4.73h), even under a stricter emergence criterion than previous studies. While the
Transformer demonstrates superior aggregate timing and accuracy, we note that this high-sensitivity detection comes with increased variance compared to smoother baseline models. However, this
volatility is a necessary trade-off for operational warning systems: the model's ability to detect micro-changes in precursor signals enables significantly earlier detection, outweighing the cost of increased noise. Our results demonstrate that
Transformer architectures modified with early detection biases, when used without temporal smoothing layers, provide a high-sensitivity alternative for
forecasting AR emergence that prioritizes advance warning over statistical smoothness.
Read the full abstract ▾
All authors Jonas Tirona, Sarang Patil, Spiridon Kasapis, Eren Dogan, John Stefan, Irina N. Kitiashvili, Alexander G. Kosovichev, Mengjia Xu
Machine Learning
FastAV: Efficient Token Pruning for Audio-Visual Large Language Model Inference
Chaeyoung Jung, Youngjoon Jang, Seungwoo Lee et al. (+1 more)
In this work, we present FastAV, the first
token pruning framework tailored for audio-visual large
language models (AV-LLMs). While
token pruning has been actively explored in standard large
language models (LLMs) and
vision-
language models (LVLMs), its application to AV-LLMs has received little
attention, even though
multimodal integration substantially increases their
token demands. To address this gap, we introduce a
pruning strategy that utilizes
attention weights to identify
tokens emphasized at different stages and estimates their importance. Building on this analysis, FastAV applies a two-stage
pruning strategy: (1) global
pruning in intermediate layers to remove broadly less influential
tokens, and (2) fine
pruning in later layers considering the impact on next
token generation. Notably, our method does not rely on full
attention maps, which makes it fully compatible with efficient
attention mechanisms such as FlashAttention. Extensive experiments demonstrate that FastAV reduces FLOPs by more than 40% on two representative AV-LLMs, while preserving or even improving model performance.
Read the full abstract ▾
All authors Chaeyoung Jung, Youngjoon Jang, Seungwoo Lee, Joon Son Chung
Machine Learning · Cross-listed from stat.ML
Approximate full conformal prediction in an RKHS
Davidson Lova Razafindrakoto, Alain Celisse and Jérôme Lacaille
Full conformal prediction is a framework that implicitly formulates distribution-free confidence prediction regions for a wide range of
estimators. However, a classical limitation of the full conformal framework is the computation of the confidence prediction regions, which is usually impossible since it requires training infinitely many
estimators (for real-valued prediction for instance). The main purpose of the present work is to describe a generic strategy for designing a tight approximation to the full conformal prediction region that can be efficiently computed. Along with this approximate confidence region, a theoretical quantification of the tightness of this approximation is developed, depending on the smoothness assumptions on the loss and score functions. The new notion of thickness is introduced for quantifying the discrepancy between the approximate confidence region and the full conformal one.
Read the full abstract ▾
Machine Learning
Recursive Meta-Distillation: An Axiomatic Framework for Iterative Knowledge Refinement
Aaron R. Flouro and Shawn P. Chadwick
Recent work in probability-domain knowledge
distillation has established axiomatic frameworks for temperature scaling, multi-teacher aggregation, and bias-variance trade-offs in single-stage settings. However, the mathematical behavior of recursive or multi-generation
distillation remains poorly understood, with prior approaches relying primarily on empirical heuristics. In this work, we introduce an axiomatic and operator-theoretic framework for recursive meta-
distillation, formalizing iterative knowledge
distillation as a sequence of probability-distribution operators with explicit anchoring to base teachers. We define structural axioms for valid meta-teacher construction and prove the existence of non-trivial operator families satisfying these axioms without specifying particular
algorithms or loss functions. Under mild realizability and convexity assumptions, we show that anchored recursive
distillation induces contraction in KL divergence, yielding
geometric convergence to base teacher distributions and a unique, globally attractive fixed point. The contribution is foundational rather than algorithmic: the framework characterizes when recursive
distillation is mathematically well-posed and convergent rather than error-accumulating, independent of model architecture, optimization details, or specific operator instantiations. These results provide a theoretical basis for understanding stability, bias-variance behavior, and failure modes in iterative and multi-teacher
distillation under capacity constraints.
Read the full abstract ▾
Machine Learning · Cross-listed from cs.SE
RM -RF: Reward Model for Run-Free Unit Test Evaluation
Elena Bruches, Daniil Grebenkin, Mikhail Klementev et al. (+8 more)
We present RM-RF, a lightweight reward model for run-free evaluation of automatically generated unit tests. Instead of repeatedly compiling and executing candidate tests, RM-RF predicts - from source and test code alone - three execution-derived signals: (1) whether the augmented test suite compiles and runs successfully, (2) whether the generated test cases increase code coverage, and (3) whether the generated test cases improve the mutation kill rate. To train and evaluate RM-RF we assemble a
multilingual dataset (Java, Python, Go) of focal files, test files, and candidate test additions labeled by an execution-based pipeline, and we release an associated
dataset and methodology for comparative evaluation. We tested multiple model families and tuning regimes (zero-shot, full fine-tuning, and PEFT via LoRA), achieving an average F1 of 0.69 across the three targets. Compared to conventional compile-and-run instruments, RM-RF provides substantially lower latency and infrastructure cost while delivering competitive predictive fidelity, enabling fast, scalable feedback for large-scale test generation and RL-based code optimization.
Read the full abstract ▾
All authors Elena Bruches, Daniil Grebenkin, Mikhail Klementev, Vadim Alperovich, Roman Derunets, Dari Baturova, Georgy Mkrtchyan, Oleg Sedukhin, Ivan Bondarenko, Nikolay Bushkov, Stanislav Moiseev
Machine Learning · Cross-listed from cs.CR
Adversarial News and Lost Profits: Manipulating Headlines in LLM-Driven Algorithmic Trading
Advije Rizvani, Giovanni Apruzzese and Pavel Laskov
Large
Language Models (LLMs) are increasingly adopted in the financial domain. Their exceptional capabilities to analyse textual data make them well-suited for inferring the sentiment of finance-related news. Such feedback can be leveraged by algorithmic trading systems (ATS) to guide buy/sell decisions. However, this practice bears the risk that a threat actor may craft "
adversarial news" intended to mislead an LLM. In particular, the news headline may include "malicious" content that remains invisible to human readers but which is still ingested by the LLM. Although prior work has studied textual
adversarial examples, their system-wide impact on LLM-supported ATS has not yet been quantified in terms of monetary risk. To address this threat, we consider an adversary with no direct access to an ATS but able to alter stock-related news headlines on a single day. We evaluate two human-imperceptible manipulations in a financial context: Unicode homoglyph substitutions that misroute models during stock-name recognition, and hidden-text clauses that alter the sentiment of the news headline. We implement a realistic ATS in Backtrader that fuses an LSTM-based price forecast with LLM-derived sentiment (FinBERT, FinGPT, FinLLaMA, and six general-purpose LLMs), and quantify monetary impact using portfolio metrics. Experiments on real-world data show that manipulating a one-day attack over 14 months can reliably mislead LLMs and reduce annual returns by up to 17.7 percentage points. To assess real-world feasibility, we analyze popular scraping libraries and trading platforms and survey 27 FinTech practitioners, confirming our hypotheses. We notified trading platform owners of this security issue.
Read the full abstract ▾
Machine Learning · Cross-listed from cond-mat.dis-nn
Polychronous Wave Computing: Timing-Native Address Selection in Spiking Networks
Natalila G. Berloff
Spike timing offers a combinatorial address space, suggesting that timing-based spiking inference can be executed as lookup and routing rather than as dense multiply–accumulate. Yet most neuromorphic and photonic systems still digitize events into timestamps, bins, or rates and then perform selection in clocked logic. We introduce Polychronous Wave Computing (PWC), a timing-native address-selection primitive that maps relative spike latencies directly to a discrete output route in the wave domain. Spike times are phase-encoded in a rotating frame and processed by a programmable multiport interferometer that evaluates K template correlations in parallel; a driven–dissipative winner-take-all stage then performs a physical argmax, emitting a one-hot output port. We derive the operating envelope imposed by phase wrapping and mutual coherence, and collapse timing jitter, static phase mismatch, and dephasing into a single effective phase-noise budget whose induced winner–runner-up margin predicts boundary-first failures and provides an intensity-only calibration target. Simulations show that nonlinear competition improves routing fidelity compared with noisy linear intensity readout, and that hardware-in-the-loop phase tuning rescues a temporal-order gate from 55.9% to 97.2% accuracy under strong static mismatch. PWC provides a fast routing coprocessor for LUT-style spiking networks and sparse top-1 gates (e.g., mixture-of-experts routing) across polaritonic, photonic, and oscillator platforms.
Read the full abstract ▾
Machine Learning
METIS: Mentoring Engine for Thoughtful Inquiry & Solutions
Abhinav Rajeev Kumar, Dhruv Trehan and Paras Chopra
Many students lack access to expert research mentorship. We ask whether an AI mentor can move undergraduates from an idea to a paper. We build METIS, a tool-augmented, stage-aware assistant with literature search, curated guidelines, methodology checks, and
memory. We evaluate METIS against GPT-5 and Claude Sonnet 4.5 across six writing stages using LLM-as-a-judge pairwise preferences, student-persona rubrics, short multi-turn tutoring, and evidence/compliance checks. On 90 single-turn
prompts, LLM judges preferred METIS to Claude Sonnet 4.5 in 71% and to GPT-5 in 54%. Student scores (clarity/actionability/constraint-fit; 90
prompts x 3 judges) are higher across stages. In multi-turn sessions (five scenarios/
agent), METIS yields slightly higher final quality than GPT-5. Gains concentrate in document-grounded stages (D-F), consistent with stage-aware routing and groundings failure modes include premature tool routing, shallow grounding, and occasional stage misclassification.
Read the full abstract ▾
Machine Learning
TinyML-Enabled IoT for Sustainable Precision Irrigation
Kamogelo Taueatsoala, Caitlyn Daniels, Angelina J. Ramsunar et al. (+2 more)
Small-scale farming communities are disproportionately affected by water scarcity, erratic
climate patterns, and a lack of access to advanced, affordable agricultural technologies. To address these challenges, this paper presents a novel, edge-first IoT framework that integrates Tiny Machine Learning (TinyML) for intelligent, offline-capable precision irrigation. The proposed four-layer architecture leverages low-cost hardware, an ESP32 microcontroller as an edge inference node, and a Raspberry Pi as a local edge server to enable autonomous decision-making without cloud dependency. The system utilizes capacitive soil moisture, temperature, humidity, pH, and ambient light sensors for environmental monitoring. A rigorous comparative analysis of ensemble models identified gradient boosting as superior, achieving an R^2 score of 0.9973 and a Mean Absolute Percentage Error (MAPE) of 0.99%, outperforming a random forest model (R^2 = 0.9916, MAPE = 1.81%). This optimized model was converted and deployed as a lightweight TinyML inference engine on the ESP32 and predicts irrigation needs with exceptional accuracy (MAPE < 1%). Local communication is facilitated by an MQTT-based LAN protocol, ensuring reliable operation in areas with limited or no internet connectivity. Experimental validation in a controlled environment demonstrated a significant reduction in water usage compared to traditional methods, while the system's low-power design and offline functionality confirm its viability for sustainable, scalable deployment in resource-constrained rural settings. This work provides a practical, cost-effective blueprint for bridging the technological divide in agriculture and enhancing water-use efficiency through on-device artificial intelligence.
Read the full abstract ▾
All authors Kamogelo Taueatsoala, Caitlyn Daniels, Angelina J. Ramsunar, Petrus Bronkhorst, Absalom E. Ezugwu
Machine Learning
Analysis of Long Range Dependency Understanding in State Space Models
Srividya Ravikumar, Abhinav Anand, Shweta Verma et al. (+1 more)
Although state-space models (SSMs) have demonstrated strong performance on long-sequence
benchmarks, most research has emphasized predictive accuracy rather than interpretability. In this work, we present the first systematic kernel interpretability study of the diagonalized state-space model (S4D) trained on a real-world task (vulnerability detection in source code). Through time and frequency domain analysis of the S4D kernel, we show that the long-range modeling capability of S4D varies significantly under different model architectures, affecting model performance. For instance, we show that the depending on the architecture, S4D kernel can behave as low-pass, band-pass or high-pass filter. The insights from our analysis can guide future work in designing better S4D-based models.
Read the full abstract ▾
All authors Srividya Ravikumar, Abhinav Anand, Shweta Verma, Mira Mezini
Machine Learning · Cross-listed from cs.CL
SASA: Semantic-Aware Contrastive Learning Framework with Separated Attention for Triple Classification
Xu Xiaodan and Hu Xiaolin
Knowledge Graphs~(KGs) often suffer from unreliable knowledge, which restricts their utility. Triple Classification~(TC) aims to determine the validity of triples from KGs. Recently, text-based methods learn entity and relation representations from natural
language descriptions, significantly improving the generalization capabilities of TC models and setting new
benchmarks in performance. However, there are still two critical challenges. First, existing methods often ignore the effective semantic interaction among different KG components. Second, most approaches adopt single binary classification training objective, leading to insufficient semantic representation learning. To address these challenges, we propose SASA, a novel framework designed to enhance TC models via separated
attention mechanism and semantic-aware contrastive learning~(CL). Specifically, we first propose separated
attention mechanism to encode triples into decoupled contextual representations and then fuse them through a more effective interactive way. Then, we introduce semantic-aware hierarchical CL as auxiliary training objective to guide models in improving their discriminative capabilities and achieving sufficient semantic learning, considering both local level and global level CL. Experimental results across two
benchmark datasets demonstrate that SASA significantly outperforms state-of-the-art methods. In terms of accuracy, we advance the state-of-the-art by +5.9% on FB15k-237 and +3.4% on YAGO3-10.
Read the full abstract ▾
Machine Learning
Enhancing Generalization in Sickle Cell Disease Diagnosis through Ensemble Methods and Feature Importance Analysis
Nataša Petrović, Gabriel Moyà-Alcover, Antoni Jaume-i-Capó et al. (+1 more)
This work presents a novel approach for selecting the optimal ensemble-based classification method and features with a primarly focus on achieving generalization, based on the state-of-the-art, to provide diagnostic support for Sickle
Cell Disease using peripheral blood smear images of red blood
cells. We pre-processed and segmented the microscopic images to ensure the extraction of high-quality features. To ensure the reliability of our proposed system, we conducted an in-depth analysis of interpretability. Leveraging techniques established in the literature, we extracted features from blood
cells and employed ensemble machine learning methods to classify their morphology. Furthermore, we have devised a methodology to identify the most critical features for classification, aimed at reducing complexity and training time and enhancing interpretability in opaque models. Lastly, we validated our results using a new
dataset, where our model overperformed state-of-the-art models in terms of generalization. The results of classifier ensembled of Random Forest and Extra Trees classifier achieved an harmonic mean of precision and recall (F1-score) of 90.71% and a Sickle
Cell Disease diagnosis support score (SDS-score) of 93.33%. These results demonstrate notable enhancement from previous ones with Gradient Boosting classifier (F1-score 87.32% and SDS-score 89.51%). To foster scientific progress, we have made available the parameters for each model, the implemented code library, and the confusion
matrices with the raw data.
Read the full abstract ▾
All authors Nataša Petrović, Gabriel Moyà-Alcover, Antoni Jaume-i-Capó, Jose Maria Buades Rubio
Machine Learning
PASs-MoE: Mitigating Misaligned Co-drift among Router and Experts via Pathway Activation Subspaces for Continual Learning
Zhiyan Hou, Haiyun Guo, Haokai Ma et al. (+3 more)
Continual instruction tuning (CIT) requires
multimodal large
language models (MLLMs) to adapt to a stream of tasks without forgetting prior capabilities. A common strategy is to isolate updates by routing inputs to different LoRA experts. However, existing LoRA-based Mixture-of-Experts (MoE) methods often jointly update the router and experts in an indiscriminate way, causing the router's preferences to co-drift with experts' adaptation pathways and gradually deviate from early-stage input–expert specialization. We term this as Misaligned Co-drift, which blurs expert responsibilities and exacerbates forgetting. To address this, we introduce the pathway activation subspace (PASs), a LoRA-induced subspace that reflects which low-rank pathway directions an input activates in each expert, providing a capability-aligned coordinate system for routing and preservation. Based on PASs, we propose a fixed-capacity PASs-based MoE–LoRA method with two components: PAS-guided Reweighting, which calibrates routing using each expert's pathway activation signals, and PAS-aware Rank Stabilization, which selectively stabilizes rank directions important to previous tasks. Experiments on a CIT
benchmark show that our approach consistently outperforms a range of conventional continual learning baselines and MoE–LoRA variants in both accuracy and resistance to forgetting, without increasing model parameters. Our code is publicly available at https://github.com/yueluoshuangtian/PASs-MoE.
Read the full abstract ▾
All authors Zhiyan Hou, Haiyun Guo, Haokai Ma, Yandu Sun, Yonghui Yang, Jinqiao Wang
Machine Learning
HT-GNN: Hyper-Temporal Graph Neural Network for Customer Lifetime Value Prediction in Baidu Ads
Xiaohui Zhao, Xinjian Zhao, Jiahui Zhang et al. (+3 more)
Lifetime value (LTV) prediction is crucial for news feed advertising, enabling platforms to optimize bidding and budget allocation for long-term revenue growth. However, it faces two major challenges: (1) demographic-based targeting creates segment-specific LTV distributions with large value variations across user groups; and (2) dynamic marketing strategies generate irregular behavioral sequences where engagement patterns evolve rapidly. We propose a Hyper-Temporal Graph Neural Network (HT-GNN), which jointly models demographic heterogeneity and temporal dynamics through three key components: (i) a hypergraph-supervised module capturing inter-segment relationships; (ii) a
transformer-based temporal encoder with adaptive weighting; and (iii) a task-adaptive mixture-of-experts with dynamic prediction towers for multi-horizon LTV
forecasting. Experiments on Baidu Ads with 15 million users demonstrate that HT-GNN consistently outperforms state-of-the-art methods across all metrics and prediction horizons.
Read the full abstract ▾
All authors Xiaohui Zhao, Xinjian Zhao, Jiahui Zhang, Guoyu Liu, Houzhi Wang, Shu Wu
Machine Learning · Cross-listed from cs.MA
OFA-MAS: One-for-All Multi-Agent System Topology Design based on Mixture-of-Experts Graph Generative Models
Shiyuan Li, Yixin Liu, Yu Zheng et al. (+3 more)
Multi-
Agent Systems (MAS) offer a powerful paradigm for solving complex problems, yet their performance is critically dependent on the design of their underlying collaboration
topology. As MAS become increasingly deployed in web services (e.g., search engines), designing adaptive
topologies for diverse cross-domain user queries becomes essential. Current graph learning-based design methodologies often adhere to a "one-for-one" paradigm, where a specialized model is trained for each specific task domain. This approach suffers from poor generalization to unseen domains and fails to leverage shared structural knowledge across different tasks. To address this, we propose OFA-TAD, a one-for-all framework that generates adaptive collaboration graphs for any task described in natural
language through a single universal model. Our approach integrates a Task-Aware Graph State Encoder (TAGSE) that filters task-relevant node information via sparse gating, and a Mixture-of-Experts (MoE) architecture that dynamically selects specialized sub-networks to drive node and edge prediction. We employ a three-stage training strategy: unconditional pre-training on canonical
topologies for structural priors, large-scale conditional pre-training on LLM-generated
datasets for task-
topology mappings, and supervised fine-tuning on empirically validated graphs. Experiments across six diverse
benchmarks show that OFA-TAD significantly outperforms specialized one-for-one models, generating highly adaptive MAS
topologies. Code: https://github.com/Shiy-Li/OFA-MAS.
Read the full abstract ▾
All authors Shiyuan Li, Yixin Liu, Yu Zheng, Mei Li, Quoc Viet Hung Nguyen, Shirui Pan
Machine Learning · Cross-listed from q-fin.ST
Beyond Visual Realism: Toward Reliable Financial Time Series Generation
Fan Zhang, Jiabin Luo, Zheng Zhang et al. (+3 more)
Generative models for financial time series often create data that look realistic and even reproduce stylized facts such as fat tails or
volatility clustering. However, these apparent successes break down under trading backtests: models like GANs or WGAN-GP frequently collapse, yielding extreme and unrealistic results that make the synthetic data unusable in practice. We identify the root cause in the neglect of financial asymmetry and rare tail events, which strongly affect
market risk but are often overlooked by objectives focusing on distribution matching. To address this, we introduce the Stylized Facts
Alignment GAN (SFAG), which converts key stylized facts into differentiable structural constraints and jointly optimizes them with
adversarial loss. This multi-constraint design ensures that generated series remain aligned with
market dynamics not only in plots but also in backtesting. Experiments on the Shanghai Composite Index (2004–2024) show that while baseline GANs produce unstable and implausible trading outcomes, SFAG generates synthetic data that preserve stylized facts and support robust momentum strategy performance. Our results highlight that structure-preserving objectives are essential to bridge the gap between superficial realism and practical usability in financial generative modeling.
Read the full abstract ▾
All authors Fan Zhang, Jiabin Luo, Zheng Zhang, Shuanghong Huang, Zhipeng Liu, Yu Chen
Machine Learning
PaperGuide: Making Small Language-Model Paper-Reading Agents More Efficient
Zijian Wang, Tiancheng Huang, Hanqi Li et al. (+3 more)
The accelerating growth of the scientific literature makes it increasingly difficult for researchers to track new advances through manual reading alone. Recent progress in large
language models (LLMs) has therefore spurred interest in autonomous
agents that can read scientific papers and extract task-relevant information. However, most existing approaches rely either on heavily engineered prompting or on a conventional SFT-RL training pipeline, both of which often lead to excessive and low-yield exploration. Drawing inspiration from cognitive science, we propose PaperCompass, a framework that mitigates these issues by separating high-level planning from fine-grained execution. PaperCompass first drafts an explicit plan that outlines the intended sequence of actions, and then performs detailed
reasoning to instantiate each step by selecting the parameters for the corresponding function calls. To train such behavior, we introduce Draft-and-Follow Policy Optimization (DFPO), a tailored RL method that jointly optimizes both the draft plan and the final solution. DFPO can be viewed as a lightweight form of hierarchical reinforcement learning, aimed at narrowing the `knowing-doing' gap in LLMs. We provide a theoretical analysis that establishes DFPO's favorable optimization properties, supporting a stable and reliable training process. Experiments on paper-based question answering (Paper-QA)
benchmarks show that PaperCompass improves efficiency over strong baselines without sacrificing performance, achieving results comparable to much larger models.
Read the full abstract ▾
All authors Zijian Wang, Tiancheng Huang, Hanqi Li, Da Ma, Lu Chen, Kai Yu
Machine Learning · Cross-listed from cs.CV
Early Prediction of Type 2 Diabetes Using Multimodal data and Tabular Transformers
Sulaiman Khan, Md. Rafiul Biswas and Zubair Shah
This study introduces a novel approach for early Type 2 Diabetes Mellitus (T2DM) risk prediction using a tabular
transformer (TabTrans) architecture to analyze longitudinal patient data. By processing patients` longitudinal health records and bone-related tabular data, our model captures complex, long-range dependencies in disease progression that conventional methods often overlook. We validated our TabTrans model on a retrospective Qatar BioBank (QBB) cohort of 1,382 subjects, comprising 725 men (146 diabetic, 579 healthy) and 657 women (133 diabetic, 524 healthy). The study integrated electronic health records (EHR) with dual-energy X-ray absorptiometry (DXA) data. To address class imbalance, we employed SMOTE and SMOTE-ENN resampling techniques. The proposed model`s performance is evaluated against conventional machine learning (ML) and generative AI models, including Claude 3.5 Sonnet (Anthropic`s constitutional AI), GPT-4 (OpenAI`s generative pre-trained
transformer), and Gemini Pro (Google`s
multimodal language model). Our TabTrans model demonstrated superior predictive performance, achieving ROC AUC $\geq$ 79.7 % for T2DM prediction compared to both generative AI models and conventional ML approaches. Feature interpretation analysis identified key risk indicators, with visceral adipose tissue (VAT) mass and volume, ward bone mineral density (BMD) and bone mineral content (BMC), T and Z-scores, and L1-L4 scores emerging as the most important predictors associated with diabetes development in Qatari adults. These findings demonstrate the significant potential of TabTrans for analyzing complex tabular healthcare data, providing a powerful tool for proactive T2DM management and personalized clinical interventions in the Qatari population. Index Terms: tabular
transformers,
multimodal data, DXA data, diabetes, T2DM, feature interpretation, tabular data
Read the full abstract ▾