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. 1803.07763
  4. Cited By
From Gauss to Kolmogorov: Localized Measures of Complexity for Ellipses

From Gauss to Kolmogorov: Localized Measures of Complexity for Ellipses

21 March 2018
Yuting Wei
Billy Fang
Martin J. Wainwright
ArXiv (abs)PDFHTML

Papers citing "From Gauss to Kolmogorov: Localized Measures of Complexity for Ellipses"

4 / 4 papers shown
Title
Is Offline Decision Making Possible with Only Few Samples? Reliable
  Decisions in Data-Starved Bandits via Trust Region Enhancement
Is Offline Decision Making Possible with Only Few Samples? Reliable Decisions in Data-Starved Bandits via Trust Region Enhancement
Ruiqi Zhang
Yuexiang Zhai
Andrea Zanette
109
0
0
24 Feb 2024
On the minimax rate of the Gaussian sequence model under bounded convex
  constraints
On the minimax rate of the Gaussian sequence model under bounded convex constraints
Matey Neykov
62
10
0
18 Jan 2022
SLIP: Learning to Predict in Unknown Dynamical Systems with Long-Term
  Memory
SLIP: Learning to Predict in Unknown Dynamical Systems with Long-Term Memory
Paria Rashidinejad
Jiantao Jiao
Stuart J. Russell
72
11
0
12 Oct 2020
Stochastic approximation with cone-contractive operators: Sharp
  $\ell_\infty$-bounds for $Q$-learning
Stochastic approximation with cone-contractive operators: Sharp ℓ∞\ell_\inftyℓ∞​-bounds for QQQ-learning
Martin J. Wainwright
76
105
0
15 May 2019
1