Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: Dynamical Models and Tracking Regret in Online Convex Programming
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Safe Policy Improvement by Minimizing Robust Baseline Regret
Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity
Further Optimal Regret Bounds for Thompson Sampling
Recursive Decomposition for Nonconvex Optimization
A coordinate gradient descent method for ℓ1-regularized convex minimization
Competing in the dark: an efficient algorithm for bandit linear optimization
dual averaging method for regularized stochastic learning and online optimization .
Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
Stochastic Regret Minimization via Thompson Sampling
Duality between subgradient and conditional gradient methods
Accelerated gradient methods for stochastic optimization and online learning
Online pairwise learning algorithms with convex loss functions
Algorithms and matching lower bounds for approximately-convex optimization
A Cross Entropy based Optimization Algorithm with Global Convergence Guarantees
convex analysis approach to d . c . programming : theory , algorithms and applications .
Adaptive Concentration Inequalities for Sequential Decision Problems
On the Global Linear Convergence of Frank-Wolfe Optimization Variants
Fast Incremental Method for Nonconvex Optimization
An introduction to convex optimization for communications and signal processing
Evolutionary psychology: Controversies, questions, prospects, and limitations
Mass Customization in Supply Chain Management Environment: A Review
Louis Pasteur, from crystals of life to vaccination
Natural Gradient Works Efficiently in Learning
Service Level Agreement in Cloud Computing