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

Yuedong Wang

dblp:26/2119 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
2since 2021 · last 2022
0000-0002-7476-4201ORCID · reported

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

Artificial intelligence and machine learning · 3 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1

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.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Artificial intelligence
1 paper
Learning theory · 67% Probabilistic and Bayesian machine learning · 33%

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

TopicWeightPapersLastEvidence papers
Mathematical optimization › integer programming › branch-and-bound
branch-and-cut
0.612022
Nonparametric Neighborhood Selection in Graphical Models · J. Mach. Learn. Res. 2022
Mathematical optimization
discrete optimization
0.612022
Nonparametric Neighborhood Selection in Graphical Models · J. Mach. Learn. Res. 2022
Mathematical optimization › integer programming
integer linear programming formulation
0.612022
Nonparametric Neighborhood Selection in Graphical Models · J. Mach. Learn. Res. 2022
Mathematical optimization › regularization › nonconvex regularization
l0 minimization
0.612022
Nonparametric Neighborhood Selection in Graphical Models · J. Mach. Learn. Res. 2022
Mathematical optimization › sparse optimization
sparse approximation
0.612022
Nonparametric Neighborhood Selection in Graphical Models · J. Mach. Learn. Res. 2022
Machine learning › Learning theory
model selection
0.011993
Structured Machine Learning for Soft Classification with Smoothing Spline ANOVA and Stacked Tuning, Testing, and Evaluation · NIPS 1993
Machine learning › Learning theory › nonparametric regression
smoothing spline ANOVA
0.011993
Structured Machine Learning for Soft Classification with Smoothing Spline ANOVA and Stacked Tuning, Testing, and Evaluation · NIPS 1993
Machine learning › Probabilistic and Bayesian machine learning
structured prediction
0.011993
Structured Machine Learning for Soft Classification with Smoothing Spline ANOVA and Stacked Tuning, Testing, and Evaluation · NIPS 1993

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

smoothing spline ANOVA · 0.6l1 regularization · 0.6branch-and-cut · 0.6stacked tuning · 0.0smoothing splines · 0.0
YearPublicationVenuePosition
2022 Learning-based airborne sensor task assignment in unknown dynamic environments
Jing He 0013, Yuedong Wang, Yan Liang 0001, Jinwen Hu, Shi Yan 0005
Eng. Appl. Artif. Intell.2
2022 Nonparametric Neighborhood Selection in Graphical Models
abstract
The neighborhood selection method directly explores the conditional dependence structure and has been widely used to construct undirected graphical models. However, except for some special cases with discrete data, there is little research on nonparametric methods for neighborhood selection with mixed data. This paper develops a fully nonparametric neighborhood selection method under a consolidated smoothing spline ANOVA (SS ANOVA) decomposition framework. The proposed model is flexible and contains many existing models as special cases. The proposed method provides a unified framework for mixed data without any restrictions on the type of each random variable. We detect edges by applying an L1 regularization to interactions in the SS ANOVA decomposition. We propose an iterative procedure to compute the estimates and establish the convergence rates for conditional density and interactions. Simulations indicate that the proposed methods perform well under Gaussian and non-Gaussian settings. We illustrate the proposed methods using two real data examples.
Yuedong Wang
J. Mach. Learn. Res.2
2018 Deep learning assisted robust visual tracking with adaptive particle filtering
Yuedong Wang
Signal Process. Image Commun.3
1993 Structured Machine Learning for Soft Classification with Smoothing Spline ANOVA and Stacked Tuning, Testing, and Evaluation
Grace Wahba, Yuedong Wang, Chong Gu, Ronald Klein, Barbara E. Klein
NIPS2