192 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Fudan UniversityCN23 papers
- Shanghai Jiao Tong UniversityCN16 papers
- Peking UniversityCN14 papers
- Chinese University of Hong KongHK11 papers
- Tsinghua UniversityCN10 papers
- University of MinnesotaUS9 papers
- Nanyang Technological UniversitySG8 papers
- Hong Kong University of Science and TechnologyHK7 papers
- University of Hong KongHK7 papers
- University of WashingtonUS7 papers
- Stanford UniversityUS6 papers
- University of Minnesota SystemUS6 papers
16 papers · 1 filter
Multidimensional Service Quality Scoring System
Shiyang Lai
This supplementary paper aims to introduce the Multidimensional Service Quality Scoring System (MSQs), a review-based method for quantifying host service quality mentioned and empl…
A note on -permanent and loop soup
Xiaodan Li, Yushu Zheng
In this paper, it is shown that -permanent in algebra is closely related to loop soup in probability. We give explicit expansions of -permanents of the block matrices obtaine…
Increasing stability of the first order linearized inverse Schrödinger potential problem with integer power type nonlinearities
Sen Zou, Shuai Lu, Boxi Xu
We investigate the increasing stability of the inverse Schrödinger potential problem with integer power type nonlinearities at a large wavenumber. By considering the first order li…
A homogeneous second-order descent method for nonconvex optimization
Chuwen Zhang, Dongdong Ge, Chang He +4
In this paper, we introduce a Homogeneous Second-Order Descent Method (HSODM) using the homogenized quadratic approximation to the original function. The merit of homogenization is…
Lookahead Auctions with Pooling
Almog Wald, Michal Feldman, Nick Gravin +1
A Lookahead Auction (LA), introduced by Ronen, is an auction format for the sale of a single item among multiple buyers, which is considered simpler and more fair than the optimal…
Safety and Performance, Why not Both? Bi-Objective Optimized Model Compression toward AI Software Deployment
Jie Zhu, Leye Wang, Xiao Han
The size of deep learning models in artificial intelligence (AI) software is increasing rapidly, which hinders the large-scale deployment on resource-restricted devices (e.g., smar…
The Kawamata--Viehweg--Nadel-type vanishing theorem and the asymptotic multiplier ideal sheaf
Jingcao Wu
In this paper we establish a Nadel-type vanishing theorem and a Kawamata--Viehweg-type vanishing theorem concerning the asymptotic multiplier ideal sheaf on a compact Kähler manifo…
Understanding Diversity in Session-Based Recommendation
Qing Yin, Hui Fang, Zhu Sun +1
Current session-based recommender systems (SBRSs) mainly focus on maximizing recommendation accuracy, while few studies have been devoted to improve diversity beyond accuracy. Mean…
DaisyRec 2.0: Benchmarking Recommendation for Rigorous Evaluation
Zhu Sun, Hui Fang, Jie Yang +5
Recently, one critical issue looms large in the field of recommender systems -- there are no effective benchmarks for rigorous evaluation -- which consequently leads to unreproduci…
Rank the spreading influence of nodes using dynamic Markov process
Jian-Hong Lin, Zhao Yang, Jian-Guo Liu +2
Ranking the spreading influence of nodes is of great importance in practice and research. The key to ranking a node's spreading ability is to evaluate the fraction of susceptible n…
Inverting Ray-Knight identities on trees
Xiaodan Li, Yushu Zheng
In this paper, we first introduce the Ray-Knight identity and percolation Ray-Knight identity related to loop soup with intensity on trees. Then we present the inversion…
Information-based matching explains the diversity of cooperation among different populations
Xiaoming Gong
This paper introduces a bilateral matching mechanism to explain why different populations have different levels of cooperation. The traditional game theory assumes that individuals…
(Fractional) Online Stochastic Matching via Fine-Grained Offline Statistics
Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu
Motivated by display advertising on the internet, the online stochastic matching problem is proposed by Feldman, Mehta, Mirrokni, and Muthukrishnan (FOCS 2009). Consider a stochast…
Checking Continuous Stochastic Logic against Quantum Continuous-Time Markov Chains
Ming Xu, Jingyi Mei, Ji Guan +2
Verifying quantum systems has attracted a lot of interest in the last decades.In this paper, we study the quantitative model-checking of quantum continuous-time Markov chains (quan…
Variance-Reduced Stochastic Quasi-Newton Methods for Decentralized Learning: Part I
Jiaojiao Zhang, Huikang Liu, Anthony Man-Cho So +1
In this work, we investigate stochastic quasi-Newton methods for minimizing a finite sum of cost functions over a decentralized network. In Part I, we develop a general algorithmic…
Real-time Rail Recognition Based on 3D Point Clouds
Xinyi Yu, Weiqi He, Xuecheng Qian +2
Accurate rail location is a crucial part in the railway support driving system for safety monitoring. LiDAR can obtain point clouds that carry 3D information for the railway enviro…