Akihito Taya

Akihito Taya

Auto-generated profile, based on publicly available information

Akihito Taya

The University of Tokyo, Tokyo, Japan

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
9 September 2022 in IEEE Transactions on Signal and Information Processing over Networks
Verified
Journal Article
Closed access
ATAkihito Taya
Akihito Taya
TNTakayuki Nishio
Takayuki Nishio
MMMasahiro Morikura
Masahiro Morikura
KYKoji Yamamoto
Koji Yamamoto
This paper proposes a fully decentralized federated learning (FL) scheme for Internet of Everything (IoE) devices that are connected via multi-hop networks. Because FL algorithms hardly converge the parameters of machine learning (ML) models, this paper focuses on the convergence of ML models in function spaces . Considering that the representative loss functions of ML tasks e.g., mean squared error (MSE) and Kullback-Leibler (KL) divergence, are convex functionals , algorithms that directly update functions in function spaces could converge to the optimal solution. The key concept of this paper is to tailor a consensus-based optimization algorithm to work in the function space and achieve the global optimum in a distributed manner. This paper first analyzes the convergence of the proposed algorithm in a function space, which is referred to as a meta-algorithm, and shows that the spectral graph theory can be applied to the function space in a manner similar to that of numerical vectors. Then, consensus-based multi-hop federated distillation (CMFD) is developed for a neural network (NN) to implement the meta-algorithm. CMFD leverages knowledge distillation to realize function aggregation among adjacent devices without parameter averaging. An advantage of CMFD is that it works even with different NN models among the distributed learners. Although CMFD does not perfectly reflect the behavior of the meta-algorithm, the discussion of the meta-algorithm's convergence property promotes an intuitive understanding of CMFD, and simulation evaluations show that NN models converge using CMFD for several tasks. The simulation results also show that CMFD achieves higher accuracy than parameter aggregation for weakly connected networks, and CMFD is more stable than parameter aggregation methods

5 April 2022 in IEEE Access
Verified
Journal Article
Open access
SKSota Kondo
Sota Kondo
SISohei Itahara
Sohei Itahara
KYKota Yamashita
Kota Yamashita
KYKoji Yamamoto
Koji Yamamoto
YKYusuke Koda
Yusuke Koda
ATAkihito Taya
Akihito Taya
In the field of WiFi sensing, as an alternative sensing source of the channel state information (CSI) matrix, the use of a beamforming feedback matrix (BFM) that is a right singular matrix of the CSI matrix has attracted significant interest owing to its wide availability regarding the underlying WiFi systems. In the IEEE 802.11ac/ax standard, the station (STA) transmits a BFM to an access point (AP), which uses the BFM for precoded multiple-input and multiple-output communications. In addition, in the same way, the AP transmits a BFM to the STA, and the STA uses the received BFM. Regarding BFM-based sensing, extensive real-world experiments were conducted as part of this study, and two key insights were reported: Firstly, this report identified a potential issue related to accuracy in existing uni-directional BFM-based sensing frameworks that leverage only BFMs transmitted for the AP or STA. Such uni-directionality introduces accuracy concerns when there is a sensing capability gap between the uni-directional BFMs for the AP and STA. Thus, this report experimentally evaluates the sensing ability disparity between the uni-directional BFMs, and shows that the BFMs transmitted for an AP achieve higher sensing accuracy compared to the BFMs transmitted from the STA when the sensing target values are estimated depending on the angle of departure of the AP. Secondly, to complement the sensing gap, this paper proposes a bi-directional sensing framework, which simultaneously leverages the BFMs transmitted from the AP and STA. The experimental evaluations reveal that bi-directional sensing achieves higher accuracy than uni-directional sensing in terms of the human localization task.

1 May 2019 in IEICE Transactions on Information and Systems
Verified
Journal Article
Open access
PDF file
ATAkihito Taya
Akihito Taya
TNTakayuki Nishio
Takayuki Nishio
MMMasahiro Morikura
Masahiro Morikura
KYKoji Yamamoto
Koji Yamamoto
Sharing perceptual data (e.g., camera and LiDAR data) with other vehicles enhances the traffic safety of autonomous vehicles because it helps vehicles locate other vehicles and pedestrians in their blind spots. Such safety applications require high throughput and short delay, which cannot be achieved by conventional microwave vehicular communication systems. Therefore, millimeter-wave (mmWave) communications are considered to be a key technology for sharing perceptual data because of their wide bandwidth. One of the challenges of data sharing in mmWave communications is broadcasting because narrow-beam directional antennas are used to obtain high gain. Because many vehicles should share their perceptual data to others within a short time frame in order to enlarge the areas that can be perceived based on shared perceptual data, an efficient scheduling for concurrent transmission that improves spatial reuse is required for perceptual data sharing. This paper proposes a data sharing algorithm that employs a graph-based concurrent transmission scheduling. The proposed algorithm realizes concurrent transmission to improve spatial reuse by designing a rule that is utilized to determine if the two pairs of transmitters and receivers interfere with each other by considering the radio propagation characteristics of narrow-beam antennas. A prioritization method that considers the geographical information in perceptual data is also designed to enlarge perceivable areas in situations where data sharing time is limited and not all data can be shared. Simulation results demonstrate that the proposed algorithm doubles the area of the cooperatively perceivable region compared with a conventional algorithm that does not consider mmWave communications because the proposed algorithm achieves high-throughput transmission by improving spatial reuse. The prioritization also enlarges the perceivable region by a maximum of 20%.

1 July 2022 in IEICE Communications Express
Verified
Journal Article
Closed access
PDF file
YKYuto Kihira
Yuto Kihira
KYKoji Yamamoto
Koji Yamamoto
ATAkihito Taya
Akihito Taya
TNTakayuki Nishio
Takayuki Nishio
YKYusuke Koda
Yusuke Koda
KYKazuto Yano
Kazuto Yano
Access point (AP) coordinated spatial reuse with Q-learning enables efficient spectrum utilization [1]. Although sharing of transmission schedules among APs is necessary for coordination, there is no mechanism to identify the APs with which the schedules are to be shared, resulting in excess information being shared among APs. In this study, we propose a scheme to identify the interference-free APs that are not required for sharing of information by comparing Q-values. A simple simulation demonstrates that this scheme successfully reduces shared information without throughput degradation.

21 April 2025 in Journal of Reliable Intelligent Environments
Verified
Journal Article
Open access
PDF file
YYYui Yamashita
Yui Yamashita
ATAkihito Taya
Akihito Taya
TWTakumi Wada
Takumi Wada
YTYoshito Tobe
Yoshito Tobe
Recently, the concept of the Internet of Things (IoT) has gained recognition. Moreover, smart devices, such as smartphones and wearable devices, have become widely used because they are getting smaller and more convenient to wear. These devices are equipped with numerous, enabling them to collect large amounts of data and process it using machine learning. Most studies on sensing data processing rely on deep neural networks (DNNs). However, DNNs are not suitable for smart sensing devices due to their high computational complexity. Therefore, this paper adopts ensemble learning of decision trees, specifically random forests and gradient boosting decision trees (GBDT), to build prediction models that require fewer computational resources. Additionally, machine learning typically requires a large amount of data to train highly accurate prediction models. A straightforward way to gather diverse data is to upload the data collected by each device to a server. While this approach simplifies data collection, it introduces the need for server maintenance. Moreover, it raises concerns about the centralization of data and models. To address these issues, a decentralized machine learning algorithm that operates without a server is necessary. This paper proposes a decentralized ensemble learning algorithm for decision trees, where multiple devices communicate directly with each other to share information without relying on a server. The proposed method is applicable to situations where data are non-independent and non-identically distributed (non-IID).

13 October 2023 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
YFYutong Feng
Yutong Feng
ATAkihito Taya
Akihito Taya
NYNishiyama Yuuki
Nishiyama Yuuki
KSKaoru Sezaki
Kaoru Sezaki
JLJun Liu
Jun Liu
In this letter, we investigate the problem of detecting compressed stochastic sparse signals with unknown sparsity degree under Bernoulli–Gaussian model. In addition to the generalized likelihood ratio test (GLRT) proposed in [1], the corresponding Rao test and Wald test are derived in this letter. By observing that obtaining their analytical performance is challenging, we further propose a new probability constraint estimator (PCE) of the unknown sparsity degree. Interestingly, by adopting the PCE, the GLRT, Rao and Wald tests are shown to be statistically equivalent and reduce to a new detector (i.e., the detector with PCE) with a simple structure. The analytical performance of the detector with PCE is thus derived, which is verified by Monte Carlo simulations. Finally, numerical experiments illustrate that the proposed Rao test and the detector with PCE outperform the original GLRT.