Papers
Topics
Authors
Recent
Search
2000 character limit reached

ID-Aligner: Identity-Preserving T2I Framework

Updated 6 July 2026
  • ID-Aligner is a framework for identity-preserving text-to-image generation that uses dual reward feedback to fine-tune either LoRA or adapter weights on frozen diffusion models.
  • It combines an identity consistency reward from face detection and recognition with an identity aesthetic reward based on human preferences and structure feedback.
  • The approach achieves improved face similarity, faster convergence, and enhanced visual fidelity compared to existing fine-tuning methods on models like Stable Diffusion v1.5 and SDXL.

ID-Aligner is a general feedback learning framework for identity-preserving text-to-image generation (ID-T2I). It is designed to enhance identity preservation, improve aesthetic quality, and remain compatible with both LoRA-based and Adapter-based methods on pretrained diffusion backbones such as Stable Diffusion v1.5 and SDXL. The framework combines identity consistency reward fine-tuning with identity aesthetic reward fine-tuning, using feedback from face detection and recognition models, human-annotated preference data, and automatically constructed feedback on character structure generation (Chen et al., 2024).

1. Problem setting and target capabilities

Identity-preserving text-to-image generation seeks to synthesize a novel image of a specific person or character given a few reference portraits together with a guiding text prompt. The reported application scenarios include AI portrait design, digital advertising, and virtual try-on. Within this setting, ID-Aligner addresses three stated challenges: accurate identity retention, aesthetic quality, and method compatibility across adaptation paradigms (Chen et al., 2024).

The first challenge is that standard MSE losses do not explicitly enforce that the generated face matches the reference face. The second is that strict identity constraints can produce rigid or distorted limbs, odd poses, and low appeal. The third is that prior methods are typically tailored either to LoRA fine-tuning or to adapter insertion, but not both. In the experimental framing, the relevant comparison set includes LoRA-based few-shot tuning and adapter-style systems such as IP-Adapter, InstantID, PhotoMaker, and FastComposer (Chen et al., 2024).

In this context, ID-Aligner is positioned not as a new diffusion backbone, but as a fine-tuning layer placed on top of a frozen, pretrained text-to-image diffusion model. This design choice is central to its scope: the objective is to steer generation with reward signals while preserving the generative prior of the underlying backbone.

2. Architectural design and model integration

The architecture consists of two main components: a family of reward models and a lightweight fine-tuning loop that adjusts either LoRA matrices or adapter weights in the U-Net, and optionally the text encoder. The backbone itself remains frozen. The cited backbones are Stable Diffusion v1.5 and SDXL (Chen et al., 2024).

For adapter-based integration, the reported setup takes a pretrained adapter model, such as IP-Adapter-FaceID, plugged into each cross-attention layer of the diffusion U-Net. During feedback fine-tuning, the U-Net and text encoder are kept frozen, and only the adapter weights are updated. The training loop uses a “partial denoise then reward” procedure: random noise is sampled, denoising proceeds without gradient down to a random step, then one denoising pass is performed with gradient, the predicted latent is decoded to an image, and that image is scored by the reward models (Chen et al., 2024).

For LoRA-based integration, low-rank adaptation matrices A,BA,B are attached to a subset of weight layers in the U-Net and optionally the text encoder. Only these LoRA parameters are trainable. In this regime, ID-Aligner combines the standard denoising MSE loss with reward-based objectives, so diffusion learning and reward steering are optimized jointly (Chen et al., 2024).

A common misconception is to treat ID-Aligner as specific to a single adaptation mechanism. The reported formulation is explicitly universal across both LoRA and adapter paradigms. A second misconception is to treat it as a fully reinforcement-learning-based training recipe; the described optimization is gradient-based fine-tuning driven by scalar rewards computed from generated images.

3. Reward formulation and optimization objectives

The identity consistency reward is defined through a face detector and a face-recognition encoder. Given a reference image x0refx^{\rm ref}_0 and a generated image x^0\hat x_0, face regions are cropped and encoded as

eref=Eface(FaceDet(x0ref)),egen=Eface(FaceDet(x^0)).e_{\rm ref} = E_{\rm face}\bigl(\mathrm{FaceDet}(x^{\rm ref}_0)\bigr), \qquad e_{\rm gen} = E_{\rm face}\bigl(\mathrm{FaceDet}(\hat x_0)\bigr).

The reward is the cosine similarity

Rid_sim(x^0,x0ref)=cos ⁣(egen,eref)[1,1],R_{\rm id\_sim}(\hat x_0,x^{\rm ref}_0) = \cos\!\bigl(e_{\rm gen},e_{\rm ref}\bigr)\in[-1,1],

and the corresponding loss is

Lid_sim=Ec,x^0[1Rid_sim(x^0,x0ref)].\mathcal L_{\rm id\_sim} = \mathbb E_{c,\hat x_0}\bigl[1 - R_{\rm id\_sim}(\hat x_0, x^{\rm ref}_0)\bigr].

This term directly addresses the problem that denoising losses alone do not explicitly enforce face matching (Chen et al., 2024).

The identity aesthetic reward has two sub-rewards. The first is a human-preference appeal reward RappealR_{\rm appeal}, learned from a dataset of (prompt,imagei,imagej)(\text{prompt}, \text{image}_i, \text{image}_j) triples with human preference labels using a pairwise logistic loss:

Lpref=E(c,xi,xj)Dlog ⁣(σ(fθ(xi,c)fθ(xj,c))).\mathcal L_{\rm pref} = -\,\mathbb E_{(c,x_i,x_j)\sim\mathcal D} \log\!\Bigl(\sigma\bigl(f_\theta(x_i,c)-f_\theta(x_j,c)\bigr)\Bigr).

The second is a structure reward RstructR_{\rm struct}, trained on positive versus negative pairs in which negative samples are automatically synthesized distorted human images generated by twisting ground-truth poses with ControlNet. At inference, the aesthetic reward is

x0refx^{\rm ref}_00

with loss

x0refx^{\rm ref}_01

The overall objectives differ by integration mode. Adapter fine-tuning uses only the reward losses,

x0refx^{\rm ref}_02

whereas LoRA fine-tuning adds denoising MSE,

x0refx^{\rm ref}_03

The reported experimental hyperparameters are x0refx^{\rm ref}_04 and x0refx^{\rm ref}_05 (Chen et al., 2024).

4. Training procedure and implementation details

The adapter training loop proceeds by sampling x0refx^{\rm ref}_06, choosing a random timestep x0refx^{\rm ref}_07, denoising from x0refx^{\rm ref}_08 down to x0refx^{\rm ref}_09 without gradient, performing one denoising step with gradient to obtain x^0\hat x_00, decoding x^0\hat x_01 to x^0\hat x_02, computing x^0\hat x_03 and x^0\hat x_04, and updating the adapter weights. The LoRA version follows the same reward loop but also backpropagates the denoising MSE term (Chen et al., 2024).

The reported training data comprise approximately x^0\hat x_05 face images mined from LAION and filtered by MTCNN, cropped to x^0\hat x_06 for SD1.5 or x^0\hat x_07 for SDXL. Prompts are drawn and filtered from JourneyDB to ensure human-oriented captions such as “the girl...” and “the man...”. Adapter training uses batch size x^0\hat x_08, learning rate x^0\hat x_09, eref=Eface(FaceDet(x0ref)),egen=Eface(FaceDet(x^0)).e_{\rm ref} = E_{\rm face}\bigl(\mathrm{FaceDet}(x^{\rm ref}_0)\bigr), \qquad e_{\rm gen} = E_{\rm face}\bigl(\mathrm{FaceDet}(\hat x_0)\bigr).0 iterations, and guidance-scale eref=Eface(FaceDet(x0ref)),egen=Eface(FaceDet(x^0)).e_{\rm ref} = E_{\rm face}\bigl(\mathrm{FaceDet}(x^{\rm ref}_0)\bigr), \qquad e_{\rm gen} = E_{\rm face}\bigl(\mathrm{FaceDet}(\hat x_0)\bigr).1 during feedback. LoRA training uses eref=Eface(FaceDet(x0ref)),egen=Eface(FaceDet(x^0)).e_{\rm ref} = E_{\rm face}\bigl(\mathrm{FaceDet}(x^{\rm ref}_0)\bigr), \qquad e_{\rm gen} = E_{\rm face}\bigl(\mathrm{FaceDet}(\hat x_0)\bigr).2 reference images per identity, bucket adaptive resolution, batch size eref=Eface(FaceDet(x0ref)),egen=Eface(FaceDet(x^0)).e_{\rm ref} = E_{\rm face}\bigl(\mathrm{FaceDet}(x^{\rm ref}_0)\bigr), \qquad e_{\rm gen} = E_{\rm face}\bigl(\mathrm{FaceDet}(\hat x_0)\bigr).3, learning rate eref=Eface(FaceDet(x0ref)),egen=Eface(FaceDet(x^0)).e_{\rm ref} = E_{\rm face}\bigl(\mathrm{FaceDet}(x^{\rm ref}_0)\bigr), \qquad e_{\rm gen} = E_{\rm face}\bigl(\mathrm{FaceDet}(\hat x_0)\bigr).4 for U-Net LoRA and eref=Eface(FaceDet(x0ref)),egen=Eface(FaceDet(x^0)).e_{\rm ref} = E_{\rm face}\bigl(\mathrm{FaceDet}(x^{\rm ref}_0)\bigr), \qquad e_{\rm gen} = E_{\rm face}\bigl(\mathrm{FaceDet}(\hat x_0)\bigr).5 for text encoder LoRA, for eref=Eface(FaceDet(x0ref)),egen=Eface(FaceDet(x^0)).e_{\rm ref} = E_{\rm face}\bigl(\mathrm{FaceDet}(x^{\rm ref}_0)\bigr), \qquad e_{\rm gen} = E_{\rm face}\bigl(\mathrm{FaceDet}(\hat x_0)\bigr).6 iterations (Chen et al., 2024).

The human-preference reward is initialized from an ImageReward checkpoint and fine-tuned on a custom pairwise dataset. The structure reward is trained on synthetic distorted-versus-natural pose pairs. Inference uses a DDIM sampler with eref=Eface(FaceDet(x0ref)),egen=Eface(FaceDet(x^0)).e_{\rm ref} = E_{\rm face}\bigl(\mathrm{FaceDet}(x^{\rm ref}_0)\bigr), \qquad e_{\rm gen} = E_{\rm face}\bigl(\mathrm{FaceDet}(\hat x_0)\bigr).7 steps, guidance-scale eref=Eface(FaceDet(x0ref)),egen=Eface(FaceDet(x^0)).e_{\rm ref} = E_{\rm face}\bigl(\mathrm{FaceDet}(x^{\rm ref}_0)\bigr), \qquad e_{\rm gen} = E_{\rm face}\bigl(\mathrm{FaceDet}(\hat x_0)\bigr).8, and adapter fusion eref=Eface(FaceDet(x0ref)),egen=Eface(FaceDet(x^0)).e_{\rm ref} = E_{\rm face}\bigl(\mathrm{FaceDet}(x^{\rm ref}_0)\bigr), \qquad e_{\rm gen} = E_{\rm face}\bigl(\mathrm{FaceDet}(\hat x_0)\bigr).9 (Chen et al., 2024).

These implementation details indicate that the framework is intended as a practical extension to existing pipelines rather than a replacement for them. A plausible implication is that its computational footprint is governed largely by the chosen adaptation mechanism and reward evaluation pipeline rather than by a new generator architecture.

5. Quantitative results, ablations, and generalization

The reported evaluation metrics are Face Similarity, DINO score, CLIP-I, CLIP-T, and LAION-Aesthetics. On SD1.5 in the adapter setting, ID-Aligner is reported to outperform FastComposer and IP-Adapter on several metrics: Face Similarity Rid_sim(x^0,x0ref)=cos ⁣(egen,eref)[1,1],R_{\rm id\_sim}(\hat x_0,x^{\rm ref}_0) = \cos\!\bigl(e_{\rm gen},e_{\rm ref}\bigr)\in[-1,1],0 versus Rid_sim(x^0,x0ref)=cos ⁣(egen,eref)[1,1],R_{\rm id\_sim}(\hat x_0,x^{\rm ref}_0) = \cos\!\bigl(e_{\rm gen},e_{\rm ref}\bigr)\in[-1,1],1 for IP-Adapter and Rid_sim(x^0,x0ref)=cos ⁣(egen,eref)[1,1],R_{\rm id\_sim}(\hat x_0,x^{\rm ref}_0) = \cos\!\bigl(e_{\rm gen},e_{\rm ref}\bigr)\in[-1,1],2 for FastComposer; DINO Rid_sim(x^0,x0ref)=cos ⁣(egen,eref)[1,1],R_{\rm id\_sim}(\hat x_0,x^{\rm ref}_0) = \cos\!\bigl(e_{\rm gen},e_{\rm ref}\bigr)\in[-1,1],3 versus Rid_sim(x^0,x0ref)=cos ⁣(egen,eref)[1,1],R_{\rm id\_sim}(\hat x_0,x^{\rm ref}_0) = \cos\!\bigl(e_{\rm gen},e_{\rm ref}\bigr)\in[-1,1],4 and Rid_sim(x^0,x0ref)=cos ⁣(egen,eref)[1,1],R_{\rm id\_sim}(\hat x_0,x^{\rm ref}_0) = \cos\!\bigl(e_{\rm gen},e_{\rm ref}\bigr)\in[-1,1],5; CLIP-I Rid_sim(x^0,x0ref)=cos ⁣(egen,eref)[1,1],R_{\rm id\_sim}(\hat x_0,x^{\rm ref}_0) = \cos\!\bigl(e_{\rm gen},e_{\rm ref}\bigr)\in[-1,1],6 versus Rid_sim(x^0,x0ref)=cos ⁣(egen,eref)[1,1],R_{\rm id\_sim}(\hat x_0,x^{\rm ref}_0) = \cos\!\bigl(e_{\rm gen},e_{\rm ref}\bigr)\in[-1,1],7 and Rid_sim(x^0,x0ref)=cos ⁣(egen,eref)[1,1],R_{\rm id\_sim}(\hat x_0,x^{\rm ref}_0) = \cos\!\bigl(e_{\rm gen},e_{\rm ref}\bigr)\in[-1,1],8; and LAION-Aesthetics Rid_sim(x^0,x0ref)=cos ⁣(egen,eref)[1,1],R_{\rm id\_sim}(\hat x_0,x^{\rm ref}_0) = \cos\!\bigl(e_{\rm gen},e_{\rm ref}\bigr)\in[-1,1],9 versus Lid_sim=Ec,x^0[1Rid_sim(x^0,x0ref)].\mathcal L_{\rm id\_sim} = \mathbb E_{c,\hat x_0}\bigl[1 - R_{\rm id\_sim}(\hat x_0, x^{\rm ref}_0)\bigr].0 and Lid_sim=Ec,x^0[1Rid_sim(x^0,x0ref)].\mathcal L_{\rm id\_sim} = \mathbb E_{c,\hat x_0}\bigl[1 - R_{\rm id\_sim}(\hat x_0, x^{\rm ref}_0)\bigr].1. The reported CLIP-T is slightly lower, Lid_sim=Ec,x^0[1Rid_sim(x^0,x0ref)].\mathcal L_{\rm id\_sim} = \mathbb E_{c,\hat x_0}\bigl[1 - R_{\rm id\_sim}(\hat x_0, x^{\rm ref}_0)\bigr].2 versus Lid_sim=Ec,x^0[1Rid_sim(x^0,x0ref)].\mathcal L_{\rm id\_sim} = \mathbb E_{c,\hat x_0}\bigl[1 - R_{\rm id\_sim}(\hat x_0, x^{\rm ref}_0)\bigr].3, which the source attributes to stronger identity focus (Chen et al., 2024).

On SDXL in the adapter setting, the reported comparisons include IP-Adapter, InstantID, and PhotoMaker. ID-Aligner obtains Face Similarity Lid_sim=Ec,x^0[1Rid_sim(x^0,x0ref)].\mathcal L_{\rm id\_sim} = \mathbb E_{c,\hat x_0}\bigl[1 - R_{\rm id\_sim}(\hat x_0, x^{\rm ref}_0)\bigr].4, compared with Lid_sim=Ec,x^0[1Rid_sim(x^0,x0ref)].\mathcal L_{\rm id\_sim} = \mathbb E_{c,\hat x_0}\bigl[1 - R_{\rm id\_sim}(\hat x_0, x^{\rm ref}_0)\bigr].5 for IP-Adapter, Lid_sim=Ec,x^0[1Rid_sim(x^0,x0ref)].\mathcal L_{\rm id\_sim} = \mathbb E_{c,\hat x_0}\bigl[1 - R_{\rm id\_sim}(\hat x_0, x^{\rm ref}_0)\bigr].6 for InstantID, and Lid_sim=Ec,x^0[1Rid_sim(x^0,x0ref)].\mathcal L_{\rm id\_sim} = \mathbb E_{c,\hat x_0}\bigl[1 - R_{\rm id\_sim}(\hat x_0, x^{\rm ref}_0)\bigr].7 for PhotoMaker. The corresponding DINO scores are Lid_sim=Ec,x^0[1Rid_sim(x^0,x0ref)].\mathcal L_{\rm id\_sim} = \mathbb E_{c,\hat x_0}\bigl[1 - R_{\rm id\_sim}(\hat x_0, x^{\rm ref}_0)\bigr].8, Lid_sim=Ec,x^0[1Rid_sim(x^0,x0ref)].\mathcal L_{\rm id\_sim} = \mathbb E_{c,\hat x_0}\bigl[1 - R_{\rm id\_sim}(\hat x_0, x^{\rm ref}_0)\bigr].9, RappealR_{\rm appeal}0, and RappealR_{\rm appeal}1; CLIP-I scores are RappealR_{\rm appeal}2, RappealR_{\rm appeal}3, RappealR_{\rm appeal}4, and RappealR_{\rm appeal}5; LAION-Aesthetics scores are RappealR_{\rm appeal}6, RappealR_{\rm appeal}7, RappealR_{\rm appeal}8, and RappealR_{\rm appeal}9; and CLIP-T scores are (prompt,imagei,imagej)(\text{prompt}, \text{image}_i, \text{image}_j)0, (prompt,imagei,imagej)(\text{prompt}, \text{image}_i, \text{image}_j)1, (prompt,imagei,imagej)(\text{prompt}, \text{image}_i, \text{image}_j)2, and (prompt,imagei,imagej)(\text{prompt}, \text{image}_i, \text{image}_j)3. Qualitatively, the reported summary states that ID-Aligner images show better facial fidelity than FastComposer and IP-Adapter, fewer limb distortions than InstantID, and more aesthetic appeal than PhotoMaker (Chen et al., 2024).

For LoRA training on SDXL, incorporating reward into training is reported to improve face similarity and aesthetic appeal over standard LoRA. Convergence is also reported as faster: to reach a target face-similarity score, ID-Aligner requires significantly fewer iterations, especially on the heavier SDXL backbone. In the generalization study, applying the method to DreamShaper yields Face Similarity (prompt,imagei,imagej)(\text{prompt}, \text{image}_i, \text{image}_j)4, DINO (prompt,imagei,imagej)(\text{prompt}, \text{image}_i, \text{image}_j)5, and CLIP-I (prompt,imagei,imagej)(\text{prompt}, \text{image}_i, \text{image}_j)6; applying it to RealVisXL yields Face Similarity (prompt,imagei,imagej)(\text{prompt}, \text{image}_i, \text{image}_j)7, DINO (prompt,imagei,imagej)(\text{prompt}, \text{image}_i, \text{image}_j)8, and CLIP-I (prompt,imagei,imagej)(\text{prompt}, \text{image}_i, \text{image}_j)9 (Chen et al., 2024).

The user study comprises Lpref=E(c,xi,xj)Dlog ⁣(σ(fθ(xi,c)fθ(xj,c))).\mathcal L_{\rm pref} = -\,\mathbb E_{(c,x_i,x_j)\sim\mathcal D} \log\!\Bigl(\sigma\bigl(f_\theta(x_i,c)-f_\theta(x_j,c)\bigr)\Bigr).0 votes over Lpref=E(c,xi,xj)Dlog ⁣(σ(fθ(xi,c)fθ(xj,c))).\mathcal L_{\rm pref} = -\,\mathbb E_{(c,x_i,x_j)\sim\mathcal D} \log\!\Bigl(\sigma\bigl(f_\theta(x_i,c)-f_\theta(x_j,c)\bigr)\Bigr).1 users on text fidelity, image quality, and face similarity. InstantID is reported as highest for face similarity, while ID-Aligner is second. ID-Aligner achieves the top scores in image quality and second-best in text fidelity, which the source presents as a balanced trade-off (Chen et al., 2024).

The ablation study separates the two reward families. Using identity consistency reward only produces a large jump in face similarity, but some structural defects remain, such as distorted hands. Adding identity aesthetic reward fixes structural artifacts, including natural limbs, and further improves LAION-Aesthetics. The reported interpretation is that the two reward terms bring orthogonal benefits: one for pure identity alignment and the other for visual plausibility (Chen et al., 2024).

6. Limitations, future directions, and terminological scope

The reported limitations are specific. Gains can be marginal if the underlying model is already extremely robust at identity preservation. Over-emphasis on face matching can slightly harm text-prompt adherence, and the stated mitigation is to adjust Lpref=E(c,xi,xj)Dlog ⁣(σ(fθ(xi,c)fθ(xj,c))).\mathcal L_{\rm pref} = -\,\mathbb E_{(c,x_i,x_j)\sim\mathcal D} \log\!\Bigl(\sigma\bigl(f_\theta(x_i,c)-f_\theta(x_j,c)\bigr)\Bigr).2 and Lpref=E(c,xi,xj)Dlog ⁣(σ(fθ(xi,c)fθ(xj,c))).\mathcal L_{\rm pref} = -\,\mathbb E_{(c,x_i,x_j)\sim\mathcal D} \log\!\Bigl(\sigma\bigl(f_\theta(x_i,c)-f_\theta(x_j,c)\bigr)\Bigr).3. The work also notes inherent biases in face recognition systems and diffusion training data, which may lead to unequal performance across demographics (Chen et al., 2024).

The future directions listed in the source are to extend the reward pool with additional specialist critics such as age, expression, and lighting consistency; to incorporate multi-identity “mixing” rewards for blending two or more reference faces; and to collect broader, more balanced human-preference data to reduce demographic bias (Chen et al., 2024).

The term “ID-Aligner” also appears in other recent technical contexts, and this makes scope important. In “ID-Patch: Robust ID Association for Group Photo Personalization,” the consolidated description refers to an “ID-Aligner” approach in which a tiny RGB “ID patch” is injected into the ControlNet input to lock spatial position and high-dimensional ID embeddings are injected through cross-attention to ensure per-face detail; the reported results include ID CosSim Lpref=E(c,xi,xj)Dlog ⁣(σ(fθ(xi,c)fθ(xj,c))).\mathcal L_{\rm pref} = -\,\mathbb E_{(c,x_i,x_j)\sim\mathcal D} \log\!\Bigl(\sigma\bigl(f_\theta(x_i,c)-f_\theta(x_j,c)\bigr)\Bigr).4, association Lpref=E(c,xi,xj)Dlog ⁣(σ(fθ(xi,c)fθ(xj,c))).\mathcal L_{\rm pref} = -\,\mathbb E_{(c,x_i,x_j)\sim\mathcal D} \log\!\Bigl(\sigma\bigl(f_\theta(x_i,c)-f_\theta(x_j,c)\bigr)\Bigr).5, text alignment approximately Lpref=E(c,xi,xj)Dlog ⁣(σ(fθ(xi,c)fθ(xj,c))).\mathcal L_{\rm pref} = -\,\mathbb E_{(c,x_i,x_j)\sim\mathcal D} \log\!\Bigl(\sigma\bigl(f_\theta(x_i,c)-f_\theta(x_j,c)\bigr)\Bigr).6, and generation time approximately Lpref=E(c,xi,xj)Dlog ⁣(σ(fθ(xi,c)fθ(xj,c))).\mathcal L_{\rm pref} = -\,\mathbb E_{(c,x_i,x_j)\sim\mathcal D} \log\!\Bigl(\sigma\bigl(f_\theta(x_i,c)-f_\theta(x_j,c)\bigr)\Bigr).7 seconds per image (Zhang et al., 2024). In “Object Aligner: A Configurable JSON Schema Similarity Score for Graphs, Applied to LLM Prompt Optimization,” “ID-Aligner” denotes a referential-alignment procedure for JSON objects with identifiers and references, approximated by Lpref=E(c,xi,xj)Dlog ⁣(σ(fθ(xi,c)fθ(xj,c))).\mathcal L_{\rm pref} = -\,\mathbb E_{(c,x_i,x_j)\sim\mathcal D} \log\!\Bigl(\sigma\bigl(f_\theta(x_i,c)-f_\theta(x_j,c)\bigr)\Bigr).8-dimensional Weisfeiler–Leman color refinement plus Hungarian matching, with overall complexity Lpref=E(c,xi,xj)Dlog ⁣(σ(fθ(xi,c)fθ(xj,c))).\mathcal L_{\rm pref} = -\,\mathbb E_{(c,x_i,x_j)\sim\mathcal D} \log\!\Bigl(\sigma\bigl(f_\theta(x_i,c)-f_\theta(x_j,c)\bigr)\Bigr).9 (Drchal, 2 Jul 2026). A closely named but distinct method, “ID-Align: RoPE-Conscious Position Remapping for Dynamic High-Resolution Adaptation in Vision-LLMs,” addresses RoPE long-term decay in VLMs by reordering position IDs so that high-resolution tokens inherit the IDs of corresponding thumbnail tokens; in the reported LLaVA-Next setting, this yields a RstructR_{\rm struct}0 enhancement on MMBench relation reasoning and an average gain of RstructR_{\rm struct}1 across ten benchmarks (Li et al., 27 May 2025).

Within identity-preserving text-to-image generation specifically, however, ID-Aligner refers to the reward-feedback framework of identity consistency and identity aesthetic fine-tuning on top of LoRA or adapter updates. That usage is the one established by the 2024 diffusion-model work (Chen et al., 2024).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to ID-Aligner.