Online Learning and Online Convex Optimization

From MaRDI portal
Publication:3166527

DOI10.1561/2200000018zbMath1253.68190OpenAlexW4292022450MaRDI QIDQ3166527

Shai Shalev-Shwartz

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




Related Items (only showing first 100 items - show all)

Dynamic online convex optimization with long-term constraints via virtual queueDistributed online bandit linear regressions with differential privacyA stochastic variant of replicator dynamics in zero-sum games and its invariant measuresApproval policies for modifications to machine learning‐based software as a medical device: A study of bio‐creepOnline one-sided smooth function maximizationOnline bandit convex optimisation with stochastic constraints via two-point feedbackNo-regret algorithms in on-line learning, games and convex optimizationUser-friendly Introduction to PAC-Bayes BoundsNo-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimizationOnline decision making for trading wind energyDistributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithmNonstationary online convex optimization with multiple predictionsNo-regret learning for repeated non-cooperative games with lossy banditsPrincipal component analysis and optimal portfolioBayesian Stochastic Gradient Descent for Stochastic Optimization with Streaming Input DataOnline estimation and community detection of network point processes for event streamsIndependent learning in stochastic gamesOpen issues and recent advances in DC programming and DCAOn the ergodic control of ensemblesSequential testing for elicitable functionals via supermartingalesOn the robustness of learning in games with stochastically perturbed payoff observationsReplicator dynamics: old and newRiemannian game dynamicsImproved algorithms for online load balancingNew First-Order Algorithms for Stochastic Variational InequalitiesOracle-Based Robust Optimization via Online LearningSublinear time algorithms for approximate semidefinite programmingA Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term ConstraintsNonparametric stochastic approximation with large step-sizesDistributed multi-task classification: a decentralized online learning approachLearning in auctions: regret is hard, envy is easyA rolling horizon approach for stochastic mixed complementarity problems with endogenous learning: application to natural gas marketsTracking and Regret Bounds for Online Zeroth-Order Euclidean and Riemannian OptimizationInertial Game Dynamics and Applications to Constrained OptimizationOnline active classification via margin-based and feature-based label queriesStochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex caseCollaborative topic regression for online recommender systems: an online and Bayesian approachUnnamed ItemTesting facility location and dynamic capacity planning for pandemics with demand uncertaintyOn the information-adaptive variants of the ADMM: an iteration complexity perspectiveModeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty SetsPredictive online convex optimizationQuantum tomography by regularized linear regressionsPersonalized optimization with user's feedbackOnline strongly convex optimization with unknown delaysSimple randomized algorithms for online learning with kernelsLogarithmic regret in online linear quadratic control using Riccati updatesUnifying mirror descent and dual averagingOptimal anytime regret with two expertsFeature-aware regularization for sparse online learningRegrets of proximal method of multipliers for online non-convex optimization with long term constraintsPrimal-Dual Algorithms for Optimization with Stochastic DominanceAn axiomatization of information flow measuresDynamic Resource Allocation in the Cloud with Near-Optimal EfficiencyUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemAn online optimization algorithm for the real-time quantum state tomographyScreening Rules and its Complexity for Active Set IdentificationConcentration of tempered posteriors and of their variational approximationsOn the Convergence of Gradient-Like Flows with Noisy Gradient InputScale-free online learningInterference Mitigation via Pricing in Time-Varying Cognitive Radio SystemsEvent-triggered distributed online convex optimization with delayed bandit feedbackAn incremental mirror descent subgradient algorithm with random sweeping and proximal stepBandits with Global Convex Constraints and ObjectiveLearning in games with continuous action sets and unknown payoff functionsOnline Learning Based on Online DCA and Application to Online ClassificationBandit-Based Task Assignment for Heterogeneous CrowdsourcingOnline First-Order Framework for Robust Convex OptimizationLQG Online LearningOnline supervised learning with distributed features over multiagent systemA generalized online mirror descent with applications to classification and regressionApproximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problemsA novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM trainingKernel-based online regression with canal lossUnnamed ItemUnnamed ItemSequential Learning of Regression Models by Penalized EstimationReal-time Bayesian parameter estimation for item response modelsA continuous-time approach to online optimizationTechnical Note—Nonparametric Data-Driven Algorithms for Multiproduct Inventory Systems with Censored DemandA Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic OptimizationUnnamed ItemBounds for the tracking error of first-order online optimization methodsA modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational boundsScale-invariant unconstrained online learningRelative utility bounds for empirically optimal portfoliosConvergence analyses on sparse feedforward neural networks via group lasso regularizationA privacy-masking learning algorithm for online distributed optimization over time-varying unbalanced digraphsMultidimensional Binary Search for Contextual Decision-MakingScaling Techniques for $\epsilon$-Subgradient MethodsVariational Monte Carlo -- bridging concepts of machine learning and high-dimensional partial differential equationsMulti-armed bandit with sub-exponential rewardsA nonconvex penalization algorithm with automatic choice of the regularization parameter in sparse imagingHessian Barrier Algorithms for Linearly Constrained Optimization ProblemsExploiting problem structure in optimization under uncertainty via online convex optimizationLearning in Games via Reinforcement and Regularization




This page was built for publication: Online Learning and Online Convex Optimization