English
Related papers

Related papers: Regression and Algorithmic Information Theory

200 papers

We consider nonparametric estimation of a regression function for a situation where precisely measured predictors are used to estimate the regression curve for coarsened, that is, less precise or contaminated predictors. Specifically, while…

Statistics Theory · Mathematics 2008-12-18 Aurore Delaigle , Peter Hall , Hans-Georg Müller

This paper studies a machine learning regression problem as a multivariate approximation problem using the framework of the theory of random functions. An ab initio derivation of a regression method is proposed, starting from postulates of…

Machine Learning · Computer Science 2025-12-16 Yuriy N. Bakhvalov

Many regression problems involve not one but several response variables (y's). Often the responses are suspected to share a common underlying structure, in which case it may be advantageous to share information across them; this is known as…

Machine Learning · Computer Science 2009-06-02 Brian Tomasik

This article offers a comprehensive treatment of polynomial functional regression, culminating in the establishment of a novel finite sample bound. This bound encompasses various aspects, including general smoothness conditions, capacity…

Numerical Analysis · Mathematics 2024-05-08 Markus Holzleitner , Sergei Pereverzyev

We consider the regression model with errors-in-variables where we observe $n$ i.i.d. copies of $(Y,Z)$ satisfying $Y=f(X)+\xi, Z=X+\sigma\epsilon$, involving independent and unobserved random variables $X,\xi,\epsilon$. The density $g$ of…

Statistics Theory · Mathematics 2008-02-11 Fabienne Comte , Marie-Luce Taupin

This paper addresses the classic problem of regression, which involves the inductive learning of a map, $y=f(x,z)$, $z$ denoting noise, $f:\mathbb{R}^n\times \mathbb{R}^k \rightarrow \mathbb{R}^m$. Recently, Conditional GAN (CGAN) has been…

Machine Learning · Computer Science 2020-03-04 Saurav Manchanda , Khoa Doan , Pranjul Yadav , S. Sathiya Keerthi

This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…

Logic in Computer Science · Computer Science 2015-07-01 Sam Buss , Douglas Cenzer , Jeffrey B. Remmel

In this work, we consider a multivariate regression model with one-sided errors. We assume for the regression function to lie in a general H\"{o}lder class and estimate it via a nonparametric local polynomial approach that consists of…

Statistics Theory · Mathematics 2021-02-11 Leonie Selk , Charles Tillier , Orlando Marigliano

When the Canonical Ramsey's Theorem by Erd\H{o}s and Rado is applied to regressive functions one obtains the Regressive Ramsey's Theorem by Kanamori and McAloon. Taylor proved a "canonical" version of Hindman's Theorem, analogous to the…

Logic · Mathematics 2025-06-12 Lorenzo Carlucci , Leonardo Mainardi

In high-dimensional multivariate regression problems, enforcing low rank in the coefficient matrix offers effective dimension reduction, which greatly facilitates parameter estimation and model interpretation. However, commonly-used…

Statistics Theory · Mathematics 2017-07-18 Yiyuan She , Kun Chen

We propose and analyse a reduced-rank method for solving least-squares regression problems with infinite dimensional output. We derive learning bounds for our method, and study under which setting statistical performance is improved in…

Machine Learning · Statistics 2022-11-17 Luc Brogat-Motte , Alessandro Rudi , Céline Brouard , Juho Rousu , Florence d'Alché-Buc

The mission of statistics is to provide adequate statistical hypotheses (models) for observed data. But what is an "adequate" model? To answer this question, one needs to use the notions of algorithmic information theory. It turns out that…

Information Theory · Computer Science 2015-04-28 Nikolay Vereshchagin , Alexander Shen

This paper's first aim is to prove a modernized Occam's razor beyond a reasonable doubt. To summarize the main argument in one sentence: If we consider all possible, intelligible, scientific models of ever-higher complexity, democratically,…

Information Theory · Computer Science 2025-07-03 Gabriel Leuenberger

By means of two simple convexity arguments we are able to develop a general method for proving consistency and asymptotic normality of estimators that are defined by minimisation of convex criterion functions. This method is then applied to…

Statistics Theory · Mathematics 2011-07-20 Nils Lid Hjort , David Pollard

The true process that generated data cannot be determined when multiple explanations are possible. Prediction requires a model of the probability that a process, chosen randomly from the set of candidate explanations, generates some future…

Machine Learning · Computer Science 2014-04-18 Oscar Stiffelman

Several classes of DNR functions are characterized in terms of Kolmogorov complexity. In particular, a set of natural numbers A can wtt-compute a DNR function iff there is a nontrivial recursive lower bound on the Kolmogorov complexity of…

Logic · Mathematics 2014-08-12 Bjørn Kjos-Hanssen , Wolfgang Merkle , Frank Stephan

The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…

We introduce constrained Gaussian process (CGP), a Gaussian process model for random functions that allows easy placement of mathematical constrains (e.g., non-negativity, monotonicity, etc) on its sample functions. CGP comes with…

Statistics Theory · Mathematics 2019-04-23 Jeremiah Zhe Liu

In this paper, we focus on regression estimation in both the inductive and the transductive case. We assume that we are given a set of features (which can be a base of functions, but not necessarily). We begin by giving a deviation…

Statistics Theory · Mathematics 2015-06-26 Pierre Alquier

We present a well-structured detailed exposition of a well-known proof of the following celebrated result solving Hilbert's 13th problem on superpositions. For functions of 2 variables the statement is as follows. Kolmogorov Theorem. There…

Functional Analysis · Mathematics 2022-08-24 S. Dzhenzher , A. Skopenkov