Publications related to Online machine learning

Byzantine Machine Learning: A Primer

Rachid Guerraoui, Nirupam Gupta, Rafaël Benjamin Pinot

The problem of Byzantine resilience in distributed machine learning, a.k.a., Byzantine machine learning, consists in designing distributed algorithms that can train an accurate model despite the presence of Byzantine nodes, i.e., nodes with corrupt data or ...

2023

Adversarial Training Should Be Cast As a Non-Zero-Sum Game

Volkan Cevher, Seyed Hamed Hassani, Fabian Ricardo Latorre Gomez

One prominent approach toward resolving the adversarial vulnerability of deep neural networks is the two-player zero-sum paradigm of adversarial training, in which predictors are trained against adversarially-chosen perturbations of data. Despite the promi ...

2023

DiGress: Discrete Denoising diffusion for graph generation

Pascal Frossard, Volkan Cevher, Igor Krawczuk, Bohan Wang, Clément Arthur Yvon Vignac

This work introduces DiGress, a discrete denoising diffusion model for generating graphs with categorical node and edge attributes. Our model utilizes a discrete diffusion process that progressively edits graphs with noise, through the process of adding or ...

2023

Penalising the biases in norm regularisation enforces sparsity

Nicolas Henri Bernard Flammarion, Etienne Patrice Boursier

Controlling the parameters' norm often yields good generalisation when training neural networks. Beyond simple intuitions, the relation between parameters' norm and obtained estimators theoretically remains misunderstood. For one hidden ReLU layer networks ...

2023

Computationally Efficient Reinforcement Learning: Targeted Exploration leveraging Simple Rules

Colin Neil Jones, Bratislav Svetozarevic, Loris Di Natale

Model-free Reinforcement Learning (RL) generally suffers from poor sample complexity, mostly due to the need to exhaustively explore the state-action space to find well-performing policies. On the other hand, we postulate that expert knowledge of the syste ...

2023

Stochastic Second-Order Methods Improve Best-Known Sample Complexity of SGD for Gradient-Dominated Function

Patrick Thiran, Negar Kiyavash, Saber Salehkaleybar

We study the performance of Stochastic Cubic Regularized Newton (SCRN) on a class of functions satisfying gradient dominance property with

1\le\alpha\le2

which holds in a wide range of applications in machine learning and signal processing. This conditio ...

NeurIPS2022

Nine recommendations for the governance of AI systems

Marie-Valentine Renée Agnès Florin

Some governance functions traditionally performed by humans are increasingly informed and sometimes automatically executed by machine learning algorithms (governance by machine learning) to benefit society. Therefore, it is necessary to think also about th ...

EPFL2022

Using Machine Learning to Predict Mortality for COVID-19 Patients on Day 0 in the ICU

Nahal Mansouri, Sahand Jamal Rahi

Rationale: Given the expanding number of COVID-19 cases and the potential for new waves of infection, there is an urgent need for early prediction of the severity of the disease in intensive care unit (ICU) patients to optimize treatment strategies.Objecti ...

FRONTIERS MEDIA SA2022

ADER: Adaptively Distilled Exemplar Replay Towards Continual Learning for Session-based Recommendation

Boi Faltings, Fei Mi, Xiaoyu Lin

Session-based recommendation has received growing attention recently due to the increasing privacy concern. Despite the recent success of neural session-based recommenders, they are typically developed in an offline manner using a static dataset. However, ...

ACM2022

Faster 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 ...

2022

Online machine learning

Graph Chatbot

Chat with Graph Search

Byzantine Machine Learning: A Primer

Adversarial Training Should Be Cast As a Non-Zero-Sum Game

DiGress: Discrete Denoising diffusion for graph generation

Penalising the biases in norm regularisation enforces sparsity

Computationally Efficient Reinforcement Learning: Targeted Exploration leveraging Simple Rules

Stochastic Second-Order Methods Improve Best-Known Sample Complexity of SGD for Gradient-Dominated Function

Nine recommendations for the governance of AI systems

Using Machine Learning to Predict Mortality for COVID-19 Patients on Day 0 in the ICU

ADER: Adaptively Distilled Exemplar Replay Towards Continual Learning for Session-based Recommendation

Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization

Adversarial Training Should Be Cast As a Non-Zero-Sum Game

Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization

Stochastic Second-Order Methods Improve Best-Known Sample Complexity of SGD for Gradient-Dominated Function

Computationally Efficient Reinforcement Learning: Targeted Exploration leveraging Simple Rules

Byzantine Machine Learning: A Primer

Penalising the biases in norm regularisation enforces sparsity

DiGress: Discrete Denoising diffusion for graph generation

Nine recommendations for the governance of AI systems

Using Machine Learning to Predict Mortality for COVID-19 Patients on Day 0 in the ICU

ADER: Adaptively Distilled Exemplar Replay Towards Continual Learning for Session-based Recommendation