Skip to content
conftrace_

Tengyang Xie

21 papers · 2018–2025 · 6 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Jump to papers ↓
+7 more ↓ πŸ—ΊοΈ Taxonomy Completionist (29) πŸƒ Academic Marathon Β· Sprint 🌍 Conference Polyglot Β· Silver πŸŒ‰ Interdisciplinary Bridge Β· Silver 🐣 Hot Topic Early Bird
🀝 Dynamic Duo (10) ⚑ Prolific Year Β· Productive πŸ”₯ Unstoppable Β· Bronze ❓ The Questioner πŸ’Ž Century Club Β· Bronze πŸ“ˆ Trend Setter πŸ—ƒοΈ Keyword Collector (90)

Papers

Correcting the Mythos of KL-Regularization: Direct Alignment without Overoptimization via Chi-Squared Preference Optimization ICLR 2025 Do We Need to Verify Step by Step? Rethinking Process Supervision from a Theoretical Perspective ICML 2025 Exploratory Preference Optimization: Harnessing Implicit Q*-Approximation for Sample-Efficient RLHF ICLR 2025 Reinforce LLM Reasoning through Multi-Agent Reflection ICML 2025 CounterCurate: Enhancing Physical and Semantic Visio-Linguistic Compositional Reasoning via Counterfactual Examples ACL 2024 Harnessing Density Ratios for Online Reinforcement Learning ICLR 2024 Interpretable Preferences via Multi-Objective Reward Modeling and Mixture-of-Experts EMNLP 2024 Preference Fine-Tuning of LLMs Should Leverage Suboptimal, On-Policy Data ICML 2024 Towards Principled Representation Learning from Videos for Reinforcement Learning ICLR 2024 Adversarial Model for Offline Reinforcement Learning NeurIPS 2023 The Role of Coverage in Online Reinforcement Learning ICLR 2023 Adversarially Trained Actor Critic for Offline Reinforcement Learning ICML 2022 Interaction-Grounded Learning with Action-Inclusive Feedback NeurIPS 2022 Batch Value-function Approximation with Only Realizability ICML 2021 Bellman-consistent Pessimism for Offline Reinforcement Learning NeurIPS 2021 Interaction-Grounded Learning ICML 2021 Policy Finetuning: Bridging Sample-Efficient Offline and Online Reinforcement Learning NeurIPS 2021 Q* Approximation Schemes for Batch Reinforcement Learning: A Theoretical Comparison UAI 2020 Provably Efficient Q-Learning with Low Switching Cost NeurIPS 2019 Towards Optimal Off-Policy Evaluation for Reinforcement Learning with Marginalized Importance Sampling NeurIPS 2019 A Block Coordinate Ascent Algorithm for Mean-Variance Optimization NeurIPS 2018