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

Kyogo Kawaguchi

dblp:346/7582 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0000-0001-9395-9875ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Artificial intelligence and machine learning · 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Artificial intelligence
1 paper
Language models and text generation · 50% Deep learning architectures and training · 50%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › large language model
emergent abilities
0.912025
A Percolation Model of Emergence: Analyzing Transformers Trained on a Formal Language · ICLR 2025
Machine learning › Deep learning architectures and training › training dynamics
transformer training dynamics
0.912025
A Percolation Model of Emergence: Analyzing Transformers Trained on a Formal Language · ICLR 2025
Graph algorithms and graph theory
percolation
0.912025
A Percolation Model of Emergence: Analyzing Transformers Trained on a Formal Language · ICLR 2025
Bioinformatics and computational biology › single-cell analysis
cell lineage analysis
0.712023
LapTrack: linear assignment particle tracking with tunable metrics · Bioinform. 2023
Bioinformatics and computational biology › bioimage informatics
cell tracking
0.712023
LapTrack: linear assignment particle tracking with tunable metrics · Bioinform. 2023
Bioinformatics and computational biology › bioimage informatics
particle tracking
0.712023
LapTrack: linear assignment particle tracking with tunable metrics · Bioinform. 2023

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

phase transition analysis · 1.7percolation model · 1.7linear assignment problem · 0.7cost function tuning · 0.7
YearPublicationVenuePosition
2025 A Percolation Model of Emergence: Analyzing Transformers Trained on a Formal Language
abstract
Increase in data, size, or compute can lead to sudden learning of specific capabilities by a neural network---a phenomenon often called "emergence". Beyond scientific understanding, establishing the causal factors underlying such emergent capabilities is crucial to enable risk regulation frameworks for AI. In this work, we seek inspiration from study of emergent properties in other fields and propose a phenomenological definition for the concept in the context of neural networks. Our definition implicates the acquisition of general regularities underlying the data-generating process as a cause of sudden performance growth for specific, narrower tasks. We empirically investigate this definition by proposing an experimental system grounded in a context-sensitive formal language, and find that Transformers trained to perform tasks on top of strings from this language indeed exhibit emergent capabilities. Specifically, we show that once the language's underlying grammar and context-sensitivity inducing regularities are learned by the model, performance on narrower tasks suddenly begins to improve. We then analogize our network's learning dynamics with the process of percolation on a bipartite graph, establishing a formal phase transition model that predicts the shift in the point of emergence observed in our experiments when intervening on the data regularities. Overall, our experimental and theoretical frameworks yield a step towards better defining, characterizing, and predicting emergence in neural networks.
Ekdeep Singh Lubana, Kyogo Kawaguchi, Robert P. Dick, Hidenori Tanaka
ICLR2
2023 LapTrack: linear assignment particle tracking with tunable metrics
abstract
MOTIVATION: Particle tracking is an important step of analysis in a variety of scientific fields and is particularly indispensable for the construction of cellular lineages from live images. Although various supervised machine learning methods have been developed for cell tracking, the diversity of the data still necessitates heuristic methods that require parameter estimations from small amounts of data. For this, solving tracking as a linear assignment problem (LAP) has been widely applied and demonstrated to be efficient. However, there has been no implementation that allows custom connection costs, parallel parameter tuning with ground truth annotations, and the functionality to preserve ground truth connections, limiting the application to datasets with partial annotations. RESULTS: We developed LapTrack, a LAP-based tracker which allows including arbitrary cost functions and inputs, parallel parameter tuning and ground-truth track preservation. Analysis of real and artificial datasets demonstrates the advantage of custom metric functions for tracking score improvement from distance-only cases. The tracker can be easily combined with other Python-based tools for particle detection, segmentation and visualization. AVAILABILITY AND IMPLEMENTATION: LapTrack is available as a Python package on PyPi, and the notebook examples are shared at https://github.com/yfukai/laptrack. The data and code for this publication are hosted at https://github.com/NoneqPhysLivingMatterLab/laptrack-optimisation. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Yohsuke T. Fukai, Kyogo Kawaguchi
Bioinform.2
2022 Probing the rules of cell coordination in live tissues by interpretable machine learning based on graph neural networks
abstract
Robustness in developing and homeostatic tissues is supported by various types of spatiotemporal cell-to-cell interactions. Although live imaging and cell tracking are powerful in providing direct evidence of cell coordination rules, extracting and comparing these rules across many tissues with potentially different length and timescales of coordination requires a versatile framework of analysis. Here we demonstrate that graph neural network (GNN) models are suited for this purpose, by showing how they can be applied to predict cell fate in tissues and utilized to infer the cell interactions governing the multicellular dynamics. Analyzing the live mammalian epidermis data, where spatiotemporal graphs constructed from cell tracks and cell contacts are given as inputs, GNN discovers distinct neighbor cell fate coordination rules that depend on the region of the body. This approach demonstrates how the GNN framework is powerful in inferring general cell interaction rules from live data without prior knowledge of the signaling involved.
Takaki Yamamoto, Katie Cockburn, Valentina Greco, Kyogo Kawaguchi
PLoS Comput. Biol.4