Verena Wolf 0001

dblp:04/6065 · DBLP profile ↗
← Back
22ranked-venue papers
0as first author
5since 2021 · last 2025
0000-0001-8460-6007ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 12 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 7 · 1 since 2021Software engineering, systems software and programming languages · 5 · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021
YearPublicationVenuePosition
2025 Per-Domain Generalizing Policies: On Validation Instances and Scaling Behavior
abstract
Recent work has shown that successful per-domain generalizing action policies can be learned. Scaling behavior, from small training instances to large test instances, is the key objective; and the use of validation instances larger than training instances is one key to achieve it. Prior work has used fixed validation sets. Here, we introduce a method generating the validation set dynamically, on the fly, increasing instance size so long as informative and feasible. We also introduce refined methodology for evaluating scaling behavior, generating test instances systematically to guarantee a given confidence in coverage performance for each instance size. In experiments, dynamic validation improves scaling behavior of GNN policies in all 9 domains used.
Timo P. Gros, Nicola J. Müller, Daniel Fiser, Isabel Valera, Verena Wolf 0001, Jörg Hoffmann 0001
ICAPS5
2024 Motion Primitives as the Action Space of Deep Q-Learning for Planning in Autonomous Driving
abstract
Motion planning for autonomous vehicles is commonly implemented via graph-search methods, which pose limitations to the model accuracy and environmental complexity that can be handled under real-time constraints. In contrast, reinforcement learning, specifically the deep Q-learning (DQL) algorithm, provides an interesting alternative for real-time solutions. Some approaches, such as the deep Q-network (DQN), model the RL-action space by quantizing the continuous control inputs. Here, we propose to use motion primitives, which encode continuous-time nonlinear system behavior as the action space. The novel methodology of motion primitives-DQL planning is evaluated in a numerical example using a single-track vehicle model and different planning scenarios. We show that our approach outperforms a state-of-the-art graph-search method in computation time and probability of reaching the goal.
Tristan Schneider, Matheus V. A. Pedrosa, Timo P. Gros, Verena Wolf 0001, Kathrin Flaßkamp
IEEE Trans. Intell. Transp. Syst.4
2022 MoGym: Using Formal Models for Training and Verifying Decision-making Agents
abstract
Abstract M o G ym , is an integrated toolbox enabling the training and verification of machine-learned decision-making agents based on formal models, for the purpose of sound use in the real world. Given a formal representation of a decision-making problem in the JANI format and a reach-avoid objective, M o G ym (a) enables training a decision-making agent with respect to that objective directly on the model using reinforcement learning (RL) techniques, and (b) it supports rigorous assessment of the quality of the induced decision-making agent by means of deep statistical model checking (DSMC). M o G ym implements the standard interface for training environments established by OpenAI Gym, thereby connecting to the vast body of existing work in the RL community. In return, it makes accessible the large set of existing JANI model checking benchmarks to machine learning research. It thereby contributes an efficient feedback mechanism for improving in particular reinforcement learning algorithms. The connective part is implemented on top of Momba. For the DSMC quality assurance of the learned decision-making agents, a variant of the statistical model checker modes of the M odest T oolset is leveraged, which has been extended by two new resolution strategies for non-determinism when encountered during statistical evaluation.
Timo P. Gros, Holger Hermanns, Jörg Hoffmann 0001, Michaela Klauck, Maximilian A. Köhl, Verena Wolf 0001
CAV (2)6
2021 Epidemic overdispersion strengthens the effectiveness of mobility restrictions
abstract
Human mobility is the fuel of global pandemics. In this simulation study, we analyze how mobility restrictions mitigate epidemic processes and how this mitigation is influenced by the epidemic's degree of dispersion.
Gerrit Grossmann, Michael Backenköhler, Verena Wolf 0001
HSCC3
2021 Analysis of Markov Jump Processes under Terminal Constraints
abstract
Abstract Many probabilistic inference problems such as stochastic filtering or the computation of rare event probabilities require model analysis under initial and terminal constraints. We propose a solution to thisbridging problemfor the widely used class of population-structured Markov jump processes. The method is based on a state-space lumping scheme that aggregates states in a grid structure. The resulting approximate bridging distribution is used to iteratively refine relevant and truncate irrelevant parts of the state-space. This way, the algorithm learns a well-justified finite-state projection yielding guaranteed lower bounds for the system behavior under endpoint constraints. We demonstrate the method’s applicability to a wide range of problems such as Bayesian inference and the analysis of rare events.
Michael Backenköhler, Luca Bortolussi, Gerrit Grossmann, Verena Wolf 0001
TACAS (1)4
2019 Hidden Markov Modelling Reveals Neighborhood Dependence of Dnmt3a and 3b Activity
abstract
DNA methylation is an epigenetic mark whose important role in development has been widely recognized. This epigenetic modification results in heritable information not encoded by the DNA sequence. The underlying mechanisms controlling DNA methylation are only partly understood. Several mechanistic models of enzyme activities responsible for DNA methylation have been proposed. Here, we extend existing Hidden Markov Models (HMMs) for DNA methylation by describing the occurrence of spatial methylation patterns over time and propose several models with different neighborhood dependences. Furthermore, we investigate correlations between the neighborhood dependence and other genomic information. We perform numerical analysis of the HMMs applied to comprehensive hairpin and non-hairpin bisulfite sequencing measurements and accurately predict wild-type data. We find evidence that the activities of Dnmt3a and Dnmt3b responsible for de novo methylation depend on 5' (left) but not on 3' (right) neighboring CpGs in a sequencing string.
Alexander Lück, Pascal Giehr, Karl Nordström, Jörn Walter, Verena Wolf 0001
IEEE ACM Trans. Comput. Biol. Bioinform.5
2018 Data-Driven Approach Towards a Personalized Curriculum
Michael Backenköhler, Felix Scherzinger, Adish Singla, Verena Wolf 0001
EDM4
2018 Moment-Based Parameter Estimation for Stochastic Reaction Networks in Equilibrium
abstract
Calibrating parameters is a crucial problem within quantitative modeling approaches to reaction networks. Existing methods for stochastic models rely either on statistical sampling or can only be applied to small systems. Here, we present an inference procedure for stochastic models in equilibrium that is based on a moment matching scheme with optimal weighting and that can be used with high-throughput data like the one collected by flow cytometry. Our method does not require an approximation of the underlying equilibrium probability distribution and, if reaction rate constants have to be learned, the optimal values can be computed by solving a linear system of equations. We discuss important practical issues such as the selection of the moments and evaluate the effectiveness of the proposed approach on three case studies.
Michael Backenköhler, Luca Bortolussi, Verena Wolf 0001
IEEE ACM Trans. Comput. Biol. Bioinform.3
2018 Simulating the Large-Scale Erosion of Genomic Privacy Over Time
abstract
The dramatically decreasing costs of DNA sequencing have triggered more than a million humans to have their genotypes sequenced. Moreover, these individuals increasingly make their genomic data publicly available, thereby creating privacy threats for themselves and their relatives because of their DNA similarities. More generally, an entity that gains access to a significant fraction of sequenced genotypes might be able to infer even the genomes of unsequenced individuals. In this paper, we propose a simulation-based model for quantifying the impact of continuously sequencing and publicizing personal genomic data on a population's genomic privacy. Our simulation probabilistically models data sharing and takes into account events such as migration and interracial mating. We exemplarily instantiate our simulation with a sample population of 1,000 individuals and evaluate the privacy under multiple settings over 6,000 genomic variants and a subset of phenotype-related variants. Our findings demonstrate that an increasing sharing rate in the future entails a substantial negative effect on the privacy of all older generations. Moreover, we find that mixed populations face a less severe erosion of privacy over time than more homogeneous populations. Finally, we demonstrate that genomic-data sharing can be much more detrimental for the privacy of the phenotype-related variants.
Michael Backes 0001, Pascal Berrang, Mathias Humbert, Xiaoyu Shen 0001, Verena Wolf 0001
IEEE ACM Trans. Comput. Biol. Bioinform.5
2017 H(O)TA: estimation of DNA methylation and hydroxylation levels and efficiencies from time course data
abstract
MOTIVATION: Methylation and hydroxylation of cytosines to form 5-methylcytosine (5mC) and 5-hydroxymethylcytosine (5hmC) belong to the most important epigenetic modifications and their vital role in the regulation of gene expression has been widely recognized. Recent experimental techniques allow to infer methylation and hydroxylation levels at CpG dinucleotides but require a sophisticated statistical analysis to achieve accurate estimates. RESULTS: We present H(O)TA, a software tool based on a stochastic modeling approach, which simultaneously analyzes time course data from hairpin bisulfite sequencing and hairpin oxidative bisulfite sequencing. AVAILABILITY AND IMPLEMENTATION: : https://mosi.uni-saarland.de/HOTA. CONTACT: [email protected] or [email protected].
Charalampos Kyriakopoulos, Pascal Giehr, Verena Wolf 0001
Bioinform.3
2016 The Influence of Hydroxylation on Maintaining CpG Methylation Patterns: A Hidden Markov Model Approach
abstract
DNA methylation and demethylation are opposing processes that when in balance create stable patterns of epigenetic memory. The control of DNA methylation pattern formation by replication dependent and independent demethylation processes has been suggested to be influenced by Tet mediated oxidation of 5mC. Several alternative mechanisms have been proposed suggesting that 5hmC influences either replication dependent maintenance of DNA methylation or replication independent processes of active demethylation. Using high resolution hairpin oxidative bisulfite sequencing data, we precisely determine the amount of 5mC and 5hmC and model the contribution of 5hmC to processes of demethylation in mouse ESCs. We develop an extended hidden Markov model capable of accurately describing the regional contribution of 5hmC to demethylation dynamics. Our analysis shows that 5hmC has a strong impact on replication dependent demethylation, mainly by impairing methylation maintenance.
Pascal Giehr, Charalampos Kyriakopoulos, Gabriella Ficz, Verena Wolf 0001, Jörn Walter
PLoS Comput. Biol.4
2013 On-the-fly verification and optimization of DTA-properties for large Markov chains
Linar Mikeev, Martin R. Neuhäußer, David Spieler, Verena Wolf 0001
Formal Methods Syst. Des.4
2012 Parameter estimation for stochastic hybrid models of biochemical reaction networks
abstract
The dynamics of biochemical reaction networks can be accurately described by stochastic hybrid models, where we assume that large chemical populations evolve deterministically and continuously over time while small populations change through random discrete reactions.
Linar Mikeev, Verena Wolf 0001
HSCC2
2011 Parameter Identification for Markov Models of Biochemical Reactions
Aleksandr Andreychenko, Linar Mikeev, David Spieler, Verena Wolf 0001
CAV4
2011 SHAVE: stochastic hybrid analysis of markov population models
abstract
We present a tool called SHAVE that approximates the transient distribution of a continuous-time Markov population process by combining moment-based and state-based representations of probability distributions. As an intermediate step, SHAVE constructs a stochastic hybrid model from the original process which is then solved numerically.
Maksim Lapin, Linar Mikeev, Verena Wolf 0001
HSCC3
2011 Approximation of event probabilities in noisy cellular processes
Frédéric Didier, Thomas A. Henzinger, Maria Mateescu, Verena Wolf 0001
Theor. Comput. Sci.4
2009 Sliding Window Abstraction for Infinite Markov Chains
Thomas A. Henzinger, Maria Mateescu, Verena Wolf 0001
CAV3
2008 Abstraction for Stochastic Systems by Erlang's Method of Stages
Joost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf 0001
CONCUR4
2007 Three-Valued Abstraction for Continuous-Time Markov Chains
Joost-Pieter Katoen, Daniel Klink, Martin Leucker, Verena Wolf 0001
CAV4
2006 Stochastic Reasoning About Channel-Based Component Connectors
Christel Baier, Verena Wolf 0001
COORDINATION2
2005 Comparative branching-time semantics for Markov chains
Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Verena Wolf 0001
Inf. Comput.4
2003 Comparative Branching-Time Semantics
Christel Baier, Holger Hermanns, Joost-Pieter Katoen, Verena Wolf 0001
CONCUR4