Qiuyang Mang

Qiuyang Mang

Auto-generated profile, based on publicly available information

Qiuyang Mang

University of California - Berkeley, Berkeley, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 April 2024
Verified
Conference Paper
Open access
QMQiuyang Mang
Qiuyang Mang
AFAoyang Fang
Aoyang Fang
BYBoxi Yu
Boxi Yu
HCHanfei Chen
Hanfei Chen
PHPinjia He
Pinjia He

30 November 2023
Verified
Conference Paper
Open access
BYBoxi Yu
Boxi Yu
YHYiyan Hu
Yiyan Hu
QMQiuyang Mang
Qiuyang Mang
WHWenhan Hu
Wenhan Hu
PHPinjia He
Pinjia He
Named entity recognition (NER) systems have seen rapid progress in recent years due to the development of deep neural networks. These systems are widely used in various natural language processing applications, such as information extraction, question answering, and sentiment analysis. However, the complexity and intractability of deep neural networks can make NER systems unreliable in certain circumstances, resulting in incorrect predictions. For example, NER systems may misidentify female names as chemicals or fail to recognize the names of minority groups, leading to user dissatisfaction. To tackle this problem, we introduce TIN, a novel, widely applicable approach for automatically testing and repairing various NER systems. The key idea for automated testing is that the NER predictions of the same named entities under similar contexts should be identical. The core idea for automated repairing is that similar named entities should have the same NER prediction under the same context. We use TIN to test two SOTA NER models and two commercial NER APIs, i.e., Azure NER and AWS NER. We manually verify 784 of the suspicious issues reported by TIN and find that 702 are erroneous issues, leading to high precision (85.0%-93.4%) across four categories of NER errors: omission, over-labeling, incorrect category, and range error. For automated repairing, TIN achieves a high error reduction rate (26.8%-50.6%) over the four systems under test, which successfully repairs 1,056 out of the 1,877 reported NER errors.

17 June 2025 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
QMQiuyang Mang
Qiuyang Mang
JBJinsheng Ba
Jinsheng Ba
PHPinjia He
Pinjia He
MRManuel Rigger
Manuel Rigger
Graph-processing systems, including Graph Database Management Systems (GDBMSes) and graph libraries, are designed to analyze and manage graph data efficiently. They are widely used in applications such as social networks, recommendation systems, and fraud detection. However, logic bugs in these systems can lead to incorrect results, compromising the reliability of applications. While recent research has explored testing techniques specialized for GDBMSes, it is unclear how to adapt them to graph-processing systems in general. This paper proposes G raph - cutting , a universal approach for detecting logic bugs in both GDBMSes and various algorithms in graph libraries. Our key idea is inspired by the observation that certain graph patterns are critical for various graph-processing tasks. Dividing graph data into subgraphs that preserve those patterns establishes a natural relationship between query results on the original graph and its subgraphs, allowing for the detection of logic bugs when this relationship is violated. We implemented Graph-cutting as a tool, GSlicer, and evaluated it on 3 popular graph-processing systems, NetworkX, Neo4j, and Kùzu. GSlicer detected 39 unique and previously unknown bugs, out of which 34 have been fixed and confirmed by developers. At least 8 logic bugs detected by GSlicer cannot be detected by baseline strategies. Additionally, by leveraging just a few concrete relationships, Graph-cutting can cover over 100 APIs in NetworkX. We expect this technique to be widely applicable and that it can be used to improve the quality of graph-processing systems broadly.

18 December 2024 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
WDWenjing Deng
Wenjing Deng
QMQiuyang Mang
Qiuyang Mang
CZChengyu Zhang
Chengyu Zhang
MRManuel Rigger
Manuel Rigger
Spatial Database Management Systems (SDBMSs) aim to store, manipulate, and retrieve spatial data . SDBMSs are employed in various modern applications, such as geographic information systems, computer-aided design tools, and location-based services. However, the presence of logic bugs in SDBMSs can lead to incorrect results, substantially undermining the reliability of these applications. Detecting logic bugs in SDBMSs is challenging due to the lack of ground truth for identifying incorrect results. In this paper, we propose an automated geometry-aware generator to generate high-quality SQL statements for SDBMSs and a novel concept named Affine Equivalent Inputs (AEI) to validate the results of SDBMSs. We implemented them as a tool named Spatter ( Spat ial DBMS Tes ter ) for finding logic bugs in four popular SDBMSs: PostGIS, DuckDB Spatial, MySQL, and SQL Server. Our testing campaign detected 34 previously unknown and unique bugs in these SDBMSs, of which 30 have been confirmed, and 18 have already been fixed. Our testing efforts have been well appreciated by the developers. Experimental results demonstrate that the geometry-aware generator significantly outperforms a naive random-shape generator in detecting unique bugs, and AEI can identify 14 logic bugs in SDBMSs that were totally overlooked by previous methodologies.

24 August 2024
Verified
Conference Paper
Open access
JCJingbang Chen
Jingbang Chen
QMQiuyang Mang
Qiuyang Mang
HZHangrui Zhou
Hangrui Zhou
RPRichard Peng
Richard Peng
YGYu Gao
Yu Gao
Chenhao MaChenhao Ma
Chenhao Ma
Signed networks, characterized by edges labeled as either positive or negative, offer nuanced insights into interaction dynamics beyond the capabilities of unsigned graphs. Central to this is the task of identifying the maximum balanced subgraph, crucial for applications like polarized community detection in social networks and portfolio analysis in finance. Traditional models, however, are limited by an assumption of perfect partitioning, which fails to mirror the complexities of real-world data. Addressing this gap, we introduce an innovative generalized balanced subgraph model that incorporates tolerance for imbalance. Our proposed region-based heuristic algorithm, tailored for this NP -hard problem, strikes a balance between low time complexity and high-quality outcomes. Comparative experiments validate its superior performance against leading solutions, delivering enhanced effectiveness (notably larger subgraph sizes) and efficiency (achieving up to 100× speedup) in both traditional and generalized contexts.

26 May 2026
Verified
Conference Paper
Open access
SLShu Liu
Shu Liu
MCMert Cemri
Mert Cemri
SAShubham Agarwal
Shubham Agarwal
AKAlexander Krentsel
Alexander Krentsel
ANAshwin Naren
Ashwin Naren
ISIon Stoica
Ion Stoica
LLM-driven evolutionary search is emerging as a powerful approach for discovering algorithms and designs, but existing frameworks are difficult to reuse, extend, and compare. We present SkyDiscover, a flexible, adaptive framework for AI-driven scientific and algorithmic discovery. SkyDiscover decomposes the discovery loop into four reusable components: Context Builder, Solution Generator, Evaluator, and Solution Selector, while exposing the control logic above them as a programmable interface. This modular design enables rapid experimentation and even supports adaptive designs where AI can adapt or even optimize the optimization process itself during search. We demonstrate SkyDiscover across more than 200 optimization tasks spanning mathematical optimization, systems design, algorithmic programming, and constrained image generation. Under fixed budgets and shared models, the adaptive algorithms implemented on top of SkyDiscover achieves the strongest open-source performance compared to OpenEvolve, ShinkaEvolve, and GEPA, and matches or exceeds AlphaEvolve on many tasks. A live demo further showcases end-to-end discovery with real-time monitoring, human-in-the-loop steering, and meta-optimization of the search process.