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.
We address the problem of learning a classifier from distributed data over a number of arbitrarily connected machines without exchange of the datapoints. Our purpose is to train a neural network at each machine as if the entire dataset was locally availabl ...
We propose an algorithm to learn from distributed data on a network of arbitrarily connected machines without exchange of the data-points. Parts of the dataset are processed locally at each machine, and then the consensus communication algorithm is employe ...
Elsevier2014
,
We consider oscillators whose parameters randomly switch between two values at equal time intervals. If random switching is fast compared to the oscillator's intrinsic time scale, one expects the switching system to follow the averaged system, obtained by ...
Springer Verlag2013
,
We study stochastically blinking dynamical systems as in the companion paper (Part I). We analyze the asymptotic properties of the blinking system as time goes to infinity. The trajectories of the averaged and blinking system cannot stick together forever, ...
Siam Publications2013
,
We consider dynamical systems whose parameters are switched within a discrete set of values at equal time intervals. Similar to the blinking of the eye, switching is fast and occurs stochastically and independently for different time intervals. There are t ...
Siam Publications2013
A ring of N identical phase oscillators with interactions between L-nearest neighbors is considered, where L ranges from 1 (local coupling) to N/2 (global coupling). The coupling function is a simple sinusoid, as in the Kuramoto model, but with a minus sig ...
2012
, ,
Mechanisms on automatic discovery of macro actions or skills in reinforcement learning methods are mainly focused on subgoal discovery methods. Among the proposed algorithms, those based on graph centrality measures demonstrate a high performance gain. In ...
2012
,
We study the role of network architecture in the formation of synchronous clusters in synaptically coupled networks of bursting neurons. We give a simple combinatorial algorithm that finds the largest synchronous clusters from the network topology. We demo ...
2011
, ,
This paper introduces the connection-graph-stability method and uses it to establish a new lower bound on the algebraic connectivity of graphs (the second smallest eigenvalue of the Laplacian matrix of the graph) that is sharper than the previously publish ...
Elsevier2011
, ,
In this article, we show how proper assignment of weights to the edges of a complex network can enhance the detection of communities and how it can circumvent the resolution limit and the extreme degeneracy problems associated with modularity. Our general ...
