Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Méthode des k plus proches voisins

Publications associées (31)

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

Boosting likelihood learning with event reweighting

Andrea Wulzer, Alfredo Glioti, Siyu Chen

Extracting maximal information from experimental data requires access to the likelihood function, which however is never directly available for complex experiments like those performed at high energy colliders. Theoretical predictions are obtained in this ...

Springer Nature2024

Improving K-means Clustering Using Speculation

Anastasia Ailamaki, Viktor Sanca, Eleni Zapridou, Stefan Igescu

K-means is one of the fundamental unsupervised data clustering and machine learning methods. It has been well studied over the years: parallelized, approximated, and optimized for different cases and applications. With increasingly higher parallelism leadi ...

2023

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

Robust Collaborative Learning with Linear Gradient Overhead

Rachid Guerraoui, Nirupam Gupta, Rafaël Benjamin Pinot, Le Nguyen Hoang, Sadegh Farhadkhani, John Stephan

Collaborative learning algorithms, such as distributed SGD (or D-SGD), are prone to faulty machines that may deviate from their prescribed algorithm because of software or hardware bugs, poisoned data or malicious behaviors. While many solutions have been ...

PLMR2023

Transfer learning application of self-supervised learning in ARPES

Gabriel Aeppli

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 Ltd2023

Euclid preparation XXII. Selection of quiescent galaxies from mock photometry using machine learning

Maurizio Martinelli, Frédéric Courbin, Georges Meylan, Gianluca Castignani, Austin Chandler Peel

The Euclid Space Telescope will provide deep imaging at optical and near-infrared wavelengths, along with slitless near-infrared spectroscopy, across similar to 15 000deg(2) of the sky. Euclid is expected to detect similar to 12 billion astronomical source ...

EDP SCIENCES S A2023

Bayes-optimal Learning of Deep Random Networks of Extensive-width

Lenka Zdeborová, Florent Gérard Krzakala, Hugo Chao Cui

We consider the problem of learning a target function corresponding to a deep, extensive-width, non-linear neural network with random Gaussian weights. We consider the asymptotic limit where the number of samples, the input dimension and the network width ...

2023

Stay close, but not too close: aerial image analysis reveals patterns of social distancing in seal colonies

Devis Tuia, Benjamin Alexander Kellenberger

Many species aggregate in dense colonies. Species-specific spatial patterns provide clues about how colonies are shaped by various (a)biotic factors, including predation, temperature regulation or disease transmission. Using aerial imagery, we examined the ...

2023

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Yunus Inan

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

EPFL2023

Self-Supervised Bayesian representation learning of acoustic emissions from laser powder bed Fusion process for in-situ monitoring

Christian Leinenbach, Sergey Shevchik

This study presents a self-supervised Bayesian Neural Network (BNN) framework using air-borne Acoustic Emission (AE) to identify different Laser Powder Bed Fusion (LPBF) process regimes such as Lack of Fusion, conduction mode, and keyhole without ground-tr ...

Elsevier Sci Ltd2023

Polynomial-time universality and limitations of deep learning

Emmanuel Abbé

The goal of this paper is to characterize function distributions that general neural networks trained by descent algorithms (GD/SGD), can or cannot learn in polytime. The results are: (1) The paradigm of general neural networks trained by SGD is poly-time ...

WILEY2023

AutoSynth: Learning to Generate 3D Training Data for Object Point Cloud Registration

Mathieu Salzmann, Zheng Dang

In the current deep learning paradigm, the amount and quality of training data are as critical as the network architecture and its training details. However, collecting, processing, and annotating real data at scale is difficult, expensive, and time-consum ...

Ieee Computer Soc2023

Using machine learning to generate an open-access cropland map from satellite images time series in the Indian Himalayan region

Danya Li

Crop maps are crucial for agricultural monitoring and food management and can additionally support domain-specific applications, such as setting cold supply chain infrastructure in developing countries. Machine learning (ML) models, combined with freely-av ...

Elsevier2023

On Generalizations of Some Distance Based Classifiers for HDLSS Data

Soham Sarkar

In high dimension, low sample size (HDLSS) settings, classifiers based on Euclidean distances like the nearest neighbor classifier and the average distance classifier perform quite poorly if differences between locations of the underlying populations get m ...

Microtome Publishing2022

Sketches, metrics and fast algorithms

Navid Nouri

As it has become easier and cheaper to collect big datasets in the last few decades, designing efficient and low-cost algorithms for these datasets has attracted unprecedented attention. However, in most applications, even storing datasets as acquired has ...

EPFL2022

A lightweight learning-based decoding algorithm for intraneural vagus nerve activity classification in pigs

Silvestro Micera, Ivo Strauss, Leonardo Pollina

Objective. Bioelectronic medicine is an emerging field that aims at developing closed-loop neuromodulation protocols for the autonomic nervous system (ANS) to treat a wide range of disorders. When designing a closed-loop protocol for real time modulation o ...

IOP Publishing Ltd2022

Single-Trace Clustering Power Analysis of the Point-Swapping Procedure in the Three Point Ladder of Cortex-M4 SIKE

Aymeric Genet, Novak Kaluderovic

In this paper, the recommended implementation of the post-quantum key exchange SIKE for Cortex-M4 is attacked through power analysis with a single trace by clustering with the k-means algorithm the power samples of all the invocations of the elliptic curve ...

Springer, Cham2022

Tests of mutual independence among several random vectors using univariate and multivariate ranks of nearest neighbours

Soham Sarkar

Testing mutual independence among several random vectors of arbitrary dimensions is a challenging problem in Statistics, and it has gained considerable interest in recent years. In this article, we propose some nonparametric tests based on different notion ...

TAYLOR & FRANCIS LTD2021

Cluster-and-Conquer: When Randomness Meets Graph Locality

Anne-Marie Kermarrec

K-Nearest-Neighbors (KNN) graphs are central to many emblematic data mining and machine-learning applications. Some of the most efficient KNN graph algorithms are incremental and local: they start from a random graph, which they incrementally improve by tr ...

IEEE COMPUTER SOC2021