← Search

The-Anh Ta

8 accepted papers

2026

Pruning at Initialisation through the lens of Graphon Limit: Convergence, Expressivity, and Generalisation

ICML 2026poster

Pruning at Initialisation methods discover sparse, trainable subnetworks before training, but their theoretical mechanisms remain elusive. Existing analyses are often limited to finite-width statistics, lacking a rigorous characterisation of the global sparsity patterns that emerge as networks grow …

Cited by 0SourceScholar
2025

The Graphon Limit Hypothesis: Understanding Neural Network Pruning via Infinite Width Analysis

NeurIPS 2025spotlight

Sparse neural networks promise efficiency, yet training them effectively remains a fundamental challenge. Despite advances in pruning methods that create sparse architectures, understanding why some sparse structures are better trainable than others with the same level of sparsity remains poorly und…

Cited by 0SourceScholar
2025

Wicked Oddities: Selectively Poisoning for Effective Clean-Label Backdoor Attacks

ICLR 2025poster

Deep neural networks are vulnerable to backdoor attacks, a type of adversarial attack that poisons the training data to manipulate the behavior of models trained on such data. Clean-label backdoor is a more stealthy form of backdoor attacks that can perform the attack without changing the labels of…

Cited by 2SourcePDFScholar
2024

Flatness-aware Sequential Learning Generates Resilient Backdoors

ECCV 2024oral

"Recently, backdoor attacks have become an emerging threat to the security of machine learning models. From the adversary’s perspective, the implanted backdoors should be resistant to defensive algorithms, but some recently proposed fine-tuning defenses can remove these backdoors with notable effica…

2024

Learning the Expected Core of Strictly Convex Stochastic Cooperative Games

NeurIPS 2024poster

Reward allocation, also known as the credit assignment problem, has been an important topic in economics, engineering, and machine learning. An important concept in reward allocation is the core, which is the set of stable allocations where no agent has the motivation to deviate from the grand coali…

2024

Symmetric Linear Bandits with Hidden Symmetry

NeurIPS 2024poster

High-dimensional linear bandits with low-dimensional structure have received considerable attention in recent studies due to their practical significance. The most common structure in the literature is sparsity. However, it may not be available in practice. Symmetry, where the reward is invariant un…

2023

Towards Data-Agnostic Pruning At Initialization: What Makes a Good Sparse Mask?

NeurIPS 2023poster

Pruning at initialization (PaI) aims to remove weights of neural networks before training in pursuit of training efficiency besides the inference. While off-the-shelf PaI methods manage to find trainable subnetworks that outperform random pruning, their performance in terms of both accuracy and com…

2022

Class Similarity Weighted Knowledge Distillation for Continual Semantic Segmentation

CVPR 2022poster

Deep learning models are known to suffer from the problem of catastrophic forgetting when they incrementally learn new classes. Continual learning for semantic segmentation (CSS) is an emerging field in computer vision. We identify a problem in CSS: A model tends to be confused between old and new c…

Cited by 65PDFScholar