Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2010.06250
Cited By
Regret minimization in stochastic non-convex learning via a proximal-gradient approach
13 October 2020
Nadav Hallak
P. Mertikopoulos
Volkan Cevher
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Regret minimization in stochastic non-convex learning via a proximal-gradient approach"
8 / 8 papers shown
Title
In-Trajectory Inverse Reinforcement Learning: Learn Incrementally Before An Ongoing Trajectory Terminates
Shicheng Liu
Minghui Zhu
115
1
0
21 Oct 2024
Online Nonconvex Bilevel Optimization with Bregman Divergences
Jason Bohne
David Rosenberg
Gary Kazantsev
Pawel Polak
80
0
0
16 Sep 2024
Non-Convex Bilevel Optimization with Time-Varying Objective Functions
Sen-Fon Lin
Daouda Sow
Kaiyi Ji
Yitao Liang
Ness B. Shroff
80
4
0
07 Aug 2023
Future Gradient Descent for Adapting the Temporal Shifting Data Distribution in Online Recommendation Systems
Mao Ye
Ruichen Jiang
Haoxiang Wang
Dhruv Choudhary
Xiaocong Du
Bhargav Bhushanam
Aryan Mokhtari
A. Kejariwal
Qiang Liu
TTA
OOD
AI4TS
79
8
0
02 Sep 2022
Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
Davoud Ataee Tarzanagh
Parvin Nazari
Bojian Hou
Li Shen
Laura Balzano
148
12
0
06 Jul 2022
OpReg-Boost: Learning to Accelerate Online Algorithms with Operator Regression
Nicola Bastianello
Andrea Simonetto
E. Dall’Anese
60
3
0
27 May 2021
Are we Forgetting about Compositional Optimisers in Bayesian Optimisation?
Antoine Grosnit
Alexander I. Cowen-Rivers
Rasul Tutunov
Ryan-Rhys Griffiths
Jun Wang
Haitham Bou-Ammar
105
14
0
15 Dec 2020
Online non-convex optimization with imperfect feedback
Amélie Héliou
Matthieu Martin
P. Mertikopoulos
Thibaud Rahier
45
16
0
16 Oct 2020
1