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. 2105.13939
  4. Cited By
Efficient Online-Bandit Strategies for Minimax Learning Problems

Efficient Online-Bandit Strategies for Minimax Learning Problems

28 May 2021
Christophe Roux
Elias Wirth
Sebastian Pokutta
Thomas Kerdreux
ArXivPDFHTML

Papers citing "Efficient Online-Bandit Strategies for Minimax Learning Problems"

2 / 2 papers shown
Title
Rank-based Decomposable Losses in Machine Learning: A Survey
Rank-based Decomposable Losses in Machine Learning: A Survey
Shu Hu
Xin Wang
Siwei Lyu
38
32
0
18 Jul 2022
A Survey on Bias and Fairness in Machine Learning
A Survey on Bias and Fairness in Machine Learning
Ninareh Mehrabi
Fred Morstatter
N. Saxena
Kristina Lerman
Aram Galstyan
SyDa
FaML
332
4,223
0
23 Aug 2019
1