Randomized Group-Greedy Method for Large-Scale Sensor Selection Problems
The randomized group-greedy method and its customized method for large-scale sensor selection problems are proposed. The randomized greedy sensor selection algorithm is applied straightforwardly to the group-greedy method, and a customized method is also considered. In the customized method, a part of the compressed sensor candidates is selected using the common greedy method or other low-cost methods. This strategy compensates for the deterioration of the solution due to compressed sensor candidates. The proposed methods are implemented based on the D- and E-optimal design of experiments, and numerical experiments are conducted using randomly generated sensor candidate matrices with potential sensor locations of 10,000--1,000,000. The proposed method can provide better optimization results than those obtained by the original group-greedy method when a similar computational cost is spent as for the original group-greedy method. This is because the group size for the group-greedy method can be increased as a result of the compressed sensor candidates by the randomized algorithm. Similar results were also obtained in the real dataset. The proposed method is effective for the E-optimality criterion, in which the objective function that the optimization by the common greedy method is difficult due to the absence of submodularity of the objective function. The idea of the present method can improve the performance of all optimizations using a greedy algorithm.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Randomized Greedy Sensor Selection: Leveraging Weak Submodularity
We study the problem of estimating a random process from the observations collected by a network of sensors that operate under resource constraints. When the dynamics of the process and sensor observations are described …
Lazier Than Lazy Greedy
Is it possible to maximize a monotone submodular function faster than the widely used lazy greedy algorithm (also known as accelerated greedy), both in theory and practice? In this paper, we develop the first linear-time…
ClusteringData SummarizationGreedy Low-Rank Gradient Compression for Distributed Learning with Convergence Guarantees
Distributed optimization is pivotal for large-scale signal processing and machine learning, yet communication overhead remains a major bottleneck. Low-rank gradient compression, in which the transmitted gradients are app…
Distributed OptimizationTowards Accelerated Greedy Sampling and Reconstruction of Bandlimited Graph Signals
We study the problem of sampling and reconstructing spectrally sparse graph signals where the objective is to select a subset of nodes of prespecified cardinality that ensures interpolation of the original signal with th…
Nondominated-Solution-based Multi-objective Greedy Sensor Selection for Optimal Design of Experiments
In this study, a nondominated-solution-based multi-objective greedy method is proposed and applied to a sensor selection problem based on the multiple indices of the optimal design of experiments. The proposed method sim…
Multiobjective Optimization