ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2305.00154
  4. Cited By
Learning to Seek: Multi-Agent Online Source Seeking Against
  Non-Stochastic Disturbances

Learning to Seek: Multi-Agent Online Source Seeking Against Non-Stochastic Disturbances

29 April 2023
Bin Du
Kun Qian
Christian G. Claudel
Dengfeng Sun
ArXivPDFHTML

Papers citing "Learning to Seek: Multi-Agent Online Source Seeking Against Non-Stochastic Disturbances"

2 / 2 papers shown
Title
Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial
  Corruptions
Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions
Jiafan He
Dongruo Zhou
Tong Zhang
Quanquan Gu
66
46
0
13 May 2022
Weighted Linear Bandits for Non-Stationary Environments
Weighted Linear Bandits for Non-Stationary Environments
Yoan Russac
Claire Vernade
Olivier Cappé
82
101
0
19 Sep 2019
1