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. 1912.01698
  4. Cited By
Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point
  Optimization

Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization

3 December 2019
Abhishek Roy
Yifang Chen
Krishnakumar Balasubramanian
P. Mohapatra
ArXivPDFHTML

Papers citing "Online and Bandit Algorithms for Nonstationary Stochastic Saddle-Point Optimization"

5 / 5 papers shown
Title
Improving LLM General Preference Alignment via Optimistic Online Mirror Descent
Improving LLM General Preference Alignment via Optimistic Online Mirror Descent
Yuheng Zhang
Dian Yu
Tao Ge
Linfeng Song
Zhichen Zeng
Haitao Mi
Nan Jiang
Dong Yu
68
1
0
24 Feb 2025
Primal Dual Alternating Proximal Gradient Algorithms for Nonsmooth
  Nonconvex Minimax Problems with Coupled Linear Constraints
Primal Dual Alternating Proximal Gradient Algorithms for Nonsmooth Nonconvex Minimax Problems with Coupled Linear Constraints
Hui-Li Zhang
Junlin Wang
Zi Xu
Y. Dai
88
4
0
09 Dec 2022
No-Regret Learning in Time-Varying Zero-Sum Games
No-Regret Learning in Time-Varying Zero-Sum Games
Mengxiao Zhang
Peng Zhao
Haipeng Luo
Zhi-Hua Zhou
33
38
0
30 Jan 2022
Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved
  Complexities
Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities
Zhongruo Wang
Krishnakumar Balasubramanian
Shiqian Ma
Meisam Razaviyayn
21
25
0
22 Jan 2020
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