A Uniform Approximation for the Coherent State Propagator using a Conjugate Application of the Bargmann Representation

We propose a conjugate application of the Bargmann representation of quantum mechanics. Applying the Maslov method to the semiclassical connection formula between the two representations, we derive a uniform semiclassical approximation for the coherent state propagator which is finite at phase space caustics.Comment: 4 pages, 1 figur

Fast gates for ion traps by splitting laser pulses

We present a fast phase gate scheme that is experimentally achievable and has an operation time more than two orders of magnitude faster than current experimental schemes for low numbers of pulses. The gate time improves with the number of pulses following an inverse power law. Unlike implemented schemes which excite precise motional sidebands, thus limiting the gate timescale, our scheme excites multiple motional states using discrete ultra-fast pulses.We use beam-splitters to divide pulses into smaller components to overcome limitations due to the finite laser pulse repetition rate. This provides gate times faster than proposed theoretical schemes when we optimize a practical setup

Mapping the dialog act annotations of the LEGO corpus into ISO 24617-2 communicative functions

ISO 24617-2, the ISO standard for dialog act annotation, sets the ground for more comparable research in the area. However, the amount of data annotated according to it is still reduced, which impairs the development of approaches for automatic recognition. In this paper, we describe a mapping of the original dialog act labels of the LEGO corpus, which have been neglected, into the communicative functions of the standard. Although this does not lead to a complete annotation according to the standard, the 347 dialogs provide a relevant amount of data that can be used in the development of automatic communicative function recognition approaches, which may lead to a wider adoption of the standard. Using the 17 English dialogs of the DialogBank as gold standard, our preliminary experiments have shown that including the mapped dialogs during the training phase leads to improved performance while recognizing communicative functions in the Task dimension.info:eu-repo/semantics/publishedVersio

Automatic recognition of the general-purpose communicative functions defined by the ISO 24617-2 standard for dialog act annotation

From the perspective of a dialog system, it is important to identify the intention behind the segments in a dialog, since it provides an important cue regarding the information that is present in the segments and how they should be interpreted. ISO 24617-2, the standard for dialog act annotation, defines a hierarchically organized set of general-purpose communicative functions which correspond to different intentions that are relevant in the context of a dialog. We explore the automatic recognition of these communicative functions in the DialogBank, which is a reference set of dialogs annotated according to this standard. To do so, we propose adaptations of existing approaches to flat dialog act recognition that allow them to deal with the hierarchical classification problem. More specifically, we propose the use of an end-to-end hierarchical network with cascading outputs and maximum a posteriori path estimation to predict the communicative function at each level of the hierarchy, preserve the dependencies between the functions in the path, and decide at which level to stop. Furthermore, since the amount of dialogs in the DialogBank is small, we rely on transfer learning processes to reduce overfitting and improve performance. The results of our experiments show that our approach outperforms both a flat one and hierarchical approaches based on multiple classifiers and that each of its components plays an important role towards the recognition of general-purpose communicative functions.info:eu-repo/semantics/publishedVersio

End-to-end multi-level dialog act recognition

The three-level dialog act annotation scheme of the DIHANA corpus poses a multi-level classification problem in which the bottom levels allow multiple or no labels for a single segment. We approach automatic dialog act recognition on the three levels using an end-to-end approach, in order to implicitly capture relations between them. Our deep neural network classifier uses a combination of word- and character-based segment representation approaches, together with a summary of the dialog history and information concerning speaker changes. We show that it is important to specialize the generic segment representation in order to capture the most relevant information for each level. On the other hand, the summary of the dialog history should combine information from the three levels to capture dependencies between them. Furthermore, the labels generated for each level help in the prediction of those of the lower levels. Overall, we achieve results which surpass those of our previous approach using the hierarchical combination of three independent per-level classifiers. Furthermore, the results even surpass the results achieved on the simplified version of the problem approached by previous studies, which neglected the multi-label nature of the bottom levels and only considered the label combinations present in the corpus.info:eu-repo/semantics/publishedVersio

A curiosity model for artificial agents

Curiosity is an inherent characteristic of the animal instinct, which stimulates the need to obtain further knowledge and leads to the exploration of the surrounding environment. In this document we present a computational curiosity model, which aims at simulating that kind of behavior on artificial agents. This model is influenced by the two main curiosity theories defended by psychologists – Curiosity Drive Theory and Optimal Arousal Model. By merging both theories, as well as aspects from other sources, we concluded that curiosity can be defined in terms of the agent’s personality, its level of arousal, and the interest of the object of curiosity. The interest factor is defined in terms of the importance of the object of curiosity to the agent’s goals, its novelty, and surprise. To assess the performance of the model in practice, we designed a scenario consisting of virtual agents exploring a tile-based world, where objects may exist. The performance of the model in this scenario was evaluated in incremental steps, each one introducing a new component to the model. Furthermore, in addition to empirical evaluation, the model was also subjected to evaluation by human observers. The results obtained from both sources show that our model is able to simulate curiosity on virtual agents and that each of the identified factors has its role in the simulation.info:eu-repo/semantics/acceptedVersio

Automatic recognition of the general-purpose communicative functions defined by the ISO 24617-2 standard for dialog act annotation (Extended abstract)

From the perspective of a dialog system, the identification of the intention behind the segments in a dialog is important, as it provides cues regarding the information present in the segments and how they should be interpreted. The ISO 24617-2 standard for dialog act annotation defines a hierarchically organized set of general-purpose communicative functions that correspond to different intentions that are relevant in the context of a dialog. In this paper, we explore the automatic recognition of these functions. To do so, we propose to adapt existing approaches to dialog act recognition, so that they can deal with the hierarchical classification problem. More specifically, we propose the use of an end-to-end hierarchical network with cascading outputs and maximum a posteriori path estimation to predict the communicative function at each level of the hierarchy, preserve the dependencies between the functions in the path, and decide at which level to stop. Additionally, we rely on transfer learning processes to address the data scarcity problem. Our experiments on the DialogBank show that this approach outperforms both flat and hierarchical approaches based on multiple classifiers and that each of its components plays an important role in the recognition of general-purpose communicative functionsinfo:eu-repo/semantics/publishedVersio

Mixed-source multi-document speech-to-text summarization

Speech-to-text summarization systems usually take as input the output of an automatic speech recognition (ASR) system that is affected by issues like speech recognition errors, disfluencies, or difficulties in the accurate identification of sentence boundaries. We propose the inclusion of related, solid background information to cope with the difficulties of summarizing spoken language and the use of multi-document summarization techniques in single document speech- to-text summarization. In this work, we explore the possibilities offered by pho- netic information to select the background information and conduct a perceptual evaluation to better assess the relevance of the inclusion of that information. Results show that summaries generated using this approach are considerably better than those produced by an up-to-date latent semantic analysis (LSA) summarization method and suggest that humans prefer summaries restricted to the information conveyed in the input source.info:eu-repo/semantics/publishedVersio

Semantic frame induction through the detection of communities of verbs and their arguments

Resources such as FrameNet, which provide sets of semantic frame definitions and annotated textual data that maps into the evoked frames, are important for several NLP tasks. However, they are expensive to build and, consequently, are unavailable for many languages and domains. Thus, approaches able to induce semantic frames in an unsupervised manner are highly valuable. In this paper we approach that task from a network perspective as a community detection problem that targets the identification of groups of verb instances that evoke the same semantic frame and verb arguments that play the same semantic role. To do so, we apply a graph-clustering algorithm to a graph with contextualized representations of verb instances or arguments as nodes connected by edges if the distance between them is below a threshold that defines the granularity of the induced frames. By applying this approach to the benchmark dataset defined in the context of SemEval 2019, we outperformed all of the previous approaches to the task, achieving the current state-of-the-art performance.info:eu-repo/semantics/publishedVersio