Fine-tuning Generative Model Using Efficient Decoding Instances
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing decoding methods for generative models, which achieve improved accuracy, are less computationally efficient, leading to significant resource utilization and latency, particularly when processing large volumes of inputs.
Innovation Solution
Utilizing a less computationally efficient decoding method to generate training instances for fine-tuning a student generative model, and then employing a more computationally efficient decoding method at inference time to generate generative predictions, thereby balancing accuracy and computational efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a less computationally efficient decoding method (such as QE reranking or MBR decoding) is used to decode probability distributions, then the accuracy of generative content is improved, but computational resource utilization increases and latency increases
Solution Approach 1:
The system performs preliminary action by using the less computationally efficient decoding method to generate training instances and fine-tune the student generative model before actual inference. This preliminary fine-tuning process embeds the accuracy benefits of sophisticated decoding methods into the model itself, so that during subsequent inference, simpler and faster decoding methods can achieve comparable accuracy without the computational cost of the original sophisticated methods.
Solution Approach 2:
The system creates a student generative model that copies the desirable accuracy characteristics from a teacher model fine-tuned with sophisticated decoding methods. The student model is trained on training instances generated using QE reranking or MBR decoding, allowing the student to inherit these accuracy properties while being deployed with more efficient decoding methods.
2Measurement precision
If a less computationally efficient decoding method is used to decode probability distributions, then the accuracy of generative content is improved, but latency increases
Solution Approach 1:
The system performs preliminary action by using the less computationally efficient decoding method to generate training instances and fine-tune the student generative model before actual inference. This preliminary fine-tuning process embeds the accuracy benefits of sophisticated decoding methods into the model itself, so that during subsequent inference, simpler and faster decoding methods can achieve comparable accuracy without the computational cost of the original sophisticated methods.
Solution Approach 2:
The system creates a student generative model that copies the desirable accuracy characteristics from a teacher model fine-tuned with sophisticated decoding methods. The student model is trained on training instances generated using QE reranking or MBR decoding, allowing the student to inherit these accuracy properties while being deployed with more efficient decoding methods.
3Productivity
If a more computationally efficient decoding method is used to decode probability distributions, then computational resource utilization is reduced and latency is reduced, but the accuracy of generative content deteriorates
Solution Approach 1:
The system performs preliminary action by using the less computationally efficient decoding method to generate training instances and fine-tune the student generative model before actual inference. This preliminary fine-tuning process embeds the accuracy benefits of sophisticated decoding methods into the model itself, so that during subsequent inference, simpler and faster decoding methods can achieve comparable accuracy without the computational cost of the original sophisticated methods.
Solution Approach 2:
The system creates a student generative model that copies the desirable accuracy characteristics from a teacher model fine-tuned with sophisticated decoding methods. The student model is trained on training instances generated using QE reranking or MBR decoding, allowing the student to inherit these accuracy properties while being deployed with more efficient decoding methods.
Data Source
AI summary
Implementations disclose utilizing a less computationally efficient decoding method in automatically generating corresponding single generative content predictions for training instances and fine-tuning a student generative model based on those automatically generated training instances. Those implementations are further directed to then utilizing, in an inference time environment, the fine-tuned student generative model and a more computationally efficient decoding method in generating generative predictions—and without any utilization of the less computationally efficient decoding method in generating the generative predictions.


