Concept

Bandit manchot (mathématiques)

Publications associées (85)

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

Multi-agent actor-critic with time dynamical opponent model

Olga Fink, Qin Wang

In multi-agent reinforcement learning, multiple agents learn simultaneously while interacting with a common environment and each other. Since the agents adapt their policies during learning, not only the behavior of a single agent becomes non-stationary, b ...

ELSEVIER2023

On the (In)security of Peer-to-Peer Decentralized Machine Learning

Carmela González Troncoso, Mathilde Aliénor Raynal, Dario Pasquini

In this work, we carry out the first, in-depth, privacy analysis of Decentralized Learning-a collaborative machine learning framework aimed at addressing the main limitations of federated learning. We introduce a suite of novel attacks for both passive and ...

IEEE COMPUTER SOC2023

Predictive health assessment for lithium-ion batteries with probabilistic degradation prediction and accelerating aging detection

Florent Evariste Forest, Yunhong Che

Predictive health assessment is of vital importance for smarter battery management to ensure optimal and safe operations and thus make the most use of battery life. This paper proposes a general framework for battery aging prognostics in order to provide t ...

London2023

No-regret learning in games with noisy feedback: Faster rates and adaptivity via learning rate separation

Volkan Cevher, Kimon Antonakopoulos, Ya-Ping Hsieh

We examine the problem of regret minimization when the learner is involved in a continuous game with other optimizing agents: in this case, if all players follow a no-regret algorithm, it is possible to achieve significantly lower regret relative to fully ...

2022

Efficient Model-based Multi-agent Reinforcement Learning via Optimistic Equilibrium Computation

Maryam Kamgarpour, Andreas Krause

We consider model-based multi-agent reinforcement learning, where the environment transition model is unknown and can only be learned via expensive interactions with the environment. We propose H-MARL (Hallucinated Multi-Agent Reinforcement Learning), a no ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

Learning Disentangled Behaviour Patterns for Wearable-based Human Activity Recognition

Tao Lin

In wearable-based human activity recognition (HAR) research, one of the major challenges is the large intra-class variability problem. The collected activity signal is often, if not always, coupled with noises or bias caused by personal, environmental, or ...

ASSOC COMPUTING MACHINERY2022

Personalized Productive Engagement Recognition in Robot-Mediated Collaborative Learning

Barbara Bruno, Jauwairia Nasir

In this paper, we propose and compare personalized models for Productive Engagement (PE) recognition. PE is defined as the level of engagement that maximizes learning. Previously, in the context of robot-mediated collaborative learning, a framework of prod ...

2022

Trace norm regularization for multi-task learning with scarce data

Nicolas Henri Bernard Flammarion, Etienne Patrice Boursier, Mikhail Konobeev

Multi-task learning leverages structural similarities between multiple tasks to learn despite very few samples. Motivated by the recent success of neural networks applied to data-scarce tasks, we consider a linear low-dimensional shared representation mode ...

2022

Towards Verifiable, Generalizable and Efficient Robust Deep Neural Networks.

Chen Liu

In the last decade, deep neural networks have achieved tremendous success in many fields of machine learning.However, they are shown vulnerable against adversarial attacks: well-designed, yet imperceptible, perturbations can make the state-of-the-art deep ...

EPFL2022

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search