Fast and Robust State Estimation and Tracking via Hierarchical Learning
- URL: http://arxiv.org/abs/2306.17267v1
- Date: Thu, 29 Jun 2023 19:07:17 GMT
- Title: Fast and Robust State Estimation and Tracking via Hierarchical Learning
- Authors: Connor Mclaughlin, Matthew Ding, Deniz Edogmus, Lili Su
- Abstract summary: We propose two consensus + innovation algorithms for the state estimation and tracking problems.
We numerically validate our algorithm through simulation of both state estimation and tracking problems.
- Score: 2.236663830879273
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Fully distributed estimation and tracking solutions to large-scale
multi-agent networks suffer slow convergence and are vulnerable to network
failures. In this paper, we aim to speed up the convergence and enhance the
resilience of state estimation and tracking using a simple hierarchical system
architecture wherein agents are clusters into smaller networks, and a parameter
server exists to aid the information exchanges among networks. The information
exchange among networks is expensive and occurs only once in a while.
We propose two consensus + innovation algorithms for the state estimation and
tracking problems, respectively. In both algorithms, we use a novel
hierarchical push-sum consensus component. For the state estimation, we use
dual averaging as the local innovation component. State tracking is much harder
to tackle in the presence of dropping-link failures and the standard
integration of the consensus and innovation approaches are no longer
applicable. Moreover, dual averaging is no longer feasible. Our algorithm
introduces a pair of additional variables per link and ensure the relevant
local variables evolve according to the state dynamics, and use projected local
gradient descent as the local innovation component. We also characterize the
convergence rates of both of the algorithms under linear local observation
model and minimal technical assumptions. We numerically validate our algorithm
through simulation of both state estimation and tracking problems.
Related papers
- DIGEST: Fast and Communication Efficient Decentralized Learning with Local Updates [4.3707341422218215]
Two widely considered decentralized learning algorithms are Gossip and random walk-based learning.
We design a fast and communication-efficient asynchronous decentralized learning mechanism DIGEST.
We evaluate the performance of single- and multi-stream DIGEST for logistic regression and a deep neural network ResNet20.
arXiv Detail & Related papers (2023-07-14T22:58:20Z) - Network-GIANT: Fully distributed Newton-type optimization via harmonic
Hessian consensus [2.8617826964327113]
We introduce a Newton-type fully distributed optimization algorithm, Network-GIANT, based on GIANT.
We prove that our algorithm guarantees semi-global and exponential convergence to the exact solution over the network assuming strongly convex and smooth loss functions.
We provide empirical evidence of the superior convergence performance of Network-GIANT over other state-of-art distributed learning algorithms such as Network-DANE and Newton-Raphson Consensus.
arXiv Detail & Related papers (2023-05-13T11:42:40Z) - Correlating sparse sensing for large-scale traffic speed estimation: A
Laplacian-enhanced low-rank tensor kriging approach [76.45949280328838]
We propose a Laplacian enhanced low-rank tensor (LETC) framework featuring both lowrankness and multi-temporal correlations for large-scale traffic speed kriging.
We then design an efficient solution algorithm via several effective numeric techniques to scale up the proposed model to network-wide kriging.
arXiv Detail & Related papers (2022-10-21T07:25:57Z) - Adaptive Local-Component-aware Graph Convolutional Network for One-shot
Skeleton-based Action Recognition [54.23513799338309]
We present an Adaptive Local-Component-aware Graph Convolutional Network for skeleton-based action recognition.
Our method provides a stronger representation than the global embedding and helps our model reach state-of-the-art.
arXiv Detail & Related papers (2022-09-21T02:33:07Z) - Ground state search by local and sequential updates of neural network
quantum states [3.3711670942444023]
We propose a local optimization procedure for neural network quantum states.
We analyze both the ground state energy and the correlations for the non-integrable tilted Ising model with restricted Boltzmann machines.
We find that sequential local updates can lead to faster convergence to states which have energy and correlations closer to those of the ground state.
To show the generality of the approach we apply it to both 1D and 2D non-integrable spin systems.
arXiv Detail & Related papers (2022-07-22T05:24:19Z) - Verification of Neural-Network Control Systems by Integrating Taylor
Models and Zonotopes [0.0]
We study the verification problem for closed-loop dynamical systems with neural-network controllers (NNCS)
We present an algorithm to chain approaches based on Taylor models and zonotopes, yielding a precise reachability algorithm for NNCS.
arXiv Detail & Related papers (2021-12-16T20:46:39Z) - Centralizing State-Values in Dueling Networks for Multi-Robot
Reinforcement Learning Mapless Navigation [87.85646257351212]
We study the problem of multi-robot mapless navigation in the popular Training and Decentralized Execution (CTDE) paradigm.
This problem is challenging when each robot considers its path without explicitly sharing observations with other robots.
We propose a novel architecture for CTDE that uses a centralized state-value network to compute a joint state-value.
arXiv Detail & Related papers (2021-12-16T16:47:00Z) - SignalNet: A Low Resolution Sinusoid Decomposition and Estimation
Network [79.04274563889548]
We propose SignalNet, a neural network architecture that detects the number of sinusoids and estimates their parameters from quantized in-phase and quadrature samples.
We introduce a worst-case learning threshold for comparing the results of our network relative to the underlying data distributions.
In simulation, we find that our algorithm is always able to surpass the threshold for three-bit data but often cannot exceed the threshold for one-bit data.
arXiv Detail & Related papers (2021-06-10T04:21:20Z) - Reinforcement Learning for Datacenter Congestion Control [50.225885814524304]
Successful congestion control algorithms can dramatically improve latency and overall network throughput.
Until today, no such learning-based algorithms have shown practical potential in this domain.
We devise an RL-based algorithm with the aim of generalizing to different configurations of real-world datacenter networks.
We show that this scheme outperforms alternative popular RL approaches, and generalizes to scenarios that were not seen during training.
arXiv Detail & Related papers (2021-02-18T13:49:28Z) - Decentralized Deep Learning using Momentum-Accelerated Consensus [15.333413663982874]
We consider the problem of decentralized deep learning where multiple agents collaborate to learn from a distributed dataset.
We propose and analyze a novel decentralized deep learning algorithm where the agents interact over a fixed communication topology.
Our algorithm is based on the heavy-ball acceleration method used in gradient-based protocol.
arXiv Detail & Related papers (2020-10-21T17:39:52Z) - A Unified Theory of Decentralized SGD with Changing Topology and Local
Updates [70.9701218475002]
We introduce a unified convergence analysis of decentralized communication methods.
We derive universal convergence rates for several applications.
Our proofs rely on weak assumptions.
arXiv Detail & Related papers (2020-03-23T17:49:15Z)
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.