paper-with-me

Papers

Active and sparse methods in smoothed model checking

2021-04-20 · Paul Piho, Jane Hillston

Smoothed model checking based on Gaussian process classification provides a powerful approach for statistical model checking of parametric continuous time Markov chain models. The method constructs a model for the functional dependence of satisfaction probability on the Markov chain parameters. This is done via Gaussian process inference methods from a limited number of observations for different parameter combinations. In this work we consider extensions to smoothed model checking based on sparse variational methods and active learning. Both are used successfully to improve the scalability of smoothed model checking. In particular, we see that active learning-based ideas for iteratively querying the simulation model for observations can be used to steer the model-checking to more informative areas of the parameter space and thus improve sample efficiency. Online extensions of sparse variational Gaussian process inference algorithms are demonstrated to provide a scalable method for implementing active learning approaches for smoothed model checking.

📄 PDF Abstract BibTeX arXiv:2104.09940

Code (0)

등록된 구현이 없습니다.

Tasks

Active Learningmodel

Methods 이 논문이 사용한 방법론

Gaussian Process Gaussian Processes are non-parametric models for approximating functions. They rely upon a measure of similarity between points (the kernel function) to predict the value for…

Similar Papers 제목 키워드 기반

Scalable Stochastic Parametric Verification with Stochastic Variational Smoothed Model Checking

2022-05-11 · Luca Bortolussi, Francesca Cairoli, Ginevra Carbone, Paolo Pulcini

Parametric verification of linear temporal properties for stochastic models can be expressed as computing the satisfaction probability of a certain property as a function of the parameters of the model. Smoothed model ch…

Bayesian InferenceComputational EfficiencyGaussian ProcessesGPU+1

Debate Dynamics for Human-comprehensible Fact-checking on Knowledge Graphs

2020-01-09 · Marcel Hildebrandt, Jorge Andres Quintero Serna, Yunpu Ma, Martin Ringsquandl 외

We propose a novel method for fact-checking on knowledge graphs based on debate dynamics. The underlying idea is to frame the task of triple classification as a debate game between two reinforcement learning agents which…

Common Sense ReasoningFact CheckingFairnessKnowledge Graphs+2

Extractive and Abstractive Explanations for Fact-Checking and Evaluation of News

2021-04-27 · NAACL (NLP4IF) 2021 6 · Ashkan Kazemi, Zehua Li, Verónica Pérez-Rosas, Rada Mihalcea

In this paper, we explore the construction of natural language explanations for news claims, with the goal of assisting fact-checking and news evaluation applications. We experiment with two methods: (1) an extractive me…

Fact CheckingLanguage ModelingLanguage ModellingMisinformation

Sparse Spatial Smoothing: Reduced Complexity and Improved Beamforming Gain via Sparse Sub-Arrays

2024-03-10 · Yinyan Bu, Robin Rajamäki, Anand Dabak, Rajan Narasimha 외

This paper addresses the problem of single snapshot Direction-of-Arrival (DOA) estimation, which is of great importance in a wide-range of applications including automotive radar. A popular approach to achieving high ang…

subspace methods

Image Super-Resolution Based on Sparsity Prior via Smoothed $l_0$ Norm

2016-03-22 · Mohammad Rostami, Zhou Wang

In this paper we aim to tackle the problem of reconstructing a high-resolution image from a single low-resolution input image, known as single image super-resolution. In the literature, sparse representation has been use…

Combinatorial Optimizationcompressed sensingImage Super-ResolutionSSIM+1