← Search

Zhaoxuan Wu

18 accepted papers

2026

MEM1: Learning to Synergize Memory and Reasoning for Efficient Long-Horizon Agents

ICLR 2026poster

Modern language agents often need to solve tasks requiring long-horizon, multi-turn interactions, where they retrieve external information, adapt to observations, and answer interdependent queries. Yet, most LLM systems rely on full-context prompting, appending all past turns regardless of their rel…

Cited by 0SourcecodeScholar
2026

MineDraft: A Framework for Batch Parallel Speculative Decoding

ICML 2026poster

Speculative decoding (SD) accelerates large language model inference by using a smaller draft model to propose draft tokens that are subsequently verified by a larger target model. However, the performance of standard SD is often limited by the strictly sequential execution of these drafting and ver…

Cited by 0SourceScholar
2025

Group-robust Sample Reweighting for Subpopulation Shifts via Influence Functions

ICLR 2025poster

Machine learning models often have uneven performance among subpopulations (a.k.a., groups) in the data distributions. This poses a significant challenge for the models to generalize when the proportions of the groups shift during deployment. To improve robustness to such shifts, existing approaches…

2025

Incentivizing Time-Aware Fairness in Data Sharing

NeurIPS 2025poster

In collaborative data sharing and machine learning, multiple parties aggregate their data resources to train a machine learning model with better model performance. However, as the parties incur data collection costs, they are only willing to do so when guaranteed incentives, such as fairness and i…

Cited by 0SourceScholar
2025

Paid with Models: Optimal Contract Design for Collaborative Machine Learning

AAAI 2025technical

Collaborative machine learning (CML) provides a promising paradigm for democratizing advanced technologies by enabling cost-sharing among participants. However, the potential for rent-seeking behaviors among parties can undermine such collaborations. Contract theory presents a viable solution by rew…

Cited by 0SourcePDFScholar
2025

TETRIS: Optimal Draft Token Selection for Batch Speculative Decoding

ACL 2025long

We propose TETRIS, a novel method that optimizes the total throughput of batch speculative decoding in multi-request settings. Unlike existing methods that optimize for a single request or a group of requests as a whole, TETRIS actively selects the most promising draft tokens (for every request in a…

Cited by 0SourcePDFScholar
2025

Uncovering Scaling Laws for Large Language Models via Inverse Problems

EMNLP 2025

Large Language Models (LLMs) are large-scale pretrained models that have achieved remarkable success across diverse domains. These successes have been driven by unprecedented complexity and scale in both data and computations. However, due to the high costs of training such models, brute-force trial

Cited by 0SourcePDFScholar
2024

Incentive-Aware Federated Learning with Training-Time Model Rewards

ICLR 2024poster

In federated learning (FL), incentivizing contributions of training resources (e.g., data, compute) from potentially competitive clients is crucial. Existing incentive mechanisms often distribute post-training monetary rewards, which suffer from practical challenges of timeliness and feasibility of…

Cited by 4SourcePDFScholar
2024

Localized Zeroth-Order Prompt Optimization

NeurIPS 2024spotlight

The efficacy of large language models (LLMs) in understanding and generating natural language has aroused a wide interest in developing prompt-based methods to harness the power of black-box LLMs. Existing methodologies usually prioritize a global optimization for finding the global optimum, which h…

Cited by 14SourcePDFScholar
2024

Position Paper: Data-Centric AI in the Age of Large Language Models

EMNLP 2024finding

This position paper proposes a data-centric viewpoint of AI research, focusing on large language models (LLMs). We start by making a key observation that data is instrumental in the developmental (e.g., pretraining and fine-tuning) and inferential stages (e.g., in-context learning) of LLMs, and advo…

Cited by 1SourcePDFScholar
2024

Prompt Optimization with EASE? Efficient Ordering-aware Automated Selection of Exemplars

NeurIPS 2024poster

Large language models (LLMs) have shown impressive capabilities in real-world applications. The capability of *in-context learning* (ICL) allows us to adapt an LLM to downstream tasks by including input-label exemplars in the prompt without model fine-tuning. However, the quality of these exemplars…

2024

Use Your INSTINCT: INSTruction optimization for LLMs usIng Neural bandits Coupled with Transformers

ICML 2024poster

Large language models (LLMs) have shown remarkable instruction-following capabilities and achieved impressive performances in various applications. However, the performances of LLMs depend heavily on the instructions given to them, which are typically manually tuned with substantial human efforts. R…

2023

FAIR: Fair Collaborative Active Learning with Individual Rationality for Scientific Discovery

AISTATS 2023poster

Scientific discovery aims to find new patterns and test specific hypotheses by analysing large-scale experimental data. However, various practical limitations (e.g., high experimental costs or the inability to perform some experiments) make it challenging for researchers to collect sufficient experi…

Cited by 15SourcePDFScholar
2022

DAVINZ: Data Valuation using Deep Neural Networks at Initialization

ICML 2022spotlight

Recent years have witnessed a surge of interest in developing trustworthy methods to evaluate the value of data in many real-world applications (e.g., collaborative machine learning, data marketplaces). Existing data valuation methods typically valuate data using the generalization performance of co…

Cited by 68SourcePDFScholar
2022

Unifying and Boosting Gradient-Based Training-Free Neural Architecture Search

NeurIPS 2022accept

Neural architecture search (NAS) has gained immense popularity owing to its ability to automate neural architecture design. A number of training-free metrics are recently proposed to realize NAS without training, hence making NAS more scalable. Despite their competitive empirical performances, a uni…

2021

Trusted-maximizers entropy search for efficient Bayesian optimization

UAI 2021poster

Information-based Bayesian optimization (BO) algorithms have achieved state-of-the-art performance in optimizing a black-box objective function. However, they usually require several approximations or simplifying assumptions (without clearly understanding their effects on the BO performance) and/or…

2021

Validation Free and Replication Robust Volume-based Data Valuation

NeurIPS 2021poster

Data valuation arises as a non-trivial challenge in real-world use cases such as collaborative machine learning, federated learning, trusted data sharing, data marketplaces. The value of data is often associated with the learning performance (e.g., validation accuracy) of a model trained on the data…

Cited by 81SourcePDFScholar