Incorporating Structured Commonsense Knowledge in Story Completion

The ability to select an appropriate story ending is the first step towards perfect narrative comprehension. Story ending prediction requires not only the explicit clues within the context, but also the implicit knowledge (such as commonsense) to construct a reasonable and consistent story. However, most previous approaches do not explicitly use background commonsense knowledge. We present a neural story ending selection model that integrates three types of information: narrative sequence, sentiment evolution and commonsense knowledge. Experiments show that our model outperforms state-of-the-art approaches on a public dataset, ROCStory Cloze Task , and the performance gain from adding the additional commonsense knowledge is significant

Diffusion Adaptation Strategies for Distributed Optimization and Learning over Networks

We propose an adaptive diffusion mechanism to optimize a global cost function in a distributed manner over a network of nodes. The cost function is assumed to consist of a collection of individual components. Diffusion adaptation allows the nodes to cooperate and diffuse information in real-time; it also helps alleviate the effects of stochastic gradient noise and measurement noise through a continuous learning process. We analyze the mean-square-error performance of the algorithm in some detail, including its transient and steady-state behavior. We also apply the diffusion algorithm to two problems: distributed estimation with sparse parameters and distributed localization. Compared to well-studied incremental methods, diffusion methods do not require the use of a cyclic path over the nodes and are robust to node and link failure. Diffusion methods also endow networks with adaptation abilities that enable the individual nodes to continue learning even when the cost function changes with time. Examples involving such dynamic cost functions with moving targets are common in the context of biological networks.Comment: 34 pages, 6 figures, to appear in IEEE Transactions on Signal Processing, 201

Nonequilibrium Energy Transfer at Nanoscale: A Unified Theory from Weak to Strong Coupling

We investigate the microscopic mechanism of quantum energy transfer in the nonequilibrium spin-boson model. By developing a nonequilibrium polaron-transformed Redfield equation based on fluctuation decoupling, we dissect the energy transfer into multi-boson associated processes with even or odd parity. Based on this, we analytically evaluate the energy flux, which smoothly bridges the transfer dynamics from the weak spin-boson coupling regime to the strong-coupling one. Our analysis explains previous limiting predictions and provides a unified interpretation of several observations, including coherence-enhanced heat flux and absence of negative differential thermal conductance in the nonequilibrium spin-boson model. The results may find wide applications for the energy and information control in nanodevices.Comment: 11 pages, 4 figure

Cramer-Rao Bounds for Joint RSS/DoA-Based Primary-User Localization in Cognitive Radio Networks

Knowledge about the location of licensed primary-users (PU) could enable several key features in cognitive radio (CR) networks including improved spatio-temporal sensing, intelligent location-aware routing, as well as aiding spectrum policy enforcement. In this paper we consider the achievable accuracy of PU localization algorithms that jointly utilize received-signal-strength (RSS) and direction-of-arrival (DoA) measurements by evaluating the Cramer-Rao Bound (CRB). Previous works evaluate the CRB for RSS-only and DoA-only localization algorithms separately and assume DoA estimation error variance is a fixed constant or rather independent of RSS. We derive the CRB for joint RSS/DoA-based PU localization algorithms based on the mathematical model of DoA estimation error variance as a function of RSS, for a given CR placement. The bound is compared with practical localization algorithms and the impact of several key parameters, such as number of nodes, number of antennas and samples, channel shadowing variance and correlation distance, on the achievable accuracy are thoroughly analyzed and discussed. We also derive the closed-form asymptotic CRB for uniform random CR placement, and perform theoretical and numerical studies on the required number of CRs such that the asymptotic CRB tightly approximates the numerical integration of the CRB for a given placement.Comment: 20 pages, 11 figures, 1 table, submitted to IEEE Transactions on Wireless Communication

On the Learning Behavior of Adaptive Networks - Part I: Transient Analysis

This work carries out a detailed transient analysis of the learning behavior of multi-agent networks, and reveals interesting results about the learning abilities of distributed strategies. Among other results, the analysis reveals how combination policies influence the learning process of networked agents, and how these policies can steer the convergence point towards any of many possible Pareto optimal solutions. The results also establish that the learning process of an adaptive network undergoes three (rather than two) well-defined stages of evolution with distinctive convergence rates during the first two stages, while attaining a finite mean-square-error (MSE) level in the last stage. The analysis reveals what aspects of the network topology influence performance directly and suggests design procedures that can optimize performance by adjusting the relevant topology parameters. Interestingly, it is further shown that, in the adaptation regime, each agent in a sparsely connected network is able to achieve the same performance level as that of a centralized stochastic-gradient strategy even for left-stochastic combination strategies. These results lead to a deeper understanding and useful insights on the convergence behavior of coupled distributed learners. The results also lead to effective design mechanisms to help diffuse information more thoroughly over networks.Comment: to appear in IEEE Transactions on Information Theory, 201

Effects of system-bath entanglement on the performance of light-harvesting systems: A quantum heat engine perspective

We explore energy transfer in a generic three-level system, which is coupled to three non-equilibrium baths. Built on the concept of quantum heat engine, our three-level model describes non-equilibrium quantum processes including light-harvesting energy transfer, nano-scale heat transfer, photo-induced isomerization, and photovoltaics in double quantum-dots. In the context of light-harvesting, the excitation energy is first pumped up by sunlight, then is transferred via two excited states which are coupled to a phonon bath, and finally decays to the ground state. The efficiency of this process is evaluated by steady state analysis via a polaron-transformed master equation; thus a wide range of the system-phonon coupling strength can be covered. We show that the coupling with the phonon bath not only modifies the steady state, resulting in population inversion, but also introduces a finite steady state coherence which optimizes the energy transfer flux and efficiency. In the strong coupling limit, the steady state coherence disappears and the efficiency approaches the heat engine limit given by Scovil and Schultz-Dubois in Phys. Rew. Lett. 2, 262 (1959).Comment: 10 pages, 8 figures, all comments are welcom