Chenliang Zhou

dblp:266/2890 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
6since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 6 · 3 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 4 first-author · 4 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 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
5 papers
Generative modeling · 34% Language models and text generation · 34% Deep learning architectures and training · 15%
Computer graphics and multimedia
2 papers
Rendering · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Generative modeling
diffusion model
1.822026
M3ashy: Multi-Modal Material Synthesis via Hyperdiffusion · AAAI 2026
FrePolad: Frequency-Rectified Point Latent Diffusion for Point Cloud Generation · ECCV (67) 2024
Rendering
material appearance
1.012026
M3ashy: Multi-Modal Material Synthesis via Hyperdiffusion · AAAI 2026
Natural language and speech › Language models and text generation › large language model
large language model deployment
0.912025
Analyzing and Modeling LLM Response Lengths with Extreme Value Theory: Anchoring Effects and Hybrid Distributions · EMNLP 2025
Natural language and speech › Language models and text generation › text generation
large language model generation
0.912025
Analyzing and Modeling LLM Response Lengths with Extreme Value Theory: Anchoring Effects and Hybrid Distributions · EMNLP 2025
Machine learning › Deep learning architectures and training
hypernetwork
0.812024
Hypernetworks for Generalizable BRDF Representation · ECCV (76) 2024
Computer vision › 3D vision › 3d generation
point cloud generation
0.812024
FrePolad: Frequency-Rectified Point Latent Diffusion for Point Cloud Generation · ECCV (67) 2024
Rendering › bidirectional reflectance distribution function
BRDF representation
0.812024
Hypernetworks for Generalizable BRDF Representation · ECCV (76) 2024
Rendering › appearance modeling
reflectance representation
0.812024
Hypernetworks for Generalizable BRDF Representation · ECCV (76) 2024
Computing education
AI education
0.412020
AISpace2: An Interactive Visualization Tool for Learning and Teaching Artificial Intelligence · AAAI 2020

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

neural field · 2.0multi-modal conditional generation · 2.0hypernetwork · 1.5generalized pareto distribution · 0.9generalized extreme value distribution · 0.9extreme value theory · 0.9python · 0.9jupyterlab · 0.9latent diffusion · 0.8frequency rectification · 0.8
YearPublicationVenuePosition
2026 M3ashy: Multi-Modal Material Synthesis via Hyperdiffusion
abstract
High-quality material synthesis is essential for replicating complex surface properties to create realistic scenes. Despite advances in the generation of material appearance based on analytic models, the synthesis of real-world measured BRDFs remains largely unexplored. To address this challenge, we propose M^3ashy, a novel multi-modal material synthesis framework based on hyperdiffusion. M^3ashy enables high-quality reconstruction of complex real-world materials by leveraging neural fields as a compact continuous representation of BRDFs. Furthermore, our multi-modal conditional hyperdiffusion model allows for flexible material synthesis conditioned on material type, natural language descriptions, or reference images, providing greater user control over material generation. To support future research, we contribute two new material datasets and introduce two BRDF distributional metrics for more rigorous evaluation. We demonstrate the effectiveness of M^3ashy through extensive experiments, including a novel statistics-based constrained synthesis, which enables the generation of materials of desired categories.
Chenliang Zhou, Zheyuan Hu 0006, Alejandro Sztrajman, Yancheng Cai, A. Cengiz Öztireli
AAAI1
2025 Analyzing and Modeling LLM Response Lengths with Extreme Value Theory: Anchoring Effects and Hybrid Distributions
abstract
Accurate modeling and control of response length is essential for optimizing large language model (LLM) deployment, impacting computational efficiency, user experience, and system reliability.We develop a statistical framework based on extreme value theory, analyzing 14,301 GPT-4o responses across temperature settings and prompting strategies, with cross-validation on Qwen and DeepSeek architectures.Our analysis reveals that response lengths follow Weibull-type generalized extreme value (GEV) distributions, exhibiting heavier tails under stochastic generation conditions.The key contributions include:(1) a novel GEV-generalized Pareto (GPD) hybrid model that achieves superior tail fit (R 2 CDF = 0.9993 vs standalone GEV's 0.998) while preserving architectural generalizability;(2) quantitative characterization of prompt anchoring effects, showing reduced dispersion but increased outlier propensity under randomization; and (3) identification of temperaturedependent response patterns that remain consistent across architectures, where higher temperatures amplify length variability while maintaining the underlying extreme-value mechanisms.The proposed hybrid model's adaptive threshold selection enables precise verbosity control in production systems, regardless of the specific LLM architecture employed.These findings provide both theoretical insights into LLM generation patterns and practical tools for response length optimization.
Liuxuan Jiao, Chen Gao 0001, Yiqian Yang, Chenliang Zhou, YiXian Huang, Xinlei Chen, Yong Li 0008
EMNLP4
2024 XQSV: A Structurally Variable Network to Imitate Human Play in Xiangqi
abstract
In this paper, we introduce an innovative deep learning architecture, termed Xiangqi Structurally Variable (XQSV), designed to emulate the behavioral patterns of human players in Xiangqi, or Chinese Chess. The unique attribute of XQSV is its capacity to alter its structural configuration dynamically, optimizing performance for the task based on the particular subset of data on which it is trained. We have incorporated several design improvements to significantly enhance the network’s predictive accuracy, including a local illegal move filter, an Elo range partitioning, a sequential one-dimensional input, and a simulation of imperfect memory capacity. Empirical evaluations reveal that XQSV attains a predictive accuracy of approximately 40%, with its performance peaking within the trained Elo range. This indicates the model’s success in mimicking the play behavior of individuals within that specific range. A three-terminal Turing Test was employed to demonstrate that the XQSV model imitates human behavior more accurately than conventional Xiangqi engines, rendering it indistinguishable from actual human opponents. Given the inherent nondeterminism in human gameplay, we propose two supplementary relaxed evaluation metrics. To our knowledge, XQSV represents the first model to mimic Xiangqi players.
Chenliang Zhou
CoG1
2024 Hypernetworks for Generalizable BRDF Representation
Fazilet Gokbudak, Alejandro Sztrajman, Chenliang Zhou, Fangcheng Zhong, Rafal Mantiuk, A. Cengiz Öztireli
ECCV (76)3
2024 FrePolad: Frequency-Rectified Point Latent Diffusion for Point Cloud Generation
Chenliang Zhou, Fangcheng Zhong, Param Hanji, Zhilin Guo 0001, Kyle Fogarty, Alejandro Sztrajman, Hongyun Gao 0001, A. Cengiz Öztireli
ECCV (67)1
2023 Information Compression via Eliding Verb Phrase: A Dependency-Based Study
Zheyuan Dai, Chenliang Zhou, Haitao Liu 0001
PACLIC2
2020 AISpace2: An Interactive Visualization Tool for Learning and Teaching Artificial Intelligence
abstract
AIspace is a set of tools used to learn and teach fundamental AI algorithms. The original version of AIspace was written in Java. There was not a clean separation of the algorithms and visualization; it was too complicated for students to modify the underlying algorithms. Its next generation, AIspace2, is built on AIPython, open source Python code that is designed to be as close as possible to pseudocode. AISpace2, visualized in JupyterLab, keeps the simple Python code, and uses hooks in AIPython to allow visualization of the algorithms. This allows students to see and modify the high-level algorithms in Python, and to visualize the output in a graphical form, aiming to better help them to build confidence and comfort in AI concepts and algorithms. So far we have tools for search, constraint satisfaction problems (CSP), planning and Bayesian network. In this paper we outline the tools and give some evaluations based on user feedback.
Chenliang Zhou, Dominic Kuang, Jingru Liu, Hanbo Yang, Zijia Zhang 0003, Alan K. Mackworth, David Poole 0001
AAAI1