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.

Haijie Xu

dblp:340/5054 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Probabilistic and Bayesian machine learning · 48% Reinforcement learning · 32% Optimization for machine learning · 16%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning › model-based optimization
bayesian optimization
1.012026
Function-on-Function Bayesian Optimization · AAAI 2026
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
1.012026
Function-on-Function Bayesian Optimization · AAAI 2026
Machine learning › Reinforcement learning
multi-armed bandit
1.012026
Adaptive Change Detection in Partially Observable Dynamic Networks · IEEE Trans. Knowl. Data Eng. 2026
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process › kernel design
operator-valued kernel
1.012026
Function-on-Function Bayesian Optimization · AAAI 2026
Machine learning › Reinforcement learning
thompson sampling
1.012026
Adaptive Change Detection in Partially Observable Dynamic Networks · IEEE Trans. Knowl. Data Eng. 2026
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference › variational inference
variational bayesian inference
1.012026
Adaptive Change Detection in Partially Observable Dynamic Networks · IEEE Trans. Knowl. Data Eng. 2026
Data mining › time series analysis
change point detection
1.012026
Adaptive Change Detection in Partially Observable Dynamic Networks · IEEE Trans. Knowl. Data Eng. 2026
Machine learning › Graph learning › dynamic graph learning
dynamic graph modeling
0.312026
Adaptive Change Detection in Partially Observable Dynamic Networks · IEEE Trans. Knowl. Data Eng. 2026

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

variational bayesian inference · 2.0thompson sampling · 2.0likelihood ratio test · 2.0combinatorial multi-armed bandit · 2.0upper confidence bound · 1.0functional gradient ascent · 1.0
YearPublicationVenuePosition
2026 Function-on-Function Bayesian Optimization
abstract
Bayesian optimization (BO) has been widely used to optimize expensive and gradient-free objective functions across various domains. However, existing BO methods have not addressed the objective where both inputs and outputs are functions, which increasingly arise in complex systems as advanced sensing technologies. To fill this gap, we propose a novel function-on-function Bayesian optimization (FFBO) framework. Specifically, we first introduce a function-on-function Gaussian process (FFGP) model with a separable operator-valued kernel to capture the correlations between function-valued inputs and outputs. Compared to existing Gaussian process models, FFGP is modeled directly in the function space. Based on FFGP, we define a scalar upper confidence bound (UCB) acquisition function using a weighted operator-based scalarization strategy. Then, a scalable functional gradient ascent algorithm (FGA) is developed to efficiently identify the optimal function-valued input. We further analyze the theoretical properties of the proposed method. Extensive experiments on synthetic and real-world data demonstrate the superior performance of FFBO over existing approaches.
Haijie Xu, Manrui Jiang
AAAI2
2026 Adaptive Change Detection in Partially Observable Dynamic Networks
abstract
Sequential change detection in high-dimensional dynamic networks has attracted growing attention in modern applications. A major challenge is that as network scale increases, limited sensing resources make it difficult to fully observe links at each time point, resulting in partial observability and complicating detection. To tackle this, we propose a Latent Bi-Transit Network (LBTN) that learns unobserved edge formation, latent node states, and the evolution mechanisms of dynamic networks. Based on LBTN, we design a variational Bayesian method to infer sparse node-level changes and employ a likelihood ratio test as the detection statistic. By further formulating the statistic as the reward function of a combinatorial multi-armed bandit (CMAB) problem, we develop a Thompson sampling strategy to adaptively select edges for observation, balancing exploration and exploitation. Comprehensive simulations and real-world experiments show that our method consistently outperforms existing baselines and its variants across diverse scenarios.
Haijie Xu, Chen Zhang 0007
IEEE Trans. Knowl. Data Eng.2
2025 SPEVS-CC: Separated parameter estimation with variable selection based on canonical correlation analysis for multivariate functional regression
abstract
The rapid advancement of real-time data monitoring technologies has established functional data analysis as a crucial predictive tool across diverse applications. Despite progress in multivariate functional regression and principal component analysis, significant challenges persist in function-to-function regression and feature selection. These include the inaccurate selection of predictor variables from extensive predictors and flawed parameter estimation, which compromise the precision of function-based data predictions. This paper introduces the SPEVS-CC method, a novel canonical correlation-based feature selection technique specifically designed for function-on-function regression. By effectively decoupling variable selection from model fitting, the SPEVS-CC method enhances both adaptability and interpretability. Validated through rigorous experiments and real-world applications, including in the Shenzhen subway system, semiconductor manufacturing, and ocean climate, SPEVS-CC significantly reduces mean squared error, confirming its robustness and practical utility. This methodological breakthrough harmonizes variable selection with functional regression, providing unmatched interpretability and usability in industrial applications.
Xing Yang 0003, Haijie Xu, Yiming Shi, Chen Zhang 0007
Adv. Eng. Informatics2