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. 1904.11681
  4. Cited By
Adaptive Regret of Convex and Smooth Functions

Adaptive Regret of Convex and Smooth Functions

26 April 2019
Lijun Zhang
Tie-Yan Liu
Zhi-Hua Zhou
    ODL
ArXivPDFHTML

Papers citing "Adaptive Regret of Convex and Smooth Functions"

11 / 11 papers shown
Title
Efficient Methods for Non-stationary Online Learning
Efficient Methods for Non-stationary Online Learning
Peng Zhao
Yan-Feng Xie
Lijun Zhang
Zhi-Hua Zhou
44
19
0
16 Sep 2023
Nearly Optimal Algorithms with Sublinear Computational Complexity for
  Online Kernel Regression
Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression
Junfan Li
Shizhong Liao
19
0
0
14 Jun 2023
Non-stationary Projection-free Online Learning with Dynamic and Adaptive
  Regret Guarantees
Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees
Yibo Wang
Wenhao Yang
Wei Jiang
Shiyin Lu
Bing Wang
Haihong Tang
Yuanyu Wan
Lijun Zhang
24
6
0
19 May 2023
Online Bilevel Optimization: Regret Analysis of Online Alternating
  Gradient Methods
Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
Davoud Ataee Tarzanagh
Parvin Nazari
Bojian Hou
Li Shen
Laura Balzano
44
10
0
06 Jul 2022
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor
Lijun Zhang
Wei Jiang
Jinfeng Yi
Tianbao Yang
20
6
0
02 May 2022
Adaptive Gradient Methods with Local Guarantees
Adaptive Gradient Methods with Local Guarantees
Zhou Lu
Wenhan Xia
Sanjeev Arora
Elad Hazan
ODL
22
9
0
02 Mar 2022
Corralling a Larger Band of Bandits: A Case Study on Switching Regret
  for Linear Bandits
Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits
Haipeng Luo
Mengxiao Zhang
Peng Zhao
Zhi-Hua Zhou
26
17
0
12 Feb 2022
Near-Linear Time Algorithm with Near-Logarithmic Regret Per Switch for
  Mixable/Exp-Concave Losses
Near-Linear Time Algorithm with Near-Logarithmic Regret Per Switch for Mixable/Exp-Concave Losses
Kaan Gokcesu
Hakan Gokcesu
15
1
0
28 Sep 2021
Regret and Cumulative Constraint Violation Analysis for Online Convex
  Optimization with Long Term Constraints
Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints
Xinlei Yi
Xiuxian Li
Tao Yang
Lihua Xie
Tianyou Chai
Karl H. Johansson
14
46
0
09 Jun 2021
Adaptive Regret for Control of Time-Varying Dynamics
Adaptive Regret for Control of Time-Varying Dynamics
Paula Gradu
Elad Hazan
Edgar Minasyan
32
47
0
08 Jul 2020
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive
  Regret of Convex Functions
Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions
Lijun Zhang
G. Wang
Wei-Wei Tu
Zhi-Hua Zhou
ODL
15
18
0
26 Jun 2019
1