Publication

Motivic Donaldson-Thomas invariants for the one-loop quiver with potential

Publications associées (30)

Robust and Efficient Data Clustering with Signal Processing on Graphs

Data is pervasive in today's world and has actually been for quite some time. With the increasing volume of data to process, there is a need for faster and at least as accurate techniques than what we already have. In particular, the last decade recorded t ...

EPFL2018

Applying dimension reduction to EEG data by Principal Component Analysis reduces the quality of its subsequent Independent Component decomposition

Fiorenzo Artoni

Independent Component Analysis (ICA) has proven to be an effective data driven method for analyzing EEG data, separating signals from temporally and functionally independent brain and non-brain source processes and thereby increasing their definition. Dime ...

2018

Testing Graph Clusterability: Algorithms and Lower Bounds

Mikhail Kapralov, Aidasadat Mousavifar, Ashish Hari Chiplunkar

We consider the problem of testing graph cluster structure: given access to a graph G = (V, E), can we quickly determine whether the graph can be partitioned into a few clusters with good inner conductance, or is far from any such graph? This is a generali ...

IEEE COMPUTER SOC2018

Low-dimensional data embedding for scalable astronomical imaging in the SKA telescope era

Vijay Kartik

Astronomy is one of the oldest sciences known to humanity. We have been studying celestial objects for millennia, and continue to peer deeper into space in our thirst for knowledge about our origins and the universe that surrounds us. Radio astronomy -- ob ...

EPFL2018

Spectrally approximating large graphs with smaller graphs

Pierre Vandergheynst, Andreas Loukas

How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to depend on standard ...

2018

Graph-based Methods for Visualization and Clustering

Johann Paratte

The amount of data that we produce and consume is larger than it has been at any point in the history of mankind, and it keeps growing exponentially. All this information, gathered in overwhelming volumes, often comes with two problematic characteristics: ...

EPFL2017

Graph-based structures in data science : fundamental limits and applications to machine learning

Nathanaël Perraudin

State-of-the-art data analysis tools have to deal with high-dimensional data. Fortunately, the inherent dimensionality of data is often much smaller, as it has an internal structure limiting its degrees of freedom. In most cases, this structure can be appr ...

EPFL2017

Fourier dimensionality reduction of radio-interferometric data

Jean-Philippe Thiran, Yves Wiaux, Rafael Eduardo Carrillo Rangel, Vijay Kartik

Next-generation radio-interferometers face a computing challenge with respect to the imaging techniques that can be applied in the big data setting in which they are designed. Dimensionality reduction can thus provide essential savings of computing resourc ...

2017

A Fourier dimensionality reduction model for big data interferometric imaging

Jean-Philippe Thiran, Yves Wiaux, Rafael Eduardo Carrillo Rangel, Vijay Kartik

Data dimensionality reduction in radio interferometry can provide savings of computational resources for image reconstruction through reduced memory footprints and lighter computations per iteration, which is important for the scalability of imaging method ...

Oxford Univ Press2017

Scalable Low-rank Matrix and Tensor Decomposition on Graphs

Nauman Shahid

In many signal processing, machine learning and computer vision applications, one often has to deal with high dimensional and big datasets such as images, videos, web content, etc. The data can come in various forms, such as univariate or multivariate time ...

EPFL2017