Back to search

University of Washington

A Finite Approximation Framework for Infinite Dimensional Functional Problems

Abstract

dc:description.abstract

It is often of interest to non-parametrically estimate regression functions. Penalized regression (PR) is one effective, well-studied solution to this problem. Unfortunately, in many cases, finding exact solutions to PR problems is computationally intractable. In this manuscript, we propose a \textit{mesh-based approximate solution}, or MBS, for those scenarios. MBS transforms the complicated functional minimization of PR, to a finite parameter, discrete convex minimization allowing us to leverage the tools of modern convex optimization. We show applications of MBS for both univariate and multivariate regression with a number of explicit examples (including isotonic regression and partially linear additive models), and explore how the number of parameters must increase with our sample-size in order for MBS to maintain the rate-optimality of PR. We also give an efficient algorithm to minimize the MBS objective while effectively leveraging the sparsity inherent in MBS.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Ortiz, Brayan
Advisor dc:contributor.advisor
  • Simon, Noah

Subjects

dc:subject × 6

Rights

dc:rights
Statement dc:rights
  • none
Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1773/42977

Chain of custody

source
Harvested from
University of Washington
Base URL
digital.lib.washington.edu/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Ortiz, Brayan. A Finite Approximation Framework for Infinite Dimensional Functional Problems. 2018. http://hdl.handle.net/1773/42977