Expander Graph and Communication-Efficient Decentralized Optimization

In this paper, we discuss how to design the graph topology to reduce the communication complexity of certain algorithms for decentralized optimization. Our goal is to minimize the total communication needed to achieve a prescribed accuracy. We discover that the so-called expander graphs are near-optimal choices. We propose three approaches to construct expander graphs for different numbers of nodes and node degrees. Our numerical results show that the performance of decentralized optimization is significantly better on expander graphs than other regular graphs.Comment: 2016 IEEE Asilomar Conference on Signals, Systems, and Computer

Monolayer Molybdenum Disulfide Nanoribbons with High Optical Anisotropy

Two-dimensional Molybdenum Disulfide (MoS2) has shown promising prospects for the next generation electronics and optoelectronics devices. The monolayer MoS2 can be patterned into quasi-one-dimensional anisotropic MoS2 nanoribbons (MNRs), in which theoretical calculations have predicted novel properties. However, little work has been carried out in the experimental exploration of MNRs with a width of less than 20 nm where the geometrical confinement can lead to interesting phenomenon. Here, we prepared MNRs with width between 5 nm to 15 nm by direct helium ion beam milling. High optical anisotropy of these MNRs is revealed by the systematic study of optical contrast and Raman spectroscopy. The Raman modes in MNRs show strong polarization dependence. Besides that the E' and A'1 peaks are broadened by the phonon-confinement effect, the modes corresponding to singularities of vibrational density of states are activated by edges. The peculiar polarization behavior of Raman modes can be explained by the anisotropy of light absorption in MNRs, which is evidenced by the polarized optical contrast. The study opens the possibility to explore quasione-dimensional materials with high optical anisotropy from isotropic 2D family of transition metal dichalcogenides

On the Linear Convergence of the ADMM in Decentralized Consensus Optimization

In decentralized consensus optimization, a connected network of agents collaboratively minimize the sum of their local objective functions over a common decision variable, where their information exchange is restricted between the neighbors. To this end, one can first obtain a problem reformulation and then apply the alternating direction method of multipliers (ADMM). The method applies iterative computation at the individual agents and information exchange between the neighbors. This approach has been observed to converge quickly and deemed powerful. This paper establishes its linear convergence rate for decentralized consensus optimization problem with strongly convex local objective functions. The theoretical convergence rate is explicitly given in terms of the network topology, the properties of local objective functions, and the algorithm parameter. This result is not only a performance guarantee but also a guideline toward accelerating the ADMM convergence.Comment: 11 figures, IEEE Transactions on Signal Processing, 201