Pages that link to "Item:Q5307589"
From MaRDI portal
The following pages link to Logarithmic Regret Algorithms for Online Convex Optimization (Q5307589):
Displaying 20 items.
- One-pass AUC optimization (Q286076) (← links)
- Pegasos: primal estimated sub-gradient solver for SVM (Q633112) (← links)
- Robust exponential memory in Hopfield networks (Q723688) (← links)
- Exponentially concave functions and a new information geometry (Q1746149) (← links)
- Maxi-Min discriminant analysis via online learning (Q1942698) (← links)
- Bounds for the tracking error of first-order online optimization methods (Q2032000) (← links)
- Relative utility bounds for empirically optimal portfolios (Q2040434) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- Opinion dynamics with limited information (Q2190406) (← links)
- Non-Stationary Stochastic Optimization (Q2795881) (← links)
- Primal-Dual Algorithms for Optimization with Stochastic Dominance (Q2954172) (← links)
- Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand (Q2967620) (← links)
- Neural network coding of natural images with applications to pure mathematics (Q2979653) (← links)
- Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (Q4638051) (← links)
- (Q5089186) (← links)
- (Q5091176) (← links)
- Coordinating Pricing and Inventory Replenishment with Nonparametric Demand Learning (Q5129177) (← links)
- Online Learning Based on Online DCA and Application to Online Classification (Q5131197) (← links)
- An Online Policy Gradient Algorithm for Markov Decision Processes with Continuous States and Actions (Q5380403) (← links)
- Technical Note—Nonparametric Data-Driven Algorithms for Multiproduct Inventory Systems with Censored Demand (Q5740215) (← links)
