Chasing the Weakest System Model for Implementing Omega and Consensus

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.

Numerous process integration techniques were proved to be highly effective for identifying and estimating potential energy savings in the industry. However, they require high time and effort to collect and analyse process data. As a result, they do not con ...

Modern machine learning architectures distinguish servers and workers. Typically, a d-dimensional model is hosted by a server and trained by n workers, using a distributed stochastic gradient descent (SGD) optimization scheme. At each SGD step, the goal is ...

We describe a series of algorithms that efficiently implement Gaussian model-X knockoffs to control the false discovery rate on large-scale feature selection problems. Identifying the knockoff distribution requires solving a large-scale semidefinite progra ...

We propose and evaluate a secure-multiparty-computation (MPC) solution in the semi-honest model with dishonest majority that is based on multiparty homomorphic encryption (MHE). To support our solution, we introduce a multiparty version of the Brakerski-Fa ...

This paper reports on the computation of a discrete logarithm in the finite field F-230750, breaking by a large margin the previous record, which was set in January 2014 by a computation in F-29234. The present computation made essential use of the elimina ...

Over-the-air computation (AirComp) is a disruptive technique for fast wireless data aggregation in Internet of Things (IoT) networks via exploiting the waveform superposition property of multiple-access channels. However, the performance of AirComp is bott ...

Decision trees have been widely used as classifiers in many machine learning applications thanks to their lightweight and interpretable decision process. This paper introduces Tree in Tree decision graph (TnT), a framework that extends the conventional dec ...

We consider low run-time complexity power management in distribution grids with renewable energy sources (RESs) and batteries, where forecasts are unavailable. We propose iterative Lyapunov Real-time Control (iLypRC), a fast online algorithm, which does no ...

We consider the classical problem of maximizing a monotone submodular function subject to a cardinality constraint, which, due to its numerous applications, has recently been studied in various computational models. We consider a clean multi-player model t ...

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. ...

Coding techniques have been well studied and used for improving communication quality by combating noise and mitigating interference. Recently, it has been shown that the same coding techniques can also be exploited to further improve communication perform ...

Combining diffusion strategies with complementary properties enables enhanced performance when they can be run simultaneously. In this article, we first propose two schemes for the convex combination of two diffusion strategies, namely, the power-normalize ...

Chasing the Weakest System Model for Implementing Omega and Consensus

Chat with Graph Search

A method for faster application of process integration techniques in retrofit situations

AKSEL: Fast Byzantine SGD

FANOK: Knockoffs in Linear Time

Multiparty Homomorphic Encryption from Ring-Learning-with-Errors

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Over-the-Air Computation via Reconfigurable Intelligent Surface

Tree in Tree: from Decision trees to Decision Graphs

Online Battery Storage Management via Lyapunov Optimization in Active Distribution Grids

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Cooperative Data Exchange and Private Information Retrieval

Convex Combination of Diffusion Strategies Over Networks