Tengyang Xie

According to our database1, Tengyang Xie authored at least 35 papers between 2018 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Understanding Behavior Cloning with Action Quantization.
CoRR, March, 2026

Breaking the Capability Ceiling of LLM Post-Training by Reintroducing Markov States.
CoRR, March, 2026

POLCA: Stochastic Generative Optimization with LLM.
CoRR, March, 2026

2025
Offline Reinforcement Learning in Large State Spaces: Algorithms and Guarantees.
CoRR, October, 2025

Trajectory Bellman Residual Minimization: A Simple Value-Based Method for LLM Reasoning.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Outcome-Based Online Reinforcement Learning: Algorithms and Fundamental Limits.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Reinforce LLM Reasoning through Multi-Agent Reflection.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

Do We Need to Verify Step by Step? Rethinking Process Supervision from a Theoretical Perspective.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

Exploratory Preference Optimization: Harnessing Implicit Q*-Approximation for Sample-Efficient RLHF.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

Correcting the Mythos of KL-Regularization: Direct Alignment without Overoptimization via Chi-Squared Preference Optimization.
Proceedings of the Thirteenth International Conference on Learning Representations, 2025

2024
Self-Play with Adversarial Critic: Provable and Scalable Offline Alignment for Language Models.
CoRR, 2024

Direct Nash Optimization: Teaching Language Models to Self-Improve with General Preferences.
CoRR, 2024

Preference Fine-Tuning of LLMs Should Leverage Suboptimal, On-Policy Data.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Towards Principled Representation Learning from Videos for Reinforcement Learning.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Harnessing Density Ratios for Online Reinforcement Learning.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Interpretable Preferences via Multi-Objective Reward Modeling and Mixture-of-Experts.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2024, 2024

CounterCurate: Enhancing Physical and Semantic Visio-Linguistic Compositional Reasoning via Counterfactual Examples.
Proceedings of the Findings of the Association for Computational Linguistics, 2024

2023
Adversarial Model for Offline Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

The Role of Coverage in Online Reinforcement Learning.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022
ARMOR: A Model-based Framework for Improving Arbitrary Baseline Policies with Offline Data.
CoRR, 2022

Interaction-Grounded Learning with Action-Inclusive Feedback.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Adversarially Trained Actor Critic for Offline Reinforcement Learning.
Proceedings of the International Conference on Machine Learning, 2022

2021
Finite Sample Analysis of Minimax Offline Reinforcement Learning: Completeness, Fast Rates and First-Order Efficiency.
CoRR, 2021

Policy Finetuning: Bridging Sample-Efficient Offline and Online Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Bellman-consistent Pessimism for Offline Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Batch Value-function Approximation with Only Realizability.
Proceedings of the 38th International Conference on Machine Learning, 2021

Interaction-Grounded Learning.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
A Variant of the Wang-Foster-Kakade Lower Bound for the Discounted Setting.
CoRR, 2020

Q<sup>*</sup> Approximation Schemes for Batch Reinforcement Learning: A Theoretical Comparison.
CoRR, 2020

Q* Approximation Schemes for Batch Reinforcement Learning: A Theoretical Comparison.
Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

2019
Optimal Off-Policy Evaluation for Reinforcement Learning with Marginalized Importance Sampling.
CoRR, 2019

Privacy Preserving Off-Policy Evaluation.
CoRR, 2019

Towards Optimal Off-Policy Evaluation for Reinforcement Learning with Marginalized Importance Sampling.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Provably Efficient Q-Learning with Low Switching Cost.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
A Block Coordinate Ascent Algorithm for Mean-Variance Optimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018


  Loading...