Imagen de Portada

Small Loss Bounds for Online Learning Separated Function Classes: A Gaussian Process Perspective

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Block, Adam, Shetty, Abhishek
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Partition Function Estimation under Bounded f-Divergence
por: Block, Adam, et al.
Publicado: (2026)

On the Performance of Empirical Risk Minimization with Smoothed Data
por: Block, Adam, et al.
Publicado: (2024)

Oracle-Efficient Differentially Private Learning with Public Data
por: Block, Adam, et al.
Publicado: (2024)

Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks
por: Montasser, Omar, et al.
Publicado: (2025)

Is Multi-Distribution Learning as Easy as PAC Learning: Sharp Rates with Bounded Label Noise
por: Hanashiro, Rafael, et al.
Publicado: (2026)

The Sample Complexity of Approximate Rejection Sampling with Applications to Smoothed Online Learning
por: Block, Adam, et al.
Publicado: (2023)

Smoothed Online Learning for Prediction in Piecewise Affine Systems
por: Block, Adam, et al.
Publicado: (2023)

Oracle-Efficient Smoothed Online Learning for Piecewise Continuous Decision Making
por: Block, Adam, et al.
Publicado: (2023)

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

Taming Imperfect Process Verifiers: A Sampling Perspective on Backtracking
por: Rohatgi, Dhruv, et al.
Publicado: (2025)

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

Tight Bounds for Online Convex Optimization with Adversarial Constraints
por: Sinha, Abhishek, et al.
Publicado: (2024)

Efficiently Computable Safety Bounds for Gaussian Processes in Active Learning
por: Tebbe, Jörn, et al.
Publicado: (2024)

Triplet Loss Based Quantum Encoding for Class Separability
por: Mordacci, Marco, et al.
Publicado: (2025)

Designing a Robust, Bounded, and Smooth Loss Function for Improved Supervised Learning
por: Mahato, Soumi, et al.
Publicado: (2026)

Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint
por: Wang, Juncheng, et al.
Publicado: (2024)

GPgym: A Remote Service Platform with Gaussian Process Regression for Online Learning
por: Dai, Xiaobing, et al.
Publicado: (2024)

Learning with Monotone Adversarial Corruptions
por: Larsen, Kasper Green, et al.
Publicado: (2026)

RoBoSS: A Robust, Bounded, Sparse, and Smooth Loss Function for Supervised Learning
por: Akhtar, Mushir, et al.
Publicado: (2023)

Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints
por: Sarkar, Dhruv, et al.
Publicado: (2025)

Variational Gaussian Process Diffusion Processes
por: Verma, Prakhar, et al.
Publicado: (2023)

On the Growth of Mistakes in Differentially Private Online Learning: A Lower Bound Perspective
por: Dmitriev, Daniil, et al.
Publicado: (2024)

Recurrent Memory for Online Interdomain Gaussian Processes
por: Chen, Wenlong, et al.
Publicado: (2025)

The Space Complexity of Learning-Unlearning Algorithms
por: Cherapanamjeri, Yeshwanth, et al.
Publicado: (2025)

Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization
por: Iwazaki, Shogo
Publicado: (2025)

New Bounds for Sparse Variational Gaussian Processes
por: Titsias, Michalis K.
Publicado: (2025)

Maximally Separated Active Learning
por: Kasarla, Tejaswi, et al.
Publicado: (2024)

Provably Learning from Modern Language Models via Low Logit Rank
por: Golowich, Noah, et al.
Publicado: (2025)

EMA Without the Lag: Bias-Corrected Iterate Averaging Schemes
por: Block, Adam, et al.
Publicado: (2025)

Revisiting the (Sub)Optimality of Best-of-N for Inference-Time Alignment
por: Sriraman, Ved, et al.
Publicado: (2026)

Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes
por: Moon, Sang Bin, et al.
Publicado: (2024)

Order Optimal Bounds for One-Shot Federated Learning over non-Convex Loss Functions
por: Sharifnassab, Arsalan, et al.
Publicado: (2021)

Tolerant Algorithms for Learning with Arbitrary Covariate Shift
por: Goel, Surbhi, et al.
Publicado: (2024)

Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits
por: Iwazaki, Shogo
Publicado: (2025)

Comparison of Data Reduction Criteria for Online Gaussian Processes
por: Wietzke, Thore, et al.
Publicado: (2025)

Regret Analysis for Randomized Gaussian Process Upper Confidence Bound
por: Takeno, Shion, et al.
Publicado: (2024)

Deep Gaussian Processes for Functional Maps
por: Lowery, Matthew, et al.
Publicado: (2025)

An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions
por: Tang, Wei-Ting, et al.
Publicado: (2026)

Error Bounds For Gaussian Process Regression Under Bounded Support Noise With Applications To Safety Certification
por: Reed, Robert, et al.
Publicado: (2024)

Theoretically Grounded Loss Functions and Algorithms for Score-Based Multi-Class Abstention
por: Mao, Anqi, et al.
Publicado: (2023)