Publications related to Graph Spectral Clustering of Convolution Artefacts in Radio Interferometric Images

Related publications (38)

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al

We examine the connection of two graph parameters, the size of a minimum feedback arcs set and the acyclic disconnection. A feedback arc set of a directed graph is a subset of arcs such that after deletion the graph becomes acyclic. The acyclic disconnecti ...

Elsevier2024

The Power of Two Matrices in Spectral Algorithms for Community Recovery

Colin Peter Sandon

Spectral algorithms are some of the main tools in optimization and inference problems on graphs. Typically, the graph is encoded as a matrix and eigenvectors and eigenvalues of the matrix are then used to solve the given graph problem. Spectral algorithms ...

Ieee-Inst Electrical Electronics Engineers Inc2024

On Unigraphic Polyhedra with One Vertexof Degreep-2

Riccardo Walter Maffucci

A sequence sigma of p non-negative integers is unigraphic if it is the degree sequence of exactly one graph, up to isomorphism. A polyhedral graph is a 3-connected, planar graph. We investigate which sequences are unigraphic with respect to the class of po ...

Springer Basel Ag2024

Recovering Static and Time-Varying Communities Using Persistent Edges

Maximilien Claude Robert Dreveton

This article focuses on spectral methods for recovering communities in temporal networks. In the case of fixed communities, spectral clustering on the simple time-aggregated graph (i.e., the weighted graph formed by the sum of the interactions over all tem ...

Ieee Computer Soc2024

In Medio Stat Virtus: Combining Boolean and Pattern Matching

Giovanni De Micheli, Alessandro Tempia Calvino, Gianluca Radi

Technology mapping transforms a technology-independent representation into a technology-dependent one given a library of cells. This process is performed by means of local replacements that are extracted by matching sections of the subject graph to library ...

IEEE2024

Graph generative deep learning models with an application to circuit topologies

Igor Krawczuk

Modern integrated circuits are tiny yet incredibly complex technological artifacts, composed of millions and billions of individual structures working in unison. Managing their complexity and facilitating their design drove part of the co-evolution of mode ...

EPFL2024

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

Nicolas Boumal

Orthogonal group synchronization is the problem of estimating n elements Z(1),& mldr;,Z(n) from the rxr orthogonal group given some relative measurements R-ij approximate to Z(i)Z(j)(-1). The least-squares formulation is nonconvex. To avoid its local minim ...

Siam Publications2024

Connectome embedding in multidimensional graph spaces

Mathieu Mach, Dimitri Nestor Alice Van De Ville, Alessandra Griffa, Maria Giulia Preti, Enrico Amico, Raphaël Pierre Liégeois

Nodal properties are of particular importance when investigating patterns in brain networks. Nodal information is usually studied by comparing a few nodal measurements (up to three), resulting in analyses in three-dimensional spaces, at maximum. We offer a ...

Massachusetts Institute of Technology2024

Unlabeled Principal Component Analysis and Matrix Completion

Yunzhen Yao

We introduce robust principal component analysis from a data matrix in which the entries of its columns have been corrupted by permutations, termed Unlabeled Principal Component Analysis (UPCA). Using algebraic geometry, we establish that UPCA is a well-de ...

Microtome Publishing2024

Non-planarity of Markoff graphs mod p

Matthew De Courcy-Ireland

We prove the non-planarity of a family of 3-regular graphs constructed from the solutions to the Markoff equation x2 + y2 + z2 = xyz modulo prime numbers greater than 7. The proof uses Euler characteristic and an enumeration of the short cycles in these gr ...

European Mathematical Soc-Ems2024

Network-based kinetic models: Emergence of a statistical description of the graph topology

Matteo Raviola

In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific classes of interact ...

Cambridge Univ Press2024

Extending Capabilities of Attention-based Models

Arnaud Pannatier

Deep learning has brought incredible progress in areas where traditional algorithms struggle. It can be because they need rules that are sometimes hard to conceptualize, it can also be that the number and manner of combining these rules are too complex to ...

EPFL2024

Mitigating Object Dependencies: Improving Point Cloud Self-Supervised Learning through Object Exchange

Sabine Süsstrunk, Mathieu Salzmann, Tong Zhang

In the realm of point cloud scene understanding, particularly in indoor scenes, objects are arranged following human habits, resulting in objects of certain semantics being closely positioned and displaying notable inter-object correlations. This can creat ...

2024

FSscore: A Personalized Machine Learning-Based Synthetic Feasibility Score

Bruno Emanuel Ferreira De Sousa Correia, Philippe Schwaller, Rebecca Manuela Neeser

Determining whether a molecule can be synthesized is crucial in chemistry and drug discovery, as it guides experimental prioritization and molecule ranking in de novo design tasks. Existing scoring approaches to assess synthetic feasibility struggle to ext ...

2024

Computational complexity of deep learning: fundamental limitations and empirical phenomena

Ludovic Théo Stephan, Alessandro Favero

This manuscript is the lecture notes of B. Barak’s course in the Les Houches ‘Statistical Physics and Machine Learning’ summer school in 2022. It surveys various proxies for computational hardness in random planted problems, from the low-degree likelihood ...

2024

Uncertainty quantification for a deep learning models for image-based crack segmentation

Onaïa Joseph Savary, Katrin Beyer, Bryan German Pantoja Rosero, Ketson Roberto Maximiano Dos Santos

Recent advancements in deep learning have found compelling applications in the image-based inspection of infrastructure systems. However, the efficacy of these models hinges significantly on the quality and diversity of the input data used for training. In ...

2024

Few-shot Learning for Efficient and Effective Machine Learning Model Adaptation

Arnout Jan J Devos

Machine learning (ML) enables artificial intelligent (AI) agents to learn autonomously from data obtained from their environment to perform tasks. Modern ML systems have proven to be extremely effective, reaching or even exceeding human intelligence. Altho ...

EPFL2024

Aggregating Spatial and Photometric Context for Photometric Stereo

David Honzátko

Photometric stereo, a computer vision technique for estimating the 3D shape of objects through images captured under varying illumination conditions, has been a topic of research for nearly four decades. In its general formulation, photometric stereo is an ...

EPFL2024

Detection of Malicious Agents in Social Learning

Ali H. Sayed, Mert Kayaalp, Valentina Shumovskaia

Non-Bayesian social learning is a framework for distributed hypothesis testing aimed at learning the true state of the environment. Traditionally, the agents are assumed to receive observations conditioned on the same true state, although it is also possib ...

IEEE Institute of Electrical and Electronics Engineers2024

Topics in statistical physics of high-dimensional machine learning

Hugo Chao Cui

In the past few years, Machine Learning (ML) techniques have ushered in a paradigm shift, allowing the harnessing of ever more abundant sources of data to automate complex tasks. The technical workhorse behind these important breakthroughs arguably lies in ...

EPFL2024