STEPS: Sequential Probability Tensor Estimation for Text-to-Image Hard Prompt Search
Recent text-to-image (T2I) diffusion models have demonstrated remarkable capabilities in visual synthesis, yet their performance heavily relies on the quality of input prompts. However, optimizing discrete prompts remains challenging because the discrete nature of tokens prevents the direct application of the gradient descent method and the vast search space of possible token combinations. As a result, existing approaches either suffer from quantization errors when employing continuous optimization techniques or become trapped in local optima due to coordinate-wise greedy search. In this paper, we propose STEPS, a novel Sequential probability Tensor Estimation approach for hard Prompt Search. Our method reformulates discrete prompt optimization as a sequential probability tensor estimation problem, leveraging the inherent low-rank characteristics to address the curse of dimensionality. To further improve the computational efficiency, we develop a memory-bounded sampling approach that shrinks the prompt space without the iteration step dependency while preserving sequential optimization dynamics. Extensive experiments on various public datasets demonstrate that our method consistently outperforms existing approaches in T2I generation, cross-model prompt transferability, and harmful prompt optimization, validating the effectiveness of the proposed framework.
Code (0)
등록된 구현이 없습니다.
Tasks
Computational EfficiencyQuantizationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Guaranteed Simultaneous Asymmetric Tensor Decomposition via Orthogonalized Alternating Least Squares
Tensor CANDECOMP/PARAFAC (CP) decomposition is an important tool that solves a wide class of machine learning problems. Existing popular approaches recover components one by one, not necessarily in the order of larger co…
Tensor DecompositionRecovery of Joint Probability Distribution from one-way marginals: Low rank Tensors and Random Projections
Joint probability mass function (PMF) estimation is a fundamental machine learning problem. The number of free parameters scales exponentially with respect to the number of random variables. Hence, most work on nonparame…
Tensor DecompositionSALSA: A Sequential Alternating Least Squares Approximation Method For MIMO Channel Estimation
In this paper, we consider the channel estimation problem in sub-6 GHz uplink wideband MIMO-OFDM communication systems, where a user equipment with a fully-digital beamforming structure is communicating with a base stati…
Graph-based sequential beamforming
This paper presents a Bayesian estimation method for sequential direction finding. The proposed method estimates the number of directions of arrivals (DOAs) and their DOAs performing operations on the factor graph. The g…
Bayesian InferenceRobust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering
Consider the task of estimating a 3-order $n \times n \times n$ tensor from noisy observations of randomly chosen entries in the sparse regime. We introduce a similarity based collaborative filtering algorithm for estima…
Collaborative Filtering