Xiaoxiao Wang

Dr. Xiaoxiao Wang

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 June 2023 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
XWXiaoxiao Wang
Xiaoxiao Wang
FMFanyu Meng
Fanyu Meng
XLXin Liu
Xin Liu
Zhaodan KongZhaodan Kong
Zhaodan Kong
XCXin Chen
Xin Chen

1 December 2017
Verified
Conference Paper
Closed access
XGXueying Guo
Xueying Guo
GTGeorge Trimponias
George Trimponias
XWXiaoxiao Wang
Xiaoxiao Wang
ZCZhitang Chen
Zhitang Chen
YGYanhui Geng
Yanhui Geng
XLXin Liu
Xin Liu
Cellular network configuration is critical for network performance. Current practice is labor-intensive, error-prone, and far from optimal. To automate efficient cellular network configuration, in this work, we propose an online-learning-based joint-optimization approach that addresses a few specific challenges: limited data availability, convoluted sample data, highly complex optimization due to interactions among neighboring cells, and the need to adapt to network dynamics. In our approach, to learn an appropriate utility function for a cell, we develop a neural-network-based model that addresses the convoluted sample data issue and achieves good accuracy based on data aggregation. Based on the utility function learned, we formulate a global network configuration optimization problem. To solve this high-dimensional non-concave maximization problem, we design a Gibbs-sampling-based algorithm that converges to an optimal solution when a technical parameter is small enough. Furthermore, we design an online scheme that updates the learned utility function and solves the corresponding maximization problem efficiently to adapt to network dynamics. To illustrate the idea, we use the case study of pilot power configuration. Numerical results illustrate the effectiveness of the proposed approach.

13 June 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XGXueying Guo
Xueying Guo
GTGeorge Trimponias
George Trimponias
XWXiaoxiao Wang
Xiaoxiao Wang
ZCZhitang Chen
Zhitang Chen
YGYanhui Geng
Yanhui Geng
XLXin Liu
Xin Liu
Cellular network configuration is critical for network performance. Current practice is mostly based on field experience and manual adjustment. The process is labor-intensive, error-prone, and far from optimal. To automate and optimize cellular network configuration, in this paper, we propose an online-learning-based joint-optimization approach that addresses a few specific challenges: limited data availability, convoluted sample data, highly complex optimization due to interactions among neighboring cells, and the need to adapt to network dynamics. In our approach, to learn an appropriate utility function for a cell, we develop a neural-network-based model that addresses the convoluted sample data issue and achieves good accuracy based on data aggregation. Based on the utility function learned, we formulate a global network configuration optimization problem. To solve this high-dimensional nonconcave maximization problem, we design a Gibbs-sampling-based algorithm that converges to an optimal solution when a technical parameter is small enough. Furthermore, we design an online scheme that updates the learned utility function and solves the corresponding maximization problem efficiently to adapt to network dynamics. To illustrate the idea, we use the case study of pilot power configuration. Numerical results illustrate the effectiveness of the proposed approach.

7 July 2023 in Computation
Verified
Journal Article
Open access
PDF file
XWXiaoxiao Wang
Xiaoxiao Wang
MZMinda Zhao
Minda Zhao
FMFanyu Meng
Fanyu Meng
XLXin Liu
Xin Liu
Zhaodan KongZhaodan Kong
Zhaodan Kong
XCXin Chen
Xin Chen
Path-specific effect analysis is a powerful tool in causal inference. This paper provides a definition of causal counterfactual path-specific importance score for the structural causal model (SCM). Different from existing path-specific effect definitions, which focus on the population level, the score defined in this paper can quantify the impact of a decision variable on an outcome variable along a specific pathway at the individual level. Moreover, the score has many desirable properties, including following the chain rule and being consistent. Finally, this paper presents an algorithm that can leverage these properties and find the k-most important paths with the highest importance scores in a causal graph effectively.

28 May 2019 in arXiv
Verified
Preprint
Open access
PDF file
XWXiaoxiao Wang
Xiaoxiao Wang
XGXueying Guo
Xueying Guo
JCJie Chuai
Jie Chuai
ZCZhitang Chen
Zhitang Chen
XLXin Liu
Xin Liu
Cellular network configuration plays a critical role in network performance. In current practice, network configuration depends heavily on field experience of engineers and often remains static for a long period of time. This practice is far from optimal. To address this limitation, online-learning-based approaches have great potentials to automate and optimize network configuration. Learning-based approaches face the challenges of learning a highly complex function for each base station and balancing the fundamental exploration-exploitation tradeoff while minimizing the exploration cost. Fortunately, in cellular networks, base stations (BSs) often have similarities even though they are not identical. To leverage such similarities, we propose kernel-based multi-BS contextual bandit algorithm based on multi-task learning. In the algorithm, we leverage the similarity among different BSs defined by conditional kernel embedding. We present theoretical analysis of the proposed algorithm in terms of regret and multi-task-learning efficiency. We evaluate the effectiveness of our algorithm based on a simulator built by real traces.

3 May 2020 in arXiv
Verified
Preprint
Open access
PDF file
QHQintao Hu
Qintao Hu
LZLijun Zhou
Lijun Zhou
XWXiaoxiao Wang
Xiaoxiao Wang
YMYao Mao
Yao Mao
JZJianlin Zhang
Jianlin Zhang
QYQixiang Ye
Qixiang Ye
Modern visual trackers usually construct online learning models under the assumption that the feature response has a Gaussian distribution with target-centered peak response. Nevertheless, such an assumption is implausible when there is progressive interference from other targets and/or background noise, which produce sub-peaks on the tracking response map and cause model drift. In this paper, we propose a rectified online learning approach for sub-peak response suppression and peak response enforcement and target at handling progressive interference in a systematic way. Our approach, referred to as SPSTracker, applies simple-yet-efficient Peak Response Pooling (PRP) to aggregate and align discriminative features, as well as leveraging a Boundary Response Truncation (BRT) to reduce the variance of feature response. By fusing with multi-scale features, SPSTracker aggregates the response distribution of multiple sub-peaks to a single maximum peak, which enforces the discriminative capability of features for robust object tracking. Experiments on the OTB, NFS and VOT2018 benchmarks demonstrate that SPSTrack outperforms the state-of-the-art real-time trackers with significant margins.