BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Zhimin Chen

Zhimin Chen contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
eess.SPInformation RetrievalMachine LearningArtificial IntelligenceSoftware Engineering

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
7works
0followers
5topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

7 published item(s)

preprint2026arXiv

Debugging the Debuggers: Failure-Anchored Structured Recovery for Software Engineering Agents

Software engineering agents are increasingly deployed in evaluable engineering environments, yet post-failure recovery remains costly, manual, and ad hoc. Existing systems expose traces or generate follow-up feedback, but they do not convert heterogeneous runtime evidence into grounded, bounded recovery guidance for a subsequent attempt. We present PROBE, a failure-anchored framework for structured recovery in software engineering agents. PROBE organizes failed-run telemetry into structured evidence, structured diagnosis, and bounded recovery guidance through a Telemetry Layer, a Diagnosis Layer, and a Guidance Gate. The Telemetry Layer preserves fine-grained runtime signals, the Diagnosis Layer fuses cross-signal evidence into grounded diagnoses, and the Guidance Gate produces diagnosis-derived guidance only when it is evidence-grounded, actionable, and within the scope of agent-side behavior. We evaluate PROBE across three settings: repository-level software repair, enterprise workflow recovery, and AIOps service mitigation. On 257 initially unresolved cases, PROBE achieves 65.37% Top-1 diagnosis accuracy and a 21.79% recovery rate, outperforming the strongest non-PROBE baseline by 43.58 and 12.45 percentage points. The results reveal a diagnosis-recovery gap: accurate diagnosis is necessary but insufficient unless translated into bounded guidance that a subsequent attempt can execute and verify. Beyond controlled evaluation, a Microsoft IcM prototype shows that PROBE can attach as a non-intrusive side channel to existing service-diagnosis workflows without changing the agent policy, toolset, or execution budget. These results suggest that telemetry-grounded, failure-anchored recovery can improve post-failure recoverability under realistic engineering constraints.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

A New Atomic Norm for DOA Estimation With Gain-Phase Errors

The problem of direction of arrival (DOA) estimation has been studied for decades as an essential technology in enabling radar, wireless communications, and array signal processing related applications. In this paper, the DOA estimation problem in the scenario with gain-phase errors is considered, and a sparse model is formulated by exploiting the signal sparsity in the spatial domain. By proposing a new atomic norm, named as GP-ANM, an optimization method is formulated via deriving a dual norm of GP-ANM. Then, the corresponding semidefinite program (SDP) is given to estimate the DOA efficiently, where the SDP is obtained based on the Schur complement. Moreover, a regularization parameter is obtained theoretically in the convex optimization problem. Simulation results show that the proposed method outperforms the existing methods, including the subspace-based and sparse-based methods in the scenario with gain-phase errors.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Efficient DOA Estimation Method for Reconfigurable Intelligent Surfaces Aided UAV Swarm

The conventional direction of arrival (DOA) estimation methods are performed with multiple receiving channels. In this paper, a changeling DOA estimation problem is addressed in a different scenario with only one full-functional receiving channel. A new unmanned aerial vehicle (UAV) swarm system using multiple lifted reconfigurable intelligent surface (RIS) is proposed for the DOA estimation. The UAV movement degrades the DOA estimation performance significantly, and the existing atomic norm minimization (ANM) methods cannot be used in the scenario with array perturbation. Specifically, considering the position perturbation of UAVs, a new atomic norm-based DOA estimation method is proposed, where an atomic norm is defined with the parameter of the position perturbation. Then, a customized semi-definite programming (SDP) method is derived to solve the atomic norm-based method, where different from the traditional SDP method, an additional transforming matrix is formulated. Moreover, a gradient descent method is applied to refine the estimated DOA and the position perturbation further. Simulation results show that the proposed method achieves much better DOA estimation performance in the RIS-aided UAV swarm system with only one receiving channel than various benchmark schemes.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Off-Grid DOA Estimation Using Sparse Bayesian Learning in MIMO Radar With Unknown Mutual Coupling

In the practical radar with multiple antennas, the antenna imperfections degrade the system performance. In this paper, the problem of estimating the direction of arrival (DOA) in multiple-input and multiple-output (MIMO) radar system with unknown mutual coupling effect between antennas is investigated. To exploit the target sparsity in the spatial domain, the compressed sensing (CS)-based methods have been proposed by discretizing the detection area and formulating the dictionary matrix, so an \emph{off-grid} gap is caused by the discretization processes. In this paper, different from the present DOA estimation methods, both the off-grid gap due to the sparse sampling and the unknown mutual coupling effect between antennas are considered at the same time, and a novel sparse system model for DOA estimation is formulated. Then, a novel sparse Bayesian learning (SBL)-based method named sparse Bayesian learning with the mutual coupling (SBLMC) is proposed, where an expectation-maximum (EM)-based method is established to estimate all the unknown parameters including the noise variance, the mutual coupling vectors, the off-grid vector and the variance vector of scattering coefficients. Additionally, the prior distributions for all the unknown parameters are theoretically derived. With regard to the DOA estimation performance, the proposed SBLMC method can outperform state-of-the-art methods in the MIMO radar with unknown mutual coupling effect, while keeping the acceptable computational complexity.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Reconfigurable Intelligent Surface Aided Sparse DOA Estimation Method With Non-ULA

The direction of arrival (DOA) estimation problem is addressed in this letter. A reconfigurable intelligent surface (RIS) aided system for the DOA estimation is proposed. Unlike traditional DOA estimation systems, a low-cost system with only one complete functional receiver is given by changing the phases of the reflected signals at the RIS elements to realize the multiple measurements. Moreover, an atomic norm-based method is proposed for the DOA estimation by exploiting the target sparsity in the spatial domain and solved by a semi-definite programming (SDP) method. Furthermore, the RIS elements can be any geometry array for practical consideration, so a transformation matrix is formulated and different from the conventional SDP method. Simulation results show that the proposed method can estimate the DOA more accurately than the existing methods in the non-uniform linear RIS array.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Open Domain Question Answering Using Web Tables

Tables extracted from web documents can be used to directly answer many web search queries. Previous works on question answering (QA) using web tables have focused on factoid queries, i.e., those answerable with a short string like person name or a number. However, many queries answerable using tables are non-factoid in nature. In this paper, we develop an open-domain QA approach using web tables that works for both factoid and non-factoid queries. Our key insight is to combine deep neural network-based semantic similarity between the query and the table with features that quantify the dominance of the table in the document as well as the quality of the information in the table. Our experiments on real-life web search queries show that our approach significantly outperforms state-of-the-art baseline approaches. Our solution is used in production in a major commercial web search engine and serves direct answers for tens of millions of real user queries per month.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

TableQnA: Answering List Intent Queries With Web Tables

The web contains a vast corpus of HTML tables. They can be used to provide direct answers to many web queries. We focus on answering two classes of queries with those tables: those seeking lists of entities (e.g., `cities in california') and those seeking superlative entities (e.g., `largest city in california'). The main challenge is to achieve high precision with significant coverage. Existing approaches train machine learning models to select the answer from the candidates; they rely on textual match features between the query and the content of the table along with features capturing table quality/importance. These features alone are inadequate for achieving the above goals. Our main insight is that we can improve precision by (i) first extracting intent (structured information) from the query for the above query classes and (ii) then performing structure-aware matching (instead of just textual matching) between the extracted intent and the candidates to select the answer. We model (i) as a sequence tagging task. We leverage state-of-the-art deep neural network models with word embeddings. The model requires large scale training data which is expensive to obtain via manual labeling; we therefore develop a novel method to automatically generate the training data. For (ii), we develop novel features to compute structure-aware match and train a machine learning model. Our experiments on real-life web search queries show that (i) our intent extractor for list and superlative intent queries has significantly higher precision and coverage compared with baseline approaches and (ii) our table answer selector significantly outperforms the state-of-the-art baseline approach. This technology has been used in production by Microsoft's Bing search engine since 2016.

0 citations0 reviewsNo code linkedOpen access