Lin Yang

Orcid: 0000-0001-9056-0500

Affiliations:
  • Nanjing University, School of Intelligence Science and Technology, Nanjing, China
  • University of Massachusetts, Amherst, MA, USA (2020 - 2022)
  • Chinese University of Hong Kong (PhD 2018)
  • University of Science and Technology of China, Hefei, China (2008 - 2015)


According to our database1, Lin Yang authored at least 24 papers between 2015 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Cooperative Multi-agent Bandits: Distributed Algorithms with Optimal Individual Regret and Constant Communication Costs.
CoRR, 2023

Exploration for Free: How Does Reward Heterogeneity Improve Regret in Cooperative Multi-agent Bandits?
Proceedings of the Uncertainty in Artificial Intelligence, 2023

Achieving Near-Optimal Individual Regret & Low Communications in Multi-Agent Bandits.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

On-Demand Communication for Asynchronous Multi-Agent Bandits.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Learning-Based Control Policy and Regret Analysis for Online Quadratic Optimization With Asymmetric Information Structure.
IEEE Trans. Cybern., 2022

Hierarchical Learning Algorithms for Multi-scale Expert Problems.
Proc. ACM Meas. Anal. Comput. Syst., 2022

Distributed Bandits with Heterogeneous Agents.
Proceedings of the IEEE INFOCOM 2022, 2022

2021
Competitive Algorithms for Online Multidimensional Knapsack Problems.
Proc. ACM Meas. Anal. Comput. Syst., 2021

The Online Knapsack Problem with Departures.
Proc. ACM Meas. Anal. Comput. Syst., 2021

Competitive bidding strategies for online linear optimization with inventory management constraints.
Perform. Evaluation, 2021

Cooperative Stochastic Bandits with Asynchronous Agents and Constrained Feedback.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Online Linear Optimization with Inventory Management Constraints.
Proc. ACM Meas. Anal. Comput. Syst., 2020

Adversarial Bandits with Corruptions: Regret Lower Bound and No-regret Algorithm.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019
Stabilization of discrete time stochastic system with input delay and control dependent noise.
Syst. Control. Lett., 2019

Online Inventory Management with Application to Energy Procurement in Data Centers.
CoRR, 2019

Online Linear Programming with Uncertain Constraints : (Invited Paper).
Proceedings of the 53rd Annual Conference on Information Sciences and Systems, 2019

2018
An Optimal Algorithm for Online Non-Convex Learning.
Proc. ACM Meas. Anal. Comput. Syst., 2018

2017
An Optimal Randomized Online Algorithm for QoS Buffer Management.
Proc. ACM Meas. Anal. Comput. Syst., 2017

Recursive Exponential Weighting for Online Non-convex Optimization.
CoRR, 2017

Hour-Ahead Offering Strategies in Electricity Market for Power Producers with Storage and Intermittent Supply.
Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Urbana-Champaign, IL, USA, June 05, 2017

2016
Online Offering Strategies for Storage-Assisted Renewable Power Producer in Hour-Ahead Market.
CoRR, 2016

Competitive online algorithms for geographical load balancing in data centers with energy storage.
Proceedings of the 5th International Workshop on Energy Efficient Data Centres, 2016

2015
An Optimal Vertical Handoff Decision Algorithm for Multiple Services with Different Priorities in Heterogeneous Wireless Networks.
Wirel. Pers. Commun., 2015

Time Series Analysis for Congestion Detection in TCP/AQM Networks.
IEEE Commun. Lett., 2015


  Loading...