Yuichi Yoshida

Dr. Yuichi Yoshida


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 February 2018 in arXiv
Verified
Preprint
Open access
PDF file
TMTakeru Miyato
Takeru Miyato
TKToshiki Kataoka
Toshiki Kataoka
MKMasanori Koyama
Masanori Koyama
YYYuichi Yoshida
Yuichi Yoshida
One of the challenges in the study of generative adversarial networks is the instability of its training. In this paper, we propose a novel weight normalization technique called spectral normalization to stabilize the training of the discriminator. Our new normalization technique is computationally light and easy to incorporate into existing implementations. We tested the efficacy of spectral normalization on CIFAR10, STL-10, and ILSVRC2012 dataset, and we experimentally confirmed that spectrally normalized GANs (SN-GANs) is capable of generating images of better or equal quality relative to the previous training stabilization techniques.

29 August 2018 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
TSTasuku Soma
Tasuku Soma
YYYuichi Yoshida
Yuichi Yoshida

22 July 2022 in Theoretical Computer Science
Verified
Journal Article
Closed access
MIMasahiro Ikeda
Masahiro Ikeda
AMAtsushi Miyauchi
Atsushi Miyauchi
YTYuuki Takai
Yuuki Takai
YYYuichi Yoshida
Yuichi Yoshida

21 October 2014 in Algorithmica
Verified
Journal Article
Closed access
PDF file
YYYuichi Yoshida
Yuichi Yoshida
HIHiro Ito
Hiro Ito

12 November 2015
Verified
Book Chapter
Closed access
PDF file
YIYoichi Iwata
Yoichi Iwata
YYYuichi Yoshida
Yuichi Yoshida

14 August 2023 in SIAM Journal on Computing
Verified
Journal Article
Closed access
NVNithin Varma
Nithin Varma
YYYuichi Yoshida
Yuichi Yoshida
Modern applications of graph algorithms often involve the use of the output sets (usually, a subset of edges or vertices of the input graph) as inputs to other algorithms. Since the input graphs of interest are large and dynamic, it is desirable for an algorithm’s output to not change drastically when a few random edges are removed from the input graph, so as to prevent issues in postprocessing. Alternately, having such a guarantee also means that one can revise the solution obtained by running the algorithm on the original graph in just a few places in order to obtain a solution for the new graph. We formalize this feature by introducing the notion of average sensitivity of graph algorithms, which is the average earth mover’s distance between the output distributions of an algorithm on a graph and its subgraph obtained by removing an edge, where the average is over the edges removed and the distance between two outputs is the Hamming distance. In this work, we initiate a systematic study of average sensitivity of graph algorithms. After deriving basic properties of average sensitivity such as composition, we provide efficient approximation algorithms with low average sensitivities for concrete graph problems, including the minimum spanning forest problem, the global minimum cut problem, the minimum [Formula: see text]-[Formula: see text] cut problem, and the maximum matching problem. In addition, we prove that the average sensitivity of our global minimum cut algorithm is almost optimal, by showing a nearly matching lower bound. We also show that every algorithm for the 2-coloring problem has average sensitivity linear in the number of vertices. One of the main ideas involved in designing our algorithms with low average sensitivity is the following fact: if the presence of a vertex or an edge in the solution output by an algorithm can be decided locally, then the algorithm has a low average sensitivity, allowing us to reuse the analyses of known sublinear-time algorithms and local computation algorithms. Using this fact in conjunction with our average sensitivity lower bound for 2-coloring, we show that every local computation algorithm for 2-coloring has query complexity linear in the number of vertices, thereby answering an open question.