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

Seiichi Kuroki

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

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

Artificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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
Learning theory · 70% Transfer learning and domain adaptation · 30%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
discrepancy measure
0.412019
Unsupervised Domain Adaptation Based on Source-Guided Discrepancy · AAAI 2019
Machine learning › Learning theory › generalization bounds
domain adaptation bound
0.412019
Unsupervised Domain Adaptation Based on Source-Guided Discrepancy · AAAI 2019
Machine learning › Learning theory
generalization bounds
0.412019
Unsupervised Domain Adaptation Based on Source-Guided Discrepancy · AAAI 2019
Machine learning › Transfer learning and domain adaptation › domain adaptation
unsupervised domain adaptation
0.412019
Unsupervised Domain Adaptation Based on Source-Guided Discrepancy · AAAI 2019

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

finite-sample convergence · 0.4
YearPublicationVenuePosition
2019 Unsupervised Domain Adaptation Based on Source-Guided Discrepancy
abstract
Unsupervised domain adaptation is the problem setting where data generating distributions in the source and target domains are different and labels in the target domain are unavailable. An important question in unsupervised domain adaptation is how to measure the difference between the source and target domains. Existing discrepancy measures for unsupervised domain adaptation either require high computation costs or have no theoretical guarantee. To mitigate these problems, this paper proposes a novel discrepancy measure called source-guided discrepancy (S-disc), which exploits labels in the source domain unlike the existing ones. As a consequence, S-disc can be computed efficiently with a finitesample convergence guarantee. In addition, it is shown that S-disc can provide a tighter generalization error bound than the one based on an existing discrepancy measure. Finally, experimental results demonstrate the advantages of S-disc over the existing discrepancy measures.
Seiichi Kuroki, Nontawat Charoenphakdee, Han Bao 0002, Junya Honda, Issei Sato, Masashi Sugiyama
AAAI1