← Search

Tieliang Gong

24 accepted papers

2026

Beyond Sharpness: A Flatness Decomposition Framework for Efficient Continual Learning

AAAI 2026technical

Continual Learning (CL) aims to enable models to sequentially learn multiple tasks without forgetting previous knowledge. Recent studies have shown that optimizing towards flatter loss minima can improve model generalization. However, existing sharpness-aware methods for CL suffer from two key limit

Cited by 0SourcePDFScholar
2026

Recovering Coherent Affective Patterns: Addressing Modality Missing in Multimodal Sentiment Analysis

AAAI 2026technical

Multimodal sentiment analysis (MSA) seeks to decode human emotions by integrating heterogeneous modalities. However, real-world scenarios often involve missing or misaligned data due to sensor failures or transmission errors, leading to disrupted temporal dynamics and degraded cross-modal correlatio

Cited by 0SourcePDFScholar
2025

Exactly Tight Information-theoretic Generalization Bounds via Binary Jensen-Shannon Divergence

ICML 2025poster

Information-theoretic bounds, while achieving significant success in analyzing the generalization of randomized learning algorithms, have been criticized for their slow convergence rates and overestimation. This paper presents novel bounds that bridge the expected empirical and population risks thro…

Cited by 0SourcePDFScholar
2025

InfoSAM: Fine-Tuning the Segment Anything Model from An Information-Theoretic Perspective

ICML 2025spotlight

The Segment Anything Model (SAM), a vision foundation model, exhibits impressive zero-shot capabilities in general tasks but struggles in specialized domains. Parameter-efficient fine-tuning (PEFT) is a promising approach to unleash the potential of SAM in novel scenarios. However, existing PEFT met…

2025

Rectified Diffusion Guidance for Conditional Generation

CVPR 2025poster

Classifier-Free Guidance (CFG), which combines the conditional and unconditional score functions with two coefficients summing to one, serves as a practical technique for diffusion model sampling. Theoretically, however, denoising with CFG cannot be expressed as a reciprocal diffusion process, which…

2025

SpotActor: Training-Free Layout-Controlled Consistent Image Generation

AAAI 2025technical

Text-to-image diffusion models significantly enhance the efficiency of artistic creation with high-fidelity image generation. However, in typical application scenarios like comic book production, they can neither place each subject into its expected spot nor maintain the consistent appearance of eac…

Cited by 2SourcePDFScholar
2025

Towards Generalization Bounds of GCNs for Adversarially Robust Node Classification

ICLR 2025poster

Adversarially robust generalization of Graph Convolutional Networks (GCNs) has garnered significant attention in various security-sensitive application areas, driven by intrinsic adversarial vulnerability. Albeit remarkable empirical advancement, theoretical understanding of the generalization behav…

Cited by 0SourcePDFScholar
2025

Trajectory-Dependent Generalization Bounds for Pairwise Learning with φ-mixing Samples

IJCAI 2025

Recently, the mathematical tool from fractal geometry (i.e., fractal dimension) has been employed to investigate optimization trajectory-dependent generalization ability for some pointwise learning models with independent and identically distributed (i.i.d.) observations. This paper goes beyond the

Cited by 0SourcePDFScholar
2024

Accelerating Non-Maximum Suppression: A Graph Theory Perspective

NeurIPS 2024poster

Non-maximum suppression (NMS) is an indispensable post-processing step in object detection. With the continuous optimization of network models, NMS has become the ``last mile'' to enhance the efficiency of object detection. This paper systematically analyzes NMS from a graph theory perspective for t…

2024

Fine-grained Analysis of Stability and Generalization for Stochastic Bilevel Optimization

IJCAI 2024poster

Stochastic bilevel optimization (SBO) has been integrated into many machine learning paradigms recently including hyperparameter optimization, meta learning, reinforcement learning, etc. Along with the wide range of applications, there have been abundant studies on concerning the computing behavi…

Cited by 1SourcePDFScholar
2024

OneActor: Consistent Subject Generation via Cluster-Conditioned Guidance

NeurIPS 2024poster

Text-to-image diffusion models benefit artists with high-quality image generation. Yet their stochastic nature hinders artists from creating consistent images of the same subject. Existing methods try to tackle this challenge and generate consistent content in various ways. However, they either depe…

2024

Rethinking Information-theoretic Generalization: Loss Entropy Induced PAC Bounds

ICLR 2024poster

Information-theoretic generalization analysis has achieved astonishing success in characterizing the generalization capabilities of noisy and iterative learning algorithms. However, current advancements are mostly restricted to average-case scenarios and necessitate the stringent bounded loss assump…

Cited by 2SourcePDFScholar
2024

Towards Generalization beyond Pointwise Learning: A Unified Information-theoretic Perspective

ICML 2024poster

The recent surge in contrastive learning has intensified the interest in understanding the generalization of non-pointwise learning paradigms. While information-theoretic analysis achieves remarkable success in characterizing the generalization behavior of learning algorithms, its applicability is l…

Cited by 3SourcePDFScholar
2024

Towards Sharper Generalization Bounds for Adversarial Contrastive Learning

IJCAI 2024poster

Recently, the enhancement on the adversarial robustness of machine learning algorithms has gained significant attention across various application domains. Given the widespread label scarcity issue in real-world data, adversarial contrastive learning (ACL) has been proposed to adversarially train ro…

Cited by 1SourcePDFScholar
2024

ViLa-MIL: Dual-scale Vision-Language Multiple Instance Learning for Whole Slide Image Classification

CVPR 2024poster

Multiple instance learning (MIL)-based framework has become the mainstream for processing the whole slide image (WSI) with giga-pixel size and hierarchical image context in digital pathology. However these methods heavily depend on a substantial number of bag-level labels and solely learn from the o…

2023

On the Stability and Generalization of Triplet Learning

AAAI 2023technical

Triplet learning, i.e. learning from triplet data, has attracted much attention in computer vision tasks with an extremely large number of categories, e.g., face recognition and person re-identification. Albeit with rapid progress in designing and applying triplet learning algorithms, there is a lac…

Cited by 5SourcePDFScholar
2023

PRAM: An End-to-end Prototype-based Representation Alignment Model for Zero-resource Cross-lingual Named Entity Recognition

ACL 2023findings

Zero-resource cross-lingual named entity recognition (ZRCL-NER) aims to leverage rich labeled source language data to address the NER problem in the zero-resource target language. Existing methods are built either based on data transfer or representation transfer. However, the former usually leads t…

2023

Robust and Fast Measure of Information via Low-Rank Representation

AAAI 2023technical

The matrix-based Rényi's entropy allows us to directly quantify information measures from given data, without explicit estimation of the underlying probability distribution. This intriguing property makes it widely applied in statistical inference and machine learning tasks. However, this informatio…

2023

Understanding the Generalization Ability of Deep Learning Algorithms: A Kernelized Rényi's Entropy Perspective

IJCAI 2023poster

Recently, information-theoretic analysis has become a popular framework for understanding the generalization behavior of deep neural networks. It allows a direct analysis for stochastic gradient / Langevin descent (SGD/SGLD) learning algorithms without strong assumptions such as Lipschitz or convexi…

2022

COPNER: Contrastive Learning with Prompt Guiding for Few-shot Named Entity Recognition

COLING 2022main

Distance metric learning has become a popular solution for few-shot Named Entity Recognition (NER). The typical setup aims to learn a similarity metric for measuring the semantic similarity between test samples and referents, where each referent represents an entity class. The effect of this setup m…

2022

Error-Based Knockoffs Inference for Controlled Feature Selection

AAAI 2022technical

Recently, the scheme of model-X knockoffs was proposed as a promising solution to address controlled feature selection under high-dimensional finite-sample settings. However, the procedure of model-X knockoffs depends heavily on the coefficient-based feature importance and only concerns the control…

Cited by 6SourcePDFScholar
2022

Regularized Modal Regression on Markov-Dependent Observations: A Theoretical Assessment

AAAI 2022technical

Modal regression, a widely used regression protocol, has been extensively investigated in statistical and machine learning communities due to its robustness to outlier and heavy-tailed noises. Understanding modal regression's theoretical behavior can be fundamental in learning theory. Despite signif…

Cited by 1SourcePDFScholar
2020

Multi-task Additive Models for Robust Estimation and Automatic Structure Discovery

NeurIPS 2020poster

Additive models have attracted much attention for high-dimensional regression estimation and variable selection. However, the existing models are usually limited to the single-task learning framework under the mean squared error (MSE) criterion, where the utilization of variable structure depends he…

Cited by 17SourcePDFScholar