Lin Yang

A²Flow: Automating Agentic Workflow Generation via Self-Adaptive Abstraction Operators AAAI 2026 ImpRIF: Stronger Implicit Reasoning Leads to Better Complex Instruction Following ACL 2026 Towards Effective and Efficient Context-aware Nucleus Detection in Histopathology Whole Slide Images AAAI 2026 MIRA: Evaluating Multimodal AI on Complex Clinical Reasoning in Interventional Radiology AAAI 2026 Transfer Q-Learning with Composite MDP Structures ICML 2025 Boosting Multi-Domain Fine-Tuning of Large Language Models through Evolving Interactions between Samples ICML 2025 Hyper: Hyperparameter Robust Efficient Exploration in Reinforcement Learning ICML 2025 Near-Optimal Regret Bounds for Federated Multi-armed Bandits with Fully Distributed Communication UAI 2025 Misspecified $Q$-Learning with Sparse Linear Function Approximation: Tight Bounds on Approximation Error ICLR 2025 PathGen-1.6M: 1.6 Million Pathology Image-text Pairs Generation through Multi-agent Collaboration ICLR 2025 Large-scale and Fine-grained Vision-language Pre-training for Enhanced CT Image Understanding ICLR 2025 Regret-Optimal List Replicable Bandit Learning: Matching Upper and Lower Bounds ICLR 2025 AEM: Attention Entropy Maximization for Multiple Instance Learning based Whole Slide Image Classification MICCAI 2025 CoCa-CXR: Contrastive Captioners Learn Strong Temporal Structures for Chest X-Ray Vision-Language Understanding MICCAI 2025 CPath-Omni: A Unified Multimodal Foundation Model for Patch and Whole Slide Image Analysis in Computational Pathology CVPR 2025 On the Model-Misspecification in Reinforcement Learning AISTATS 2024 Attention-Challenging Multiple Instance Learning for Whole Slide Image Classification ECCV 2024 PathMMU: A Massive Multimodal Expert-Level Benchmark for Understanding and Reasoning in Pathology ECCV 2024 Rethinking Transformer for Long Contextual Histopathology Whole Slide Image Analysis NIPS 2024 DPA-P2PNet: Deformable Proposal-Aware P2PNet for Accurate Point-Based Cell Detection AAAI 2024 PathAsst: A Generative Foundation AI Assistant towards Artificial General Intelligence of Pathology AAAI 2024 LLMEmbed: Rethinking Lightweight LLM’s Genuine Function in Text Classification ACL 2024 WsiCaption: Multiple Instance Generation of Pathology Reports for Gigapixel Whole-Slide Images MICCAI 2024 WSI-VQA: Interpreting Whole Slide Images by Generative Visual Question Answering ECCV 2024 Horizon-Free and Instance-Dependent Regret Bounds for Reinforcement Learning with General Function Approximation AISTATS 2024 Multi-Agent Bandit Learning through Heterogeneous Action Erasure Channels AISTATS 2024 Unleashing the Power of Prompt-driven Nucleus Instance Segmentation ECCV 2024 Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds NIPS 2023 Efficient Robust Bayesian Optimization for Arbitrary Uncertain inputs NIPS 2023 On-Demand Communication for Asynchronous Multi-Agent Bandits AISTATS 2023 Replicability in Reinforcement Learning NIPS 2023 Task-Specific Fine-Tuning via Variational Information Bottleneck for Weakly-Supervised Pathology Whole Slide Image Classification CVPR 2023 Efficient Batched Algorithm for Contextual Linear Bandits with Large Action Space via Soft Elimination NIPS 2023 Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms COLT 2023 Horizon-free Learning for Markov Decision Processes and Games: Stochastically Bounded Rewards and Improved Bounds ICML 2023 Low-Switching Policy Gradient with Exploration via Online Sensitivity Sampling ICML 2023 MetaVL: Transferring In-Context Learning Ability From Language Models to Vision-Language Models ACL 2023 Does Sparsity Help in Learning Misspecified Linear Bandits? ICML 2023 Distributed Contextual Linear Bandits with Minimax Optimal Communication Cost ICML 2023 Exploration for Free: How Does Reward Heterogeneity Improve Regret in Cooperative Multi-agent Bandits? UAI 2023 Achieving Near-Optimal Individual Regret & Low Communications in Multi-Agent Bandits ICLR 2023 Provably Efficient Lifelong Reinforcement Learning with Linear Representation ICLR 2023 Solving Multi-Arm Bandit Using a Few Bits of Communication AISTATS 2022 Explainable Survival Analysis with Convolution-Involved Vision Transformer AAAI 2022 Hybrid Curriculum Learning for Emotion Recognition in Conversation AAAI 2022 Gap-Dependent Unsupervised Exploration for Reinforcement Learning AISTATS 2022 Near-Optimal Reward-Free Exploration for Linear Mixture MDPs with Plug-in Solver ICLR 2022 Cross-Patch Dense Contrastive Learning for Semi-Supervised Segmentation of Cellular Nuclei in Histopathologic Images CVPR 2022 On Improving Model-Free Algorithms for Decentralized Multi-Agent Reinforcement Learning ICML 2022 Near-Optimal Sample Complexity Bounds for Constrained MDPs NIPS 2022 Learning from Distributed Users in Contextual Linear Bandits Without Sharing the Context NIPS 2022 Provably Feedback-Efficient Reinforcement Learning via Active Reward Learning NIPS 2022 Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs NIPS 2021 On the Value of Interaction and Function Approximation in Imitation Learning NIPS 2021 Cooperative Stochastic Bandits with Asynchronous Agents and Constrained Feedback NIPS 2021 Safe Reinforcement Learning with Linear Function Approximation ICML 2021 Provably Correct Optimization and Exploration with Non-linear Policies ICML 2021 Q-learning with Logarithmic Regret AISTATS 2021 Randomized Exploration in Reinforcement Learning with General Value Function Approximation ICML 2021 Accommodating Picky Customers: Regret Bound and Exploration Complexity for Multi-Objective Reinforcement Learning NIPS 2021 On Reward-Free Reinforcement Learning with Linear Function Approximation NIPS 2020 Model-Based Multi-Agent RL in Zero-Sum Markov Games with Near-Optimal Sample Complexity NIPS 2020 Toward the Fundamental Limits of Imitation Learning NIPS 2020 Is Plug-in Solver Sample-Efficient for Feature-based Reinforcement Learning? NIPS 2020 Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension NIPS 2020 Is Long Horizon RL More Difficult Than Short Horizon RL? NIPS 2020 Planning with General Objective Functions: Going Beyond Total Rewards NIPS 2020 Preference-based Reinforcement Learning with Finite-Time Guarantees NIPS 2020 Adversarial Bandits with Corruptions: Regret Lower Bound and No-regret Algorithm NIPS 2020 Provably Efficient Exploration for Reinforcement Learning Using Unsupervised Learning NIPS 2020 Loss-Based Attention for Deep Multiple Instance Learning AAAI 2020 An Annotation Sparsification Strategy for 3D Medical Image Segmentation via Representative Selection and Self-Training AAAI 2020 Sketching Transformed Matrices with Applications to Natural Language Processing AISTATS 2020 Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity AISTATS 2020 Model-Based Reinforcement Learning with Value-Targeted Regression ICML 2020 Nearly Linear Row Sampling Algorithm for Quantile Regression ICML 2020 Obtaining Adjustable Regularization for Free via Iterate Averaging ICML 2020 Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound ICML 2020 Model-Based Reinforcement Learning with Value-Targeted Regression L4DC 2020 Sample-Optimal Parametric Q-Learning Using Linearly Additive Features ICML 2019 Reducing Uncertainty in Undersampled MRI Reconstruction With Active Acquisition CVPR 2019 The LeVoice Far-Field Speech Recognition System for VOiCES from a Distance Challenge 2019 INTERSPEECH 2019 On Constrained Nonconvex Stochastic Optimization: A Case Study for Generalized Eigenvalue Decomposition AISTATS 2019 A New Ensemble Learning Framework for 3D Biomedical Image Segmentation AAAI 2019 Biomedical Image Segmentation via Representative Annotation AAAI 2019 SPDA: Superpixel-based Data Augmentation for Biomedical Image Segmentation MIDL 2019 Online Factorization and Partition of Complex Networks by Random Walk UAI 2019 Efficient Symmetric Norm Regression via Linear Sketching NIPS 2019 The Physical Systems Behind Optimization Algorithms NIPS 2018 Super Characters: A Conversion from Sentiment Classification to Image Classification EMNLP 2018 Near-Optimal Time and Sample Complexities for Solving Markov Decision Processes with a Generative Model NIPS 2018 Translating and Segmenting Multimodal Medical Volumes With Cycle- and Shape-Consistency Generative Adversarial Network CVPR 2018 Quantization of Fully Convolutional Networks for Accurate Biomedical Image Segmentation CVPR 2018 Photographic Text-to-Image Synthesis With a Hierarchically-Nested Adversarial Network CVPR 2018 Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order ICML 2018 Dimensionality Reduction for Stationary Time Series via Stochastic Nonconvex Optimization NIPS 2018 On Quadratic Convergence of DC Proximal Newton Algorithm in Nonconvex Sparse Learning NIPS 2017 MDNet: A Semantically and Visually Interpretable Medical Image Diagnosis Network CVPR 2017 Combining Fully Convolutional and Recurrent Neural Networks for 3D Biomedical Image Segmentation NIPS 2016 SemiContour: A Semi-Supervised Learning Approach for Contour Detection CVPR 2016 Fine-Grained Histopathological Image Analysis via Robust Segmentation and Large-Scale Retrieval CVPR 2015