ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2004.01022
  4. Cited By
Provable Sample Complexity Guarantees for Learning of Continuous-Action
  Graphical Games with Nonparametric Utilities

Provable Sample Complexity Guarantees for Learning of Continuous-Action Graphical Games with Nonparametric Utilities

IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2020
1 April 2020
Adarsh Barik
Jean Honorio
ArXiv (abs)PDFHTML

Papers citing "Provable Sample Complexity Guarantees for Learning of Continuous-Action Graphical Games with Nonparametric Utilities"

1 / 1 papers shown
Learning to Infer Structures of Network Games
Learning to Infer Structures of Network GamesInternational Conference on Machine Learning (ICML), 2022
Emanuele Rossi
Federico Monti
Yan Leng
Michael M. Bronstein
Xiaowen Dong
286
9
0
16 Jun 2022
1
Page 1 of 1