

Finding complex patterns in trajectory data via geometric set cover
By Anne Driemel


Wasserstein gradient flows and applications to sampling in machine learning - lecture 1
By Anna Korba
Appears in collection : 2016 - T1 - WS4 - Inference problems theme
A fundamental challenge in processing the massive quantities of information generated by modern applications is in extracting suitable representations of the data that can be stored, manipulated and interrogated on a single machine. A promising approach is in the design and analysis of compact summaries: data structures which capture key features of the data, and which can be created effectively over distributed data sets. Popular summary structures include the count distinct algorithms, which compactly approximate item set cardinalities, and sketches which allow vector norms and products to be estimated. These are very attractive, since they can be computed in parallel and combined to yield a single, compact summary of the data. This talk introduces the concepts and examples of compact summaries as well as some recent developments.