Competitive on‐line statistics

V Vovk - International Statistical Review, 2001 - Wiley Online Library
A radically new approach to statistical modelling, which combines mathematical techniques
of Bayesian statistics with the philosophy of the theory of competitive on‐line algorithms, has …

User-friendly introduction to PAC-Bayes bounds

P Alquier - Foundations and Trends® in Machine Learning, 2024 - nowpublishers.com
Aggregated predictors are obtained by making a set of basic predictors vote according to
some weights, that is, to some probability distribution. Randomized predictors are obtained …

A modern introduction to online learning

F Orabona - arXiv preprint arXiv:1912.13213, 2019 - arxiv.org
In this monograph, I introduce the basic concepts of Online Learning through a modern view
of Online Convex Optimization. Here, online learning refers to the framework of regret …

Introduction to online convex optimization

E Hazan - Foundations and Trends® in Optimization, 2016 - nowpublishers.com
This monograph portrays optimization as a process. In many practical applications the
environment is so complex that it is infeasible to lay out a comprehensive theoretical model …

Online learning algorithms

N Cesa-Bianchi, F Orabona - Annual review of statistics and its …, 2021 - annualreviews.org
Online learning is a framework for the design and analysis of algorithms that build predictive
models by processing data one at the time. Besides being computationally efficient, online …

[图书][B] Prediction, learning, and games

N Cesa-Bianchi, G Lugosi - 2006 - books.google.com
This important text and reference for researchers and students in machine learning, game
theory, statistics and information theory offers a comprehensive treatment of the problem of …

[图书][B] A distribution-free theory of nonparametric regression

L Györfi, M Kohler, A Krzyzak, H Walk - 2006 - books.google.com
The regression estimation problem has a long history. Already in 1632 Galileo Galilei used a
procedure which can be interpreted as? tting a linear relationship to contaminated observed …

Logarithmic regret algorithms for online convex optimization

E Hazan, A Agarwal, S Kale - Machine Learning, 2007 - Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions,
ie, chooses a sequence of points in Euclidean space, from a fixed feasible set. After each …

[图书][B] Mathematical analysis of machine learning algorithms

T Zhang - 2023 - books.google.com
The mathematical theory of machine learning not only explains the current algorithms but
can also motivate principled approaches for the future. This self-contained textbook …

[图书][B] Universal artificial intelligence: Sequential decisions based on algorithmic probability

M Hutter - 2005 - books.google.com
Personal motivation. The dream of creating artificial devices that reach or outperform human
inteUigence is an old one. It is also one of the dreams of my youth, which have never left me …