Publications associées à Matrice laplacienne

Random matrix methods for high-dimensional machine learning models

In the rapidly evolving landscape of machine learning research, neural networks stand out with their ever-expanding number of parameters and reliance on increasingly large datasets. The financial cost and computational resources required for the training p ...

EPFL2024

Frustrated magnets in the limit of infinite dimensions: Dynamics and disorder-free glass transition

Achille Mauri

We study the statistical mechanics and the equilibrium dynamics of a system of classical Heisenberg spins with frustrated interactions on a d -dimensional simple hypercubic lattice, in the limit of infinite dimensionality d -> infinity . In the analysis we ...

Amer Physical Soc2024

Spectral Estimators for High-Dimensional Matrix Inference

Farzad Pourkamali

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

EPFL2024

Dispatch-aware Optimal Planning of Active Distribution Networks including Energy Storage Systems

Ji Hyun Yi

The thesis develops a planning framework for ADNs to achieve their dispatchability by means of ESS allocation while ensuring a reliable and secure operation of ADNs. Second, the framework is extended to include grid reinforcements and ESSs planning. Finall ...

EPFL2023

Brain Fingerprinting Using Fmri Spectral Signatures On High-Resolution Cortical Graphs

Dimitri Nestor Alice Van De Ville, Maria Giulia Preti, Hamid Behjat, Stefano Moia, Carlo Ferritto

Resting-state fMRI has proven to entail subject-specific signatures that can serve as a fingerprint to identify individuals. Conventional methods are based on building a connectivity matrix based on correlation between the average time course of pairs of b ...

IEEE2023

Metastability of the Potts Ferromagnet on Random Regular Graphs

Jean Bernoulli Ravelomanana

We study the performance of Markov chains for the q-state ferromagnetic Potts model on random regular graphs. While the cases of the grid and the complete graph are by now well-understood, the case of random regular graphs has resisted a detailed analysis ...

SPRINGER2023

Spectral representation of EEG data using learned graphs with application to motor imagery decoding

Dimitri Nestor Alice Van De Ville, Hamid Behjat, Maliheh Miri

Electroencephalography (EEG) data entail a complex spatiotemporal structure that reflects ongoing organi-zation of brain activity. Characterization of the spatial patterns is an indispensable step in numerous EEG processing pipelines. We present a novel me ...

Elsevier Sci Ltd2023

SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators

Nathanaël Perraudin, Andreas Loukas, Karolis Martinkus

We approach the graph generation problem from a spectral perspective by first generating the dominant parts of the graph Laplacian spectrum and then building a graph matching these eigenvalues and eigenvectors. Spectral conditioning allows for direct model ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

Linearization and Identification of Multiple-Attractor Dynamical Systems through Laplacian Eigenmaps

Aude Billard, Bernardo Fichera

Dynamical Systems (DS) are fundamental to the modeling and understanding time evolving phenomena, and have application in physics, biology and control. As determining an analytical description of the dynamics is often difficult, data-driven approaches are ...

Microtome Publishing2022

Annihilation Filter Approach For Estimating Graph Dynamics From Diffusion Processes

Pascal Frossard, Arun Venkitaraman

We propose an approach for estimating graph diffusion processes using annihilation filters from a finite set of observations of the diffusion process made at regular intervals. Our approach is based on the key observation that a graph diffusion process can ...

IEEE2022

Space-Efficient Representations of Graphs

Jakab Tardos

With the increasing prevalence of massive datasets, it becomes important to design algorithmic techniques for dealing with scenarios where the input to be processed does not fit in the memory of a single machine. Many highly successful approaches have emer ...

EPFL2022

Graph signal processing tailored for subgraph focus and community structure

Miljan Petrovic

Community structure in graph-modeled data appears in a range of disciplines that comprise network science. Its importance relies on the influence it bears on other properties of graphs such as resilience, or prediction of missing connections. Nevertheless, ...

EPFL2022

Statistical limits of dictionary learning: Random matrix theory and the spectral replica method

Nicolas Macris, Jean François Emmanuel Barbier

We consider increasingly complex models of matrix denoising and dictionary learning in the Bayes-optimal setting, in the challenging regime where the matrices to infer have a rank growing linearly with the system size. This is in contrast with most existin ...

AMER PHYSICAL SOC2022

Graph Embedding for Retrieval

Chi Thang Duong

Information retrieval (IR) systems such as search engines are important for people to find what they need among the tremendous amount of data available in their organization or on the Internet. These IR systems enable users to search in a large data collec ...

EPFL2022

Fredholm transformation on Laplacian and rapid stabilization for the heat equation

Shengquan Xiang

We study the rapid stabilization of the heat equation on the 1-dimensional torus using the backstepping method with a Fredholm transformation. This classical framework allows us to present the backstepping method with Fredholm transformations for the Lapla ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

On Preconditioning of Decentralized Gradient-Descent When Solving a System of Linear Equations

Nirupam Gupta

This article considers solving an overdetermined system of linear equations in peer-to-peer multiagent networks. The network is assumed to be synchronous and strongly connected. Each agent has a set of local data points, and their goal is to compute a line ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

TimeEvolver: A program for time evolution with improved error bound

Sebastian Zell

We present TimeEvolver, a program for computing time evolution in a generic quantum system. It relies on well-known Krylov subspace techniques to tackle the problem of multiplying the exponential of a large sparse matrix iH, where His the Hamiltonian, with ...

ELSEVIER2022

Multiscale Representation Learning of Graph Data With Node Affinity

Pascal Frossard, Chenglin Li, Xing Gao

Graph neural networks have emerged as a popular and powerful tool for learning hierarchical representation of graph data. In complement to graph convolution operators, graph pooling is crucial for extracting hierarchical representation of data in graph neu ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Large-Scale Graph Processing on FPGAs with Caches for Thousands of Simultaneous Misses

Paolo Ienne, Mikhail Asiatici

Efficient large-scale graph processing is crucial to many disciplines. Yet, while graph algorithms naturally expose massive parallelism opportunities, their performance is limited by the memory system because of irregular memory accesses. State-of-the-art ...

IEEE COMPUTER SOC2021

Sublinear Algorithms for Spectral Graph Clustering

Aidasadat Mousavifar

This thesis focuses on designing spectral tools for graph clustering in sublinear time. With the emergence of big data, many traditional polynomial time, and even linear time algorithms have become prohibitively expensive. Processing modern datasets requir ...

EPFL2021