Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Item TypeItem Type
-
SubjectSubject
-
YearFrom:-To:
-
More FiltersMore FiltersSourceLanguage
Done
Filters
Reset
18,229
result(s) for
"probabilistic model"
Sort by:
Diffusion probabilistic model based accurate and high-degree-of-freedom metasurface inverse design
2023
Conventional meta-atom designs rely heavily on researchers’ prior knowledge and trial-and-error searches using full-wave simulations, resulting in time-consuming and inefficient processes. Inverse design methods based on optimization algorithms, such as evolutionary algorithms, and topological optimizations, have been introduced to design metamaterials. However, none of these algorithms are general enough to fulfill multi-objective tasks. Recently, deep learning methods represented by generative adversarial networks (GANs) have been applied to inverse design of metamaterials, which can directly generate high-degree-of-freedom meta-atoms based on S-parameters requirements. However, the adversarial training process of GANs makes the network unstable and results in high modeling costs. This paper proposes a novel metamaterial inverse design method based on the diffusion probability theory. By learning the Markov process that transforms the original structure into a Gaussian distribution, the proposed method can gradually remove the noise starting from the Gaussian distribution and generate new high-degree-of-freedom meta-atoms that meet S-parameters conditions, which avoids the model instability introduced by the adversarial training process of GANs and ensures more accurate and high-quality generation results. Experiments have proven that our method is superior to representative methods of GANs in terms of model convergence speed, generation accuracy, and quality.
Journal Article
Application of probabilistic method in maximum tsunami height prediction considering stochastic seabed topography
2020
Uncertainty is a significant challenge in tsunami hazard analysis. Tsunami heights are affected by complex factors and change constantly during propagation. The heights of tsunami have random characteristics. This study proposes that the water depths (related to seabed topography) are the most important factors that affect tsunami height. But across the globe, a considerable area of seabed topography has not been measured. So it is necessary to use the method of uncertainty to consider the water depth. The Wiener process is utilized to quantify the random changes of the water depth, which can better describe the situation that water depths change in a non-monotonic way. Considering the uncertainty of water depth, a Weiner process-based probabilistic model was established for predicting the maximum tsunami height, which is different from the maximum tsunami height deterministic or stochastic model previously studied with higher prediction efficiency and good prediction accuracy. The probability distribution of maximum tsunami heights was calculated using the stochastic model. The mean value of the maximum tsunami heights was very similar to the average value of 165 actual observations of maximum tsunami heights collected from 1997 to 2017.
Journal Article
Improved and scalable online learning of spatial concepts and language models with mapping
by
Inamura Tetsunari
,
Taniguchi Tadahiro
,
Taniguchi Akira
in
Accuracy
,
Algorithms
,
Distance learning
2020
We propose a novel online learning algorithm, called SpCoSLAM 2.0, for spatial concepts and lexical acquisition with high accuracy and scalability. Previously, we proposed SpCoSLAM as an online learning algorithm based on unsupervised Bayesian probabilistic model that integrates multimodal place categorization, lexical acquisition, and SLAM. However, our original algorithm had limited estimation accuracy owing to the influence of the early stages of learning, and increased computational complexity with added training data. Therefore, we introduce techniques such as fixed-lag rejuvenation to reduce the calculation time while maintaining an accuracy higher than that of the original algorithm. The results show that, in terms of estimation accuracy, the proposed algorithm exceeds the original algorithm and is comparable to batch learning. In addition, the calculation time of the proposed algorithm does not depend on the amount of training data and becomes constant for each step of the scalable algorithm. Our approach will contribute to the realization of long-term spatial language interactions between humans and robots.
Journal Article
Synthesis of probabilistic models for quality-of-service software engineering
by
Calinescu, Radu
,
Tamburrelli, Giordano
,
Gerasimou, Simos
in
Adaptive systems
,
Artificial Intelligence
,
Computer Science
2018
An increasingly used method for the engineering of software systems with strict quality-of-service (QoS) requirements involves the synthesis and verification of probabilistic models for many alternative architectures and instantiations of system parameters. Using manual trial-and-error or simple heuristics for this task often produces suboptimal models, while the exhaustive synthesis of all possible models is typically intractable. The EvoChecker search-based software engineering approach presented in our paper addresses these limitations by employing evolutionary algorithms to automate the model synthesis process and to significantly improve its outcome. EvoChecker can be used to synthesise the Pareto-optimal set of probabilistic models associated with the QoS requirements of a system under design, and to support the selection of a suitable system architecture and configuration. EvoChecker can also be used at runtime, to drive the efficient reconfiguration of a self-adaptive software system. We evaluate EvoChecker on several variants of three systems from different application domains, and show its effectiveness and applicability.
Journal Article
Integration of DDPM and ILUES for Simultaneous Identification of Contaminant Source Parameters and Non‐Gaussian Channelized Hydraulic Conductivity Field
2024
Identifying highly channelized hydraulic conductivity fields and contaminant source parameters remains a challenging task, primarily due to the non‐Gaussian nature and high dimensionality of the parameter space, as well as the computational burden caused by repeatedly running forward numerical models. This study proposes a novel deep learning parameterization method called AEdiffusion, which combines Diffusion Denoising Probabilistic Model (DDPM) with Variational Autoencoder (VAE) for dimensionality reduction. The method employs a generator‐refiner strategy to generate high‐dimensional aquifer properties from low‐dimensional latent representations. The inversion modeling was performed on a synthetic non‐Gaussian hydraulic conductivity field with line‐source contamination using the Iterative Local Updating Ensemble Smoother (ILUES) algorithm. The results demonstrate that the AEdiffusion‐ILUES framework can accurately identify model parameters. To reduce the computational burden, an AR‐Net‐WL (ARNW) surrogate model was introduced, resulting in an efficient inversion framework (AEdiffusion‐ILUES‐ARNW) with similar prediction accuracy and predictive uncertainty estimation as the AEdiffusion‐ILUES but at a lower computational cost. Plain Language Summary Identifying highly channelized hydraulic conductivity fields and contaminant source parameters is crucial for developing groundwater remediation strategies. However, this remains a challenging task due to the non‐Gaussian nature and high dimensionality of the parameter space, as well as the computational burden caused by repeatedly running numerical models. We propose a novel deep learning‐based inversion framework to identify hydraulic conductivity fields and contaminant sources from sparse and error‐prone observations. Key Points A novel and accurate deep learning parameterization method combining DDPM and VAE is proposed to parameterize non‐Gaussian hydraulic conductivity fields A deep autoregressive neural network is integrated into the inversion framework as a surrogate to alleviate the high computational cost of the forward numerical models The integrated approach is assessed with inverse problems for the identification of a non‐Gaussian conductivity and line contaminant source parameters
Journal Article
ProFeat: feature-oriented engineering for family-based probabilistic model checking
by
Klüppelholz, Sascha
,
Chrszon, Philipp
,
Dubslaff, Clemens
in
Computer Science
,
Deactivation
,
Math Applications in Computer Science
2018
The concept of features provides an elegant way to specify families of systems. Given a base system, features encapsulate additional functionalities that can be activated or deactivated to enhance or restrict the base system’s behaviors. Features can also facilitate the analysis of families of systems by exploiting commonalities of the family members and performing an all-in-one analysis, where all systems of the family are analyzed at once on a single family model instead of one-by-one. Most prominent, the concept of features has been successfully applied to describe and analyze (software) product lines. We present the tool
ProFeat
that supports the feature-oriented engineering process for stochastic systems by probabilistic model checking. To describe families of stochastic systems,
ProFeat
extends models for the prominent probabilistic model checker
Prism
by feature-oriented concepts, including support for probabilistic product lines with dynamic feature switches, multi-features and feature attributes.
ProFeat
provides a compact symbolic representation of the analysis results for each family member obtained by
Prism
to support, e.g., model repair or refinement during feature-oriented development. By means of several case studies we show how
ProFeat
eases family-based quantitative analysis and compare one-by-one and all-in-one analysis approaches.
Journal Article
Celloscope: a probabilistic model for marker-gene-driven cell type deconvolution in spatial transcriptomics data
by
Filipiuk, Igor
,
Rączkowska, Alicja
,
Lagergren, Jens
in
Animal Genetics and Genomics
,
Animals
,
Bioinformatics
2023
Spatial transcriptomics maps gene expression across tissues, posing the challenge of determining the spatial arrangement of different cell types. However, spatial transcriptomics spots contain multiple cells. Therefore, the observed signal comes from mixtures of cells of different types. Here, we propose an innovative probabilistic model, Celloscope, that utilizes established prior knowledge on marker genes for cell type deconvolution from spatial transcriptomics data. Celloscope outperforms other methods on simulated data, successfully indicates known brain structures and spatially distinguishes between inhibitory and excitatory neuron types based in mouse brain tissue, and dissects large heterogeneity of immune infiltrate composition in prostate gland tissue.
Journal Article
Probabilistic modelling and verification using RoboChart and PRISM
by
Cavalcanti, Ana
,
Miyazawa Alvaro
,
Ye Kangfeng
in
Automation
,
Control algorithms
,
Domain specific languages
2022
RoboChart is a timed domain-specific language for robotics, distinctive in its support for automated verification by model checking and theorem proving. Since uncertainty is an essential part of robotic systems, we present here an extension to RoboChart to model uncertainty using probabilism. The extension enriches RoboChart state machines with probability through a new construct: probabilistic junctions as the source of transitions with a probability value. RoboChart has an accompanying tool, called RoboTool, for modelling and verification of functional and real-time behaviour. We present here also an automatic technique, implemented in RoboTool, to transform a RoboChart model into a PRISM model for verification. We have extended the property language of RoboTool so that probabilistic properties expressed in temporal logic can be written using controlled natural language.
Journal Article
Dissecting heterogeneous cell populations across drug and disease conditions with PopAlign
by
Pichiorri, Flavia
,
Park, Jong H.
,
Charles, Emeric
in
Biological Sciences
,
Biophysics and Computational Biology
,
Computational Biology - methods
2020
Single-cell measurement techniques can now probe gene expression in heterogeneous cell populations from the human body across a range of environmental and physiological conditions. However, new mathematical and computational methods are required to represent and analyze gene-expression changes that occur in complex mixtures of single cells as they respond to signals, drugs, or disease states. Here, we introduce a mathematical modeling platform, PopAlign, that automatically identifies subpopulations of cells within a heterogeneous mixture and tracks gene-expression and cell-abundance changes across subpopulations by constructing and comparing probabilistic models. Probabilistic models provide a low-error, compressed representation of single-cell data that enables efficient large-scale computations. We apply PopAlign to analyze the impact of 40 different immunomodulatory compounds on a heterogeneous population of donor-derived human immune cells as well as patient-specific disease signatures in multiple myeloma. PopAlign scales to comparisons involving tens to hundreds of samples, enabling large-scale studies of natural and engineered cell populations as they respond to drugs, signals, or physiological change.
Journal Article
PRG4CNN: A Probabilistic Model Checking-Driven Robustness Guarantee Framework for CNNs
2025
As an important kind of DNN (deep neural network), CNN (convolutional neural network) has made remarkable progress and been widely used in the vision and decision-making of autonomous robots. Nonetheless, in many scenarios, even a minor perturbation in input for CNNs may lead to serious errors, which means CNNs lack robustness. Formal verification is an effective method to guarantee the robustness of CNNs. Existing works predominantly concentrate on local robustness verification, which requires considerable time and space. Probabilistic robustness quantifies the robustness of CNNs, which is a practical mode of potential measurement. The state-of-the-art of probabilistic robustness verification is a test-driven approach, which is used to manually decide whether a DNN satisfies the probabilistic robustness and does not involve robustness repair. Robustness repair can improve the robustness of CNNs further. To address this issue, we propose a probabilistic model checking-driven robustness guarantee framework for CNNs, i.e., PRG4CNN. This is the first automated and complete framework for guaranteeing the probabilistic robustness of CNNs. It comprises four steps, as follows: (1) modeling a CNN as an MDP (Markov decision processes) by model learning, (2) specifying the probabilistic robustness of the CNN via the PCTL (Probabilistic Computational Tree Logic) formula, (3) verifying the probabilistic robustness with a probabilistic model checker, and (4) probabilistic robustness repair by counterexample-guided sensitivity analysis, if probabilistic robustness does not hold on the CNN. We here conduct experiments on various scales of CNNs trained on the handwriting dataset MNIST, and demonstrate the effectiveness of PRG4CNN.
Journal Article