← Search

Hoang Pham

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
2026

Retrospective Feature Estimation for Continual Learning

ICML 2026poster

The intrinsic capability to continuously learn a changing data stream is a desideratum of deep neural networks (DNNs). However, current DNNs suffer from catastrophic forgetting, which interferes with remembering past knowledge. To mitigate this issue, existing Continual Learning (CL) approaches ofte…

Cited by 0SourcecodeScholar
2025

ClaimPKG: Enhancing Claim Verification via Pseudo-Subgraph Generation with Lightweight Specialized LLM

ACL 2025finding

Integrating knowledge graphs (KGs) to enhance the reasoning capabilities of large language models (LLMs) is an emerging research challenge in claim verification. While KGs provide structured, semantically rich representations well-suited for reasoning, most existing verification methods rely on unst…

2025

DPaI: Differentiable Pruning at Initialization with Node-Path Balance Principle

ICLR 2025poster

Pruning at Initialization (PaI) is a technique in neural network optimization characterized by the proactive elimination of weights before the network's training on designated tasks. This innovative strategy potentially reduces the costs for training and inference, significantly advancing computatio…

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

Verify-in-the-Graph: Entity Disambiguation Enhancement for Complex Claim Verification with Interactive Graph Representation

NAACL 2025long

Claim verification is a long-standing and challenging task that demands not only high accuracy but also explainability and thoroughness of the verification process. This task becomes an emerging research issue in the era of large language models (LLMs) since real-world claims are often complex, feat…

2024

Safety-Guaranteed Distributed Formation Control of Multi-Robot Systems Over Graphs With Rigid and Elastic Edges

RA-L 2024

This letter considers the problem of formation control of multi-robot systems represented by a graph featuring both rigid and elastic edges, capturing specified range tolerance to the desired inter-robot distances. The objective is to navigate the robots safely through unknown environments with obst

Cited by 7SourceScholar
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…