conftrace_

Yuting Wei

27 papers · 2017–2025 · 10 conferences · across top CS/AI conferences

Achievements

Jump to papers ↓
+11 more ↓ 🧭 Keyword Pioneer 🌍 Conference Polyglot (10) πŸŒ‰ Interdisciplinary Bridge πŸ—ΊοΈ Taxonomy Completionist (10) πŸƒ Academic Marathon (8)
πŸƒ Academic Marathon (8) 🐝 Cross-Pollinator (4) 🌈 Renaissance Researcher (7) 🀝 Dynamic Duo (13) πŸ‘‘ Triple Crown πŸ† Grand Slam πŸ“ˆ Trend Setter πŸ”₯ Unstoppable (6) πŸ—ƒοΈ Keyword Collector (100) πŸ’Ž Century Club (27) ⚑ Prolific Year (6)

Conferences

NIPS (10) ICML (6) AISTATS (2) EMNLP (2) JMLR (2) AAAI (1) ACL (1) COLT (1) ICLR (1) IJCAI (1)

Papers

TEACH: A Contrastive Knowledge Adaptive Distillation Framework for Classical Chinese Understanding ACL 2025 Learning Causally Disentangled Representations for Fair Personality Detection IJCAI 2025 Actor-Critics Can Achieve Optimal Sample Efficiency ICML 2025 Towards a mathematical theory for consistency training in diffusion models AISTATS 2025 Debiasing Evaluations That Are Biased by Evaluations JMLR 2024 Hybrid Reinforcement Learning Breaks Sample Size Barriers In Linear MDPs NIPS 2024 Federated Natural Policy Gradient and Actor Critic Methods for Multi-task Reinforcement Learning NIPS 2024 AC-EVAL: Evaluating Ancient Chinese Language Understanding in Large Language Models EMNLP 2024 Exploring Question Guidance and Answer Calibration for Visually Grounded Video Question Answering EMNLP 2024 Towards Non-Asymptotic Convergence for Diffusion-Based Generative Models ICLR 2024 Accelerating Convergence of Score-Based Diffusion Models, Provably ICML 2024 Theoretical insights for diffusion guidance: A case study for Gaussian mixture models ICML 2024 Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization JMLR 2024 The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model NIPS 2023 Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model NIPS 2022 Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity ICML 2022 Uniform Consistency of Cross-Validation Estimators for High-Dimensional Ridge Regression AISTATS 2021 Softmax Policy Gradient Methods Can Take Exponential Time to Converge COLT 2021 Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization NIPS 2021 Tightening the Dependence on Horizon in the Sample Complexity of Q-Learning ICML 2021 Debiasing Evaluations That Are Biased by Evaluations AAAI 2021 Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting NIPS 2021 Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model NIPS 2020 Sharp Statistical Guaratees for Adversarially Robust Gaussian Classification ICML 2020 Randomized tests for high-dimensional regression: A more efficient and powerful solution NIPS 2020 Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction NIPS 2020 Early stopping for kernel boosting algorithms: A general analysis with localized complexities NIPS 2017