Adaptive Graph Pooling for Scalable and Efficient Code Generation Models
Description
This report synthesises findings from 13 peer-reviewed papers addressing the following research question: To what extent does adaptive graph pooling improve the scalability and convergence speed of code generation models trained on large-scale code property graphs compared to static pooling strategies. Deep convolutional neural networks have performed remarkably well on many Computer Vision tasks. However, these networks are heavily reliant on big data to avoid overfitting. 9 claims were extracted from source literature; 9 were independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 9.0/10. This report is a machine-generated literature synthesis and does not constitute original research.
Research goal: To what extent does adaptive graph pooling improve the scalability and convergence speed of code generation models trained on large-scale code property graphs compared to static pooling strategies?
Autonomous literature synthesis. Automated review score: 9.0/10. Full text and citation available at Assignee Research.
Notes
Files
paper.pdf
Files
(74.2 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:1079a1dae33312a64c8e0eef99ac77ef
|
74.2 kB | Preview Download |
Additional details
Related works
- Is compiled by
- https://assignee.net (URL)