← Search

Ngai Wong

40 accepted papers

2026

ATTS: Asynchronous Test-Time Scaling via Conformal Prediction

ICLR 2026poster

Large language models (LLMs) benefit from test-time scaling but are often hampered by high inference latency. Speculative decoding is a natural way to accelerate the scaling process; however, scaling along both the parallel and sequential dimensions poses significant challenges, including substantia…

Cited by 0SourcecodeScholar
2026

BPDQ: Bit-Plane Decomposition Quantization on a Variable Grid for Large Language Models

ICML 2026poster

Large language model (LLM) inference is often bounded by memory footprint and memory bandwidth in resource-constrained deployments, making quantization a fundamental technique for efficient serving. While post-training quantization (PTQ) maintains high fidelity at 4-bit, it deteriorates at 2–3 bits.…

Cited by 0SourceScholar
2026

Nonparametric Teaching of Attention Learners

ICLR 2026poster

Attention learners, neural networks built on the attention mechanism, e.g., transformers, excel at learning the implicit relationships that relate sequences to their corresponding properties, e.g., mapping a given sequence of tokens to the probability of the next token. However, the learning process…

Cited by 0SourcecodeScholar
2026

Residual Decoding: Mitigating Hallucinations in Large Vision-Language Models via History-Aware Residual Guidance

CVPR 2026

Large Vision-Language Models (LVLMs) can reason from image-text inputs and perform well in various multimodal tasks. Despite this success, they are affected by language priors and often produce hallucinations. Hallucinations denote generated content that is grammatically and syntactically coherent,

Cited by 0SourceScholar
2026

SWINGARENA: Adversarial Programming Arena for Long-context GitHub Issue Solving

ICLR 2026oral

We present \textsc{SwingArena}, a adversarial evaluation framework for Large Language Models (LLMs) that closely mirrors real-world software development workflows. Unlike traditional static benchmarks, \textsc{SwingArena} models the collaborative process of software iteration by pairing LLMs as \tex…

Cited by 0SourcecodeScholar
2026

UNOP: Physics-Constrained Unsupervised Neural Operator for Long-Horizon PDE Learning on Generalized Geometries

IJCAI 2026

Unsupervised learning of neural operators is constrained by numerical instability, causing predictions to diverge in long-horizon rollouts. To address this, we present a physics-constrained unsupervised neural operator for long-horizon PDE learning on generalized geometries (UNOP). This framework re

Cited by 0Scholar
2026

Unveiling Super Experts in Mixture-of-Experts Large Language Models

ICLR 2026poster

Leveraging the intrinsic importance differences among experts, recent research has explored expert-level compression techniques to enhance the efficiency of Mixture-of-Experts (MoE) large language models (LLMs). However, existing approaches often rely on empirical heuristics to identify critical exp…

Cited by 0SourcecodeScholar
2025

DnLUT: Ultra-Efficient Color Image Denoising via Channel-Aware Lookup Tables

CVPR 2025poster

While deep neural networks have revolutionized image denoising capabilities, their deployment on edge devices remains challenging due to substantial computational and memory requirements. To this end, we present DnLUT, an ultra-efficient lookup table-based framework that achieves high-quality color…

2025

Edge-free but Structure-aware: Prototype-Guided Knowledge Distillation from GNNs to MLPs

COLING 2025main

Distilling high-accuracy Graph Neural Networks (GNNs) to low-latency multilayer perceptrons (MLPs) on graph tasks has become a hot research topic. However, conventional MLP learning relies almost exclusively on graph nodes and fails to effectively capture the graph structural information. Previous m…

Cited by 8SourcePDFScholar
2025

Enhancing Robustness of Implicit Neural Representations Against Weight Perturbations

ICASSP 2025accepted

Implicit Neural Representations (INRs) encode discrete signals in a continuous manner using neural networks, demonstrating significant value across various multimedia applications. However, the vulnerability of INRs presents a critical challenge for their real-world deployments, as the network weigh…

Cited by 0SourceScholar
2025

GuiLoMo: Allocating Experts and Ranks for LoRA-MoE via Bilevel Optimization with GuidedSelection Vectors

EMNLP 2025

Parameter-efficient fine-tuning (PEFT) methods, particularly Low-Rank Adaptation (LoRA), offer an efficient way to adapt large language models with reduced computational costs. However, their performance is limited by the small number of trainable parameters. Recent work combines LoRA with the Mixtu

2025

Hybrid Mesh-Gaussian Representation for Efficient Indoor Scene Reconstruction

IJCAI 2025

3D Gaussian splatting (3DGS) has demonstrated exceptional performance in image-based 3D reconstruction and real-time rendering. However, regions with complex textures require numerous Gaussians to capture significant color variations accurately, leading to inefficiencies in rendering speed. To addre

Cited by 0SourcePDFScholar
2025

KG-RAG: Enhancing GUI Agent Decision-Making via Knowledge Graph-Driven Retrieval-Augmented Generation

EMNLP 2025

Despite recent progress, Graphic User Interface (GUI) agents powered by Large Language Models (LLMs) struggle with complex mobile tasks due to limited app-specific knowledge. While UI Transition Graphs (UTGs) offer structured navigation representations, they are underutilized due to poor extraction

Cited by 0SourcePDFScholar
2025

MINR: Efficient Implicit Neural Representations for Multi-Image Encoding

ICASSP 2025accepted

Implicit Neural Representations (INRs) aim to parameterize discrete signals through implicit continuous functions. However, formulating each image with a separate neural network (typically, a Multi-Layer Perceptron (MLP)) leads to computational and storage inefficiencies when encoding multi-images.…

Cited by 0SourceScholar
2025

Nonparametric Teaching for Graph Property Learners

ICML 2025spotlight

Inferring properties of graph-structured data, *e.g.*, the solubility of molecules, essentially involves learning the implicit mapping from graphs to their properties. This learning process is often costly for graph property learners like Graph Convolutional Networks (GCNs). To address this, we prop…

2025

ParallelComp: Parallel Long-Context Compressor for Length Extrapolation

ICML 2025poster

Extrapolating ultra-long contexts (text length >128K) remains a major challenge for large language models (LLMs), as most training-free extrapolation methods are not only severely limited by memory bottlenecks, but also suffer from the attention sink, which restricts their scalability and effectiven…

2025

Perspective-aware 3D Gaussian Inpainting with Multi-view Consistency

ICCV 2025poster

3D Gaussian inpainting, a critical technique for numerous applications in virtual reality and multimedia, has made significant progress with pretrained diffusion models. However, ensuring multi-view consistency, an essential requirement for high-quality inpainting, remains a key challenge. In this w…

2025

QuZO: Quantized Zeroth-Order Fine-Tuning for Large Language Models

EMNLP 2025

Large Language Models (LLMs) are often quantized to lower precision to reduce the memory cost and latency in inference. However, quantization often degrades model performance, thus fine-tuning is required for various downstream tasks. Traditional fine-tuning methods such as stochastic gradient desce

Cited by 0SourcePDFScholar
2025

Rethinking Kullback-Leibler Divergence in Knowledge Distillation for Large Language Models

COLING 2025main

Kullback-Leiber divergence has been widely used in Knowledge Distillation (KD) to compress Large Language Models (LLMs). Contrary to prior assertions that reverse Kullback-Leibler (RKL) divergence is mode-seeking and thus preferable over the mean-seeking forward Kullback-Leibler (FKL) divergence, th…

2025

TreeReview: A Dynamic Tree of Questions Framework for Deep and Efficient LLM-based Scientific Peer Review

EMNLP 2025

While Large Language Models (LLMs) have shown significant potential in assisting peer review, current methods often struggle to generate thorough and insightful reviews while maintaining efficiency. In this paper, we propose TreeReview, a novel framework that models paper review as a hierarchical an

2025

UNComp: Can Matrix Entropy Uncover Sparsity? — A Compressor Design from an Uncertainty-Aware Perspective

EMNLP 2025

Deploying large language models (LLMs) for long-context inference remains challenging due to their substantial memory and computational demands. While techniques such as Key-Value (KV) cache compression are designed to reduce memory usage, they often neglect the structured sparsity inherent in the r

2024

ASMR: Activation-Sharing Multi-Resolution Coordinate Networks for Efficient Inference

ICLR 2024poster

Coordinate network or implicit neural representation (INR) is a fast-emerging method for encoding natural signals (such as images and videos) with the benefits of a compact neural representation. While numerous methods have been proposed to increase the encoding capabilities of an INR, an often over…

2024

Hundred-Kilobyte Lookup Tables for Efficient Single-Image Super-Resolution

IJCAI 2024poster

Conventional super-resolution (SR) schemes make heavy use of convolutional neural networks (CNNs), which involve intensive multiply-accumulate (MAC) operations, and require specialized hardware such as graphics processing units. This contradicts the regime of edge AI that often runs on devices strai…

2024

Hybrid Module with Multiple Receptive Fields and Self-Attention Layers for Medical Image Segmentation

ICASSP 2024accepted

Recent advances in medical image segmentation models combine convolution with the attention mechanism which provides an effective approach to formulate long-term dependencies. However, many works either replaced the convolutional layers with attention layers or embedded attention layers into convolu…

Cited by 0SourceScholar
2024

Learning Spatially Collaged Fourier Bases for Implicit Neural Representation

AAAI 2024technical

Existing approaches to Implicit Neural Representation (INR) can be interpreted as a global scene representation via a linear combination of Fourier bases of different frequencies. However, such universal basis functions can limit the representation capability in local regions where a specific compon…

Cited by 5SourcePDFScholar
2024

LoRETTA: Low-Rank Economic Tensor-Train Adaptation for Ultra-Low-Parameter Fine-Tuning of Large Language Models

NAACL 2024long

Various parameter-efficient fine-tuning (PEFT) techniques have been proposed to enable computationally efficient fine-tuning while maintaining model performance. However, existing PEFT methods are still limited by the growing number of trainable parameters with the rapid deployment of Large Language…

2024

Nonparametric Teaching of Implicit Neural Representations

ICML 2024poster

We investigate the learning of implicit neural representation (INR) using an overparameterized multilayer perceptron (MLP) via a novel nonparametric teaching perspective. The latter offers an efficient example selection framework for teaching nonparametrically defined (viz. non-closed-form) target f…

2024

Scaling Laws with Vocabulary: Larger Models Deserve Larger Vocabularies

NeurIPS 2024poster

Research on scaling large language models (LLMs) has primarily focused on model parameters and training data size, overlooking the role of vocabulary size. We investigate how vocabulary size impacts LLM scaling laws by training models ranging from 33M to 3B parameters on up to 500B characters with v…

2024

Taming Lookup Tables for Efficient Image Retouching

ECCV 2024poster

"The widespread use of high-definition screens in edge devices, such as end-user cameras, smartphones, and televisions, is spurring a significant demand for image enhancement. Existing enhancement models often optimize for high performance while falling short of reducing hardware inference time and…

2024

Weight-Inherited Distillation for Task-Agnostic BERT Compression

NAACL 2024findings

Knowledge Distillation (KD) is a predominant approach for BERT compression.Previous KD-based methods focus on designing extra alignment losses for the student model to mimic the behavior of the teacher model.These methods transfer the knowledge in an indirect way.In this paper, we propose a novel We…

2023

Context-Aware Transformer for 3D Point Cloud Automatic Annotation

AAAI 2023technical

3D automatic annotation has received increased attention since manually annotating 3D point clouds is laborious. However, existing methods are usually complicated, e.g., pipelined training for 3D foreground/background segmentation, cylindrical object proposals, and point completion. Furthermore, the…

Cited by 5SourcePDFScholar
2023

Gradually Excavating External Knowledge for Implicit Complex Question Answering

EMNLP 2023long findings

Recently, large language models (LLMs) have gained much attention for the emergence of human-comparable capabilities and huge potential. However, for open-domain implicit question-answering problems, LLMs may not be the ultimate solution due to the reasons of: 1) uncovered or out-of-date domain know…

Cited by 0SourceScholar
2023

Structured Pruning for Efficient Generative Pre-trained Language Models

ACL 2023findings

The increasing sizes of large generative Pre-trained Language Models (PLMs) hinder their deploymentin real-world applications. To obtain efficient PLMs, previous studies mostly focus on pruning the attention heads and feed-forward networks (FFNs) of the Transformer. Nevertheless, we find that in gen…

2022

Compression of Generative Pre-trained Language Models via Quantization

ACL 2022long

The increasing size of generative Pre-trained Language Models (PLMs) have greatly increased the demand for model compression. Despite various methods to compress BERT or its variants, there are few attempts to compress generative PLMs, and the underlying difficulty remains unclear. In this paper, we…

Cited by 101SourcePDFScholar
2022

Multimodal Transformer for Automatic 3D Annotation and Object Detection

ECCV 2022poster

"Despite a growing number of datasets being collected for training 3D object detection models, significant human effort is still required to annotate 3D boxes on LiDAR scans. To automate the annotation and facilitate the production of various customized datasets, we propose an end-to-end multimodal…

2021

Deformable Butterfly: A Highly Structured and Sparse Linear Transform

NeurIPS 2021poster

We introduce a new kind of linear transform named Deformable Butterfly (DeBut) that generalizes the conventional butterfly matrices and can be adapted to various input-output dimensions. It inherits the fine-to-coarse-grained learnable hierarchy of traditional butterflies and when deployed to neural…

2019

POPQORN: Quantifying Robustness of Recurrent Neural Networks

ICML 2019oral

The vulnerability to adversarial attacks has been a critical issue for deep neural networks. Addressing this issue requires a reliable way to evaluate the robustness of a network. Recently, several methods have been developed to compute robustness quantification for neural networks, namely, certifie…