Tian Wang
2026
OPeRA: A Dataset of Observation, Persona, Rationale, and Action for Evaluating LLMs on Human Online Shopping Behavior Simulation
Ziyi Wang | Yuxuan Lu | Wenbo Li | Amirali Amini | Bo Sun | Yakov Bart | Weimin Lyu | Jiri Gesi | Tian Wang | Jing Huang | Yu Su | Upol Ehsan | Malihe Alikhani | Toby Jia-Jun Li | Lydia Chilton | Dakuo Wang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Ziyi Wang | Yuxuan Lu | Wenbo Li | Amirali Amini | Bo Sun | Yakov Bart | Weimin Lyu | Jiri Gesi | Tian Wang | Jing Huang | Yu Su | Upol Ehsan | Malihe Alikhani | Toby Jia-Jun Li | Lydia Chilton | Dakuo Wang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Can Large Language models (LLMs) accurately simulate the next web action of a specific user? While LLMs have shown promising capabilities in generating believable human behaviors, evaluating their ability to mimic real user behaviors remains an open challenge, largely due to the lack of high-quality, publicly available datasets that capture both the observable actions and the internal reasoning of an actual human user. To address this gap, we introduce OPeRA, a novel dataset of Observation, Persona, Rationale, and Action collected from real human participants during online shopping sessions. **OPeRA is the first public dataset that comprehensively captures: user personas, browser observations, fine-grained web actions, and self-reported just-in-time rationales**. We developed both an online questionnaire and a custom browser plugin to gather this dataset with high fidelity. Using OPeRA, we establish **the first benchmark to evaluate how well current LLMs can predict a specific user’s next action** and rationale with a given persona and <observation, action, rationale> history. This dataset lays the groundwork for future research into LLM agents that aim to act as personalized digital twins for human.
CODERL+: Improving Code Generation via Reinforcement with Execution Semantics Alignment
Xue Jiang | Yihong Dong | Mengyang Liu | Deng Hongyi | Tian Wang | Yongding Tao | Zhi Jin | Wenpin Jiao | Ge Li
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Xue Jiang | Yihong Dong | Mengyang Liu | Deng Hongyi | Tian Wang | Yongding Tao | Zhi Jin | Wenpin Jiao | Ge Li
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
While Large Language Models (LLMs) excel at code generation by learning from vast code corpora, a fundamental semantic gap remains between their training on textual patterns and the goal of functional correctness, which is governed by formal execution semantics. Reinforcement Learning with Verifiable Rewards (RLVR) approaches attempt to bridge this gap using outcome rewards from executing test cases. However, solely relying on binary pass/fail signals is inefficient for establishing a well-aligned connection between the textual representation of code and its execution semantics, especially for subtle logical errors within the code. In this paper, we propose CODERL+, a novel approach that integrates execution semantics alignment into the RLVR training pipeline for code generation. CODERL+ enables the model to infer variable-level execution trajectory, providing a direct learning signal of execution semantics. CODERL+ can construct execution semantics alignment directly using existing on-policy rollouts and integrates seamlessly with various RL algorithms. Extensive experiments demonstrate that CODERL+ outperforms post-training baselines (including RLVR and Distillation), achieving a 4.6% average relative improvement in pass@1. CODERL+ generalizes effectively to other coding tasks, yielding 15.5% and 4.4% higher accuracy on code-reasoning and test-output-generation benchmarks, respectively. CODERL+ shows strong applicability across diverse RL algorithms and LLMs. Furthermore, probe analyses provide compelling evidence that CODERL+ strengthens the alignment between code’s textual representations and its underlying execution semantics.
2025
InfoPO: On Mutual Information Maximization for Large Language Model Alignment
Teng Xiao | Zhen Ge | Sujay Sanghavi | Tian Wang | Julian Katz-Samuels | Marc Versage | Qingjun Cui | Trishul Chilimbi
Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers)
Teng Xiao | Zhen Ge | Sujay Sanghavi | Tian Wang | Julian Katz-Samuels | Marc Versage | Qingjun Cui | Trishul Chilimbi
Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers)
We study the post-training of large language models (LLMs) with human preference data. Recently, direct preference optimization and its variants have shown considerable promise in aligning language models, eliminating the need for reward models and online sampling. Despite these benefits, these methods rely on explicit assumptions about the Bradley-Terry (BT) model, which makes them prone to overfitting and results in suboptimal performance, particularly on reasoning-heavy tasks. To address these challenges, we propose a principled preference fine-tuning algorithm called InfoPO, which effectively and efficiently aligns large language models using preference data. InfoPO eliminates the reliance on the BT model and prevents the likelihood of the chosen response from decreasing. Extensive experiments confirm that InfoPO consistently outperforms established baselines on widely used open benchmarks, particularly in reasoning tasks.
2020
Item-based Collaborative Filtering with BERT
Tian Wang | Yuyangzi Fu
Proceedings of the 3rd Workshop on e-Commerce and NLP
Tian Wang | Yuyangzi Fu
Proceedings of the 3rd Workshop on e-Commerce and NLP
In e-commerce, recommender systems have become an indispensable part of helping users explore the available inventory. In this work, we present a novel approach for item-based collaborative filtering, by leveraging BERT to understand items, and score relevancy between different items. Our proposed method could address problems that plague traditional recommender systems such as cold start, and “more of the same” recommended content. We conducted experiments on a large-scale real-world dataset with full cold-start scenario, and the proposed approach significantly outperforms the popular Bi-LSTM model.
2019
Mimic and Rephrase: Reflective Listening in Open-Ended Dialogue
Justin Dieter | Tian Wang | Arun Tejasvi Chaganty | Gabor Angeli | Angel X. Chang
Proceedings of the 23rd Conference on Computational Natural Language Learning (CoNLL)
Justin Dieter | Tian Wang | Arun Tejasvi Chaganty | Gabor Angeli | Angel X. Chang
Proceedings of the 23rd Conference on Computational Natural Language Learning (CoNLL)
Reflective listening–demonstrating that you have heard your conversational partner–is key to effective communication. Expert human communicators often mimic and rephrase their conversational partner, e.g., when responding to sentimental stories or to questions they don’t know the answer to. We introduce a new task and an associated dataset wherein dialogue agents similarly mimic and rephrase a user’s request to communicate sympathy (I’m sorry to hear that) or lack of knowledge (I do not know that). We study what makes a rephrasal response good against a set of qualitative metrics. We then evaluate three models for generating responses: a syntax-aware rule-based system, a seq2seq LSTM neural models with attention (S2SA), and the same neural model augmented with a copy mechanism (S2SA+C). In a human evaluation, we find that S2SA+C and the rule-based system are comparable and approach human-generated response quality. In addition, experiences with a live deployment of S2SA+C in a customer support setting suggest that this generation task is a practical contribution to real world conversational agents.
2016
Search
Fix author
Co-authors
- Malihe Alikhani 1
- Amirali Amini 1
- Gabor Angeli 1
- Yakov Bart 1
- Arun Tejasvi Chaganty 1
- Angel Chang 1
- Trishul Chilimbi 1
- Lydia Chilton 1
- Kyunghyun Cho 1
- Qingjun Cui 1
- Justin Dieter 1
- Yihong Dong 1
- Upol Ehsan 1
- Yuyangzi Fu 1
- Zhen Ge 1
- Jiri Gesi 1
- Deng Hongyi 1
- Jing Huang 1
- Xue Jiang 1
- Wenpin Jiao 1
- Zhi Jin 1
- Julian Katz-Samuels 1
- Ge Li 1
- Toby Jia-Jun Li 1
- Wenbo Li 1
- Mengyang Liu 1
- Yuxuan Lu 1
- Weimin Lyu 1
- Sujay Sanghavi 1
- Yu Su 1
- Bo Sun 1
- Yongding Tao 1
- Marc Versage 1
- Dakuo Wang 1
- Ziyi Wang 1
- Teng Xiao 1