ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “hyperparameter tuning”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGEmpiricalRecentJul 6, 2026

TabPack: Efficient Hyperparameter Ensembles for Tabular Deep Learning

Yury Gorishniy, Akim Kotelnikov, Ivan Rubachev, Artem Babenko

This paper introduces TabPack, an efficient MLP ensemble for tabular data that samples and trains MLPs with different hyperparameters in parallel and selects ensemble members on-the-fly during trainin…

View →
stat.MLcs.LGstat.COTheoreticalRecentJul 17, 2026

Which Hyperparameters Matter? A Game-Theoretic Framework for Interpretable Hyperparameter Sensitivity Analysis

Nyi Nyi Aung, Heepeom Shin, Abigail Lawlor, Adrian Stein

This paper proposes a game-theoretic framework using Shapley Effects and Pareto front sets for interpretable hyperparameter-objective interaction analysis.

View →
cs.CVcs.AIRecentJun 1, 2026

Parameter-Efficient Fine-Tuning of Large Pretrained Models for Instance Segmentation Tasks

Nermeen Abou Baker, David Rohrschneider, Uwe Handmann

This paper investigates the application of Parameter-Efficient Fine-Tuning (PEFT) methods, specifically adapters and LoRA, to large pretrained models for instance segmentation, demonstrating that thes…

View →
cs.CLRecentMay 29, 2026

TRACE: Discovering Task-Specific Parameter via Adaptation-Aware Probing for Continual Fine-Tuning

Xiaosong Han, Ke Chen, Xindi Dai, Di Liang +6 more

TRACE proposes a novel method to mitigate catastrophic forgetting in continual LLM fine-tuning by identifying and isolating a small, task-specific subset of essential parameters for each task.

View →
cs.LGcs.CLRecentJun 1, 2026

On the Scaling of PEFT: Towards Million Personal Models of Trillion Parameters

Mind Lab, :, Song Cao, Vic Cao +51 more

The paper reframes Parameter-Efficient Fine-Tuning (PEFT) from a mere cost-saving alternative to a robust architecture for creating persistent, personalized models that layer specific behaviors onto l…

View →
cs.LGcs.CRRecentMay 19, 2026

An exponential mechanism based on quadratic approximations for fine-tuning machine learning models with privacy guarantees

Hoang Tran, Jorge Ramirez, Jiayi Wang, Alberto Bocchinfuso +2 more

The paper proposes a novel exponential mechanism using quadratic approximations to fine-tune machine learning models on sensitive data while providing strong differential privacy guarantees.

View →
cs.NEcs.AIcs.DSRecentMay 28, 2026

Selection Hyper-heuristics Can Automatically Adjust the Learning Period to Optimally Solve Pseudo-Boolean Problems

Benjamin Doerr, Pietro S. Oliveto, John Alasdair Warwicker

This paper introduces a method to automatically determine the optimal learning period ($ au$) for the Random Gradient hyper-heuristic, enabling it to optimally solve Pseudo-Boolean Problems without ma…

View →
cs.NEEmpiricalRecentJul 24, 2026

On the Runtime Analysis of Reinforcement Learning Hyper-Heuristics

Pietro S. Oliveto, Zhenyu Wang, Peizhou Wu, Mengqing Xu

This paper rigorously proves that a Reinforcement Learning Hyper-heuristic (RLHH) optimizes the LeadingOnes benchmark function with optimal expected runtime using two random local search operators, ou…

View →
cs.SEEmpiricalRecentJul 13, 2026

Which Optimizer, At What Budget? A Tournament of Optimizers for Search-Based SE

Kishan Kumar Ganguly, Tim Menzies

The authors compare and evaluate 20 software configuration optimizers based on six assumptions about the data, and find that no single optimizer outperforms others across all budgets. They propose a t…

View →
cs.CVcs.AIRecentJun 1, 2026

Why Not Hyperparameter-Friendly Optimisation? A Monotonic Adaptive Norm Rescaling Approach For Long-Tailed Recognition

Shuo Zhang, Chenqi Li, Tingting Zhu

The paper proposes Self-Adaptive Monotonic Normalization (SAMN), a hyperparameter-friendly method that improves long-tailed recognition by enforcing monotonicity on per-class weight norms without requ…

View →
cs.LGstat.MLEmpiricalRecentJul 20, 2026

Program Synthesis for Simulation-Based Inference: Joint Model Selection and Parameter Estimation

Siddharth Mishra-Sharma

The paper presents a framework for model selection and parameter estimation using large language models and neural simulation-based inference.

View →
cs.AIcs.SERecentMay 28, 2026

ParaTool: Shifting Tool Representations from Context to Parameters

Zekai Yu, Qi Meng, Qizhi Chu, Yu Hao +2 more

ParaTool introduces a novel framework that shifts tool representations from bulky context documentation to dedicated, loadable parameters, enabling efficient and robust tool calling in LLMs.

View →
stat.MLcs.LGEmpiricalRecentJul 23, 2026

Automatic knot selection in smooth additive models

Nicolás Carrizosa, Vanesa Guerrero, María Durbán

A new method for selecting knots in Generalized Additive Models using an extension of adaptive splines and a customized Fellner-Schall scheme.

View →
cs.LGRecentJun 3, 2026

BBOmix: A Tabular Benchmark for Hyperparameter Optimization of Unsupervised Biological Representation Learning

Luca Thale-Bombien, Jan Ewald, Ralf König, Aaron Klein

This paper introduces BBOmix, an open-source benchmark for unsupervised representation learning on real-world biological data.

View →
cs.CLcs.AIRecentMay 30, 2026

Revisiting Parameter-Based Knowledge Editing in Large Language Models: Theoretical Limits and Empirical Evidence

Wanying Ren, Xin Song, Futing Wang, Guoxiu He +1 more

The paper theoretically analyzes the limitations of parameter-based knowledge editing and empirically demonstrates that these methods consistently damage core LLM capabilities compared to retrieval-ba…

View →
cs.LGcs.AIcs.CLRecentMay 29, 2026

Finer Parameter Steps for Low-Rank PEFT: A Controlled Study with CP Tensor Adapters

Xinjue Wang, Xiuheng Wang, Yejun Zhang, Sergiy A. Vorobyov +2 more

The paper investigates whether using fine-grained, tensorized adapters (CP components) instead of standard LoRA ranks improves the accuracy-budget trade-off in PEFT, finding that while they fill budge…

View →
cs.NEcs.AIcs.LGTheoreticalRecentJun 26, 2026

Analysis of Parameter Settings for the Bat Algorithm Using Variance Evolution

Xin-She Yang, Mehmet Karamanoglu

This paper provides theoretical analysis of parameter settings for the bat algorithm using dynamical systems and population variance theory, and validates the results through numerical experiments.

View →
cs.CRcs.AIcs.CLRecentMay 7, 2026

Safety Anchor: Defending Harmful Fine-tuning via Geometric Bottlenecks

Guoxin Lu, Letian Sha, Qing Wang, Peijie Sun +3 more

The paper introduces Safety Bottleneck Regularization (SBR), a novel defense mechanism that anchors LLM safety by constraining the unembedding layer, effectively preventing harmful fine-tuning (HFT) e…

View →
cs.LGcs.CLRecentMay 28, 2026

CSULoRA: Closest Safe Update Low-Rank Adaptation

Oleksandr Marchenko Breneur, Adelaide Danilov, Aria Nourbakhsh, Salima Lamsiyah

CSULoRA is a post-hoc method that corrects trained LoRA adapters by estimating a safety-aligned subspace and solving a penalized minimum-change problem to attenuate unsafe update directions while pres…

View →