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

Aleksandar Dimitriev

dblp:160/3686 · also Alek Dimitriev · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 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
2 papers
Probabilistic and Bayesian machine learning · 75% Optimization for machine learning · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
discrete latent variable model
1.022021
CARMS: Categorical-Antithetic-REINFORCE Multi-Sample Gradient Estimator · NeurIPS 2021
ARMS: Antithetic-REINFORCE-Multi-Sample Gradient for Binary Variables · ICML 2021
Machine learning › Optimization for machine learning
gradient estimation
0.512021
CARMS: Categorical-Antithetic-REINFORCE Multi-Sample Gradient Estimator · NeurIPS 2021
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.512021
ARMS: Antithetic-REINFORCE-Multi-Sample Gradient for Binary Variables · ICML 2021

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

antithetic sampling · 1.0REINFORCE · 1.0importance sampling · 0.5copula-based sampling · 0.5copula · 0.5
YearPublicationVenuePosition
2021 ARMS: Antithetic-REINFORCE-Multi-Sample Gradient for Binary Variables
abstract
Estimating the gradients for binary variables is a task that arises frequently in various domains, such as training discrete latent variable models. What has been commonly used is a REINFORCE based Monte Carlo estimation method that uses either independent samples or pairs of negatively correlated samples. To better utilize more than two samples, we propose ARMS, an Antithetic REINFORCE-based Multi-Sample gradient estimator. ARMS uses a copula to generate any number of mutually antithetic samples. It is unbiased, has low variance, and generalizes both DisARM, which we show to be ARMS with two samples, and the leave-one-out REINFORCE (LOORF) estimator, which is ARMS with uncorrelated samples. We evaluate ARMS on several datasets for training generative models, and our experimental results show that it outperforms competing methods. We also develop a version of ARMS for optimizing the multi-sample variational bound, and show that it outperforms both VIMCO and DisARM. The code is publicly available.
Aleksandar Dimitriev, Mingyuan Zhou
ICML1
2021 CARMS: Categorical-Antithetic-REINFORCE Multi-Sample Gradient Estimator
abstract
Accurately backpropagating the gradient through categorical variables is a challenging task that arises in various domains, such as training discrete latent variable models. To this end, we propose CARMS, an unbiased estimator for categorical random variables based on multiple mutually negatively correlated (jointly antithetic) samples. CARMS combines REINFORCE with copula based sampling to avoid duplicate samples and reduce its variance, while keeping the estimator unbiased using importance sampling. It generalizes both the ARMS antithetic estimator for binary variables, which is CARMS for two categories, as well as LOORF/VarGrad, the leave-one-out REINFORCE estimator, which is CARMS with independent samples. We evaluate CARMS on several benchmark datasets on a generative modeling task, as well as a structured output prediction task, and find it to outperform competing methods including a strong self-control baseline. The code is publicly available.
Aleksandar Dimitriev, Mingyuan Zhou
NeurIPS1