Concept

Oubli

Publications associées (17)

Decoupling the Contributions of Different Instability Mechanisms to the PEMFC Performance Decay of Non-noble Metal O2-Reduction Catalysts

Vasiliki Tileli, Robin Pierre Alain Girod, Secil Unsal

Non-noble metal catalysts (NNMCs) hold the potential to replace the expensive Pt-based materials currently used to speed up the oxygen reduction reaction (ORR) in proton exchange membrane fuel cell (PEMFC) cathodes, but they feature poor durability that in ...

AMER CHEMICAL SOC2023

Ageing and reinforcement learning

Michael Herzog, Wei-Hsiang Lin

Learning to achieve one’s goal in a complex environment is a complicated task. In reinforcement learning (RL) tasks, an agent interacts with the environment to learn optimal actions. In humans, striatal areas are strongly involved in these tasks. During ag ...

2021

Lifelong Machine Learning with Data Efficiency and Knowledge Retention

Fei Mi

Artificial intelligence (AI) and machine learning (ML) have become de facto tools in many real-life applications to offer a wide range of benefits for individuals and our society. A classic ML model is typically trained with a large-scale static dataset in ...

EPFL2021

Probing Context-Dependent Modulations of Ipsilateral Premotor-Motor Connectivity in Relapsing-Remitting Multiple Sclerosis

Estelle Emeline Raffin

Objective: We employed dual-site TMS to test whether ipsilateral functional premotor-motor connectivity is altered in relapsing-remitting Multiple Sclerosis (RR-MS) and is related to central fatigue. Methods: Twelve patients with RR-MS and 12 healthy contr ...

FRONTIERS MEDIA SA2020

Long-term verbal memory deficit and associated hippocampal alterations in 22q11.2 deletion syndrome

Maude Schneider

Chromosome 22q11.2 deletion syndrome (22q11.2DS) is a genetic disease associated with an increased risk for schizophrenia and a specific cognitive profile. In this paper, we challenge the current view of spared verbal memory in 22q11.2DS by investigating v ...

2019

Unified Approach to Convex Robust Distributed Control Given Arbitrary Information Structures

Maryam Kamgarpour, Luca Furieri

We consider the problem of computing optimal linear control policies for linear systems in finite-horizon. The states and the inputs are required to remain inside prespecified safety sets at all times despite unknown disturbances. In this technical note, w ...

2019

System Support for Efficient Replication in Distributed Systems

Dragos-Adrian Seredinschi

Current online applications, such as search engines, social networks, or file sharing services, execute across a distributed network of machines. They provide non-stop services to their users despite failures in the underlying network. To achieve such a hi ...

EPFL2019

A Blueprint for a Blockchain-Based Architecture to Power a Distributed Network of Tamper-Evident Learning Trace Repositories

Denis Gillet, Maria Jesus Rodriguez Triana, Juan Carlos Farah, Andrii Vozniuk

The need to ensure privacy and data protection in educational contexts is driving a shift towards new ways of securing and managing learning records. Although there are platforms available to store educational activity traces outside of a central repositor ...

2018

In the pursuit of the fear engram: identification of neuronal circuits underlying the treatment of anxiety disorder

Ossama Mohamed Salah El-Dien El-Sayed Ibrahim Khalaf

Fear and other anxiety disorders are extraordinarily robust and difficult to treat. Among the most effective treatments for anxiety disorders are exposure-based therapies, during which a patient is repeatedly confronted with the originally fear-eliciting s ...

EPFL2017

Time-Varying Gaussian Process Bandit Optimization

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic

We consider the sequential Bayesian optimization problem with bandit feedback, adopting a formulation that allows for the reward function to vary with time. We model the reward function using a Gaussian process whose evolution obeys a simple Markov model. ...

2016

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