activity
20222026
most citedThe Double Regularization Method for Capacity Constrained Optimal Transport

3 citations · 3 across the 4 of their papers we have counts for

collaborators

5 papers

cs.AI2026

Steering Vectors for Competing Ethical Frameworks Are Interchangeable: A Competing-Target Test for Activation Steering

Weilun Xu, Zipeng Sun

Activation steering adds a vector to a model's hidden states to control a named behaviour. A gain on that behaviour, however, does not show that the vector controls it directly: it…

cs.SE2026

OpenHarmony Bench: Evaluating LLMs and Coding Agents on OpenHarmony App Development

Li Li, Han Hu, Tianjian Zhang +27

We present OPENHARMONY BENCH, an app-level coding benchmark for evaluating LLM-based coding agents on OpenHarmony ArkTS applications. Unlike function-level benchmarks, it evaluates…

cs.SI2024

Pre-train and Refine: Towards Higher Efficiency in K-Agnostic Community Detection without Quality Degradation

Meng Qin, Chaorui Zhang, Yu Gao +2

Community detection (CD) is a classic graph inference task that partitions nodes of a graph into densely connected groups. While many CD methods have been proposed with either impr…

cs.SI2023

RaftGP: Random Fast Graph Partitioning

Yu Gao, Meng Qin, Yibin Ding +6

Graph partitioning (GP), a.k.a. community detection, is a classic problem that divides the node set of a graph into densely-connected blocks. Following prior work on the IEEE HPEC…

math.OC2022★ 3 cited

The Double Regularization Method for Capacity Constrained Optimal Transport

Tianhao Wu, Qihao Cheng, Zihao Wang +4

Capacity constrained optimal transport is a variant of optimal transport, which adds extra constraints on the set of feasible couplings in the original optimal transport problem to…