Data Sampling for Graph Based Unsupervised Learning: Convex and Greedy Optimization

by   Saeed Vahidian, et al.

In a number of situations, collecting a function value for every data point may be prohibitively expensive, and random sampling ignores any structure in the underlying data. We introduce a scalable optimization algorithm with no correction steps (in contrast to Frank-Wolfe and its variants), a variant of gradient ascent for coreset selection in graphs, that greedily selects a weighted subset of vertices that are deemed most important to sample. Our algorithm estimates the mean of the function by taking a weighted sum only at these vertices, and we provably bound the estimation error in terms of the location and weights of the selected vertices in the graph. In addition, we consider the case where nodes have different selection costs and provide bounds on the quality of the low-cost selected coresets. We demonstrate the benefits of our algorithm on point clouds and structured graphs, as well as sensor placement where the cost of placing sensors depends on the location of the placement. We also elucidate that the empirical convergence of our proposed method is faster than random selection and various clustering methods while still respecting sensor placement cost. The paper concludes with validation of the developed algorithm on both synthetic and real datasets, demonstrating that it performs very well compared to the current state of the art.


page 1

page 2

page 3

page 4


Sampling and Reconstruction of Signals on Product Graphs

In this paper, we consider the problem of subsampling and reconstruction...

Optimal Sensor Placement in Body Surface Networks using Gaussian Processes

This paper explores a new sequential selection framework for the optimal...

A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs

The weighted k-center problem in graphs is a classical facility location...

SsAG: Summarization and sparsification of Attributed Graphs

We present SSAG, an efficient and scalable method for computing a lossy ...

Optimization of Forcemyography Sensor Placement for Arm Movement Recognition

How to design an optimal wearable device for human movement recognition ...

Analysis of Farthest Point Sampling for Approximating Geodesics in a Graph

A standard way to approximate the distance between any two vertices p an...

Cooperative Caching in Fog Radio Access Networks: A Graph-based Approach

In this paper, cooperative caching is investigated in fog radio access n...

Please sign up or login with your details

Forgot password? Click here to reset