paper-with-me

홈 › Papers

A two-step sequential approach for hyperparameter selection in finite context models

2026-03-20 · José Contente, Ana Martins, Armando J. Pinho, Sónia Gouveia arxiv

Finite-context models (FCMs) are widely used for compressing symbolic sequences such as DNA, where predictive performance depends critically on the context length k and smoothing parameter α. In practice, these hyperparameters are typically selected through exhaustive search, which is computationally expensive and scales poorly with model complexity. This paper proposes a statistically grounded two-step sequential approach for efficient hyperparameter selection in FCMs. The key idea is to decompose the joint optimization problem into two independent stages. First, the context length k is estimated using categorical serial dependence measures, including Cramér's ν, Cohen's \k{appa} and partial mutual information (pami). Second, the smoothing parameter α is estimated via maximum likelihood conditional on the selected context length k. Simulation experiments were conducted on synthetic symbolic sequences generated by FCMs across multiple (k, α) configurations, considering a four-letter alphabet and different sample sizes. Results show that the dependence measures are substantially more sensitive to variations in k than in α, supporting the sequential estimation strategy. As expected, the accuracy of the hyperparameter estimation improves with increasing sample size. Furthermore, the proposed method achieves compression performance comparable to exhaustive grid search in terms of average bitrate (bits per symbol), while substantially reducing computational cost. Overall, the results on simulated data show that the proposed sequential approach is a practical and computationally efficient alternative to exhaustive hyperparameter tuning in FCMs.

📄 PDF Abstract BibTeX arXiv:2603.19736

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Adaptive Learn-then-Test: Statistically Valid and Efficient Hyperparameter Selection

2024-09-24 · Matteo Zecchin, Sangwoo Park, Osvaldo Simeone

We introduce adaptive learn-then-test (aLTT), an efficient hyperparameter selection procedure that provides finite-sample statistical guarantees on the population risk of AI models. Unlike the existing learn-then-test (L…

Prompt Engineeringvalid

Statistically Valid Hyperparameter Selection: From Tuning to Guarantees

2026-06-24 · Amirmohammad Farzaneh, Osvaldo Simeone arxiv

Hyperparameter selection is a critical step in the deployment of modern artificial intelligence systems, given the need to tune degrees of freedom such as inference-time parameters, implementation-level settings, and thr…

Feature Selection as Deep Sequential Generative Learning

2024-03-06 · Wangyang Ying, Dongjie Wang, Haifeng Chen, Yanjie Fu

Feature selection aims to identify the most pattern-discriminative feature subset. In prior literature, filter (e.g., backward elimination) and embedded (e.g., Lasso) methods have hyperparameters (e.g., top-K, score thre…

feature selection

BINOCULARS for Efficient, Nonmyopic Sequential Experimental Design

2019-09-10 · ICML 2020 1 · Shali Jiang, Henry Chai, Javier Gonzalez, Roman Garnett

Finite-horizon sequential experimental design (SED) arises naturally in many contexts, including hyperparameter tuning in machine learning among more traditional settings. Computing the optimal policy for such problems r…

Bayesian OptimizationExperimental Design

Transductive Model Selection under Prior Probability Shift

2025-07-30 · Lorenzo Volpi, Alejandro Moreo, Fabrizio Sebastiani arxiv

Transductive learning is a supervised machine learning task in which, unlike in traditional inductive learning, the unlabelled data that require labelling are a finite set and are available at training time. Similarly to…