Filter
Exclude
Time range
-
Near
OOD-GraphLLM: Graph Large Language Model for Out-of-Distribution Generalized Drug Synergy Prediction Xin Wang, Linxin Xiao, Yang Yao, Wenwu Zhu arxiv.org/abs/2605.30247 [๐šŒ๐šœ.๐™ป๐™ถ ๐šŒ๐šœ.๐™ผ๐™ผ]
5
263
[1/24]๐Ÿง ๐Ÿ“ข ๐—Ÿ๐—ฎ๐˜€๐˜ ๐—ช๐—ฒ๐—ฒ๐—ธ ๐—ถ๐—ป ๐— ๐—ฒ๐—ฑ๐—ถ๐—ฐ๐—ฎ๐—น ๐—”๐—œ (๐— ๐—ฎ๐˜† ๐Ÿฎ๐Ÿฐโ€“๐Ÿฏ๐Ÿฌ, ๐Ÿฎ๐Ÿฌ๐Ÿฎ๐Ÿฑ) 22 impactful papers categorized for fast reading! Topics: LLMs, multimodal agents, surgical AI, benchmarks, segmentation, and medical datasets. ๐Ÿ‘‡ ๐Ÿงฌ ๐— ๐—ฒ๐—ฑ๐—ถ๐—ฐ๐—ฎ๐—น ๐—Ÿ๐—Ÿ๐—  & ๐—ข๐˜๐—ต๐—ฒ๐—ฟ ๐— ๐—ผ๐—ฑ๐—ฒ๐—น๐˜€ โ€ข ๐—–๐—ผ๐˜‚๐—ป๐˜๐—ฒ๐—ฟ๐—ณ๐—ฎ๐—ฐ๐˜๐˜‚๐—ฎ๐—น ๐—ฅ๐—ฒ๐—ฎ๐˜€๐—ผ๐—ป๐—ถ๐—ป๐—ด ๐—ณ๐—ผ๐—ฟ ๐— ๐—ฒ๐—ฑ๐—ถ๐—ฐ๐—ฎ๐—น ๐—ฉ๐—ถ๐—ฑ๐—ฒ๐—ผ ๐——๐—ถ๐—ฎ๐—ด๐—ป๐—ผ๐˜€๐—ถ๐˜€ ๐Ÿ”— arxiv.org/pdf/2605.26483 โ€ข ๐—–๐—ฟ๐—ผ๐˜€๐˜€-๐—ฆ๐˜๐—ฎ๐—ด๐—ฒ ๐— ๐˜‚๐—น๐˜๐—ถ-๐—˜๐˜…๐—ฝ๐—ฒ๐—ฟ๐˜ ๐—ก๐—ฒ๐˜๐˜„๐—ผ๐—ฟ๐—ธ ๐—ณ๐—ผ๐—ฟ ๐—•๐—ฟ๐—ฒ๐—ฎ๐˜€๐˜ ๐—จ๐—น๐˜๐—ฟ๐—ฎ๐˜€๐—ผ๐˜‚๐—ป๐—ฑ ๐Ÿ”— arxiv.org/pdf/2605.25518 โ€ข ๐—ข๐—ผ๐——-๐—š๐—ฟ๐—ฎ๐—ฝ๐—ต๐—Ÿ๐—Ÿ๐— : ๐—Ÿ๐—Ÿ๐—  ๐—ณ๐—ผ๐—ฟ ๐——๐—ฟ๐˜‚๐—ด ๐—ฆ๐˜†๐—ป๐—ฒ๐—ฟ๐—ด๐˜† ๐—ฃ๐—ฟ๐—ฒ๐—ฑ๐—ถ๐—ฐ๐˜๐—ถ๐—ผ๐—ป ๐Ÿ”— arxiv.org/pdf/2605.30247 โ€ข ๐—ฉ๐—ถ๐—ง ๐—ฆ๐˜‚๐—ฏ๐˜€๐—ฝ๐—ฎ๐—ฐ๐—ฒ ๐——๐—ฒ๐—ฐ๐—ผ๐˜‚๐—ฝ๐—น๐—ถ๐—ป๐—ด ๐—ณ๐—ผ๐—ฟ ๐—›๐—ถ๐˜€๐˜๐—ผ๐—น๐—ผ๐—ด๐—ถ๐—ฐ๐—ฎ๐—น ๐—ฆ๐—ฐ๐—ผ๐—ฟ๐—ถ๐—ป๐—ด ๐Ÿ”— arxiv.org/pdf/2605.29852 โ€ข ๐—จ๐—ป๐—ฐ๐—ฒ๐—ฟ๐˜๐—ฎ๐—ถ๐—ป๐˜๐˜† ๐—ฅ๐—ฒ๐—ฎ๐˜€๐—ผ๐—ป๐—ถ๐—ป๐—ด ๐˜„๐—ถ๐˜๐—ต ๐—Ÿ๐—Ÿ๐— ๐˜€ ๐—ณ๐—ผ๐—ฟ ๐——๐—ถ๐—ฎ๐—ด๐—ป๐—ผ๐˜€๐—ถ๐˜€ ๐Ÿ”— arxiv.org/pdf/2605.25566 โ€ข ๐—Ÿ๐—Ÿ๐—จ๐— ๐—œ: ๐—Ÿ๐—Ÿ๐—  ๐—ช๐—ฟ๐—ถ๐˜๐—ถ๐—ป๐—ด ๐—ณ๐—ผ๐—ฟ ๐— ๐—ฒ๐—ป๐˜๐—ฎ๐—น ๐—›๐—ฒ๐—ฎ๐—น๐˜๐—ต ๐—ฆ๐˜‚๐—ฝ๐—ฝ๐—ผ๐—ฟ๐˜ ๐Ÿ”— arxiv.org/pdf/2605.30273 โ€ข ๐—ข๐—ฝ๐—ต๐—œ๐—ป-๐Ÿฑ๐Ÿฌ๐Ÿฌ๐—ž: ๐—ฆ๐—ฐ๐—ฎ๐—น๐—ถ๐—ป๐—ด ๐—ข๐—ฝ๐—ต๐˜๐—ต๐—ฎ๐—น๐—บ๐—ถ๐—ฐ ๐— ๐˜‚๐—น๐˜๐—ถ๐—บ๐—ผ๐—ฑ๐—ฎ๐—น ๐—Ÿ๐—Ÿ๐— ๐˜€ ๐Ÿ”— arxiv.org/pdf/2605.27916 โ€ข ๐—ฉ๐—œ๐—ง๐—”๐—Ÿ: ๐—ฉ๐—ถ๐˜€๐˜‚๐—ฎ๐—น-๐—ฆ๐—ฒ๐—บ๐—ฎ๐—ป๐˜๐—ถ๐—ฐ ๐—ฅ๐—ฒ๐—ฎ๐˜€๐—ผ๐—ป๐—ถ๐—ป๐—ด ๐—ถ๐—ป ๐— ๐—ฒ๐—ฑ๐—ถ๐—ฐ๐—ฎ๐—น ๐— ๐—Ÿ๐—Ÿ๐— ๐˜€ ๐Ÿ”— arxiv.org/pdf/2605.28422 ๐Ÿงช ๐—™๐—ฟ๐—ฎ๐—บ๐—ฒ๐˜„๐—ผ๐—ฟ๐—ธ๐˜€ ๐—ฎ๐—ป๐—ฑ ๐— ๐—ฒ๐˜๐—ต๐—ผ๐—ฑ๐—ผ๐—น๐—ผ๐—ด๐—ถ๐—ฒ๐˜€ โ€ข ๐—ฆ๐—ฎ๐—ณ๐—ฒ๐—ฅ๐˜…-๐—”๐—ด๐—ฒ๐—ป๐˜: ๐— ๐˜‚๐—น๐˜๐—ถ-๐—”๐—ด๐—ฒ๐—ป๐˜ ๐— ๐—ฒ๐—ฑ๐—ถ๐—ฐ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐—ฅ๐—ฒ๐—ฐ๐—ผ๐—บ๐—บ๐—ฒ๐—ป๐—ฑ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐Ÿ”— arxiv.org/pdf/2605.29146 โ€ข ๐— ๐˜‚๐—น๐˜๐—ถ๐—บ๐—ผ๐—ฑ๐—ฎ๐—น ๐—™๐—ฟ๐—ฎ๐—บ๐—ฒ๐˜„๐—ผ๐—ฟ๐—ธ ๐—ณ๐—ผ๐—ฟ ๐——๐—ฒ๐—บ๐—ฒ๐—ป๐˜๐—ถ๐—ฎ ๐——๐—ฒ๐˜๐—ฒ๐—ฐ๐˜๐—ถ๐—ผ๐—ป ๐Ÿ”— arxiv.org/pdf/2605.25540 โ€ข ๐—ฃ๐—ฎ๐˜๐—ต๐—ช๐—œ๐—ฆ๐—˜: ๐— ๐˜‚๐—น๐˜๐—ถ-๐—”๐—ด๐—ฒ๐—ป๐˜ ๐—–๐—ฎ๐—ป๐—ฐ๐—ฒ๐—ฟ ๐—ฃ๐—ฎ๐˜๐—ต๐˜„๐—ฎ๐˜† ๐—ง๐—ฟ๐—ถ๐—ฎ๐—ด๐—ถ๐—ป๐—ด ๐Ÿ”— arxiv.org/pdf/2605.25970 โ€ข ๐— ๐—ฒ๐—ฑ๐—ฉ๐—ผ๐—น-๐—ฅ๐Ÿญ: ๐—ฅ๐—ฒ๐˜„๐—ฎ๐—ฟ๐—ฑ-๐——๐—ฟ๐—ถ๐˜ƒ๐—ฒ๐—ป ๐—ฉ๐—ผ๐—น๐˜‚๐—บ๐—ฒ๐˜๐—ฟ๐—ถ๐—ฐ ๐—ฅ๐—ฒ๐—ฎ๐˜€๐—ผ๐—ป๐—ถ๐—ป๐—ด ๐Ÿ”— arxiv.org/pdf/2605.26621 โ€ข ๐—ฅ๐—”๐—ฃ๐—ง๐—ข๐—ฅ : ๐—ฉ๐—ถ๐˜€๐—ถ๐—ผ๐—ป-๐—Ÿ๐—ฎ๐—ป๐—ด๐˜‚๐—ฎ๐—ด๐—ฒ ๐—ณ๐—ผ๐—ฟ ๐—–๐—ฎ๐—ป๐—ฐ๐—ฒ๐—ฟ ๐—ฅ๐—ฒ๐—ณ๐—ฒ๐—ฟ๐—ฟ๐—ฎ๐—น ๐Ÿ”— arxiv.org/pdf/2605.25956 โ€ข ๐—ฆ๐˜†๐—ป๐—ฒ๐—ฟ๐—ด๐—ถ๐˜€๐˜๐—ถ๐—ฐ ๐—ง๐—ผ๐—ผ๐—น ๐—š๐—ฎ๐—ถ๐—ป๐˜€ ๐—ณ๐—ผ๐—ฟ ๐— ๐—ฒ๐—ฑ๐—ถ๐—ฐ๐—ฎ๐—น ๐—”๐—ด๐—ฒ๐—ป๐˜๐˜€ ๐Ÿ”— arxiv.org/pdf/2605.26691 โ€ข ๐—˜๐—˜๐—š ๐—™๐—ผ๐˜‚๐—ป๐—ฑ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐— ๐—ผ๐—ฑ๐—ฒ๐—น๐˜€: ๐—ฆ๐—ฝ๐—ฒ๐—ฐ๐˜๐—ฟ๐—ฎ๐—น ๐—•๐—ถ๐—ฎ๐˜€ ๐—”๐—ป๐—ฎ๐—น๐˜†๐˜€๐—ถ๐˜€ ๐Ÿ”— arxiv.org/pdf/2605.26434 ๐Ÿ“Š ๐— ๐—ฒ๐—ฑ๐—ถ๐—ฐ๐—ฎ๐—น ๐—Ÿ๐—Ÿ๐— ๐˜€ & ๐—•๐—ฒ๐—ป๐—ฐ๐—ต๐—บ๐—ฎ๐—ฟ๐—ธ๐˜€ โ€ข ๐—•๐—ฒ๐—ป๐—ฐ๐—ต๐—บ๐—ฎ๐—ฟ๐—ธ๐—ถ๐—ป๐—ด ๐—ฃ๐—ฎ๐˜๐—ต๐—ผ๐—น๐—ผ๐—ด๐˜† ๐—™๐—ผ๐˜‚๐—ป๐—ฑ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐— ๐—ผ๐—ฑ๐—ฒ๐—น๐˜€ ๐Ÿ”— arxiv.org/pdf/2605.25764 โ€ข ๐— ๐—ฒ๐—ฑ๐—–๐—ฎ๐˜€๐—ฒ-๐—ฆ๐˜๐—ฟ๐˜‚๐—ฐ๐˜๐˜‚๐—ฟ๐—ฒ๐—ฑ: ๐—ง๐—ฒ๐˜…๐˜-๐˜๐—ผ-๐—™๐—›๐—œ๐—ฅ ๐—•๐—ฒ๐—ป๐—ฐ๐—ต๐—บ๐—ฎ๐—ฟ๐—ธ ๐—ณ๐—ผ๐—ฟ ๐—˜๐—›๐—ฅ ๐Ÿ”— arxiv.org/pdf/2605.30295 โ€ข ๐—–๐—–๐—ฆ: ๐—–๐—น๐—ถ๐—ป๐—ถ๐—ฐ๐—ฎ๐—น ๐—–๐—ผ๐—ป๐˜€๐—ฒ๐—ป๐˜€๐˜‚๐˜€ ๐—ณ๐—ผ๐—ฟ ๐—ฅ๐—ฎ๐—ฑ๐—ถ๐—ผ๐—น๐—ผ๐—ด๐˜† ๐—ฅ๐—ฒ๐—ฝ๐—ผ๐—ฟ๐˜๐˜€ ๐Ÿ”— arxiv.org/pdf/2605.30131 ๐Ÿฉบ ๐— ๐—ฒ๐—ฑ๐—ถ๐—ฐ๐—ฎ๐—น ๐—Ÿ๐—Ÿ๐—  ๐—”๐—ฝ๐—ฝ๐—น๐—ถ๐—ฐ๐—ฎ๐˜๐—ถ๐—ผ๐—ป๐˜€ โ€ข ๐—ฆ๐—จ๐—ฅ๐—š๐—˜๐—ก๐—ง: ๐—ฆ๐˜‚๐—ฟ๐—ด๐—ถ๐—ฐ๐—ฎ๐—น ๐— ๐˜‚๐—น๐˜๐—ถ-๐—”๐—ด๐—ฒ๐—ป๐˜ ๐—”๐˜€๐˜€๐—ถ๐˜€๐˜๐—ฎ๐—ป๐—ฐ๐—ฒ ๐—ฆ๐˜†๐˜€๐˜๐—ฒ๐—บ ๐Ÿ”— arxiv.org/pdf/2605.29368 โ€ข ๐—ฆ๐˜‚๐—ฟ๐—ณ๐—ฆ๐˜‚๐—ฟ๐—ด๐Ÿฒ๐——: ๐—ฆ๐˜‚๐—ฟ๐—ด๐—ถ๐—ฐ๐—ฎ๐—น ๐—œ๐—ป๐˜€๐˜๐—ฟ๐˜‚๐—บ๐—ฒ๐—ป๐˜ ๐—ฃ๐—ผ๐˜€๐—ฒ ๐—˜๐˜€๐˜๐—ถ๐—บ๐—ฎ๐˜๐—ถ๐—ผ๐—ป ๐Ÿ”— arxiv.org/pdf/2605.25598 ๐Ÿ“‚ ๐——๐—ฎ๐˜๐—ฎ๐˜€๐—ฒ๐˜๐˜€ โ€ข ๐—ฅ๐—ผ๐—ฏ๐—ผ๐˜-๐—ฃ๐—ฎ๐˜๐—ถ๐—ฒ๐—ป๐˜ & ๐——๐—ผ๐—ฐ๐˜๐—ผ๐—ฟ-๐—ฃ๐—ฎ๐˜๐—ถ๐—ฒ๐—ป๐˜ ๐— ๐—ฒ๐—ฑ๐—ถ๐—ฐ๐—ฎ๐—น ๐——๐—ถ๐—ฎ๐—น๐—ผ๐—ด๐˜‚๐—ฒ ๐——๐—ฎ๐˜๐—ฎ๐˜€๐—ฒ๐˜ ๐Ÿ”— arxiv.org/pdf/2605.26747 โ€ข ๐—›๐—˜๐—”๐—Ÿ๐—ง๐—›๐——๐—œ๐—”๐—Ÿ: ๐— ๐˜‚๐—น๐˜๐—ถ๐—น๐—ถ๐—ป๐—ด๐˜‚๐—ฎ๐—น ๐—ฆ๐—ฝ๐—ผ๐—ธ๐—ฒ๐—ป ๐——๐—ถ๐—ฎ๐—น๐—ผ๐—ด๐˜‚๐—ฒ ๐——๐—ฎ๐˜๐—ฎ๐˜€๐—ฒ๐˜ ๐Ÿ”— arxiv.org/pdf/2605.30107 ๐ŸŽ™๏ธ ๐—ช๐—ฎ๐—ป๐˜ ๐˜๐—ต๐—ฒ ๐—ฑ๐—ฒ๐—ฒ๐—ฝ ๐—ฑ๐—ถ๐˜ƒ๐—ฒ? YouTube Deep Dive: youtu.be/ECaXLUqV0hY Spotify: open.spotify.com/show/4edRuSโ€ฆ ๐—™๐—ผ๐—น๐—น๐—ผ๐˜„ ๐—ณ๐—ผ๐—ฟ ๐˜„๐—ฒ๐—ฒ๐—ธ๐—น๐˜† ๐— ๐—ฒ๐—ฑ๐—ถ๐—ฐ๐—ฎ๐—น ๐—”๐—œ ๐—ฟ๐—ผ๐˜‚๐—ป๐—ฑ๐˜‚๐—ฝ๐˜€! ๐Ÿ“ท ๐—ฅ๐—ฒ๐˜๐˜„๐—ฒ๐—ฒ๐˜ ๐˜๐—ผ ๐˜€๐—ฝ๐—ฟ๐—ฒ๐—ฎ๐—ฑ ๐˜๐—ต๐—ฒ ๐—ธ๐—ป๐—ผ๐˜„๐—น๐—ฒ๐—ฑ๐—ด๐—ฒ. #MedicalAI #LLM #MachineLearning #HealthcareAI #AIResearch
2
3
302
OOD-GraphLLM: Graph Large Language Model for Out-of-Distribution Generalized Drug Synergy Prediction 1 OOD-GraphLLM targets a practical failure mode in drug synergy prediction: new compounds introduce scaffold/size shifts, so test drugs can be topologically out-of-distribution (OOD) relative to training. The paper formalizes โ€œOOD generalized DSPโ€ where at least one drug in each test pair comes from an OOD drug set defined by scaffold or molecular weight. 2 The core idea is a unified GraphLLM pipeline that jointly optimizes (a) molecular graph representation learning and (b) biomedical language/semantic representations, so the model can reason over both topology (molecular graphs) and semantics (SMILES, retrieved drug knowledge, cell descriptions) under distribution shift. 3 Component 1: Target-adaptive disentangled molecular graph encoding. Each drug graph embedding is decomposed into target-irrelevant and target-relevant parts, then the target-relevant part is conditioned on drug-associated protein targets via cross-attention to ESM-2 protein embeddings. A decorrelation loss explicitly pushes different target-conditioned representations to capture non-redundant target-specific signals, improving OOD generalization. 4 Component 2: Pairwise attentive graph architecture search (NAS) for drug pairs. Instead of using a fixed GNN, OOD-GraphLLM dynamically routes among candidate message-passing operators (e.g., GCN/GIN/GAT/SAGE/GraphConv/MLP variants) using pairwise attention-informed drug representations. Operators are embedded in a latent space with a cosine-separation regularizer to avoid collapse, enabling differentiable, pair-adaptive architecture selection. 5 Component 3: Multi-level contextualized cellular feature alignment. Cell line context is injected both structurally (concatenating projected gene-expression context to each atom feature before message passing) and semantically (tokenized cell descriptions plus projected gene-expression embeddings aligned to the LLM input space). This treats the cell line as a first-class โ€œcontextโ€ for synergy. 6 Component 4: DrugSyn-LLM with retrieval-augmented biomedical instruction tuning. The authors fine-tune a biomedical LLM (Galactica backbone) in two stages: (i) instruction tuning to reproduce curated drug descriptions retrieved deterministically from DrugBank (with manual supplementation from trusted sources when needed), then (ii) task training to generate both synergy label and synergy score, while also injecting projected drug-graph and cell embeddings as continuous tokens. 7 Data and evaluation emphasize true distribution shift. Experiments use DrugComb triplets (drug1, drug2, cell line) with four synergy scoring schemes (Loewe/Bliss/HSA/ZIP), filtered to |score| โ‰ฅ 10. OOD splits are constructed by scaffold thresholds or size (molecular weight) thresholds, producing clear train/test separation in chemical space (t-SNE), unlike random splits. 8 Results: across scaffold-based and size-based OOD settings, OOD-GraphLLM outperforms DNN, GNN, and LLM baselines (including CancerGPT and BAITSAO) on both classification (ACC/AUC) and regression (MAE/RMSE) for all four scoring schemes. Gains are especially notable for regression, consistent with the claim that numerical synergy prediction under OOD shift is harder than classification. 9 Ablations show each module matters; removing cellular context (w/o Ctx) or disabling NAS (w/o NAS) causes the largest drops, particularly on regression. Removing retrieval-augmented instruction tuning, disentanglement decorrelation, pairwise attention, or operator-separation regularization also consistently degrades performance, supporting the โ€œjoint optimizationโ€ design. 10 Interpretability analyses suggest the model learns meaningful signals: target-level attention highlights plausible mechanisms (e.g., KU-55933 attending to ATM; Imiquimod to TLR7), and SMILES attention focuses on chemically interpretable fragments (e.g., polar head groups, heteroatom-rich nucleoside regions, fluorinated aromatic motifs). A case study (5-Fluorouracil Vorinostat in NCI-H226) illustrates how target-adaptive modeling can align mechanistic clues across structurally divergent OOD drugs. ๐Ÿ’ปCode: github.com/EkkoXiao/Bio-Grapโ€ฆ ๐Ÿ“œPaper: arxiv.org/abs/2605.30247 #ComputationalBiology #Bioinformatics #DrugDiscovery #GNN #LLM #GraphML #OOD #SynergyPrediction #MultimodalAI #MachineLearning
3
13
1,191
Towards Multi-modal Graph Large Language Models Multi-modal graphs, which integrate diverse multi-modal features and relations, are ubiquitous in real-world applications. However, existing multi-modal graph learning methods are typically trained from scratch for specific graph data and tasks, failing to generalize across various multi-modal graph data and tasks. To bridge this gap, new research explores the potential of Multi-modal Graph Large Language Models (MG-LLM) to unify and generalize across diverse multi-modal graph data and tasks. It proposes a unified framework of multi-modal graph data, task, and model, discovering the inherent multi-granularity and multi-scale characteristics in multi-modal graphs. Specifically, it presents five key desired characteristics for MG-LLM: 1) unified space for multi-modal structures and attributes, 2) capability of handling diverse multi-modal graph tasks, 3) multi-modal graph in-context learning, 4) multi-modal graph interaction with natural language, and 5) multi-modal graph reasoning. The paper elaborates on the key challenges, review related works, and highlight promising future research directions towards realizing these ambitious characteristics. Finally, it summarizes existing multi-modal graph datasets pertinent for model training. The key insight is treating all graph tasks as generative problems. Instead of training separate models for node classification, link prediction, or graph reasoning, MG-LLM frames everything as transforming one multi-modal graph into another. A contribution to the ongoing advancement of the research towards MG-LLM for generalization across multi-modal graph data and tasks. arxiv.org/abs/2506.09738v1 #AI #GenAI #EmergingTech #MultimodalGraphs #GraphLLM #NeuralNetworks #MachineLearning #GraphML #DeepLearning #DataScience #Research #GraphTransformers #LLMs -- Connected Data London 2025 has been announced! 20-21 November, Leonardo Royal Hotel London Tower Bridge Join us for all things #KnowledgeGraph #Graph #analytics #datascience #AI #graphDB #SemTech #Ontology ๐ŸŽŸ๏ธ Ticket sales are open. Benefit from early bird prices with discounts up to 30%. 2025.connected-data.london ๐Ÿ“‹ Call for submissions is open. Check topics of interest, submission process and evaluation criteria connected-data.london/call-fโ€ฆ ๐Ÿ“บ Sponsorship opportunities are available. Maximize your exposure with early onboarding. Contact us at info@connected-data.london for more.
6
12
523
Replying to @_maestro_04
recent literature (GoT, ALPHALLM, GraphLLM, etc) suggests: >search strategies improve accuracy and quality >search strategies get better with more capable foundation models as the quality of foundation models seems poised to increase, i think llm search will be promising
1
1
7
217