Shotaro Akaho

Shotaro Akaho

Auto-generated profile, based on publicly available information

Shotaro Akaho

The Institute of Statistical Mathematics

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

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

Representative Publications

View All Publications
1 August 2005 in Neurocomputing
Verified
Journal Article
Closed access
YNYasunori Nishimori
Yasunori Nishimori
SAShotaro Akaho
Shotaro Akaho

1 December 2009
Verified
Conference Paper
Closed access
TKToshihiro Kamishima
Toshihiro Kamishima
MHMasahiro Hamasaki
Masahiro Hamasaki
SAShotaro Akaho
Shotaro Akaho
The aim of transfer learning is to improve prediction accuracy on a target task by exploiting the training examples for tasks that are related to the target one. Transfer learning has received more attention in recent years, because this technique is considered to be helpful in reducing the cost of labeling. In this paper, we propose a very simple approach to transfer learning: TrBagg, which is the extension of bagging. TrBagg is composed of two stages: Many weak classifiers are first generated as in standard bagging, and these classifiers are then filtered based on their usefulness for the target task. This simplicity makes it easy to work reasonably well without severe tuning of learning parameters. Further, our algorithm equips an algorithmic scheme to avoid negative transfer. We applied TrBagg to personalized tag prediction tasks for social bookmarks. Our approach has several convenient characteristics for this task such as adaptation to multiple tasks with low computational cost.

3 September 2010
Verified
Book Chapter
Closed access
PDF file
TKToshihiro Kamishima
Toshihiro Kamishima
HKHideto Kazawa
Hideto Kazawa
SAShotaro Akaho
Shotaro Akaho

26 July 2021 in Neural Computation
Verified
Journal Article
Open access
PDF file
RKRyo Karakida
Ryo Karakida
SAShotaro Akaho
Shotaro Akaho
SAShun-Ichi Amari
Shun-Ichi Amari
The Fisher information matrix (FIM) plays an essential role in statistics and machine learning as a Riemannian metric tensor or a component of the Hessian matrix of loss functions. Focusing on the FIM and its variants in deep neural networks (DNNs), we reveal their characteristic scale dependence on the network width, depth, and sample size when the network has random weights and is sufficiently wide. This study covers two widely used FIMs for regression with linear output and for classification with softmax output. Both FIMs asymptotically show pathological eigenvalue spectra in the sense that a small number of eigenvalues become large outliers depending on the width or sample size, while the others are much smaller. It implies that the local shape of the parameter space or loss landscape is very sharp in a few specific directions while almost flat in the other directions. In particular, the softmax output disperses the outliers and makes a tail of the eigenvalue density spread from the bulk. We also show that pathological spectra appear in other variants of FIMs: one is the neural tangent kernel; another is a metric for the input signal and feature space that arises from feedforward signal propagation. Thus, we provide a unified perspective on the FIM and its variants that will lead to more quantitative understanding of learning in large-scale DNNs.

27 June 2019 in Science and Technology of Advanced Materials
Verified
Journal Article
Open access
TMTarojiro Matsumura
Tarojiro Matsumura
NNNaoka Nagamura
Naoka Nagamura
SAShotaro Akaho
Shotaro Akaho
KNKenji Nagata
Kenji Nagata
YAYasunobu Ando
Yasunobu Ando
We introduce a spectrum-adapted expectation-maximization (EM) algorithm for high-throughput analysis of a large number of spectral datasets by considering the weight of the intensity corresponding to the measurement energy steps. Proposed method was applied to synthetic data in order to evaluate the performance of the analysis accuracy and calculation time. Moreover, the proposed method was performed to the spectral data collected from graphene and MoS2 field-effect transistors devices. The calculation completed in less than 13.4 s per set and successfully detected systematic peak shifts of the C 1s in graphene and S 2p in MoS2 peaks. This result suggests that the proposed method can support the investigation of peak shift with two advantages: (1) a large amount of data can be processed at high speed; and (2) stable and automatic calculation can be easily performed. Graphical Abstract

1 January 2006 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
YNYasunori Nishimori
Yasunori Nishimori
SAShotaro Akaho
Shotaro Akaho
MPMark D. Plumbley
Mark D. Plumbley