AI Chat AI Image Generator AI Video Text to Speech

Learning bounded subsets of L_p

02/04/2020

∙

by Shahar Mendelson, et al.

∙

∙

We study learning problems in which the underlying class is a bounded subset of L_p and the target Y belongs to L_p. Previously, minimax sample complexity estimates were known under such boundedness assumptions only when p=∞. We present a sharp sample complexity estimate that holds for any p > 4. It is based on a learning procedure that is suited for heavy-tailed problems.

page 1

page 2

page 3

page 4

research

∙ 02/21/2020

Private Mean Estimation of Heavy-Tailed Distributions

We give new upper and lower bounds on the minimax sample complexity of d...

0 Gautam Kamath, et al. ∙

research

∙ 01/01/2014

Learning without Concentration

We obtain sharp bounds on the performance of Empirical Risk Minimization...

0 Shahar Mendelson, et al. ∙

research

∙ 06/10/2018

Identifiability in Gaussian Graphical Models

In high-dimensional graph learning problems, some topological properties...

0 De Wen Soh, et al. ∙

research

∙ 07/04/2012

Learning Factor Graphs in Polynomial Time & Sample Complexity

We study computational and sample complexity of parameter and structure ...

0 Pieter Abbeel, et al. ∙

research

∙ 03/22/2022

A Note on Target Q-learning For Solving Finite MDPs with A Generative Oracle

Q-learning with function approximation could diverge in the off-policy s...

10 Ziniu Li, et al. ∙

research

∙ 06/14/2021

On the Sample Complexity of Learning with Geometric Stability

Many supervised learning problems involve high-dimensional data such as ...

0 Alberto Bietti, et al. ∙

research

∙ 03/31/2023

Large Dimensional Independent Component Analysis: Statistical Optimality and Computational Tractability

In this paper, we investigate the optimal statistical performance and th...

0 Arnab Auddy, et al. ∙