activity
20052023
most citedGraph Neural Networks Exponentially Lose Expressive Power for Node Classification

185 citations · 945 across the 83 of their papers we have counts for

collaborators

85 papers

cs.LG2023★ 1 cited

Learning Green's Function Efficiently Using Low-Rank Approximations

Kishan Wimalawarne, Taiji Suzuki, Sophie Langer

Learning the Green's function using deep learning models enables to solve different classes of partial differential equations. A practical limitation of using deep learning for the…

cs.LG2023

Convergence of mean-field Langevin dynamics: Time and space discretization, stochastic gradient, and variance reduction

Taiji Suzuki, Denny Wu, Atsushi Nitanda

The mean-field Langevin dynamics (MFLD) is a nonlinear generalization of the Langevin dynamics that incorporates a distribution-dependent drift, and it naturally arises from the op…

cs.LG2023★ 1 cited

Quantifying the Optimization and Generalization Advantages of Graph Neural Networks Over Multilayer Perceptrons

Wei Huang, Yuan Cao, Haonan Wang +2

Graph neural networks (GNNs) have demonstrated remarkable capabilities in learning from graph-structured data, often outperforming traditional Multilayer Perceptrons (MLPs) in nume…

cs.LG2023★ 1 cited

Approximation and Estimation Ability of Transformers for Sequence-to-Sequence Functions with Infinite Dimensional Input

Shokichi Takakura, Taiji Suzuki

Despite the great success of Transformer networks in various applications such as natural language processing and computer vision, their theoretical aspects are not well understood…

stat.ML2023

Tight and fast generalization error bound of graph embedding in metric space

Atsushi Suzuki, Atsushi Nitanda, Taiji Suzuki +3

Recent studies have experimentally shown that we can achieve in non-Euclidean metric space effective and efficient graph embedding, which aims to obtain the vertices' representatio…

stat.ML2023

Primal and Dual Analysis of Entropic Fictitious Play for Finite-sum Problems

Atsushi Nitanda, Kazusato Oko, Denny Wu +2

The entropic fictitious play (EFP) is a recently proposed algorithm that minimizes the sum of a convex functional and entropy in the space of measures -- such an objective naturall…