Related Experiment Videos
Distributed Jointly Sparse Multitask Learning Over Networks
Abstract:
Distributed data processing over networks has received a lot of attention due to its wide applicability. In this paper, we consider the multitask problem of in-network distributed estimation. For the multitask problem, the unknown parameter vectors (tasks) for different nodes can be different. Moreover, considering some real application scenarios, it is also assumed that there are some similarities among the tasks. Thus, the intertask cooperation is helpful to enhance the estimation performance. In this paper, we exploit an additional special characteristic of the vectors of interest, namely, joint sparsity, aiming to further enhance the estimation performance. A distributed jointly sparse multitask algorithm for the collaborative sparse estimation problem is derived. In addition, an adaptive intertask cooperation strategy is adopted to improve the robustness against the degree of difference among the tasks. The performance of the proposed algorithm is analyzed theoretically, and its effectiveness is verified by some simulations.
Related Concept Videos
Distributed Loads: Problem Solving
Associative Learning
Classical conditioning, also known...
Parallel Processing
Distributed Loads
For example, consider a bookshelf filled with books stacked vertically adjacent to each other. The weight of the books is evenly distributed over the length of the shelf. As a result, the pressure at different locations on the surface of the...
Observational Learning
Multimachine Stability
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by: