Contrastive-Augmented Flow Matching for Style-Content Disentanglement

• URL: http://arxiv.org/abs/2607.12404v1
• Date: Tue, 14 Jul 2026 06:23:52 GMT
• Title: Contrastive-Augmented Flow Matching for Style-Content Disentanglement
• Abstract summary: Contrastive Augmented Flow Matching (CAtFM) is a framework that integrates contrastive regularization into an invertible flow matching formulation to promote structured content-style representations.<n>Our experiments operate in the CLIP embedding space, with additional validation using frozen DINO and ALIGN encoders.<n>Overall, CAtFM provides a simple way to couple discriminative constraints with deterministic transport, improving disentanglement and robustness under distribution shift.
• Score: 26.08049457095161
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Learning representations that separate content and style is crucial for controllable generation and compositional generalization. However, diffusion and flow-based models trained primarily with generative objectives often produce entangled or misaligned factors. To address this gap, we introduce Contrastive Augmented Flow Matching (CAtFM), a framework that integrates contrastive regularization into an invertible flow matching formulation to promote structured content-style representations. Rather than constraining intermediate latents or velocity fields, we apply contrastive supervision to predicted endpoints during training, enforcing semantic consistency across transported distributions while allowing disentanglement to emerge implicitly, without assuming strictly pure or fully factorized content and style representations. Our main experiments operate in the CLIP embedding space, with additional validation using frozen DINO and ALIGN encoders. Across synthetic data, in-domain styles, and real-world benchmarks (ImageNet, WikiArt, DomainNet, and DTD), CAtFM improves content and style retrieval, enhances embedding cluster separation, and achieves stronger open-set robustness compared to generative and discriminative baselines. Overall, CAtFM provides a simple way to couple discriminative constraints with deterministic transport, improving disentanglement and robustness under distribution shift.

Related papers

• Context-weighted Discrete Flow Matching [13.385997589934645]
  We propose a simple modification to the underlying continuous-time Markov chain (CTMC) that incorporates local context information.<n>Our context-weighted sampler improves generation quality with negligible computational overhead.<n>Our scaled cross-entropy loss function reweights the training signal from different tokens and reduces generative perplexity by up to 63% on OpenWebText.
  arXiv  Detail & Related papers  (2026-07-23T15:29:49Z)
• Simplifying Flow Matching Transformations with Low-Rank Mixture Models [58.797704398690165]
  We propose using mixtures of probabilistic principal component analyzers (MPPCA) as the latent density for normalizing flows.<n>We simplify the learned flow transformation by learning a latent distribution that more closely aligns with the data distribution in terms of KL divergence.<n>MPPCA models can be fit quickly and cheaply using the expectation-maximization algorithm, making them a practical choice for initializing latent distributions even in high-dimensional generative tasks.
  arXiv  Detail & Related papers  (2026-06-29T03:03:06Z)
• PG-MAP: Joint MAP Optimization for Inference-Time Alignment of Diffusion and Flow-Matching Models [0.8594140167290097]
  Inference-time alignment of pretrained text-to-image models is typically performed along a single control axis.<n>We propose PG-MAP, a training-free framework that formulates inference-time alignment as a trajectory-level Gibbs-MAP / proximal energy optimization.
  arXiv  Detail & Related papers  (2026-06-22T07:36:36Z)
• Hierarchical Consistency Learning for Test-time Adaptation in Camouflage Perception [50.278200968044665]
  Camouflaged object detection (COD) aims to localize targets that exhibit minimal perceptual differences from backgrounds through physical attributes.<n>Existing methods, constrained by the static train-then-freeze paradigm, suffer from domain rigidity and dependency annotation.<n>We propose the hierarchical consistency learning framework, which integrates test-time adaptation for dynamic representation recalibration.
  arXiv  Detail & Related papers  (2026-05-25T09:57:46Z)
• MoASE++: Mixture of Activation Sparsity Experts with Domain-Adaptive On-policy Distillation for Continual Test Time Adaptation [65.068801413044]
  Continual test-time adaptation adapts a source-pretrained model to non-stationary, unlabeled target streams.<n>We introduce MoASE, a mixture-of-experts that disentangles domain-agnostic structure from domain-specific texture.
  arXiv  Detail & Related papers  (2026-05-18T01:52:12Z)
• Structured Coupling for Flow Matching [16.361601016656707]
  We propose a cooperative framework that augments flow matching with structured latent representation learning.<n>By introducing structured latent variables and noise into the source, SCFM jointly learns a structured prior and a continuous transport map.<n>It uses a shared time-dependent recognition network for both latent variable model variational inference and intermediate-time flow velocity estimation.
  arXiv  Detail & Related papers  (2026-05-08T12:47:37Z)
• Weight-Informed Self-Explaining Clustering for Mixed-Type Tabular Data [63.62853416081748]
  WISE is a framework that unifies representation, feature weighting, clustering, and interpretation.<n>It produces faithful, human-interpretable explanations grounded in the same primitives that drive clustering.
  arXiv  Detail & Related papers  (2026-04-07T13:18:31Z)
• Enhancing Gradient Inversion Attacks in Federated Learning via Hierarchical Feature Optimization [56.95448807869383]
  Federated Learning (FL) has emerged as a compelling paradigm for privacy-preserving distributed machine learning.<n>Recent studies find that the gradients exchanged in the FL system are also vulnerable to privacy leakage.<n>We propose textbfGradient textbfInversion over textbfFeature textbfDomains (GIFD)
  arXiv  Detail & Related papers  (2026-04-01T14:32:15Z)
• Active Flow Matching [14.437387789022354]
  Active Flow Matching (AFM) reformulates variational objectives to operate on conditional endpoint distributions along the flow.<n>We derive forward and reverse Kullback-Leibler (KL) variants using self-normalised importance sampling.
  arXiv  Detail & Related papers  (2026-03-01T02:50:07Z)
• Federated Contrastive Learning for Personalized Semantic Communication [55.46383524190467]
  We design a federated contrastive learning framework aimed at supporting personalized semantic communication. FedCL enables collaborative training of local semantic encoders across multiple clients and a global semantic decoder owned by the base station. To tackle the semantic imbalance issue arising from heterogeneous datasets across distributed clients, we employ contrastive learning to train a semantic centroid generator.
  arXiv  Detail & Related papers  (2024-06-13T14:45:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.