Xianyang Zhang

Xianyang Zhang

Auto-generated profile, based on publicly available information

Xianyang Zhang

College of Mechanical Engineering, Hunan University of Science and Technology, Xiangtan, 411201, PR China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
26 December 2022 in Ceramics International
Verified
Journal Article
Closed access
LWLinlin Wan
Linlin Wan
XZXianyang Zhang
Xianyang Zhang
Qiming ZhouQiming Zhou
Qiming Zhou
DWDongdong Wen
Dongdong Wen
XRXiaoru Ran
Xiaoru Ran


16 November 2022 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
XZXianyang Zhang
Xianyang Zhang
CHChen Hu
Chen Hu
BHBing He
Bing He
ZHZhiguo Han
Zhiguo Han
Learning a good initialization model from distributed data sources over multi-agent systems is highly promising, in which the tasks or data are distributed stored and not accessible to all agents. This paper focuses on the distributed meta-learning problem and proposes a distributed Reptile meta-learning algorithm. In the proposed algorithm, each agent approximates the global model through a bi-level optimization scheme, where the inner step employs a stochastic gradient descent on a specific task, and the outer step utilizes information from neighbors and a gradient-like updating. The suggested algorithm avoids calculating the Hessian-vector products during training, reducing the computational complexity and affording memory miniaturization. We further analyze the convergence properties of the proposed algorithm under the convexity assumption. Finally, we demonstrate the effectiveness of the proposed algorithm on regression and classification tasks. The results show that our algorithm approximates a centralized solution and outperforms the non-cooperative algorithm.

27 October 2026 in Neural Networks
Verified
Journal Article
Closed access
XZXianyang Zhang
Xianyang Zhang
WKWeijie Kang
Weijie Kang
YLYing Li
Ying Li
BHBing He
Bing He
HHHonglan Huang
Honglan Huang

15 June 2018 in arXiv
Verified
Preprint
Open access
PDF file
SCShubhadeep Chakraborty
Shubhadeep Chakraborty
XZXianyang Zhang
Xianyang Zhang
Many statistical applications require the quantification of joint dependence among more than two random vectors. In this work, we generalize the notion of distance covariance to quantify joint dependence among d >= 2 random vectors. We introduce the high order distance covariance to measure the so-called Lancaster interaction dependence. The joint distance covariance is then defined as a linear combination of pairwise distance covariances and their higher order counterparts which together completely characterize mutual independence. We further introduce some related concepts including the distance cumulant, distance characteristic function, and rank-based distance covariance. Empirical estimators are constructed based on certain Euclidean distances between sample elements. We study the large sample properties of the estimators and propose a bootstrap procedure to approximate their sampling distributions. The asymptotic validity of the bootstrap procedure is justified under both the null and alternative hypotheses. The new metrics are employed to perform model selection in causal inference, which is based on the joint independence testing of the residuals from the fitted structural equation models. The effectiveness of the method is illustrated via both simulated and real datasets.