An adaptive stochastic optimization algorithm for resource allocation

MaRDI QIDQ7025139zbMATH OpenFDO

Authors Xavier Fontaine, Shie Mannor, Vianney Perchet

Publication date 19 February 2025

Full work available at URL https://proceedings.mlr.press/v117/fontaine20a.html

zbMATH Keywords

adaptive algorithmsonline learningresource allocationstochastic optimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Stochastic programming (90C15)

Cites work

• A better resource allocation algorithm with semi-bandit feedback
• Algorithmic connections between active learning and stochastic convex optimization
• Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
• Fast algorithms for online stochastic convex programming
• scientific article; zbMATH DE number 3513625 (Why is no real title available?)
• scientific article; zbMATH DE number 3574436 (Why is no real title available?)
• Minimax Bounds for Active Learning
• Near optimal online algorithms and fast approximation algorithms for resource allocation problems
• Regret analysis of stochastic and nonstochastic multi-armed bandit problems
• Semianalytic and subanalytic sets
• The optimum distribution of effort
• The resource allocation problem in flexible manufacturing systems
• Theory of Maxima and the Method of Lagrange

Cited in

(1)

• Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees

This page was built for publication: An adaptive stochastic optimization algorithm for resource allocation

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