Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ai Kagawa

dblp:203/4446 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0001-8339-6175ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 50% Optimization for machine learning · 50%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
regression
0.312017
Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement · ICML 2017
Machine learning › Optimization for machine learning › regularized risk minimization
regularized regression
0.312017
Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement · ICML 2017
Mathematical optimization › large-scale optimization › decomposition methods
column generation
0.312017
Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement · ICML 2017
Mathematical optimization
discrete optimization
0.312017
Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement · ICML 2017

Methods — techniques the papers use, named apart from their topics

rectangular maximum agreement · 0.6l1-penalized regression · 0.6branch-and-bound · 0.6
YearPublicationVenuePosition
2026 Federated Learning Driven Multi-Modal User Scheduling for 5G Communication Systems
abstract
In this paper, we consider a federated learning (FL)-assisted fifth-generation (5G) resource block (RB) allocation scheme for terrestrial users. Enhanced mobile broadband (eMBB), ultra-reliable low-latency communications (URLLC), and massive machine-type communications (mMTC) users calculate their possible achievable uplink data rate with its local neural engine based on underlying channel conditions and packet availability at their data queue. Each user conveys this information to the 5G base station (BS), which then allocates the RB to the user that best meets its service requirements, thereby improving the network throughput. Each user trains its neural engine with either baseline clustered FL or our proposed peer-to-peer (P2P) FL. In clustered FL, clients are grouped by local model similarity, implicitly capturing user types such as eMBB, URLLC, and mMTC. In our P2P FL scheme, clients update their models through exchanges with similarity-selected peers, using similarity-adaptive weights. Simulation results demonstrate the effectiveness of our proposed FL approaches in scheduling users for transmission over conventional baseline schemes.
Ai Kagawa, Imtiaz Ahmed 0001
CCNC1
2025 Bilevel-Optimized Clustered and Distributed Federated Learning Secured by Blockchain for Building Energy Forecasting
abstract
This paper presents bilevel-optimized clustered and distributed federated learning approaches, secured by blockchain technology, to enhance the predictive performance and security of collaborative building energy forecasting. Our clustered and peer-to-peer communication mechanism allows clients with similar locally trained models, implicitly reflecting similar data distributions, to collaborate more effectively without exchanging raw data. Furthermore, by leveraging blockchain’s decentralized and tamper-proof architecture, the proposed system ensures secure coordination and traceable model updates among clients without relying on a central server. Experimental results on real-world building energy datasets show that our approach effectively reduces prediction error while preserving data privacy.
Ai Kagawa, Judy Min, Nancy Min
ICMLA1
2024 Privacy-Preserving Federated Learning for Science: Challenges and Research Directions
abstract
This paper discusses the key challenges and future research directions for privacy-preserving federated learning (PPFL), with a focus on its application to large-scale scientific artificial intelligence models, in particular, foundation models (FMs). PPFL enables collaborative model training across distributed datasets while preserving privacy—an important collaborative approach for science. We discuss the need for efficient and scalable algorithms to address the increasing complexity of FMs, particularly when dealing with heterogeneous clients. In addition, we underscore the need for developing advance privacy-preserving techniques, such as differential privacy, to balance privacy and utility in large FMs emphasizing fairness and incentive mechanisms to ensure equitable participation among heterogeneous clients. Finally, we emphasize the need for a robust software stack supporting scalable and secure PPFL deployments across multiple high-performance computing facilities. We envision that PPFL would play a crucial role to advance scientific discovery and enable large-scale, privacy-aware collaborations across science domains.
Kibaek Kim, Raghavan Krishnan, Olivera Kotevska, Matthieu Dorier, Ravi K. Madduri, Minseok Ryu, Todd S. Munson, Robert B. Ross, Thomas Flynn 0001, Ai Kagawa, Byung-Jun Yoon, Christian Engelmann, Farzad Yousefian
IEEE Big Data10
2023 Transferable Graph Neural Fingerprint Models for Quick Response to Future Bio-Threats
abstract
Fast screening of drug molecules based on the ligand binding affinity is an important step in the drug discovery pipeline. Graph neural fingerprint is a promising method for developing molecular docking surrogates with high throughput and great fidelity. In this study, we built a COVID-19 drug docking dataset of about 300,000 drug candidates on 23 coronavirus protein targets. With this dataset, we trained graph neural fin-gerprint docking models for high-throughput virtual COVID-19 drug screening. The graph neural fingerprint models yield high prediction accuracy on docking scores with the mean squared error lower than 0.21 kcal/mol for most of the docking targets, showing significant improvement over conventional circular fin-gerprint methods. To make the neural fingerprints transferable for unknown targets, we also propose a transferable graph neural fingerprint method trained on multiple targets. With comparable accuracy to target-specific graph neural fingerprint models, the training and data efficiency of the transferable model is several times higher. We highlight that the impact of this study extends beyond COVID-19 dataset, as our approach for fast virtual ligand screening can be easily adapted and integrated into a general machine learning-accelerated pipeline to battle future bio-threats.
Wei Chen 0043, Yihui Ren 0001, Ai Kagawa, Matthew R. Carbone, Samuel Yen-Chi Chen, Xiaohui Qu, Shinjae Yoo, Austin Clyde, Arvind Ramanathan, Rick L. Stevens, Huub J. J. Van Dam, Deyu Lu
ICMLA3
2017 Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement
abstract
We describe a learning procedure enhancing L1-penalized regression by adding dynamically generated rules describing multidimensional “box” sets. Our rule-adding procedure is based on the classical column generation method for high-dimensional linear programming. The pricing problem for our column generation procedure reduces to the NP-hard rectangular maximum agreement (RMA) problem of finding a box that best discriminates between two weighted datasets. We solve this problem exactly using a parallel branch-and-bound procedure. The resulting rule-enhanced regression procedure is computation-intensive, but has promising prediction performance.
Jonathan Eckstein, Noam Goldberg, Ai Kagawa
ICML3