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

Eiki Shimizu

dblp:372/6773 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 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
Reinforcement learning · 50% Probabilistic and Bayesian machine learning · 25% Kernel, tree and ensemble methods · 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 › density estimation
conditional density estimation
0.812024
Neural-Kernel Conditional Mean Embeddings · ICML 2024
Machine learning › Kernel, tree and ensemble methods › kernel embedding
conditional mean embedding
0.812024
Neural-Kernel Conditional Mean Embeddings · ICML 2024
Machine learning › Reinforcement learning › value-based reinforcement learning
distributional reinforcement learning
0.812024
Neural-Kernel Conditional Mean Embeddings · ICML 2024
Machine learning › Reinforcement learning
value-based reinforcement learning
0.812024
Neural-Kernel Conditional Mean Embeddings · ICML 2024

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

q-learning · 0.8neural network · 0.8kernel methods · 0.8
YearPublicationVenuePosition
2024 Neural-Kernel Conditional Mean Embeddings
abstract
Kernel conditional mean embeddings (CMEs) offer a powerful framework for representing conditional distributions, but they often face scalability and expressiveness challenges. In this work, we propose a new method that effectively combines the strengths of deep learning with CMEs in order to address these challenges. Specifically, our approach leverages the end-to-end neural network (NN) optimization framework using a kernel-based objective. This design circumvents the computationally expensive Gram matrix inversion required by current CME methods. To further enhance performance, we provide efficient strategies to optimize the remaining kernel hyperparameters. In conditional density estimation tasks, our NN-CME hybrid achieves competitive performance and often surpasses existing deep learning-based methods. Lastly, we showcase its remarkable versatility by seamlessly integrating it into reinforcement learning (RL) contexts. Building on Q-learning, our approach naturally leads to a new variant of distributional RL methods, which demonstrates consistent effectiveness across different environments.
Eiki Shimizu, Kenji Fukumizu, Dino Sejdinovic
ICML1