Search Results for author: Dominik Wojtczak

Found 15 papers, 0 papers with code

Omega-Regular Decision Processes

no code implementations14 Dec 2023 Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, Dominik Wojtczak

Regular decision processes (RDPs) are a subclass of non-Markovian decision processes where the transition and reward functions are guarded by some regular property of the past (a lookback).

Omega-Regular Reward Machines

no code implementations14 Aug 2023 Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, Dominik Wojtczak

Reinforcement learning (RL) is a powerful approach for training agents to perform tasks, but designing an appropriate reward mechanism is critical to its success.

Reinforcement Learning (RL)

MC-NN: An End-to-End Multi-Channel Neural Network Approach for Predicting Influenza A Virus Hosts and Antigenic Types

no code implementations8 Jun 2023 Yanhua Xu, Dominik Wojtczak

In this study, we propose a multi-channel neural network model to predict the host and antigenic subtypes of influenza A viruses from hemagglutinin and neuraminidase protein sequences.

Dive into Machine Learning Algorithms for Influenza Virus Host Prediction with Hemagglutinin Sequences

no code implementations28 Jul 2022 Yanhua Xu, Dominik Wojtczak

Influenza viruses mutate rapidly and can pose a threat to public health, especially to those in vulnerable groups.

BIG-bench Machine Learning

Multi-channel neural networks for predicting influenza A virus hosts and antigenic types

no code implementations8 Jun 2022 Yanhua Xu, Dominik Wojtczak

In this work, we propose multi-channel neural networks to predict antigenic types and hosts of influenza A viruses with hemagglutinin and neuraminidase protein sequences.

Alternating Good-for-MDP Automata

no code implementations6 May 2022 Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, Dominik Wojtczak

The surprising answer is that we have to pay significantly less when we instead expand the good-for-MDP property to alternating automata: like the nondeterministic GFM automata obtained from deterministic Rabin automata, the alternating good-for-MDP automata we produce from deterministic Streett automata are bi-linear in the the size of the deterministic automaton and its index, and can therefore be exponentially more succinct than minimal nondeterministic B\"uchi automata.

Reinforcement Learning (RL) Translation

Predicting Influenza A Viral Host Using PSSM and Word Embeddings

no code implementations4 Jan 2022 Yanhua Xu, Dominik Wojtczak

The MCC obtained using the model with word embedding is around 96%, and the F1 is around 97%.

Position Word Embeddings

Model-free Reinforcement Learning for Branching Markov Decision Processes

no code implementations12 Jun 2021 Ernst Moritz Hahn, Mateo Perez, Sven Schewe, Fabio Somenzi, Ashutosh Trivedi, Dominik Wojtczak

We study reinforcement learning for the optimal control of Branching Markov Decision Processes (BMDPs), a natural extension of (multitype) Branching Markov Chains (BMCs).

reinforcement-learning Reinforcement Learning (RL)

Facility Reallocation on the Line

no code implementations23 Mar 2021 Bart de Keijzer, Dominik Wojtczak

We study this problem both in the offline setting and online setting.

Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP

no code implementations18 Jan 2021 Richard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak

We study stochastic games with energy-parity objectives, which combine quantitative rewards with a qualitative $\omega$-regular condition: The maximizer aims to avoid running out of energy while simultaneously satisfying a parity condition.

Computer Science and Game Theory Logic in Computer Science

Open Problems in a Logic of Gossips

no code implementations22 Jul 2019 Krzysztof R. Apt, Dominik Wojtczak

To establish these results we showed that both the definition of semantics and of truth of the underlying logic are decidable.

On Strong NP-Completeness of Rational Problems

no code implementations26 Feb 2018 Dominik Wojtczak

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were assumed to be integers.

Common Knowledge in a Logic of Gossips

no code implementations27 Jul 2017 Krzysztof R. Apt, Dominik Wojtczak

This implies that implementability, partial correctness and termination of distributed epistemic gossip protocols that use non-nested common knowledge operator is decidable, as well.

Cannot find the paper you are looking for? You can Submit a new open access paper.