← Search

Zifan LIU

11 accepted papers

2026

Automatic Channel Pruning by Searching with Structure Embedding for Hash Network

AAAI 2026technical

Deep hash networks are widely used in tasks such as large-scale image retrieval due to high search efficiency and low storage costs through binary hash codes. With the growing demand for deploying deep hash networks on resource-constrained devices, it is crucial to perform network compression on the

Cited by 0SourcePDFScholar
2026

Experience-Evolving Multi-Turn Tool-Use Agent with Hybrid Episodic–Procedural Memory

ICML 2026poster

As intents unfold and environments change, multi-turn agents face continuously shifting decision contexts. Although reusing past experience is intuitively appealing, existing approaches remain limited: full trajectories are often too context-specific to transfer, while tool-level reuse ignores the c…

Cited by 0SourceScholar
2026

GAS: Enhancing Reward-Cost Balance of Generative Model-assisted Offline Safe RL

ICLR 2026poster

Offline Safe Reinforcement Learning (OSRL) aims to learn a policy that achieves high performance in sequential decision-making while satisfying safety constraints, using only pre-collected datasets. Recent works, inspired by the strong capabilities of Generative Models (GMs), reformulate decision-ma…

Cited by 0SourceScholar
2025

C2IQL: Constraint-Conditioned Implicit Q-learning for Safe Offline Reinforcement Learning

ICML 2025poster

Safe offline reinforcement learning aims to develop policies that maximize cumulative rewards while satisfying safety constraints without the need for risky online interaction. However, existing methods often struggle with the out-of-distribution (OOD) problem, leading to potentially unsafe and subo…

Cited by 0SourcePDFScholar
2025

Deep Graph Online Hashing for Multi-Label Image Retrieval

AAAI 2025technical

Online hashing has attracted much research attention for large-scale image retrieval in a streaming way. The main challenge lies in keeping balance between high retrieval accuracy and low training time. Existing online hashing methods almost rely on shallow models rather than deep networks due to hi…

2025

ECLAIR: Enhanced Clarification for Interactive Responses

AAAI 2025technical

We present ECLAIR (Enhanced CLArification for Interactive Responses), a novel unified and end-to-end framework for interactive disambiguation in enterprise AI assistants. ECLAIR generates clarification questions for ambiguous user queries and resolves ambiguity based on the user's response. We intro…

Cited by 1SourcePDFScholar
2025

ECLAIR: Enhanced Clarification for Interactive Responses in an Enterprise AI Assistant

AAAI 2025technical

Large language models (LLMs) have shown remarkable progress in understanding and generating natural language across various applications. However, they often struggle with resolving ambiguities in real-world, enterprise-level interactions, where context and domain-specific knowledge play a crucial r…

Cited by 0SourcePDFScholar
2025

Reinforcement Learning with Intrinsically Motivated Feedback Graph for Lost-sales Inventory Control

AISTATS 2025poster

Reinforcement learning (RL) has proven to be well-performed and versatile in inventory control (IC). However, further improvement of RL algorithms in the IC domain is impeded by two limitations of online experience. First, online experience is expensive to acquire in real-world applications. With th…

Cited by 0SourcecodeScholar
2024

Individual Contributions as Intrinsic Exploration Scaffolds for Multi-agent Reinforcement Learning

ICML 2024poster

In multi-agent reinforcement learning (MARL), effective exploration is critical, especially in sparse reward environments. Although introducing global intrinsic rewards can foster exploration in such settings, it often complicates credit assignment among agents. To address this difficulty, we propos…

2021

On Robust Mean Estimation under Coordinate-level Corruption

ICML 2021spotlight

We study the problem of robust mean estimation and introduce a novel Hamming distance-based measure of distribution shift for coordinate-level corruptions. We show that this measure yields adversary models that capture more realistic corruptions than those used in prior works, and present an informa…

Cited by 10SourcePDFScholar