Online learning of smooth functions on $\mathbb{R}$

Abstract: We study adversarial online learning of real-valued functions on $\mathbb{R}$. In each round the learner is queried at $x_t\in\mathbb{R}$, predicts $\hat y_t$, and then observes the true value $f(x_t)$; performance is measured by cumulative $p$-loss $\sum_{t\ge 1}|\hat y_t-f(x_t)|<sup>p$. For the class [ \mathcal{G}q=\Bigl{f:\mathbb{R}\to\mathbb{R}\ \text{absolutely continuous}:\ \int{\mathbb{R}}|f'(x)|^q\,dx\le 1\Bigr}, ] we show that the standard model becomes ill-posed on $\mathbb{R}$: for every $p\ge 1$ and $q&gt;1$, an adversary can force infinite loss. Motivated by this obstruction, we analyze three modified learning scenarios that limit the influence of queries that are far from previously observed inputs. In Scenario 1 the adversary must choose each new query within distance $1$ of some past query. In Scenario 2 the adversary may query anywhere, but the learner is penalized only on rounds whose query lies within distance $1$ of a past query. In Scenario 3 the loss in round $t$ is multiplied by a weight $g(\min_{j&lt;t}|x_t-x_j|)$. We obtain sharp characterizations for Scenarios 1-2 in several regimes. For Scenario 3 we identify a clean threshold phenomenon: if $g$ decays too slowly, then the adversary can force infinite weighted loss. In contrast, for rapidly decaying weights such as $g(z)=e<sup>{-cz}$ we obtain finite and sharp guarantees in the quadratic case $p=q=2$. Finally, we study a natural multivariable slice generalization $\mathcal{G}<em>{q,d}$ of $\mathcal{G}_q$ on $\mathbb{R}<sup>d$ and show a sharp dichotomy: while the one-dimensional case admits finite opt-values in certain regimes, for every $d\ge 2$ the slice class $\mathcal{G}</em>{q,d}$ is too permissive, and even under Scenarios 1-3 an adversary can force infinite loss.

• The paper demonstrates that extending mistake-bound online learning to ℝ without locality triggers infinite cumulative loss under adversarial queries.
• It introduces three locality-based scenarios—input restriction, selective penalization, and distance-weighted penalty—to recover meaningful performance guarantees.
• The study provides precise quantitative bounds, scaling laws, and highlights negative results in higher dimensions, setting baselines for future research.

Online Learning of Smooth Functions on $\mathbb{R}$: A Technical Synthesis

Problem Formulation and Motivation

The paper investigates adversarial online learning for smooth, real-valued functions over the unbounded domain $\mathbb{R}$. At each round, the learner is queried with $x_t \in \mathbb{R}$, must output a prediction $\hat{y}_t$ for $f(x_t)$, and then observes the actual value. The performance is measured via cumulative $p$-loss, $\sum_{t \geq 1} |\hat{y}_t - f(x_t)|^p$. The function class of primary interest, $\mathcal{G}_q$, consists of absolutely continuous functions on $\mathbb{R}$ with $\int_{\mathbb{R}} |f'(x)|^q dx \leq 1$.

Prior results established tight minimax values on compact domains (e.g., $\mathbb{R}$0) for analogous smoothness classes, but real-world sequential prediction contexts often involve unconstrained or drifting input distributions, motivating extension to unbounded domains.

However, the naive extension of mistake-bound online learning to $\mathbb{R}$1 is shown to be fundamentally ill-posed: even for classes of highly smooth functions, adversarial query sequences can force infinite cumulative loss. This breakdown underscores the necessity of enforcing some locality or distance-dependent constraints to recover meaningful guarantees.

Pathologies of the Unbounded-Domain Setting

Key technical results demonstrate the loss of structural relationships among smoothness classes when passing from compact intervals to $\mathbb{R}$2. Importantly, for any $\mathbb{R}$3 and $\mathbb{R}$4, the minimax value $\mathbb{R}$5 is infinite. The adversary's strategy leverages the possibility of placing each new query arbitrarily far from prior queries, thereby requiring the learner to extrapolate with no local information, and thus incur maximal error. These impossibility results persist even as $\mathbb{R}$6, and are not ameliorated by increasing smoothness.

This observation motivates a taxonomy of alternative online learning scenarios that seek to regulate the effect of distant queries through locality constraints on the adversary, selective penalization, or decay-weighted loss.

Locality-Based Remediation: Three Scenarios

The paper conceptualizes three mitigations, each precisely formalized:

1. Scenario 1 (Input Restriction): The adversary may only choose $\mathbb{R}$7 such that $\mathbb{R}$8 (typically $\mathbb{R}$9). The learner's loss is measured as usual over all rounds.
2. Scenario 2 (Selective Penalization): The adversary is unrestricted, but the learner is only penalized on those rounds where $x_t \in \mathbb{R}$0 comes within distance $x_t \in \mathbb{R}$1 of a prior $x_t \in \mathbb{R}$2.
3. Scenario 3 (Distance-Weighted Penalty): The loss at round $x_t \in \mathbb{R}$3 is multiplied by $x_t \in \mathbb{R}$4, for a non-increasing weight function $x_t \in \mathbb{R}$5. This subsumes Scenario 2 as $x_t \in \mathbb{R}$6 and allows continuous discounting (identity weighting $x_t \in \mathbb{R}$7, exponential $x_t \in \mathbb{R}$8, etc.).

The relationships among these scenarios are characterized by precise inequalities on minimax values and by the reducibility or dominance among settings with different $x_t \in \mathbb{R}$9. Notably, auxiliary structural results provide scaling laws for different radius parameters and monotonicity/comparative theorems for function families and weightings.

Strong Quantitative Bounds and Phase Diagrams

For Scenario 1/2, when $\hat{y}_t$0, the minimax value is $\hat{y}_t$1, matching the optimal value on the classical compact domain $\hat{y}_t$2. This is actualized by a modified online linear interpolation algorithm ($\hat{y}_t$3), which ensures the per-round loss is always at most $\hat{y}_t$4. This shows that with enforced locality (through the input restriction or selective penalization), worst-case loss is completely controlled by the smoothness class as in bounded settings.

However, for $\hat{y}_t$5, the adversary can still enforce arbitrarily large loss even under the scenario-1/2 constraints, i.e., the transition at $\hat{y}_t$6 is sharp.

For Scenario 3, the authors prove that with the identity weighting ($\hat{y}_t$7), the minimax value is again $\hat{y}_t$8 in the case $\hat{y}_t$9, while for exponential weighting, the minimax value is exactly $f(x_t)$0 for $f(x_t)$1. More generally, for Scenario 3 with arbitrary nonincreasing $f(x_t)$2, the minimax value is given by the supremum $f(x_t)$3 (for $f(x_t)$4). If $f(x_t)$5 decays too slowly (e.g., $f(x_t)$6 or slower), the minimax value is infinite.

Explicit constructions show that the gap between Scenario 1 and 2 is maximally $f(x_t)$7 for finite families of functions of size $f(x_t)$8, with sharp lower and upper bounds demonstrated.

Higher-Dimensional Generalization and Negative Results

Extending to $f(x_t)$9, the multivariate `slice' class $p$0 is considered: these are functions whose every one-dimensional coordinate slice belongs to $p$1. The authors establish that for every $p$2 and $p$3, this class is not learnable under any of the above scenarios, i.e., $p$4 for all $p$5. The proof uses an explicit construction of disjoint local "bumps" in $p$6 that satisfy the slice constraints but allow the adversary to exploit fresh regions in every round without incurring increased smoothness cost. Thus, locality alone is insufficient in higher-dimensional unbounded domains if only slice constraints are used.

Practical and Theoretical Consequences

From a theoretical perspective, the work clarifies precisely when and how the standard adversarial mistake-bound model fails in unconstrained non-compact settings and which modifications restore meaningful guarantees. The scaling law $p$7 for Scenarios 1/2 provides an explicit bridge between local constraint parameters and achievable risk. The foundational ill-posedness of unbounded-domain smooth function learning is established constructively.

Practically, these findings articulate why unconstrained extrapolation (absent locality, selective evaluation, or confidence weighting) renders adversarial guarantees vacuous, and thus why domain restriction, penalty discounting, or regularization by locality are all essential in sequential regression, bandit, and interactive learning for real-valued signals and control systems.

Directions for Future Research

The paper opens numerous directions for further work. Most pressing is the extension to alternative smoothness models in the multivariate case, e.g., function classes controlled by global $p$8-norm integrals or Sobolev-type norms, which may circumvent the negative results for slice-based smoothness. Another crucial axis is the optimization of explicit learning strategies beyond interpolation, and the identification of minimax-optimal learners and adversaries under more refined adaptive or stochastic models.

Adaptive locality parameters (e.g., shrinking window sizes), online computation constraints (arithmetic operation caps), and the formulation of analogous results in high-dimensional, non-Euclidean, or structured domains are additional rich topics prompted by this foundational study. The practical implications for active and exploratory systems, reinforcement learning, and online control remain profound.

Conclusion

The paper provides a rigorous and comprehensive analysis of online learning for smooth real-valued functions on $p$9, demonstrating the essential role of locality and scenario design in obtaining nontrivial adversarial guarantees. The taxonomy and matching lower/upper bounds for a range of loss forms, along with the negative results for higher-dimensional generalization under slice constraints, establish definitive baselines for further advancement in sequential regression and adversarial learning theory.