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.

Xuening Zhu

dblp:207/0527 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
8since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 3 · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 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
1 paper
Representation and self-supervised learning · 33% Trustworthy machine learning · 33% Generative modeling · 33%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 77% Rendering · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › interpretability › mechanistic interpretability
sparse autoencoder
0.912025
Sparse Autoencoders, Again? · ICML 2025
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
sparse coding
0.912025
Sparse Autoencoders, Again? · ICML 2025
Machine learning › Generative modeling
variational autoencoder
0.912025
Sparse Autoencoders, Again? · ICML 2025
Geometric modeling and processing › curve reconstruction
3d curve reconstruction
0.912025
Curve-Aware Gaussian Splatting for 3D Parametric Curve Reconstruction · ICCV 2025
Rendering
gaussian splatting
0.312025
Curve-Aware Gaussian Splatting for 3D Parametric Curve Reconstruction · ICCV 2025

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

topology optimization · 0.9sparse regularization · 0.9manifold learning · 0.9differentiable rendering · 0.9
YearPublicationVenuePosition
2026 From dark flash images to relightable 3D scenes with photometric stereo priors
Xuening Zhu, Renjiao Yi, Xin Wen 0005, Xuesong Xu, Hailiang Hou, Kai Xu 0004, Chenyang Zhu 0002
Frontiers Comput. Sci.1
2026 A generalizable neural representation framework for arbitrary-scale volumetric CT super-resolution
Xin Wen 0005, Renjiao Yi, Xuening Zhu, Chenyang Zhu 0002, Kai Xu 0004, Kunlun He
Neurocomputing4
2025 Curve-Aware Gaussian Splatting for 3D Parametric Curve Reconstruction
abstract
This paper presents an end-to-end framework for reconstructing 3D parametric curves directly from multi-view edge maps. Contrasting with existing two-stage methods that follow a sequential ``edge point cloud reconstruction and parametric curve fitting'' pipeline, our one-stage approach optimizes 3D parametric curves directly from 2D edge maps, eliminating error accumulation caused by the inherent optimization gap between disconnected stages. However, parametric curves inherently lack suitability for rendering-based multi-view optimization, necessitating a complementary representation that preserves their geometric properties while enabling differentiable rendering. We propose a novel bi-directional coupling mechanism between parametric curves and edge-oriented Gaussian components. This tight correspondence formulates a curve-aware Gaussian representation, \textbf{CurveGaussian}, that enables differentiable rendering of 3D curves, allowing direct optimization guided by multi-view evidence. Furthermore, we introduce a dynamically adaptive topology optimization framework during training to refine curve structures through linearization, merging, splitting, and pruning operations. Comprehensive evaluations on the ABC dataset and real-world benchmarks demonstrate our one-stage method's superiority over two-stage alternatives, particularly in producing cleaner and more robust reconstructions. Additionally, by directly optimizing parametric curves, our method significantly reduces the parameter count during training, achieving both higher efficiency and superior performance compared to existing approaches.
Zhirui Gao, Renjiao Yi, Yaqiao Dai, Xuening Zhu, Wei Chen 0009, Chenyang Zhu 0002, Kai Xu 0004
ICCV4
2025 Sparse Autoencoders, Again?
abstract
Is there really much more to say about sparse autoencoders (SAEs)? Autoencoders in general, and SAEs in particular, represent deep architectures that are capable of modeling low-dimensional latent structure in data. Such structure could reflect, among other things, correlation patterns in large language model activations, or complex natural image manifolds. And yet despite the wide-ranging applicability, there have been relatively few changes to SAEs beyond the original recipe from decades ago, namely, standard deep encoder/decoder layers trained with a classical/deterministic sparse regularizer applied within the latent space. One possible exception is the variational autoencoder (VAE), which adopts a stochastic encoder module capable of producing sparse representations when applied to manifold data. In this work we formalize underappreciated weaknesses with both canonical SAEs, as well as analogous VAEs applied to similar tasks, and propose a hybrid alternative model that circumvents these prior limitations. In terms of theoretical support, we prove that global minima of our proposed model recover certain forms of structured data spread across a union of manifolds. Meanwhile, empirical evaluations on synthetic and real-world datasets substantiate the efficacy of our approach in accurately estimating underlying manifold dimensions and producing sparser latent representations without compromising reconstruction error. In general, we are able to exceed the performance of equivalent-capacity SAEs and VAEs, as well as recent diffusion models where applicable, within domains such as images and language model activation patterns.
Yin Lu, Xuening Zhu, Tong He 0002, David P. Wipf
ICML2
2025 High Resolution Image Classification with Rich Text Information Based on Graph Convolution Neural Network
Siyi Han, Jing Zhou 0005, Xuening Zhu, Jie Li 0002, Hansheng Wang 0002, Yibing Gong
PAKDD (7)3
2025 CAD-NeRF: learning NeRFs from uncalibrated few-view images by CAD model retrieval
Xin Wen 0005, Xuening Zhu, Renjiao Yi, Chenyang Zhu 0002, Kai Xu 0004
Frontiers Comput. Sci.2
2025 Relighting Scenes With Object Insertions in Neural Radiance Fields
abstract
Inserting objects into scenes and performing realistic relighting are common applications in augmented reality (AR). Previous methods focused on inserting virtual objects using CAD models or real objects from single-view images, resulting in highly limited AR application scenarios. We introduce a novel pipeline based on Neural Radiance Fields (NeRFs) for seamlessly integrating objects into scenes, from two sets of images depicting the object and scene. This approach enables novel view synthesis, realistic relighting, and supports physical interactions such as shadow casting between objects. The lighting environment is in a hybrid representation of Spherical Harmonics and Spherical Gaussians, representing both high- and low-frequency lighting components very well, and supporting non-Lambertian surfaces. Specifically, we leverage the benefits of volume rendering and introduce an innovative approach for efficient shadow rendering by comparing the depth maps between the camera view and the light source view and generating vivid soft shadows. The proposed method achieves realistic relighting effects in extensive experimental evaluations.
Xuening Zhu, Renjiao Yi, Xin Wen 0005, Chenyang Zhu 0002, Kai Xu 0004
IEEE Trans. Circuits Syst. Video Technol.1
2023 A Sequential Addressing Subsampling Method for Massive Data Analysis Under Memory Constraint
abstract
The emergence of massive data in recent years brings challenges to automatic statistical inference. This is particularly true if the data are too numerous to be read into memory as a whole. Accordingly, new sampling techniques are needed to sample data from a hard drive. In this paper, we propose a sequential addressing subsampling (SAS) method that can sample data directly from the hard drive. The newly proposed SAS method is time saving in terms of addressing cost compared to that of the random addressing subsampling (RAS) method. Estimators (e.g., the sample mean) based on the SAS subsamples are constructed, and their properties are studied. We conduct a series of simulation studies to verify the finite sample performance of the proposed SAS estimators. The time cost is also compared between the SAS and RAS methods. An analysis of the airline data is presented for illustration purpose.
Rui Pan 0004, Yingqiu Zhu, Baishan Guo, Xuening Zhu, Hansheng Wang 0002
IEEE Trans. Knowl. Data Eng.4