Two adaptive kernel selection techniques for Kernelized Diffusion Maps are developed, backed by proofs of Lipschitz dependence on kernel weights, spectral projector continuity under gap conditions, residual control, and exponential consistency of the selector.
and Schervish, M
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4verdicts
UNVERDICTED 4representative citing papers
A new class of priors on context trees is defined by node-weighting functions, enabling exact marginal likelihoods and Bayes factors via extensions of CTW and CTM algorithms.
Derives closed-form expressions for the score and observed Fisher information matrix in a noisy Gaussian random walk HMM via Oakes' identity and forward-backward algorithm.
Review and simulation comparison of more than 40 threshold selection procedures for univariate extreme value analysis, with application to daily rainfall data.
citing papers explorer
-
Adaptive Kernel Selection for Kernelized Diffusion Maps
Two adaptive kernel selection techniques for Kernelized Diffusion Maps are developed, backed by proofs of Lipschitz dependence on kernel weights, spectral projector continuity under gap conditions, residual control, and exponential consistency of the selector.