Designing for Inference in Future Generative Models
The rapid evolution of generative models has significantly advanced artificial intelligence, enabling the creation of human-like text, realistic images, and even scientific discoveries. Powered by transformer architectures and vast datasets, these models demonstrate remarkable proficiency across various domains. However, as these models become increasingly large and sophisticated, they face substantial computational challenges. The quadratic complexity inherent in attention mechanisms during inference poses a significant bottleneck, restricting practical deployment—especially in resource-constrained environments. Consequently, despite their impressive capabilities, the scalability and accessibility of current generative models remain constrained. This thesis addresses these challenges by designing new models and inference paradigms for future generative models that retain or surpass high-quality outputs while significantly improving computational efficiency. We investigate how increasing context complexity impacts computational efficiency and model performance, identifying bottlenecks in current architectures (RQ1). Leveraging architectural innovations and advanced model compression techniques, we develop novel models that optimize inference for detailed and high-resolution outputs without incurring prohibitive computational costs (RQ2). We adapt these models for deployment in resource-constrained environments without sacrificing performance or capabilities, broadening their accessibility and practicality (RQ3). Additionally, we enhance interpretability and usability by studying how users make sense of interactions with generative models, ensuring fairness and facilitating meaningful human engagement in user-facing applications (RQ4). Our contributions advance the design of inference paradigms for future generative models, paving the way for scalable, efficient, and user-friendly systems that bridge the gap between advanced capabilities and real-world deployment.