Publication
Improving K-means Clustering Using Speculation
Related publications (32)
Fly-Swat or Cannon? Cost-Effective Language Model Choice via Meta-Modeling
Robert West, Maxime Jean Julien Peyrard, Marija Sakota
Generative language models (LMs) have become omnipresent across data science. For a wide variety of tasks, inputs can be phrased as natural language prompts for an LM, from whose output the solution can then be extracted. LM performance has consistently be ...
Assoc Computing Machinery2024Interpret3C: 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 ...
2024Unsupervised Graph Representation Learning with Cluster-aware Self-training and Refining
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 York2023Fairness and Explainability in Clustering Problems
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 ...
EPFL2023Augmented Lagrangian Methods for Provable and Scalable Machine Learning
Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...
EPFL2023Transfer learning application of self-supervised learning in ARPES
There is a growing recognition that electronic band structure is a local property of materials and devices, and there is steep growth in capabilities to collect the relevant data. New photon sources, from small-laboratory-based lasers to free electron lase ...
IOP Publishing Ltd2023Efficient Online Clustering with Moving Costs
Volkan Cevher, Efstratios Panteleimon Skoulakis
In this work we consider an online learning problem, called Online k-Clustering with Moving Costs, at which a learner maintains a set of k facilities over T rounds so as to minimize the connection cost of an adversarially selected sequence of clients. The ...
2023Linearization 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 PUBL2022Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization
Volkan Cevher, Alp Yurtsever, Maria-Luiza Vladarean
We propose a stochastic conditional gradient method (CGM) for minimizing convex finitesum objectives formed as a sum of smooth and non-smooth terms. Existing CGM variants for this template either suffer from slow convergence rates, or require carefully inc ...
2022Subspace 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