684,524 research outputs found
Parametrization of stochastic inputs using generative adversarial networks with application in geology
We investigate artificial neural networks as a parametrization tool for
stochastic inputs in numerical simulations. We address parametrization from the
point of view of emulating the data generating process, instead of explicitly
constructing a parametric form to preserve predefined statistics of the data.
This is done by training a neural network to generate samples from the data
distribution using a recent deep learning technique called generative
adversarial networks. By emulating the data generating process, the relevant
statistics of the data are replicated. The method is assessed in subsurface
flow problems, where effective parametrization of underground properties such
as permeability is important due to the high dimensionality and presence of
high spatial correlations. We experiment with realizations of binary
channelized subsurface permeability and perform uncertainty quantification and
parameter estimation. Results show that the parametrization using generative
adversarial networks is very effective in preserving visual realism as well as
high order statistics of the flow responses, while achieving a dimensionality
reduction of two orders of magnitude
Parameter estimation of binned Hawkes processes
A key difficulty that arises from real event data is imprecision in the recording of event time-stamps. In many cases, retaining event times with a high precision is expensive due to the sheer volume of activity. Combined with practical limits on the accuracy of measurements, binned data is common. In order to use point processes to model such event data, tools for handling parameter estimation are essential. Here we consider parameter estimation of the Hawkes process, a type of self-exciting point process that has found application in the modeling of financial stock markets, earthquakes and social media cascades. We develop a novel optimization approach to parameter estimation of binned Hawkes processes using a modified Expectation-Maximization algorithm, referred to as Binned Hawkes Expectation Maximization (BH-EM). Through a detailed simulation study, we demonstrate that existing methods are capable of producing severely biased and highly variable parameter estimates and that our novel BH-EM method significantly outperforms them in all studied circumstances. We further illustrate the performance on network flow (NetFlow) data between devices in a real large-scale computer network, to characterize triggering behavior. These results highlight the importance of correct handling of binned data
Recommended from our members
Point Process Models for Heterogeneous Event Time Data
Interaction event times observed on a social network provide valuable information for social scientists to gain insight into complex social dynamics that are challenging to understand. However, it can be difficult to accurately represent the heterogeneity in the data and to model the dependence structure in the network system. This requires flexible models that can capture the complicated dynamics and complex patterns. Point process models offer an elegant framework for modeling event time data. This dissertation concentrates on developing point process models and related diagnostic tools, with a real data application involving an animal behavior network.
In this dissertation, we first propose a Markov-modulated Hawkes process (MMHP) model to capture the sporadic and bursty patterns often observed in event time data. A Bayesian inference procedure is developed to evaluate the likelihood by using a variational approximation and the forward-backward algorithm. The validity of the proposed model and associated estimation algorithms is demonstrated using synthetic data and the animal behavior data. Facilitated by the power of the MMHP model, we construct network point process models that can capture a social hierarchy structure by embedding nodes in a latent space that can represent the underlying social ranks. Our model provides a ranking method for social hierarchy studies and describes the dynamics of social hierarchy formation from a novel perspective – taking advantage of the detailed information available in event time data. We show that the network point process models appropriately captures the temporal dynamics and heterogeneity in the network event time data, by providing meaningful inferred rankings and by calibrating the accuracy of predictions with relevant measures of uncertainty. In addition to developing a sensible and flexible model for network event time data, the last part of this dissertation provides essential tools for diagnosing lack of fit issues for such models. We develop a systematic set of diagnostic tools and visualizations for point process models fitted to data in the dynamic network setting. By inspecting the structure of the residual process and Pearson residual on the network, we can validate whether a model adequately captures the temporal and network dependence structures in the observed data
- …