Searcharxiv⌕ Search

arXiv subjects

Xiaochuan Zhao

Publications and source records attributed to Xiaochuan Zhao.

16 recordsLinked to original sources
arXiv2017

Exact Diffusion for Distributed Optimization and Learning --- Part II: Convergence Analysis

Part I of this work [2] developed the exact diffusion algorithm to remove the bias that is characteristic of distributed solutions for deterministic optimization problems. The algorithm was shown to be applicable to a larger set of combination policies than earlier approaches in the literature. In particular, the combination matrices are not required to be doubly stochastic, which impose stringent conditions on the graph topology and communications protocol. In this Part II, we examine the convergence and stability properties of exact diffusion in some detail and establish its linear convergence rate. We also show that it has a wider stability range than the EXTRA consensus solution, meaning that it is stable for a wider range of step-sizes and can, therefore, attain faster convergence rates. Analytical examples and numerical simulations illustrate the theoretical findings.

math.OC↗
arXiv2017

Asynchronous adaptive networks

In a recent article [1] we surveyed advances related to adaptation, learning, and optimization over synchronous networks. Various distributed strategies were discussed that enable a collection of networked agents to interact locally in response to streaming data and to continually learn and adapt to track drifts in the data and models. Under reasonable technical conditions on the data, the adaptive networks were shown to be mean-square stable in the slow adaptation regime, and their mean-square-error performance and convergence rate were characterized in terms of the network topology and data statistical moments [2]. Classical results for single-agent adaptation and learning were recovered as special cases. Following the works [3]-[5], this chapter complements the exposition from [1] and extends the results to asynchronous networks. The operation of this class of networks can be subject to various sources of uncertainties that influence their dynamic behavior, including randomly changing topologies, random link failures, random data arrival times, and agents turning on and off randomly. In an asynchronous environment, agents may stop updating their solutions or may stop sending or receiving information in a random manner and without coordination with other agents. The presentation will reveal that the mean-square-error performance of asynchronous networks remains largely unaltered compared to synchronous networks. The results justify the remarkable resilience of cooperative networks in the face of random events.

math.OC↗
arXiv2017

Exact Diffusion for Distributed Optimization and Learning --- Part I: Algorithm Development

This work develops a distributed optimization strategy with guaranteed exact convergence for a broad class of left-stochastic combination policies. The resulting exact diffusion strategy is shown in Part II to have a wider stability range and superior convergence performance than the EXTRA strategy. The exact diffusion solution is applicable to non-symmetric left-stochastic combination matrices, while many earlier developments on exact consensus implementations are limited to doubly-stochastic matrices; these latter matrices impose stringent constraints on the network topology. The derivation of the exact diffusion strategy in this work relies on reformulating the aggregate optimization problem as a penalized problem and resorting to a diagonally-weighted incremental construction. Detailed stability and convergence analyses are pursued in Part II and are facilitated by examining the evolution of the error dynamics in a transformed domain. Numerical simulations illustrate the theoretical conclusions.

math.OC↗
arXiv2015

An Analysis of the Bias-Property of the Sample Auto-Correlation Matrices of Doubly Selective Fading Channels for OFDM Systems

This paper derives the analytic expression of the sample auto-correlation matrix from the least-squared channel estimation of doubly selective fading channels for OFDM systems. According to the expression, the sample auto-correlation matrix reveals the bias property which would cause the model mismatch and therefore deteriorate the performance of channel estimation. Numerical results demonstrate the bias property and corresponding analysis.

cs.IT↗
arXiv2014

Asynchronous Adaptation and Learning over Networks --- Part I: Modeling and Stability Analysis

In this work and the supporting Parts II [2] and III [3], we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We examine asynchronous networks that are subject to fairly general sources of uncertainties, such as changing topologies, random link failures, random data arrival times, and agents turning on and off randomly. Under this model, agents in the network may stop updating their solutions or may stop sending or receiving information in a random manner and without coordination with other agents. We establish in Part I conditions on the first and second-order moments of the relevant parameter distributions to ensure mean-square stable behavior. We derive in Part II expressions that reveal how the various parameters of the asynchronous behavior influence network performance. We compare in Part III the performance of asynchronous networks to the performance of both centralized solutions and synchronous networks. One notable conclusion is that the mean-square-error performance of asynchronous networks shows a degradation only of the order of $O(ν)$, where $ν$ is a small step-size parameter, while the convergence rate remains largely unaltered. The results provide a solid justification for the remarkable resilience of cooperative networks in the face of random failures at multiple levels: agents, links, data arrivals, and topology.

eess.SY↗
arXiv2014

Asynchronous Adaptation and Learning over Networks - Part II: Performance Analysis

In Part I \cite{Zhao13TSPasync1}, we introduced a fairly general model for asynchronous events over adaptive networks including random topologies, random link failures, random data arrival times, and agents turning on and off randomly. We performed a stability analysis and established the notable fact that the network is still able to converge in the mean-square-error sense to the desired solution. Once stable behavior is guaranteed, it becomes important to evaluate how fast the iterates converge and how close they get to the optimal solution. This is a demanding task due to the various asynchronous events and due to the fact that agents influence each other. In this Part II, we carry out a detailed analysis of the mean-square-error performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We derive analytical expressions for the mean-square convergence rate and the steady-state mean-square-deviation. The expressions reveal how the various parameters of the asynchronous behavior influence network performance. In the process, we establish the interesting conclusion that even under the influence of asynchronous events, all agents in the adaptive network can still reach an $O(ν^{1 + γ_o'})$ near-agreement with some $γ_o' > 0$ while approaching the desired solution within $O(ν)$ accuracy, where $ν$ is proportional to the small step-size parameter for adaptation.

eess.SY↗
arXiv2014

Asynchronous Adaptation and Learning over Networks - Part III: Comparison Analysis

In Part II [3] we carried out a detailed mean-square-error analysis of the performance of asynchronous adaptation and learning over networks under a fairly general model for asynchronous events including random topologies, random link failures, random data arrival times, and agents turning on and off randomly. In this Part III, we compare the performance of synchronous and asynchronous networks. We also compare the performance of decentralized adaptation against centralized stochastic-gradient (batch) solutions. Two interesting conclusions stand out. First, the results establish that the performance of adaptive networks is largely immune to the effect of asynchronous events: the mean and mean-square convergence rates and the asymptotic bias values are not degraded relative to synchronous or centralized implementations. Only the steady-state mean-square-deviation suffers a degradation in the order of $ν$, which represents the small step-size parameters used for adaptation. Second, the results show that the adaptive distributed network matches the performance of the centralized solution. These conclusions highlight another critical benefit of cooperation by networked agents: cooperation does not only enhance performance in comparison to stand-alone single-agent processing, but it also endows the network with remarkable resilience to various forms of random failure events and is able to deliver performance that is as powerful as batch solutions.

eess.SY↗
arXiv2014

Distributed Clustering and Learning Over Networks

Distributed processing over networks relies on in-network processing and cooperation among neighboring agents. Cooperation is beneficial when agents share a common objective. However, in many applications agents may belong to different clusters that pursue different objectives. Then, indiscriminate cooperation will lead to undesired results. In this work, we propose an adaptive clustering and learning scheme that allows agents to learn which neighbors they should cooperate with and which other neighbors they should ignore. In doing so, the resulting algorithm enables the agents to identify their clusters and to attain improved learning and estimation accuracy over networks. We carry out a detailed mean-square analysis and assess the error probabilities of Types I and II, i.e., false alarm and mis-detection, for the clustering mechanism. Among other results, we establish that these probabilities decay exponentially with the step-sizes so that the probability of correct clustering can be made arbitrarily close to one.

math.OC↗
arXiv2012

Performance Limits for Distributed Estimation Over LMS Adaptive Networks

In this work we analyze the mean-square performance of different strategies for distributed estimation over least-mean-squares (LMS) adaptive networks. The results highlight some useful properties for distributed adaptation in comparison to fusion-based centralized solutions. The analysis establishes that, by optimizing over the combination weights, diffusion strategies can deliver lower excess-mean-square-error than centralized solutions employing traditional block or incremental LMS strategies. We first study in some detail the situation involving combinations of two adaptive agents and then extend the results to generic N-node ad-hoc networks. In the later case, we establish that, for sufficiently small step-sizes, diffusion strategies can outperform centralized block or incremental LMS strategies by optimizing over left-stochastic combination weighting matrices. The results suggest more efficient ways for organizing and processing data at fusion centers, and present useful adaptive strategies that are able to enhance performance when implemented in a distributed manner.

cs.IT↗
arXiv2012

Diffusion Adaptation over Networks under Imperfect Information Exchange and Non-stationary Data

Adaptive networks rely on in-network and collaborative processing among distributed agents to deliver enhanced performance in estimation and inference tasks. Information is exchanged among the nodes, usually over noisy links. The combination weights that are used by the nodes to fuse information from their neighbors play a critical role in influencing the adaptation and tracking abilities of the network. This paper first investigates the mean-square performance of general adaptive diffusion algorithms in the presence of various sources of imperfect information exchanges, quantization errors, and model non-stationarities. Among other results, the analysis reveals that link noise over the regression data modifies the dynamics of the network evolution in a distinct way, and leads to biased estimates in steady-state. The analysis also reveals how the network mean-square performance is dependent on the combination weights. We use these observations to show how the combination weights can be optimized and adapted. Simulation results illustrate the theoretical findings and match well with theory.

math.OC↗
arXiv2008

Parametric Channel Estimation by Exploiting Hopping Pilots in Uplink OFDMA

This paper proposes a parametric channel estimation algorithm applicable to uplink of OFDMA systems with pseudo-random subchannelization. It exploits the hopping pilots to facilitate ESPRIT to estimate the delay subspace of the multipath fading channel, and utilizes the global pilot tones to interpolate on data subcarriers. Hence, it outperforms the traditional local channel interpolators considerably.

cs.IT↗
arXiv2008

Doppler Spread Estimation by Subspace Tracking for OFDM Systems

This paper proposes a novel maximum Doppler spread estimation algorithm for OFDM systems with the comb-type pilot pattern. By tracking the drifting delay subspace of the multipath channel, the time correlation function is measured at a high accuracy, which accordingly improves the estimation accuracy of the maximum Doppler spread considerably.

cs.IT↗
arXiv2008

On the Cramer-Rao Lower Bound for Frequency Correlation Matrices of Doubly Selective Fading Channels for OFDM Systems

The analytic expression of CRLB and the maximum likelihood estimator for the sample frequency correlation matrices in doubly selective fading channels for OFDM systems are reported in this paper. According to the analytical and numerical results, the amount of samples affects the average mean square error dominantly while the SNR and the Doppler spread do negligibly.

cs.IT↗
arXiv2008

On the Cramer-Rao Lower Bound for Spatial Correlation Matrices of Doubly Selective Fading Channels for MIMO OFDM Systems

The analytic expression of CRLB and the maximum likelihood estimator for spatial correlation matrices in time-varying multipath fading channels for MIMO OFDM systems are reported in this paper. The analytical and numerical results reveal that the amount of samples and the order of frequency selectivity have dominant impact on the CRLB. Moreover, the number of pilot tones, SNR as well as the normalized maximum Doppler spread together influence the effective order of frequency selectivity.

cs.IT↗
arXiv2008

Doppler Spread Estimation by Tracking the Delay-Subspace for OFDM Systems in Doubly Selective Fading Channels

A novel maximum Doppler spread estimation algorithm for OFDM systems with comb-type pilot pattern is presented in this paper. By tracking the drifting delay subspace of time-varying multipath channels, a Doppler dependent parameter can be accurately measured and further expanded and transformed into a non-linear high-order polynomial equation, from which the maximum Doppler spread is readily solved by resorting to the Newton's method. Its performance is demonstrated by simulations.

cs.IT↗