Methods › Computer Vision › Localization Models › Fragmentation

Fragmentation

123 papers tagged archive 2025-07-28

Introduced by Anant Kumar et al. in Improving Expressivity of Graph Neural Networks using Localization

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Given a pattern P, that is more complicated than the patterns, we fragment P into simpler patterns such that their exact count is known. In the subgraph GNN proposed earlier, look into the subgraph of the host graph. We have seen that this technique is scalable on large graphs. Also, we have seen that subgraph GNN is more expressive and efficient than traditional GNN. So, we tried to explore the expressibility when the pattern is fragmented into smaller subpatterns.

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Near matches the lookup lists, each a different name: Fragmentation Score (FS); prediction fragmentation; Semantic Intent Fragmentation (SIF); multilingual Date Fragmentation Ratio (mDFR); Simple Input Control Based on Learnable Fragmentation.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 123 · with a code link: 47 · where Syntology ran a sample: 12 (10 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (12 of 123 tagged: 10 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)

Page 1 of 2: papers 1 to 100 of 123, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 159 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Management10
GPU8
Language Modeling8
Language Modelling8
Large Language Model6
Semantic Segmentation6
Federated Learning5
Benchmarking4
Clustering4
Diversity4
Recommendation Systems4
Segmentation4
CPU3
Graph Neural Network3
Navigate3
RAG3
Retrieval-augmented Generation3
model3
Drug Design2
Drug Discovery2

Usage over time archive 2025-07-28

Papers per year tagged with Fragmentation: 2023 to 2025, peak 55 55 0 2023: 31 papers 2023 2024: 55 papers 2024 2025: 37 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (123 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Localization Models

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections