Arrow Research search

Author name cluster

Masatoshi Yoshikawa

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
2 author rows

Possible papers

3

AAAI Conference 2021 Conference Paper

FLAME: Differentially Private Federated Learning in the Shuffle Model

  • Ruixuan Liu
  • Yang Cao
  • Hong Chen
  • Ruoyang Guo
  • Masatoshi Yoshikawa

Federated Learning (FL) is a promising machine learning paradigm that enables the analyzer to train a model without collecting users’ raw data. To ensure users’ privacy, differentially private federated learning has been intensively studied. The existing works are mainly based on the curator model or local model of differential privacy. However, both of them have pros and cons. The curator model allows greater accuracy but requires a trusted analyzer. In the local model where users randomize local data before sending them to the analyzer, a trusted analyzer is not required but the accuracy is limited. In this work, by leveraging the privacy amplification effect in the recently proposed shuffle model of differential privacy, we achieve the best of two worlds, i. e. , accuracy in the curator model and strong privacy without relying on any trusted party. We first propose an FL framework in the shuffle model and a simple protocol (SS-Simple) extended from existing work. We find that SS-Simple only provides an insufficient privacy amplification effect in FL since the dimension of the model parameter is quite large. To solve this challenge, we propose an enhanced protocol (SS-Double) to increase the privacy amplification effect by subsampling. Furthermore, for boosting the utility when the model size is greater than the user population, we propose an advanced protocol (SS-Topk) with gradient sparsification techniques. We also provide theoretical analysis and numerical evaluations of the privacy amplification of the proposed protocols. Experiments on realworld dataset validate that SS-Topk improves the testing accuracy by 60. 7% than the local model based FL. We highlight an observation that SS-Topk improves the accuracy by 33. 94% than the curator model based FL without any trusted party. Compared with non-private FL, our protocol SS-Topk only lose 1. 48% accuracy under (2. 348, 5e−6 )-DP per epoch.

ECAI Conference 2020 Conference Paper

Comparative Timeline Summarization via Dynamic Affinity-Preserving Random Walk

  • Yijun Duan
  • Adam Jatowt
  • Masatoshi Yoshikawa

Documents which contain accounts of historical events are quite common. Biographies or descriptions of entity histories like histories of places or organizations are examples of such timeline documents. Their content is explicitly or implicitly associated with timestamps indicating occurrence time of described past events. The collections of such timeline documents can be quite large and can pose challenge for readers trying to make sense of them. We then introduce a novel research task, Comparative Timeline Summarization (CTS), as an effective strategy to discover important similarities and differences in large collections of timeline documents for providing contrastive type of knowledge. We propose a novel summarization framework which relies on a dynamic affinity-preserving mutually reinforced random walk for the CTS task and evaluate it on diverse Wikipedia categories and New York Time news collections. The ROUGE evaluations demonstrate the superior performance of our method on summarizing contrastive and diverse themes over competitive baselines.

JBHI Journal 2018 Journal Article

Medication Episode Construction Framework for Retrospective Database Analyses of Patients With Chronic Diseases

  • Purnomo Husnul Khotimah
  • Yuichi Sugiyama
  • Masatoshi Yoshikawa
  • Akihiro Hamasaki
  • Osamu Sugiyama
  • Kazuya Okamoto
  • Tomohiro Kuroda

Objective: For chronic diseases, medical history reconstruction is essential for retrospective database analyses. One important aspect is determining which prescriptions belong to the same episode. However, a standard framework for this task is still lacking, particularly for multitherapy datasets. This paper presents a medication episode construction framework for the medical history of patients with chronic diseases. Methods: Allen's relaxed temporal relations (i. e. , temporal relations with time constraints relaxed by $\pm \epsilon$ ) is used to define the consecutive prescription relations considering the patients’ behavior. For example, patients occasionally arrive earlier or later than their appointment. Results: $\epsilon$ influences the generation of stable periods (i. e. , periods of time, at least three months, in which a medication is continuously taken by a patient). When using the lowest selected $\epsilon$ value (7 days), considerably fewer shorter stable periods (for durations less than 300 days) are produced and more longer stable periods are produced compared to cases without using $\epsilon$. Furthermore, the results show that by using $\epsilon$, regarding the number of events, where a stable period continues the previous stable period, decreases and the number of medication transition events available to be observed increases. Conclusion: Using $\epsilon$ in medication episode construction from multitherapy prescription datasets enables the longer expression of short-duration fragmented prescriptions and pruning repetitive prescriptions. Significance: Our proposed framework is designed for multitherapy datasets, which has not been addressed by previous studies. The concept of $\epsilon$ relaxes the prescription relation against noise caused by the patient behavior and consequently provides a compact, but informative search space for observing medication transition events in a longitudinal analysis.

v2026.09.13