← Search

Limei Liu

4 accepted papers

2026

A More Efficient Reduction from Outlier-Aware to Outlier-Free k-Median

AAAI 2026technical

Given a non-negative integer \ell, the k-median with outliers problem extends the standard k-median problem by allowing the removal of up to \ell points and minimizing the clustering cost over the remaining ones. Algorithmic development in this setting remains an active area of research due to its r

Cited by 0SourcePDFScholar
2026

SeD-UD: An Influence-Driven and Hierarchically-Decoupled Information Bottleneck for Multimodal Intent Recognition

CVPR 2026

Multimodal intent recognition (MIR) is hindered by substantial redundancy and noise originating from text, speech, and visual inputs, which weakens feature distinctiveness and ultimately harms recognition performance. Although recent approaches based on the information bottleneck (IB) principle miti

Cited by 0SourcecodeScholar
2024

Parameterized Approximation Schemes for Fair-Range Clustering

NeurIPS 2024poster

Fair-range clustering extends classical clustering formulations by associating each data point with one or more demographic labels. It imposes lower and upper bound constraints on the number of facilities opened for each label, ensuring fair representation of all demographic groups by the selected f…

Cited by 0SourcePDFScholar
2024

Towards a Theoretical Understanding of Why Local Search Works for Clustering with Fair-Center Representation

AAAI 2024technical

The representative k-median problem generalizes the classical clustering formulations in that it partitions the data points into several disjoint demographic groups and poses a lower-bound constraint on the number of opened facilities from each group, such that all the groups are fairly represented…

Cited by 1SourcePDFScholar