activity
20092021
most citedOn the Complexity of Envy-Free Cake Cutting

9 citations · 29 across the 5 of their papers we have counts for

collaborators

8 papers

cs.LG20216 cited

A Variational U-Net for Weather Forecasting

Pak Hay Kwok, Qi Qi

Not only can discovering patterns and insights from atmospheric data enable more accurate weather predictions, but it may also provide valuable information to help tackle climate c…

cs.LG20205 cited

Traffic4cast 2020 -- Graph Ensemble Net and the Importance of Feature And Loss Function Design for Traffic Prediction

Qi Qi, Pak Hay Kwok

This paper details our solution to Traffic4cast 2020. Similar to Traffic4cast 2019, Traffic4cast 2020 challenged its contestants to develop algorithms that can predict the future t…

cs.LG20204 cited

Variance-Reduced Off-Policy Memory-Efficient Policy Search

Daoming Lyu, Qi Qi, Mohammad Ghavamzadeh +3

Off-policy policy optimization is a challenging problem in reinforcement learning (RL). The algorithms designed for this problem often suffer from high variance in their estimators…

cs.GT20205 cited

Computations and Complexities of Tarski's Fixed Points and Supermodular Games

Chuangyin Dang, Qi Qi, Yinyu Ye

We consider two models of computation for Tarski's order preserving function f related to fixed points in a complete lattice: the oracle function model and the polynomial function…

cs.LG2019

A Simple and Effective Framework for Pairwise Deep Metric Learning

Qi Qi, Yan Yan, Xiaoyu Wang +1

Deep metric learning (DML) has received much attention in deep learning due to its wide applications in computer vision. Previous studies have focused on designing complicated loss…

cs.NI2019

Vehicular Edge Computing via Deep Reinforcement Learning

Qi Qi, Zhanyu Ma

The smart vehicles construct Vehicle of Internet which can execute various intelligent services. Although the computation capability of the vehicle is limited, multi-type of edge c…