Publication

Quantitative estimate on singularities in isoperimetric clusters

Publications associées (42)

Interpret3C: Interpretable Student Clustering Through Individualized Feature Selection

Vinitra Swamy, Paola Mejia Domenzain, Julian Thomas Blackwell, Isadora Alves de Salles

Clustering in education, particularly in large-scale online environments like MOOCs, is essential for understanding and adapting to diverse student needs. However, the effectiveness of clustering depends on its interpretability, which becomes challenging w ...

2024

Fairness and Explainability in Clustering Problems

Xinrui Jia

In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...

EPFL2023

Unsupervised Graph Representation Learning with Cluster-aware Self-training and Refining

Yichen Xu, Qiang Liu, Feng Yu

Unsupervised graph representation learning aims to learn low-dimensional node embeddings without supervision while preserving graph topological structures and node attributive features. Previous Graph Neural Networks (GNN) require a large number of labeled ...

New York2023

Subspace clustering in high-dimensions: Phase transitions & Statistical-to-Computational gap

Florent Gérard Krzakala, Lenka Zdeborová, Luca Pesce, Bruno Loureiro

A simple model to study subspace clustering is the high-dimensional k -Gaussian mixture model where the cluster means are sparse vectors. Here we provide an exact asymptotic characterization of the statistically optimal reconstruction error in this model i ...

2022

Localization errors of the stochastic heat equation

David Jean-Michel Candil

In this thesis, we study the stochastic heat equation (SHE) on bounded domains and on the whole Euclidean space

\R^d.

We confirm the intuition that as the bounded domain increases to the whole space, both solutions become arbitrarily close to one another ...

EPFL2022

A combinatorial proof of a sumset conjecture of Furstenberg

Florian Karl Richter

We give a new proof of a sumset conjecture of Furstenberg that was first proved by Hochman and Shmerkin in 2012: if

\log r / \log s

is irrational and

X

and

Y

are

\times r

- and

\times s

-invariant subsets of

[0,1]

, respectively, then $\dim_\text{ ...

2021

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

Estimate on the Dimension of the Singular Set of the Supercritical Surface Quasigeostrophic Equation

Maria Carola Colombo, Silja Noëmi Aline Haffter

We consider the SQG equation with dissipation given by a fractional Laplacian of order α

2021

Image Clustering Algorithms to Identify Complicated Cerebral Diseases. Description and Comparison

Maria-Alexandra Paun

This article presents two algorithms developed based on two different techniques, from clusterization theory, namely k-means clustering technique and Fuzzy C-means technique, respectively. In this context, the study offers a sustained comparison of the two ...

2020

Perturbative approach to tunneling and quantum interferences in spin clusters

Frédéric Mila, Ivo Aguiar Maceira

Collective tunneling is a ubiquitous phenomenon in finite-size spin clusters that shows up in systems as diverse as molecular magnets or spin clusters adsorbed at surfaces. The basic problem we explore is to understand how small flipping terms can cooperat ...

AMER PHYSICAL SOC2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search