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

Daisy Yi Ding

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

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

Artificial intelligence and machine learning · 2

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
Graph learning · 40% Probabilistic and Bayesian machine learning · 20% Trustworthy machine learning · 20%
Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › heterogeneous graph learning › heterogeneous graph representation learning
bipartite graph representation learning
0.412020
Handling Missing Data with Graph Representation Learning · NeurIPS 2020
Machine learning › Kernel, tree and ensemble methods
gradient boosting
0.412020
NGBoost: Natural Gradient Boosting for Probabilistic Prediction · ICML 2020
Machine learning › Graph learning
graph neural network
0.412020
Handling Missing Data with Graph Representation Learning · NeurIPS 2020
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › regression
probabilistic regression
0.412020
NGBoost: Natural Gradient Boosting for Probabilistic Prediction · ICML 2020
Machine learning › Trustworthy machine learning
uncertainty estimation
0.412020
NGBoost: Natural Gradient Boosting for Probabilistic Prediction · ICML 2020
Data integration and cleaning › missing data › missing value imputation
graph-based imputation
0.412020
Handling Missing Data with Graph Representation Learning · NeurIPS 2020
Data integration and cleaning › missing data
missing value imputation
0.412020
Handling Missing Data with Graph Representation Learning · NeurIPS 2020

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

node-level prediction · 0.9graph neural network · 0.9edge-level prediction · 0.9scoring rules · 0.4natural gradient · 0.4gradient boosting · 0.4
YearPublicationVenuePosition
2020 NGBoost: Natural Gradient Boosting for Probabilistic Prediction
abstract
We present Natural Gradient Boosting (NGBoost), an algorithm for generic probabilistic prediction via gradient boosting. Typical regression models return a point estimate, conditional on covariates, but probabilistic regression models output a full probability distribution over the outcome space, conditional on the covariates. This allows for predictive uncertainty estimation - crucial in applications like healthcare and weather forecasting. NGBoost generalizes gradient boosting to probabilistic regression by treating the parameters of the conditional distribution as targets for a multiparameter boosting algorithm. Furthermore, we show how the Natural Gradient is required to correct the training dynamics of our multiparameter boosting approach. NGBoost can be used with any base learner, any family of distributions with continuous parameters, and any scoring rule. NGBoost matches or exceeds the performance of existing methods for probabilistic prediction while offering additional benefits in flexibility, scalability, and usability. An open-source implementation is available at github.com/stanfordmlgroup/ngboost.
Tony Duan, Anand Avati, Daisy Yi Ding, Khanh K. Thai, Sanjay Basu, Andrew Y. Ng, Alejandro Schuler
ICML3
2020 Handling Missing Data with Graph Representation Learning
abstract
Machine learning with missing data has been approached in many different ways, including feature imputation where missing feature values are estimated based on observed values and label prediction where downstream labels are learned directly from incomplete data. However, existing imputation models tend to have strong prior assumptions and cannot learn from downstream tasks, while models targeting label predictions often involve heuristics and can encounter scalability issues. Here we propose GRAPE, a framework for feature imputation as well as label prediction. GRAPE tackles the missing data problem using graph representation, where the observations and features are viewed as two types of nodes in a bipartite graph, and the observed feature values as edges. Under the GRAPE framework, the feature imputation is formulated as an edge-level prediction task and the label prediction as a node-level prediction task. These tasks are then solved with Graph Neural Networks. Experimental results on nine benchmark datasets show that GRAPE yields 20% lower mean absolute error for imputation tasks and 10% lower for label prediction tasks, compared with existing state-of-the-art methods.
Jiaxuan You, Xiaobai Ma, Daisy Yi Ding, Mykel J. Kochenderfer, Jure Leskovec
NeurIPS3