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

Xuyang Hu

dblp:226/4690 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · unresolved

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

Artificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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
1 paper
Language models and text generation · 87% Reinforcement learning · 13%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › alignment
inference-time alignment
0.912025
Test-Time Preference Optimization: On-the-Fly Alignment via Iterative Textual Feedback · ICML 2025
Natural language and speech › Language models and text generation › alignment
preference alignment
0.912025
Test-Time Preference Optimization: On-the-Fly Alignment via Iterative Textual Feedback · ICML 2025
Knowledge graphs
link prediction
0.612022
A Semantic Network Encoder for Associated Fact Prediction · IEEE Trans. Knowl. Data Eng. 2022
Knowledge graphs
semantic network
0.612022
A Semantic Network Encoder for Associated Fact Prediction · IEEE Trans. Knowl. Data Eng. 2022
Machine learning › Reinforcement learning › reward learning
reward modeling
0.312025
Test-Time Preference Optimization: On-the-Fly Alignment via Iterative Textual Feedback · ICML 2025

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

textual critique · 0.9test-time scaling · 0.9iterative refinement · 0.9word self-organization · 0.6pre-training · 0.6network embedding · 0.6
YearPublicationVenuePosition
2025 Test-Time Preference Optimization: On-the-Fly Alignment via Iterative Textual Feedback
abstract
Large language models (LLMs) have presented impressive performance but often lack the flexibility to adapt to human preferences quickly without retraining. Inspired by the recent efforts on test-time scaling, we make the first attempt to propose Test-time Preference Optimization (TPO), a framework that aligns LLM outputs with human preferences during inference, eliminating the need to update model parameters. Instead of relying on purely numerical rewards, TPO translates reward signals into \emph{textual} critiques and uses them as textual rewards to iteratively refine its response. Evaluations on benchmarks covering instruction following, preference alignment, safety, and mathematics reveal that TPO progressively improves alignment with human preferences. Notably, after only a few TPO steps, the initially unaligned Llama-3.1-70B-SFT model can surpass the aligned counterpart, Llama-3.1-70B-Instruct. Furthermore, TPO scales efficiently with both the search width and depth of the inference process. Through case studies, we illustrate how TPO exploits the innate capacity of LLM to interpret and act upon reward signals. Our findings establish TPO as a practical, lightweight alternative for test-time preference optimization, achieving alignment on the fly.
Yafu Li, Xuyang Hu, Xiaoye Qu, Yu Cheng 0001
ICML2
2022 Person Re-Identification Method Based on the Construction of Graph Convolutional Network with Attribute Feature
abstract
To fully pay attention to identity-sensitive feature information and utilize the correlations of inter-attributes and attributes-body parts, this paper proposes a person re-identification (re-ID) method based on the construction of graph convolutional network (GCN) with crucial attribute feature and body parts. First, it establishes the multiscale context-aware network (MSCAN) using dilated convolution with different expansion ratios, which can learn multiscale context information and obtain diversified global features. Subsequently, the human parsing model is utilized to extract the body part features. According to the attribute importance degree, the paper constructs low-dimensional GCN integrating the vital attributes and body parts of person descriptions to obtain discriminative local features. Finally, based on attribute prediction, it reduces the range of the images to be matched with discriminating possible objects from query images, thereby simplifying retrieval process. The experimental results demonstrate that the novel designed method can effectively improve person re-ID performance and achieve competitive evaluation results on typical public testing datasets.
Xiuhua Hu, Yingyu Liang, Yan Hui, Xi Wu 0001, Xuyang Hu
Int. J. Pattern Recognit. Artif. Intell.6
2022 A Semantic Network Encoder for Associated Fact Prediction
abstract
Semantic network is a network of concepts connected by semantic relations. It contains two forms ofbinary semantic networkandmultiplex semantic network. The associated fact prediction is a link prediction task that aims to infer the implicitly connected facts by mining the high-level representation of the network. Previous methods for associated fact prediction put much emphasis on the topological feature of network but not utilize the information of semantic expression. This paper proposes aSemanticNetworkEncoder (SemNE), which learns a feature mapping function from the binary semantic networks and can be applied to the multiplex semantic networks in a pre-training manner. SemNE is a two-stage framework that contains an embedding encoder and a prediction decoder. It jointly models the semantic information and network topology to enrich the network representation. A word self-organization method based on the factual boundary is proposed to unify the topological feature and the semantic feature representations. Experimental results on binary semantic networks show that SemNE achieves the state-of-the-art results in associated fact prediction and experimental results on multiplex semantic networks show that SemNE is scalable and can effectively improve the performance of existing models.
Zhizheng Wang, Yuanyuan Sun 0002, Xuyang Hu, Jiafeng Zhao, Hongfei Lin
IEEE Trans. Knowl. Data Eng.3
2018 Structure-Aware 3D Shape Synthesis from Single-View Images
Xuyang Hu, Fan Zhu 0001, Li Liu 0004, Jin Xie 0001, Jun Tang 0007, Nian Wang 0002, Fumin Shen, Ling Shao 0001
BMVC1