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.
Suppose we have randomized decision trees for an outer function f and an inner function g. The natural approach for obtaining a randomized decision tree for the composed function (f∘ gⁿ)(x¹,…,xⁿ) = f(g(x¹),…,g(xⁿ)) involves amplifying the success probabili ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020
Decentralized optimization methods enable on-device training of machine learning models without a central coordinator. In many scenarios communication between devices is energy demanding and time consuming and forms the bottleneck of the entire system. We ...
This paper considers optimization problems over networks where agents have individual objectives to meet, or individual parameter vectors to estimate, subject to subspace constraints that require the objectives across the network to lie in low-dimensional ...
As the number of engineered nanomaterials (ENM) used in research increases with an incredible speed, health and safety specialists are continuously faced with the challenge of evaluating the risks involved with these materials. Nowadays there is not enough ...
Part & x00A0;I of this paper considered optimization problems over networks where agents have individual objectives to meet, or individual parameter vectors to estimate, subject to subspace constraints that require the objectives across the network to lie ...
This paper introduces a new algorithm for consensus optimization in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. All decentralized algorithms rely on communications between adjacent nodes. ...
Most natural and man-made surfaces appear to be rough on many length scales. There is presently no unifying theory of the origin of roughness or the self-affine nature of surface topography. One likely contributor to the formation of roughness is deformati ...
This paper proposes an iterative learning controller (ILC) under the alignment condition for trajectory tracking of a parallel Delta robot, that performs various repetitive tasks for palletization. Motivated by the high cadence of our application that lead ...
This paper presents a closed-form and non-iterative solution for the long-studied SCADA-based State Etimation (SE) problem, where unsynchronized traditional measurements from Remote Terminal Units (RTUs) are used. In this regard, a novel reformulation of t ...
The randomized query complexity 𝖱(f) of a boolean function f: {0,1}ⁿ → {0,1} is famously characterized (via Yao’s minimax) by the least number of queries needed to distinguish a distribution 𝒟₀ over 0-inputs from a distribution 𝒟₁ over 1-inputs, maximized ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020
