Skip to content
conftrace_

Haibo Yang

16 papers · 2021–2025 · 9 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 ↓
+6 more ↓ 🐣 Hot Topic Early Bird 🌍 Conference Polyglot · Silver 🌉 Interdisciplinary Bridge · Bronze 🗺️ Taxonomy Completionist (23) 🤝 Dynamic Duo (11)
🏆 Grand Slam 🤝 Dynamic Duo (11) ⚡ Prolific Year · Productive 💎 Century Club · Bronze 🗃️ Keyword Collector (58) 🔥 Unstoppable · Bronze

Papers

Achieving Dimension-Free Communication in Federated Learning via Zeroth-Order Optimization ICLR 2025 DisDiff: Disentanglement Diffusion Network for MR Imaging Translation MICCAI 2025 FAST: A Lightweight Mechanism Unleashing Arbitrary Client Participation in Federated Learning IJCAI 2025 PSMGD: Periodic Stochastic Multi-Gradient Descent for Fast Multi-Objective Optimization AAAI 2025 STIMULUS: Achieving Fast Convergence and Low Sample Complexity in Stochastic Multi-Objective Learning UAI 2025 DreamMesh: Jointly Manipulating and Texturing Triangle Meshes for Text-to-3D Generation ECCV 2024 Finite-Time Convergence and Sample Complexity of Actor-Critic Multi-Objective Reinforcement Learning ICML 2024 Understanding Server-Assisted Federated Learning in the Presence of Incomplete Client Participation ICML 2024 VP3D: Unleashing 2D Visual Prompt for Text-to-3D Generation CVPR 2024 Federated Multi-Objective Learning NeurIPS 2023 Anarchic Federated Learning ICML 2022 Decentralized Learning for Overparameterized Problems: A Multi-Agent Kernel Approximation Approach ICLR 2022 SAGDA: Achieving O(ε^-2) Communication Complexity in Federated Min-Max Learning NeurIPS 2022 Taming Fat-Tailed (“Heavier-Tailed” with Potentially Infinite Variance) Noise in Federated Learning NeurIPS 2022 Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated Learning ICLR 2021 STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated Learning NeurIPS 2021