Off-Policy Reinforcement Learning for Efficient and Effective GAN Architecture Search
원문 초록
In this paper, we introduce a new reinforcement learning (RL) based neural architecture search (NAS) methodology for effective and efficient generative adversarial network (GAN) architecture search. The key idea is to formulate the GAN architecture search problem as a Markov decision process (MDP) for smoother architecture sampling, which enables a more effective RL-based search algorithm by targeting the potential global optimal architecture. To improve efficiency, we exploit an off-policy GAN architecture search algorithm that makes efficient use of the samples generated by previous policies. Evaluation on two standard benchmark datasets (i.e., CIFAR-10 and STL-10) demonstrates that the proposed method is able to discover highly competitive architectures for generally better image generation results with a considerably reduced computational burden: 7 GPU hours. Our code is available at https://github.com/Yuantian013/E2GAN.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
AutoTriton: Automatic Triton Programming with Reinforcement Learning in LLMs
Confucius3-Math: A Lightweight High-Performance Reasoning LLM for Chinese K-12 Mathematics Learning
Kevin: Multi-Turn RL for Generating CUDA Kernels
HybridQ: Hybrid Classical-Quantum Generative Adversarial Network for Skin Disease Image Generation
Instella-T2I: Pushing the Limits of 1D Discrete Latent Space Image Generation
Generation of Indian Sign Language Letters, Numbers, and Words
토론
이 논문과 연결된 포럼 글이 아직 없습니다.