3 research outputs found

    IRRGN: An Implicit Relational Reasoning Graph Network for Multi-turn Response Selection

    Full text link
    The task of response selection in multi-turn dialogue is to find the best option from all candidates. In order to improve the reasoning ability of the model, previous studies pay more attention to using explicit algorithms to model the dependencies between utterances, which are deterministic, limited and inflexible. In addition, few studies consider differences between the options before and after reasoning. In this paper, we propose an Implicit Relational Reasoning Graph Network to address these issues, which consists of the Utterance Relational Reasoner (URR) and the Option Dual Comparator (ODC). URR aims to implicitly extract dependencies between utterances, as well as utterances and options, and make reasoning with relational graph convolutional networks. ODC focuses on perceiving the difference between the options through dual comparison, which can eliminate the interference of the noise options. Experimental results on two multi-turn dialogue reasoning benchmark datasets MuTual and MuTual+ show that our method significantly improves the baseline of four pretrained language models and achieves state-of-the-art performance. The model surpasses human performance for the first time on the MuTual dataset.Comment: Accepted by EMNLP 202

    Network-Constrained Unit Commitment Based on Reserve Models Fully Considering the Stochastic Characteristics of Wind Power

    No full text
    The existing optimization approaches regarding network-constrained unit commitment with large wind power integration face great difficulties in reconciling the two crucial but contradictory objectives: computational efficiency and the economy of the solutions. This paper proposes a new network-constrained unit commitment approach, which aims to better achieve these two objectives, by introducing newly proposed reserve models and simplified network constraints. This approach constructs the reserve models based on a sufficiently large number of stochastic wind power scenarios to fully and accurately capture the stochastic characteristics of wind power. These reserve models are directly incorporated into the traditional unit commitment formulation to simultaneously optimize the on/off decision variables and system reserve levels, therefore, this approach can comprehensively evaluate the costs and benefits of the scheduled reserves and thus produce very economical schedule. Meanwhile, these reserve models bring in very little computational burden because they simply consist of a small number of continuous variables and linear constraints. Besides, this approach can evaluate the impact of network congestion on the schedule by just introducing a small number of network constraints that are closely related to network congestion, i.e., the simplified network constraints, and thus concurrently ensures its high computational efficiency. Numerical results show that the proposed approach can produce more economical schedule than stochastic approach and deterministic approach but has similar computational efficiency as the deterministic approach
    corecore