Logarithmic regret algorithms for online convex optimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3128728 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- 10.1162/153244303321897672
- A new algorithm for minimizing convex functions over convex sets
- Applications of second-order cone programming
- Communicating Sequential Processes. The First 25 Years
- Efficient algorithms for online decision problems
- Prediction, Learning, and Games
- Relative loss bounds for multidimensional regression problems
- Stochastic nonstationary optimization for finding universal portfolios
- Universal Portfolios
- Universal portfolios with and without transaction costs.
Cited in
(87)- Group parking permit problems
- Convergence rates for the stochastic gradient descent method for non-convex objective functions
- Weighted last-step min-max algorithm with improved sub-logarithmic regret
- Warranty optimization in a dynamic environment
- Convergence rate of incremental gradient and incremental Newton methods
- Online Bayesian max-margin subspace learning for multi-view classification and regression
- Following the leader and fast rates in online linear prediction: curved constraint sets and other regularities
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
- Aggregating Algorithm for a Space of Analytic Functions
- A generalized online mirror descent with applications to classification and regression
- Online learning and online convex optimization
- Sketch-based empirical natural gradient methods for deep learning
- Online active classification via margin-based and feature-based label queries
- Online bandit convex optimisation with stochastic constraints via two-point feedback
- The computational power of optimization in online learning
- scientific article; zbMATH DE number 7370642 (Why is no real title available?)
- Robust frequent directions with application in online learning
- Lower bounds on individual sequence regret
- Learning rotations with little regret
- Online strongly convex optimization with unknown delays
- Lower bounds on individual sequence regret
- Weighted last-step min-max algorithm with improved sub-logarithmic regret
- Online variance minimization
- PAMR: passive aggressive mean reversion strategy for portfolio selection
- Efficient algorithms for combinatorial online prediction
- Portfolio selection algorithm under financial crisis: a case study with Bursa Malaysia
- Regret bounded by gradual variation for online convex optimization
- Suboptimality of constrained least squares and improvements via non-linear predictors
- Online Variance Minimization
- Two queues with non-stochastic arrivals
- scientific article; zbMATH DE number 7625184 (Why is no real title available?)
- Online convex optimization in the bandit setting: gradient descent without a gradient
- Efficient algorithms for online decision problems
- Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization
- Predictive online convex optimization
- Competitive portfolio selection using stochastic predictions
- The optimal dynamic regret for smoothed online convex optimization with squared \(l_2\) norm switching costs
- Online renewable smooth quantile regression
- Near-optimal algorithms for online matrix prediction
- Regrets of proximal method of multipliers for online non-convex optimization with long term constraints
- A low complexity algorithm with \(O(\sqrt{T})\) regret and \(O(1)\) constraint violations for online convex optimization with long term constraints
- Online first-order framework for robust convex optimization
- Kernel-based online regression with canal loss
- A continuous-time approach to online optimization
- Portfolio selection in non-stationary markets
- The recursive variational Gaussian approximation (R-VGA)
- Adaptive moment estimation for universal portfolio selection strategy
- A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds
- AN ONLINE PORTFOLIO SELECTION ALGORITHM WITH REGRET LOGARITHMIC IN PRICE VARIATION
- Scale-invariant unconstrained online learning
- scientific article; zbMATH DE number 7626738 (Why is no real title available?)
- Logarithmic Regret Algorithms for Online Convex Optimization
- Trading regret for efficiency: online convex optimization with long term constraints
- Concave switching in single-hop and multihop networks
- Online learning over a decentralized network through ADMM
- Improving kernel online learning with a snapshot memory
- Logarithmic regret in online linear quadratic control using Riccati updates
- Scale-invariant unconstrained online learning
- scientific article; zbMATH DE number 7415104 (Why is no real title available?)
- No regret learning in oligopolies: Cournot vs. Bertrand
- scientific article; zbMATH DE number 7626794 (Why is no real title available?)
- A Simple Method for Predicting Covariance Matrices of Financial Returns
- Adaptive sequential machine learning
- Efficient algorithms for online decision problems.
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
- No-regret learning for repeated non-cooperative games with lossy bandits
- Distributed one-pass online AUC maximization
- Online weakly DR-submodular optimization with stochastic long-term constraints
- Real-Time Regression Analysis of Streaming Clustered Data With Possible Abnormal Data Batches
- Online estimation methods for irregular autoregressive models
- Technical note: Nonstationary stochastic optimization under \(L_{p,q} \)-variation measures
- Online learning under one sided \(\sigma\)-smooth function
- Distributed constrained online convex optimization with adaptive quantization
- Opinion dynamics with limited information
- Distributed online bandit linear regressions with differential privacy
- Small-Loss Bounds for Online Learning with Partial Information
- Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks
- An accelerated distributed online gradient push-sum algorithm on time-varying directed networks
- Synthetic control as online linear regression
- Strong Convexity of Feasible Sets in Off-line and Online Optimization
- Kernel-based aggregating learning system for online portfolio optimization
- Online convex optimization using coordinate descent algorithms
- Optimistic optimisation of composite objective with exponentiated update
- Tight analyses for subgradient descent. I: Lower bounds
- No-regret algorithms in on-line learning, games and convex optimization
- Decentralized online strongly convex optimization with general compressors and random disturbances
- Dynamic regret of adaptive gradient methods for strongly convex problems
This page was built for publication: Logarithmic regret algorithms for online convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009221)
