Note on universal algorithms for learning theory

11/23/2018
by   Karol Dziedziul, et al.
0

We propose the general way of study the universal estimator for the regression problem in learning theory considered in "Universal algorithms for learning theory Part I: piecewise constant functions" and "Universal algorithms for learning theory Part II: piecewise constant functions" written by Binev, P., Cohen, A., Dahmen, W., DeVore, R., Temlyakov, V. This new approch allows us to improve results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/30/2023

Discussion of "A note on universal inference" by Timmy Tse and Anthony Davison

Invited discussion for Stat of "A note on universal inference" by Timmy ...
research
04/25/2018

Notes on stable learning with piecewise-linear basis functions

We discuss technical results on learning function approximations using p...
research
06/16/2022

A Bernstein–von-Mises theorem for the Calderón problem with piecewise constant conductivities

This note considers a finite dimensional statistical model for the Calde...
research
04/07/2016

Online Optimization of Smoothed Piecewise Constant Functions

We study online optimization of smoothed piecewise constant functions ov...
research
07/05/2021

Universal Approximation of Functions on Sets

Modelling functions of sets, or equivalently, permutation-invariant func...
research
06/22/2018

A Universal Hypercomputer

This paper describes a type of infinitary computer (a hypercomputer) cap...
research
08/02/2023

A Universal Birkhoff Theory for Fast Trajectory Optimization

Over the last two decades, pseudospectral methods based on Lagrange inte...

Please sign up or login with your details

Forgot password? Click here to reset