paper-with-me

Papers

Interpretable Mixture Density Estimation by use of Differentiable Tree-module

2021-05-08 · Ryuichi Kanoh, Tomu Yanabe

In order to develop reliable services using machine learning, it is important to understand the uncertainty of the model outputs. Often the probability distribution that the prediction target follows has a complex shape, and a mixture distribution is assumed as a distribution that uncertainty follows. Since the output of mixture density estimation is complicated, its interpretability becomes important when considering its use in real services. In this paper, we propose a method for mixture density estimation that utilizes an interpretable tree structure. Further, a fast inference procedure based on time-invariant information cache achieves both high speed and interpretability.

📄 PDF Abstract BibTeX arXiv:2105.03616

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine LearningDensity Estimation

Similar Papers 제목 키워드 기반

Occlusion-aware Hand Pose Estimation Using Hierarchical Mixture Density Network

2017-11-29 · ECCV 2018 9 · Qi Ye, Tae-Kyun Kim

Learning and predicting the pose parameters of a 3D hand model given an image, such as locations of hand joints, is challenging due to large viewpoint changes and articulations, and severe self-occlusions exhibited parti…

Hand Pose EstimationPose Estimation

Conditional Density Estimation with Histogram Trees

2024-10-15 · Lincen Yang, Matthijs van Leeuwen

Conditional density estimation (CDE) goes beyond regression by modeling the full conditional distribution, providing a richer understanding of the data than just the conditional mean in regression. This makes CDE particu…

Density Estimationregression

Interpretable Classification via Supervised Variational Autoencoders and Differentiable Decision Trees

2018-01-01 · ICLR 2018 1 · Eleanor Quint, Garrett Wirka, Jacob Williams, Stephen Scott 외

As deep learning-based classifiers are increasingly adopted in real-world applications, the importance of understanding how a particular label is chosen grows. Single decision trees are an example of a simple, interpreta…

DecoderGeneral Classification

MoET: Interpretable and Verifiable Reinforcement Learning via Mixture of Expert Trees

2019-09-25 · Marko Vasic, Andrija Petrovic, Kaiyuan Wang, Mladen Nikolic 외

Deep Reinforcement Learning (DRL) has led to many recent breakthroughs on complex control tasks, such as defeating the best human player in the game of Go. However, decisions made by the DRL agent are not explainable, hi…

Deep Reinforcement LearningGame of GoImitation LearningMixture-of-Experts+3

A One-Class Classification Decision Tree Based on Kernel Density Estimation

2018-05-14 · Sarah Itani, Fabian Lecron, Philippe Fortemps

One-class Classification (OCC) is an area of machine learning which addresses prediction based on unbalanced datasets. Basically, OCC algorithms achieve training by means of a single class sample, with potentially some a…

Density EstimationGeneral ClassificationOne-Class Classification