Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
education [2018/09/02 13:55]
rouault Updated link ca_2017 -> ca_2018
education [2023/10/23 14:48] (current)
fablpd
Line 3: Line 3:
 ====== Education ====== ====== Education ======
  
 +\\
  
 The lab is teaching the following courses: The lab is teaching the following courses:
 \\ \\
 +
 +  * [[education/​ca_2023|Concurrent Algorithms]] (theory & practice)
 +  * [[education/​da_2023|Distributed Algorithms]] (theory & practice)
 \\ \\
-  * [[education/​ca_2018|Concurrent Algorithms]] +The lab taught in the past the following courses: 
-  * [[education/​da|Distributed Algorithms]]+
   * <​html><​a href="​http://​moodle.epfl.ch/​course/​view.php?​id=14044">​Information,​ Calcul et Communication</​a></​html>​   * <​html><​a href="​http://​moodle.epfl.ch/​course/​view.php?​id=14044">​Information,​ Calcul et Communication</​a></​html>​
   * <​html><​a href="​http://​cowww.epfl.ch/​proginfo/​wwwhiver/">​Introduction à la Programmation Orientée Objet</​a></​html>​   * <​html><​a href="​http://​cowww.epfl.ch/​proginfo/​wwwhiver/">​Introduction à la Programmation Orientée Objet</​a></​html>​
Line 23: Line 26:
 DCL offers master projects in the following areas: DCL offers master projects in the following areas:
  
-  * **Dynamically Distributed Spatial Indexing**:  ​a ​project ​here would consist in studying existing spatial index data structures and algorithms, e.g., simple grids, Quadtrees, R-Trees etc., and how they may be dynamically distributed for indexing a large number ​of moving objects; please ​contact [[mailto:​benoit.garbinato@unil.ch|Benoit Garbinato]] to get more information.+  * **[[cryptocurrencies|Cryptocurrencies]]**: We have several ​project ​openings as part of our ongoing research on designing new cryptocurrency systems. Please ​contact [[rachid.guerraoui@epfl.ch|Prof. Rachid Guerraoui]].
  
 +  * **Tackling data heterogeneity in Byzantine-robust ML**: Context: Distributed ML is a very effective paradigm to learn collaboratively when all users correctly follow the protocol. However, some users may behave adversarially and measures should be taken to protect against such Byzantine behavior [ [[https://​papers.nips.cc/​paper/​2017/​hash/​f4b9ec30ad9f68f89b29639786cb62ef-Abstract.html|1]],​ [[https://​proceedings.mlr.press/​v162/​farhadkhani22a.html|2]] ]. In real-world settings, users have different datasets (i.e. non-iid), which makes defending against Byzantine behavior challenging,​ as was shown recently in  [ [[https://​proceedings.neurips.cc/​paper/​2021/​hash/​d2cd33e9c0236a8c2d8bd3fa91ad3acf-Abstract.html|3]],​ [[https://​openreview.net/​forum?​id=jXKKDEi5vJt|4]] ]. Some defenses were proposed to tackle data heterogeneity,​ but their performance is suboptimal on simple learning tasks. Goal: Develop defenses with special emphasis on empirical performance and efficiency in the heterogeneous setting. Contact [[https://​people.epfl.ch/​youssef.allouah?​lang=en|Youssef Allouah]] for more information.
  
-  * **Multicore computing**: a project here would consist for instance ​in designing and implementing efficient lock-based or lock-free shared objects; please contact  ​[[http://tudordavid.com|Tudor David]] or [[https://​people.epfl.ch/​igor.zablotchi|Igor Zablotchi]] to get more information.+  * **Benchmark to certify Byzantine-robustness in ML**: Context: Multiple attacks have been proposed to instantiate ​Byzantine adversary ​in distributed ML [ [[https://​proceedings.neurips.cc/​paper/​2019/​hash/​ec1c59141046cd1866bbbcdfb6ae31d4-Abstract.html|1]], ​[[https://proceedings.mlr.press/​v115/​xie20a.html|2]] ]. While these attacks have been successful against known defenses, it remains unknown whether stronger attacks exist. As such, a strong benchmark is needed, to go beyond the cat-and-mouse game illustrating the existing research. Ideally, similar to other ML subfields such as privacy-preserving ML or adversarial examples, the desired benchmark should guarantee that no stronger attack exists. Goal: Develop a strong benchmark for attacks in Byzantine ML. Contact ​[[https://​people.epfl.ch/​youssef.allouah?​lang=en|Youssef Allouah]] for more information.
  
-  * **Dynamic distributed computing**:​ a project here would consist for instance in designing and implementing applications that would run in a simulation of a cloud with high churn, but possibly robust to arbitrary behavior of some of its components; please contact [[http://​people.epfl.ch/​matej.pavlovic|Matej Pavlovic]] to get more information. 
  
-  * **[[Distributed ML|Distributed Machine Learning]]** 
  
-  * **Distributed and Fault-tolerant algorithms**: projects here would consist in designing failure detection mechanisms suited for large-scale ​systems, real-time systems, ​and systems with unreliable communication or partial synchrony. This task also involves ​implementing, evaluating, and simulating ​the performance ​of the developed mechanisms ​to verify the achievable guarantees; please contact [[http://​people.epfl.ch/​david.kozhaya|David Kozhaya]] to get more information.+  * **Topology-aware mempool for cryptocurrencies**: The mempool is a core component of cryptocurrency ​systems. It disseminates user transactions to the miner nodes before they reach consensus.Current mempools assume an homogeneous network topology where all machines have the same bandwidth ​and latency.This unrealitic assumption forces the system to progress at the same speed as the slowest node in the system. This project aims at implementing ​a mempool which exploits ​the heterogeneity ​of the network ​to speed up data dissemination for cryptocurrency systems. This is a practical project which requires good knowledge in network programming,​ either Go or C++, distributed algorithms. Contact Gauthier Voron <​gauthier.voron@epfl.ch> for more information.
  
-  * **Consistency in global-scale storage systems**: We offer several projects in the context of storage systemsranging from implementation of social applications (similar ​to [[http://​retwis.redis.io/​|Retwis]]or [[https://​github.com/​share/​sharejs|ShareJS]]) ​to recommender systemsstatic content storage services (à la [[https://www.usenix.org/legacy/​event/​osdi10/​tech/​full_papers/Beaver.pdf|Facebook'​s Haystack]]), or experimenting with well-known cloud serving benchmarks (such as [[https://​github.com/​brianfrankcooper/​YCSB|YCSB]]);​ please contact [[http://​people.epfl.ch/​dragos-adrian.seredinschi|Adrian Seredinschi]] for further ​information.+  * **Robust mean estimation**: In recent yearsmany algorithms have been proposed ​to perform robust mean estimationwhich has been shown to be equivalent to robust gradient-based machine learningA new concept has been proposed ​to define the performance of a robust mean estimatorcalled the [[https://arxiv.org/abs/2008.00742|averaging constant]] (along with the Byzantine resilience). This research project consists of computing the theoretical averaging constant of different proposed robust mean estimatorsand to study their empirical performances on randomly generated vectors. Contact ​[[https://​people.epfl.ch/​sadegh.farhadkhani?​lang=en|Sadegh Farhadkhani]] for more information.
  
-  * **Distributed database algorithms**:​ a project here would consist in implementing and evaluating protocols that are running in today'​s database systems, e.g., [[https://​en.wikipedia.org/​wiki/​Two-phase_commit_protocol|2PC]],​ and comparing them with those protocols that can  potentially be used in future database systems; please contact [[http://​people.epfl.ch/​jingjing.wang|Jingjing Wang]] to get more information. 
  
 +  * **Accelerate Byzantine collaborative learning**: [[https://​arxiv.org/​abs/​2008.00742|Our recent NeurIPS paper]] proposed algorithms for collaborative machine learning in the presence of Byzantine nodes, which have been proved to be near optimal with respect to optimality at convergence. However, these algorithms require all-to-all communication at every round, which is suboptimal. This research consists of designing a practical solution to Byzantine collaborative learning, based on the idea of a random communication network at each round, with both theoretical guarantees and practical implementation. Contact [[https://​people.epfl.ch/​sadegh.farhadkhani?​lang=en|Sadegh Farhadkhani]] for more information.
 +
 +
 +
 +  * **Probabilistic Byzantine Resilience**: ​ Development of high-performance,​ Byzantine-resilient distributed systems with provable probabilistic guarantees. Two options are currently available, both building on previous work on probabilistic Byzantine broadcast: (i) a theoretical project, focused the correctness of probabilistic Byzantine-tolerant distributed algorithms; (ii) a practical project, focused on numerically evaluating of our theoretical results. Please contact [[matteo.monti@epfl.ch|Matteo Monti]] to get more information.
 +
 +  * **Microsecond-scale dependable systems.** Modern networking technologies such as RDMA (Remote Direct Memory Access) allow for sub-microsecond communication latency. Combined with emerging data center architectures,​ such as disaggregated resources pools, they open the door to novel blazing-fast and resource-efficient systems. Our research focuses on designing such microsecond-scale systems that can also tolerate faults. Our vision is that tolerating network asynchrony as well as faults (crash and/or Byzantine) is a must, but that it shouldn'​t affect the overall performance of a system. We achieve this goal by devising and implementing novel algorithms tailored for new hardware and revisiting theoretical models to better reflect modern data centers. Previous work encompasses microsecond-scale (BFT) State Machine Replication,​ Group Membership Services and Key-Value Stores (OSDI'​20,​ ATC'22 and ASPLOS'​23). Overall, if you are interested in making data centers faster and safer, contact [[https://​people.epfl.ch/​athanasios.xygkis|Athanasios Xygkis]] and [[https://​people.epfl.ch/​antoine.murat|Antoine Murat]] for more information.
 +
 +
 + 
  
  
 \\ \\
  
 +
 +
 +\\
  
 ===== Semester Projects ===== ===== Semester Projects =====
Line 47: Line 61:
 If the subject of a Master Project interests you as a Semester Project, please contact the supervisor of the Master Project to see if it can be considered for a Semester Project. If the subject of a Master Project interests you as a Semester Project, please contact the supervisor of the Master Project to see if it can be considered for a Semester Project.
  
-EPFL I&C duration, credits and workload information are available [[http://ic.epfl.ch/page-17123.html|here]]Don't hesitate to contact the project supervisor if you want to complete your Semester Project outside the regular ​semester ​period.+EPFL I&C duration, credits and workload information are available ​on [[https://www.epfl.ch/schools/​ic/​education/​master/​semester-project-msc/​|https://www.epfl.ch/​schools/​ic/​education/​master/​semester-project-msc/​]] 
 +