Advanced learning for text and graph data ALTEGRAD
M. VAZIRGIANNIS
LearningNatural Language Processing

Objectif du cours

The ALTEGRAD course ( 28 hours) aims at providing an overview of state-of-the-art ML and AI methods for text and graph data with a significant focus on applications. Each session will comprise two hours of lecture followed by two hours of programming sessions.

Grading for the course will be based on a final data challenge plus lab based evaluation.

TO ENROL – IMPORTANT !

Inscription to the course necessary : link to form

Course web page: here

Informative video: here

Course Syllabus 2026-2027 :

  1. Introduction to NLP and Attention Mechanism
  • Foundational Text Representations: Covers the progression from classic bag-of-words and n-grams to continuous vector spaces, including Word2Vec, GloVe, and subword tokenization schemes.
  • Sequence Modeling & Attention: Explores recurrent architectures (RNNs, LSTMs, GRUs), sequence-to-sequence formulation, and the mathematical mechanics of additive and multiplicative attention (Bahdanau and Luong attention).
  • Graph-of-Words (GoW) Framework: Integrates non-Euclidean text representation, replacing bag-of-words assumptions with sliding-window graph models that encode word co-occurrence, syntactic closeness, and phrase salience. Graph Degeneracy for Text Mining: Applies graph-theoretic metrics—such as $k$-core decomposition and shortest-path graph kernels—to keyword extraction, document degeneracy analysis, and text similarity.

 

  1. Deep Learning for NLP
  • Deep Discriminative Architectures: Examines 1D convolutional neural networks (CNNs), bidirectional encoders, and Hierarchical Attention Networks (HAN) designed for sentence and document classification.
  • Transfer Learning & Pretraining: Details the shift from task-specific feature engineering to self-supervised pretraining (masked language modeling, sequence-to-sequence autoencoding).
  • French & Multilingual Language Resources: Incorporates research from the DaSciM group on regional language adaptation, highlighting French sequence-to-sequence pretrained models such as BARThez.
  • Efficient NLP Evaluation: Explores model compression and learned evaluation metrics, specifically integrating FrugalScore for cost-effective, high-correlation evaluation of generated text.

 

  1. LLMs
  • The Transformer Engine: Details scaled dot-product attention, multi-head self-attention mechanisms, and positional encoding variants (sinusoidal, Rotary Position Embeddings / RoPE, ALiBi).
  • Autoregressive Pretraining & Scaling: Analyzes pretraining dynamics, causal masking, compute-optimal scaling laws (Chinchilla regimes), and modern tokenization behavior at scale.
  • Downstream Adaptation & Parameter Efficiency: Covers instruction fine-tuning and parameter-efficient fine-tuning (PEFT) methods, with an emphasis on Low-Rank Adaptation (LoRA) and prefix tuning.
  • Sovereign & Multilingual LLMs: Connects foundational models to regional sovereignty and evaluation, featuring native-sourced multitask benchmark design such as GreekMMLU to evaluate non-dominant languages.

 

  1. LLM Advanced Topics
  • Alignment & Post-Training: Studies preference optimization, including Reinforcement Learning from Human/AI Feedback (RLHF), Proximal Policy Optimization (PPO), and Direct Preference Optimization (DPO).
  • Retrieval-Augmented Generation (RAG): Explores external knowledge retrieval, dense passage retrieval, context grounding, and methods for mitigating factual hallucination.
  • Quantization & Efficient Inference: Examines low-bit weight and activation quantization (AWQ, GPTQ, bitsandbytes), KV-cache optimization, and pruning for resource-constrained deployment.
  • Graph-Augmented LLMs: Explores structured knowledge retrieval frameworks, linking LLM reasoning capabilities with underlying knowledge graphs and structured relational databases.

 

  1. Deep Learning for Graphs I
  • Spectral Theory & Graph Kernels: Introduces classical graph mining, graph Laplacians, spectral graph theory, and algorithmic graph kernels implemented via the GraKeL library.
  • Unsupervised Graph Embeddings: Covers random walk-based representation learning, contrasting continuous node embedding techniques like DeepWalk and Node2Vec with matrix factorization baselines.
  • Spatial & Spectral GNNs: Introduces standard message-passing neural networks, covering spatial and spectral Graph Convolutional Networks (GCN), GraphSAGE, and Graph Attention Networks (GAT).
  • Core-Decomposition & Graph Degeneracy: Anchors graph representation learning in structural graph decomposition, utilizing Vazirgiannis’s foundational work on $k$-core, generalized cores, and dense subgraph evaluation.

 

  1. Deep Learning for Graphs II
  • Advanced Message-Passing & WL Limits: Analyzes the theoretical expressive boundaries of 1-Weisfeiler-Lehman (1-WL) graph isomorphism tests and higher-order message-passing schemes.
  • Graph-Level Pooling & Hierarchical Representations: Examines global readout and hierarchical pooling mechanisms, including SortPool, DiffPool, and set-based representation learning.
  • Expressive & Topological Architectures: Explores novel inductive biases from Vazirgiannis’s research group, such as Random Walk Neural Networks (RWNNs), path-based networks, and simplicial/topological message passing.
  • Geometric & Equivariant Deep Learning: Details SE(3)/E(3) invariant and equivariant graph neural networks designed for physical, chemical, and relational systems in Euclidean space.

 

  1. Multimodality LLMs and GenAI
  • Agentic AI & Autonomous Systems: Covers reasoning and action paradigms (ReAct), tool usage, code execution environments, memory systems, and multi-agent coordination frameworks.
  • Graph Generative Foundations: Shifts away from computer vision to focus on generative modeling over non-Euclidean graphs, including autoregressive graph models, graph diffusion models, and flow matching.
  • Applications to Biology & Molecules: Highlights DaSciM and Graphion research in biomolecular generative modeling, including 3D molecular generation, text-to-molecule synthesis, and captioning protein-protein interactions (PPI2Text).
  • Applications to Engineering & Physical Systems: Covers structured layout synthesis, including automated architectural floor-plan generation, Building Information Modeling (BIM), and MEP network routing via generative graph pipelines.
Les intervenants

Michalis Vazirgiannis

(Polytechnique)

voir les autres cours du 1er semestre