Cover Image

No-Regret Gaussian Process Optimization of Time-Varying Functions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mauduit, Eliabelle, Berthier, Eloïse, Simonetto, Andrea
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Time-varying Gaussian Process Bandit Optimization with Experts: no-regret in logarithmically-many side queries
by: Mauduit, Eliabelle, et al.
Published: (2025)

No-regret optimization of time-varying bilevel problems
by: Mauduit, Eliabelle, et al.
Published: (2026)

Safe Time-Varying Optimization based on Gaussian Processes with Spatio-Temporal Kernel
by: Li, Jialin, et al.
Published: (2024)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

Nonlinear Optimization Filters for Stochastic Time-Varying Convex Optimization
by: Simonetto, Andrea, et al.
Published: (2023)

Prediction-Correction Splittings for Nonsmooth Time-Varying Optimization
by: Bastianello, Nicola, et al.
Published: (2019)

Distributed Prediction-Correction ADMM for Time-Varying Convex Optimization
by: Bastianello, Nicola, et al.
Published: (2020)

Prediction-Correction for Nonsmooth Time-Varying Optimization via Forward-Backward Envelopes
by: Bastianello, Nicola, et al.
Published: (2019)

Wasserstein Barycenter Gaussian Process based Bayesian Optimization
by: Candelieri, Antonio, et al.
Published: (2025)

Concentration inequalities for semidefinite least squares based on data
by: Fabiani, Filippo, et al.
Published: (2025)

Automatic Differentiation of Optimization Algorithms with Time-Varying Updates
by: Mehmood, Sheheryar, et al.
Published: (2024)

Wasserstein Distributionally Robust Regret Optimization
by: Fiechtner, Lukas-Benedikt, et al.
Published: (2025)

Projection-Free Online Convex Optimization with Time-Varying Constraints
by: Garber, Dan, et al.
Published: (2024)

Time-Varying Convex Optimization with $O(n)$ Computational Complexity
by: Rostami, M., et al.
Published: (2024)

Regret Lower Bounds for Learning Linear Quadratic Gaussian Systems
by: Ziemann, Ingvar, et al.
Published: (2022)

Global Optimization of Gaussian Process Acquisition Functions Using a Piecewise-Linear Kernel Approximation
by: Xie, Yilin, et al.
Published: (2024)

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

Frequentist Regret Analysis of Gaussian Process Thompson Sampling via Fractional Posteriors
by: Roy, Somjit, et al.
Published: (2026)

Asymptotically Optimal Regret for Black-Box Predict-then-Optimize
by: Tan, Samuel, et al.
Published: (2024)

Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)

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

Flexible Optimization for Cyber-Physical and Human Systems
by: Simonetto, Andrea
Published: (2024)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
by: Kovalev, Dmitry, et al.
Published: (2024)

tvopt: A Python Framework for Time-Varying Optimization
by: Bastianello, Nicola
Published: (2020)

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
by: Liu, Zijian
Published: (2025)

Online Min-Max Optimization: From Individual Regrets to Cumulative Saddle Points
by: Vyas, Abhijeet, et al.
Published: (2026)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

Regret Analysis of Policy Optimization over Submanifolds for Linearly Constrained Online LQG
by: Chang, Ting-Jui, et al.
Published: (2024)

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
by: Sahinoglu, Emre, et al.
Published: (2025)

Dynamic Regret via Discounted-to-Dynamic Reduction with Applications to Curved Losses and Adam Optimizer
by: Xie, Yan-Feng, et al.
Published: (2026)

Non-stationary and Varying-discounting Markov Decision Processes for Reinforcement Learning
by: Chen, Zhizuo, et al.
Published: (2025)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
by: Hua, Youqing, et al.
Published: (2024)

A Minimal-Assumption Analysis of Q-Learning with Time-Varying Policies
by: Nanda, Phalguni, et al.
Published: (2025)

Personalized incentives as feedback design in generalized Nash equilibrium problems
by: Fabiani, Filippo, et al.
Published: (2022)

High-Resolution Inertial Dynamics with Time-Rescaled Gradients for Nonsmooth Convex Optimization
by: Le, Manh Hung, et al.
Published: (2026)

Regret Analysis: a control perspective
by: Gibson, Travis E., et al.
Published: (2025)

Time-Varying Multi-Objective Optimization: Tradeoff Regret Bounds
by: Shafiei, Allahkaram, et al.
Published: (2022)

DIGing--SGLD: Decentralized and Scalable Langevin Sampling over Time--Varying Networks
by: Bajwa, Waheed U., et al.
Published: (2025)

Decentralized Federated Learning with Gradient Tracking over Time-Varying Directed Networks
by: Nguyen, Duong Thuy Anh, et al.
Published: (2024)

Tail Distribution of Regret in Optimistic Reinforcement Learning
by: Khodadadian, Sajad, et al.
Published: (2025)