Daron Anderson

Orcid: 0000-0003-1675-7764

According to our database1, Daron Anderson authored at least 8 papers between 2019 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Lazy Lagrangians for Optimistic Learning With Budget Constraints.
IEEE/ACM Trans. Netw., October, 2023

2022
Expected Regret and Pseudo-Regret are Equivalent When the Optimal Arm is Unique.
J. Mach. Learn. Res., 2022

Lazy Lagrangians with Predictions for Online Learning.
CoRR, 2022

2021
Cluster-Based Bandits: Fast Cold-Start for Recommender System New Users.
Proceedings of the SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2021

The Lazy Online Subgradient Algorithm is Universal on Strongly Convex Domains.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Universal Algorithms: Beyond the Simplex.
CoRR, 2020

2019
Learning The Best Expert Efficiently.
CoRR, 2019

Optimality of the Subgradient Algorithm in the Stochastic Setting.
CoRR, 2019


  Loading...