Shun Takagi

Shun Takagi

Auto-generated profile, based on publicly available information

Shun Takagi

Kyoto University

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

29 October 2024
Verified
Conference Paper
Open access
HTHaru Terashima
Haru Terashima
STShun Takagi
Shun Takagi
NTNaoki Tamura
Naoki Tamura
KSKazuyuki Shoji
Kazuyuki Shoji
THTahera Hossain
Tahera Hossain
NKNobuo Kawaguchi
Nobuo Kawaguchi
Human Mobility Prediction Challenge 2024 was organized to compare human future movement prediction methods using a unified dataset. The challenge focuses on human movement prediction in multiple cities with varying numbers of users. Many existing movement prediction methods train deep learning models using large-scale movement histories from cities and make predictions. While cities with large users have sufficient training data, smaller cities with fewer users may face challenges due to insufficient data, raising concerns about lower prediction accuracy. Additionally, it is difficult to treat stay locations between different cities' movement histories due to differences in spatial area arrangement, making it challenging to share data across cities. To address this issue, we propose human movement prediction method that utilizes time-series stay frequency patterns, which can be commonly applied across different cities. This method demonstrated superiority in predicting movements in cities with fewer users compared to models trained and predicted using only the movement histories of the target city. Furthermore, the method achieved top 10 prediction accuracy in HuMob Challenge 2024.

13 July 2022
Verified
Book Chapter
Closed access
PDF file
RHRyota Hiraishi
Ryota Hiraishi
MYMasatoshi Yoshikawa
Masatoshi Yoshikawa
STShun Takagi
Shun Takagi
YCYang Cao
Yang Cao
SFSumio Fujita
Sumio Fujita
HGHidehito Gomi
Hidehito Gomi

12 May 2026 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
STShun Takagi
Shun Takagi
SLSeng Pei Liew
Seng Pei Liew
Shuffling is a powerful way to amplify privacy of a local randomizer in private distributed data analysis. Most existing analyses of how shuffling amplifies privacy are based on the pure local differential privacy (DP) parameter ε 0 . This paper raises the question of whether ε 0 adequately captures the privacy amplification. For example, since the Gaussian mechanism does not satisfy pure local DP for any finite ε 0 , does it follow that shuffling yields weak amplification? To solve this problem, we revisit the privacy blanket bound of Balle et al. (the blanket divergence ) and develop a direct asymptotic analysis that bypasses ε 0 . Our key finding is that, asymptotically, the blanket divergence depends on the local mechanism only through a single scalar parameter χ and that this dependence is monotonic. Therefore, this parameter serves as a proxy for shuffling efficiency, which we call the shuffle index. By applying this analysis to both upper and lower bounds of the shuffled mechanism's privacy profile, we obtain a band for its privacy guarantee through shuffle indices. Furthermore, we derive a simple structural, necessary and sufficient condition on the local randomizer under which this band collapses asymptotically. k -RR families with k ≥3 satisfy this condition, while for generalized Gaussian mechanisms the condition may not hold but the resulting band remains tight. Finally, we complement the asymptotic theory with an FFT-based algorithm for computing the blanket divergence at finite n , which offers rigorously controlled relative error and near-linear running time in n , providing a practical numerical analysis for shuffle DP.