paper-with-me

Papers

Test-Time Instance-Specific Parameter Composition: A New Paradigm for Adaptive Generative Modeling

2026-03-29 · Minh-Tuan Tran, Xuan-May Le, Quan Hung Tran, Mehrtash Harandi, Dinh Phung, Trung Le arxiv

Existing generative models, such as diffusion and auto-regressive networks, are inherently static, relying on a fixed set of pretrained parameters to handle all inputs. In contrast, humans flexibly adapt their internal generative representations to each perceptual or imaginative context. Inspired by this capability, we introduce Composer, a new paradigm for adaptive generative modeling based on test-time instance-specific parameter composition. Composer generates input-conditioned parameter adaptations at inference time, which are injected into the pretrained model's weights, enabling per-input specialization without fine-tuning or retraining. Adaptation occurs once prior to multi-step generation, yielding higher-quality, context-aware outputs with minimal computational and memory overhead. Experiments show that Composer substantially improves performance across diverse generative models and use cases, including lightweight/quantized models and test-time scaling. By leveraging input-aware parameter composition, Composer establishes a new paradigm for designing generative models that dynamically adapt to each input, moving beyond static parameterization.

📄 PDF Abstract BibTeX arXiv:2603.27665

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Learning the Compositional Spaces for Generalized Zero-shot Learning

2018-10-17 · ICLR 2019 5 · Hanze Dong, Yanwei Fu, Sung Ju Hwang, Leonid Sigal 외

This paper studies the problem of Generalized Zero-shot Learning (G-ZSL), whose goal is to classify instances belonging to both seen and unseen classes at the test time. We propose a novel space decomposition method to s…

Generalized Zero-Shot LearningOpen Set LearningZero-Shot Learning

Unobserved Local Structures Make Compositional Generalization Hard

2022-01-15 · Ben Bogin, Shivanshu Gupta, Jonathan Berant

While recent work has convincingly showed that sequence-to-sequence models struggle to generalize to new compositions (termed compositional generalization), little is known on what makes compositional generalization hard…

Semantic Parsing

Solving Feature Sparseness in Text Classification using Core-Periphery Decomposition

2018-06-01 · SEMEVAL 2018 6 · Xia Cui, Sadamori Kojaku, Naoki Masuda, Danushka Bollegala

Feature sparseness is a problem common to cross-domain and short-text classification tasks. To overcome this feature sparseness problem, we propose a novel method based on graph decomposition to find candidate features f…

ClassificationDomain AdaptationGeneral ClassificationSentiment Analysis+3

Investigating the Compositional Structure Of Deep Neural Networks

2020-02-17 · Francesco Craighero, Fabrizio Angaroni, Alex Graudenzi, Fabio Stella 외

The current understanding of deep neural networks can only partially explain how input structure, network parameters and optimization algorithms jointly contribute to achieve the strong generalization power that is typic…

Long-time prediction of nonlinear parametrized dynamical systems by deep learning-based ROMs

2021-09-27 · NeurIPS Workshop DLDE 2021 12 · Stefania Fresca, Federico Fatone, Andrea Manzoni

Deep learning-based reduced order models (DL-ROMs) have been recently proposed to overcome common limitations shared by conventional ROMs - built, e.g., through proper orthogonal decomposition (POD) - when applied to non…

Dimensionality Reduction