Probability Distribution on Rooted Trees
원문 초록
The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical expressive capability causes a problem in tree selection to avoid overfitting. One unified approach to solve this is a Bayesian approach, on which the rooted tree is regarded as a random variable and a direct loss function can be assumed on the selected model or the predicted value for a new data point. However, all the previous studies on this approach are based on the probability distribution on full trees, to the best of our knowledge. In this paper, we propose a generalized probability distribution for any rooted trees in which only the maximum number of child nodes and the maximum depth are fixed. Furthermore, we derive recursive methods to evaluate the characteristics of the probability distribution without any approximations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
AstroCompress: A benchmark dataset for multi-purpose compression of astronomical data
Stationary MMD Points for Cubature
MiniLongBench: The Low-cost Long Context Understanding Benchmark for Large Language Models
Efficient compression of neural networks and datasets
DD-Ranking: Rethinking the Evaluation of Dataset Distillation
ReplayCAD: Generative Diffusion Replay for Continual Anomaly Detection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.