Cover Image

A hierarchical Vovk-Azoury-Warmuth forecaster with discounting for online regression in RKHS

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Rokhlin, Dmitry B.
Format:	Preprint
Published:	2025
Subjects:	Machine Learning 68Q32, 68W27, 68W20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning
by: Rokhlin, Dmitry B., et al.
Published: (2025)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
by: Opris, Andre
Published: (2025)

Dynamic Regret for Online Regression in RKHS via Discounted VAW and Subspace Approximation
by: Rokhlin, Dmitry B., et al.
Published: (2026)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
by: Cai, HanQin, et al.
Published: (2023)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
by: Opris, Andre
Published: (2025)

Boosting Test Performance with Importance Sampling--a Subpopulation Perspective
by: Shen, Hongyu, et al.
Published: (2024)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
by: Opris, Andre, et al.
Published: (2024)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

Online Decision Making with Generative Action Sets
by: Xu, Jianyu, et al.
Published: (2025)

Prediction-Augmented Mechanism Design for Weighted Facility Location
by: Shi, Yangguang, et al.
Published: (2025)

Extensions of the regret-minimization algorithm for optimal design
by: Chen, Youguang, et al.
Published: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)

Many Objective Problems Where Crossover is Provably Essential
by: Opris, Andre
Published: (2024)

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
by: López, Francisco, et al.
Published: (2023)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Multipole Semantic Attention: A Fast Approximation of Softmax Attention for Pretraining
by: Mitchell, Rupert, et al.
Published: (2025)

Convergence of Momentum-Based Optimization Algorithms with Time-Varying Parameters
by: Vidyasagar, Mathukumalli
Published: (2025)

Separate Before You Compress: The WWHO Tokenization Architecture
by: Darshana, Kusal
Published: (2026)

ParaRNN: Unlocking Parallel Training of Nonlinear RNNs for Large Language Models
by: Danieli, Federico, et al.
Published: (2025)

Promoting Fair Online Resource Allocation with Indivisible Units
by: Averbakh, Igor, et al.
Published: (2026)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
by: Andreou, Pantelis, et al.
Published: (2024)

Stochastic Trace Optimization of Parameter Dependent Matrices Based on Statistical Learning Theory
by: Saibaba, Arvind K., et al.
Published: (2025)

Theoretical Compression Bounds for Wide Multilayer Perceptrons
by: Cheairi, Houssam El, et al.
Published: (2025)

CircuitBuilder: From Polynomials to Circuits via Reinforcement Learning
by: Zhang, Weikun K., et al.
Published: (2026)

CompressedScaffnew: The First Theoretical Double Acceleration of Communication from Local Training and Compression in Distributed Optimization
by: Condat, Laurent, et al.
Published: (2022)

Stealth edits to large language models
by: Sutton, Oliver J., et al.
Published: (2024)

Balanced Group Convolution: An Improved Group Convolution Based on Approximability Estimates
by: Lee, Youngkyu, et al.
Published: (2023)

Sub-Token Routing in LoRA for Adaptation and Query-Aware KV Compression
by: Jiang, Wei, et al.
Published: (2026)

Estimating Coverage in Streams via a Modified CVM Method
by: Hernandez-Suarez, Carlos
Published: (2025)

An Improved Drift Theorem for Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2023)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

From Understanding to Excelling: Template-Free Algorithm Design through Structural-Functional Co-Evolution
by: Zhao, Zhe, et al.
Published: (2025)

Population Protocols Revisited: Parity and Beyond
by: Gąsieniec, Leszek, et al.
Published: (2025)

The average-case complexity of the Word Problem for groups of matrices over $\mathbb{Z}$ is linear
by: Bassino, Frédérique, et al.
Published: (2025)