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. 2006.07541
  4. Cited By
Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for
  Smooth Minimax Games

Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games

13 June 2020
A. Suggala
Praneeth Netrapalli
ArXivPDFHTML

Papers citing "Follow the Perturbed Leader: Optimism and Fast Parallel Algorithms for Smooth Minimax Games"

3 / 3 papers shown
Title
Optimistic No-regret Algorithms for Discrete Caching
Optimistic No-regret Algorithms for Discrete Caching
N. Mhaisen
Abhishek Sinha
G. Paschos
Georgios Iosifidis
36
11
0
15 Aug 2022
Training for the Future: A Simple Gradient Interpolation Loss to
  Generalize Along Time
Training for the Future: A Simple Gradient Interpolation Loss to Generalize Along Time
Anshul Nasery
Soumyadeep Thakur
Vihari Piratla
A. De
Sunita Sarawagi
AI4TS
29
27
0
15 Aug 2021
Frank-Wolfe Algorithms for Saddle Point Problems
Frank-Wolfe Algorithms for Saddle Point Problems
Gauthier Gidel
Tony Jebara
Simon Lacoste-Julien
42
70
0
25 Oct 2016
1