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

Muhammad A. Masood

dblp:242/7750 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2019
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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 · 38% Reinforcement learning · 24% Learning theory · 19%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › matrix factorization
bayesian nonnegative matrix factorization
0.412019
A Particle-Based Variational Approach to Bayesian Non-negative Matrix Factorization · J. Mach. Learn. Res. 2019
Machine learning › Reinforcement learning › policy optimization
diverse policy learning
0.412019
Diversity-Inducing Policy Gradient: Using Maximum Mean Discrepancy to Find a Set of Diverse Policies · IJCAI 2019
Machine learning › Learning theory › probability metric › integral probability metric
maximum mean discrepancy
0.412019
Diversity-Inducing Policy Gradient: Using Maximum Mean Discrepancy to Find a Set of Diverse Policies · IJCAI 2019
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference › variational inference
particle-based variational inference
0.412019
A Particle-Based Variational Approach to Bayesian Non-negative Matrix Factorization · J. Mach. Learn. Res. 2019
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.412019
A Particle-Based Variational Approach to Bayesian Non-negative Matrix Factorization · J. Mach. Learn. Res. 2019
Machine learning › Reinforcement learning › policy optimization
policy gradient
0.112019
Diversity-Inducing Policy Gradient: Using Maximum Mean Discrepancy to Find a Set of Diverse Policies · IJCAI 2019

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

transfer-based initialization · 0.4policy gradient · 0.4particle-based variational inference · 0.4maximum mean discrepancy · 0.4
YearPublicationVenuePosition
2019 Diversity-Inducing Policy Gradient: Using Maximum Mean Discrepancy to Find a Set of Diverse Policies
abstract
Standard reinforcement learning methods aim to master one way of solving a task whereas there may exist multiple near-optimal policies. Being able to identify this collection of near-optimal policies can allow a domain expert to efficiently explore the space of reasonable solutions. Unfortunately, existing approaches that quantify uncertainty over policies are not ultimately relevant to finding policies with qualitatively distinct behaviors. In this work, we formalize the difference between policies as a difference between the distribution of trajectories induced by each policy, which encourages diversity with respect to both state visitation and action choices. We derive a gradient-based optimization technique that can be combined with existing policy gradient methods to now identify diverse collections of well-performing policies. We demonstrate our approach on benchmarks and a healthcare task.
Muhammad A. Masood, Finale Doshi-Velez
IJCAI1
2019 A Particle-Based Variational Approach to Bayesian Non-negative Matrix Factorization
abstract
Bayesian Non-negative Matrix Factorization (BNMF) is a promising approach for understanding uncertainty and structure in matrix data. However, a large volume of applied work optimizes traditional non-Bayesian NMF objectives that fail to provide a principled understanding of the non-identifiability inherent in NMF---an issue ideally addressed by a Bayesian approach. Despite their suitability, current BNMF approaches have failed to gain popularity in an applied setting; they sacrifice flexibility in modeling for tractable computation, tend to get stuck in local modes, and can require many thousands of samples for meaningful uncertainty estimates. We address these issues through a particle-based variational approach to BNMF that only requires the joint likelihood to be differentiable for computational tractability, uses a novel transfer-based initialization technique to identify multiple modes in the posterior, and thus allows domain experts to inspect a small set of factorizations that faithfully represent the posterior. On several real datasets, we obtain better particle approximations to the BNMF posterior in less time than baselines and demonstrate the significant role that multimodality plays in NMF-related tasks.
Muhammad A. Masood, Finale Doshi-Velez
J. Mach. Learn. Res.1