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

Hiroki Ishikura

dblp:97/6962 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2022
—ORCID · unresolved

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

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 50% Optimization for machine learning · 50%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › robustness
adversarial attack
0.612022
Diversified Adversarial Attacks based on Conjugate Gradient Method · ICML 2022
Machine learning › Optimization for machine learning › gradient-based optimization
conjugate gradient
0.612022
Diversified Adversarial Attacks based on Conjugate Gradient Method · ICML 2022
Machine learning › Optimization for machine learning
gradient-based optimization
0.612022
Diversified Adversarial Attacks based on Conjugate Gradient Method · ICML 2022
Machine learning › Trustworthy machine learning
robustness
0.612022
Diversified Adversarial Attacks based on Conjugate Gradient Method · ICML 2022

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

conjugate gradient · 0.6Auto-PGD · 0.6
YearPublicationVenuePosition
2022 Development and Evaluation of Embedding Methods for Graphs with Multi Attributes
abstract
Graph embedding is the process of obtaining a vector representation of graph nodes. The representation obtained by graph embedding is highly versatile. It can be used for various tasks, such as recommendation and clustering tasks. However, there are only a few methods that incorporate attributes indicating node characteristics, such as user gender, age, or product category, into graph embedding. Therefore, we hypothesize that nodes with the same attribute are often connected to the same node. Consequently, we propose two methods for graph embedding, parallel and serial, that use metric learning to reflect attribute data in node features. The proposed method can be applied to any graph embedding and metric learning method, and thus can also be applied to many new methods yet to be developed. Numerical experimental results show that the proposed method using node attributes is superior to the existing methods in both AUROC and accuracy.
Miyu Fujii, David Taingngin, Keiichiro Yamamura, Nozomi Hata, Hiroki Kai, Ryuji Noda, Hiroki Ishikura, Tatsuru Higurashi, Katsuki Fujisawa
IEEE Big Data7
2022 Diversified Adversarial Attacks based on Conjugate Gradient Method
abstract
Deep learning models are vulnerable to adversarial examples, and adversarial attacks used to generate such examples have attracted considerable research interest. Although existing methods based on the steepest descent have achieved high attack success rates, ill-conditioned problems occasionally reduce their performance. To address this limitation, we utilize the conjugate gradient (CG) method, which is effective for this type of problem, and propose a novel attack algorithm inspired by the CG method, named the Auto Conjugate Gradient (ACG) attack. The results of large-scale evaluation experiments conducted on the latest robust models show that, for most models, ACG was able to find more adversarial examples with fewer iterations than the existing SOTA algorithm Auto-PGD (APGD). We investigated the difference in search performance between ACG and APGD in terms of diversification and intensification, and define a measure called Diversity Index (DI) to quantify the degree of diversity. From the analysis of the diversity using this index, we show that the more diverse search of the proposed method remarkably improves its attack success rate.
Keiichiro Yamamura, Haruki Sato, Nariaki Tateiwa, Nozomi Hata, Toru Mitsutake, Issa Oe, Hiroki Ishikura, Katsuki Fujisawa
ICML7