← Search

Jennifer Neville

18 accepted papers

2026

Flipping the Dialogue: Training and Evaluating User Language Models

ICLR 2026poster

Conversations with LMs involve two participants: a human user leading the conversation, and an LM assistant responding to the user's request. To satisfy this specific role, LMs are post-trained to be helpful assistants - optimized to produce exhaustive and well-structured responses, often free of am…

Cited by 0SourceScholar
2026

Reasoning about Reasoning: BAPO Bounds on Chain-of-Thought Token Complexity in LLMs

ICML 2026poster

Inference-time scaling via chain-of-thought (CoT) reasoning is a major driver of state-of-the-art LLM performance, but it comes with substantial latency and compute costs. We address a fundamental theoretical question: *how many* reasoning tokens are required to solve a problem as input size grows? …

Cited by 0SourceScholar
2025

GenTool: Enhancing Tool Generalization in Language Models through Zero-to-One and Weak-to-Strong Simulation

ACL 2025finding

Large Language Models (LLMs) can enhance their capabilities as AI assistants by integrating external tools, allowing them to access a wider range of information. While recent LLMs are typically fine-tuned with tool usage examples during supervised fine-tuning (SFT), questions remain about their abil…

Cited by 0SourcePDFScholar
2025

Lost in Transmission: When and Why LLMs Fail to Reason Globally

NeurIPS 2025spotlight

Despite their many successes, transformer-based large language models (LLMs) continue to struggle with tasks that require complex reasoning over large parts of their input. We argue that these failures arise due to capacity limits on the accurate flow of information within LLMs. To formalize this is…

Cited by 0SourceScholar
2025

Node Similarities under Random Projections: Limits and Pathological Cases

ICLR 2025poster

Random Projections have been widely used to generate embeddings for various graph learning tasks due to their computational efficiency. The majority of applications have been justified through the Johnson-Lindenstrauss Lemma. In this paper, we take a step further and investigate how well dot product…

Cited by 0SourcePDFScholar
2024

Automatic Pair Construction for Contrastive Post-training

NAACL 2024findings

Alignment serves as an important step to steer large language models (LLMs) towards human preferences. In this paper, we propose an automatic way to construct contrastive data for LLM, using preference pairs from multiple models of varying strengths (e.g., InstructGPT, ChatGPT and GPT-4). We compare…

2024

Interpretable User Satisfaction Estimation for Conversational Systems with Large Language Models

ACL 2024long

Accurate and interpretable user satisfaction estimation (USE) is critical for understanding, evaluating, and continuously improving conversational systems. Users express their satisfaction or dissatisfaction with diverse conversational patterns in both general-purpose (ChatGPT and Bing Copilot) and…

2024

On Overcoming Miscalibrated Conversational Priors in LLM-based ChatBots

UAI 2024poster

We explore the use of Large Language Model (LLM-based) chatbots to power recommender systems. We observe that the chatbots respond poorly when they encounter under-specified requests (e.g., they make incorrect assumptions, hedge with a long response, or refuse to answer). We conjecture that such mi…

Cited by 4SourcePDFScholar
2024

S3-DST: Structured Open-Domain Dialogue Segmentation and State Tracking in the Era of LLMs

ACL 2024findings

Traditional Dialogue State Tracking (DST) has focused on tracking preferences and intents in conversations centered around specific tasks (e.g. booking services). These conventional systems assume a relatively restricted conversation flow in which each turn gradually offers new information. However,…

Cited by 5SourcePDFScholar
2024

Symbolic Prompt Program Search: A Structure-Aware Approach to Efficient Compile-Time Prompt Optimization

EMNLP 2024finding

In many modern LLM applications, such as retrieval augmented generation, prompts have become programs themselves. In these settings, prompt programs are repeatedly called with different user queries or data instances. A big practical challenge is optimizing such prompt programs. Recent work has most…

2023

Hindsight Learning for MDPs with Exogenous Inputs

ICML 2023poster

Many resource management problems require sequential decision-making under uncertainty, where the only uncertainty affecting the decision outcomes are exogenous variables outside the control of the decision-maker. We model these problems as Exo-MDPs (Markov Decision Processes with Exogenous Inputs)…

2021

A Collective Learning Framework to Boost GNN Expressiveness for Node Classification

ICML 2021spotlight

Collective Inference (CI) is a procedure designed to boost weak relational classifiers, specially for node classification tasks. Graph Neural Networks (GNNs) are strong classifiers that have been used with great success. Unfortunately, most existing practical GNNs are not most-expressive (universal)…

Cited by 25SourcePDFScholar
2021

Adversarial Graph Augmentation to Improve Graph Contrastive Learning

NeurIPS 2021poster

Self-supervised learning of graph neural networks (GNN) is in great need because of the widespread label scarcity issue in real-world graph/network data. Graph contrastive learning (GCL), by training GNNs to maximize the correspondence between the representations of the same graph in its different a…

Cited by 408SourcePDFScholar
2018

Goodness-of-Fit Testing for Discrete Distributions via Stein Discrepancy

ICML 2018oral

Recent work has combined Stein’s method with reproducing kernel Hilbert space theory to develop nonparametric goodness-of-fit tests for un-normalized probability distributions. However, the currently available tests apply exclusively to distributions with smooth density functions. In this work, we i…

Cited by 74SourcePDFScholar