Value propagation-based spatio-temporal interpolation inspired by Markov
reward processes
- URL: http://arxiv.org/abs/2106.00538v1
- Date: Tue, 1 Jun 2021 14:52:54 GMT
- Title: Value propagation-based spatio-temporal interpolation inspired by Markov
reward processes
- Authors: Laurens Arp, Mitra Baratchi, Holger Hoos
- Abstract summary: We propose a propagation value method inspired by Markov reward processes (MRPs) as a spatial method.
We show that the average performance of SD-MRP on real-world data under all experimental conditions was ranked significantly higher than that of all other methods.
We further found that, even in cases where our methods had no significant advantage over baselines numerically, our methods preserved the structure of the target grid better than the baselines.
- Score: 0.06445605125467573
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Given the common problem of missing data in real-world applications from
various fields, such as remote sensing, ecology and meteorology, the
interpolation of missing spatial and spatio-temporal data can be of tremendous
value. Existing methods for spatial interpolation, most notably Gaussian
processes and spatial autoregressive models, tend to suffer from (a) a
trade-off between modelling local or global spatial interaction, (b) the
assumption there is only one possible path between two points, and (c) the
assumption of homogeneity of intermediate locations between points. Addressing
these issues, we propose a value propagation method, inspired by Markov reward
processes (MRPs), as a spatial interpolation method, and introduce two variants
thereof: (i) a static discount (SD-MRP) and (ii) a data-driven weight
prediction (WP-MRP) variant. Both these interpolation variants operate locally,
while implicitly accounting for global spatial relationships in the entire
system through recursion. We evaluated our proposed methods by comparing the
mean absolute errors and running times of interpolated grid cells to those of 7
common baselines. Our analysis involved detailed experiments on two synthetic
and two real-world datasets over 44 total experimental conditions. Experimental
results show the competitive advantage of MRP interpolation on real-world data,
as the average performance of SD-MRP on real-world data under all experimental
conditions was ranked significantly higher than that of all other methods,
followed by WP-MRP. On synthetic data, we show that WP-MRP can perform better
than SD-MRP given sufficiently informative features. We further found that,
even in cases where our methods had no significant advantage over baselines
numerically, our methods preserved the spatial structure of the target grid
better than the baselines.
Related papers
- Spatially-Aware Diffusion Models with Cross-Attention for Global Field Reconstruction with Sparse Observations [1.371691382573869]
We develop and enhance score-based diffusion models in field reconstruction tasks.
We introduce a condition encoding approach to construct a tractable mapping mapping between observed and unobserved regions.
We demonstrate the ability of the model to capture possible reconstructions and improve the accuracy of fused results.
arXiv Detail & Related papers (2024-08-30T19:46:23Z) - Efficient Trajectory Inference in Wasserstein Space Using Consecutive Averaging [3.8623569699070353]
Trajectory inference deals with the challenge of reconstructing continuous processes from such observations.
We propose methods for B-spline approximation of point clouds through consecutive averaging that is instrinsic to the Wasserstein space.
We rigorously evaluate our method by providing convergence guarantees and testing it on simulated cell data.
arXiv Detail & Related papers (2024-05-30T04:19:20Z) - Collaborative Heterogeneous Causal Inference Beyond Meta-analysis [68.4474531911361]
We propose a collaborative inverse propensity score estimator for causal inference with heterogeneous data.
Our method shows significant improvements over the methods based on meta-analysis when heterogeneity increases.
arXiv Detail & Related papers (2024-04-24T09:04:36Z) - Deep learning for bias-correcting CMIP6-class Earth system models [0.0]
We show that a post-processing method based on physically constrained generative adversarial networks (cGANs) can correct biases of a state-of-the-art, CMIP6-class ESM.
While our method improves local frequency distributions equally well as gold-standard bias-adjustment frameworks, it strongly outperforms any existing methods in the correction of spatial patterns.
arXiv Detail & Related papers (2022-12-16T13:53:57Z) - GEC: A Unified Framework for Interactive Decision Making in MDP, POMDP,
and Beyond [101.5329678997916]
We study sample efficient reinforcement learning (RL) under the general framework of interactive decision making.
We propose a novel complexity measure, generalized eluder coefficient (GEC), which characterizes the fundamental tradeoff between exploration and exploitation.
We show that RL problems with low GEC form a remarkably rich class, which subsumes low Bellman eluder dimension problems, bilinear class, low witness rank problems, PO-bilinear class, and generalized regular PSR.
arXiv Detail & Related papers (2022-11-03T16:42:40Z) - Information Entropy Initialized Concrete Autoencoder for Optimal Sensor
Placement and Reconstruction of Geophysical Fields [58.720142291102135]
We propose a new approach to the optimal placement of sensors for reconstructing geophysical fields from sparse measurements.
We demonstrate our method on the two examples: (a) temperature and (b) salinity fields around the Barents Sea and the Svalbard group of islands.
We find out that the obtained optimal sensor locations have clear physical interpretation and correspond to the boundaries between sea currents.
arXiv Detail & Related papers (2022-06-28T12:43:38Z) - DRFLM: Distributionally Robust Federated Learning with Inter-client
Noise via Local Mixup [58.894901088797376]
federated learning has emerged as a promising approach for training a global model using data from multiple organizations without leaking their raw data.
We propose a general framework to solve the above two challenges simultaneously.
We provide comprehensive theoretical analysis including robustness analysis, convergence analysis, and generalization ability.
arXiv Detail & Related papers (2022-04-16T08:08:29Z) - Gradient Matching for Domain Generalization [93.04545793814486]
A critical requirement of machine learning systems is their ability to generalize to unseen domains.
We propose an inter-domain gradient matching objective that targets domain generalization.
We derive a simpler first-order algorithm named Fish that approximates its optimization.
arXiv Detail & Related papers (2021-04-20T12:55:37Z) - Semi-Supervised Learning with Variational Bayesian Inference and Maximum
Uncertainty Regularization [62.21716612888669]
We propose two generic methods for improving semi-supervised learning (SSL)
The first integrates weight perturbation (WP) into existing "consistency regularization" (CR) based methods.
The second method proposes a novel consistency loss called "maximum uncertainty regularization" (MUR)
arXiv Detail & Related papers (2020-12-03T09:49:35Z) - Inter-domain Deep Gaussian Processes [45.28237107466283]
We propose an extension of inter-domain shallow GPs that combines the advantages of inter-domain and deep Gaussian processes (DGPs)
We demonstrate how to leverage existing approximate inference methods to perform simple and scalable approximate inference using inter-domain features in DGPs.
arXiv Detail & Related papers (2020-11-01T04:03:35Z) - Locally induced Gaussian processes for large-scale simulation
experiments [0.0]
We show how placement of inducing points and their multitude can be thwarted by pathologies.
Our proposed methodology hybridizes global inducing point and data subset-based local GP approximation.
We show that local inducing points extend their global and data-subset component parts on the accuracy--computational efficiency frontier.
arXiv Detail & Related papers (2020-08-28T21:37:46Z)
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.