Demo Data from EDBT 2026 / reviewers in the wild / expert
Chu-Lan Michael Kao
dblp:310/1037
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0001-8091-9946ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Information theory · 80% Coding theory · 20% | |
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 75% Learning theory · 25% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian model selection |
0.9 | 1 | 2025 | Determine the Number of States in Hidden Markov Models via Marginal Likelihood · J. Mach. Learn. Res. 2025 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model |
0.9 | 1 | 2025 | Determine the Number of States in Hidden Markov Models via Marginal Likelihood · J. Mach. Learn. Res. 2025 |
Machine learning › Probabilistic and Bayesian machine learning
marginal likelihood |
0.9 | 1 | 2025 | Determine the Number of States in Hidden Markov Models via Marginal Likelihood · J. Mach. Learn. Res. 2025 |
Machine learning › Learning theory
model selection |
0.9 | 1 | 2025 | Determine the Number of States in Hidden Markov Models via Marginal Likelihood · J. Mach. Learn. Res. 2025 |
Coding theory › error-correcting codes › cyclic codes
affine-invariant codes |
0.8 | 1 | 2024 | Kullback-Leibler Divergence and Akaike Information Criterion in General Hidden Markov Models · IEEE Trans. Inf. Theory 2024 |
Information theory › information measures
fisher information |
0.8 | 1 | 2024 | Kullback-Leibler Divergence and Akaike Information Criterion in General Hidden Markov Models · IEEE Trans. Inf. Theory 2024 |
Information theory › probability theory › stochastic processes › markov processes
hidden markov model |
0.8 | 1 | 2024 | Kullback-Leibler Divergence and Akaike Information Criterion in General Hidden Markov Models · IEEE Trans. Inf. Theory 2024 |
Information theory › information measures › divergence measures
kullback-leibler divergence |
0.8 | 1 | 2024 | Kullback-Leibler Divergence and Akaike Information Criterion in General Hidden Markov Models · IEEE Trans. Inf. Theory 2024 |
Information theory › statistical inference
model selection |
0.8 | 1 | 2024 | Kullback-Leibler Divergence and Akaike Information Criterion in General Hidden Markov Models · IEEE Trans. Inf. Theory 2024 |
Methods — techniques the papers use, named apart from their topics
marginal likelihood · 0.9bayesian information criterion · 0.9markovian iterated function system · 0.8cramér-rao bound · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Determine the Number of States in Hidden Markov Models via Marginal LikelihoodabstractHidden Markov models (HMM) have been widely used by scientists to model stochastic systems: the underlying process is a discrete Markov chain, and the observations are noisy realizations of the underlying process. Determining the number of hidden states for an HMM is a model selection problem which is yet to be satisfactorily solved, especially for the popular Gaussian HMM with heterogeneous covariance. In this paper, we propose a consistent method for determining the number of hidden states of HMM based on the marginal likelihood, which is obtained by integrating out both the parameters and hidden states. Moreover, we show that the model selection problem of HMM includes the order selection problem of finite mixture models as a special case. We give rigorous proof of the consistency of the proposed marginal likelihood method and provide an efficient computation method for practical implementation. We numerically compare the proposed method with the Bayesian information criterion (BIC), demonstrating the effectiveness of the proposed marginal likelihood method. Cheng-Der Fuh, Chu-Lan Michael Kao |
J. Mach. Learn. Res. | 3 |
| 2024 | Kullback-Leibler Divergence and Akaike Information Criterion in General Hidden Markov ModelsabstractTo characterize the Kullback-Leibler divergence and Fisher information in general parametrized hidden Markov models, in this paper, we first show that the log likelihood and its derivatives can be represented as an additive functional of a Markovian iterated function system, and then provide explicit characterizations of these two quantities through this representation. Moreover, we show that Kullback-Leibler divergence can be locally approximated by a quadratic function determined by the Fisher information. Results relating to the Cramér-Rao lower bound and the Hájek-Le Cam local asymptotic minimax theorem are also given. As an application of our results, we provide a theoretical justification of using Akaike information criterion (AIC) model selection in general hidden Markov models. Last, we study three concrete models: a Gaussian vector autoregressive-moving average model of order$(p,q)$, recurrent neural networks, and temporal restricted Boltzmann machine, to illustrate our theory. Cheng-Der Fuh, Chu-Lan Michael Kao, Tianxiao Pang |
IEEE Trans. Inf. Theory | 2 |