Image de couverture de livre

Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Rokhlin, Dmitry B., Gurtovaya, Olga V.
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning 68Q32, 68W27, 68W20
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A hierarchical Vovk-Azoury-Warmuth forecaster with discounting for online regression in RKHS
par: Rokhlin, Dmitry B.
Publié: (2025)

Shortest Paths without a Map, but with an Entropic Regularizer
par: Bubeck, Sébastien, et autres
Publié: (2022)

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

Random-Order Online Independent Set of Intervals and Hyperrectangles
par: Garg, Mohit, et autres
Publié: (2024)

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

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems
par: Opris, Andre, et autres
Publié: (2024)

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

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
par: Cai, HanQin, et autres
Publié: (2023)

Incremental-Decremental Maximization
par: Disser, Yann, et autres
Publié: (2025)

Boosting Test Performance with Importance Sampling--a Subpopulation Perspective
par: Shen, Hongyu, et autres
Publié: (2024)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
par: Chen, Zongchen, et autres
Publié: (2022)

Extensions of the regret-minimization algorithm for optimal design
par: Chen, Youguang, et autres
Publié: (2025)

Dynamic Regret for Online Regression in RKHS via Discounted VAW and Subspace Approximation
par: Rokhlin, Dmitry B., et autres
Publié: (2026)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
par: Sopp, Braeden, et autres
Publié: (2026)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
par: Andreou, Pantelis, et autres
Publié: (2024)

Building a Nest by an Automaton
par: Czyzowicz, Jurek, et autres
Publié: (2019)

Many Objective Problems Where Crossover is Provably Essential
par: Opris, Andre
Publié: (2024)

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
par: López, Francisco, et autres
Publié: (2023)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

Online Decision Making with Generative Action Sets
par: Xu, Jianyu, et autres
Publié: (2025)

Separate Before You Compress: The WWHO Tokenization Architecture
par: Darshana, Kusal
Publié: (2026)

Prediction-Augmented Mechanism Design for Weighted Facility Location
par: Shi, Yangguang, et autres
Publié: (2025)

Promoting Fair Online Resource Allocation with Indivisible Units
par: Averbakh, Igor, et autres
Publié: (2026)

An Improved Drift Theorem for Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2023)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
par: Feldman, Moran, et autres
Publié: (2026)

Multipole Semantic Attention: A Fast Approximation of Softmax Attention for Pretraining
par: Mitchell, Rupert, et autres
Publié: (2025)

From Understanding to Excelling: Template-Free Algorithm Design through Structural-Functional Co-Evolution
par: Zhao, Zhe, et autres
Publié: (2025)

Population Protocols Revisited: Parity and Beyond
par: Gąsieniec, Leszek, et autres
Publié: (2025)

HaTT: Hadamard avoiding TT recompression
par: Sun, Zhonghao, et autres
Publié: (2024)

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

On sampling two spin models using the local connective constant
par: Efthymiou, Charilaos
Publié: (2024)

Convergence of Momentum-Based Optimization Algorithms with Time-Varying Parameters
par: Vidyasagar, Mathukumalli
Publié: (2025)

An asymptotically optimal algorithm for generating bin cardinalities
par: Devroye, Luc, et autres
Publié: (2024)

Massively Parallel Modular Methods in Commutative Algebra and Algebraic Geometry
par: Basson, Dirk, et autres
Publié: (2024)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
par: Borodin, Allan, et autres
Publié: (2025)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
par: Liu, Bowen
Publié: (2025)

Generating DDPM-based Samples from Tilted Distributions
par: Mandal, Himadri, et autres
Publié: (2026)

ParaRNN: Unlocking Parallel Training of Nonlinear RNNs for Large Language Models
par: Danieli, Federico, et autres
Publié: (2025)

Extracting and Validating Explanatory Word Archipelagoes using Dual Entropy
par: Ohsawa, Yukio
Publié: (2020)