Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Phil Chen

dblp:259/3229 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 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.

Artificial intelligence
1 paper
Deep learning architectures and training · 33% Probabilistic and Bayesian machine learning · 33% Generative modeling · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
multimodal distribution
0.512021
Evidential Softmax for Sparse Multimodal Distributions in Deep Generative Models · NeurIPS 2021
Machine learning › Deep learning architectures and training › normalization
sparse normalization
0.512021
Evidential Softmax for Sparse Multimodal Distributions in Deep Generative Models · NeurIPS 2021
Machine learning › Generative modeling
variational autoencoder
0.512021
Evidential Softmax for Sparse Multimodal Distributions in Deep Generative Models · NeurIPS 2021

Methods — techniques the papers use, named apart from their topics

stochastic gradient descent · 0.5evidential softmax · 0.5
YearPublicationVenuePosition
2021 Evidential Softmax for Sparse Multimodal Distributions in Deep Generative Models
abstract
Many applications of generative models rely on the marginalization of their high-dimensional output probability distributions. Normalization functions that yield sparse probability distributions can make exact marginalization more computationally tractable. However, sparse normalization functions usually require alternative loss functions for training since the log-likelihood is undefined for sparse probability distributions. Furthermore, many sparse normalization functions often collapse the multimodality of distributions. In this work, we present ev-softmax, a sparse normalization function that preserves the multimodality of probability distributions. We derive its properties, including its gradient in closed-form, and introduce a continuous family of approximations to ev-softmax that have full support and can be trained with probabilistic loss functions such as negative log-likelihood and Kullback-Leibler divergence. We evaluate our method on a variety of generative models, including variational autoencoders and auto-regressive architectures. Our method outperforms existing dense and sparse normalization techniques in distributional accuracy. We demonstrate that ev-softmax successfully reduces the dimensionality of probability distributions while maintaining multimodality.
Phil Chen, Masha Itkina, Ransalu Senanayake, Mykel J. Kochenderfer
NeurIPS1