On the Performance Analysis of the Adversarial System Variant Approximation Method to Quantify Process Model Generalization

• URL: http://arxiv.org/abs/2107.06319v1
• Date: Tue, 13 Jul 2021 18:27:09 GMT
• Title: On the Performance Analysis of the Adversarial System Variant Approximation Method to Quantify Process Model Generalization
• Authors: Julian Theis, Ilia Mokhtarian, and Houshang Darabi
• Abstract summary: This paper experimentally investigates the performance of Adversarial System Variant Approximation under non-ideal conditions. The results confirm the need to raise awareness about the working conditions of the method.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Process mining algorithms discover a process model from an event log. The resulting process model is supposed to describe all possible event sequences of the underlying system. Generalization is a process model quality dimension of interest. A generalization metric should quantify the extent to which a process model represents the observed event sequences contained in the event log and the unobserved event sequences of the system. Most of the available metrics in the literature cannot properly quantify the generalization of a process model. A recently published method [1] called Adversarial System Variant Approximation leverages Generative Adversarial Networks to approximate the underlying event sequence distribution of a system from an event log. While this method demonstrated performance gains over existing methods in measuring the generalization of process models, its experimental evaluations have been performed under ideal conditions. This paper experimentally investigates the performance of Adversarial System Variant Approximation under non-ideal conditions such as biased and limited event logs. Moreover, experiments are performed to investigate the originally proposed sampling hyperparameter value of the method on its performance to measure the generalization. The results confirm the need to raise awareness about the working conditions of the Adversarial System Variant Approximation method. The outcomes of this paper also serve to initiate future research directions. [1] Theis, Julian, and Houshang Darabi. "Adversarial System Variant Approximation to Quantify Process Model Generalization." IEEE Access 8 (2020): 194410-194427.

Related papers

• Polynomial Chaos Expanded Gaussian Process [2.287415292857564]
  In complex and unknown processes, global models are initially generated over the entire experimental space. This study addresses the need for models that effectively represent both global and local experimental spaces.
  arXiv  Detail & Related papers  (2024-05-02T07:11:05Z)
• User-defined Event Sampling and Uncertainty Quantification in Diffusion Models for Physical Dynamical Systems [49.75149094527068]
  We show that diffusion models can be adapted to make predictions and provide uncertainty quantification for chaotic dynamical systems. We develop a probabilistic approximation scheme for the conditional score function which converges to the true distribution as the noise level decreases. We are able to sample conditionally on nonlinear userdefined events at inference time, and matches data statistics even when sampling from the tails of the distribution.
  arXiv  Detail & Related papers  (2023-06-13T03:42:03Z)
• Sampling from Arbitrary Functions via PSD Models [55.41644538483948]
  We take a two-step approach by first modeling the probability distribution and then sampling from that model. We show that these models can approximate a large class of densities concisely using few evaluations, and present a simple algorithm to effectively sample from these models.
  arXiv  Detail & Related papers  (2021-10-20T12:25:22Z)
• Unified Regularity Measures for Sample-wise Learning and Generalization [18.10522585996242]
  We propose a pair of sample regularity measures for both processes with a formulation-consistent representation. Experiments validated the effectiveness and robustness of the proposed approaches for mini-batch SGD optimization.
  arXiv  Detail & Related papers  (2021-08-09T10:11:14Z)
• Bootstrapping Generalization of Process Models Discovered From Event Data [10.574698833115589]
  Generalization seeks to quantify how well a discovered model describes future executions of the system. We employ a bootstrap approach to estimate properties of a population based on a sample. Experiments demonstrate the feasibility of the approach in industrial settings.
  arXiv  Detail & Related papers  (2021-07-08T14:35:56Z)
• Pathwise Conditioning of Gaussian Processes [72.61885354624604]
  Conventional approaches for simulating Gaussian process posteriors view samples as draws from marginal distributions of process values at finite sets of input locations. This distribution-centric characterization leads to generative strategies that scale cubically in the size of the desired random vector. We show how this pathwise interpretation of conditioning gives rise to a general family of approximations that lend themselves to efficiently sampling Gaussian process posteriors.
  arXiv  Detail & Related papers  (2020-11-08T17:09:37Z)
• MAGMA: Inference and Prediction with Multi-Task Gaussian Processes [4.368185344922342]
  A novel multi-task Gaussian process (GP) framework is proposed, by using a common mean process for sharing information across tasks. Our overall algorithm is called textscMagma (standing for Multi tAsk Gaussian processes with common MeAn)
  arXiv  Detail & Related papers  (2020-07-21T11:43:54Z)
• A One-step Approach to Covariate Shift Adaptation [82.01909503235385]
  A default assumption in many machine learning scenarios is that the training and test samples are drawn from the same probability distribution. We propose a novel one-step approach that jointly learns the predictive model and the associated weights in one optimization.
  arXiv  Detail & Related papers  (2020-07-08T11:35:47Z)
• Localized active learning of Gaussian process state space models [63.97366815968177]
  A globally accurate model is not required to achieve good performance in many common control applications. We propose an active learning strategy for Gaussian process state space models that aims to obtain an accurate model on a bounded subset of the state-action space. By employing model predictive control, the proposed technique integrates information collected during exploration and adaptively improves its exploration strategy.
  arXiv  Detail & Related papers  (2020-05-04T05:35:02Z)
• Adversarial System Variant Approximation to Quantify Process Model Generalization [2.538209532048867]
  In process mining, process models are extracted from event logs and are commonly assessed using multiple quality dimensions. A novel deep learning-based methodology called Adversarial System Variant Approximation (AVATAR) is proposed to overcome this issue.
  arXiv  Detail & Related papers  (2020-03-26T22:06:18Z)
• Efficiently Sampling Functions from Gaussian Process Posteriors [76.94808614373609]
  We propose an easy-to-use and general-purpose approach for fast posterior sampling. We demonstrate how decoupled sample paths accurately represent Gaussian process posteriors at a fraction of the usual cost.
  arXiv  Detail & Related papers  (2020-02-21T14:03:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.