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.

Koichi Tojo

dblp:230/4509 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 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
2 papers
Deep learning architectures and training · 42% Learning theory · 42% Generative modeling · 17%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › feedforward neural network
invertible neural network
1.122023
Universal Approximation Property of Invertible Neural Networks · J. Mach. Learn. Res. 2023
Coupling-based Invertible Neural Networks Are Universal Diffeomorphism Approximators · NeurIPS 2020
Machine learning › Learning theory › approximation theory › neural network approximation
universal approximation
1.122023
Universal Approximation Property of Invertible Neural Networks · J. Mach. Learn. Res. 2023
Coupling-based Invertible Neural Networks Are Universal Diffeomorphism Approximators · NeurIPS 2020
Machine learning › Generative modeling
normalizing flow
0.412020
Coupling-based Invertible Neural Networks Are Universal Diffeomorphism Approximators · NeurIPS 2020
Mathematical optimization
approximation theory
0.112020
Coupling-based Invertible Neural Networks Are Universal Diffeomorphism Approximators · NeurIPS 2020

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

diffeomorphism approximation · 0.9coupling flows · 0.9affine coupling · 0.9differential geometry · 0.7
YearPublicationVenuePosition
2023 Universal Approximation Property of Invertible Neural Networks
abstract
Invertible neural networks (INNs) are neural network architectures with invertibility by design. Thanks to their invertibility and the tractability of their Jacobians, INNs have various machine learning applications such as probabilistic modeling, generative modeling, and representation learning. However, their attractive properties often come at the cost of restricting the layer design, which poses a question on their representation power: can we use these models to approximate sufficiently diverse functions? To answer this question, we have developed a general theoretical framework to investigate the representation power of INNs, building on a structure theorem of differential geometry. The framework simplifies the approximation problem of diffeomorphisms, which enables us to show the universal approximation properties of INNs. We apply the framework to two representative classes of INNs, namely Coupling-Flow-based INNs (CF-INNs) and Neural Ordinary Differential Equations (NODEs), and elucidate their high representation power despite the restrictions on their architectures.
Isao Ishikawa, Takeshi Teshima, Koichi Tojo, Kenta Oono, Masahiro Ikeda, Masashi Sugiyama
J. Mach. Learn. Res.3
2020 Coupling-based Invertible Neural Networks Are Universal Diffeomorphism Approximators
abstract
Invertible neural networks based on coupling flows (CF-INNs) have various machine learning applications such as image synthesis and representation learning. However, their desirable characteristics such as analytic invertibility come at the cost of restricting the functional forms. This poses a question on their representation power: are CF-INNs universal approximators for invertible functions? Without a universality, there could be a well-behaved invertible transformation that the CF-INN can never approximate, hence it would render the model class unreliable. We answer this question by showing a convenient criterion: a CF-INN is universal if its layers contain affine coupling and invertible linear functions as special cases. As its corollary, we can affirmatively resolve a previously unsolved problem: whether normalizing flow models based on affine coupling can be universal distributional approximators. In the course of proving the universality, we prove a general theorem to show the equivalence of the universality for certain diffeomorphism classes, a theoretical insight that is of interest by itself.
Takeshi Teshima, Isao Ishikawa, Koichi Tojo, Kenta Oono, Masahiro Ikeda, Masashi Sugiyama
NeurIPS3