2 citations · 7 across the 5 of their papers we have counts for
8 papers
Flattened Graph Convolutional Networks For Recommendation
Yue Xu, Hao Chen, Zengde Deng +2
Graph Convolutional Networks (GCNs) and their variants have achieved significant performances on various recommendation tasks. However, many existing GCN models tend to perform rec…
Online Primal-Dual Algorithms For Stochastic Resource Allocation Problems
Yuwei Chen, Zengde Deng, Zaiyi Chen +3
This paper studies the online stochastic resource allocation problem (RAP) with chance constraints and conditional expectation constraints. The online RAP is an integer linear prog…
Neighbor Enhanced Graph Convolutional Networks for Node Classification and Recommendation
Hao Chen, Zhong Huang, Yue Xu +4
The recently proposed Graph Convolutional Networks (GCNs) have achieved significantly superior performance on various graph-related tasks, such as node classification and recommend…
Non-Recursive Graph Convolutional Networks
Hao Chen, Zengde Deng, Yue Xu +1
Graph Convolutional Networks (GCNs) are powerful models for node representation learning tasks. However, the node representation in existing GCN models is usually generated by perf…
Single-Layer Graph Convolutional Networks For Recommendation
Yue Xu, Hao Chen, Zengde Deng +5
Graph Convolutional Networks (GCNs) and their variants have received significant attention and achieved start-of-the-art performances on various recommendation tasks. However, many…
Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods
Xiao Li, Shixiang Chen, Zengde Deng +3
We consider a class of nonsmooth optimization problems over the Stiefel manifold, in which the objective function is weakly convex in the ambient Euclidean space. Such problems are…