Copertina

Learnability in Online Kernel Selection with Memory Constraint via Data-dependent Regret Analysis

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Li, Junfan, Liao, Shizhong
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Improved Kernel Alignment Regret Bound for Online Kernel Learning
di: Li, Junfan, et al.
Pubblicazione: (2022)

A Polynomial-time Algorithm for Online Sparse Linear Regression with Improved Regret Bound under Weaker Conditions
di: Li, Junfan, et al.
Pubblicazione: (2025)

On the Necessity of Collaboration for Online Model Selection with Decentralized Data
di: Li, Junfan, et al.
Pubblicazione: (2024)

Data- and Variance-dependent Regret Bounds for Online Tabular MDPs
di: Li, Mingyi, et al.
Pubblicazione: (2026)

Data-Driven Online Model Selection With Regret Guarantees
di: Pacchiano, Aldo, et al.
Pubblicazione: (2023)

Characterizing Online and Private Learnability under Distributional Constraints via Generalized Smoothness
di: Blanchard, Moïse, et al.
Pubblicazione: (2026)

Dynamic Regret Reduces to Kernelized Static Regret
di: Jacobsen, Andrew, et al.
Pubblicazione: (2025)

Online-to-PAC Conversions: Generalization Bounds via Regret Analysis
di: Lugosi, Gábor, et al.
Pubblicazione: (2023)

Structure-Dependent Regret and Constraint Violation Bounds for Online Convex Optimization with Time-Varying Constraints
di: Liu, Xiufeng, et al.
Pubblicazione: (2026)

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
di: Supantha, Subhamon, et al.
Pubblicazione: (2025)

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
di: Zhao, Peng, et al.
Pubblicazione: (2021)

Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
di: Zhao, Peng, et al.
Pubblicazione: (2025)

Alternating Regret for Online Convex Optimization
di: Hait, Soumita, et al.
Pubblicazione: (2025)

Near-Optimal Regret in Adversarial Kernel Bandits
di: Zhang, Yu-Jie, et al.
Pubblicazione: (2026)

Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints
di: Bechavod, Yahav, et al.
Pubblicazione: (2025)

LAPLEX: The FFT of Learnable Laplace Kernels
di: Struski, Łukasz, et al.
Pubblicazione: (2026)

No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
di: Bernasconi, Martino, et al.
Pubblicazione: (2024)

Regret Bounds for Noise-Free Cascaded Kernelized Bandits
di: Li, Zihan, et al.
Pubblicazione: (2022)

Private List Learnability vs. Online List Learnability
di: Hanneke, Steve, et al.
Pubblicazione: (2025)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
di: Tarzanagh, Davoud Ataee, et al.
Pubblicazione: (2022)

Forget, Then Recall: Learnable Compression and Selective Unfolding via Gist Sparse Attention
di: Mao, Yuzhen, et al.
Pubblicazione: (2026)

Online Optimization for Learning to Communicate over Time-Correlated Channels
di: Wu, Zheshun, et al.
Pubblicazione: (2024)

A Combinatorial Characterization of Supervised Online Learnability
di: Raman, Vinod, et al.
Pubblicazione: (2023)

Multiclass Online Learnability under Bandit Feedback
di: Raman, Ananth, et al.
Pubblicazione: (2023)

Improved Dynamic Regret for Online Frank-Wolfe
di: Wan, Yuanyu, et al.
Pubblicazione: (2023)

Limited Memory Online Gradient Descent for Kernelized Pairwise Learning with Dynamic Averaging
di: AlQuabeh, Hilal, et al.
Pubblicazione: (2024)

Kernelized Reinforcement Learning with Order Optimal Regret Bounds
di: Vakili, Sattar, et al.
Pubblicazione: (2023)

No-Regret Algorithms for Safe Bayesian Optimization with Monotonicity Constraints
di: Losalka, Arpan, et al.
Pubblicazione: (2024)

Online Conformal Prediction with Adversarial Semi-bandit Feedback via Regret Minimization
di: Yang, Junyoung, et al.
Pubblicazione: (2026)

Improved Approximate Regret for Decentralized Online Continuous Submodular Maximization via Reductions
di: Wan, Yuanyu, et al.
Pubblicazione: (2026)

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
di: Vaze, Rahul, et al.
Pubblicazione: (2025)

Is Data Valuation Learnable and Interpretable?
di: Wu, Ou, et al.
Pubblicazione: (2024)

Polyhedral Instability Governs Regret in Online Learning
di: Li, Yuetai, et al.
Pubblicazione: (2026)

Linear Transformers with Learnable Kernel Functions are Better In-Context Models
di: Aksenov, Yaroslav, et al.
Pubblicazione: (2024)

Online Learnability of Chain-of-Thought Verifiers: Soundness and Completeness Trade-offs
di: Balcan, Maria-Florina, et al.
Pubblicazione: (2026)

Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications
di: Yang, Sifan, et al.
Pubblicazione: (2026)

Regret-Oracle Complexity Tradeoffs in Agnostic Online Learning
di: Attias, Idan, et al.
Pubblicazione: (2026)

On the Minimax Regret in Online Ranking with Top-k Feedback
di: Zhang, Mingyuan, et al.
Pubblicazione: (2023)

Gradient-Variation Regret Bounds for Unconstrained Online Learning
di: Zhao, Yuheng, et al.
Pubblicazione: (2026)

Logarithmic Regret for Online KL-Regularized Reinforcement Learning
di: Zhao, Heyang, et al.
Pubblicazione: (2025)