Publications associées à Recherche dichotomique

Augmented Memory: Sample-Efficient Generative Molecular Design with Reinforcement Learning

Sample efficiency is a fundamental challenge in de novo molecular design. Ideally, molecular generative models should learn to satisfy a desired objective under minimal calls to oracles (computational property predictors). This problem becomes more apparen ...

Amer Chemical Soc2024

Stochastic Models for Comparison-based Search

Daniyar Chumbalov

In this thesis we study a problem of searching in a space of objects using comparisons. To navigate through the space to the target object

t

, we ask a sequence of questions of the form ``which object

i

or

j

is closer to

t

?'' for which we observe no ...

EPFL2023

Price Discrimination with Robust Beliefs

Thomas Alois Weber, Jun Han

This paper considers the problem of second-degree price discrimination when the type distribution is unknown or imperfectly specified by means of an ambiguity set. As robustness measure we use a performance index, equivalent to relative regret, which quant ...

2023

The splay-list: a distribution-adaptive concurrent skip-list

Amirkeivan Mohtashami, Dan Alistarh

The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often ...

SPRINGER2023

Hardware-Software Co-design for Improved Resource Utilization in DNN Accelerators

Ahmet Caner Yüzügüler

Deep neural networks (DNN) have become an essential tool to tackle challenging tasks in many fields of computer science. However, their high computational complexity limits their applicability. Specialized DNN accelerators have been developed to accommodat ...

EPFL2023

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

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

Targeted search for scaling genes reveals matrix metalloproteinase 3 as a scaler of the dorsal-ventral pattern in Xenopus laevis embryos

Daria Korotkova

How embryos scale patterning according to size is still not fully understood. Through in silico screening and analysis of reaction-diffusion systems that could be responsible for scaling, we predicted the existence of genes whose expression is sensitive to ...

Cell Press - Elsevier2022

Sequential metric dimension for random graphs

Patrick Thiran, Gergely Odor

In the localization game on a graph, the goal is to find a fixed but unknown target node v* with the least number of distance queries possible. In the j-th step of the game, the player queries a single node v_j and receives, as an answer to their query, th ...

2021

Metric dimension of critical Galton–Watson trees and linear preferential attachment trees

Gergely Odor

The metric dimension of a graph G is the minimal size of a subset R of vertices of G that, upon reporting their graph distance from a distinguished (source) vertex v⋆, enable unique identification of the source vertex v⋆ among all possible vertices of G. I ...

2021

Landmark Regularization: Ranking Guided Super-Net Training in Neural Architecture Search

Mathieu Salzmann, Kaicheng Yu

Weight sharing has become a de facto standard in neural architecture search because it enables the search to be done on commodity hardware. However, recent works have empirically shown a ranking disorder between the performance of stand-alone architectures ...

IEEE COMPUTER SOC2021

Scalable and Efficient Comparison-based Search without Features

Matthias Grossglauser, Lucas Maystre, Daniyar Chumbalov

We consider the problem of finding a target object t using pairwise comparisons, by asking an oracle questions of the form “Which object from the pair (i, j) is more similar to t?”. Objects live in a space of latent features, from which the oracle generate ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2020

Square Attack: a query-efficient black-box adversarial attack via random search

Nicolas Henri Bernard Flammarion, Maksym Andriushchenko, Francesco Croce

We propose the Square Attack, a new score-based black-box

l_2

and

l_\infty

adversarial attack that does not rely on local gradient information and thus is not affected by gradient masking. The Square Attack is based on a randomized search scheme where ...

2020

Kernel Density Estimation through Density Constrained Near Neighbor Search

Mikhail Kapralov, Navid Nouri

In this paper we revisit the kernel density estimation problem: given a kernel K(x, y) and a dataset of n points in high dimensional Euclidean space, prepare a data structure that can quickly output, given a query q, a (1 + epsilon)-approximation to mu := ...

IEEE2020

A Fast, Reliable and Wide-voltage-range In-memory Computing Architecture

David Atienza Alonso, Marina Zapater Sancho, Alexandre Sébastien Julien Levisse, William Andrew Simon

In-Memory Computing (IMC) solutions, and particularly bitline computing in SRAM, appear promising as they mitigate one of the most energy consuming aspects in computation: data movement. In this work we propose a fast (2.4Ghz for bitwise operations and 2.4 ...

Association for Computing Machinery2019

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

Hakan Gökcesu, Kaan Gökcesu

We propose an online algorithm for sequential learning in the contextual multiarmed bandit setting. Our approach is to partition the context space and, then, optimally combine all of the possible mappings between the partition regions and the set of bandit ...

2019

Precision Global Health - The case of Ebola: a scoping review

Gérard Escher

Background The 2014-2016 Ebola outbreak across West Africa was devastating, acting not only as a wake-up call for the global health community, but also as a catalyst for innovative change and global action. Improved infectious disease monitoring is the ste ...

2019

Search for the lepton-flavor-violating decay B-0 -> K-*0 mu(+/-)e(-/+)

Olivier Schneider, Roberto Gargiani, Yiming Li, Mingkui Wang, Gaétan Charles Antoine Giriat, Sun Hee Kim, Chao Wang, Tagir Aushev, Tara Nanut, Chang-Hyun Park, Seyed Sina Mirrazavi Salehian, Hiroyasu Yamamoto, Jun Yong Kim, Arnaud Michel Gelb, Ji Hyun Kim, Taoufiq Harach, Donghyun Kim, Yong Chan Choi, Linlin Cao, Martin Lubej, Xiao Wang, Jiayun Shen, Lei Li

We have searched for the lepton-flavor-violating decay B-0 -> K-*0 mu(+/-)e(-/+) using a data sample of 711 fb(-1) that contains 772 x 10(6) B (B) over bar pairs. The data were collected near the Upsilon(4S) resonance with the Belle detector at the KEKB as ...

American Physical Society2018

Actuator Layout Optimization for Adaptive Structures Performing Large Shape Changes, Advanced Computing Strategies for Engineering

Ian Smith, Gennaro Senatore, Arka Prabhata Reksowardojo

Adaptive structures are sensed and actuated to modify internal forces and shape to maintain optimal performance in response to loads. The use of large shape changes as a structural adaptation strategy to counteract the effect of loads has been investigated ...

2018

Block Oriented Programming: Automating Data-Only Attacks

Mathias Josef Payer

With the widespread deployment of Control-Flow Integrity (CFI), control-flow hijacking attacks, and consequently code reuse attacks, are significantly more difficult. CFI limits control flow to well-known locations, severely restricting arbitrary code exec ...

ASSOC COMPUTING MACHINERY2018