SearcharxivSearch

arXiv subjects

Niklas Rach

Publications and source records attributed to Niklas Rach.

4 recordsLinked to original sources

ARCADE: An Augmented Reality Display Environment for Multimodal Interaction with Conversational Agents

Making the interaction with embodied conversational agents accessible in a ubiquitous and natural manner is not only a question of the underlying software but also brings challenges in terms of the technical system that is used to display them. To this end, we present our spatial augmented reality system ARCADE, which can be utilized like a conventional monitor for displaying virtual agents as well as additional content. With its optical-see-through display, ARCADE creates the illusion of the agent being in the room similarly to a human. The applicability of our system is demonstrated in two different dialogue scenarios, which are included in the video accompanying this paper at https://youtu.be/9nH4c4Q-ooE.

cs.HC

Natural Language Understanding for Argumentative Dialogue Systems in the Opinion Building Domain

This paper introduces a natural language understanding (NLU) framework for argumentative dialogue systems in the information-seeking and opinion building domain. The proposed framework consists of two sub-models, namely intent classifier and argument similarity. Intent classifier model stacks BiLSTM with attention mechanism on top of the pre-trained BERT model and fine-tune the model for recognizing the user intent, whereas the argument similarity model employs BERT+BiLSTM for identifying system arguments the user refers to in his or her natural language utterances. Our model is evaluated in an argumentative dialogue system that engages the user to inform him-/herself about a controversial topic by exploring pro and con arguments and build his/her opinion towards the topic. In order to evaluate the proposed approach, we collect user utterances for the interaction with the respective system labeling intent and referenced argument in an extensive online study. The data collection includes multiple topics and two different user types (native English speakers from the UK and non-native English speakers from China). Additionally, we evaluate the proposed intent classifier and argument similarity models separately on the publicly available Banking77 and STS benchmark datasets. The evaluation indicates a clear advantage of the utilized techniques over baseline approaches on several datasets, as well as the robustness of the proposed approach against new topics and different language proficiency as well as the cultural background of the user. Furthermore, results show that our intent classifier model outperforms DIET, DistillBERT, and BERT fine-tuned models in few-shot setups (i.e., with 10, 20, or 30 labeled examples per intent) and full data setup.

cs.CL

Optimal control of many-body non-equilibrium quantum thermodynamics

We demonstrate the effectiveness of quantum optimal control techniques in harnessing irreversibility generated by non-equilibrium processes, implemented in unitarily evolving quantum many-body systems. We address the dynamics of a finite-size quantum Ising model subjected to finite-time transformations, which unavoidably generate irreversibility. We show that work can be generated through such transformation by means of optimal controlled quenches, while quenching the degree of irreversibility to very low values, thus boosting the efficiency of the process and paving the way to a fully controllable non-equilibrium thermodynamics of quantum processes.

quant-ph

Dressing the chopped-random-basis optimization: a bandwidth-limited access to the trap-free landscape

In quantum optimal control theory the success of an optimization algorithm is highly influenced by how the figure of merit to be optimized behaves as a function of the control field, i.e. by the control landscape. Constraints on the control field introduce local minima in the landscape --false traps-- which might prevent an efficient solution of the optimal control problem. Rabitz et al. [Science 303, 1998 (2004)] showed that local minima occur only rarely for unconstrained optimization. Here, we extend this result to the case of bandwidth-limited control pulses showing that in this case one can eliminate the false traps arising from the constraint. Based on this theoretical understanding, we modify the Chopped Random Basis (CRAB) optimal control algorithm and show that this development exploits the advantages of both (unconstrained) gradient algorithms and of truncated basis methods, allowing to always follow the gradient of the unconstrained landscape by bandwidth-limited control functions. We study the effects of additional constraints and show that for reasonable constraints the convergence properties are still maintained. Finally, we numerically show that this approach saturates the theoretical bound on the minimal bandwidth of the control needed to optimally drive the system.

quant-ph