Second-Order Parameterizations for the Complexity Theory of Integrable Functions
Aras Bacho, Martin Ziegler

TL;DR
This paper introduces a second-order parameterized complexity framework for integrable functions, extending existing theories for continuous functions, and establishes equivalences among different parameterizations of $L^p$ spaces.
Contribution
It generalizes second-order parameterized complexity theory to $L^p$ spaces and proves the mutual linear equivalence of three natural parameterizations.
Findings
Proves mutual linear equivalence of three parameterizations of $L^p$ spaces.
Extends complexity theory from continuous to integrable functions.
Provides a unified framework for analyzing integrable functions' complexity.
Abstract
We develop a unified second-order parameterized complexity theory for spaces of integrable functions. This generalizes the well-established case of second-order parameterized complexity theory for spaces of continuous functions. Specifically we prove the mutual linear equivalence of three natural parameterizations of the space of -integrable complex functions on the real unit interval: (binary) -modulus, rate of convergence of Fourier series, and rate of approximation by step functions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Mathematical and Theoretical Analysis · Advanced Optimization Algorithms Research
