Source author record

Kenan Li

Kenan Li appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

3works
4topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

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

Published work

3 published item(s)

preprint2026arXiv

ChemBART: A Pre-trained BART Model Assisting Organic Chemistry Analysis

Recent advances in large language models (LLMs) have demonstrated transformative potential across diverse fields. While LLMs have been applied to molecular simplified molecular input line entry system (SMILES) in computer-aided synthesis planning (CASP), existing methodologies typically address single tasks, such as precursor prediction. We introduce ChemBART, a SMILES-based LLM pre-trained on chemical reactions, which enables a unified model for multiple downstream chemical tasks--achieving the paradigm of "one model, one pre-training, multiple tasks." By leveraging outputs from a mask-filling pre-training task on reaction expressions, ChemBART effectively solves a variety of chemical problems, including precursor/reagent generation, temperature-yield regression, molecular property classification, and optimizing the policy and value functions within a reinforcement learning framework, integrated with Monte Carlo tree search for multi-step synthesis route design. Unlike single-molecule pre-trained LLMs constrained to specific applications, ChemBART addresses broader chemical challenges and integrates them for comprehensive synthesis planning. Crucially, ChemBART-designed multi-step synthesis routes and reaction conditions directly inspired wet-lab validation, which confirmed shorter pathways with ~30% yield improvement over literature benchmarks. Our work validates the power of reaction-focused pre-training and showcases the broad utility of ChemBART in advancing the complete synthesis planning cycle.

preprint2026arXiv

SWE-Edit: Rethinking Code Editing for Efficient SWE-Agent

Large language model agents have achieved remarkable progress on software engineering tasks, yet current approaches suffer from a fundamental context coupling problem: the standard code editing interface conflates code inspection, modification planning, and edit execution within a single context window, forcing agents to interleave exploratory viewing with strictly formatted edit generation. This causes irrelevant information to accumulate and degrades agent performance. To address this, we propose SWE-Edit, which decomposes code editing into two specialized subagents: a Viewer that extracts task-relevant code on demand, and an Editor that executes modifications from high-level plans--allowing the main agent to focus on reasoning while delegating context-intensive operations to clean context windows. We further investigate what makes an effective editing model: observing that the prevalent find-and-replace format is error-prone, we train Qwen3-8B with GRPO to adaptively select editing modes, yielding improved editing efficiency over single-format baselines. On SWE-bench Verified, SWE-Edit improves resolved rate by 2.1% while reducing inference cost by 17.9%. We additionally propose a code editing benchmark that reliably predicts downstream agentic performance, providing practical guidance for editing model selection. Our code is publicly available at https://github.com/microsoft/SWE-Edit.

preprint2020arXiv

On the Uniqueness of Functions that Maximize the Crouzeix Ratio

Let $A$ be an $n$ by $n$ matrix with numerical range $W(A) := \{ q^{*}Aq : q \in \mathbb{C}^n , ~\| q \|_2 = 1 \}$. We are interested in functions $\hat{f}$ that maximize $\| f(A) \|_2$ (the matrix norm induced by the vector 2-norm) over all functions $f$ that are analytic in the interior of $W(A)$ and continuous on the boundary and satisfy $\max_{z \in W(A)} | f(z) | \leq 1$. It is known that there are functions $\hat{f}$ that achieve this maximum and that such functions are of the form $B\circϕ$, where $ϕ$ is any conformal mapping from the interior of $W(A)$ to the unit disk $\mathbb{D}$, extended to be continuous on the boundary of $W(A)$, and $B$ is a Blaschke product of degree at most $n-1$. It is not known if a function $\hat{f}$ that achieves this maximum is unique, up to multiplication by a scalar of modulus one. We show that this is the case when $A$ is a $2\times 2$ nonnormal matrix or a Jordan block, but we give examples of some $3\times 3$ matrices with elliptic numerical range for which two different functions $\hat{f}$, involving the same conformal mapping but Blaschke products of different degrees, achieve the same maximal value of $||f(A)||_2$.