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

Chanmoo Park

dblp:386/2462 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 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
Trustworthy machine learning · 25% Probabilistic and Bayesian machine learning · 25% Learning theory · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
functional ANOVA
0.912025
Tensor Product Neural Networks for Functional ANOVA Model · ICML 2025
Machine learning › Trustworthy machine learning
interpretability
0.912025
Tensor Product Neural Networks for Functional ANOVA Model · ICML 2025
Machine learning › Learning theory › approximation theory
neural network approximation
0.912025
Tensor Product Neural Networks for Functional ANOVA Model · ICML 2025
Machine learning › Deep learning architectures and training › feature interaction
neural tensor network
0.912025
Tensor Product Neural Networks for Functional ANOVA Model · ICML 2025

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

tensor product basis expansion · 0.9functional ANOVA decomposition · 0.9
YearPublicationVenuePosition
2025 Tensor Product Neural Networks for Functional ANOVA Model
abstract
Interpretability for machine learning models is becoming more and more important as machine learning models become more complex. The functional ANOVA model, which decomposes a high-dimensional function into a sum of lower dimensional functions (commonly referred to as components), is one of the most popular tools for interpretable AI, and recently, various neural networks have been developed for estimating each component in the functional ANOVA model. However, such neural networks are highly unstable when estimating each component since the components themselves are not uniquely defined. That is, there are multiple functional ANOVA decompositions for a given function. In this paper, we propose a novel neural network which guarantees a unique functional ANOVA decomposition and thus is able to estimate each component stably. We call our proposed neural network ANOVA Tensor Product Neural Network (ANOVA-TPNN) since it is motivated by the tensor product basis expansion. Theoretically, we prove that ANOVA-TPNN can approximate any smooth function well. Empirically, we show that ANOVA-TPNN provide much more stable estimation of each component and thus much more stable interpretation when training data and initial values of the model parameters vary than existing neural networks do. Our source code is released at https://github.com/ParkSeokhun/ANOVA-TPNN
Seokhun Park, Insung Kong, Yongchan Choi, Chanmoo Park, Yongdai Kim
ICML4