Concept

Learning rate

Related publications (200)

Graph-Homomorphic Perturbations For Private Decentralized Learning

Decentralized algorithms for stochastic optimization and learning rely on the diffusion of information through repeated local exchanges of intermediate estimates. Such structures are particularly appealing in situations where agents may be hesitant to shar ...

IEEE2021

LENA: Communication-Efficient Distributed Learning with Self-Triggered Gradient Uploads

Martin Jaggi, Sebastian Urban Stich, Hossein Shokri Ghadikolaei

In distributed optimization, parameter updates from the gradient computing node devices have to be aggregated in every iteration on the orchestrating server. When these updates are sent over an arbitrary commodity network, bandwidth and latency can be limi ...

MICROTOME PUBLISHING2021

Plasma confinement mode classification using a sequence-to-sequence neural network with attention

Alessandro Pau

In a typical fusion experiment, the plasma can have several possible confinement modes. At the tokamak a configuration variable, aside from the low (L) and high (H) confinement modes, an additional mode, dithering (D), is frequently observed. Developing me ...

2021

Interpreting deep learning models for epileptic seizure detection on EEG signals

David Atienza Alonso, Marina Zapater Sancho, Tomas Teijeiro Campo, Valentin Alexandre Guy Gabeff, Leila Cammoun

While Deep Learning (DL) is often considered the state-of-the art for Artificial Intelligence-based medical decision support, it remains sparsely implemented in clinical practice and poorly trusted by clinicians due to insufficient interpretability of neur ...

2021

On Convergence-Diagnostic based Step Sizes for Stochastic Gradient Descent

Nicolas Henri Bernard Flammarion, Scott William Pesme, Aymeric Daphnis Kévin Dieuleveut

Constant step-size Stochastic Gradient Descent exhibits two phases: a transient phase during which iterates make fast progress towards the optimum, followed by a stationary phase during which iterates oscillate around the optimal point. In this paper, we s ...

2020

On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems

Volkan Cevher, Ali Kavis, Shaul Nadav Hallak

This paper analyzes the trajectories of stochastic gradient descent (SGD) to help understand the algorithm’s convergence properties in non-convex problems. We first show that the sequence of iterates generated by SGD remains bounded and converges with prob ...

2020

Roundtable Panel Discussion at DAC 2019: Evolutionary Computing or Heuristic Forever?

Giovanni De Micheli, Massimiliano Di Ventra

As demands for computing have been continuously increasing, various solutions have been proposed. Some approaches deal with improving algorithms and software programs, mainly through the tuning of advanced heuristics and learning methods. Some other tackle ...

2020

Dynamic Federated Learning

Ali H. Sayed, Stefan Vlaski, Elsa Rizk

Federated learning has emerged as an umbrella term for centralized coordination strategies in multi-agent environments. While many federated learning architectures process data in an online manner, and are hence adaptive by nature, most performance analyse ...

IEEE2020

Deep learning tools for the measurement of animal behavior in neuroscience

Alexander Mathis, Mackenzie Mathis

Recent advances in computer vision have made accurate, fast and robust measurement of animal behavior a reality. In the past years powerful tools specifically designed to aid the measurement of behavior have come to fruition. Here we discuss how capturing ...

2020

Age-Dependent Statistical Learning Trajectories Reveal Differences in Information Weighting

Steffen Alexander Herff

Statistical learning (SL) is the ability to generate predictions based on probabilistic dependencies in the environment, an ability that is present throughout life. The effect of aging on SL is still unclear. Here, we explore statistical learning in health ...

AMER PSYCHOLOGICAL ASSOC2020

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.