Online Learning and Online Convex Optimization
From MaRDI portal
Publication:3166527
DOI10.1561/2200000018zbMath1253.68190OpenAlexW4292022450MaRDI QIDQ3166527
Publication date: 12 October 2012
Published in: Foundations and Trends® in Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/2200000018
Computational learning theory (68Q32) Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (only showing first 100 items - show all)
Dynamic online convex optimization with long-term constraints via virtual queue ⋮ Distributed online bandit linear regressions with differential privacy ⋮ A stochastic variant of replicator dynamics in zero-sum games and its invariant measures ⋮ Approval policies for modifications to machine learning‐based software as a medical device: A study of bio‐creep ⋮ Online one-sided smooth function maximization ⋮ Online bandit convex optimisation with stochastic constraints via two-point feedback ⋮ No-regret algorithms in on-line learning, games and convex optimization ⋮ User-friendly Introduction to PAC-Bayes Bounds ⋮ No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization ⋮ Online decision making for trading wind energy ⋮ Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm ⋮ Nonstationary online convex optimization with multiple predictions ⋮ No-regret learning for repeated non-cooperative games with lossy bandits ⋮ Principal component analysis and optimal portfolio ⋮ Bayesian Stochastic Gradient Descent for Stochastic Optimization with Streaming Input Data ⋮ Online estimation and community detection of network point processes for event streams ⋮ Independent learning in stochastic games ⋮ Open issues and recent advances in DC programming and DCA ⋮ On the ergodic control of ensembles ⋮ Sequential testing for elicitable functionals via supermartingales ⋮ On the robustness of learning in games with stochastically perturbed payoff observations ⋮ Replicator dynamics: old and new ⋮ Riemannian game dynamics ⋮ Improved algorithms for online load balancing ⋮ New First-Order Algorithms for Stochastic Variational Inequalities ⋮ Oracle-Based Robust Optimization via Online Learning ⋮ Sublinear time algorithms for approximate semidefinite programming ⋮ A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints ⋮ Nonparametric stochastic approximation with large step-sizes ⋮ Distributed multi-task classification: a decentralized online learning approach ⋮ Learning in auctions: regret is hard, envy is easy ⋮ A rolling horizon approach for stochastic mixed complementarity problems with endogenous learning: application to natural gas markets ⋮ Tracking and Regret Bounds for Online Zeroth-Order Euclidean and Riemannian Optimization ⋮ Inertial Game Dynamics and Applications to Constrained Optimization ⋮ Online active classification via margin-based and feature-based label queries ⋮ Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case ⋮ Collaborative topic regression for online recommender systems: an online and Bayesian approach ⋮ Unnamed Item ⋮ Testing facility location and dynamic capacity planning for pandemics with demand uncertainty ⋮ On the information-adaptive variants of the ADMM: an iteration complexity perspective ⋮ Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ Predictive online convex optimization ⋮ Quantum tomography by regularized linear regressions ⋮ Personalized optimization with user's feedback ⋮ Online strongly convex optimization with unknown delays ⋮ Simple randomized algorithms for online learning with kernels ⋮ Logarithmic regret in online linear quadratic control using Riccati updates ⋮ Unifying mirror descent and dual averaging ⋮ Optimal anytime regret with two experts ⋮ Feature-aware regularization for sparse online learning ⋮ Regrets of proximal method of multipliers for online non-convex optimization with long term constraints ⋮ Primal-Dual Algorithms for Optimization with Stochastic Dominance ⋮ An axiomatization of information flow measures ⋮ Dynamic Resource Allocation in the Cloud with Near-Optimal Efficiency ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An online optimization algorithm for the real-time quantum state tomography ⋮ Screening Rules and its Complexity for Active Set Identification ⋮ Concentration of tempered posteriors and of their variational approximations ⋮ On the Convergence of Gradient-Like Flows with Noisy Gradient Input ⋮ Scale-free online learning ⋮ Interference Mitigation via Pricing in Time-Varying Cognitive Radio Systems ⋮ Event-triggered distributed online convex optimization with delayed bandit feedback ⋮ An incremental mirror descent subgradient algorithm with random sweeping and proximal step ⋮ Bandits with Global Convex Constraints and Objective ⋮ Learning in games with continuous action sets and unknown payoff functions ⋮ Online Learning Based on Online DCA and Application to Online Classification ⋮ Bandit-Based Task Assignment for Heterogeneous Crowdsourcing ⋮ Online First-Order Framework for Robust Convex Optimization ⋮ LQG Online Learning ⋮ Online supervised learning with distributed features over multiagent system ⋮ A generalized online mirror descent with applications to classification and regression ⋮ Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems ⋮ A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training ⋮ Kernel-based online regression with canal loss ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sequential Learning of Regression Models by Penalized Estimation ⋮ Real-time Bayesian parameter estimation for item response models ⋮ A continuous-time approach to online optimization ⋮ Technical Note—Nonparametric Data-Driven Algorithms for Multiproduct Inventory Systems with Censored Demand ⋮ A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization ⋮ Unnamed Item ⋮ Bounds for the tracking error of first-order online optimization methods ⋮ A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds ⋮ Scale-invariant unconstrained online learning ⋮ Relative utility bounds for empirically optimal portfolios ⋮ Convergence analyses on sparse feedforward neural networks via group lasso regularization ⋮ A privacy-masking learning algorithm for online distributed optimization over time-varying unbalanced digraphs ⋮ Multidimensional Binary Search for Contextual Decision-Making ⋮ Scaling Techniques for $\epsilon$-Subgradient Methods ⋮ Variational Monte Carlo -- bridging concepts of machine learning and high-dimensional partial differential equations ⋮ Multi-armed bandit with sub-exponential rewards ⋮ A nonconvex penalization algorithm with automatic choice of the regularization parameter in sparse imaging ⋮ Hessian Barrier Algorithms for Linearly Constrained Optimization Problems ⋮ Exploiting problem structure in optimization under uncertainty via online convex optimization ⋮ Learning in Games via Reinforcement and Regularization
This page was built for publication: Online Learning and Online Convex Optimization
