Skip to content
conftrace_

Ming Yin

49 papers · 2015–2026 · 14 venues · across top CS/AI venues

This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 15 separate collaboration groups - the largest holds only 45% of them. Pick the group below that matches the researcher you mean. How a shared name is split.

Achievements are not shown for a combined profile - each one describes a single researcher's record, which this is not.

Which Ming Yin?

6 groups of papers that share co-authors internally but none with each other - each most likely a different researcher. Pick one to see its papers.

with Yu-Xiang Wang, Mengdi Wang, Songtao Feng 22 papers · 2020–2025 · NeurIPS, ICML, UAI Hide ▲
MATH-Perturb: Benchmarking LLMs’ Math Reasoning Abilities against Hard Perturbations ICML 2025 Rates for Offline Reinforcement Learning with Adaptively Collected Data L4DC 2025 A Theoretical Perspective for Speculative Decoding Algorithm NeurIPS 2024 Fast Best-of-N Decoding via Speculative Rejection NeurIPS 2024 Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games ICML 2024 NetworkGym: Reinforcement Learning Environments for Multi-Access Traffic Management in Network Simulation NeurIPS 2024 Offline Multitask Representation Learning for Reinforcement Learning NeurIPS 2024 Transfer Q-star : Principled Decoding for LLM Alignment NeurIPS 2024 No-Regret Linear Bandits beyond Realizability UAI 2023 Non-stationary Reinforcement Learning under General Function Approximation ICML 2023 Offline Reinforcement Learning with Closed-Form Policy Improvement Operators ICML 2023 Offline Reinforcement Learning with Differentiable Function Approximation is Provably Efficient ICLR 2023 On Instance-Dependent Bounds for Offline Reinforcement Learning with Linear Function Approximation AAAI 2023 Posterior Sampling with Delayed Feedback for Reinforcement Learning with Linear Function Approximation NeurIPS 2023 Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimism ICLR 2022 Offline stochastic shortest path: Learning, evaluation and towards optimality UAI 2022 Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost ICML 2022 Near-Optimal Offline Reinforcement Learning via Double Variance Reduction NeurIPS 2021 Near-Optimal Provable Uniform Convergence in Offline Policy Evaluation for Reinforcement Learning AISTATS 2021 Optimal Uniform OPE and Model-based Offline Reinforcement Learning in Time-Homogeneous, Reward-Free and Task-Agnostic Settings NeurIPS 2021 Towards Instance-Optimal Offline Reinforcement Learning with Pessimism NeurIPS 2021 Asymptotically Efficient Off-Policy Evaluation for Tabular Reinforcement Learning AISTATS 2020
9 papers whose co-authors appear nowhere else under this name
Align When They Want, Complement When They Need! Human-Centered Ensembles for Adaptive Human-AI Collaboration AAAI 2026 Assessing Automated Fact-Checking for Medical LLM Responses with Knowledge Graphs AAAI 2026 NumCoKE: Ordinal-Aware Numerical Reasoning over Knowledge Graphs with Mixture-of-Experts and Contrastive Learning AAAI 2026 K-hop Hypergraph Neural Network: A Comprehensive Aggregation Approach AAAI 2025 Memory-Augmented SAM2 for Training-Free Surgical Video Segmentation MICCAI 2025 Learning the Target Network in Function Space ICML 2024 Accounting for Confirmation Bias in Crowdsourced Label Aggregation IJCAI 2021 Exploring the Effects of Goal Setting When Training for Complex Crowdsourcing Tasks (Extended Abstract) IJCAI 2021 Bonus or Not? Learn to Reward in Crowdsourcing IJCAI 2015

Venues · all papers under this name

NeurIPS (10) AAAI (8) ICML (7) IJCAI (6) EMNLP (4) AISTATS (2) CVPR (2) ICLR (2) NAACL (2) UAI (2) ACL (1) ICCV (1) L4DC (1) MICCAI (1)