Adding current state for week 25
All checks were successful
ci/woodpecker/push/woodpecker Pipeline was successful
All checks were successful
ci/woodpecker/push/woodpecker Pipeline was successful
This commit is contained in:
parent
076d31fb75
commit
c60ba3fc09
2 changed files with 138 additions and 0 deletions
89
suivi/2025-25/2025-25.qmd
Normal file
89
suivi/2025-25/2025-25.qmd
Normal file
|
|
@ -0,0 +1,89 @@
|
|||
---
|
||||
title: "Bilan semaine 25 2025 : 16 juin - 20 juin"
|
||||
categories: [colBiSBM, inférence, GNN]
|
||||
date: 2025 06 13
|
||||
bibliography: references.bib
|
||||
---
|
||||
|
||||
## TODO List
|
||||
|
||||
- Pour clustering de collections sur données réelles :
|
||||
→ L'intuition de Pierre semble être confirmé, les dissimilarités semblent arrêter de varier sensiblement pour de grandes valeurs $(Q_1,Q_2)$.
|
||||
- ✅ Si plusieurs clustering possibles les tester et sélectionner le
|
||||
meilleur
|
||||
- ✅ Ré-ajuster les bonnes partitions.
|
||||
- ⌛ En train de corriger le bug commun à l'inférence
|
||||
|
||||
- Dé-bugger les simulations :
|
||||
|
||||
- ⌛ Inférence : Relancer simus d'inférence avec n = 240 pour voir si la qualité augmenter (se rassurer). En fait on est déjà à 240, j'ai relancé avec M = 4 au lieu de M = 2.
|
||||
En attente résultats MIGALE -> BUG, dois creuser mais juste des problèmes techniques -> Visiblement il y a d'autres problèmes que juste le plan de parallélisation.
|
||||
- ✅ **Non ça n'a pas l'air d'être ça**. Vérifier si problème de version tidyverse pour vapply sur l'**inférence**.
|
||||
|
||||
- ✅ **Il suffisait de faire la màj soit même...** Si problème de parallélisation vient de pb de version *future.callr* le signaler à MIGALE.
|
||||
|
||||
### Applications
|
||||
|
||||
- Kmeans sur la densité des réseaux subdoré pour pré-partitionner et *clusteriser*.
|
||||
Car densités déséquilibrées.
|
||||
|
||||
:::{#ref-kmeans-vae}
|
||||
|
||||
- Faire GNN-VAE Doré et sub-Doré avec kmeans et clustering sur l'espace latent
|
||||
J'ai commencé à regarder un peu
|
||||
|
||||
:::
|
||||
|
||||
- Comparer les perfs du VAE sur Baldock avec colBiSBM par exemple
|
||||
|
||||
### Inférence et microbes
|
||||
|
||||
- Lancer *colBiSBM* sur $OTU\times Sample$ → problème du chargement en mémoire des données à voir
|
||||
- Se renseigner techniques d'inférence de réseaux :
|
||||
- covariance (base corrélation et seuil)
|
||||
- GraphicalLASSO ou CCLasso
|
||||
- Co-occurence
|
||||
- Lancer *colSBM* sur $OTU\times OTU$
|
||||
- Creuser [TabNet](https://raw.githubusercontent.com/cregouby/R-toulouse-tabnet/main/Tabnet_RR2023_fr_pdf.pdf) de Christophe Regouby et les [exercices](https://github.com/cregouby/Tutoriel_torch)
|
||||
- Regarder **SPARTA** Rennes
|
||||
- Lire Papiers compositional data (Aitchison et al. intro)
|
||||
- Lire article multi-niveaux Saint-Clair
|
||||
- Demander à JA si elle connaît des réseaux d'interactions connus par les experts (idée d'intégrer une connaissance experte et de voir les différences de structure par rapport à celle attendue)
|
||||
- Ecrire et étudier les modèles pour différents niveaux taxonomiques.
|
||||
\begin{align*}
|
||||
i \rightarrow &~N^1_i \subseteq N^2_i \subseteq N^3_i & \text{Taxonomie}\\
|
||||
Z^0_i \overset{?}{=} & Z^1_i \overset{?}{=} Z^2_i \overset{?}{=} Z^3_i & \text{Groupes fonctionnels}
|
||||
\end{align*}
|
||||
|
||||
## Lecture en cours
|
||||
|
||||
### OT
|
||||
- ⌛ @mazeletUnsupervisedLearningOptimal Intéressant pour le transport optimal entre graphes de tailles différentes
|
||||
- ⌛ @nennaLecture2Entropic Pour comprendre le problème d'OT régularisé pour l'entropie.
|
||||
- ⌛ @nennaLecture1Monge
|
||||
|
||||
### Inférence de graphes
|
||||
- ⌛ @matchadoNetworkAnalysisMethods2021b
|
||||
|
||||
## A discuter
|
||||
|
||||
### Inférence
|
||||
|
||||
- Papier pour comprendre données
|
||||
- ~~Faust et al.~~
|
||||
- Abdill et al.
|
||||
- Bashan et al.
|
||||
|
||||
- pbs : variance, bcp de zero, covariables, offset et taxonomie (Reseaux arretes differents niveaux : Genre, OTU ...)
|
||||
|
||||
> Combine networks at different taxonomic levels
|
||||
|
||||
- Inférence + GREMLINS
|
||||
|
||||
### Rédaction article
|
||||
|
||||
- Relire intro St Clair
|
||||
- S'inspirer structure pour mon intro
|
||||
- Trouver biblio intro
|
||||
- Rédiger l'intro
|
||||
- Dire résultats nettement meilleurs et variabilités inférieures.
|
||||
49
suivi/2025-25/references.bib
Normal file
49
suivi/2025-25/references.bib
Normal file
|
|
@ -0,0 +1,49 @@
|
|||
@article{mazeletUnsupervisedLearningOptimal,
|
||||
title = {Unsupervised {{Learning}} for {{Optimal Transport}} Plan Prediction between Unbalanced Graphs},
|
||||
author = {Mazelet, Sonia and Flamary, Rémi and Thirion, Bertrand},
|
||||
abstract = {Optimal transport between graphs, based on Gromov-Wasserstein and other extensions, is a powerful tool for comparing and aligning graph structures. However, solving the associated non-convex optimization problems is computationally expensive, which limits the scalability of these methods to large graphs. In this work, we present Unbalanced Learning of Optimal Transport (ULOT), a deep learning method that predicts optimal transport plans between two graphs. Our method is trained by minimizing the fused unbalanced Gromov-Wasserstein (FUGW) loss. We propose a novel neural architecture with cross-attention that is conditioned on the FUGW tradeoff hyperparameters. We evaluate ULOT on synthetic stochastic block model (SBM) graphs and on real cortical surface data obtained from fMRI. ULOT predicts transport plans with competitive loss up to two orders of magnitude faster than classical solvers. Furthermore, the predicted plan can be used as a warm start for classical solvers to accelerate their convergence. Finally, the predicted transport plan is fully differentiable with respect to the graph inputs and FUGW hyperparameters, enabling the optimization of functionals of the ULOT plan.},
|
||||
langid = {english},
|
||||
keywords = {/unread},
|
||||
annotation = {Read\_Status: New\\
|
||||
Read\_Status\_Date: 2025-06-11T09:08:09.864Z},
|
||||
file = {/home/louis/snap/zotero-snap/common/Zotero/storage/HPZEYMM9/Mazelet et al. - Unsupervised Learning for Optimal Transport plan prediction between unbalanced graphs.pdf}
|
||||
}
|
||||
|
||||
@article{nennaLecture2Entropic,
|
||||
title = {Lecture 2: {{Entropic Optimal Transport}}},
|
||||
author = {Nenna, Luca},
|
||||
langid = {english},
|
||||
keywords = {/unread},
|
||||
annotation = {Read\_Status: New\\
|
||||
Read\_Status\_Date: 2025-06-11T16:06:28.547Z},
|
||||
file = {/home/louis/snap/zotero-snap/common/Zotero/storage/WGFIISDB/Nenna - Lecture 2 Entropic Optimal Transport.pdf}
|
||||
}
|
||||
|
||||
@article{nennaLecture1Monge,
|
||||
title = {Lecture 1 {{Monge}} and {{Kantorovich}} Problems: From Primal to Dual},
|
||||
author = {Nenna, Luca},
|
||||
langid = {english},
|
||||
keywords = {/unread},
|
||||
annotation = {Read\_Status: New\\
|
||||
Read\_Status\_Date: 2025-06-13T09:24:13.832Z},
|
||||
file = {/home/louis/snap/zotero-snap/common/Zotero/storage/7LVQPD6D/Nenna - Lecture 1 Monge and Kantorovich problems from primal to dual.pdf}
|
||||
}
|
||||
|
||||
@article{matchadoNetworkAnalysisMethods2021b,
|
||||
title = {Network Analysis Methods for Studying Microbial Communities: {{A}} Mini Review},
|
||||
shorttitle = {Network Analysis Methods for Studying Microbial Communities},
|
||||
author = {Matchado, Monica Steffi and Lauber, Michael and Reitmeier, Sandra and Kacprowski, Tim and Baumbach, Jan and Haller, Dirk and List, Markus},
|
||||
year = {2021},
|
||||
month = jan,
|
||||
journal = {Computational and Structural Biotechnology Journal},
|
||||
volume = {19},
|
||||
pages = {2687--2698},
|
||||
issn = {2001-0370},
|
||||
doi = {10.1016/j.csbj.2021.05.001},
|
||||
urldate = {2025-06-16},
|
||||
abstract = {Microorganisms including bacteria, fungi, viruses, protists and archaea live as communities in complex and contiguous environments. They engage in numerous inter- and intra- kingdom interactions which can be inferred from microbiome profiling data. In particular, network-based approaches have proven helpful in deciphering complex microbial interaction patterns. Here we give an overview of state-of-the-art methods to infer intra-kingdom interactions ranging from simple correlation- to complex conditional dependence-based methods. We highlight common biases encountered in microbial profiles and discuss mitigation strategies employed by different tools and their trade-off with increased computational complexity. Finally, we discuss current limitations that motivate further method development to infer inter-kingdom interactions and to robustly and comprehensively characterize microbial environments in the future.},
|
||||
keywords = {/unread,Microbial co-occurrence networks,Microbial interactions,Network analysis,Trans-kingdom interactions},
|
||||
annotation = {Read\_Status: New\\
|
||||
Read\_Status\_Date: 2025-06-16T16:18:09.496Z},
|
||||
file = {/home/louis/snap/zotero-snap/common/Zotero/storage/ZCY74M2I/Matchado et al. - 2021 - Network analysis methods for studying microbial communities A mini review.pdf;/home/louis/snap/zotero-snap/common/Zotero/storage/BKZN3MI5/S2001037021001823.html}
|
||||
}
|
||||
Loading…
Add table
Reference in a new issue