activity
20122026
most citedSelf-Supervised Information Bottleneck for Deep Multi-View Subspace Clustering

103 citations · 360 across the 124 of their papers we have counts for

collaborators
Showing 2021Show all

11 papers · 1 filter

cs.CV2021★ 50 cited

LegoDNN: Block-grained Scaling of Deep Neural Networks for Mobile Vision

Rui Han, Qinglong Zhang, Chi Harold Liu +3

Deep neural networks (DNNs) have become ubiquitous techniques in mobile and embedded systems for applications such as image/object recognition and classification. The trend of exec…

cs.LG2021★ 8 cited

Pareto Domain Adaptation

Fangrui Lv, Jian Liang, Kaixiong Gong +5

Domain adaptation (DA) attempts to transfer the knowledge from a labeled source domain to an unlabeled target domain that follows different distribution from the source. To achieve…

cs.LG2021★ 10 cited

Active Learning for Domain Adaptation: An Energy-Based Approach

Binhui Xie, Longhui Yuan, Shuang Li +3

Unsupervised domain adaptation has recently emerged as an effective paradigm for generalizing deep neural networks to new target domains. However, there is still enormous potential…

cs.LG2021★ 2 cited

Deep Unsupervised Active Learning on Learnable Graphs

Handong Ma, Changsheng Li, Xinchu Shi +2

Recently deep learning has been successfully applied to unsupervised active learning. However, current method attempts to learn a nonlinear transformation via an auto-encoder while…

cs.LG2021

Learning Deep Representation with Energy-Based Self-Expressiveness for Subspace Clustering

Yanming Li, Changsheng Li, Shiye Wang +2

Deep subspace clustering has attracted increasing attention in recent years. Almost all the existing works are required to load the whole training data into one batch for learning…

cs.LG2021

Causal Effect Estimation using Variational Information Bottleneck

Zhenyu Lu, Yurong Cheng, Mingjun Zhong +3

Causal inference is to estimate the causal effect in a causal relationship when intervention is applied. Precisely, in a causal model with binary interventions, i.e., control and t…

cs.DB2021

Efficient Top-k Ego-Betweenness Search

Qi Zhang, Rong-Hua Li, Minjia Pan +3

Betweenness centrality, measured by the number of times a vertex occurs on all shortest paths of a graph, has been recognized as a key indicator for the importance of a vertex in t…

cs.DB2021★ 1 cited

Fairness-aware Maximal Clique in Large Graphs: Concepts and Algorithms

Qi Zhang, Rong-Hua Li, Minjia Pan +3

Cohesive subgraph mining on attributed graphs is a fundamental problem in graph data analysis. Existing cohesive subgraph mining algorithms on attributed graphs do not consider the…

cs.CV2021★ 21 cited

Semantic Distribution-aware Contrastive Adaptation for Semantic Segmentation

Shuang Li, Binhui Xie, Bin Zang +4

Domain adaptive semantic segmentation refers to making predictions on a certain target domain with only annotations of a specific source domain. Current state-of-the-art works sugg…

cs.CV2021★ 69 cited

Generalized Domain Conditioned Adaptation Network

Shuang Li, Binhui Xie, Qiuxia Lin +3

Domain Adaptation (DA) attempts to transfer knowledge learned in the labeled source domain to the unlabeled but related target domain without requiring large amounts of target supe…

cs.DB2021★ 24 cited

Multi-attributed Community Search in Road-social Networks

Fangda Guo, Ye Yuan, Guoren Wang +2

Given a location-based social network, how to find the communities that are highly relevant to query users and have top overall scores in multiple attributes according to user pref…