REVIEW 2 cited by
Design Principle Transfer in Neural Architecture Search via Large Language Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Transferable neural architecture search (TNAS) has been introduced to design efficient neural architectures for multiple tasks, to enhance the practical applicability of NAS in real-world scenarios. In TNAS, architectural knowledge accumulated in previous search processes is reused to warm up the architecture search for new tasks. However, existing TNAS methods still search in an extensive search space, necessitating the evaluation of numerous architectures. To overcome this challenge, this work proposes a novel transfer paradigm, i.e., design principle transfer. In this work, the linguistic description of various structural components' effects on architectural performance is termed design principles. They are learned from established architectures and then can be reused to reduce the search space by discarding unpromising architectures. Searching in the refined search space can boost both the search performance and efficiency for new NAS tasks. To this end, a large language model (LLM)-assisted design principle transfer (LAPT) framework is devised. In LAPT, LLM is applied to automatically reason the design principles from a set of given architectures, and then a principle adaptation method is applied to refine these principles progressively based on the new search results. Experimental results show that LAPT can beat the state-of-the-art TNAS methods on most tasks and achieve comparable performance on others.
Forward citations
Cited by 2 Pith papers
-
Towards Efficient Few-shot Graph Neural Architecture Search via Partitioning Gradient Contribution
GC splits a graph supernet into sub-supernets by grouping modules with similar gradient contributions, and UGAS searches combined MPNN and graph transformer architectures; the searched GNNs beat several baselines.
-
Scaling Closed-Loop Feature Channel Configuration with LLMs
Scaling LLM-generated channel-configuration search from sparse to 250 candidates per cycle yields a modest mean-accuracy trend, a frontier improvement from 0.3144 to 0.3676, and measurable channel-allocation regularities.
Discussion (0). Sign in to comment.