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. 2112.01118
  4. Cited By
Near-Optimal Lower Bounds For Convex Optimization For All Orders of
  Smoothness

Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness

2 December 2021
A. Garg
Robin Kothari
Praneeth Netrapalli
Suhail Sherif
ArXivPDFHTML

Papers citing "Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness"

4 / 4 papers shown
Title
Quantum Non-Linear Bandit Optimization
Zakaria Shams Siam
Chaowen Guan
Chong Liu
29
0
0
04 Mar 2025
Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and
  Uniform Convexity
Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity
Site Bai
Brian Bullins
19
0
0
16 Sep 2024
Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
Yexin Zhang
Chenyi Zhang
Cong Fang
Liwei Wang
Tongyang Li
39
2
0
05 Jun 2024
Quantum Algorithms and Lower Bounds for Linear Regression with Norm
  Constraints
Quantum Algorithms and Lower Bounds for Linear Regression with Norm Constraints
Yanlin Chen
Ronald de Wolf
22
16
0
25 Oct 2021
1