arXiv:2603.19736stat.MLcs.LG2026-03

提出两步法高效选择有限上下文模型超参数,省时且效果不差。

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

  • 先用序列依赖度量选上下文长度,再用最大似然选平滑参数
  • 样本量越大越准,压缩比特率与穷举搜索相当
  • 适合需要快速调参的生物序列压缩场景

有限上下文模型(FCMs)广泛用于压缩符号序列(如DNA),其预测性能高度依赖上下文长度k和平滑参数α。实践中常采用耗时的穷举搜索,计算成本高且随模型复杂度急剧上升。本文提出一种基于统计学的两步顺序优化方法:首先利用Cramér's ν、Cohen's κ和部分互信息(pami)等类别序列依赖度量估计k;其次在选定k的基础上,通过最大似然估计α。在四字母字母表下对多种(k, α)配置的合成序列进行模拟实验,结果表明依赖度量对k的变化比对α更敏感,支持该顺序策略。随着样本量增加,超参数估计精度提升。所提方法在平均比特率(比特/符号)上达到与穷举网格搜索相当的压缩性能,同时大幅降低计算开销。实验证明该方法是FCM中高效替代穷举调参的实用方案。

原文摘要 · Abstract (English)

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.

序列压缩超参优化生物信息

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。