← Search

Zhengren Wang

5 accepted papers

2026

SWE-MiniSandbox: Container-Free Reinforcement Learning for Building Software Engineering Agents

ICML 2026poster

Reinforcement learning (RL) has become a key paradigm for training software engineering (SWE) agents, yet its practical accessibility and scalability is often constrained by container-based execution frameworks used for environment isolation. As the number of task instances increases, pre-cached con…

Cited by 0SourceScholar
2025

HopRAG: Multi-Hop Reasoning for Logic-Aware Retrieval-Augmented Generation

ACL 2025finding

Retrieval-Augmented Generation (RAG) systems often struggle with imperfect retrieval, as traditional retrievers focus on lexical or semantic similarity rather than logical relevance. To address this, we propose HopRAG, a novel RAG framework that augments retrieval with logical reasoning through grap…

Cited by 0SourcePDFScholar
2025

MaintainCoder: Maintainable Code Generation Under Dynamic Requirements

NeurIPS 2025poster

Modern code generation has made significant strides in functional correctness and execution efficiency. However, these systems often overlook a critical dimension in real-world software development: \textit{maintainability}. To handle dynamic requirements with minimal rework, we propose \textbf{Main…

Cited by 0SourcecodeScholar
2025

QAEncoder: Towards Aligned Representation Learning in Question Answering Systems

ACL 2025long

Modern QA systems entail retrieval-augmented generation (RAG) for accurate and trustworthy responses. However, the inherent gap between user queries and relevant documents hinders precise matching. We introduce QAEncoder, a training-free approach to bridge this gap. Specifically, QAEncoder estimates…

2023

A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap

IJCAI 2023poster

Given a graph, the k-plex is a vertex set in which each vertex is not adjacent to at most k-1 other vertices in the set. The maximum k-plex problem, which asks for the largest k-plex from a given graph, is an important but computationally challenging problem in applications like graph search and com…