arXiv subjects

Kai Gan

Publications and source records attributed to Kai Gan.

7 recordsLinked to original sources

arXiv2026

SHED: Style-Homogenized Embedding Alignment for Domain Generalization

Domain generalization aims to enhance model robustness against unseen domains with embedding distribution shifts. While large-scale vision-language models like CLIP exhibit strong generalization, their direct image-text embedding alignment suffers from inherent information asymmetry: images encode both class semantics and domain-specific styles, whereas text prompts primarily convey basic class cues. This asymmetry hinders generalization to novel domains in realistic scenarios. To address this, we propose Style-Homogenized Embedding alignment for Domain-generalization (SHED), a novel CLIP-based method that aligns style-homogenized embeddings instead of raw representations from encoders in CLIP. During training, SHED removes domain-specific style centroids from both image embeddings computed per source domains and text embeddings which are averaged across diverse prompt templates and stripped of a global centroid. For inference, considering the lack of target domain information, SHED projects diverse textual domain centroids into the visual space and aggregates predictions via membership weighting. Extensive experiments on five benchmarks show SHED achieves state-of-the-art performance, outperforming prior methods significantly (e.g., +4.0\% on DomainNet vs. standard fine-tuning).

cs.CV↗

arXiv2026

Sparsity Hurts: Simple Linear Adapter Can Boost Generalized Category Discovery

Generalized Category Discovery (GCD) seeks to identify novel categories from unlabeled data while retaining the classification ability of seen categories. Prior GCD methods commonly leverage transferable representations from pre-trained models, adapting to downstream datasets via partial fine-tuning (updating only the final ViT block) and visual prompt tuning (appending learnable vectors to inputs). However, conventional partial fine-tuning offers limited flexibility, as it fails to adapt the entire model; meanwhile, visual prompt tuning is prone to overfitting, due to its sensitivity to initialization and inherently constrained capacity. To address these limitations, we propose LAGCD, a simple yet effective GCD approach that embeds a residual linear adapter into each ViT block. From the perspective of feature sparsity, we systematically show that non-linearity in conventional adapters impairs performance, whereas our linear adapter enhances it by enabling more flexible model capacity. We further introduce an auxiliary distribution alignment loss to mitigate the negative impact of biased predictions between seen and novel categories. Extensive experiments on both generic and fine-grained datasets confirm that LAGCD consistently improves performance over many sophisticated baselines. The source code is available at https://github.com/yebo0216best/LAGCD

cs.CV↗

arXiv2026

LLaDA2.0-Uni: Unifying Multimodal Understanding and Generation with Diffusion Large Language Model

We present LLaDA2.0-Uni, a unified discrete diffusion large language model (dLLM) that supports multimodal understanding and generation within a natively integrated framework. Its architecture combines a fully semantic discrete tokenizer, a MoE-based dLLM backbone, and a diffusion decoder. By discretizing continuous visual inputs via SigLIP-VQ, the model enables block-level masked diffusion for both text and vision inputs within the backbone, while the decoder reconstructs visual tokens into high-fidelity images. Inference efficiency is enhanced beyond parallel decoding through prefix-aware optimizations in the backbone and few-step distillation in the decoder. Supported by carefully curated large-scale data and a tailored multi-stage training pipeline, LLaDA2.0-Uni matches specialized VLMs in multimodal understanding while delivering strong performance in image generation and editing. Its native support for interleaved generation and reasoning establishes a promising and scalable paradigm for next-generation unified foundation models. Codes and models are available at https://github.com/inclusionAI/LLaDA2.0-Uni.

cs.CV↗

arXiv2026

Moir\'e and frustration physics of dipolar supersolids under periodic confinement

We study the ground-state phases of a two-dimensional dipolar supersolid subjected to external periodic confinement by numerically solving the extended Gross--Pitaevskii equation. Focusing on a regime in which the unconfined system forms an intrinsic triangular droplet crystal, we consider triangular, honeycomb, and square optical lattices and classify them into isostructural and heterostructural settings relative to the spontaneous supersolid order. We map out the stationary states as functions of the lattice depth $V_0$ and the commensurability ratio between the intrinsic droplet spacing and the external lattice period. For triangular and honeycomb confinements, the competition between the soft self-organized supersolid lattice and the rigid external potential can generate long-wavelength moir\'e superstructures in the weak- to intermediate-lattice regime, together with a sequence of reconstructed states including ring-like clusters and stripe-segment configurations. By contrast, the square lattice introduces strong symmetry mismatch between the intrinsic $C_6$ order and the imposed $C_4$ geometry, leading to frustration-induced anisotropic states and symmetry-reduced cluster arrangements. Our results establish dipolar supersolids under periodic confinement as an unconventional route to exploring moir\'e physics, where moir\'e superstructures arise from the competition between a self-organized soft lattice and an externally imposed rigid one.

cond-mat.quant-gas↗

arXiv2024

Decouple then Converge: Handling Unknown Unlabeled Distributions in Long-Tailed Semi-Supervised Learning

While long-tailed semi-supervised learning (LTSSL) has attracted growing attention in many real-world classification tasks, existing LTSSL algorithms typically assume that labeled and unlabeled data share nearly identical class distributions. When this assumption is violated, these methods can perform poorly because they rely on biased model-generated pseudo-labels. To address this issue, we propose a simple yet effective approach called DeCon for LTSSL with unknown unlabeled class distributions. Specifically, DeCon decouples learning into two specialized branches: a standard branch that focuses on head classes and a balanced branch that focuses on tail classes. During training, the two branches interact and gradually converge, allowing them to complement each other and ultimately achieve strong performance across all classes. Despite its simplicity, we show that DeCon achieves state-of-the-art performance on a variety of standard LTSSL benchmarks, e.g., an averaged 2.7\% absolute increase in test accuracy against existing algorithms when the class distributions of labeled and unlabeled data are mismatched. Even when the class distributions are identical, DeCon consistently outperforms many sophisticated LTSSL algorithms. Furthermore, we conduct extensive ablation analyses to tease apart the factors that are the most important to the success of DeCon. The source code is available at \url{https://github.com/Gank0078/DeCon}.

cs.LG↗

arXiv2024

Erasing the Bias: Fine-Tuning Foundation Models for Semi-Supervised Learning

Semi-supervised learning (SSL) has witnessed remarkable progress, resulting in the emergence of numerous method variations. However, practitioners often encounter challenges when attempting to deploy these methods due to their subpar performance. In this paper, we present a novel SSL approach named FineSSL that significantly addresses this limitation by adapting pre-trained foundation models. We identify the aggregated biases and cognitive deviation problems inherent in foundation models, and propose a simple yet effective solution by imposing balanced margin softmax and decoupled label smoothing. Through extensive experiments, we demonstrate that FineSSL sets a new state of the art for SSL on multiple benchmark datasets, reduces the training cost by over six times, and can seamlessly integrate various fine-tuning and modern SSL algorithms. The source code is available at https://github.com/Gank0078/FineSSL.

cs.LG↗

arXiv2024

Bridging the Gap: Learning Pace Synchronization for Open-World Semi-Supervised Learning

In open-world semi-supervised learning, a machine learning model is tasked with uncovering novel categories from unlabeled data while maintaining performance on seen categories from labeled data. The central challenge is the substantial learning gap between seen and novel categories, as the model learns the former faster due to accurate supervisory information. Moreover, capturing the semantics of unlabeled novel category samples is also challenging due to the missing label information. To address the above issues, we introduce 1) the adaptive synchronizing marginal loss which imposes class-specific negative margins to alleviate the model bias towards seen classes, and 2) the pseudo-label contrastive clustering which exploits pseudo-labels predicted by the model to group unlabeled data from the same category together in the output space. Extensive experiments on benchmark datasets demonstrate that previous approaches may significantly hinder novel class learning, whereas our method strikingly balances the learning pace between seen and novel classes, achieving a remarkable 3% average accuracy increase on the ImageNet dataset. Importantly, we find that fine-tuning the self-supervised pre-trained model significantly boosts the performance, which is overlooked in prior literature. Our code is available at https://github.com/yebo0216best/LPS-main.

cs.LG↗