◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Sheng Zhou

30 papers hereh-index 191.3k citations47 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author26

Across the 27 of 30 papers where every author was matched, so the position is known.

fields
  • cs.IR15
  • cs.LG8
  • cs.AI3
  • cs.CV3
  • cs.SI1
same name
  • Sheng Zhou — 93 papers, h 53
  • Sheng Zhou — 13 papers, h 7
  • Sheng Zhou — 11 papers, h 8
  • Sheng Zhou — 10 papers, h 4
  • Sheng Zhou — 10 papers, h 4
  • Sheng Zhou — 8 papers, h 5

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20192026
most citedUnbiased Knowledge Distillation for Recommendation

43 citations · 211 across the 27 of their papers we have counts for

collaborators
Showing 2023Show all

4 papers · 1 filter

cs.IR2023

CDR: Conservative Doubly Robust Learning for Debiased Recommendation

ZiJie Song, JiaWei Chen, Sheng Zhou +4

In recommendation systems (RS), user behavior data is observational rather than experimental, resulting in widespread bias in the data. Consequently, tackling bias has emerged as a…

cs.LG2023★ 11 cited

OpenGSL: A Comprehensive Benchmark for Graph Structure Learning

Zhiyao Zhou, Sheng Zhou, Bochao Mao +7

Graph Neural Networks (GNNs) have emerged as the de facto standard for representation learning on graphs, owing to their ability to effectively integrate graph topology and node at…

cs.IR2023★ 29 cited

Adap-τ: Adaptively Modulating Embedding Magnitude for Recommendation

Jiawei Chen, Junkang Wu, Jiancan Wu +3

Recent years have witnessed the great successes of embedding-based methods in recommender systems. Despite their decent performance, we argue one potential limitation of these meth…

cs.AI2023

Robust Sequence Networked Submodular Maximization

Qihao Shi, Bingyang Fu, Can Wang +4

In this paper, we study the \underline{R}obust \underline{o}ptimization for \underline{se}quence \underline{Net}worked \underline{s}ubmodular maximization (RoseNets) problem. We in…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.