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

Ryosuke Nagumo

dblp:384/4171 · 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.

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

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › density estimation
density ratio estimation
0.812024
Density Ratio Estimation with Doubly Strong Robustness · ICML 2024
Mathematical optimization › continuous optimization
convex optimization
0.812024
Density Ratio Estimation with Doubly Strong Robustness · ICML 2024
Mathematical optimization
divergence minimization
0.812024
Density Ratio Estimation with Doubly Strong Robustness · ICML 2024

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

γ-divergence · 1.5kullback-leibler divergence · 1.5difference of convex functions · 1.5
YearPublicationVenuePosition
2024 Density Ratio Estimation with Doubly Strong Robustness
abstract
We develop two density ratio estimation (DRE) methods with robustness to outliers. These are based on the divergence with a weight function to weaken the adverse effects of outliers. One is based on the Unnormalized Kullback-Leibler divergence, called Weighted DRE, and its optimization is a convex problem. The other is based on the γ-divergence, called γ-DRE, which improves a normalizing term problem of Weighted DRE. Its optimization is a DC (Difference of Convex functions) problem and needs more computation than a convex problem. These methods have doubly strong robustness, which means robustness to the heavy contamination of both the reference and target distributions. Numerical experiments show that our proposals are more robust than the previous methods.
Ryosuke Nagumo, Hironori Fujisawa
ICML1