Search Results - Randhawa, Sikander

  • Showing 1 - 6 results of 6
Refine Results
  1. 1
    Tight analyses for subgradient descent I: Lower bounds

    Tight analyses for subgradient descent I: Lower bounds by Harvey, Nicholas J. A., Liaw, Chris, Randhawa, Sikander

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  2. 2
    Optimal anytime regret with two experts

    Optimal anytime regret with two experts by Harvey, Nicholas J. A., Liaw, Christopher, Perkins, Edwin, Randhawa, Sikander

    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Optimal anytime regret with two experts

    Optimal anytime regret with two experts by Harvey, Nicholas J A, Liaw, Christopher, Perkins, Edwin, Randhawa, Sikander

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    The Vickrey Auction with a Single Duplicate Bidder Approximates the Optimal Revenue

    The Vickrey Auction with a Single Duplicate Bidder Approximates the Optimal Revenue by Hu, Fu, Liaw, Christopher, Randhawa, Sikander

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent

    Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent by Harvey, Nicholas J A, Liaw, Christopher, Randhawa, Sikander

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Tight Analyses for Non-Smooth Stochastic Gradient Descent

    Tight Analyses for Non-Smooth Stochastic Gradient Descent by Harvey, Nicholas J A, Liaw, Christopher, Plan, Yaniv, Randhawa, Sikander

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: