Options
Prof. Dr.
Wrobel, Stefan
Now showing
1  8 of 8

PublicationAdiabatic Quantum Computing for MaxSum Diversification( 2020)The combinatorial problem of maxsum diversification asks for a maximally diverse subset of a given set of data. Here, we show that it can be expressed as an Ising energy minimization problem. Given this result, maxsum diversification can be solved on adiabatic quantum computers and we present proof of concept simulations which support this claim. This, in turn, suggests that quantum computing might play a role in data mining. We therefore discuss quantum computing in a tutorial like manner and elaborate on its current strengths and weaknesses for data analysis.

PublicationMaxSum Dispersion via Quantum Annealing( 2019)We devise an Ising model for the maxsum dispersion problem which occurs in contexts such as Web search or text summarization. Given this Ising model, maxsum dispersion can be solved on adiabatic quantum computers; in proof of concept simulations, we solve the corresponding SchrÃ¶dinger equations and observe our approach to work well.

PublicationA QUBO Formulation of the kMedoids Problem( 2019)We are concerned with kmedoids clustering and propose aquadratic unconstrained binary optimization (QUBO) formulation of the problem of identifying k medoids among n data points without having to cluster the data. Given our QUBO formulation of this NPhard problem, it should be possible to solve it on adiabatic quantum computers.

PublicationLeveraging Domain Knowledge for Reinforcement Learning using MMC ArchitecturesDespite the success of reinforcement learning methods in various simulated robotic applications, endtoend training suffers from extensive training times due to high sample complexity and does not scale well to realistic systems. In this work, we speed up reinforcement learning by incorporating domain knowledge into policy learning. We revisit an architecture based on the mean of multiple computations (MMC) principle known from computational biology and adapt it to solve a reacher task. We approximate the policy using a simple MMC network, experimentally compare this idea to endtoend deep learning architectures, and show that our approach reduces the number of interactions required to approximate a suitable policy by a factor of ten.

PublicationIsing models for binary clustering via adiabatic quantum computing( 2018)
;Brito, EduardoExisting adiabatic quantum computers are tailored towards minimizing the energies of Ising models. The quest for implementations of pattern recognition or machine learning algorithms on such devices can thus be seen as the quest for Ising model (re)formulations of their objective functions. In this paper, we present Ising models for the tasks of binary clustering of numerical and relational data and discuss how to set up corresponding quantum registers and Hamiltonian operators. In simulation experiments, we numerically solve the respective SchrÃ¶dinger equations and observe our approaches to yield convincing results. 
PublicationAdiabatic quantum computing for kernel k = 2 means clustering( 2018)Adiabatic quantum computers are tailored towards finding minimum energy states of Ising models. The quest for implementations of machine learning algorithms on such devices thus is the quest for Ising model (re)formulations of their underlying objective functions. In this paper, we discuss how to accomplish this for the problem of kernel binary clustering. We then discuss how our models can be solved on an adiabatic quantum computing device. Finally, in simulation experiments, we numerically solve the respective SchrÃ¶dinger equations and observe our approaches to yield convincing results.

PublicationPolicy learning using SPSA( 2018)We analyze the use of simultaneous perturbation stochastic approximation (SPSA), a stochastic optimization technique, for solving reinforcement learning problems. In particular, we consider settings of partial observability and leverage the shortterm memory capabilities of echo state networks (ESNs) to learn parameterized control policies. Using SPSA, we propose three different variants to adapt the weight matrices of an ESN to the task at hand. Experimental results on classic control problems with both discrete and continuous action spaces reveal that ESNs trained using SPSA approaches outperform conventional ESNs trained using temporal difference and policy gradient methods.

PublicationInformed machine learning through functional composition( 2018)Addressing general problems with applied machine learning, we sketch an approach towards informed learning. The general idea is to treat data driven learning not as a parameter estimation problem but as a problem of sequencing predefined operations. We show by means of an example that this allows for incorporating expert knowledge and leads to traceable or explainable decision making systems.