← Search

Ying Sheng

11 accepted papers

2026

SWINGARENA: Adversarial Programming Arena for Long-context GitHub Issue Solving

ICLR 2026oral

We present \textsc{SwingArena}, a adversarial evaluation framework for Large Language Models (LLMs) that closely mirrors real-world software development workflows. Unlike traditional static benchmarks, \textsc{SwingArena} models the collaborative process of software iteration by pairing LLMs as \tex…

Cited by 0SourcecodeScholar
2025

SORRY-Bench: Systematically Evaluating Large Language Model Safety Refusal

ICLR 2025poster

Evaluating aligned large language models' (LLMs) ability to recognize and reject unsafe user requests is crucial for safe, policy-compliant deployments. Existing evaluation efforts, however, face three limitations that we address with **SORRY-Bench**, our proposed benchmark. **First**, existing meth…

2024

Chatbot Arena: An Open Platform for Evaluating LLMs by Human Preference

ICML 2024poster

Large Language Models (LLMs) have unlocked new capabilities and applications; however, evaluating the alignment with human preferences still poses significant challenges. To address this issue, we introduce Chatbot Arena, an open platform for evaluating LLMs based on human preferences. Our methodolo…

Cited by 554SourcePDFScholar
2024

LMSYS-Chat-1M: A Large-Scale Real-World LLM Conversation Dataset

ICLR 2024spotlight

Studying how people interact with large language models (LLMs) in real-world scenarios is increasingly important due to their widespread use in various applications. In this paper, we introduce LMSYS-Chat-1M, a large-scale dataset containing one million real-world conversations with 25 state-of-the-…

2024

SGLang: Efficient Execution of Structured Language Model Programs

NeurIPS 2024poster

Large language models (LLMs) are increasingly used for complex tasks that require multiple generation calls, advanced prompting techniques, control flow, and structured inputs/outputs. However, efficient systems are lacking for programming and executing these applications. We introduce SGLang, a sys…

2023

FlexGen: High-Throughput Generative Inference of Large Language Models with a Single GPU

ICML 2023oral

The high computational and memory requirements of large language model (LLM) inference make it feasible only with multiple high-end accelerators. Motivated by the emerging demand for latency-insensitive tasks with batched processing, this paper initiates the study of high-throughput LLM inference us…

2023

H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models

NeurIPS 2023poster

Large Language Models (LLMs), despite their recent impressive accomplishments, are notably cost-prohibitive to deploy, particularly for applications involving long-content generation, such as dialogue systems and story writing. Often, a large amount of transient state information, referred to as the…

2023

Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena

NeurIPS 2023poster

Evaluating large language model (LLM) based chat assistants is challenging due to their broad capabilities and the inadequacy of existing benchmarks in measuring human preferences. To address this, we explore using strong LLMs as judges to evaluate these models on more open-ended questions. We exami…

2023

Towards Optimal Caching and Model Selection for Large Model Inference

NeurIPS 2023poster

Large Language Models (LLMs) and other large foundation models have achieved impressive results, but their size exacerbates existing resource consumption and latency challenges. In particular, the large-scale deployment of these models is hindered by the significant resource requirements during infe…

Cited by 7SourcePDFScholar
2021

Politeness for the Theory of Algebraic Datatypes (Extended Abstract)

IJCAI 2021poster

Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its latest stable version, the SMT-LIB standard defines a theory of algebraic datatypes, which is currently supported by several mainstream SMT…

Cited by 0SourcePDFScholar
2018

Subspace Embedding and Linear Regression with Orlicz Norm

ICML 2018oral

We consider a generalization of the classic linear regression problem to the case when the loss is an Orlicz norm. An Orlicz norm is parameterized by a non-negative convex function G: R_+ - > R_+ with G(0) = 0: the Orlicz norm of a n-dimensional vector x is defined as |x|_G = inf{ alpha > 0 | sum_{i…

Cited by 40SourcePDFScholar