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

Hanxiao Sun

dblp:137/7772 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
4since 2021 · last 2025
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 4Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Human-computer interaction and ubiquitous computing · 2 · 2 since 2021Computer networks · 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.

Computer graphics and multimedia
2 papers
Rendering · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Artificial intelligence
2 papers
Efficient and distributed learning · 66% Deep learning architectures and training · 34%

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

TopicWeightPapersLastEvidence papers
Rendering › gaussian splatting
3d gaussian splatting
0.912025
SVG-IR: Spatially-Varying Gaussian Splatting for Inverse Rendering · CVPR 2025
Rendering
inverse rendering
0.912025
SVG-IR: Spatially-Varying Gaussian Splatting for Inverse Rendering · CVPR 2025
Rendering
novel view synthesis
0.912025
SVG-IR: Spatially-Varying Gaussian Splatting for Inverse Rendering · CVPR 2025
Rendering
relighting
0.912025
SVG-IR: Spatially-Varying Gaussian Splatting for Inverse Rendering · CVPR 2025
Rendering
appearance modeling
0.812024
Correlation-aware Encoder-Decoder with Adapters for SVBRDF Acquisition · SIGGRAPH Asia 2024
Rendering › appearance acquisition
material acquisition
0.812024
Correlation-aware Encoder-Decoder with Adapters for SVBRDF Acquisition · SIGGRAPH Asia 2024
Rendering › appearance acquisition › material acquisition
SVBRDF acquisition
0.812024
Correlation-aware Encoder-Decoder with Adapters for SVBRDF Acquisition · SIGGRAPH Asia 2024
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.412020
Privileged Features Distillation at Taobao Recommendations · KDD 2020
Recommender systems
click-through rate prediction
0.412020
Privileged Features Distillation at Taobao Recommendations · KDD 2020
Recommender systems
conversion rate prediction
0.412020
Privileged Features Distillation at Taobao Recommendations · KDD 2020
Machine learning › Deep learning architectures and training
encoder-decoder architecture
0.212024
Correlation-aware Encoder-Decoder with Adapters for SVBRDF Acquisition · SIGGRAPH Asia 2024
Recommender systems
e-commerce recommendation
0.112020
Privileged Features Distillation at Taobao Recommendations · KDD 2020

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

latent space optimization · 1.5correlation-aware encoder · 1.5adapter · 1.5BRDF parameter separation · 0.93d gaussian splatting · 0.9knowledge distillation · 0.9feature distillation · 0.9
YearPublicationVenuePosition
2025 SVG-IR: Spatially-Varying Gaussian Splatting for Inverse Rendering
abstract
Reconstructing 3D assets from images, known as inverse rendering (IR), remains a challenging task due to its ill-posed nature. 3D Gaussian Splatting (3DGS) has demonstrated impressive capabilities for novel view synthesis (NVS) tasks. Methods apply it to relighting by separating radiance into BRDF parameters and lighting, yet produce inferior relighting quality with artifacts and unnatural indirect illumination due to the limited capability of each Gaussian, which has constant material parameters and normal, alongside the absence of physical constraints for indirect lighting. In this paper, we present a novel framework called Spatially-vayring Gaussian Inverse Rendering (SVG-IR), aimed at enhancing both NVS and relighting quality. To this end, we propose a new representation—Spatially-varying Gaussian (SVG)—that allows per-Gaussian spatially varying parameters. This enhanced representation is complemented by a SVG splatting scheme akin to vertex/fragment shading in traditional graphics pipelines. Furthermore, we integrate a physically-based indirect lighting model, enabling more realistic relighting. The proposed SVG-IR framework significantly improves rendering quality, outperforming state-of-the-art NeRF-based methods by 2.5 dB in peak signal-to-noise ratio (PSNR) and surpassing existing Gaussian-based techniques by 3.5 dB in relighting tasks, all while maintaining a real-time rendering speed. The source code is available at https://github.com/learner-shx/SVG-IR.
Hanxiao Sun, Yupeng Gao, Jin Xie 0001, Jian Yang 0003, Beibei Wang 0002
CVPR1
2025 NOMA-based intelligent resource allocation and trajectory optimization for multi-UAVs assisted semantic communication networks
abstract
The limited spectrum resources have a particular impact on UAV-assisted semantic communication networks, which undoubtedly leads to poorer quality of service for users and inefficient communication. Therefore, a NOMA-based multi-UAVs assisted semantic cellular network framework is proposed in this paper, in which each UAV transmits semantic information to multiple users in the shared spectrum resource with different power using non-orthogonal multiple access transmission protocol, thereby achieving higher spectrum utilization. We optimize the quantity of semantic symbols, UAV trajectories, and power allocation concurrently to increase communication efficiency by maximizing the sum rate of semantic information transmission for all users. However, conventional convex optimization approaches have difficulty solving it due to the bi-directional mobility of UAVs and users. Therefore, an enhanced K-means algorithm is employed to create the relationship between UAVs and users periodically. Additionally, a deep reinforcement learning technique based on shared dueling double deep Q networks (SD3QN) is also presented to maximize the quantity of semantic symbols, 3D trajectories, and power allocation . Experimental results show that the proposed semantic cellular network achieves higher spectral efficiency . Meanwhile, the proposed algorithm can effectively reduce the training time and avoid the overestimation problem in Deep Q Networks (DQN). Furthermore, the suggested optimization strategy outperforms the benchmark schemes in terms of semantic sum rate.
Jingyan Wu, Xiangrui Gao, Hanxiao Sun
Ad Hoc Networks7
2024 Correlation-aware Encoder-Decoder with Adapters for SVBRDF Acquisition
abstract
Fig. 1.By modeling the correlation among input images with an encoder, together with an adapter-equipped decoder, our network achieves high-quality SVBRDF recovery on both isotropic and anisotropic (with roughness encoded in red and green channels) materials.Here we show re-rendered views for four materials under environment illumination.(Please use Adobe Acrobat and click the renderings to see the animation.)Capturing materials from the real world avoids laborious manual material authoring.However, recovering high-fidelity Spatially Varying Bidirectional Reflectance Distribution Function (SVBRDF) maps from a few captured images is challenging due to its ill-posed nature.Existing approaches have made extensive efforts to alleviate this ambiguity issue by leveraging generative models with latent space optimization or extracting features with variant encoder-decoders.Albeit the rendered images at input views can match input images, the problematic decomposition among maps leads to significant differences when rendered under novel views/lighting.We observe that for human eyes, besides individual images, the correlation (or the highlights variation) among input images also serves as an important hint to recognize * Contribute equally.
Hanxiao Sun, Lei Ma 0008, Jian Yang 0003, Beibei Wang 0002
SIGGRAPH Asia2
2021 Displacement Generating Module Based End-to-end Micro-expression Recognition Network
abstract
With the rapid development of deep learning, the research and application of micro-expression recognition are more and more extensive. In the existing solutions, the methods using the difference between onset frame and apex frame have high accuracy and low computational cost. But their extraction of dynamic features is not integrated with classification network, resulting in the lack of feedback from classification loss to the extracted dynamic features. In this paper, we propose a novel Displacement Generating Module (DGM) which uses convolution module to generate the displacement feature between onset frame and apex frame instead of traditional optical flow or dynamic image. The new DGM is integrated with the existing LEARNet to form an end-to-end micro-expression recognition network, where the classification loss can feed backward to the parameters of DGM to obtain better displacement features. We also present a random selection method of apex frame to increase the amount of training data, and present a normalization operation for the displacement features with different scales. Our new approach has been tested on SAMM, SMIC, CASME II datasets with LOSO evaluation method, and achieves 0.737 on UF1 and 0.726 on UAR, which is obviously higher than existing networks with optical flow and dynamic imaging techniques.
Zhijun Zhai, Hanxiao Sun, Jianhui Zhao 0001, Shuangjiang He, Huijuan Zhao
SMC2
2020 Privileged Features Distillation at Taobao Recommendations
abstract
Features play an important role in the prediction tasks of e-commerce recommendations. To guarantee the consistency of off-line training and on-line serving, we usually utilize the same features that are both available. However, the consistency in turn neglects some discriminative features. For example, when estimating the conversion rate (CVR), i.e., the probability that a user would purchase the item if she clicked it, features like dwell time on the item detailed page are informative. However, CVR prediction should be conducted for on-line ranking before the click happens. Thus we cannot get such post-event features during serving.
Junfeng Ge, Jinyang Gao, Xiaoyong Yang, Changhua Pei, Fei Sun 0001, Jian Wu 0032, Hanxiao Sun, Wenwu Ou
KDD9
2019 A pareto-efficient algorithm for multiple objective optimization in e-commerce recommendation
abstract
Recommendation with multiple objectives is an important but difficult problem, where the coherent difficulty lies in the possible conflicts between objectives. In this case, multi-objective optimization is expected to be Pareto efficient, where no single objective can be further improved without hurting the others. However existing approaches to Pareto efficient multi-objective recommendation still lack good theoretical guarantees.
Xiao Lin 0002, Changhua Pei, Fei Sun 0001, Xuanji Xiao, Hanxiao Sun, Yongfeng Zhang 0003, Wenwu Ou, Peng Jiang 0002
RecSys6
2019 Personalized re-ranking for recommendation
abstract
Ranking is a core task in recommender systems, which aims at providing an ordered list of items to users. Typically, a ranking function is learned from the labeled dataset to optimize the global performance, which produces a ranking score for each individual item. However, it may be sub-optimal because the scoring function applies to each item individually and does not explicitly consider the mutual influence between items, as well as the differences of users' preferences or intents. Therefore, we propose a personalized re-ranking model for recommender systems. The proposed re-ranking model can be easily deployed as a follow-up modular after any ranking algorithm, by directly using the existing ranking feature vectors. It directly optimizes the whole recommendation list by employing a transformer structure to efficiently encode the information of all items in the list. Specifically, the Transformer applies a self-attention mechanism that directly models the global relationships between any pair of items in the whole list. We confirm that the performance can be further improved by introducing pre-trained embedding to learn personalized encoding functions for different users. Experimental results on both offline benchmarks and real-world online e-commerce systems demonstrate the significant improvements of the proposed re-ranking model.
Changhua Pei, Yi Zhang 0001, Yongfeng Zhang 0003, Fei Sun 0001, Xiao Lin 0002, Hanxiao Sun, Jian Wu 0032, Peng Jiang 0002, Junfeng Ge, Wenwu Ou, Dan Pei
RecSys6
2018 Multi-Source Pointer Network for Product Title Summarization
abstract
In this paper, we study the product title summarization problem in E-commerce applications for display on mobile devices. Comparing with conventional sentence summarization, product title summarization has some extra and essential constraints. For example, factual errors or loss of the key information are intolerable for E-commerce applications. Therefore, we abstract two more constraints for product title summarization: (i) do not introduce irrelevant information; (ii) retain the key information (e.g., brand name and commodity name). To address these issues, we propose a novel multi-source pointer network by adding a new knowledge encoder for pointer network. The first constraint is handled by pointer mechanism. For the second constraint, we restore the key information by copying words from the knowledge encoder with the help of the soft gating mechanism. For evaluation, we build a large collection of real-world product titles along with human-written short titles. Experimental results demonstrate that our model significantly outperforms the other baselines. Finally, online deployment of our proposed model has yielded a significant business impact, as measured by the click-through rate.
Fei Sun 0001, Peng Jiang 0002, Hanxiao Sun, Changhua Pei, Wenwu Ou, Xiaobo Wang 0002
CIKM3