Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Liwei Hou

dblp:119/1878 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0003-3476-2452ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Efficient and distributed learning · 54% Reinforcement learning · 16% Robot manipulation · 16%
Databases, data mining, and information retrieval
2 papers
Recommender systems · 54% Machine learning and data management · 46%

Topics — the 11 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
data selection
1.012026
From Points to Coalitions: Hierarchical Contrastive Shapley Values for Prioritizing Data Samples · AAAI 2026
Machine learning › Efficient and distributed learning
federated learning
1.012026
Prototype-Aligned Federated Soft-Prompts for Continual Web Personalization · WWW 2026
Machine learning › Efficient and distributed learning › federated learning › federated fine-tuning
federated prompt tuning
1.012026
Prototype-Aligned Federated Soft-Prompts for Continual Web Personalization · WWW 2026
Recommender systems › sequential recommendation
continual recommendation
1.012026
Prototype-Aligned Federated Soft-Prompts for Continual Web Personalization · WWW 2026
Machine learning and data management
data valuation
1.012026
From Points to Coalitions: Hierarchical Contrastive Shapley Values for Prioritizing Data Samples · AAAI 2026
Recommender systems
sequential recommendation
1.012026
Prototype-Aligned Federated Soft-Prompts for Continual Web Personalization · WWW 2026
Machine learning and data management › data valuation
shapley value
1.012026
From Points to Coalitions: Hierarchical Contrastive Shapley Values for Prioritizing Data Samples · AAAI 2026
Robotics › Robot manipulation
diffusion policy
0.912025
Diffusion-Based Self-Supervised Imitation Learning from Imperfect Visual Servoing Demonstrations for Robotic Glass Installation · ICRA 2025
Machine learning › Reinforcement learning
imitation learning
0.912025
Diffusion-Based Self-Supervised Imitation Learning from Imperfect Visual Servoing Demonstrations for Robotic Glass Installation · ICRA 2025
Robotics › Motion planning and robot control › robot control › sensor-based control
visual servoing
0.912025
Diffusion-Based Self-Supervised Imitation Learning from Imperfect Visual Servoing Demonstrations for Robotic Glass Installation · ICRA 2025
Recommender systems
web personalization
0.312026
Prototype-Aligned Federated Soft-Prompts for Continual Web Personalization · WWW 2026

Methods — techniques the papers use, named apart from their topics

prototype alignment · 2.0monte carlo shapley estimation · 2.0hierarchical clustering · 2.0contrastive learning · 2.0self-supervised learning · 1.7denoising diffusion probabilistic model · 1.7soft prompts · 1.0soft prompt · 1.0
YearPublicationVenuePosition
2026 From Points to Coalitions: Hierarchical Contrastive Shapley Values for Prioritizing Data Samples
abstract
How should we quantify the value of each training example when datasets are large, heterogeneous, and geometrically structured? Classical Data-Shapley answers in principle, but its O(n!) complexity and point-wise perspective are ill-suited to modern scales. We propose Hierarchical Contrastive Data Valuation (HCDV), a three-stage framework that (i) learns a contrastive, geometry-preserving representation, (ii) organizes the data into a balanced coarse-to-fine hierarchy of clusters, and (iii) assigns Shapley-style pay-offs to coalitions via local Monte-Carlo games whose budgets are propagated downward. HCDV collapses the factorial burden to O(T∑ℓKℓ) = O(TKmax log n), rewards examples that sharpen decision boundaries, and regularizes outliers through curvature-based smoothness. We prove that HCDV approximately satisfies the four Shapley axioms with surplus loss O(η log n), enjoys sub-Gaussian coalition deviation Õ(1/√T), and incurs at most kε∞ regret for top-k selection. Experiments on four benchmarks — tabular, vision, streaming, and a 45 M-sample CTR task — plus the OpenDataVal suite show that HCDV lifts accuracy by up to +5 pp, slashes valuation time by up to 100×, and directly supports tasks such as augmentation filtering, low-latency streaming updates, and fair marketplace payouts.
Canran Xiao, Jiabao Dou, Zhiming Lin 0001, Zong Ke, Liwei Hou
AAAI5
2026 Prototype-Aligned Federated Soft-Prompts for Continual Web Personalization
Canran Xiao, Liwei Hou
WWW2
2025 Diffusion-Based Self-Supervised Imitation Learning from Imperfect Visual Servoing Demonstrations for Robotic Glass Installation
abstract
Heavy-duty glass installation is a high-risk, precision-critical task in modern construction, traditionally performed through labor-intensive and error-prone manual methods. This paper presents a novel robotic framework that leverages diffusion-based self-supervised imitation learning from imperfect visual servoing demonstrations to achieve safe and precise glass installation. Specifically, our approach employs noisy and suboptimal demonstration data obtained via visual servoing to train a Denoising Diffusion Probabilistic Model (DDPM). This model iteratively refines installation trajectories, transforming them into smooth, precise, and collisionfree movements. Extensive experiments demonstrate that our method significantly surpasses conventional visual servoing and standard imitation learning baselines in terms of success rate, precision, and installation efficiency, while markedly improving operational safety. Our results establish a new benchmark for automating complex, high-risk tasks in construction robotics.
Canran Xiao, Liwei Hou, Wenrui Chen
ICRA2
2018 Improving Pointer-Generator Network with Keywords Information for Chinese Abstractive Summarization
Xiaoping Jiang, Po Hu 0001, Liwei Hou
NLPCC (1)3
2017 Abstractive Document Summarization via Neural Model with Joint Attention
Liwei Hou, Po Hu 0001, Chao Bei
NLPCC1