87 research outputs found
Encoding Robust Representation for Graph Generation
Generative networks have made it possible to generate meaningful signals such
as images and texts from simple noise. Recently, generative methods based on
GAN and VAE were developed for graphs and graph signals. However, the
mathematical properties of these methods are unclear, and training good
generative models is difficult. This work proposes a graph generation model
that uses a recent adaptation of Mallat's scattering transform to graphs. The
proposed model is naturally composed of an encoder and a decoder. The encoder
is a Gaussianized graph scattering transform, which is robust to signal and
graph manipulation. The decoder is a simple fully connected network that is
adapted to specific tasks, such as link prediction, signal generation on graphs
and full graph and signal generation. The training of our proposed system is
efficient since it is only applied to the decoder and the hardware requirements
are moderate. Numerical results demonstrate state-of-the-art performance of the
proposed system for both link prediction and graph and signal generation.Comment: 9 pages, 7 figures, 6 table
Median K-flats for hybrid linear modeling with many outliers
We describe the Median K-Flats (MKF) algorithm, a simple online method for
hybrid linear modeling, i.e., for approximating data by a mixture of flats.
This algorithm simultaneously partitions the data into clusters while finding
their corresponding best approximating l1 d-flats, so that the cumulative l1
error is minimized. The current implementation restricts d-flats to be
d-dimensional linear subspaces. It requires a negligible amount of storage, and
its complexity, when modeling data consisting of N points in D-dimensional
Euclidean space with K d-dimensional linear subspaces, is of order O(n K d D+n
d^2 D), where n is the number of iterations required for convergence
(empirically on the order of 10^4). Since it is an online algorithm, data can
be supplied to it incrementally and it can incrementally produce the
corresponding output. The performance of the algorithm is carefully evaluated
using synthetic and real data
- …