Personalized optimization with user's feedback

DOI10.1016/J.AUTOMATICA.2021.109767MaRDI QIDQ2665405zbMATH OpenOpenAlexFDO

Authors Andrea Simonetto, Emiliano Dall'Anese, Julien Monteil, Andrey Bernstein

Publication date 19 November 2021

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.00775

zbMATH Keywords

cyber-physical systemsGaussian processesmachine learningonline optimizationupper-confidence bounds

Mathematics Subject Classification ID

Gaussian processes (60G15) Numerical analysis (65-XX) Computer science (68-XX)

Recommendations

• Distributed online optimization subject to long-term constraints and time-varying topology: an event-triggered and bandit feedback approach
• Online convex optimization using coordinate descent algorithms
• Extremum seeking for optimal control problems with unknown time-varying systems and unknown objective functions
• Online composite optimization with time-varying regularizers

Cites work

• A Parametric Nonconvex Decomposition Algorithm for Real-Time and Distributed NMPC
• An Incentive-Based Online Optimization Framework for Distribution Grids
• Bayesian reinforcement learning: a survey
• Decentralized Online Learning With Kernels
• Distributed Charging Control of Electric Vehicles Using Online Learning
• Distributed Online Optimization in Dynamic Environments Using Mirror Descent
• Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
• Fast Convergence Rates for Distributed Non-Bayesian Learning
• Gaussian Processes for Learning and Control: A Tutorial with Examples
• Gaussian processes for machine learning.
• Individual Regret Bounds for the Distributed Online Alternating Direction Method of Multipliers
• Information Consistency of Nonparametric Gaussian Process Methods
• Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
• Level Sets and Extrema of Random Processes and Fields
• Markov decision processes with sequential sensor measurements
• On \(\mathcal{L}_\infty\) string stability of nonlinear bidirectional asymmetric heterogeneous platoon systems
• Online convex optimization in the bandit setting: gradient descent without a gradient
• Online Distributed Convex Optimization on Dynamic Networks
• Online learning and online convex optimization
• Online Learning With Inexact Proximal Online Gradient Descent Algorithms
• Online Primal-Dual Methods With Measurement Feedback for Time-Varying Convex Optimization
• Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
• Posterior consistency of Gaussian process prior for nonparametric binary regression
• Prediction-Correction Algorithms for Time-Varying Constrained Optimization
• Prediction-Correction Interior-Point Method for Time-Varying Convex Optimization
• Preference elicitation and query learning
• Prospect Theory: An Analysis of Decision under Risk
• Rates of contraction of posterior distributions based on Gaussian process priors
• Recovering Markov models from closed-loop data
• Regret analysis of stochastic and nonstochastic multi-armed bandit problems
• Vehicular platoons in cyclic interconnections

Cited in

(2)

• No-regret learning for repeated non-cooperative games with lossy bandits
• Personalized Optimization with User's Feedback

This page was built for publication: Personalized optimization with user's feedback

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2665405)