Tootfinder

Overfitting in Histopathology Model Training: The Need for Customized Architectures
Saghir Alfasly, Ghazal Alabtah, H. R. Tizhoosh
https://arxiv.org/abs/2506.16631

Overfitting in Histopathology Model Training: The Need for Customized Architectures
This study investigates the critical problem of overfitting in deep learning models applied to histopathology image analysis. We show that simply adopting and fine-tuning large-scale models designed for natural image analysis often leads to suboptimal performance and significant overfitting when applied to histopathology tasks. Through extensive experiments with various model architectures, including ResNet variants and Vision Transformers (ViT), we show that increasing model capacity does not …

Enhancing Generalization of Spiking Neural Networks Through Temporal Regularization
Boxuan Zhang, Zhen Xu, Kuan Tao
https://arxiv.org/abs/2506.19256 https:…

Enhancing Generalization of Spiking Neural Networks Through Temporal Regularization
Spiking Neural Networks (SNNs) have received widespread attention due to their event-driven and low-power characteristics, making them particularly effective for processing event-based neuromorphic data. Recent studies have shown that directly trained SNNs suffer from severe overfitting issues due to the limited scale of neuromorphic datasets and the gradient mismatching problem, which fundamentally constrain their generalization performance. In this paper, we propose a temporal regularization …

Sensitivity Analysis of Priors in the Bayesian Dirichlet Auto-Regressive Moving Average Model
Harrison Katz, Liz Medina, Robert E. Weiss
https://arxiv.org/abs/2506.13973

Sensitivity Analysis of Priors in the Bayesian Dirichlet Auto-Regressive Moving Average Model
Prior choice can strongly influence Bayesian Dirichlet ARMA (B-DARMA) inference for compositional time-series. Using simulations with (i) correct lag order, (ii) overfitting, and (iii) underfitting, we assess five priors: weakly-informative, horseshoe, Laplace, mixture-of-normals, and hierarchical. With the true lag order, all priors achieve comparable RMSE, though horseshoe and hierarchical slightly reduce bias. Under overfitting, aggressive shrinkage-especially the horseshoe-suppresses noise …

Scaling Transformers for Discriminative Recommendation via Generative Pretraining
Chunqi Wang, Bingchao Wu, Zheng Chen, Lei Shen, Bing Wang, Xiaoyi Zeng
https://arxiv.org/abs/2506.03699

Scaling Transformers for Discriminative Recommendation via Generative Pretraining
Discriminative recommendation tasks, such as CTR (click-through rate) and CVR (conversion rate) prediction, play critical roles in the ranking stage of large-scale industrial recommender systems. However, training a discriminative model encounters a significant overfitting issue induced by data sparsity. Moreover, this overfitting issue worsens with larger models, causing them to underperform smaller ones. To address the overfitting issue and enhance model scalability, we propose a framework na…

Neural Functions for Learning Periodic Signal
Woojin Cho, Minju Jo, Kookjin Lee, Noseong Park
https://arxiv.org/abs/2506.09526 https://

Neural Functions for Learning Periodic Signal
As function approximators, deep neural networks have served as an effective tool to represent various signal types. Recent approaches utilize multi-layer perceptrons (MLPs) to learn a nonlinear mapping from a coordinate to its corresponding signal, facilitating the learning of continuous neural representations from discrete data points. Despite notable successes in learning diverse signal types, coordinate-based MLPs often face issues of overfitting and limited generalizability beyond the train…

This https://arxiv.org/abs/2505.16809 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCV_…

Hypergraph Tversky-Aware Domain Incremental Learning for Brain Tumor Segmentation with Missing Modalities
Existing methods for multimodal MRI segmentation with missing modalities typically assume that all MRI modalities are available during training. However, in clinical practice, some modalities may be missing due to the sequential nature of MRI acquisition, leading to performance degradation. Furthermore, retraining models to accommodate newly available modalities can be inefficient and may cause overfitting, potentially compromising previously learned knowledge. To address these challenges, we p…

Reinforced Refinement with Self-Aware Expansion for End-to-End Autonomous Driving
Haochen Liu, Tianyu Li, Haohan Yang, Li Chen, Caojun Wang, Ke Guo, Haochen Tian, Hongchen Li, Hongyang Li, Chen Lv
https://arxiv.org/abs/2506.09800

Reinforced Refinement with Self-Aware Expansion for End-to-End Autonomous Driving
End-to-end autonomous driving has emerged as a promising paradigm for directly mapping sensor inputs to planning maneuvers using learning-based modular integrations. However, existing imitation learning (IL)-based models suffer from generalization to hard cases, and a lack of corrective feedback loop under post-deployment. While reinforcement learning (RL) offers a potential solution to tackle hard cases with optimality, it is often hindered by overfitting to specific driving cases, resulting i…

Replaced article(s) found for physics.app-ph. https://arxiv.org/list/physics.app-ph/new
[1/1]:
Preventing overfitting in infrared ellipsometry using temperature dependence: fused silica as a c...

This https://arxiv.org/abs/2502.16789 has been replaced.
link: https://scholar.google.com/scholar?q=a

AlphaAgent: LLM-Driven Alpha Mining with Regularized Exploration to Counteract Alpha Decay
Alpha mining, a critical component in quantitative investment, focuses on discovering predictive signals for future asset returns in increasingly complex financial markets. However, the pervasive issue of alpha decay, where factors lose their predictive power over time, poses a significant challenge for alpha mining. Traditional methods like genetic programming face rapid alpha decay from overfitting and complexity, while approaches driven by Large Language Models (LLMs), despite their promise,…

Grids Often Outperform Implicit Neural Representations
Namhoon Kim, Sara Fridovich-Keil
https://arxiv.org/abs/2506.11139 https://arxi…

Grids Often Outperform Implicit Neural Representations
Implicit Neural Representations (INRs) have recently shown impressive results, but their fundamental capacity, implicit biases, and scaling behavior remain poorly understood. We investigate the performance of diverse INRs across a suite of 2D and 3D real and synthetic signals with varying effective bandwidth, as well as both overfitting and generalization tasks including tomography, super-resolution, and denoising. By stratifying performance according to model size as well as signal type and ba…

Noise Consistency Regularization for Improved Subject-Driven Image Synthesis
Yao Ni, Song Wen, Piotr Koniusz, Anoop Cherian
https://arxiv.org/abs/2506.06483

Noise Consistency Regularization for Improved Subject-Driven Image Synthesis
Fine-tuning Stable Diffusion enables subject-driven image synthesis by adapting the model to generate images containing specific subjects. However, existing fine-tuning methods suffer from two key issues: underfitting, where the model fails to reliably capture subject identity, and overfitting, where it memorizes the subject image and reduces background diversity. To address these challenges, we propose two auxiliary consistency losses for diffusion fine-tuning. First, a prior consistency regul…

Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
Narges Nemati, Mostafa Haghir Chehreghani
https://arxiv.org/abs/2506.10658

Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
Matrix completion is a widely adopted framework in recommender systems, as predicting the missing entries in the user-item rating matrix enables a comprehensive understanding of user preferences. However, current graph neural network (GNN)-based approaches are highly sensitive to noisy or irrelevant edges--due to their inherent message-passing mechanisms--and are prone to overfitting, which limits their generalizability. To overcome these challenges, we propose a novel method called Matrix Comp…

Regularizing Learnable Feature Extraction for Automatic Speech Recognition
Peter Vieting, Maximilian Kannen, Benedikt Hilmes, Ralf Schl\"uter, Hermann Ney
https://arxiv.org/abs/2506.09804

Regularizing Learnable Feature Extraction for Automatic Speech Recognition
Neural front-ends are an appealing alternative to traditional, fixed feature extraction pipelines for automatic speech recognition (ASR) systems since they can be directly trained to fit the acoustic model. However, their performance often falls short compared to classical methods, which we show is largely due to their increased susceptibility to overfitting. This work therefore investigates regularization methods for training ASR models with learnable feature extraction front-ends. First, we e…

Improving statistical learning methods via features selection without replacement sampling and random projection
Sulaiman khan, Muhammad Ahmad, Fida Ullah, Carlos Aguilar Iba\~nez, Jos\'e Eduardo Valdez Rodriguez
https://arxiv.org/abs/2506.00053

Improving statistical learning methods via features selection without replacement sampling and random projection
Cancer is fundamentally a genetic disease characterized by genetic and epigenetic alterations that disrupt normal gene expression, leading to uncontrolled cell growth and metastasis. High-dimensional microarray datasets pose challenges for classification models due to the "small n, large p" problem, resulting in overfitting. This study makes three different key contributions: 1) we propose a machine learning-based approach integrating the Feature Selection Without Re-placement (FSWOR) technique…

This https://arxiv.org/abs/2410.09516 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCE_…

Bridging the Gap Between Data-Driven And Theory-Driven Modelling - Leveraging Causal Machine Learning for Integrative Modelling of Dynamical Systems
Classical machine learning techniques often struggle with overfitting and unreliable predictions when exposed to novel conditions. Introducing causality into the modelling process offers a promising way to mitigate these challenges by enhancing predictive robustness. However, constructing an initial causal graph manually using domain knowledge is time-consuming, particularly in complex time series with numerous variables. To address this, causal discovery algorithms can provide a preliminary ca…