Efficient Sensor Placement from Regression with Sparse Gaussian
Processes in Continuous and Discrete Spaces
- URL: http://arxiv.org/abs/2303.00028v6
- Date: Thu, 26 Oct 2023 02:39:13 GMT
- Title: Efficient Sensor Placement from Regression with Sparse Gaussian
Processes in Continuous and Discrete Spaces
- Authors: Kalvik Jakkala, Srinivas Akella
- Abstract summary: The sensor placement problem is a common problem that arises when monitoring correlated phenomena.
We have uncovered a novel connection between the sensor placement problem and sparse processes(SGP)
Our approach generates sensor placements consistently on par with or better than the prior state-of-the-art approaches.
- Score: 4.40560654491339
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The sensor placement problem is a common problem that arises when monitoring
correlated phenomena, such as temperature, precipitation, and salinity.
Existing approaches to this problem typically formulate it as the maximization
of information metrics, such as mutual information~(MI), and use optimization
methods such as greedy algorithms in discrete domains, and derivative-free
optimization methods such as genetic algorithms in continuous domains. However,
computing MI for sensor placement requires discretizing the environment, and
its computation cost depends on the size of the discretized environment. This
limitation restricts these approaches from scaling to large problems. We have
uncovered a novel connection between the sensor placement problem and sparse
Gaussian processes~(SGP). Our approach leverages SGPs and is gradient-based,
which allows us to efficiently find solution placements in continuous
environments. We generalize our method to also handle discrete environments.
Our experimental results on four real-world datasets demonstrate that our
approach generates sensor placements consistently on par with or better than
the prior state-of-the-art approaches in terms of both MI and reconstruction
quality, all while being significantly faster. Our computationally efficient
approach enables both large-scale sensor placement and fast robotic sensor
placement for informative path planning algorithms.
Related papers
- Bagged Regularized $k$-Distances for Anomaly Detection [9.899763598214122]
We propose a new distance-based algorithm called bagged regularized $k$-distances for anomaly detection (BRDAD)
Our BRDAD algorithm selects the weights by minimizing the surrogate risk, i.e., the finite sample bound of the empirical risk of the bagged weighted $k$-distances for density estimation (BWDDE)
On the theoretical side, we establish fast convergence rates of the AUC regret of our algorithm and demonstrate that the bagging technique significantly reduces the computational complexity.
arXiv Detail & Related papers (2023-12-02T07:00:46Z) - Efficient and robust Sensor Placement in Complex Environments [1.1421942894219899]
This paper addresses the problem of efficient and unobstructed surveillance or communication in complex environments.
We propose a greedy algorithm to achieve the objective.
Deep learning techniques are used to accelerate the evaluation of the objective function.
arXiv Detail & Related papers (2023-09-15T17:10:19Z) - Environmental Sensor Placement with Convolutional Gaussian Neural
Processes [65.13973319334625]
It is challenging to place sensors in a way that maximises the informativeness of their measurements, particularly in remote regions like Antarctica.
Probabilistic machine learning models can suggest informative sensor placements by finding sites that maximally reduce prediction uncertainty.
This paper proposes using a convolutional Gaussian neural process (ConvGNP) to address these issues.
arXiv Detail & Related papers (2022-11-18T17:25:14Z) - Task-Oriented Sensing, Computation, and Communication Integration for
Multi-Device Edge AI [108.08079323459822]
This paper studies a new multi-intelligent edge artificial-latency (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC)
We measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain.
arXiv Detail & Related papers (2022-07-03T06:57:07Z) - 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) - Learning-based Localizability Estimation for Robust LiDAR Localization [13.298113481670038]
LiDAR-based localization and mapping is one of the core components in many modern robotic systems.
This work proposes a neural network-based estimation approach for detecting (non-)localizability during robot operation.
arXiv Detail & Related papers (2022-03-11T01:12:00Z) - Federated Minimax Optimization: Improved Convergence Analyses and
Algorithms [32.062312674333775]
We consider non minimax optimization, is gaining prominence many modern machine learning applications such as GANs.
We provide a novel and tighter analysis algorithm, improves convergence communication guarantees in the existing literature.
arXiv Detail & Related papers (2022-03-09T16:21:31Z) - Super-resolution GANs of randomly-seeded fields [68.8204255655161]
We propose a novel super-resolution generative adversarial network (GAN) framework to estimate field quantities from random sparse sensors.
The algorithm exploits random sampling to provide incomplete views of the high-resolution underlying distributions.
The proposed technique is tested on synthetic databases of fluid flow simulations, ocean surface temperature distributions measurements, and particle image velocimetry data.
arXiv Detail & Related papers (2022-02-23T18:57:53Z) - An automatic differentiation system for the age of differential privacy [65.35244647521989]
Tritium is an automatic differentiation-based sensitivity analysis framework for differentially private (DP) machine learning (ML)
We introduce Tritium, an automatic differentiation-based sensitivity analysis framework for differentially private (DP) machine learning (ML)
arXiv Detail & Related papers (2021-09-22T08:07:42Z) - Distributed Optimization, Averaging via ADMM, and Network Topology [0.0]
We study the connection between network topology and convergence rates for different algorithms on a real world problem of sensor localization.
We also show interesting connections between ADMM and lifted Markov chains besides providing an explicitly characterization of its convergence.
arXiv Detail & Related papers (2020-09-05T21:44:39Z) - Deep Soft Procrustes for Markerless Volumetric Sensor Alignment [81.13055566952221]
In this work, we improve markerless data-driven correspondence estimation to achieve more robust multi-sensor spatial alignment.
We incorporate geometric constraints in an end-to-end manner into a typical segmentation based model and bridge the intermediate dense classification task with the targeted pose estimation one.
Our model is experimentally shown to achieve similar results with marker-based methods and outperform the markerless ones, while also being robust to the pose variations of the calibration structure.
arXiv Detail & Related papers (2020-03-23T10:51:32Z)
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.