Longbo Huang
45 papers · 2017–2025 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+12 more ↓ Show less ↑
π§ Keyword Pioneer πΊοΈ Taxonomy Completionist (13) π Interdisciplinary Bridge π Renaissance Researcher (5) π Conference Polyglot (6)
π§
Keyword Pioneer
π
Academic Marathon
(8)
π
Interdisciplinary Bridge
π
Keyword Champion
(2)
π
Grand Slam
π
Triple Crown
ποΈ
Keyword Collector
(147)
β‘
Prolific Year
(9)
π
Conference Pioneer
π
Century Club
(45)
π₯
Unstoppable
(9)
β
The Questioner
(2)
Conferences
NIPS (13)
ICLR (11)
ICML (11)
AAAI (5)
IJCAI (4)
UAI (1)
Top co-authors
Keywords
regret bound
(11)
multi-armed bandit
(8)
stochastic optimization
(4)
reinforcement learning
(4)
online learning
(4)
adversarial learning
(3)
softmax operator
(2)
model compression
(2)
markov decision process
(2)
stochastic process
(2)
sample complexity
(2)
representation learning
(2)
online algorithm
(2)
deep deterministic policy gradient
(2)
policy gradient
(2)
multi-modal learning
(2)
adversarial setting
(2)
multi-agent reinforcement learning
(2)
feature learning
(1)
temporal difference learning
(1)
Papers
Beyond Squared Error: Exploring Loss Design for Enhanced Training of Generative Flow Networks
ICLR 2025
uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs
ICLR 2025
Finite-Time Analysis of Discrete-Time Stochastic Interpolants
ICML 2025
Efficient Online Pruning and Abstraction for Imperfect Information Extensive-Form Games
ICLR 2025
Provably Efficient Iterated CVaR Reinforcement Learning with Function Approximation and Human Feedback
ICLR 2024
Value-Based Deep Multi-Agent Reinforcement Learning with Dynamic Sparse Training
NIPS 2024
A Quadratic Synchronization Rule for Distributed Deep Learning
ICLR 2024
Provably Efficient Partially Observable Risk-sensitive Reinforcement Learning with Hindsight Observation
ICML 2024
RL-CFR: Improving Action Abstraction for Imperfect Information Extensive-Form Games with Reinforcement Learning
ICML 2024
Provable Risk-Sensitive Distributional Reinforcement Learning with General Function Approximation
ICML 2024
Stochastic Generative Flow Networks
UAI 2023
Provably Safe Reinforcement Learning with Step-wise Violation Constraints
NIPS 2023
RePreM: Representation Pre-training with Masked Model for Reinforcement Learning
AAAI 2023
Why (and When) does Local SGD Generalize Better than SGD?
ICLR 2023
Towards Minimax Optimal Reward-free Reinforcement Learning in Linear MDPs
ICLR 2023
Collaborative Pure Exploration in Kernel Bandit
ICLR 2023
Provably Efficient Risk-Sensitive Reinforcement Learning: Iterated CVaR and Worst Path
ICLR 2023
RLx2: Training a Sparse Deep Reinforcement Learning Model from Scratch
ICLR 2023
Generative Augmented Flow Networks
ICLR 2023
Multi-task Representation Learning for Pure Exploration in Linear Bandits
ICML 2023
Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learning
ICML 2023
Provable Generalization of Overparameterized Meta-learning Trained with SGD
NIPS 2022
Plan Better Amid Conservatism: Offline Multi-Agent Reinforcement Learning with Actor Rectification
ICML 2022
Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation
ICML 2022
Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Bandits
ICML 2022
Modality Competition: What Makes Joint Training of Multi-modal Network Fail in Deep Learning? (Provably)
ICML 2022
Multi-Agent Reinforcement Learning in Stochastic Networked Systems
NIPS 2021
Regularized Softmax Deep Multi-Agent Q-Learning
NIPS 2021
A One-Size-Fits-All Solution to Conservative Bandit Problems
AAAI 2021
Exploration by Maximizing Renyi Entropy for Reward-Free RL Framework
AAAI 2021
The best of both worlds: stochastic and adversarial episodic MDPs with unknown transition
NIPS 2021
Fast Federated Learning in the Presence of Arbitrary Device Unavailability
NIPS 2021
What Makes Multi-Modal Learning Better than Single (Provably)
NIPS 2021
Continuous Mean-Covariance Bandits
NIPS 2021
Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous Feedback
AAAI 2021
Softmax Deep Double Deterministic Policy Gradients
NIPS 2020
Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits
NIPS 2020
Combinatorial Pure Exploration for Dueling Bandit
ICML 2020
Reinforcement Learning with Dynamic Boltzmann Softmax Updates
IJCAI 2020
Double Quantization for Communication-Efficient Distributed Optimization
NIPS 2019
A Deep Reinforcement Learning Framework for Rebalancing Dockless Bike Sharing Systems
AAAI 2019
Multi-armed Bandits with Compensation
NIPS 2018
A Social Interaction Activity based Time-Varying User Vectorization Method for Online Social Networks
IJCAI 2018
Beyond the Click-Through Rate: Web Link Selection with Multi-level Feedback
IJCAI 2018
Fast Stochastic Variance Reduced ADMM for Stochastic Composition Optimization
IJCAI 2017