← Search

Zidong Du

34 accepted papers

2026

Code Driven Planning with Domain-Adaptive Selector

ICLR 2026poster

Large Language Models (LLMs) have been widely adopted as task planners for AI agents in sequential decision-making problems, leveraging their extensive world knowledge. However, the gap between their general knowledge and environment-specific requirements often leads to inaccurate plans. To address…

Cited by 0SourceScholar
2026

Efficient Diffusion Planning with Temporal Diffusion

AAAI 2026technical

Diffusion planning is a promising method for learning high-performance policies from offline data. To avoid the impact of discrepancies between planning and reality on performance, previous works generate new plans at each time step. However, this incurs significant computational overhead and leads

Cited by 0SourcePDFScholar
2026

LocalV: Exploiting Information Locality for IP-level Verilog Generation

ICML 2026poster

The generation of Register-Transfer Level (RTL) code is a crucial yet labor-intensive step in digital hardware design, traditionally requiring engineers to manually translate complex specifications into thousands of lines of synthesizable Hardware Description Language (HDL) code. While Large Languag…

Cited by 0SourceScholar
2026

QiMeng-CRUX: Narrowing the Gap Between Natural Language and Verilog via Core Refined Understanding eXpression

AAAI 2026technical

Large language models (LLMs) have shown promising capabilities in hardware description language (HDL) generation. However, existing approaches often rely on free-form natural language descriptions that are often ambiguous, redundant, and unstructured, which poses significant challenges for downstrea

Cited by 0SourcePDFScholar
2026

QiMeng-EvoPartition: Rethinking the Impact of Partitioning for Automated Pipeline Design

IJCAI 2026

As a key technique for improving throughput by increasing clock frequency and reducing Cycles per Instruction (CPI), pipeline design increasingly relies on automated methods with the growing scale of modern circuits. However, existing automated pipelining methods often decouple partitioning from CPI

Cited by 0Scholar
2026

QiMeng-VPID: Verification-Grounded Port-Level Iterative Decomposition for Complex Verilog Generation

IJCAI 2026

While Large Language Models (LLMs) have shown promise in translating natural-language specifications to Register-Transfer Level (RTL) designs, they often fail on complex, port-rich IPs. Existing frameworks typically separate generation from debugging, relying on static decomposition and iterative re

Cited by 0Scholar
2026

StepFun-Formalizer: Unlocking the Autoformalization Potential of LLMs Through Knowledge-Reasoning Fusion

AAAI 2026technical

Autoformalization aims to translate natural-language mathematical statements into a formal language. While LLMs have accelerated progress in this area, existing methods still suffer from low accuracy. We identify two key abilities for effective autoformalization: comprehensive mastery of formal-lang

Cited by 0SourcePDFScholar
2025

Automated Superscalar Processor Design by Learning Data Dependencies

IJCAI 2025

Automated processor design, which can significantly reduce human efforts and accelerate design cycles, has received considerable attention. While recent advancements have automatically designed single-cycle processors that execute one instruction per cycle, their performance cannot compete with mode

Cited by 0SourcePDFScholar
2025

InverseCoder: Self-improving Instruction-Tuned Code LLMs with Inverse-Instruct

AAAI 2025technical

Recent advancements in open-source code large language models (LLMs) have been driven by fine-tuning on the data generated from powerful closed-source LLMs, which are expensive to obtain. This paper explores whether it is possible to use a fine-tuned open-source model to generate additional data to…

2025

QiMeng-CodeV-R1: Reasoning-Enhanced Verilog Generation

NeurIPS 2025poster

Large language models (LLMs) trained via reinforcement learning with verifiable reward (RLVR) have achieved breakthroughs on tasks with explicit, automatable verification, such as software programming and mathematical problems. Extending RLVR to electronic design automation (EDA), especially automat…

Cited by 0SourceScholar
2025

QiMeng-SALV: Signal-Aware Learning for Verilog Code Generation

NeurIPS 2025poster

The remarkable progress of Large Language Models (LLMs) presents promising opportunities for Verilog code generation which is significantly important for automated circuit design. The lacking of meaningful functional rewards hinders the preference optimization based on Reinforcement Learning (RL) fo…

Cited by 0SourceScholar
2024

Automated CPU Design by Learning from Input-Output Examples

IJCAI 2024poster

Designing a central processing unit (CPU) requires intensive manual work of talented experts to implement the circuit logic from design specifications. Although considerable progress has been made in electronic design automation (EDA) to relieve human efforts, all existing EDA tools require hand-cra…

Cited by 0SourcePDFScholar
2024

Can Protective Perturbation Safeguard Personal Data from Being Exploited by Stable Diffusion?

CVPR 2024poster

Stable Diffusion has established itself as a foundation model in generative AI artistic applications receiving widespread research and application. Some recent fine-tuning methods have made it feasible for individuals to implant personalized concepts onto the basic Stable Diffusion model with minima…

2024

Emergent Communication for Numerical Concepts Generalization

AAAI 2024technical

Research on emergent communication has recently gained significant traction as a promising avenue for the linguistic community to unravel human language's origins and explore artificial intelligence's generalization capabilities. Current research has predominantly concentrated on recognizing qualita…

Cited by 0SourcePDFScholar
2024

Hypothesis, Verification, and Induction: Grounding Large Language Models with Self-Driven Skill Learning

AAAI 2024technical

Large language models (LLMs) show their powerful automatic reasoning and planning capability with a wealth of semantic knowledge about the human world. However, the grounding problem still hinders the applications of LLMs in the real-world environment. Existing studies try to fine-tune the LLM or ut…

Cited by 0SourcePDFScholar
2024

Prompt-based Visual Alignment for Zero-shot Policy Transfer

ICML 2024poster

Overfitting in RL has become one of the main obstacles to applications in reinforcement learning(RL). Existing methods do not provide explicit semantic constrain for the feature extractor, hindering the agent from learning a unified cross-domain representation and resulting in performance degradatio…

Cited by 0SourcePDFScholar
2023

ANPL: Towards Natural Programming with Interactive Decomposition

NeurIPS 2023poster

Though LLMs are capable of generating plausible programs, it’s challenging to interact with the LLMs further to revise the program, especially if the user’s specific requirements are different from the initial proposal. In this paper, we introduce ANPL, an interactive programming system that ensures…

2023

BALTO: fast tensor program optimization with diversity-based active learning

ICLR 2023poster

Tensor program optimization (TPO) based on pre-trained models can effectively reduce the computing time of deep neural networks. However, training of such models is prohibitively expensive, which highly depends on a large-scale dataset and thus requires tremendous time-consuming performance measurem…

Cited by 6SourcePDFScholar
2023

Conceptual Reinforcement Learning for Language-Conditioned Tasks

AAAI 2023technical

Despite the broad application of deep reinforcement learning (RL), transferring and adapting the policy to unseen but similar environments is still a significant challenge. Recently, the language-conditioned policy is proposed to facilitate policy transfer through learning the joint representation o…

Cited by 9SourcePDFScholar
2023

Context Shift Reduction for Offline Meta-Reinforcement Learning

NeurIPS 2023poster

Offline meta-reinforcement learning (OMRL) utilizes pre-collected offline datasets to enhance the agent's generalization ability on unseen tasks. However, the context shift problem arises due to the distribution discrepancy between the contexts used for training (from the behavior policy) and testin…

2023

Contrastive Modules with Temporal Attention for Multi-Task Reinforcement Learning

NeurIPS 2023poster

In the field of multi-task reinforcement learning, the modular principle, which involves specializing functionalities into different modules and combining them appropriately, has been widely adopted as a promising approach to prevent the negative transfer problem that performance degradation due to…

2023

Decompose a Task into Generalizable Subtasks in Multi-Agent Reinforcement Learning

NeurIPS 2023poster

In recent years, Multi-Agent Reinforcement Learning (MARL) techniques have made significant strides in achieving high asymptotic performance in single task. However, there has been limited exploration of model transferability across tasks. Training a model from scratch for each task can be time-cons…

Cited by 9SourcePDFScholar
2023

Efficient Symbolic Policy Learning with Differentiable Symbolic Expression

NeurIPS 2023poster

Deep reinforcement learning (DRL) has led to a wide range of advances in sequential decision-making tasks. However, the complexity of neural network policies makes it difficult to understand and deploy with limited computational resources. Currently, employing compact symbolic expressions as symboli…

2023

Emergent Communication for Rules Reasoning

NeurIPS 2023poster

Research on emergent communication between deep-learning-based agents has received extensive attention due to its inspiration for linguistics and artificial intelligence. However, previous attempts have hovered around emerging communication under perception-oriented environmental settings, that…

Cited by 0SourcePDFScholar
2023

Online Prototype Alignment for Few-shot Policy Transfer

ICML 2023poster

Domain adaptation in RL mainly deals with the changes of observation when transferring the policy to a new environment. Many traditional approaches of domain adaptation in RL manage to learn a mapping function between the source and target domain in explicit or implicit ways. However, they typically…

2023

Online Symbolic Regression with Informative Query

AAAI 2023technical

Symbolic regression, the task of extracting mathematical expressions from the observed data, plays a crucial role in scientific discovery. Despite the promising performance of existing methods, most of them conduct symbolic regression in an offline setting. That is, they treat the observed data poin…

Cited by 2SourcePDFScholar
2022

Accelerating Sparse Convolution with Column Vector-Wise Sparsity

NeurIPS 2022accept

Weight sparsity is a promising approach to reducing the model size and computation cost of convolutional neural networks (CNNs). Nevertheless, non-zero weights often distribute randomly in sparse CNN models, introducing enormous difficulty in obtaining actual speedup on common hardware (e.g., GPU) o…

Cited by 14SourcePDFScholar
2022

BabelTower: Learning to Auto-parallelized Program Translation

ICML 2022spotlight

GPUs have become the dominant computing platforms for many applications, while programming GPUs with the widely-used CUDA parallel programming model is difficult. As sequential C code is relatively easy to obtain either from legacy repositories or by manual implementation, automatically translating…

Cited by 13SourcePDFScholar
2022

Causality-driven Hierarchical Structure Discovery for Reinforcement Learning

NeurIPS 2022accept

Hierarchical reinforcement learning (HRL) has been proven to be effective for tasks with sparse rewards, for it can improve the agent's exploration efficiency by discovering high-quality hierarchical structures (e.g., subgoals or options). However, automatically discovering high-quality hierarchical…

Cited by 23SourcePDFScholar
2021

Hindsight Value Function for Variance Reduction in Stochastic Dynamic Environment

IJCAI 2021poster

Policy gradient methods are appealing in deep reinforcement learning but suffer from high variance of gradient estimate. To reduce the variance, the state value function is applied commonly. However, the effect of the state value function becomes limited in stochastic dynamic environments, where the…

Cited by 9SourcePDFScholar
2021

ScaleCert: Scalable Certified Defense against Adversarial Patches with Sparse Superficial Layers

NeurIPS 2021poster

Adversarial patch attacks that craft the pixels in a confined region of the input images show their powerful attack effectiveness in physical environments even with noises or deformations. Existing certified defenses towards adversarial patch attacks work well on small images like MNIST and CIFAR-10…

Cited by 14SourcePDFScholar