Paper deep dive
PrefLUT: Reusable and Refinable Personalized Color Editing from Pairwise Preferences
Chuanzhi Xu, Langyi Chen, Chengkun Yue, Xuanhua Yin, Boyu Wei, Qingwen Zeng, Zihan Deng, Weidong Cai
Intelligence
Status: not_run | Model: - | Prompt: - | Confidence: 0%
Entities (0)
Relation Signals (0)
No relation signals yet.
Cypher Suggestions (0)
No Cypher suggestions yet.
Abstract
Abstract:Photographic color editing is inherently personal: the same image can appear too warm, too muted, or already satisfactory to different users. Most lookup table (LUT) and reference-guided methods target a specified appearance rather than model persistent preferences from repeated user choices. To address this gap, we introduce PrefLUT, a reusable and refinable user-preference modeling framework for deployable 3D LUTs, encoding ordered preferred/non-preferred image pairs into a lightweight Reusable User Profile that is reused across queries and refined using additional user preference pairs, without per-user optimization. A Query-Conditioned LUT Predictor combines this profile with each image to predict a LUT latent vector and edit strength. An Identity-Residual LUT Decoder and Edit-Strength Controller then produce an exportable 3D LUT. Experiments on three datasets demonstrate effective personalized editing and general-purpose enhancement. Each quantized profile requires only 260 bytes, and editing takes 1.365 ms/image on an RTX 5090 GPU. We also introduce the Preference-Conditioning Verification Protocol (PCVP), an evaluation protocol to verify whether personalized image edits depend on user preferences and the query image through controlled changes to user profiles, preference orders, pair correspondences, and query images.
Tags
Links
- Source: https://arxiv.org/abs/2609.34133v1
- Canonical: https://arxiv.org/abs/2609.34133v1
Trouble viewing inline? Open PDF directly →
Full Text
120,440 characters extracted from source content.
Expand or collapse full text
Preprint PREFLUT: REUSABLE AND REFINABLE PERSONALIZED COLOR EDITING FROM PAIRWISE PREFERENCES Chuanzhi Xu 1,* Langyi Chen 1 Chengkun Yue 2 Xuanhua Yin 1 Boyu Wei 1 Qingwen Zeng 1 Zihan Deng 3 Weidong Cai 1 1 The University of Sydney 2 Indiana University 3 The University of Hong Kong * Corresponding author: chuanzhi.xu@sydney.edu.auProject Page ABSTRACT Photographic color editing is inherently personal: the same image can appear too warm, too muted, or already satisfactory to different users. Most lookup ta- ble (LUT) and reference-guided methods target a specified appearance rather than model persistent preferences from repeated user choices. To address this gap, we in- troduce PrefLUT, a reusable and refinable user-preference modeling framework for deployable 3D LUTs, encoding ordered preferred/non-preferred image pairs into a lightweight Reusable User Profile that is reused across queries and refined using ad- ditional user preference pairs, without per-user optimization. A Query-Conditioned LUT Predictor combines this profile with each image to predict a LUT latent vector and edit strength. An Identity-Residual LUT Decoder and Edit-Strength Controller then produce an exportable 3D LUT. Experiments on three datasets demonstrate effective personalized editing and general-purpose enhancement. Each quantized profile requires only 260 bytes, and editing takes 1.365 ms/image on an RTX 5090 GPU. We also introduce the Preference-Conditioning Verification Protocol (PCVP), an evaluation protocol to verify whether personalized image edits depend on user preferences and the query image through controlled changes to user profiles, preference orders, pair correspondences, and query images. 1INTRODUCTION Color and tone shape a photograph’s perceived quality, mood, and visual intent. Modern retouching methods learn fast global or spatially aware color transforms from expert-edited images (Bychkovsky et al., 2011; Zeng et al., 2022; Yang et al., 2022a;b; Kim & Cho, 2024). Lookup table (LUT) models predict lightweight color mappings that can be applied to full-resolution images, exported, inspected, and reused, making LUTs attractive for efficient color editing. Nevertheless, most learned-LUT methods optimize a shared target, such as one retoucher in MIT-Adobe FiveK or one expert in PPR10K (Bychkovsky et al., 2011; Liang et al., 2021), whereas reference-guided methods use a single style image to define the desired appearance and predict a preset, implicit color map, 3D LUT, or spatial 4D LUT (Ho & Zhou, 2021; Lin et al., 2023; Ke et al., 2023; Li et al., 2025; Gong et al., 2025; Ma et al., 2026). However, a personal preference is different: it is expressed through repeated choices, may be stable only along selected color dimensions, must be separated from image content unrelated to preferences, and refined as feedback accumulates. The Personalized Photographic Style Dataset (PPSD) establishes this setting through pairwise user choices and evaluates whether an output remains faithful while moving toward a user’s preferred appearance (Kim et al., 2026). However, its proposed baselines do not explicitly output LUTs. Moreover, without comparing edits of the same query conditioned on the intended user, another user, or a population-level preference, its preference-alignment scores alone cannot distinguish the use of user-specific preferences from editing tendencies shared across users. This gap raises a central question: Can preferred/non-preferred image pairs form a reusable user profile that can be refined by aggregating new feedback again to predict explicit LUTs for new images without per-user optimization, and can we verify that these edits reflect the user’s preferences and each query image’s content rather than editing tendencies shared across users? 1 arXiv:2609.34133v1 [cs.CV] 28 Sep 2026 Preprint User AUser B Ordered Preference Pairs User AUser B PrefLUT Inference Examples Non-preferred Preferred Input PrefLUT Output Figure 1: Preference-conditioned editing across users. Examples from two PPSD users show ordered preferred/non-preferred image pairs (top) and unseen inputs with PrefLUT outputs (bottom). PrefLUT outputs reflect each user’s color preferences across different scenes. We answer this question with PrefLUT, which is a reusable and refinable user-preference modeling framework designed for deployable 3D LUTs. The framework divides personalized color editing into profile construction and query-time editing. During profile construction, an Ordered Preference Encoder maps each ordered preference pair to an ordered preference token, and the Preference Set Aggregator summarizes the tokens before a Reusable User Profile is stored. During query-time editing, a Query Image Encoder extracts a query feature from the new image. The Query-Conditioned LUT Predictor combines this feature with the Reusable User Profile to predict a LUT latent vector and edit strength. An Identity-Residual LUT Decoder converts the latent vector into a LUT, and the Edit-Strength Controller scales its residual before full-resolution application. New preference selections or user-confirmed edits provide additional preferred/non-preferred image pairs, which are aggregated with retained pairs to refine the profile while keeping network weights frozen. Figure 1 shows examples of personalized color editing for different users. We evaluate PrefLUT on three datasets and introduce the Preference-Conditioning Verification Protocol (PCVP) to test whether edits respond to user preferences and the query image. Results demonstrate strong personalized editing and general-purpose enhancement. Experiments that accu- mulate retouching preference feedback to refine profiles show improved editing on unseen queries without updating network weights. Our contributions can be summarized as follows: • We propose PrefLUT, a reusable and refinable user-preference modeling framework for deployable 3D LUTs. Its profile can be rebuilt from updated feedback and supports explicit, query-conditioned LUT prediction for new images without per-user optimization. •We introduce PCVP as a systematic verification protocol for personalized image enhance- ment and color grading. Its five controlled tests assess quality gains from the intended user’s preferences and current query image, providing the field with a rigorous personalization test. •Experiments on three datasets demonstrate effective personalized editing and general- purpose enhancement. PrefLUT leads all four direct fidelity metrics and achieves the highest Comparative Quality Score (CQS) (Kim et al., 2026) under∆E 00 , LPIPS, and SSIM among the compared PPSD methods and passes all five PCVP tests. Additional preference feedback improves editing on unseen queries through profile refinement with frozen network weights. 2RELATED WORK Learned LUTs and Reusable Color Transforms.Learned LUT methods express global or spatial color edits as lightweight mappings without requiring full-resolution neural decoding. LUT-based representatives include Image-Adaptive 3D-LUT, Spatial-Aware 3D LUT, 4D LUT, BGrid, AdaInt, SepLUT, CLUT-Net, NILUT, and neural LUT encoding (Zeng et al., 2022; Wang et al., 2021; Liu et al., 2023; Kim & Cho, 2024; Yang et al., 2022a;b; Zhang et al., 2022; Conde et al., 2024; Zehtab et al., 2025). Meanwhile, preset-based methods such as Deep Preset, AdaCM, and Neural Preset encode reusable appearance through retouching parameters, implicit mappings, or style representations (Ho & Zhou, 2021; Lin et al., 2023; Ke et al., 2023). However, these methods are typically trained to reproduce a shared target, select from a fixed set of styles, or transfer the appearance of a single 2 Preprint ! ! " ! ! # ! ! " $ " $ # ! " # ! # # ! " −# ! # # !" , # !# , # !" − # !# ! " ! ×# " " " # # $ [ % × ' % ] % ! " % # " % $ " % % " [' & ×) ' ] " & & # $ # $ " ! " ! + & ! !"#$ ) ' ( ( &,( ) , * ' !=+,,,...,. & ! / ! / ↓ " / + ) + & , 12 -+ & . 3 /∘. 4 - + & ,1 / , ',) 2 -"./0⋅ 134+ 5 , + 2, ',) 3 !+ ! " ',) =" !+ +% ',) &' ',) −" !+ ) * % ',) % 4 ) 5 4 ',) 5 3 ',) Figure 2: PrefLUT pipeline. Profile Construction (top) encodes ordered preference image pairs into a Reusable User Profile that can be refined with new feedback. Query-Time Editing (bottom) combines the stored profile with each query image to predict a 3D LUT for full-resolution editing. reference image. In contrast, our PrefLUT infers a persistent preference from multiple ordered choices and predicts an explicit query-conditioned LUT, enabling reusable and refinable personalization, efficient full-resolution application, and direct export to color-grading workflows. Reference-Guided and Generative LUTs.Reference-image-guided and generative LUT methods use a current image, reference, text, or generative prior to produce flexible color transforms. Rep- resentative methods include D-LUT, SA-LUT, AceTone, StatLUT, and FlowLUT (Li et al., 2025; Gong et al., 2025; Ma et al., 2026; Wang et al., 2026; Hu et al., 2025). However, they condition each edit independently and do not aggregate repeated ordered choices into a persistent user preference. In contrast, our PrefLUT updates the profile when feedback arrives and reuses it to predict explicit query-conditioned LUTs, without reprocessing preference references at query time. Personalized Aesthetic Enhancement.Personalized enhancement follows individual preferences, whereas general-purpose enhancement optimizes a shared aesthetic target. PieNet encodes preferred images into user preference vectors (Kim et al., 2020). StarEnhancer represents multiple tonal styles within one model (Song et al., 2021), while PIE-MSM uses masked style modeling to predict content- aware edits from preferred images (Kosugi & Yamasaki, 2024). PerTouch combines diffusion-based retouching with user feedback and scene-aware memory (Chang et al., 2026). PPSD evaluates User- specific Decoder, User Preference Embedding (UPE), and Exemplar-based Inference for learning pairwise preferences (Kim et al., 2026). However, these methods do not jointly support profile refinement from pairwise feedback and exportable LUT-based editing. PrefLUT uses a compact, reusable profile refined from preference pairs to predict exportable, query-conditioned 3D LUTs. 3PREFLUT Overview and Problem Formulation. Figure 2 illustrates the two stages of PrefLUT: Profile Construction and Query-Time Editing. For useru, the current reference setS u = (I + i ,I − i ) N u i=1 containsN u ordered preference image pairs used to construct the profile, whereI + i andI − i are the preferred and non-preferred images for useru. Given an unseen query imageI q and its resized thumbnailI ↓ q , PrefLUT predicts a global 3D LUT b L u,q . Its trilinear color mappingT ( b L u,q ,I q ) should move the query toward the user’s repeated color choices in S u while preserving its content. The pipeline outlined in Section 1 and Appendix A.1 is expressed mathematically as: p u = f profile (S u ),(z u,q ,g u,q ) = f query (p u ,I ↓ q ), b L u,q = f LUT (z u,q ,g u,q ), b I u,q =T ( b L u,q ,I q ). (1) Heref profile constructs or refines the profile from the currentS u ,f query predicts the LUT latent vector and edit strength, andf LUT produces the final LUT. b I u,q is the edited image.p u ∈R d p is the 3 Preprint Reusable User Profile, whered p is the profile width.z u,q ∈R d z is the lightweight LUT latent vector predicted for the current query, whered z is the LUT latent vector width. Finally,g u,q ∈ [0, 1]is its edit strength. 3.1PROFILE CONSTRUCTION Ordered Preference Encoder. Each image in an ordered preference image pair passes through the same reference image encoderE r . For pairi, the preferred and non-preferred features are a + i = E r (I + i )anda − i = E r (I − i ). The Ordered Preference Encoder keeps the preference direction in each token: t i = φ [a + i ,a − i ,a + i − a − i ] ∈R d f ,(2) whered f is the feature width,[·]denotes concatenation, andφis a learned pair projection. The first two terms retain the preferred and non-preferred image features, whilea + i − a − i records the feature change from the non-preferred image to the preferred image. Swapping the preference labels reverses both the feature order and the sign of the difference.t i is termed an ordered preference token. It records preference direction without requiring pixel alignment. Preference Set Aggregator and Reusable User Profile.The Preference Set Aggregator combines all ordered preference tokens into a user feature that is invariant to their list order. The aggregator prependsKlearned pooling tokensP (0) ∈R K×d f to the ordered preference tokens and processes them jointly withLstandard Transformer blocks that do not use positional embeddings, following the attention-based set formulation of Set Transformer (Lee et al., 2019): H (0) u = [P (0) ,t 1 ,...,t N u ], H (ℓ+1) u = TrBlock ℓ (H (ℓ) u ).(3) HereH (ℓ) u is the token sequence afterℓblocks, andTrBlock ℓ is theℓ-th Transformer block. Appendix A.2 details batching and valid-pair masking. After the final block, the learned pool- ing token outputs are averaged and layer-normalized to obtain the aggregated user featurer u = LN(K −1 P K k=1 H (L) u,k )∈R d f , wherekindexes theKlearned pooling tokens. The Profile Projection B down then produces the Reusable User Profilep u = B down (r u ) ∈R d p . The profile is the only per-user data needed at query time. When users make new choices or confirm manual edits, this feedback is converted into ordered preference image pairs to refine the profile. Selected and rejected images, or edited results and preceding candidates, serve as the preferred and non-preferred images, respectively. These new pairs are incorporated into the reference set at updatet. The retained pairs are then re-encoded and aggregated to obtainp (t) u = f profile (S (t) u ) , with all network weights frozen. S (t) u retains either cumulative feedback or a recent feedback window. The updated profile is stored and reused to predict a personalized LUT for each subsequent query image. 3.2QUERY-TIME EDITING Query-Conditioned LUT Predictor. At query time, Profile Expansion maps the profile back to the feature width, while the separate Query Image Encoder extracts the query feature from the thumbnail. The expanded user feature summarizes the currently retained preferences, while the query feature describes the content and color distribution of the current image. The Query-Conditioned LUT Predictor concatenates these two vectors and passes them to the LUT latent vector head and edit-strength head: ̄p u = B up (p u ),c q = E q (I ↓ q ), z u,q = h z ([ ̄p u ,c q ]), g u,q = σ(h g ([ ̄p u ,c q ])), (4) whereh z andh g are the LUT latent vector and edit-strength heads, andσis the sigmoid function. PrefLUT predicts a new LUT latent vector and edit strength for every query. Identity-Residual LUT Decoder.PrefLUT uses a learned low-dimensional Identity-Residual LUT Decoder. For grid resolutionR, the Identity-Residual LUT Decoder predicts a residual around the identity LUT and clips the resulting LUT to [0, 1] R×R×R×3 : D(z) = clip [0,1] L id + β tanh Ψ(z) ,(5) 4 Preprint whereL id is the identity LUT,Ψis the learned LUT decoding function, andβlimits the residual amplitude.D(z)is termed the decoded LUT. The decoder is pretrained on fitted target LUTs and frozen during personalized training, when the losses act on edited images. Thus, preference training does not require a target LUT for every pair. Appendices A.3 and A.4 detail target fitting and decoder pretraining. Edit-Strength Controller and LUT Application.D(z u,q )− L id is the predicted LUT residual. The Edit-Strength Controller scales this residual before it is applied to the query: b L u,q = L id + g u,q (D(z u,q )− L id ), b I u,q =T ( b L u,q ,I q ).(6) Hereg u,q depends on both the Reusable User Profile and the query image. b L u,q is the final LUT. Trilinear interpolation is differentiable during training, and its cost grows linearly with the number of output pixels. The final LUT has a fixed grid size, so it can be saved and applied to images at different resolutions. 3.3TRAINING WITH SEPARATE QUERY PAIRS For each user, a reference setS u and separate query pairs are sampled anew each training epoch. The following equations describe one sampled query pair(Q + u ,Q − u ) , whereQ + u is preferred toQ − u . Here b I(p,Q)denotes PrefLUT’s output for profilepand query imageQ. Both query images use the same profile, yielding Y − u = b I(p u ,Q − u ) and Y + u = b I(p u ,Q + u ). Most ordered preference image pairs are not geometrically aligned, so PrefLUT uses a global color- statistics descriptorχthat is less sensitive to spatial misalignment. It summarizes the means and standard deviations of color, luminance, and saturation (Appendix A.5). For imagesAandB, the distance isd χ (A,B) = mean(|χ(A)−χ(B)|). Letd + be the distance from the edited non-preferred query to the preferred query,d − the distance to the non-preferred query, andd 0 the distance between the query pair:d + = d χ (Y − u ,Q + u ) ,d − = d χ (Y − u ,Q − u ) , andd 0 = d χ (Q − u ,Q + u ) . The color-distance loss and ranking loss are: L color = d + d 0 + τ , L rank = [m + d + − d − ] + ,(7) where[x] + = max(x, 0),τ > 0prevents instability when the distance between the two query images is small, andm > 0is the ranking margin. The auxiliary losses enforce reconstruction on aligned pairs (L aligned ), preservation of preferred inputs (L preserve ), edit/preserve strength supervision (L strength , with targets 1 for non-preferred queries and 0 for preferred queries), and limited LUT deviation from identity (L LUT ). Their definitions are given in Appendix A.6. Without an explicit comparison between users, the model could produce the same average edit for every user even whenp u contains user-specific information. The Wrong-User Contrast Loss is introduced to address this. For the same queryQ − u ,p u is replaced with a wrong-user profilep u ′ , where u ′ ̸= u (Appendix A.7). If e Y − u←u ′ is the resulting output and e d + = d χ ( e Y − u←u ′ ,Q + u ), then: L user = [m + d + − e d + ] + .(8) The loss is zero only when the Correct User Profile output is at leastmcloser toQ + u than the Fixed Wrong-User Profile output for the same query. The complete objective is: L = λ c L color + λ r L rank + λ a L aligned + λ p L preserve + λ g L strength + λ l L LUT + λ u L user . (9) 4PREFERENCE-CONDITIONING VERIFICATION PROTOCOL Personalized image enhancement is commonly evaluated by comparing outputs with retouched targets and measuring preference alignment (Kim et al., 2020; 2026). However, such scores alone cannot distinguish the use of individual preferences from editing tendencies shared across users. Therefore, we believe the field needs a common evaluation protocol to verify user-specific conditioning by comparing edits of the same query under intended-user, other-user, and population preferences. 5 Preprint Table 1: Personalized editing quality and efficiency on PPSD. (A) Direct fidelity to preferred target images (Preferred) for edited non-preferred queries. (B) Personalized editing quality measured by CQS. (C) Model size and inference efficiency. † marks baselines adapted to PPSD. (A) Direct Fidelity to Preferred(B) Personalized Editing Quality(C) Model Size and Inference Efficiency Output vs. TargetCQS↑ParamsComputeProfileConstruct.Editing Method∆E 00 ↓LPIPS↓PSNR↑SSIM↑∆E 00 ↑LPIPS↑PSNR↑SSIM↑(M)(GFLOPs)(B/user)(ms/user)(ms/image) PieNet † 8.4320.11821.7190.8180.21814.97836.6110.90126.34976.0942,048130.6264.091 StarEnhancer † 8.0770.09021.9490.8350.21321.47730.9600.91838.0523.6384,096141.0963.253 PIE-MSM † 8.1790.09221.5760.8290.17317.71126.8270.90590.75655.90932,768119.7669.401 DiffRetouch † 9.3800.10820.8810.8230.12113.18422.3280.884924.13915,939.2931612.705653.309 PerTouch † 8.6150.11521.1840.7950.14712.30123.4870.8501,654.93958,386.0241676.5201,765.465 User-specific Decoder9.4930.10520.6120.8300.16618.08629.4140.9122.9561,551.5236,940,2843,518.41670.406 UPE8.9290.10020.8820.8320.21719.90039.2060.91626.3301,585.8831,024117.03073.637 Exemplar-based Inference14.3300.16316.9210.7500.0828.34219.1360.81792.33055.96049,152122.3299.562 PrefLUT (ours)8.0670.08922.0940.8430.21921.61532.7340.92010.2641.9662602.9381.365 Evaluation Principle.We introduce PCVP to verify whether a personalized image enhancement or color-grading method uses the supplied preference evidence andcurrent query image.The protocol applies to methods that condition predictions on preference examples or a user representation derived from these preferences. It comprises five control tests and keeps the evaluated method, users and query samples, image-processing steps, and metric computation fixed. It changes only one condition at a time, so each quality difference measures the response to that condition. PCVP Controls.(1) Wrong User:The Fixed Wrong-User Profile replacesp u , the profile of the current useru, with a fixed profile from another user.(2) Reversed Order:The Reversed-Order Profile swaps the preferred and non-preferred image in every reference pair before profile construc- tion.(3) Mismatched Pairs:The Mismatched-Pair Profile breaks within-user pair correspondence while preserving the preferred and non-preferred image sets.(4) Training Mean:The Training-User Mean Profile replacesp u with the arithmetic mean of profiles constructed from training users only. (5) Wrong Query:The Cyclic Wrong-Query Control conditions the predictor on a different query from the same user. Any separate image-application path retains the original query. Appendix D.1 gives the exact constructions, preserved information, and dependencies tested for these five controls. For a query sample(u,q), letF (p,Q cond ,Q apply )denote the complete edit under profilepand conditioning imageQ cond , withQ apply retained on any separate image-application path. The correct and controlled outputs are defined as follows: b I (0) u,q = F (p u ,Q u,q ,Q u,q ), b I (c) u,q = ( F (p (c) u ,Q u,q ,Q u,q ), c∈C profile , F (p u ,Q (c) u,q ,Q u,q ), c = query, (10) whereC profile contains the four profile controls above. Lets k ( b I | E )be a metric defined so that higher values are better. The paired PCVP gain for measure k and control c is: ∆ (c) k = s k b I (0) |E − s k b I (c) |E ,(11) whereEis the same set of paired users and query samples for both terms. On PPSD,s k is the comparative quality score (CQS), withs k = CQS k fork ∈ ∆E 00 , LPIPS, PSNR, SSIM. We call the evaluation a PCVP pass when the lower endpoint of the paired 95% bootstrap interval for every∆ (c) k is above zero. When a control is repeated across preregistered evaluation episodes, the same direction is required for the repeated estimate: PCVP-pass⇐⇒ LCB 95% ∆ (c) k > 0 ∀k,c.(12) HereLCB 95% denotes the lower endpoint of the paired bootstrap interval. Each control passes only when all metrics satisfy this condition, and a full PCVP pass requires all five controls to pass. 5EXPERIMENTS AND RESULTS Implementation Details and Experimental Settings.(1) Datasets:We evaluate PrefLUT on three datasets for different purposes. We use PPSD, a recent large-scale dataset specifically designed for 6 Preprint (A) Personalized Editing Comparison (B) PCVP Verification (C) Profile Refinement InputPreferredPieNetStarEnhancerPIE-MSMDiffRetouchUPEPerTouchPrefLUT 0.009 / 37.79 / 0.9960.000 / ∞ / 1.0000.072 / 16.97 / 0.9500.012 / 40.92 / 0.9950.111 / 14.61 / 0.9140.065 / 24.57 / 0.9750.017 / 34.84 / 0.9860.199 / 16.73 / 0.8490.007 / 42.90 / 0.997 0.109 / 19.16 / 0.9080.000 / ∞ / 1.0000.089 / 25.07 / 0.9560.034 / 31.78 / 0.9810.104 / 19.51 / 0.9350.179 / 17.20 / 0.8800.083 / 24.99 / 0.9510.105 / 21.11 / 0.8710.025 / 27.93 / 0.980 0.146 / 23.26 / 0.8950.000 / ∞ / 1.0000.115 / 21.52 / 0.9280.048 / 31.10 / 0.9790.183 / 13.67 / 0.8200.242 / 12.31 / 0.7710.129 / 24.93 / 0.9180.319 / 10.02 / 0.5020.054 / 30.17 / 0.975 0.085 / 25.09 / 0.9290.000 / ∞ / 1.0000.070 / 23.03 / 0.8600.060 / 28.32 / 0.8940.151 / 15.21 / 0.7270.255 / 11.17 / 0.5610.085 / 25.13 / 0.9290.457 / 8.50 / 0.4000.040 / 29.66 / 0.944 0.130 / 27.37 / 0.9180.000 / ∞ / 1.0000.099 / 24.45 / 0.8840.124 / 27.94 / 0.9320.206 / 15.58 / 0.6870.330 / 11.78 / 0.5160.127 / 27.61 / 0.9200.431 / 9.38 / 0.3460.058 / 32.00 / 0.946 0.096 / 19.58 / 0.9380.000 / ∞ / 1.0000.075 / 22.52 / 0.9540.045 / 34.02 / 0.9800.121 / 18.11 / 0.9300.137 / 18.37 / 0.9180.050 / 27.68 / 0.9650.247 / 13.39 / 0.8250.023 / 31.47 / 0.987 0.012 / 35.49 / 0.9960.000 / ∞ / 1.0000.023 / 20.51 / 0.9590.011 / 33.88 / 0.9950.048 / 20.11 / 0.9530.054 / 19.45 / 0.9450.015 / 31.80 / 0.9910.110 / 17.93 / 0.8650.010 / 37.49 / 0.996 0.034 / 25.67 / 0.9620.000 / ∞ / 1.0000.034 / 25.68 / 0.9610.035 / 25.35 / 0.9590.109 / 14.60 / 0.8210.045 / 23.17 / 0.9200.034 / 25.67 / 0.9620.126 / 11.91 / 0.6870.032 / 25.92 / 0.963 InputPreferredWrong userReversed orderMismatched pairsTraining meanWrong queryCorrect 0.060 / 27.14 / 0.8120.000 / ∞ / 1.0000.049 / 27.63 / 0.7140.052 / 27.77 / 0.7250.033 / 30.55 / 0.8150.041 / 28.97 / 0.7800.060 / 27.13 / 0.8130.031 / 30.91 / 0.852 0.067 / 20.74 / 0.9090.000 / ∞ / 1.0000.042 / 23.68 / 0.9370.061 / 21.36 / 0.9160.037 / 24.61 / 0.9410.048 / 22.92 / 0.9270.065 / 21.02 / 0.9110.035 / 24.72 / 0.952 0.081 / 20.36 / 0.9050.000 / ∞ / 1.0000.040 / 25.34 / 0.9480.050 / 23.12 / 0.9430.037 / 25.21 / 0.9610.044 / 24.01 / 0.9480.049 / 22.12 / 0.9390.033 / 26.15 / 0.968 0.117 / 19.70 / 0.8670.000 / ∞ / 1.0000.065 / 25.20 / 0.9180.083 / 22.37 / 0.8920.059 / 26.14 / 0.9230.062 / 25.58 / 0.9190.114 / 19.94 / 0.8740.051 / 27.42 / 0.935 InputN = 4N = 8N = 12N = 16N = 24Preferred 17.21 / 23.48 / 0.959618.51 / 23.94 / 0.961722.64 / 25.17 / 0.968223.05 / 25.26 / 0.968723.74 / 25.33 / 0.9691 14.45 / 20.04 / 0.940224.63 / 22.73 / 0.959225.02 / 22.96 / 0.959825.24 / 23.03 / 0.960225.51 / 23.13 / 0.9607 10.30 / 22.662 / 0.944716.97 / 24.472 / 0.960317.55 / 24.767 / 0.961217.85 / 24.768 / 0.961618.53 / 25.144 / 0.9628 Figure 3: Qualitative results on PPSD. Input is the non-preferred query and Preferred its paired target. (A) Baseline comparisons. (B) Correct (the intended user’s profile and current query image) versus five PCVP controls. (C) Profile refinement fromN = 4to24feedback pairs with frozen network weights. Overlays report LPIPS/PSNR/SSIM against Preferred in (A,B) (↓ /↑ /↑), and per-output LPIPS-CQS/PSNR-CQS/SSIM-CQS in (C) (all↑). More examples are in Appendix H. learning personalized photographic styles from pairwise user preferences, as our primary benchmark. MIT-Adobe FiveK Expert C and PPR10K Experts A/B/C evaluate general-purpose (non-personalized) aesthetic enhancement (Appendix E.2).(2) Metrics:On PPSD, personalized enhancement is evaluated using CQS (Appendix B.4), computed separately from∆E 00 , LPIPS, PSNR, and SSIM, combining image fidelity with color movement toward user preferences to assess both preservation and preference alignment (Kim et al., 2026). Full dataset and evaluation protocols are provided in Appendices B and D.(3) Experimental Settings:PPSD evaluation uses 50 users excluded from training, each with 16 ordered reference pairs and 16 query pairs with disjoint image and scene identities. The standard PrefLUT setting uses a 256-dimensional Reusable User Profile and a17 3 LUT (Appendix C.1). All our experiments are conducted on a single NVIDIA RTX 5090 GPU.(4) Baselines:We select personalized enhancement methods and controllable retouching methods adaptable to user preferences, including PieNet (Kim et al., 2020), StarEnhancer (Song et al., 2021), PIE-MSM (Kosugi & Yamasaki, 7 Preprint Table 2: PCVP gains (∆CQS) are correct-condition CQS minus control-condition CQS. Each test lists gains (left) and the number of passing metrics out of four (right). Bold blue marks passing metrics. A test requires 4/4, and full PCVP requires all five tests. A dash denotes a structurally inapplicable control. † marks PPSD-adapted baselines. Evaluation settings are in Appendix D.2. MethodMetricWrong userReversed orderMismatched pairsTraining meanWrong queryFull Pass PieNet † (ECCV 2020) ∆E 00 -0.00006+0.00001+0.00068-0.00360+0.00454 LPIPS-0.07606+0.07724+0.11300-0.33478-0.35530 PSNR-0.10056+0.14574+0.22164-0.64456-0.21505 SSIM-0.00059 0/4 -0.00027 0/4 +0.00035 0/4 -0.00169 0/4 +0.00011 1/4 No (0/5) StarEnhancer † (ICCV 2021) ∆E 00 +0.00145+0.00334—-0.00414+0.02791 LPIPS+0.20574+0.19325—-0.14146+3.75054 PSNR+0.14513+0.27924—-0.84752+1.30143 SSIM+0.00065 1/4 +0.00123 3/4 — — -0.00037 0/4 +0.00982 4/4 No (1/4) PIE-MSM † (TCSVT 2024) ∆E 00 +0.00359+0.00792+0.03463-0.00111+0.01114 LPIPS+0.29696+0.60508+3.31201+0.05089+1.59296 PSNR+0.15297+0.51038+2.96831-0.23564+0.58833 SSIM+0.00047 2/4 +0.00114 4/4 +0.01072 4/4 +0.00030 0/4 +0.00617 4/4 No (3/5) DiffRetouch † (AAAI 2025) ∆E 00 +0.00053-0.00229-0.00094+0.00014+0.01422 LPIPS+0.06096-0.22642-0.10286-0.00917+3.05005 PSNR+0.05703-0.10169-0.02648+0.03741+1.14541 SSIM+0.00032 0/4 -0.00267 0/4 -0.00091 0/4 +0.00005 0/4 +0.02181 4/4 No (1/5) PerTouch † (AAAI 2026) ∆E 00 +0.00227+0.00617-0.00106-0.00128+0.11441 LPIPS+0.14506+0.28275-0.06002-0.08118+10.88617 PSNR+0.10407+0.39237-0.06274-0.07681+14.32032 SSIM+0.00074 0/4 +0.00055 3/4 -0.00081 0/4 -0.00070 0/4 +0.61326 4/4 No (1/5) User-specific Decoder (CVPR 2026) ∆E 00 +0.00089+0.01660-0.00237+0.01229+0.00000 LPIPS+0.08042+1.17893+0.02181+0.79596-0.00012 PSNR-0.00132+0.34232-1.19466-0.01615+0.00001 SSIM+0.00086 0/4 +0.00032 2/4 -0.00062 0/4 +0.00072 2/4 -0.00000 0/4 No (0/5) UPE (CVPR 2026) ∆E 00 +0.00022-0.00067-0.00073-0.00133+0.00004 LPIPS+0.01448-0.00233-0.00851-0.00101+0.05344 PSNR-0.01553-0.37663-0.30116-0.70954-0.22842 SSIM+0.00003 1/4 +0.00001 0/4 +0.00001 1/4 +0.00001 0/4 +0.00018 2/4 No (0/5) Exemplar-based Inference (CVPR 2026) ∆E 00 +0.00024-0.00099-0.00090+0.00090+0.00029 LPIPS+0.03730-0.09915-0.10712+0.15598+0.02920 PSNR+0.02825-0.14419-0.18782+0.19090+0.00499 SSIM+0.00029 0/4 -0.00237 0/4 -0.00125 0/4 +0.00008 3/4 +0.00162 1/4 No (0/5) PrefLUT (ours) ∆E 00 +0.00437+0.00687+0.00723+0.00235+0.01445 LPIPS+0.44810+0.33821+0.44371+0.26901+2.26491 PSNR+0.40935+0.78150+0.90339+0.32984+0.88546 SSIM+0.00148 4/4 +0.00106 4/4 +0.00118 4/4 +0.00078 4/4 +0.00480 4/4 Yes (5/5) 2024), DiffRetouch (Duan et al., 2025), PerTouch (Chang et al., 2026), and PPSD’s User-specific Decoder, User Preference Embedding (UPE), and Exemplar-based Inference (Kim et al., 2026). Baseline reproduction and evaluation settings are detailed in Appendix C. PPSD Personalized Editing. PrefLUT balances perceptual quality, per-user storage, and editing latency (Table 1 and Appendix C.4), with the highest CQS under∆E 00 , LPIPS, and SSIM among the listed methods. On edited non-preferred queries, PrefLUT also leads the compared methods in direct fidelity to Preferred under∆E 00 , LPIPS, PSNR, and SSIM. For qualitative evaluation, Figure 3(A) compares outputs across baselines and illustrates PrefLUT’s robustness to varying preferences. For example, users prefer both brighter and darker appearances, yet PIE-MSM and DiffRetouch tend to brighten these examples, while PrefLUT often follows the preferred brightness and color more closely (additional examples in Appendix H). PCVP Evaluation.PrefLUT passes all five PPSD controls across all four CQS measures (Table 2). None of the eight baseline adaptations passes all five. Relative to the correct condition, all five controls significantly reduce CQS, indicating that PrefLUT uses both the supplied user preferences and the query image (Appendix E.1). In Figure 3(B), changing the profile or query condition shifts 8 Preprint ΔE00 4 0.21756 8 0.21984 12 0.22060 16 0.22078 24 0.22109 +0.00227 +0.00076 +0.00018 +0.00032 LPIPS 4 21.594 8 21.720 12 21.767 16 21.771 24 21.779 +0.126+0.046+0.004+0.008 PSNR 4 32.311 8 32.600 12 32.704 16 32.754 24 32.778 +0.289+0.104+0.050+0.024 SSIM 4 0.92153 8 0.92175 12 0.92188 16 0.92188 24 0.92190 +0.00022 +0.00013 +0.00001 +0.00002 Figure 4: Profile refinement on PPSD. Points show CQS (all↑) atN = 4, 8, 12, 16, 24accumulated feedback pairs. Orange labels give CQS gains over the preceding stage. Table 3: Core ablations on PPSD. Differences in CQS and Fixed Wrong-User Profile PCVP gain are reported as variant minus its matched full model. In row order, we remove the Explicit Feature Differencea + i − a − i , replace the Set Transformer with masked mean pooling in the Preference Set Aggregator, remove the Query Featurec q , and remove the Wrong-User Contrast LossL user . All ablations support the contribution of the corresponding components. CQS differenceWrong-user PCVP gain difference Variant∆E 00 LPIPSPSNRSSIM∆E 00 LPIPSPSNRSSIM − Explicit Feature Difference−0.001062−0.200−0.214−0.000553−0.003074−0.32296−0.28613−0.001116 − Set Transformer−0.019845−1.484−2.250−0.002619−0.004238−0.42888−0.39226−0.001401 − Query Feature−0.003771−1.438+1.482−0.003514−0.003290−0.33886−0.34294−0.001110 − Wrong-User Contrast Loss−0.00000679−0.003+0.003−0.00000439−0.00003627−0.00487−0.00223−0.00001351 brightness and color away from the preferred appearance, while correct conditioning more closely preserves the intended look. Profile Refinement.With weights and unseen queries fixed, additional feedback improves editing through profile updates alone (Figure 4, Figure 3(C)). The examples progressively approach the preferred brightness and color as feedback accumulates from 4 to 24 pairs. Correct new feedback outperforms reversed new feedback on identical images, indicating that the preference direction contributes to the improvement (Appendix F.1). Ablation Studies.Table 3 compares each ablation with its matched full model under equal training budgets. Removing the Explicit Feature Difference from the Ordered Preference Encoder reduces all four CQS measures and the quality advantage of correct over wrong-user profiles. Replacing the Set Transformer in the Preference Set Aggregator with masked mean pooling reduces CQS and nearly eliminates this advantage, supporting learned aggregation of preference pairs. Removing the Query Feature from the Query-Conditioned LUT Predictor reduces∆E 00 , LPIPS, and SSIM CQS and weakens user-specific editing, despite higher PSNR CQS. The Wrong-User Contrast Loss further improves the wrong-user PCVP gain across both training seeds. Paired confidence intervals and further ablations are in Appendices F.2 and F.3. Extended Experiments.The profile interface supports general-purpose, non-personalized enhance- ment on FiveK and PPR10K using configurations with an additional spatial residual (Appendices C.3 and E.2). On FiveK Expert C, PrefLUT achieves 24.572 dB PSNR, 0.917 SSIM, 7.833∆E 76 , and 0.067 LPIPS, averaged over eight training seeds. On PPR10K, PrefLUT shares one model across Ex- perts A/B/C and achieves 25.105 dB PSNR, 7.822∆E 76 , 28.368 dB PSNR-HC, and 5.069∆E 76 -HC, averaged over three experts and two training seeds on 2,286 validation images per expert. 6CONCLUSION We presented PrefLUT, which encodes ordered preferences into a reusable, refinable user profile and predicts query-conditioned 3D LUTs without per-user fine-tuning. We also introduced PCVP, an evaluation protocol that verifies dependence on user preferences and the query image through five controlled tests. This distinguishes user-specific preference conditioning from quality gains produced by applying shared editing rules across users. Additional feedback improves unseen-query editing with frozen network weights, while each quantized profile requires only 260 bytes and supports repeated editing without re-encoding reference images. PrefLUT passes all five PCVP tests and, among the compared personalized image enhancement methods on PPSD, leads all four direct fidelity 9 Preprint metrics and CQS under∆E 00 , LPIPS, and SSIM, with editing at 1.365 ms/image. Experiments on FiveK and PPR10K further demonstrate general-purpose enhancement across expert targets. AI USE STATEMENT Generative AI tools assisted manuscript writing and the development of code for figure layout. Qualitative figures show images from the released datasets and actual outputs of the evaluated methods. These dataset images and method outputs were cropped and resized for display. ETHICS STATEMENT This work uses released datasets of pairwise preferences and retouched images and conducts no new interaction with human participants. We follow the dataset licenses and do not redistribute raw user data. Dataset splits and evaluation procedures are documented in the appendix. This research adheres to the ICLR Code of Ethics. REPRODUCIBILITY STATEMENT The main paper specifies the PrefLUT architecture, training objectives, and evaluation protocol. The appendix details data preprocessing, dataset splits, experimental configurations, control conditions, statistical procedures, and hardware. The supplementary material includes anonymous source code, training and evaluation scripts, configuration files, PPSD split definitions, exact reference/query assignments, and the PrefLUT model weights. We also provide complete per-query and per-user evaluation CSVs, aggregate results, and selected qualitative examples with preference references. The accompanying documentation maps the implementation to the paper and provides instructions for training, profile construction, inference, and metric computation. REFERENCES Simone Bianco, Claudio Cusano, Flavio Piccoli, and Raimondo Schettini. Personalized image enhancement using neural spline color transforms. IEEE Transactions on Image Processing, 29: 6223–6236, 2020. doi: 10.1109/TIP.2020.2989584. Vladimir Bychkovsky, Sylvain Paris, Eric Chan, and Fr ́ edo Durand. Learning photographic global tonal adjustment with a database of input/output image pairs.In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, p. 97–104, 2011. doi: 10.1109/CVPR.2011.5995413. Zewei Chang, Zheng-Peng Duan, Jianxing Zhang, Chun-Le Guo, Siyu Liu, Hyungju Chun, Hyunhee Park, Zikun Liu, and Chongyi Li. PerTouch: VLM-driven agent for personalized and semantic image retouching. Proceedings of the AAAI Conference on Artificial Intelligence, 40(4):2752–2759, 2026. doi: 10.1609/aaai.v40i4.37264. CIE. International Lighting Vocabulary. International Commission on Illumination, second edition, 2020. CIE S 017:2020, term 17-23-077: CIE 1976 L*a*b* colour difference. Marcos V. Conde, Javier Vazquez-Corral, Michael S. Brown, and Radu Timofte. NILUT: Conditional neural implicit 3D lookup tables for image enhancement. Proceedings of the AAAI Conference on Artificial Intelligence, 38:1371–1379, 2024. doi: 10.1609/aaai.v38i2.27901. Zheng-Peng Duan, Jiawei Zhang, Zheng Lin, Xin Jin, XunDong Wang, Dongqing Zou, Chun- Le Guo, and Chongyi Li. DiffRetouch: Using diffusion to retouch on the shoulder of experts. Proceedings of the AAAI Conference on Artificial Intelligence, 39(3):2825–2833, 2025. doi: 10.1609/aaai.v39i3.32288. Zerui Gong, Zhonghua Wu, Qingyi Tao, Qinyue Li, and Chen Change Loy. SA-LUT: Spatial adaptive 4D look-up table for photorealistic style transfer. In Proceedings of the IEEE/CVF International Conference on Computer Vision, p. 18294–18303, 2025. 10 Preprint Samuel Goree, Weslie Khoo, and David J. Crandall. Correct for whom? Subjectivity and the evalua- tion of personalized image aesthetics assessment models. Proceedings of the AAAI Conference on Artificial Intelligence, 37:11818–11827, 2023. Man M. Ho and Jinjia Zhou. Deep Preset: Blending and retouching photos with color style transfer. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, p. 2113–2121, 2021. Liubing Hu, Chen Wu, Anrui Wang, Dianjie Lu, Guijuan Zhang, and Zhuoran Zheng. FlowLUT: Efficient image enhancement via differentiable LUTs and iterative flow matching. arXiv preprint arXiv:2509.23608, 2025. URL https://arxiv.org/abs/2509.23608. Zhanghan Ke, Yuhao Liu, Lei Zhu, Nanxuan Zhao, and Rynson W. H. Lau. Neural Preset for color style transfer. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, p. 14173–14182, 2023. Han-Ul Kim, Young Jun Koh, and Chang-Su Kim. PieNet: Personalized image enhancement network. In European Conference on Computer Vision, p. 374–390, 2020. doi: 10.1007/ 978-3-030-58577-823. Jinwoo Kim, Jihye Yoo, and Seon Joo Kim. Learning personalized photographic style from pairwise user preferences. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, p. 1134–1144, 2026. Wontae Kim and Nam Ik Cho. Image-adaptive 3D lookup tables for real-time image enhancement with bilateral grids. In European Conference on Computer Vision, p. 91–108, 2024. doi: 10.1007/978-3-031-72967-66. Satoshi Kosugi and Toshihiko Yamasaki. Personalized image enhancement featuring masked style modeling. IEEE Transactions on Circuits and Systems for Video Technology, 34(1):140–152, 2024. doi: 10.1109/TCSVT.2023.3285765. Juho Lee, Yoonho Lee, Jungtaek Kim, Adam R. Kosiorek, Seungjin Choi, and Yee Whye Teh. Set Transformer: A framework for attention-based permutation-invariant neural networks. In Proceedings of the 36th International Conference on Machine Learning, volume 97, p. 3744–3753, 2019. Mujing Li, Guanjie Wang, Xingguang Zhang, Qifeng Liao, and Chenxi Xiao. D-LUT: Photorealistic style transfer via diffusion process. In Proceedings of the Winter Conference on Applications of Computer Vision, p. 9188–9196, 2025. Jie Liang, Hui Zeng, Miaomiao Cui, Xuansong Xie, and Lei Zhang. PPR10K: A large-scale portrait photo retouching dataset with human-region mask and group-level consistency. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, p. 653–661, 2021. Tianwei Lin, Honglin Lin, Fu Li, Dongliang He, Wenhao Wu, Meiling Wang, Xin Li, and Yong Liu. AdaCM: Adaptive ColorMLP for real-time universal photo-realistic style transfer. Proceedings of the AAAI Conference on Artificial Intelligence, 37:1613–1621, 2023. doi: 10.1609/aaai.v37i2. 25248. Chengxu Liu, Huan Yang, Jianlong Fu, and Xueming Qian. 4D LUT: Learnable context-aware 4D lookup table for image enhancement. IEEE Transactions on Image Processing, 32:4742–4756, 2023. doi: 10.1109/TIP.2023.3290849. URL https://arxiv.org/abs/2209.01749. Tianren Ma, Mingxiang Liao, Xijin Zhang, and Qixiang Ye. AceTone: Bridging words and colors for conditional image grading. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, p. 25851–25860, 2026. Jian Ren, Xiaohui Shen, Zhe Lin, Radom ́ ır M ˇ ech, and David J. Foran. Personalized image aesthetics. In Proceedings of the IEEE International Conference on Computer Vision, p. 638–647, 2017. Gaurav Sharma, Wencheng Wu, and Edul N. Dalal. The CIEDE2000 color-difference formula: Implementation notes, supplementary test data, and mathematical observations. Color Research & Application, 30(1):21–30, 2005. doi: 10.1002/col.20070. 11 Preprint Yuda Song, Hui Qian, and Xin Du. StarEnhancer: Learning real-time and style-aware image enhancement. In Proceedings of the IEEE/CVF International Conference on Computer Vision, p. 4126–4135, 2021. Tao Wang, Yong Li, Jingyang Peng, Yipeng Ma, Xian Wang, Fenglong Song, and Youliang Yan. Real-time image enhancer via learnable spatial-aware 3D lookup tables. In Proceedings of the IEEE/CVF International Conference on Computer Vision, p. 2471–2480, 2021. Yifan Wang, Zhixiang Hao, Yu Wang, and Congchao Zhu. Multimodal 3D LUT generation via StatLUT with statistical features for photorealistic style transfer. arXiv preprint arXiv:2607.08227, 2026. URL https://arxiv.org/abs/2607.08227. Zhou Wang, Alan C. Bovik, Hamid R. Sheikh, and Eero P. Simoncelli. Image quality assessment: From error visibility to structural similarity. IEEE Transactions on Image Processing, 13(4): 600–612, 2004. doi: 10.1109/TIP.2003.819861. Temesgen Muruts Weldengus, Binnan Liu, Fei Kou, Youwei Lyu, Jinwei Chen, Qingnan Fan, and Changqing Zou. RefRetouch: Personalized image retouching without test-time fine-tuning. In European Conference on Computer Vision, 2026. Chuanzhi Xu, Ziyuan Tao, Jean Julien KNell, Yanrong Chen, Haolan Guo, Xuanhua Yin, Adnan Mahmood, and Weidong Cai. Learning color grading, no photo sharing: Federated aesthetic preference learning for personalized image enhancement. arXiv preprint arXiv:2607.27659, 2026. URL https://arxiv.org/abs/2607.27659. Canqian Yang, Meiguang Jin, Xu Jia, Yi Xu, and Ying Chen. AdaInt: Learning adaptive intervals for 3D lookup tables on real-time image enhancement. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, p. 17522–17531, 2022a. Canqian Yang, Meiguang Jin, Yi Xu, Rui Zhang, Ying Chen, and Huaida Liu. SepLUT: Separable image-adaptive lookup tables for real-time image enhancement. In European Conference on Computer Vision, p. 201–217, 2022b. Vahid Zehtab, David B. Lindell, Marcus A. Brubaker, and Michael S. Brown. Efficient neural network encoding for 3D color lookup tables. Proceedings of the AAAI Conference on Artificial Intelligence, 39:9772–9779, 2025. doi: 10.1609/aaai.v39i9.33059. Hui Zeng, Jianrui Cai, Lida Li, Zisheng Cao, and Lei Zhang. Learning image-adaptive 3D lookup tables for high performance photo enhancement in real-time. IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(4):2058–2073, 2022. doi: 10.1109/TPAMI.2020.3026740. Fengyi Zhang, Hui Zeng, Tianjun Zhang, and Lin Zhang. CLUT-Net: Learning adaptively compressed representations of 3DLUTs for lightweight image enhancement. In Proceedings of the 30th ACM International Conference on Multimedia, p. 6493–6501, 2022. doi: 10.1145/3503161.3547879. Richard Zhang, Phillip Isola, Alexei A. Efros, Eli Shechtman, and Oliver Wang. The unreasonable effectiveness of deep features as a perceptual metric. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, p. 586–595, 2018. 12 Preprint Appendix AMETHOD DETAILS A.1PROFILE CONSTRUCTION AND QUERY-TIME EDITING Algorithm A1 summarizes Profile Construction and Query-Time Editing, including the inputs and outputs of each module. Appendix A.2 explains how reference sets with different numbers of pairs are processed in one batch. Algorithm A1: profile construction and query-time editing Profile-construction input: reference setS u = (I + i ,I − i ) N u i=1 . When users have different numbers of reference pairs, shorter sets are padded to a common length. The maskm u,i marks valid pairs. 1. Encode both images of every valid pair with the shared Reference Image Encoder, producing a + i and a − i . 2. Compute t i = φ([a + i ,a − i ,a + i − a − i ]) with the Ordered Preference Encoder. 3. Place the valid ordered preference tokens in deterministic order and jointly update them with the learned pooling tokens in the Preference Set Aggregator. Use the valid-pair mask to exclude padding and do not add positional embeddings. 4. Average and layer-normalize the updated learned pooling tokens to obtain the aggregated user featurer u . Apply Profile Projectionp u = B down (r u )and store the resulting Reusable User Profile p u . The reference images are no longer needed at query time. Query-time input: Reusable User Profile p u and query image I q . 5. Apply Profile Expansion ̄p u = B up (p u ). ResizeI q to the query thumbnailI ↓ q and use the Query Image Encoder to obtain the query feature c q . 6. Use the Query-Conditioned LUT Predictor to predict the LUT latent vectorz u,q and edit strength g u,q from [ ̄p u ,c q ]. 7. Use the Identity-Residual LUT Decoder to convertz u,q into the decoded LUTD(z u,q ). The Edit-Strength Controller scales the decoded LUT residual from the identity LUT byg u,q to obtain the final LUT b L u,q . 8. Apply b L u,q to the full-resolution query image by trilinear interpolation to obtain b I u,q . Profile refinement and reuse. Add new preference pairs to the retained reference set and repeat Steps 1 to 4 with network weights frozen. Steps 5 to 8 reuse the updated profile for later queries without processing references or performing per-user optimization. A.2BATCHING AND VALID-PAIR MASKING In a batch, the valid-pair maskm u,i identifies whether ordered preference image pairibelongs to useru’s reference set. Padding makes reference sets equally long, and the mask excludes padded tokens from attention and profile aggregation. Learned pooling tokens are always valid. Equation 3 therefore uses only valid ordered preference tokens. The Preference Set Aggregator uses a fixed token order and no positional embeddings. Valid tokens are sorted in ascending order by their first eight feature coordinates, comparing each coordinate in turn. Tokens with identical sorting coordinates keep their relative order, and padded tokens are placed last. This fixed order is based on token features rather than the time of user feedback. The aggregated user featurer u is computed from the updated learned pooling tokens. Sorting reduces input-order effects in finite-precision attention. Permutation invariance comes from the set architecture without positional embeddings, rather than from sorting. A.3TARGET LUT FITTING For each ordered preference image pair identified as pixel-aligned by the data protocol, a target LUT L ∗ maps the non-preferred image to the preferred image. The training subset contains 2,683 eligible 13 Preprint D1 pairs and 3,028 eligible D2 pairs, giving 5,711 target LUTs. Eligibility requires a D1 or D2 pair with matching image dimensions. Each17 3 LUT is initialized as the identity LUT and fitted on 128-pixel image crops using Adam for 30 steps at learning rate 0.03. The objective combines mean absolute image reconstruction error with smoothness, monotonicity, and identity penalties weighted by 1, 0.01, 0.01, and 0.001, respectively. After each update, LUT values are clipped to[0, 1]. The fitted LUTs supervise Identity-Residual LUT Decoder pretraining. Query-Time Editing uses the trained decoder without fitting additional target LUTs. A.4IDENTITY-RESIDUAL LUT DECODER PRETRAINING The fitted target LUTs supervise an autoencoder whose Identity-Residual LUT Decoder follows Equation 5. LetE L be the LUT encoder, letL = L id + β tanh(Ψ(E L (L ∗ )))be the unclipped decoder output, let e L = clip [0,1] (L) = D(E L (L ∗ )), and letIbe the non-preferred image used to fit L ∗ .E L and the Identity-Residual LUT Decoder are trained jointly with LUT reconstruction, image application, smoothness, monotonicity, and a LUT range penalty: L AE = η rec ∥ e L− L ∗ ∥ 1 + η app ∥T ( e L,I)−T (L ∗ ,I)∥ 1 + η sm R sm ( e L) + η mono R mono ( e L) + η range R range ( L). (13) R sm sums the mean squared differences between adjacent LUT entries along the three input-color axes.R mono penalizes negative adjacent differences, andR range penalizes values ofLthat fall below zero or above one. During personalized training, the Query-Conditioned LUT Predictor outputs z u,q , which the frozen Identity-Residual LUT Decoder converts into the decoded LUT. Equation 9 combines image-based supervision with edit-strength supervision and LUT regularization, without requiring fitted target LUTs for the preference pairs. A.5GLOBAL COLOR-STATISTICS DESCRIPTOR For an RGB imageI, the global color-statistics descriptor contains the means and standard deviations of the RGB channels, luminance, and saturation: χ(I) = [μ R (I),μ G (I),μ B (I),σ R (I),σ G (I),σ B (I), μ Y (I),σ Y (I),μ S (I),σ S (I)]. (14) Hereμandσare the mean and population standard deviation over image pixels. The luminance and saturation at each pixel are computed as: Y = 0.2126R + 0.7152G + 0.0722B, S = max(R,G,B)− min(R,G,B).(15) The distanced χ (A,B)averages the absolute differences between the ten descriptor components. RGB, luminance, and saturation lie in[0, 1], so their means and standard deviations are bounded in the same intensity units. Equal coefficients assign the same cost to an equal absolute change in any statistic, without variance normalization or learned component weights. Global statistics reduce sensitivity to spatial misalignment but do not impose pixelwise correspondence. Pixel-aligned pairs also receive reconstruction supervision (Appendix A.6). A.6AUXILIARY TRAINING LOSSES The following losses supplement the color-distance loss, ranking loss, and Wrong-User Contrast Loss in Equation 9. LetBindex all query pairs in the current minibatch, with(u,j)identifying useru and query pairj. Training uses four query pairs per user. The outputs areY ± u,j = b I(p u ,Q ± u,j ). The color-distance, ranking, and Wrong-User Contrast Loss terms are averaged overB. Image and LUT ℓ 1 terms below average over their pixels or grid entries and color channels. Aligned-Pair Reconstruction Loss. LetA⊆Bindex the query pairs treated as pixel-aligned by the data protocol. The aligned-pair reconstruction loss is: L aligned =|A| −1 X (u,j)∈A ∥Y − u,j − Q + u,j ∥ 1 .(16) The reconstruction loss is zero when the minibatch contains no aligned query pairs. 14 Preprint Preservation Loss. The preservation loss keeps the edited preferred query close to its input: L preserve = 1 |B| X (u,j)∈B ∥Y + u,j − Q + u,j ∥ 1 .(17) Edit-Strength Loss. Letg ± u,j and b L ± u,j be the edit strengths and final LUTs predicted forQ ± u,j . Binary supervision assigns strength targets of one to non-preferred queries and zero to preferred queries: L strength = 1 2|B| X (u,j)∈B BCE(g − u,j , 1) + BCE(g + u,j , 0) ,(18) where BCE denotes binary cross-entropy. LUT-Deviation Loss. The LUT-deviation loss penalizes differences between each final LUT and the identity LUT: L LUT = 1 2|B| X (u,j)∈B ∥ b L − u,j − L id ∥ 1 +∥ b L + u,j − L id ∥ 1 .(19) A.7WRONG-USER PROFILE SELECTION The Wrong-User Contrast Loss uses minibatches of distinct users. A fixed nonzero cyclic shift within each minibatch pairs each useruwith another useru ′ ̸= u. The other user’s profilep u ′ replacesp u , while the queryQ − u and preferred targetQ + u remain unchanged. The resulting output e Y − u←u ′ defines e d + = d χ ( e Y − u←u ′ ,Q + u ) in Equation 8. Thus, the two outputs are compared on the same query and preferred target, with only the user profile changed. BDATASETS AND EVALUATION PROTOCOLS B.1PPSD Preference Supervision.Rating-based datasets such as Flickr-AES capture overall aesthetic judg- ments, which depend on image content and aesthetic attributes (Ren et al., 2017). A single score can mix color preference with content or composition, and its numerical scale depends on the rater. Guiding enhancement with a learned scorer can carry these biases into editing. Existing rating labels and personalized predictors also represent some users’ preferences better than others (Goree et al., 2023). PrefLUT uses PPSD’s pairwise choices to specify the preferred direction without assigning an absolute aesthetic score or optimizing a separate scorer. Data and Split.The processed PPSD release contains 34,699 pairwise comparisons from 521 users after filtering. The public release provides the dataset but not the official user split or evaluation- episode generator (Kim et al., 2026). We therefore define our own deterministic user split and evaluation episodes. The split assigns 471 users to training and 50 to validation. Validation users are excluded from training and construction of the Training-User Mean Profile. Checkpoint selection is described in Appendix C.1. An evaluation episode specifies the reference and query pairs sampled for every user. The main quality and PCVP episodes useN = 16reference pairs andM = 16query pairs per user. The two sets share no pair, scene, or image identities. An episode seed fixes the sampling and ordering of these pairs. The adapted baselines follow the same protocol, with implementation details in Appendix C.2. Resolution.For PrefLUT, the main quality comparison and Fixed Wrong-User Profile test encode reference images at 256 pixels and apply the predicted17 3 LUTs to 512-pixel query images. Outputs and targets are resized to 256 pixels for metric computation. The Reversed-Order Profile and Mismatched-Pair Profile tests apply LUTs at 256 pixels. The Training-User Mean Profile and Cyclic Wrong-Query Control tests apply LUTs at the original image resolution and compute metrics at 256 pixels. Within each test, the correct condition and the control use identical image-processing steps. Baseline resolutions and repeated-episode settings are specified in Appendix D.2. 15 Preprint CQS Interpretation.CQS combines the Base Fidelity Score with the Comparative Margin Ratio, following PPSD (Kim et al., 2026). Its full definition and aggregation are given in Appendix B.4. On PPSD, PCVP uses the five PCVP controls defined in Section 4 and Appendix D.1. B.2MIT-ADOBE FIVEK FiveK Expert C uses 4,500 training images and 500 test images. Model development uses 4,050 images for training and 450 for validation within the training set. The selected architecture and training duration are fixed before training on all 4,500 images. One Expert-C profile is constructed from 16 fixed training pairs, with the source as non-preferred and the expert-retouched image as preferred. Test images are excluded from profile construction and model selection. Training uses paired Lightroom sRGB images, and evaluation uses the LPTN 480p test pairs while preserving image aspect ratios. Metrics are computed on 8-bit outputs. The reported SSIM uses Wang-2009 automatic downsampling, and LPIPS uses AlexNet. Results average all eight predefined training seeds, 2029 to 2036. B.3PPR10K PPR10K is evaluated on the same released 2,286-image validation split for Experts A, B, and C (Liang et al., 2021). PrefLUT shares one model across all three experts, with one 16-pair reference set constructed for each expert from training images. Appendix C.3 details the architecture and training. Evaluation uses the released 360-pixel sources, 8-bit outputs, and the same implementations of PSNR, ∆E 76 , and their human-centered (HC) variants for all experts. The HC variants use the released human mask. RGB and Lab errors retain unit weight inside the mask and are multiplied by 0.5 outside it before PSNR-HC and ∆E 76 -HC are computed. Results average training seeds 2034 and 2036. B.4METRICS AND STATISTICAL TESTING Comparative Quality Score. Following Section 4.5 of PPSD (Kim et al., 2026), CQS combines the Base Fidelity Score (BFS) and Comparative Margin Ratio (CMR). It is computed separately for∆E 00 (Sharma et al., 2005), LPIPS (Zhang et al., 2018), PSNR, and SSIM (Wang et al., 2004). For query pairi, letI (i) p andI (i) n denote the preferred and non-preferred images. The evaluated method edits both under the same user condition, producing ˆ I (i) p and ˆ I (i) n . For metricm k , the four comparisons are: d (i) p,k = m k ( ˆ I (i) p ,I (i) p ), d (i) pn,k = m k ( ˆ I (i) p ,I (i) n ), d (i) np,k = m k ( ˆ I (i) n ,I (i) p ), d (i) n,k = m k ( ˆ I (i) n ,I (i) n ). (20) The first subscript identifies the input and the second identifies the target. Using both inputs evaluates adjustment of non-preferred images and preservation of preferred images. For the aggregate results reported here, the raw scores are averaged across the preferred and non-preferred inputs and allQ query pairs before the nonlinear CQS calculation: ̄ d p,k = 1 2Q Q X i=1 d (i) p,k + d (i) np,k , ̄ d n,k = 1 2Q Q X i=1 d (i) pn,k + d (i) n,k .(21) The standard episode hasQ = 800, with 16 query pairs per user, so users receive equal weight. For lower-is-better metrics, k ∈∆E 00 , LPIPS: BFS k = 1 q ̄ d p,k ̄ d n,k ,CMR k = ̄ d n,k − ̄ d p,k ̄ d n,k + ̄ d p,k .(22) For higher-is-better metrics, k ∈PSNR, SSIM: BFS k = q ̄ d p,k ̄ d n,k ,CMR k = ̄ d p,k − ̄ d n,k ̄ d p,k + ̄ d n,k .(23) The final score is: CQS k = BFS k (1 + CMR k ).(24) 16 Preprint BFS measures fidelity to both targets, while positive CMR indicates closer agreement with the preferred target. All four CQS measures are higher-is-better. The four CQS values are reported separately. The implementation adds10 −12 to the CMR denominator and floors the reciprocal BFS denominator at10 −12 for numerical stability. Bootstrap samples repeat the aggregation and CQS calculation rather than averaging per-query CQS values. Per-output CQS in qualitative figures instead uses that output’s two target comparisons. Direct Fidelity to Preferred in Table 1 reports only Q −1 P i d (i) np,k , which measures edited non-preferred inputs against preferred targets and is distinct from both ̄ d p,k and CQS. Color-Difference Notation.The CIE 1976 color difference is the Euclidean distance in CIELAB, ∆E 76 = p (∆L ∗ ) 2 + (∆a ∗ ) 2 + (∆b ∗ ) 2 , also denoted∆E ∗ ab (CIE, 2020). The published results in Tables E2 and E3 retain the notation∆E ab , while our evaluations use∆E 76 . Both refer to CIELAB Euclidean color difference. Values still depend on image processing and averaging within each protocol. This metric differs from PPSD’s CIEDE2000 ∆E 00 (Sharma et al., 2005). Other Metrics and Statistical Testing.FiveK reports PSNR, SSIM,∆E 76 , and Alex-LPIPS, with means and sample standard deviations over eight training seeds. PPR10K reports PSNR and∆E 76 together with their human-centered variants for configurations that use expert profiles. Each expert’s result is averaged over two training seeds, followed by an equal average across the three experts. PPSD uses paired user-bootstrap sampling. Each resample selects 50 users with replacement and includes all queries for each selected user under both conditions. When several evaluation episodes are combined, measurements are grouped by user. Control-specific resample counts are given in Appendix D.2. For PPSD paired comparisons, a gain is statistically positive when the lower endpoint of its paired 95% user-bootstrap interval is above zero. CEXPERIMENTAL SETTINGS Training uses BF16 for StarEnhancer, PIE-MSM, DiffRetouch, and PerTouch. The diffusion baselines’ quality and PCVP evaluation also use BF16. PrefLUT refinement and the PrefLUT FiveK/PPR10K configurations use FP32. Efficiency measurement settings are specified in Appendix C.4. Compact PrefLUT deployment uses FP32 weights, int8 profiles with one FP32 scale, and uint8 LUTs. C.1PREFLUT SETTINGS Architecture. The standard PrefLUT configuration usesN = 16ordered preference image pairs. The Reference Image Encoder and Query Image Encoder each use four stride-23× 3convolutional blocks with 32, 64, 128, and 256 output channels, GroupNorm, and SiLU. Global average pooling and a256 → 256linear projection produce each image feature. The Ordered Preference Encoder uses a768 → 512 → 256projection to form each ordered preference token. The Preference Set Aggregator hasK = 4learned pooling tokens,L = 4Transformer blocks, eight attention heads, and no positional embeddings. The aggregated user feature and Reusable User Profile have widths d f = d p = 256. Profile Projection and Profile Expansion are identity mappings in this standard configuration. Whend p ̸= d f , they are learned linear maps without biases. The expanded user feature and query feature feed the LUT latent vector head (512→ 512→ 256) and edit-strength head (512→ 256→ 1). The Identity-Residual LUT Decoder linearly maps thed z = 256latent vector to a128× 4× 4× 4feature volume. Three3 3 convolutions map channels128→ 64→ 32→ 3, with SiLU after the first two. Trilinear interpolation with aligned corners resizes the output to17 3 , followed bytanh, residual scaling byβ = 0.5, identity addition, and clipping. Descriptor computation and token ordering follow Appendices A.5 and A.2. Pretraining.The LUT autoencoder is pretrained for 50 epochs on 5,711 fitted training LUTs (Appendix A.3), with 64-pixel images for its image-application loss. Its loss weights (η rec ,η app ,η sm ,η mono ,η range )are(1, 1, 10 −3 , 10 −2 , 10 −1 ). An image-pair-to-LUT model is then pretrained for 30 epochs on the same aligned training pairs and fitted LUTs, using 128-pixel images and the frozen autoencoder. Given a preferred/non-preferred pair, it predicts a LUT latent vector whose target isE L (L ∗ ). The objective combines latentℓ 1 error, decoded-LUTℓ 1 error, image-application ℓ 1 error, an order-direction hinge loss, and a confidence loss, with weights(1, 1, 1, 0.1, 0.05). The 17 Preprint image target is the non-preferred image transformed byL ∗ . The direction term uses margin 0.1 to favor the correctly ordered pair over its reversal in latent distance toE L (L ∗ ). Binary cross-entropy supervises the confidence head with the fitted LUT’s relative image-ℓ 1 improvement over identity, clipped to[0, 1]. Both pretraining stages use batch size 32, AdamW at2× 10 −4 , cosine decay, weight decay10 −4 , gradient clipping at 1.0, and seed 2026. Checkpoint selection minimizes total validation loss on 413 fitted validation LUTs and their paired images, selecting epochs 50 and 30, respectively. The pretrained pair encoder initializes the Ordered Preference Encoder, including the Reference Image Encoder and pair projection. Its image-encoder weights initialize the Query Image Encoder. The pretraining latent and confidence heads are discarded. The Ordered Preference Encoder, Query Image Encoder, and Identity-Residual LUT Decoder remain frozen during personalized training. Personalized Training. The Preference Set Aggregator, LUT latent vector head, and edit-strength head are randomly initialized and optimized during personalized training. The standard identity profile mappings have no trainable parameters. The objective weights(λ c ,λ r ,λ a ,λ p ,λ g ,λ l ,λ u ) are(1, 1, 2, 3, 0.5, 0.05, 0.5), with ranking marginm = 0.02andτ = 0.05in the color-distance loss denominator. The model is trained for 100 epochs using 128-pixel crops, batch size 16, four query pairs per user, and AdamW with learning rate2× 10 −4 , cosine decay, weight decay10 −4 , and gradient clipping at 1.0. The five checkpoints with the lowest fixed validation loss are evaluated on the full validation episode. Epoch 91 gives the highest CQS on all four measures among these candidates. PrefLUT uses this epoch-91 checkpoint for PPSD quality, PCVP, and profile refinement. PPSD quality results are validation estimates after checkpoint selection on the same users and evaluation episode. Inference. The main PPSD quality results use training seed 2026 and an evaluation episode con- structed with sampling seed 2028. Query construction and image processing follow Appendix D.2. The effective inference strength in Equation 6 isg eval u,q = 0.7g u,q . The residual scale of 0.7 is fixed across all users, control conditions, and five candidate checkpoints. Table 1(A,B) uses unquantized FP32 profiles. The int8 deployment and timing configuration is specified in Appendix C.4. C.2BASELINE REPRODUCTION AND ADAPTATION The following descriptions follow the baseline order in Table 1. All eight baseline adaptations use ten PPSD training epochs and report the final-epoch checkpoint without validation-based checkpoint selection. PieNet also receives ten epochs of triplet pretraining before this adaptation stage. PieNet, StarEnhancer, PIE-MSM, DiffRetouch, and PerTouch are adapted to PPSD using training seed 2026. Training uses 471 users, 16 reference pairs, and four query pairs per user. Reference and query pairs are disjoint. The shared pairwise objective assigns weights(1, 1, 2, 3)to the color-distance, ranking, aligned-pair reconstruction, and preservation losses. Evaluation uses 50 validation users, N = M = 16, and episode seed 2028, giving 800 query pairs. For the Cyclic Wrong-Query Control, the conditioning features below are computed from another query image of the same user. PieNet. The PieNet adaptation (Kim et al., 2020) uses a ResNet-18 encoder and randomly initialized personalized layers. The model first receives triplet pretraining using reference images, followed by pairwise training with Adam at learning rate10 −4 and 256-pixel images. For each new user, a normalized 512-dimensional user code is fitted to 16 preference pairs while the networks remain frozen. Fitting uses a triplet margin of 0.2 and 100 Adam steps at learning rate 0.05. The Cyclic Wrong-Query Control replaces the condition at the global bottleneck while keeping skip-connection features from the original query. StarEnhancer. StarEnhancer (Song et al., 2021) starts from public pretrained weights. The map- ping network and enhancer are updated while the style encoder remains frozen. Training uses Adam at learning rate10 −5 , 256-pixel images, and gradient clipping at 1.0. Non-preferred and preferred reference features are aggregated separately to form the source and target style centers. The Mismatched-Pair Profile preserves both centers and is therefore marked as not applicable. The Cyclic Wrong-Query Control replaces the query features used to predict enhancement parameters. PIE-MSM. PIE-MSM (Kosugi & Yamasaki, 2024) starts from public pretrained weights. Training updates the Transformer, masked-style and content modules, and enhancer using Adam at learning rate10 −5 , 512-pixel images, and gradient clipping at 1.0. Each reference token combines the preferred-minus-non-preferred style feature difference with the content feature of the non-preferred 18 Preprint image. The Cyclic Wrong-Query Control replaces the query image’s content features supplied to the Transformer while keeping the original image as the editing input. DiffRetouch. DiffRetouch (Duan et al., 2025) starts from public weights and updates the U-Net and HDR decoder while the VAE remains frozen. Training uses AdamW at learning rate10 −6 and weight decay 0.01. A denoising loss with weight one is added to the shared pairwise objective for preferred-input preservation and aligned-pair reconstruction. Quality and PCVP evaluation use 20 sampling steps. The method’s attribute measurements produce a four-dimensional control vector from 16 reference pairs. For each attribute, the sign of the preferred-minus-non-preferred difference is averaged over the pairs. The attributes are colorfulness, brightness, contrast, and temperature, in that order. The Cyclic Wrong-Query Control replaces the low-resolution image condition. Bilateral-grid guidance and application use the original query. PerTouch. The PerTouch adaptation (Chang et al., 2026) starts from public weights and updates the ControlNet and output convolution while the VAE remains frozen. Training uses AdamW at learning rate10 −6 , weight decay 0.01, and the shared pairwise objective. A denoising loss with weight one is added for preferred-input preservation and aligned-pair reconstruction. Quality and PCVP evaluation use 50 sampling steps. Attribute measurements produce a four-dimensional control vector by averaging the signs of preferred-minus-non-preferred differences over 16 pairs. The attribute order is colorfulness, contrast, temperature, and brightness. The vector is expanded to a spatially constant parameter map for the public diffusion backbone. This adaptation excludes the VLM Agent’s semantic masks and editing memory. The Cyclic Wrong-Query Control replaces the VAE image condition. The architecture has no separate path that applies a predicted transform to the original query. This control measures dependence on the VAE image condition, including image content, rather than isolating color-transform prediction on a fixed image. For both diffusion methods, the Training-User Mean Profile averages profiles from 471 training users. Correct and controlled conditions share diffusion seed2028 + 32i + 2j + b, whereiis the user index,jis the query-pair index, and b∈0, 1 identifies the preferred or non-preferred input. All indices start at zero. User-specific Decoder. The implementation follows the EDSR/HIIF mechanism in Kim et al. (2026) and is trained on PPSD. For a new user, the shared image encoder remains frozen while decoder weights are fitted to the user’s reference pairs using 100 Adam steps at learning rate10 −4 . This implementation uses the released image-processing components and supplies the quality, PCVP, and efficiency results. The Training-User Mean Profile is formed by averaging decoder weights fitted to the reference sets of 471 training users. User Preference Embedding (UPE). The UPE adaptation (Kim et al., 2026) combines a frozen DINOv2 ViT-S/14 encoder with a locally implemented enhancement network. Training uses the shared pairwise loss and Adam at learning rate10 −4 . This model supplies the quality results in Ta- ble 1(A,B) and the PCVP results. The Cyclic Wrong-Query Control replaces spatial encoder features while keeping the original query’s RGB values, coordinates, and residual skip connections. The efficiency results in Table 1(C) use a separate, untrained EDSR/HIIF model with a 256-dimensional preference embedding and a pretrained frozen DINOv2 encoder. For this timing model, the preference embedding is concatenated with the input to the first HIIF MLP. Preference fusion uses two layers and eight attention heads. Exemplar-based Inference. The implementation follows Kim et al. (2026) and adapts PIE-MSM using triplets of scene, preferred, and non-preferred images. A learned projection maps the resulting 1,536-dimensional triplet features to 1,024 dimensions. This implementation uses the released image- processing components and supplies the quality, PCVP, and efficiency results. The Reversed-Order Profile and Mismatched-Pair Profile retain the original scene and content features. C.2.1PERSONALIZED ENHANCEMENT METHODS NOT COMPARED ON PPSD RefRetouch. RefRetouch (Weldengus et al., 2026) combines a LoRA-adapted Siamese SigLIPv2 encoder, a conditional color-space MLP, and retrieval of reference retouching latents. It learns from original/retouched image pairs. Its project page lists ECCV 2026 and marks the code as “to be released” as of 19 September 2026. 1 PPSD comparison requires adapting the reference interface and training objective to ordered preferences that need not be pixel-aligned. RefRetouch is therefore discussed but excluded from quantitative comparisons. 1 https://tememuruts.github.io/RefRetouch-Project-Page/ 19 Preprint FedPAIE. The 2026 preprint FedPAIE (Xu et al., 2026) studies federated learning from private scalar aesthetic ratings. A locally calibrated scorer guides per-user adaptation of a CLUT enhancer. Calibration combines rating regression, pairwise ranking derived from ratings, and a rating-variance objective. PPSD supplies relative choices without the scalar targets required by these objectives. Adapting FedPAIE would therefore require redefining its scorer supervision and client training protocol, in addition to the enhancement objective. Its decentralized data constraints and scorer- guided adaptation thus place it outside the current PPSD comparison. C.3IMPLEMENTATION DETAILS FOR EXTENDED EXPERIMENTS FiveK uses Expert C, and PPR10K uses Experts A, B, and C to evaluate expert-target enhancement. Dataset splits and processing are specified in Appendices B.2 and B.3. Color Curves, LUT, and Spatial Residual. Both configurations concatenate the expanded user feature and query feature asξ = [ ̄p u ,c q ]∈R 512 . Two heads, each using LayerNorm, a512→ 512 linear layer and SiLU, predict 48 curve logits and 64 LUT coefficients, respectively. For channelc, the 16 logits v c,k define positive increments and 17 monotone knots: a c,k = softplus(v c,k ) + 10 −6 , q c,0 = 0, q c,j = P j k=1 a c,k P 16 k=1 a c,k . Linear interpolation between knots at input valuesj/16defines the channelwise curveC ξ . LetB 0 andB k 64 k=1 be learned residual grids of size17 3 × 3, and letb k (ξ)be the coefficient-head outputs. The query-conditioned LUT is: L ξ = clip [0,1] L id + 0.5 tanh B 0 + 64 X k=1 tanh(b k (ξ))B k !! . The rank refers to the 64 learned residual bases. For query imageI, the global output isJ = T (L ξ ,C ξ (I)). A spatial network takes the six-channel concatenation[I,J ]resized to half resolution. Its three3× 3convolutions have channels6→ 24→ 24→ 3, with SiLU after the first two. After the first SiLU, the feature mapFis modulated as(1 + γ)⊙ F + δ, where a linear map ofξpredicts the channelwise scaleγand shiftδ. Bilinear upsampling restores the spatial residualR ξ (I,J )to the original resolution. Both configurations use full edit strength, giving the final image: b I = clip [0,1] J + 0.25 tanh(R ξ (I,J )) . Spatial resizing uses bilinear interpolation without aligned corners. These components are trained jointly for the expert targets. The additional spatial residual is applied after the global color transform and remains a separate image-processing component. C.3.1FIVEK EXPERT-TARGET ENHANCEMENT The 6.127M-parameter FiveK configuration uses the components above. Its Reference Image Encoder and compact Query Image Encoder are trained from scratch. Each of the eight training runs uses batch size 32, Adam with learning rate3× 10 −4 , no weight decay, warmup followed by cosine decay, and gradient clipping at 1.0. References are resized to 128 pixels. Training uses 384-pixel crops, horizontal flips, and brightness and saturation augmentation. The architecture and training duration are selected using the validation subset of the training images, and each final checkpoint is evaluated on all 500 test images. All eight training runs contribute equally to the mean. C.3.2PPR10K EXPERT-TARGET ENHANCEMENT The 17.156M-parameter PrefLUT configuration jointly trains a shared model with monotone color curves, a rank-6417 3 LUT, an ImageNet-pretrained ResNet-18 Query Image Encoder, and a spatial residual. The Reference Image Encoder and Preference Set Aggregator are randomly initialized, and no PPSD enhancement checkpoint is reused. Each expert profile is constructed from the same 16 training images, with the expert-retouched target as preferred and the source as non-preferred. Architecture selection uses 8,005 training images and an internal validation subset of 870 images, with no shared image groups, and compares the epoch-8 checkpoints. The selected architecture is 20 Preprint then trained on all 8,875 training images for eight epochs using seeds 2034 and 2036. References are resized to 128 pixels and training inputs to 224 pixels. Training uses batch size 12, AdamW at3× 10 −4 , cosine decay, weight decay10 −4 , and gradient clipping at 1.0. The final epoch-8 checkpoint of each run is evaluated against each expert’s targets for the same 2,286 source images in the released 360p validation set (Liang et al., 2021). Results average both training runs equally. C.4EFFICIENCY MEASUREMENT PrefLUT latency measurements and the profile-reuse benchmark use FP32. Baseline latency mea- surements use BF16 automatic mixed precision. Latency measurements disable TF32. Main Comparison. All methods use one RTX 5090 and four CPU threads on a Ryzen 9 9950X3D. All methods use the same eight PPSD validation users, 32 query images at512× 512, and 16 reference pairs per user from episode seed 2028. Users are sorted by identifier, and the first eight are selected. Both images from each user’s first two sampled query pairs are timed. Query batch size is one. After one profile-construction warmup and five editing warmups, latency is the mean elapsed time measured with GPU synchronization. Loading, external resizing, input transfer, serialization, and quality metrics are excluded. All internal image transforms, LUT application, and decoding are timed. Reference features are extracted one image at a time at224×224for DINOv2 and256×256otherwise. Construction includes both images of each pair, PieNet’s user-code fitting, PIE-MSM’s style and content encoding, and UPE’s DINOv2 features. UPE uses the untrained HIIF implementation specified in Appendix C.2. User-specific Decoder construction includes 100 Adam fitting steps at 10 −4 . Exemplar-based Inference encodes the scene, preferred, and non-preferred reference images. DiffRetouch and PerTouch compute their image attributes on the CPU and use 20 and 50 sampling steps, respectively. Parameters include the complete networks needed by either stage, including frozen backbones. Profile storage follows each method’s saved representation. User-specific Decoder stores its fitted decoder parameters per user. For PrefLUT, Table 1(A,B) reports the epoch-91 model with an unquantized 256- dimensional FP32 profile, occupying 1,024 bytes per user. Panel (C) measures a separate checkpoint with the same architecture and an int8 profile: 256 bytes for its entries plus one four-byte FP32 scale, totaling 260 bytes per user. Profile quantization and dequantization are included in the timed stages. The computational cost includes convolutions and matrix multiplications needed to edit one query using a stored profile. Each multiply-add counts as two FLOPs. Attention and all diffusion steps are included. Grid sampling, resizing, normalization, softmax, activations, and other elementwise operations are excluded, making these counts lower bounds on total arithmetic. The same counting rule applies to every method. Profile Reuse Benchmark. A separate benchmark uses two users with 16 reference pairs and 16 query pairs per user, giving 64 query images per batch. The benchmark covers reference encoding and parameter prediction, excluding LUT decoding, image application, and profile quantization. References and queries are resized to 256 and 512 pixels, respectively. Timing uses three warmup iterations followed by 500 measured repetitions. Predicting LUT latent vectors and edit strengths takes 77.204236 ms when reference sets are encoded separately for all 64 queries and 8.437795 ms when the two Reusable User Profiles are reused. The ratio is77.204236/8.437795 = 9.149812≈ 9.150. Initial reference encoding costs 2.131532 ms, giving 10.569326 ms for the first batch and a7.305× speedup when that cost is included. Table 1(C) instead measures complete single-query editing with a stored profile. DPREFERENCE-CONDITIONING VERIFICATION PROTOCOL (PCVP) PCVP assesses whether collecting and storing a user’s preferences improves editing for that user. An editor can produce attractive images using an enhancement rule shared across users, so image quality alone does not establish the value of personal feedback. PCVP compares edits of the same query under controlled changes to preference and query conditions. The resulting gains provide a common basis for verifying that the supplied preferences and current image contribute to editing quality. The controls, pass criteria, and PPSD settings are detailed below. 21 Preprint D.1DETAILED PCVP CONTROLS PCVP tests whether editing quality benefits from the intended user’s profile, preference order, pair correspondence, individual preferences, and the query image. Each test changes one condition while keeping the shared model parameters, evaluated users, query-target pairs, image-processing steps, and metric computation fixed. The four profile controls keep the query condition unchanged. The Cyclic Wrong-Query Control keeps the user profile unchanged. LetS u = (I + i ,I − i ) N u i=1 be useru’s ordered preference image pairs, whereI + i andI − i are the preferred and non-preferred images, and letGdenote the evaluated method’s profile construction function, sop u = G(S u ). The functionF (p,Q cond ,Q apply )denotes the output under profilep and conditioning queryQ cond , retainingQ apply on any separate image-application path. Under the correct condition,Q cond = Q apply is the current query image. Method-specific conditioning interfaces are given in Appendix C.2. D.1.1FIXED WRONG-USER PROFILE Users can prefer different brightness, contrast, or color for the same photo. This test asks whether using the intended user’s profile improves the result compared with another user’s profile. It evaluates whether stored profiles preserve user differences that matter for editing. A fixed user reassignmentρ U replacesp u with another user’s profilep ρ U (u) , withρ U (u) ̸= u. On PPSD, each user receives the next user’s profile in a fixed order, and the last user receives the first user’s profile. Each replacement profile is built from the other user’s correct reference set. The evaluated user’s query images and targets remain fixed. A positive CQS gain for the correct profile therefore shows the benefit of the intended user’s preferences. D.1.2REVERSED-ORDER PROFILE Pairwise feedback records the preferred alternative. Choosing the darker or brighter version of the same pair should provide different editing guidance. This test checks whether the editor follows the user’s choice and whether preference labels affect editing quality. The preferred and non-preferred images are exchanged within every reference pair: S rev u =(I − i ,I + i ) N u i=1 , p rev u = G(S rev u ).(25) The reference images, pair membership, and reference count remain unchanged. Only preference direction changes. A positive gain supports the use of ordered choices beyond an unordered collection of reference appearances. D.1.3MISMATCHED-PAIR PROFILE Each choice is made against a specific alternative. Choosing a warm image over a cooler image conveys a different comparison from choosing it over a more saturated image. This test assesses whether preserving each original pair improves the resulting edits. For methods using paired references,ρ P (i) = 1 + (i mod N u )cyclically shifts the reference-pair indices. Each preferred image is paired with the next non-preferred image: S mis u =(I + i ,I − ρ P (i) ) N u i=1 , p mis u = G(S mis u ).(26) The reassignment preserves the complete preferred and non-preferred image sets and the number of reference pairs, but breaks the original pair correspondence within each user. A positive CQS gain shows the benefit of that correspondence beyond separately aggregating the two image sets. The Reversed-Order Profile changes which image is preferred within each pair. The Mismatched-Pair Profile changes which images are paired. D.1.4TRAINING-USER MEAN PROFILE An editing service could apply one default profile to every user. Here, that default is the mean profile of training users. This test asks whether an individual’s feedback provides better edits than the shared default, evaluating the value of collecting personal feedback and maintaining individual profiles. 22 Preprint One profile is constructed from a fixed reference set for each training user, then averaged with equal user weights: p train = 1 |U train | X v∈U train G(S v ), p mean u =p train .(27) Only training users contribute to the mean profile. When a profile contains a sequence of features, the features are first averaged within each training user, then across users. The averaging rules for User-specific Decoder, DiffRetouch, and PerTouch are specified in Appendix C.2. Every evaluated user’s profile is replaced by the same training-user mean. A positive CQS gain shows the benefit of individual preferences over the shared population profile. The Fixed Wrong-User Profile instead compares the intended user’s preferences with another individual’s preferences. D.1.5CYCLIC WRONG-QUERY CONTROL Applying the same preference to photos with different exposures and color distributions can require different transforms. For example, a transform predicted for a dark indoor image may be unsuitable for a bright outdoor image. This test checks whether reusable preferences are translated into edits suited to each current photo. For PrefLUT, query pairs are sorted by pair identifier and cyclically shifted within each user. Preferred and non-preferred inputs use the corresponding image from the next pair as their query condition. Hereρ Q (q)indexes the corresponding conditioning image for queryq, withρ Q (q)̸= q. The original query is retained on any separate image-application path: b I wrongQ u,q = F (p u ,Q u,ρ Q (q) ,Q u,q ), b I (0) u,q = F (p u ,Q u,q ,Q u,q ).(28) The user profile and evaluation target remain fixed. In PrefLUT, the substituted query determines the predicted LUT and edit strength. Both transforms are applied to the same original image, so a positive CQS gain shows the benefit of using the current query to predict its color transform. PerTouch instead replaces its VAE image condition. Its gain also reflects image-content dependence (Appendix C.2). D.2EVALUATION CRITERION AND PPSD SETTINGS Pass Criterion. The gain is correct-condition CQS minus control-condition CQS (Equation 11). On PPSD, CQS is computed separately for∆E 00 , LPIPS, PSNR, and SSIM, with higher scores indicating better quality. Positive gains favor the correct condition. A change in output alone does not show better quality. The paired bootstrap resamples users while retaining all queries of each selected user and the pairing between conditions. A metric passes when the lower endpoint of its paired 95% interval is strictly positive. For repeated evaluation episodes, the gain must also retain its direction as required by the main protocol. Bootstrap procedures are given in Appendix B.4, with control-specific settings below. For each control, the pass count is the number of metrics with a statistically positive CQS gain, ranging from 0/4 to 4/4. This count measures the evidence for effective conditioning rather than absolute image quality. A full PCVP pass requires 4/4 for all five controls, as defined in Equation 12. PCVP changes the profile or query condition while keeping shared model parameters fixed. Architecture ablations instead compare models trained with different components. PPSD Evaluation Settings. The eight baseline adaptations are evaluated with 50 validation users, 16 reference pairs and 16 query pairs per user, and episode seed 2028. Reference images are resized to 256 pixels and query images to 512 pixels. Metrics are computed at 256 pixels. Each baseline control uses the same model checkpoint and sampled reference and query sets as its correct condition. Confidence intervals use 250,000 paired user-bootstrap resamples. PrefLUT’s Fixed Wrong-User Profile test uses the same episode and 512-pixel queries as the quality evaluation. Its confidence intervals use 250,000 paired user-bootstrap resamples with bootstrap seed 2028. The Reversed-Order Profile and Mismatched-Pair Profile tests use 256-pixel inputs and 100,000 resamples. The Training-User Mean Profile and Cyclic Wrong-Query Control tests apply transforms at the original image resolution and compute metrics at 256 pixels, using 250,000 resamples. PPSD training uses seeds 2026 and 2027. The main comparison reports training seed 2026 and evaluation episode seed 2028. 23 Preprint Repeated Evaluation Episodes. For the fixed model, three additional episodes use seeds 2029 to 2031 to repeat the Fixed Wrong-User Profile, Reversed-Order Profile, and Cyclic Wrong-Query Control tests. These episodes keep the validation users, reference and query counts, image-processing steps, metrics, and control rules unchanged. EADDITIONAL EXPERIMENTAL RESULTS E.1PPSD PCVP RESULTS Control Applicability. StarEnhancer constructs source and target style centers by separately av- eraging non-preferred and preferred reference features, then normalizing the two averages. The Mismatched-Pair Profile changes pair correspondence but preserves both image sets, so neither style center changes. This control therefore leaves StarEnhancer’s condition unchanged and is marked as not applicable in Table 2. The conditioning interface determines whether a control applies, indepen- dently of the measured gain. StarEnhancer passes one of its four applicable controls. The reported 1/4 counts applicable controls, whereas full PCVP requires passing all five. Baseline Conditioning Patterns. Table 2 distinguishes dependence on the query image from the benefit of an individual user’s preferences. StarEnhancer, DiffRetouch, and PerTouch pass all four metrics in the Cyclic Wrong-Query Control, but none passes all four in either the Fixed Wrong-User Profile or Training-User Mean Profile test. Thus, their use of the current image does not establish a consistent quality advantage for the intended user’s profile. In the two diffusion adaptations, references are reduced to four averaged attribute-sign values, which can map different reference sets to similar controls. PerTouch’s query intervention also changes its VAE image condition, so its large query gains include image-content dependence, as explained in Appendix C.2. PIE-MSM passes the Reversed-Order Profile, Mismatched-Pair Profile, and Cyclic Wrong-Query Control tests, consistent with its joint use of style-difference and content features. However, its correct profile does not improve all four metrics over another user’s profile or the training-user mean. These results support its use of structured reference evidence while leaving the stronger user-specific benefit unverified by the full PCVP criterion. PieNet, UPE, User-specific Decoder, and Exemplar-based Inference show gains on selected metrics or controls without passing any complete test. For PieNet and UPE, the query intervention retains original-image paths, so weak query gains concern the replaced conditioning features rather than dependence on the input image as a whole. These conclusions apply to the evaluated PPSD adaptations and their conditioning interfaces, without ruling out personalization in the original methods. E.1.1PREFLUT STABILITY ACROSS EVALUATION EPISODES We test the stability of PrefLUT’s PCVP results across repeated evaluation sampling, keeping the trained checkpoint and validation users fixed. We repeat the Fixed Wrong-User Profile, Reversed- Order Profile, and Cyclic Wrong-Query Control tests with episode seeds 2029 to 2031, in addition to the seed-2028 evaluation in Table 2. This experiment measures sensitivity to evaluation sampling, rather than variation across independently trained models. For PrefLUT, combining the three episodes yields positive gains supported by the PCVP criterion for all four metrics in each test. The Fixed Wrong-User Profile test passes three, three, and four metrics in the individual episodes, respectively. The other two tests pass all four metrics in every episode. Table E1 reports these combined PrefLUT results. E.2ENHANCEMENT ON FIVEK AND PPR10K Tables E2 and E3 include published results for SpliNet (Bianco et al., 2020), PieNet, StarEnhancer, and PIE-MSM. Their values come from Table I of Kosugi & Yamasaki (2024), using 100 reference pairs per new expert and averaging ten reference-set samples. The experts are unseen during model training. PrefLUT uses 16 reference pairs and is trained toward the evaluated expert targets (Appendix C.3). These settings differ in training data, expert coverage, and image resolution, so the tables separate the protocols without a shared ranking. 24 Preprint Table E1: PrefLUT PCVP gains across evaluation episodes on PPSD. Gains are correct-condition CQS minus the named control’s CQS, combined over sampling seeds 2029–2031 with the model and users fixed. Brackets give paired 95% user-bootstrap confidence intervals. PCVP Test∆E 00 ↑LPIPS↑PSNR↑SSIM↑ Fixed Wrong-User Profile 0.003999 [.002139,.006048] 0.412528 [.194432,.698803] 0.267460 [.036182,.512614] 0.001102 [.000600,.001662] Reversed-Order Profile 0.006449 [.003358,.010141] 0.383434 [.109178,.764762] 0.612272 [.265722,.991219] 0.001116 [.000539,.001746] Cyclic Wrong-Query Control 0.015708 [.012523,.019271] 2.393584 [1.629063,3.454507] 0.881433 [.773038,.990171] 0.005383 [.004403,.006354] E.2.1MIT-ADOBE FIVEK Table E2(A) averages the published personalization results across Experts A/B/C/D/E. Panel (B) evaluates PrefLUT on the 500-image Expert-C test set across eight training seeds. Its 480-pixel evalu- ation preserves aspect ratio and uses Wang-2009 automatic downsampling for SSIM (Appendix B.2). The published protocol uses 512× 512 inputs to the enhancer. Table E2: MIT-Adobe FiveK results under different evaluation protocols. (A) Published unseen-expert personalization results averaged over Experts A/B/C/D/E. (B) PrefLUT trained for Expert C and evaluated on held-out images, reported as mean± sample standard deviation over 8 training seeds. (A) Unseen-Expert Personalization, 100 Reference Pairs MethodPSNR↑SSIM↑∆E ab ↓ SpliNet (TIP 2020)19.940.84013.87 PieNet (ECCV 2020)20.540.85113.56 StarEnhancer (ICCV 2021)19.680.83314.94 PIE-MSM (TCSVT 2024)23.180.89810.13 (B) Expert-C Enhancement, 16 Reference Pairs MethodPSNR↑SSIM↑∆E 76 ↓Alex-LPIPS↓ PrefLUT24.5717± 0.08150.91718± 0.000607.8331± 0.06290.06663± 0.00054 E.2.2PPR10K Table E3(A) averages published personalization results across Experts A/B/C. Panel (B) evaluates a shared PrefLUT model trained on all three expert targets. Both settings use 2,286 evaluation images per expert. PrefLUT uses the 360-pixel release, while the published protocol uses512× 512enhancer inputs. The PrefLUT results average two training seeds and include human-centered metrics that give greater weight to regions covered by the released human masks (Appendix B.3). FPROFILE REFINEMENT AND ABLATION STUDIES F.1PROFILE REFINEMENT Feedback and Controls. Each evaluation episode uses 50 PPSD validation users. Ten sampling seeds, 2026 to 2035, determine the feedback and query sets. For each user, 16 query pairs remain fixed while 24 feedback pairs are sampled. Feedback and query sets share no image or scene identities. Each recorded choice provides one ordered preference image pair. The firstN ∈4, 8, 12, 16, 24 pairs of the same feedback sequence form the reference sets at successive stages. The Frozen Initial Profile is built from the first four pairs and remains unchanged. Cumulative Feedback rebuilds the profile from all pairs available at each stage. Reversed New Feedback swaps the preferred and non-preferred images in newly added pairs while keeping the initial four pairs unchanged. The primary comparison evaluates Cumulative Feedback against the Frozen Initial Profile atN = 16. Figure 4 shows how quality changes as feedback accumulates. 25 Preprint Table E3: PPR10K results under different evaluation protocols. (A) Published unseen-expert per- sonalization results averaged over Experts A/B/C. (B) One PrefLUT model trained jointly for these experts, with each row averaged over 2 training seeds. HC denotes human-centered metrics. (A) Unseen-Expert Personalization, 100 Reference Pairs MethodPSNR↑SSIM↑∆E ab ↓ SpliNet (TIP 2020)20.340.86512.84 PieNet (ECCV 2020)19.970.82414.32 StarEnhancer (ICCV 2021)21.220.88512.29 PIE-MSM (TCSVT 2024)22.970.9219.83 (B) Enhancement for Experts A/B/C, 16 Reference Pairs Target ExpertPSNR↑∆E 76 ↓PSNR-HC↑∆E 76 -HC↓ Expert A25.22117.589728.47374.9233 Expert B24.88767.997128.14695.1686 Expert C25.20697.878028.48425.1150 Mean over A/B/C25.10527.821628.36835.0690 Table F1: Profile refinement on PPSD.Ncounts accumulated feedback pairs. Gains subtract Frozen Initial Profile CQS (4 pairs) from Cumulative Feedback CQS.†uses Reversed New Feedback as the comparison at N = 16. Brackets give paired 95% user-bootstrap confidence intervals. CQS Gain↑ Feedback Pairs N∆E 00 LPIPSPSNRSSIM 8 +0.002274 [0.001578, 0.003031] +0.125910 [0.073599, 0.199634] +0.289340 [0.196488, 0.379035] +0.000223 [0.000117, 0.000339] 12 +0.003037 [0.002116, 0.004013] +0.172396 [0.104210, 0.267251] +0.393652 [0.255991, 0.521696] +0.000350 [0.000222, 0.000488] 16 +0.003215 [0.002309, 0.004167] +0.176357 [0.107124, 0.271374] +0.443595 [0.303425, 0.575171] +0.000359 [0.000224, 0.000503] 24 +0.003531 [0.002684, 0.004431] +0.184820 [0.114342, 0.282361] +0.467157 [0.328338, 0.597955] +0.000374 [0.000237, 0.000520] 16 † +0.003572 [0.002074, 0.005299] +0.179112 [0.083788, 0.314092] +0.749985 [0.468387, 1.039789] +0.000482 [0.000263, 0.000727] Profile Updates and Inference. Profile refinement uses the epoch-91 model trained with seed 2026 and the frozen LUT autoencoder. All network weights remain frozen. Each profile update re-encodes the retained ordered preference image pairs and saves a 260-byte Reusable User Profile for later queries. Reference images and query thumbnails are encoded at 256 and 512 pixels, respectively. LUTs are applied at full resolution, and metrics are computed at 256 pixels. Predicted edit strength is multiplied by 0.7. Statistical Evaluation. For each feedback stage and condition, raw metric components are first averaged over queries and all ten feedback sampling seeds within each user. These components are then averaged equally across the 50 users before computing CQS. Paired 95% intervals use 100,000 user-bootstrap resamples, retaining all sampling seeds, feedback stages, and conditions for each selected user. Each resample repeats the component aggregation and CQS calculation. The intervals quantify user variation with model weights fixed. Table F1 gives the complete paired gains. F.2CORE ABLATIONS The full-model control uses a 256-dimensional Reusable User Profile, four learned pooling tokens, four Transformer blocks, and frozen image encoders. Each structural ablation changes one component while retaining the other settings. In the Set Transformer ablation, masked mean pooling replaces the learned set aggregation. The Explicit Feature Difference and Query Feature ablations seta + i −a − i and 26 Preprint Table F2: Core ablations on PPSD. (A) CQS and Fixed Wrong-User Profile PCVP gains. (B) Differences in Fixed Wrong-User Profile PCVP gain, computed as each variant’s gain minus its matched full model’s gain, with paired 95% user-bootstrap confidence intervals. Blue values mark intervals entirely below zero. Minus signs denote removed components, with the Set Transformer replaced by masked mean pooling. (A) CQS and Wrong-User PCVP Gains Correct User Profile CQS↑Wrong-User PCVP Gain↑ Variant∆E 00 LPIPSPSNRSSIM∆E 00 LPIPSPSNRSSIM − Explicit Feature Difference.2092821.0084231.73068.91467+.00102+.10579+.10323+.00028 − Set Transformer.1905019.7244129.69401.91261-.00014-.00014-.00290-.00001 − Query Feature.2065719.7705233.42625.91171+.00081+.08989+.04642+.00028 PrefLUT.2103421.2082231.94439.91523+.00410+.42875+.38935+.00139 (B) Change in Wrong-User PCVP Gain (Variant Minus Full Model) Variant ∆E 00 (10 −3 )LPIPSPSNR SSIM (10 −3 ) Structural ablations − Explicit Feature Difference −3.074 [−5.035,−1.074] −0.322957 [−.533102,−.168424] −0.286126 [−.619128,.028585] −1.116 [−1.782,−0.527] − Set Transformer −4.238 [−6.382,−2.060] −0.428884 [−.680801,−.245940] −0.392256 [−.749216,−.053438] −1.401 [−2.165,−0.735] − Query Feature −3.290 [−5.462,−1.312] −0.338858 [−.566963,−.175087] −0.342936 [−.855309,.138272] −1.110 [−1.758,−0.539] Loss ablations − Wrong-User Contrast Loss (Seed 2026) −0.037053 [−.065623,−.007432] −0.004843 [−.007850,−.002235] −0.002883 [−.006968,.001180] −0.013593 [−.024760,−.004833] − Wrong-User Contrast Loss (Seed 2027) −0.035488 [−.064323,−.005684] −0.004894 [−.009005,−.001913] −0.001582 [−.006312,.003404] −0.013424 [−.027026,−.001900] c q to zero, respectively, while retaining the original input dimensions and layer shapes. The variants and full-model control are initialized from the same personalized PrefLUT checkpoint and trained for 10 additional epochs on the 471 training users, using seed 2026 and AdamW with a learning rate of 10 −5 . Each run selects its lowest-validation-loss checkpoint: epoch 3 for the full model, epoch 10 for the feature-difference and Set Transformer ablations, and epoch 9 for the query-feature ablation. Evaluation uses sampling seed 2028, 50 users, and 16 reference pairs and 16 query pairs per user. Reference and query images and metrics use 256 pixels. Profiles use int8 quantization, and predicted edit strength is multiplied by 0.7. These comparisons measure component effects under this shared training and evaluation setting, separately from the epoch-91 model and 512-pixel query inputs with unquantized profiles used for the main quality results in Table 1(A,B). Table F2(A) reports absolute CQS and Fixed Wrong-User Profile PCVP gains for the variants and their shared full-model control. The Wrong-User Contrast Loss is evaluated in two comparisons using training seeds 2026 and 2027. Within each seed, the full model and the variant without the loss share the same personalized initialization and undergo 10 additional training epochs with the same optimization settings as above. Minimum validation loss selects epoch 5 for both models with seed 2026 and epoch 6 for both with seed 2027. These runs provide their own full-model controls, separate from the structural study, and are evaluated at 256 pixels with an edit-strength scale of 0.7. Seed 2026 combines two evaluation episodes, while seed 2027 uses one. Each episode includes 50 users and 800 query pairs. Table F2(B) reports each variant’s Fixed Wrong-User Profile PCVP gain minus its matched full model’s gain, with paired 95% user-bootstrap intervals. Structural ablations use 250,000 resamples, and loss ablations use 100,000. Table 3 uses the same difference definition and averages the two loss-ablation training runs equally. Removing learned set aggregation reduces the Fixed Wrong-User Profile PCVP gain, with paired intervals entirely below zero on all four metrics. Removing the Explicit Feature Difference, Query 27 Preprint Feature, or Wrong-User Contrast Loss gives intervals entirely below zero on three metrics. Each comparison uses the full model trained under the same settings as the corresponding ablation. F.3PROFILE WIDTH Table F3 compares profile widths using the initialization, 10-epoch training budget, checkpoint- selection rule, and evaluation settings of the structural study in Appendix F.2. The 256-dimensional reference is the same full-model checkpoint used in Table F2(A). The selected epochs for widths 32, 64, 128, 256, and 512 are 10, 9, 3, 3, and 3, respectively. An int8 profile stores one byte per dimension and a four-byte scale. For each width, the paired CQS difference is measured against the 256-dimensional profile. Quality is considered retained when the lower bound of the 95% interval exceeds−1%of the reference CQS on every metric. Among the tested widths, the 256-dimensional profile is the smallest that meets this quality criterion, using 260 bytes. Increasing the width to 512 provides comparable quality while nearly doubling storage. Table F3: Reusable User Profile dimension on PPSD. CQS uses the correct user profile, and PCVP gain compares it with the Fixed Wrong-User Profile. The standard profile has 256 dimensions. Correct User Profile CQS↑Wrong-User PCVP Gain↑ Profile Dimension∆E 00 LPIPSPSNRSSIM∆E 00 LPIPSPSNRSSIM 32.2055720.899331.2043.91469.00138.1432.1089.00046 64.2077321.084531.4524.91501.00237.2263.2219.00072 128.2080621.087231.5174.91502.00312.3105.2948.00099 256.2103421.208231.9444.91523.00410.4287.3894.00139 512.2101421.196931.9005.91520.00411.4284.3896.00138 GLIMITATIONS PPSD does not release its official user split or episode generator, so this evaluation uses a deter- ministic split and sampling procedure. Validation users are excluded from gradient-based training but used for checkpoint selection, including selection of epoch 91 by CQS on the reported episode. These validation-set estimates may therefore be optimistic. Repeated episodes measure sensitivity to reference and query sampling. Independent-user generalization requires users excluded from model development and selection. Standard PrefLUT uses a global 3D LUT. Spatially varying retouching requires the additional spatial component used in the FiveK and PPR10K configurations (Appendix C.3). PPSD tests personalized conditioning. FiveK and PPR10K evaluate enhancement toward fixed expert targets. HEXTENDED QUALITATIVE EVALUATION Personalized Editing. Figure H1 compares methods on the same queries and reference sets, grouped by user. Preferred targets include both brighter and darker appearances, so the desired edit direction varies across examples. PrefLUT adjusts brightness and color toward these targets across animal, food, and outdoor scenes. The side-by-side outputs also show differences in saturation and preservation of scene detail. PCVP. Figure H2 holds the displayed input fixed and changes only the profile or query condition. The tunnel, food, and building examples show visible changes in brightness and color balance under the five controls. Correct conditioning more closely follows the paired preferred appearance. These comparisons connect the PCVP tests to visible editing behavior on individual queries. Profile Refinement. Figure H3 follows each query as feedback accumulates fromN = 4to24 pairs. Additional feedback refines brightness, saturation, and color balance toward the paired target while the scene layout is retained. The query and network weights stay fixed, so the changes result from updating the Reusable User Profile. Per-output CQS labels summarize the combined changes in fidelity and preference alignment alongside the visual results. 28 Preprint Personalized Editing Comparison | PPSD InputPreferredPieNetStarEnhancerPIE-MSMDiffRetouchUPEPerTouchUser-specific Decoder Exemplar-based Inference PrefLUT User 01 | wWFJvuQ 0.007 / 38.61 / 0.996 0.000 / ∞ / 1.000 0.060 / 20.78 / 0.912 0.009 / 35.74 / 0.991 0.149 / 14.01 / 0.799 0.123 / 15.53 / 0.837 0.038 / 25.21 / 0.971 0.210 / 15.10 / 0.668 0.018 / 35.91 / 0.982 0.134 / 19.84 / 0.889 0.006 / 38.39 / 0.996 0.024 / 29.13 / 0.991 0.000 / ∞ / 1.000 0.044 / 21.63 / 0.967 0.026 / 30.28 / 0.989 0.075 / 13.83 / 0.913 0.088 / 17.70 / 0.927 0.029 / 29.16 / 0.978 0.056 / 27.78 / 0.969 0.031 / 25.74 / 0.986 0.079 / 16.12 / 0.884 0.023 / 31.30 / 0.991 0.021 / 34.27 / 0.993 0.000 / ∞ / 1.000 0.034 / 23.99 / 0.972 0.017 / 34.97 / 0.993 0.107 / 14.77 / 0.913 0.103 / 16.61 / 0.861 0.021 / 34.21 / 0.993 0.109 / 20.18 / 0.903 0.028 / 29.61 / 0.986 0.055 / 19.49 / 0.951 0.018 / 35.47 / 0.994 0.075 / 19.98 / 0.891 0.000 / ∞ / 1.000 0.085 / 17.79 / 0.864 0.073 / 19.64 / 0.885 0.139 / 12.95 / 0.768 0.128 / 15.04 / 0.767 0.078 / 19.71 / 0.881 0.111 / 19.58 / 0.833 0.080 / 20.37 / 0.888 0.090 / 19.91 / 0.850 0.073 / 20.45 / 0.897 User 02 | xpXmqX7 0.105 / 18.61 / 0.938 0.000 / ∞ / 1.000 0.098 / 21.31 / 0.946 0.045 / 28.88 / 0.975 0.156 / 15.45 / 0.905 0.200 / 14.20 / 0.872 0.038 / 29.52 / 0.967 0.161 / 19.11 / 0.843 0.103 / 19.12 / 0.938 0.254 / 12.33 / 0.794 0.031 / 30.10 / 0.984 0.091 / 16.49 / 0.911 0.000 / ∞ / 1.000 0.037 / 26.15 / 0.976 0.060 / 23.98 / 0.957 0.061 / 22.28 / 0.958 0.131 / 19.55 / 0.885 0.055 / 27.96 / 0.950 0.142 / 17.46 / 0.837 0.089 / 17.01 / 0.915 0.236 / 10.23 / 0.708 0.017 / 27.25 / 0.985 0.043 / 27.99 / 0.982 0.000 / ∞ / 1.000 0.079 / 18.96 / 0.944 0.046 / 26.74 / 0.978 0.068 / 22.76 / 0.957 0.078 / 21.11 / 0.928 0.060 / 25.38 / 0.961 0.152 / 17.80 / 0.843 0.047 / 26.74 / 0.983 0.168 / 13.60 / 0.764 0.042 / 27.73 / 0.982 0.103 / 20.25 / 0.757 0.000 / ∞ / 1.000 0.140 / 19.50 / 0.726 0.100 / 20.70 / 0.770 0.236 / 15.52 / 0.606 0.397 / 12.92 / 0.470 0.104 / 20.24 / 0.756 0.504 / 7.10 / 0.270 0.102 / 19.48 / 0.729 0.230 / 21.93 / 0.561 0.099 / 20.69 / 0.773 User 03 | vBp6e0y 0.030 / 33.52 / 0.997 0.000 / ∞ / 1.000 0.095 / 21.56 / 0.965 0.033 / 32.27 / 0.995 0.148 / 14.68 / 0.943 0.094 / 22.50 / 0.966 0.031 / 33.29 / 0.993 0.209 / 14.82 / 0.902 0.024 / 33.07 / 0.996 0.294 / 12.26 / 0.816 0.020 / 34.48 / 0.996 0.108 / 19.62 / 0.900 0.000 / ∞ / 1.000 0.033 / 27.87 / 0.981 0.038 / 31.95 / 0.981 0.111 / 15.92 / 0.910 0.175 / 16.10 / 0.873 0.117 / 20.41 / 0.895 0.257 / 17.12 / 0.790 0.106 / 18.58 / 0.896 0.137 / 13.89 / 0.831 0.052 / 25.16 / 0.964 0.049 / 21.70 / 0.966 0.000 / ∞ / 1.000 0.049 / 21.70 / 0.966 0.052 / 21.96 / 0.961 0.192 / 14.07 / 0.871 0.107 / 20.05 / 0.886 0.049 / 21.69 / 0.966 0.235 / 18.93 / 0.827 0.044 / 23.49 / 0.967 0.116 / 15.86 / 0.857 0.039 / 23.18 / 0.971 0.032 / 18.88 / 0.969 0.000 / ∞ / 1.000 0.032 / 18.88 / 0.969 0.034 / 19.03 / 0.968 0.143 / 12.13 / 0.862 0.059 / 20.50 / 0.956 0.037 / 18.65 / 0.961 0.176 / 18.39 / 0.857 0.028 / 20.38 / 0.975 0.088 / 17.95 / 0.888 0.030 / 19.99 / 0.973 User 04 | CxHTVkM 0.005 / 40.95 / 0.997 0.000 / ∞ / 1.000 0.005 / 40.95 / 0.997 0.005 / 38.90 / 0.997 0.157 / 16.10 / 0.928 0.040 / 22.27 / 0.964 0.060 / 27.02 / 0.952 0.115 / 17.11 / 0.923 0.009 / 32.01 / 0.996 0.240 / 11.58 / 0.826 0.005 / 41.31 / 0.997 0.037 / 32.57 / 0.993 0.000 / ∞ / 1.000 0.083 / 27.96 / 0.953 0.033 / 33.35 / 0.993 0.093 / 16.20 / 0.907 0.054 / 22.47 / 0.962 0.040 / 32.38 / 0.990 0.328 / 11.08 / 0.677 0.046 / 32.80 / 0.993 0.042 / 28.25 / 0.983 0.033 / 34.21 / 0.994 0.034 / 32.02 / 0.973 0.000 / ∞ / 1.000 0.084 / 26.29 / 0.941 0.033 / 32.87 / 0.976 0.100 / 16.79 / 0.885 0.097 / 17.86 / 0.899 0.054 / 27.57 / 0.937 0.275 / 11.22 / 0.621 0.039 / 32.86 / 0.983 0.067 / 22.25 / 0.934 0.034 / 33.20 / 0.980 0.012 / 30.06 / 0.988 0.000 / ∞ / 1.000 0.012 / 30.07 / 0.988 0.013 / 30.21 / 0.989 0.092 / 17.91 / 0.858 0.160 / 14.77 / 0.754 0.012 / 30.04 / 0.987 0.347 / 8.23 / 0.491 0.017 / 26.68 / 0.966 0.164 / 15.80 / 0.820 0.011 / 30.73 / 0.986 User 05 | AR9UTIT 0.041 / 29.52 / 0.994 0.000 / ∞ / 1.000 0.063 / 28.41 / 0.963 0.038 / 30.41 / 0.993 0.129 / 16.29 / 0.919 0.051 / 24.95 / 0.971 0.046 / 29.12 / 0.978 0.171 / 11.68 / 0.833 0.056 / 30.02 / 0.994 0.117 / 13.01 / 0.842 0.032 / 30.79 / 0.995 0.010 / 37.79 / 0.992 0.000 / ∞ / 1.000 0.043 / 23.58 / 0.856 0.011 / 32.12 / 0.964 0.072 / 19.36 / 0.850 0.127 / 16.12 / 0.776 0.010 / 37.79 / 0.992 0.315 / 11.93 / 0.481 0.012 / 32.97 / 0.969 0.265 / 19.04 / 0.611 0.009 / 37.21 / 0.989 0.087 / 20.67 / 0.931 0.000 / ∞ / 1.000 0.047 / 26.77 / 0.930 0.040 / 30.81 / 0.943 0.104 / 16.63 / 0.826 0.156 / 14.30 / 0.797 0.095 / 22.25 / 0.923 0.255 / 14.66 / 0.669 0.083 / 21.22 / 0.906 0.084 / 20.46 / 0.942 0.042 / 28.89 / 0.974 0.125 / 17.93 / 0.907 0.000 / ∞ / 1.000 0.050 / 25.45 / 0.977 0.094 / 20.32 / 0.942 0.086 / 23.00 / 0.937 0.109 / 23.97 / 0.935 0.121 / 19.30 / 0.891 0.166 / 13.49 / 0.801 0.116 / 18.90 / 0.910 0.164 / 9.97 / 0.736 0.065 / 22.69 / 0.957 User 06 | hvmnJ4Z 0.026 / 25.20 / 0.980 0.000 / ∞ / 1.000 0.084 / 19.37 / 0.944 0.025 / 29.22 / 0.985 0.087 / 19.56 / 0.968 0.128 / 14.50 / 0.908 0.031 / 26.10 / 0.979 0.233 / 10.75 / 0.7820.034 / 25.22 / 0.981 0.070 / 18.39 / 0.922 0.020 / 28.97 / 0.991 0.075 / 25.36 / 0.946 0.000 / ∞ / 1.000 0.075 / 25.36 / 0.946 0.083 / 25.14 / 0.928 0.095 / 18.41 / 0.887 0.124 / 16.64 / 0.854 0.075 / 25.37 / 0.943 0.277 / 9.86 / 0.566 0.070 / 26.25 / 0.938 0.094 / 25.45 / 0.910 0.071 / 25.50 / 0.947 0.139 / 18.30 / 0.917 0.000 / ∞ / 1.000 0.082 / 23.48 / 0.952 0.039 / 27.27 / 0.964 0.147 / 17.36 / 0.912 0.215 / 14.49 / 0.844 0.082 / 24.22 / 0.950 0.299 / 14.23 / 0.771 0.147 / 18.48 / 0.915 0.234 / 13.82 / 0.824 0.048 / 26.47 / 0.970 0.122 / 21.10 / 0.882 0.000 / ∞ / 1.000 0.096 / 22.50 / 0.908 0.053 / 27.77 / 0.941 0.138 / 15.19 / 0.828 0.207 / 13.07 / 0.760 0.093 / 25.13 / 0.922 0.270 / 10.92 / 0.591 0.125 / 21.19 / 0.864 0.115 / 23.10 / 0.896 0.065 / 26.35 / 0.948 LPIPS / PSNR / SSIM Figure H1: Personalized editing comparisons on PPSD. Queries are grouped by user. Input and Preferred show the non-preferred query and its paired preferred target. All methods share queries and 16 reference pairs per user. Labels report direct LPIPS↓/PSNR↑/SSIM↑ against Preferred. 29 Preprint PCVP Verification | PPSD InputPreferredWrong userReversed orderMismatched pairsTraining meanWrong queryCorrect User 07 0.094 / 22.86 / 0.9100.000 / ∞ / 1.0000.063 / 25.47 / 0.9430.076 / 23.87 / 0.9270.054 / 26.70 / 0.9550.059 / 25.74 / 0.9460.060 / 25.73 / 0.9430.048 / 27.13 / 0.958 User 08 0.117 / 19.70 / 0.8670.000 / ∞ / 1.0000.066 / 25.21 / 0.9180.084 / 22.37 / 0.8920.061 / 26.15 / 0.9230.063 / 25.59 / 0.9190.114 / 19.94 / 0.8740.052 / 27.43 / 0.935 0.107 / 19.76 / 0.8910.000 / ∞ / 1.0000.078 / 21.88 / 0.9220.096 / 20.56 / 0.9040.073 / 22.52 / 0.9280.076 / 22.23 / 0.9240.091 / 20.74 / 0.9090.067 / 23.32 / 0.939 0.096 / 17.15 / 0.9240.000 / ∞ / 1.0000.046 / 21.79 / 0.9680.067 / 19.12 / 0.9490.042 / 23.02 / 0.9720.044 / 22.46 / 0.9700.094 / 17.46 / 0.9280.038 / 24.11 / 0.976 User 09 0.071 / 20.00 / 0.9000.000 / ∞ / 1.0000.025 / 27.09 / 0.9660.033 / 23.96 / 0.9540.023 / 26.51 / 0.9680.027 / 25.21 / 0.9610.041 / 22.72 / 0.9430.020 / 27.50 / 0.972 0.138 / 16.92 / 0.9070.000 / ∞ / 1.0000.075 / 22.50 / 0.9530.089 / 20.16 / 0.9450.075 / 21.95 / 0.9540.081 / 21.04 / 0.9490.079 / 21.97 / 0.9520.070 / 22.72 / 0.958 User 06 0.015 / 30.78 / 0.9810.000 / ∞ / 1.0000.015 / 28.40 / 0.9710.025 / 21.40 / 0.9420.014 / 30.27 / 0.9730.017 / 27.02 / 0.9650.032 / 24.73 / 0.9670.013 / 30.89 / 0.974 User 10 0.040 / 20.20 / 0.9470.000 / ∞ / 1.0000.039 / 20.07 / 0.9450.039 / 20.19 / 0.9460.038 / 20.27 / 0.9470.038 / 20.14 / 0.9460.042 / 19.33 / 0.9380.036 / 20.54 / 0.950 User 11 0.083 / 19.43 / 0.9450.000 / ∞ / 1.0000.077 / 20.00 / 0.9480.074 / 20.24 / 0.9500.075 / 20.16 / 0.9490.076 / 19.99 / 0.9480.098 / 18.49 / 0.9370.073 / 20.53 / 0.952 User 12 0.031 / 23.27 / 0.9720.000 / ∞ / 1.0000.031 / 25.00 / 0.9790.031 / 24.37 / 0.9760.034 / 24.93 / 0.9750.033 / 24.72 / 0.9750.038 / 24.60 / 0.9670.030 / 25.03 / 0.980 User 13 0.089 / 20.62 / 0.9250.000 / ∞ / 1.0000.049 / 23.70 / 0.9540.049 / 23.84 / 0.9550.060 / 22.28 / 0.9460.055 / 23.25 / 0.9490.084 / 20.49 / 0.9290.048 / 24.06 / 0.956 User 14 0.100 / 17.34 / 0.8530.000 / ∞ / 1.0000.103 / 17.54 / 0.8560.103 / 17.47 / 0.8540.103 / 17.64 / 0.8580.104 / 17.68 / 0.8580.110 / 17.69 / 0.8550.102 / 17.71 / 0.861 User 15 0.111 / 18.86 / 0.9050.000 / ∞ / 1.0000.025 / 28.12 / 0.9800.032 / 25.14 / 0.9740.024 / 28.09 / 0.9810.026 / 27.26 / 0.9800.115 / 18.64 / 0.9010.023 / 28.16 / 0.982 LPIPS / PSNR / SSIM Figure H2: PrefLUT PCVP examples on PPSD. Each row compares Correct conditioning with the five controls in Appendix D.1. Wrong query denotes the Cyclic Wrong-Query Control, which uses another query from the same user to predict the LUT and edit strength applied to the displayed input. Labels report direct LPIPS↓/PSNR↑/SSIM↑ against Preferred. 30 Preprint Profile Refinement | PPSD InputN = 4N = 8N = 12N = 16N = 24Preferred User 16 23.84 / 21.24 / 0.956328.94 / 22.82 / 0.961237.07 / 24.32 / 0.968543.26 / 24.75 / 0.974262.37 / 26.91 / 0.9836 User 17 39.21 / 23.72 / 0.979945.67 / 24.81 / 0.983250.88 / 25.14 / 0.984553.29 / 25.45 / 0.985257.12 / 25.78 / 0.9860 User 18 9.77 / 17.20 / 0.947111.39 / 17.53 / 0.949722.22 / 19.59 / 0.962729.03 / 21.27 / 0.969431.22 / 21.75 / 0.9710 User 05 14.89 / 24.62 / 0.944816.18 / 24.75 / 0.947924.22 / 26.30 / 0.963026.77 / 26.80 / 0.966728.40 / 27.64 / 0.9708 User 19 14.27 / 22.93 / 0.935334.35 / 27.10 / 0.964735.78 / 27.18 / 0.966038.32 / 27.73 / 0.968339.46 / 28.44 / 0.9703 User 04 11.82 / 23.80 / 0.929412.93 / 23.98 / 0.931416.33 / 24.79 / 0.933117.91 / 25.15 / 0.933624.20 / 26.38 / 0.9412 User 20 40.61 / 24.72 / 0.983346.29 / 25.94 / 0.986047.54 / 26.24 / 0.986648.70 / 26.57 / 0.987149.76 / 26.77 / 0.9874 User 21 18.26 / 19.01 / 0.962720.32 / 19.40 / 0.964821.34 / 19.70 / 0.965922.28 / 19.96 / 0.966927.13 / 21.14 / 0.9712 User 22 3.76 / 21.90 / 0.88915.75 / 23.29 / 0.910911.30 / 25.79 / 0.938812.05 / 26.06 / 0.941013.59 / 26.65 / 0.9468 User 23 10.10 / 24.70 / 0.948213.24 / 25.69 / 0.958422.40 / 28.27 / 0.975122.88 / 28.33 / 0.975728.05 / 29.68 / 0.9798 User 24 42.13 / 27.52 / 0.966744.76 / 28.11 / 0.969146.06 / 28.63 / 0.970846.47 / 28.75 / 0.971146.96 / 28.80 / 0.9716 User 13 17.40 / 23.31 / 0.944924.88 / 24.08 / 0.960125.14 / 24.25 / 0.960326.58 / 24.95 / 0.962730.36 / 25.59 / 0.9658 User 15 12.24 / 25.18 / 0.936019.53 / 28.05 / 0.957021.22 / 29.00 / 0.963521.34 / 29.08 / 0.964423.00 / 29.72 / 0.9680 User 06 17.62 / 22.74 / 0.950630.49 / 26.13 / 0.970030.50 / 26.30 / 0.970431.10 / 26.44 / 0.970831.83 / 26.61 / 0.9715 User 25 1.22 / 19.85 / 0.84241.53 / 20.43 / 0.85372.00 / 21.43 / 0.86852.23 / 21.93 / 0.87703.09 / 22.78 / 0.8931 User 03 8.62 / 19.08 / 0.950615.57 / 21.10 / 0.964316.00 / 21.37 / 0.965316.35 / 21.41 / 0.965717.31 / 21.78 / 0.9676 LPIPS-CQS / PSNR-CQS / SSIM-CQS Figure H3: PrefLUT profile refinement on PPSD. Each row fixes the query and network weights while the profile is rebuilt from the firstN = 4, 8, 12, 16, 24feedback pairs. Input is the non-preferred query, and Preferred is its paired target. Labels report per-outputLPIPS-CQS,PSNR-CQS, and SSIM-CQS(all↑). Per-output CQS compares each output with Preferred andInput (Appendix B.4). 31