no code implementations • 15 Jan 2022 • YuAn Wang, Chunyuan Zhang, Tianzong Yu, Meng Ma
RLSNA2C uses the Kronecker-factored approximation, the RLS method and the natural policy gradient to learn the compatible parameter and the policy parameter.
no code implementations • 13 Jan 2022 • Tianzong Yu, Chunyuan Zhang, YuAn Wang, Meng Ma, Qi Song
Convolutional neural networks (CNNs) have succeeded in many practical applications.
no code implementations • 20 Oct 2021 • Alireza Sadeghi, Meng Ma, Bingcong Li, Georgios B. Giannakis
The data distribution is considered unknown, but lies within a Wasserstein ball centered around empirical data distribution.
2 code implementations • 1 Mar 2021 • Renbo Zhu, Meng Ma, Ping Wang
Entity alignment (EA) is the task to discover entities referring to the same real-world object from different knowledge graphs (KGs), which is the most crucial step in integrating multi-source KGs.
no code implementations • 31 Aug 2020 • Xukun Luo, Weijie Liu, Meng Ma, Ping Wang
In this paper, inspired by the tree-like relation structures in the medical text, we propose a novel scheme called Bidirectional Tree Tagging (BiTT) to form the medical relation triples into two two binary trees and convert the trees into a word-level tags sequence.
Ranked #1 on Relation Extraction on DuIE
no code implementations • 7 Jul 2020 • Alireza Sadeghi, Gang Wang, Meng Ma, Georgios B. Giannakis
This robust learning task entails an infinite-dimensional optimization problem, which is challenging.
2 code implementations • NeurIPS 2019 • Zhonghui You, Kun Yan, Jinmian Ye, Meng Ma, Ping Wang
When the scaling factor is set to zero, it is equivalent to removing the corresponding filter.
no code implementations • 5 Jun 2019 • Bingcong Li, Meng Ma, Georgios B. Giannakis
For convex problems, when adopting an $n$-dependent step size, the complexity of L2S is ${\cal O}(n+ \sqrt{n}/\epsilon)$; while for more frequently adopted $n$-independent step size, the complexity is ${\cal O}(n+ n/\epsilon)$.
no code implementations • 28 Nov 2017 • Vassilis N. Ioannidis, Meng Ma, Athanasios N. Nikolakopoulos, Georgios B. Giannakis, Daniel Romero
The study of networks has witnessed an explosive growth over the past decades with several ground-breaking methods introduced.
no code implementations • 23 May 2016 • Daniel Romero, Meng Ma, Georgios B. Giannakis
A number of SPoG notions such as bandlimitedness, graph filters, and the graph Fourier transform are naturally accommodated in the kernel framework.