Publications associées à Sample maximum and minimum

DESI mock challenge Halo and galaxy catalogues with the bias assignment method

Context. We present a novel approach to the construction of mock galaxy catalogues for large-scale structure analysis based on the distribution of dark matter halos obtained with effective bias models at the field level. Aims. We aim to produce mock galaxy ...

EDP SCIENCES S A2023

Stop Wasting my FLOPS: Improving the Efficiency of Deep Learning Models

Angelos Katharopoulos

Deep neural networks have completely revolutionized the field of machine learning by achieving state-of-the-art results on various tasks ranging from computer vision to protein folding. However, their application is hindered by their large computational an ...

EPFL2022

A Methodology for Evaluating the Robustness of Anomaly Detectors to Adversarial Attacks in Industrial Scenarios

Javier Alejandro Maroto Morales

Anomaly Detection systems based on Machine and Deep learning are the most promising solutions to detect cyberattacks in the industry. However, these techniques are vulnerable to adversarial attacks that downgrade prediction performance. Several techniques ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Assessing normalization methods in mass spectrometry-based proteome profiling of clinical samples

Loïc Dayon

Background: Large-scale proteomic studies have to deal with unwanted variability, especially when samples originate from different centers and multiple analytical batches are needed. Such variability is typically added throughout all the steps of a clinica ...

ELSEVIER SCI LTD2022

High spatial resolution dataset of La Mobiliere insurance customers

Claudia Rebeca Binder Signer, Emanuele Massaro

We present the La Mobiliere insurance customers dataset: a 12-year-long longitudinal collection of data on policies of customers of the Swiss insurance company La Mobiliere. To preserve the privacy of La Mobiliere customers, we propose the data aggregated ...

NATURE PORTFOLIO2022

Locally Differentially-Private Randomized Response for Discrete Distribution Learning

Michael Christoph Gastpar, Adriano Pastore

We consider a setup in which confidential i.i.d. samples X1, . . . , Xn from an unknown finite-support distribution p are passed through n copies of a discrete privatization chan- nel (a.k.a. mechanism) producing outputs Y1, . . . , Yn. The channel law gua ...

2021

Uncertain Sampling with Certain Priors

Golnooshsadat Elhami

Sampling has always been at the heart of signal processing providing a bridge between the analogue world and discrete representations of it, as our ability to process data in continuous space is quite limited. Furthermore, sampling plays a key part in unde ...

EPFL2021

Minimum-Error Classes for Matching Parts

Thomas Alois Weber

This paper examines the binning of two types of parts with random characteristics, so that a componentwise monotonic evaluation criterion exhibits a minimum deviation to a given target value over all possible realizations. The optimal matching classes are ...

2021

On Perfect Clustering of High Dimension, Low Sample Size Data

Soham Sarkar

Popular clustering algorithms based on usual distance functions (e.g., the Euclidean distance) often suffer in high dimension, low sample size (HDLSS) situations, where concentration of pairwise distances and violation of neighborhood structure have advers ...

IEEE COMPUTER SOC2020

Graph Laplacian Mixture Model

Pascal Frossard, Hermina Petric Maretic

Graph learning methods have recently been receiving increasing interest as means to infer structure in datasets. Most of the recent approaches focus on different relationships between a graph and data sample distributions, mostly in settings where all avai ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Multivariate extremes over a random number of observations

Simone Padoan, Stefano Rizzelli

The classical multivariate extreme-value theory concerns the modeling of extremes in a multivariate random sample, suggesting the use of max-stable distributions. In this work, the classical theory is extended to the case where aggregated data, such as max ...

WILEY2021

Strong convergence of multivariate maxima

Simone Padoan, Stefano Rizzelli

It is well known and readily seen that the maximum of n independent and uniformly on [0, 1] distributed random variables, suitably standardised, converges in total variation distance, as n increases, to the standard negative exponential distribution. We ex ...

CAMBRIDGE UNIV PRESS2020

Data-Aware Privacy-Preserving Machine Learning

Aleksei Triastcyn

In this thesis, we focus on the problem of achieving practical privacy guarantees in machine learning (ML), where the classic differential privacy (DP) fails to maintain a good trade-off between user privacy and data utility. Differential privacy guarantee ...

EPFL2020

Adversarial Analytics

Viet Anh Nguyen

Adversarial learning is an emergent technique that provides better security to machine learning systems by deliberately protecting them against specific vulnerabilities of the learning algorithms. Many adversarial learning problems can be cast equivalently ...

EPFL2019

A toolkit for multi-scale mapping of the solar energy-generation potential of buildings in urban environments under uncertainty

Marilyne Andersen, Emmanuel Rey, Giuseppe Peronato, Parag Rastogi

Many municipalities and public authorities have supported the creation of solar cadastres to map the solar energy-generation potential of existing buildings. Despite advancements in modelling solar potential, most of these tools provide simple evaluations ...

2018

Stochastic vs. sensitivity-based integral parameter and nuclear data adjustments

Andreas Pautz, Daniel Jerôme Siefman, Mathieu Hursin, Dimitri Rochman

Developments in data assimilation theory allow to adjust integral parameters and cross sections with stochastic sampling. This work investigates how two stochastic methods, MOCABA and BMC, perform relative to a sensitivity-based methodology called GLLS. St ...

SPRINGER HEIDELBERG2018

Sampling at unknown locations: Uniqueness and reconstruction under constraints

Martin Vetterli, Benjamin Bejar Haro, Adam James Scholefield, Golnooshsadat Elhami, Michalina Wanda Pacholska

Traditional sampling results assume that the sample locations are known. Motivated by simultaneous localization and mapping (SLAM) and structure from motion (SfM), we investigate sampling at unknown locations. Without further constraints, the problem is of ...

2018

Improving Spatial Data Processing by Clipping Minimum Bounding Boxes

Anastasia Ailamaki, Darius Sidlauskas, Eleni Tzirita Zacharatou

The majority of spatial processing techniques rely heavily on the idea of approximating each group of spatial objects by their minimum bounding box (MBB). As each MBB is compact to store (requiring only two multi-dimensional points) and intersection tests ...

IEEE2018

Handheld reflectance acquisition of paintings

Martin Vetterli, Sabine Süsstrunk, Loïc Arnaud Baboulaz, Damien Firmenich, Niranjan Thanikachalam

Relightable photographs are alternatives to traditional photographs as they provide a richer viewing experience. However, the complex acquisition systems of existing techniques have restricted its usage to specialized setups. We introduce an easy-to-use an ...

Ieee-Inst Electrical Electronics Engineers Inc2017

Approximate maximum likelihood estimation for population genetic inference

Gregory Bruce Ewing

In many population genetic problems, parameter estimation is obstructed by an intractable likelihood function. Therefore, approximate estimation methods have been developed, and with growing computational power, sampling-based methods became popular. Howev ...

De Gruyter2017