← Search

Na Li

56 accepted papers

2026

Adaptive Diffusion-based Augmentation for Recommendation

AAAI 2026technical

Recommendation systems often rely on implicit feedback, where only positive user-item interactions can be observed. Negative sampling is therefore crucial to provide proper negative training signals. However, existing methods tend to mislabel potentially positive but unobserved items as negatives an

Cited by 1SourcePDFScholar
2026

Are First-Order Diffusion Samplers Really Slower? A Fast Forward-Value Approach

ICML 2026poster

Higher-order ODE solvers have become a standard tool for accelerating diffusion probabilistic model (DPM) sampling, motivating the widespread view that first-order methods are inherently slower and that increasing discretization order is the primary path to faster generation. This paper challenges t…

Cited by 1SourceScholar
2026

Enhancing Stability and Fidelity for Zero-Shot TTS with a Multi-Level Evaluator

AAAI 2026technical

Recent advances in zero-shot text-to-speech (TTS), driven by language models, diffusion models and masked generation, have achieved impressive naturalness in speech synthesis. Nevertheless, stability and fidelity remain key challenges, manifesting as mispronunciations, audible noise, and quality deg

Cited by 0SourcePDFScholar
2026

R1-Code-Interpreter: LLMs Reason with Code via Supervised and Multi-stage Reinforcement Learning

ICLR 2026poster

Practical guidance on training Large Language Models (LLMs) to leverage Code Interpreter across diverse tasks remains lacking. We present R1-Code-Interpreter, an extension of a text-only LLM trained via multi-turn supervised fine-tuning (SFT) and reinforcement learning (RL) to autonomously generate…

Cited by 0SourceScholar
2026

Reinforcement Learning with Discrete Diffusion Policies for Combinatorial Action Spaces

ICML 2026poster

Reinforcement learning (RL) struggles to scale to large, combinatorial action spaces common in many real-world problems. This paper introduces a novel framework for training discrete diffusion models as highly effective policies in these complex settings. Our key innovation is an efficient online tr…

Cited by 0SourceScholar
2026

SHAP-Guided Kernel Actor-Critic for Explainable Reinforcement Learning

ICML 2026poster

Actor-critic (AC) methods are a cornerstone of reinforcement learning (RL) but offer limited interpretability. Current explainable RL methods seldom use *state attributions* to assist training. Rather, they treat all state features equally, thereby neglecting the heterogeneous impacts of individual …

Cited by 0SourceScholar
2026

TUMIX: Multi-Agent Test-Time Scaling with Tool-Use Mixture

ICLR 2026poster

While integrating tools like Code Interpreter and Search has significantly enhanced Large Language Model (LLM) reasoning in models like ChatGPT Agent and Gemini-Pro, practical guidance on optimal tool use is lacking. The core challenge is effectively combining textual reasoning, coding, and search f…

Cited by 0SourceScholar
2025

Advancing Fairness in Precision Medicine: A Universal Framework for Optimal Treatment Estimation in Censored Data

AISTATS 2025poster

In healthcare and precision medicine, estimating optimal treatment regimes for right-censored data while ensuring fairness across ethnic subgroups is crucial but remains underexplored. The problem presents two key challenges: measuring heterogeneous treatment effects (HTE) under fairness constraints…

Cited by 0SourceScholar
2025

Constrained Optimization From a Control Perspective via Feedback Linearization

NeurIPS 2025poster

Tools from control and dynamical systems have proven valuable for analyzing and developing optimization methods. In this paper, we establish rigorous theoretical foundations for using feedback linearization—a well-established nonlinear control technique—to solve constrained optimization problems. Fo…

Cited by 0SourceScholar
2025

Frequency Domain Information Integrated Network for Low-Light Image Enhancement

ICASSP 2025accepted

Low-light images often suffer from significant noise and detail loss, making it challenging to effectively distinguish signals from noise when processed directly in the spatial domain. To this end, we introduce frequency domain information to better distinguish high-frequency details from low-freque…

Cited by 0SourceScholar
2025

Offline Imitation Learning upon Arbitrary Demonstrations by Pre-Training Dynamics Representations

IROS 2025

Limited data has become a major bottleneck in scaling up offline imitation learning (IL). In this paper, we propose enhancing IL performance under limited expert data by introducing a pre-training stage that learns dynamics representations, derived from factorizations of the transition dynamics. We

Cited by 4SourceScholar
2025

RODS: Robust Optimization Inspired Diffusion Sampling for Detecting and Reducing Hallucination in Generative Models

NeurIPS 2025poster

Diffusion models have achieved state-of-the-art performance in generative modeling, yet their sampling procedures remain vulnerable to hallucinations—often stemming from inaccuracies in score approximation. In this work, we reinterpret diffusion sampling through the lens of optimization and introduc…

Cited by 0SourcecodeScholar
2025

Sample-Efficient Tabular Self-Play for Offline Robust Reinforcement Learning

NeurIPS 2025poster

Multi-agent reinforcement learning (MARL), as a thriving field, explores how multiple agents independently make decisions in a shared dynamic environment. Due to environmental uncertainties, policies in MARL must remain robust to tackle the sim-to-real gap. We focus on robust two-player zero-sum Mar…

Cited by 0SourceScholar
2025

Scalable spectral representations for multiagent reinforcement learning in network MDPs

AISTATS 2025poster

Network Markov Decision Processes (MDPs), which are the de-facto model for multi-agent control, pose a significant challenge to efficient learning caused by the exponential growth of the global state-action space with the number of agents. In this work, utilizing the exponential decay property of ne…

Cited by 0SourceScholar
2024

CONTOR: Benchmarking Strategies for Completing Ontologies with Plausible Missing Rules

EMNLP 2024finding

We consider the problem of finding plausible rules that are missing from a given ontology. A number of strategies for this problem have already been considered in the literature. Little is known about the relative performance of these strategies, however, as they have thus far been evaluated on diff…

2024

Enhancing Preference-based Linear Bandits via Human Response Time

NeurIPS 2024oral

Interactive preference learning systems infer human preferences by presenting queries as pairs of options and collecting binary choices. Although binary choices are simple and widely used, they provide limited information about preference strength. To address this, we leverage human response times,…

2024

Learning Low-dimensional Latent Dynamics from High-dimensional Observations: Non-asymptotics and Lower Bounds

ICML 2024poster

In this paper, we focus on learning a linear time-invariant (LTI) model with low-dimensional latent variables but high-dimensional observations. We provide an algorithm that recovers the high-dimensional features, i.e. column space of the observer, embeds the data into low dimensions and learns the…

Cited by 2SourcePDFScholar
2024

Modelling Commonsense Commonalities with Multi-Facet Concept Embeddings

ACL 2024findings

Concept embeddings offer a practical and efficient mechanism for injecting commonsense knowledge into downstream tasks. Their core purpose is often not to predict the commonsense properties of concepts themselves, but rather to identify commonalities, i.e. sets of concepts which share some property…

2024

Provable Memory Efficient Self-Play Algorithm for Model-free Reinforcement Learning

ICLR 2024poster

The thriving field of multi-agent reinforcement learning (MARL) studies how a group of interacting agents make decisions autonomously in a shared dynamic environment. Existing theoretical studies in this area suffer from at least two of the following obstacles: memory inefficiency, the heavy depende…

Cited by 1SourcePDFScholar
2024

Skill Transfer and Discovery for Sim-to-Real Learning: A Representation-Based Viewpoint

IROS 2024poster

We study sim-to-real skill transfer and discovery in the context of robotics control using representation learning. We draw inspiration from spectral decomposition of Markov decision processes. The spectral decomposition brings about representation that can linearly represent the state-action value…

Cited by 2SourceScholar
2024

Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity

ICLR 2024poster

Robust Markov Decision Processes (MDPs) and risk-sensitive MDPs are both powerful tools for making decisions in the presence of uncertainties. Previous efforts have aimed to establish their connections, revealing equivalences in specific formulations. This paper introduces a new formulation for risk…

2023

Escaping saddle points in zeroth-order optimization: the power of two-point estimators

ICML 2023poster

Two-point zeroth order methods are important in many applications of zeroth-order optimization arising in robotics, wind farms, power systems, online optimization, and adversarial robustness to black-box attacks in deep neural networks, where the problem can be high-dimensional and/or time-varying.…

2023

FedDAR: Federated Domain-Aware Representation Learning

ICLR 2023poster

Cross-silo Federated learning (FL) has become a promising tool in machine learning applications for healthcare. It allows hospitals/institutions to train models with sufficient data while the data is kept private. To make sure the FL model is robust when facing heterogeneous data among FL clients, m…

2023

Gaussian Max-Value Entropy Search for Multi-Agent Bayesian Optimization

IROS 2023poster

We study the multi-agent Bayesian optimization (BO) problem, where multiple agents maximize a black-box function via iterative queries. We focus on Entropy Search (ES), a sample-efficient BO algorithm that selects queries to maximize the mutual information about the maximum of the black-box function…

Cited by 15SourcecodeScholar
2023

Latent Variable Representation for Reinforcement Learning

ICLR 2023poster

Deep latent variable models have achieved significant empirical successes in model-based reinforcement learning (RL) due to their expressiveness in modeling complex transition dynamics. On the other hand, it remains unclear theoretically and empirically how latent variable models may facilitate lear…

Cited by 12SourcePDFScholar
2023

Learning to Optimize with Stochastic Dominance Constraints

AISTATS 2023poster

In real-world decision-making, uncertainty is important yet difficult to handle. Stochastic dominance provides a theoretically sound approach to comparing uncertain quantities, but optimization with stochastic dominance constraints is often computationally expensive, which limits practical applicabi…

2023

Ultra-Fine Entity Typing with Prior Knowledge about Labels: A Simple Clustering Based Strategy

EMNLP 2023long findings

Ultra-fine entity typing (UFET) is the task of inferring the semantic types from a large set of fine-grained candidates that apply to a given entity mention. This task is especially challenging because we only have a small number of training examples for many types, even with distant supervision str…

Cited by 0SourceScholar
2023

What do Deck Chairs and Sun Hats Have in Common? Uncovering Shared Properties in Large Concept Vocabularies

EMNLP 2023short main

Concepts play a central role in many applications. This includes settings where concepts have to be modelled in the absence of sentence context. Previous work has therefore focused on distilling decontextualised concept embeddings from language models. But concepts can be modelled from different per…

Cited by 0SourceScholar
2022

Improve Single-Point Zeroth-Order Optimization Using High-Pass and Low-Pass Filters

ICML 2022spotlight

Single-point zeroth-order optimization (SZO) is useful in solving online black-box optimization and control problems in time-varying environments, as it queries the function value only once at each time step. However, the vanilla SZO method is known to suffer from a large estimation variance and slo…

Cited by 23SourcePDFScholar
2022

Multi-Channel Speaker Diarization Using Spatial Features for Meetings

ICASSP 2022accepted

Speaker identification for overlapped speech presents a great challenge for speaker diarization tasks in meeting scenarios. In order to overcome such challenges, several overlap-aware resegmentation methods based on deep learning have been integrated into speaker diarization systems. In this paper w…

Cited by 0SourceScholar
2022

On the Global Convergence Rates of Decentralized Softmax Gradient Play in Markov Potential Games

NeurIPS 2022accept

Softmax policy gradient is a popular algorithm for policy optimization in single-agent reinforcement learning, particularly since projection is not needed for each gradient update. However, in multi-agent systems, the lack of central coordination introduces significant additional difficulties in the…

Cited by 30SourcePDFScholar
2022

Policy Optimization for Markov Games: Unified Framework and Faster Convergence

NeurIPS 2022accept

This paper studies policy optimization algorithms for multi-agent reinforcement learning. We begin by proposing an algorithm framework for two-player zero-sum Markov Games in the full-information setting, where each iteration consists of a policy update step at each state using a certain matrix game…

Cited by 33SourcePDFScholar
2022

Simple Attention Module Based Speaker Verification with Iterative Noisy Label Detection

ICASSP 2022accepted

Recently, the attention mechanism such as squeeze-and-excitation module (SE) and convolutional block attention module (CBAM) has achieved great success in deep learning-based speaker verification system. This paper introduces an alternative effective yet simple one, i.e., simple attention module (Si…

Cited by 0SourceScholar
2022

The CUHK-Tencent Speaker Diarization System for the ICASSP 2022 Multi-Channel Multi-Party Meeting Transcription Challenge

ICASSP 2022accepted

This paper describes our speaker diarization system submitted to the Multi-channel Multi-party Meeting Transcription (M2MeT) challenge, where Mandarin meeting data were recorded in multi-channel format for diarization and automatic speech recognition (ASR) tasks. In these meeting scenarios, the unce…

Cited by 0SourceScholar
2021

A Joint Training Framework of Multi-Look Separator and Speaker Embedding Extractor for Overlapped Speech

ICASSP 2021accepted

In multi-talker cases, overlapped speech degrades the speaker verification (SV) performance dramatically. To tackle this challenging problem, speech separation with multi-channel techniques can be adopted to extract each speaker’s signals to improve the SV performance. In this paper, a joint trainin…

Cited by 0SourceScholar
2021

Modelling General Properties of Nouns by Selectively Averaging Contextualised Embeddings

IJCAI 2021poster

While the success of pre-trained language models has largely eliminated the need for high-quality static word vectors in many NLP applications, static word vectors continue to play an important role in tasks where word meaning needs to be modelled in the absence of linguistic context. In this paper,…

2021

Replay and Synthetic Speech Detection with Res2Net Architecture

ICASSP 2021accepted

Existing approaches for replay and synthetic speech detection still lack generalizability to unseen spoofing attacks. This work proposes to leverage a novel model structure, so-called Res2Net, to improve the anti-spoofing countermeasure’s generalizability. Res2Net mainly modifies the ResNet block to…

Cited by 0SourceScholar
2020

Attention as Relation: Learning Supervised Multi-head Self-Attention for Relation Extraction

IJCAI 2020poster

Joint entity and relation extraction is critical for many natural language processing (NLP) tasks, which has attracted increasing research interest. However, it is still faced with the challenges of identifying the overlapping relation triplets along with the entire entity boundary and detecting the…

2020

Multi-Level Deep Neural Network Adaptation for Speaker Verification Using MMD and Consistency Regularization

ICASSP 2020accepted

Adapting speaker verification (SV) systems to a new environment is a very challenging task. Current adaptation methods in SV mainly focus on the backend, i.e, adaptation is carried out after the speaker embeddings have been created. In this paper, we present a DNN-based adaptation method using maxim…

Cited by 0SourceScholar
2020

Scalable Multi-Agent Reinforcement Learning for Networked Systems with Average Reward

NeurIPS 2020poster

It has long been recognized that multi-agent reinforcement learning (MARL) faces significant scalability issues due to the fact that the size of the state and action spaces are exponentially large in the number of agents. In this paper, we identify a rich class of networked MARL problems where the m…

Cited by 92SourcePDFScholar
2020

Soft Sensing Shirt for Shoulder Kinematics Estimation

ICRA 2020poster

Soft strain sensors have been explored as an unobtrusive approach for wearable motion tracking. However, accurate tracking of multi degree-of-freedom (DOF) noncyclic joint movements remains a challenge. This paper presents a soft sensing shirt for tracking shoulder kinematics of both cyclic and rand…

Cited by 44SourceScholar
2019

Boundary Discriminative Large Margin Cosine Loss for Text-independent Speaker Verification

ICASSP 2019accepted

Deep neural network based speaker embeddings have attracted much attention in text-independent speaker verification task. In addition to the network architecture, an appropriate design of the loss function is crucial for the deep discriminative embedding extractor. Inspired by the success of Large M…

Cited by 0SourceScholar
2019

Learning Discriminative Features in Sequence Training without Requiring Framewise Labelled Data

ICASSP 2019accepted

In this work, we try to answer two questions: Can deeply learned features with discriminative power benefit an ASR system’s robustness to acoustic variability? And how to learn them without requiring framewise labelled sequence training data? As existing methods usually require knowing where the lab…

Cited by 0SourceScholar
2019

Online Optimal Control with Linear Dynamics and Predictions: Algorithms and Regret Analysis

NeurIPS 2019poster

This paper studies the online optimal control problem with time-varying convex stage costs for a time-invariant linear dynamical system, where a finite lookahead window of accurate predictions of the stage costs are available at each time. We design online algorithms, Receding Horizon Gradient-based…

Cited by 115SourcePDFScholar
2019

Seq2Seq Attentional Siamese Neural Networks for Text-dependent Speaker Verification

ICASSP 2019accepted

In this paper, we present a Sequence-to-Sequence Attentional Siamese Neural Network (Seq2Seq-ASNN) that leverages temporal alignment information for end-to-end speaker verification. In prior works of speaker discriminative neural networks, utterance-level evaluation/enrollment speaker representation…

Cited by 0SourceScholar