Lecture

Decentralized ML: Collaborative Training & Causal Influence Structure

Graph Chat

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.

Related lectures (64)

Privacy-preserving data publishing: Synthetic Data Generation

Explores synthetic data generation for privacy-preserving data publishing, evaluating its effectiveness against privacy threats in raw datasets.

Graphical Models: Representing Probabilistic Distributions

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Graph Theory: Connectivity and Properties

Explores the properties of undirected and directed graphs, emphasizing connectivity and network topology modeling.

Graph Coloring and Directed Cycles

Explores graph coloring, directed cycles, LLL algorithm applications, and element dependencies in graphs.

Max Flav-Min Cut in Directed Graphs

Covers the concept of maximum flow-minimum cut in directed graphs with capacity constraints.

Machine Learning and Privacy

Explores the intersection of machine learning and privacy, discussing confidentiality, attacks, differential privacy, and trade-offs in federated learning.

Socially-aware Artificial Intelligence for Last-mile Mobility

Explores socially-aware AI for last-mile mobility, focusing on understanding social etiquettes, anticipating behaviors, and forecasting crowd movements.

Privacy Engineering: Principles and Strategies

Covers the principles and strategies of privacy engineering, emphasizing the importance of embedding privacy into IT systems and the challenges faced in achieving privacy by design.

Bellman-Ford Algorithm: Shortest Path Estimation

Explains the Bellman-Ford algorithm for finding the shortest path in a directed graph with edge weights.

Belief Propagation

Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Cayley Graphs

Covers Cayley graphs, generators, group examples, and graph structures.

Networked Control Systems: Coordination Among Agents

Explores coordination among agents in networked control systems through graph theory and real-world examples.

Bayesian Networks: Factorization and Sampling

Explains Bayesian Networks factorization and sampling methods using DAGs and Variable Elimination.

Machine Learning and Privacy

Explores Federated Machine Learning and Differential Privacy in Machine Learning, discussing attacks, defenses, and challenges.

Statistical Analysis of Network Data

Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.

Concurrent Programming: Theory to Practice

Explores concurrent programming theory and practice, covering system models, cache coherence, and graph processing.

Graph Theory Fundamentals

Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.

Probability & Stochastic Processes

Covers applied probability, stochastic processes, Markov chains, rejection sampling, and Bayesian inference methods.

Machine Learning Security

Explores machine learning security, including model stealing, altering outputs, adversarial conditions, and privacy challenges, emphasizing the importance of addressing biases in machine learning models.