Mathematics
Action Space
6%
Applied Statistics
6%
Apply It
6%
Approximate Fixed Point
6%
Approximate Solution
9%
Approximated Matrix
6%
Approximates
77%
Approximation Function
10%
Arbitrary Sequence
13%
Black Box
23%
Boolean Function
6%
Brownian Motion Model
9%
Clique
8%
Competitive Ratio
6%
Concludes
10%
Conditionals
16%
Continuous Time
6%
Control Problems
7%
Convergence Rate
19%
Convex Function
33%
Convex Hull
10%
Convex Set
38%
Cost Function
50%
Decision Maker
13%
Decision Tree
13%
Deep Learning
14%
Deep Neural Network
9%
Dimensional Subspace
13%
Discrete Fourier Transform
6%
Discrete Space
13%
Dynamical System
24%
Eigenvalue
10%
Eigenvector
20%
Euclidean Space
13%
Expander
13%
Expressiveness
6%
Fast Algorithm
14%
Feasible Set
6%
Free Graph
6%
Gaussian Distribution
11%
Geometric Brownian Motion
11%
Gradient-Based Method
13%
Interior Point
16%
Linear Convergence
8%
Linear Dynamical Systems
55%
Linear Function
6%
Linear Regression
23%
Linear System
8%
Linear Time
24%
Lipschitz Continuity
6%
Local Minimum
6%
Local Optimum
6%
Loss Function
76%
Main Result
8%
Markov Decision Process
10%
Matrix (Mathematics)
49%
Mean Square Error
6%
Min-Max
6%
Model Misspecification
6%
Multiplicative
27%
Nash Equilibrium
20%
Natural Generalization
6%
Neural Network
19%
Newton's Method
23%
Nonconvex Problem
6%
Open Problem
33%
Open Question
20%
Optimal Control Theory
9%
Optimality
10%
Parametric
6%
Polynomial
18%
Polynomial Time
30%
Portfolio Management
9%
Potential Function
10%
Priori Knowledge
6%
Quadratic Programming
13%
Quantum State
20%
Regression Function
6%
Regularization
25%
Repeated Game
6%
Rotation Matrix
6%
Running Time
54%
Sampling Technique
13%
Scalar
6%
Set Packing
13%
Stochastic Model
6%
Stochastics
100%
Strictly Convex
10%
Subgradient
13%
Support Vector Machine
13%
Time Series Prediction
13%
Total Cost
6%
Unit Costs
13%
Unit Vector
8%
Upper Bound
16%
Variance
14%
Variance Reduction
6%
Weaker Hypothesis
13%
Wolfe Algorithm
10%
Worst Case
43%
Computer Science
Action Control
6%
Active Learning
6%
Adversarial Model
6%
Adversarial Setting
19%
Approximate Computing
6%
Approximate Solution
6%
Approximated Matrix
6%
Approximation (Algorithm)
11%
Approximation Algorithms
13%
approximation factor
10%
Art Performance
6%
Boolean Function
6%
Boosting Algorithms
10%
Bounded Variation
6%
Case Information
6%
Collaborative Filtering
6%
Comparator
6%
Competitive Ratio
6%
Compressed Sensing
6%
Computability
6%
Computation Time
6%
Concave Function
6%
Control Framework
6%
Convex Function
6%
Convex Optimization
67%
Convex Relaxation
13%
Decision Maker
10%
Decision Trees
13%
Decision-Making
10%
Deep Learning
15%
Deep Neural Network
9%
Design Experiment
13%
Distance Metric
6%
Disturbance Response
6%
Dynamical System
28%
Efficient Algorithm
67%
Eigenvalue
6%
Fast Algorithm
13%
Financial Data
6%
Fixed Points
6%
Fourier Transform
6%
Fundamental Problem
20%
Geometric Brownian Motion
13%
Global Optimality
6%
Gradient Descent
18%
Iterative Application
6%
Iterative Learning Control
6%
Learning Algorithm
15%
Learning Problem
28%
Learning Rate
10%
Learning Result
6%
Linear Classifier
10%
Linear Optimization
33%
Linear Programming
6%
Linear Quadratic Gaussian
9%
Machine Learning
34%
Markov Decision Process
9%
Matrix Vector Product
6%
Memory Consumption
6%
Model-Free Reinforcement Learning
6%
Motion Model
11%
Moving Average
6%
Multiplicative Update
6%
Nash Equilibrium
20%
Neural Network
13%
Newton's Method
30%
Observation Distribution
6%
on-line algorithm
20%
Online Investment
6%
Online Learning
84%
Online Portfolio
13%
Optimal Algorithm
10%
Optimal Control Problem
6%
Optimization Algorithm
15%
Optimization Problem
20%
Performance Measure
6%
Policy Feedback
6%
Polynomial Time
17%
Portfolio Management
15%
Potential Function
10%
Preconditioner
13%
Problem Instance
6%
Regression Task
13%
Regularization
13%
Regularization Method
11%
Reinforcement Learning
22%
Resource Requirement
6%
Rotation Matrix
6%
Second Order Information
9%
Simplex Algorithm
6%
Stochastic Control
6%
Stochastic Optimization
13%
Supervised Learning
15%
Support Vector Machine
6%
Theoretical Lower Bound
6%
Topology Graph
6%
Transform Algorithm
6%
Underlying Distribution
6%
Uniform Sampling
6%
Unsupervised Learning
13%
Keyphrases
Adaptive Regret
8%
Adaptive Subgradient Methods
13%
Algorithm Design
6%
Approximate Equilibrium
8%
Approximation Algorithms
12%
Bandit Convex Optimization
14%
Bandit Feedback
15%
Bandit Learning
6%
Bandits
33%
Best Constant
7%
Black-box Reductions
8%
Boosting Algorithm
11%
Brownian Motion Model
9%
Computationally Efficient
13%
Constant-rebalanced Portfolios
7%
Controller
19%
Convex Cost Function
10%
Convex Optimization
9%
Cost Function
6%
Discrete Space
13%
Efficient Exploration
6%
Expander
13%
Expected Regret
7%
Expert Advice
8%
Fast Convex Optimization
6%
Fast Running
6%
Follow-the-leader
12%
Frank-Wolfe Method
13%
Full Information
9%
General Linear Dynamical Systems
6%
Geometric Brownian Motion
11%
Gradient Boosting
9%
Gradient Descent
10%
Gradient Step
8%
Hard Factors
6%
Hard-margin SVM
10%
Hyperparameter Optimization
6%
Information Feedback
9%
Kappa Coefficient
6%
Learning Algorithm
7%
Learning Problems
6%
Linear Classifier
16%
Linear Dynamical Systems
8%
Linear Optimization
15%
Linear Quadratic Regulator
10%
Logarithmic Regret
16%
Loss Function
28%
Machine Learning
17%
Machine Learning Applications
10%
Markov Decision Process
6%
Minimum Enclosing Ball
10%
Multiplicative Update Algorithm
10%
Nash Equilibrium
13%
Newton's Method
9%
Non-stochastic
20%
Nonconvex Games
13%
NP-hardness
9%
Offline Optimization
9%
On-line Decision Problem
13%
Online Algorithms
10%
Online Control
18%
Online Convex Optimization
20%
Online Gradient Descent
10%
Online Learning
54%
Online Learning Algorithm
10%
Online Linear Optimization
10%
Online Portfolio Selection
8%
Optimal Algorithm
10%
Optimal Regret
14%
Optimization for Machine Learning
13%
Optimization Problem
10%
Oracle
7%
Oracle Model
9%
Polynomial Time
10%
Portfolio Management
9%
Projection-free
13%
Proper Learning
10%
Quantum State
13%
Regret
60%
Regret Bounds
32%
Regret Minimization
30%
Semidefinite Programming
27%
Set Packing
13%
Spanners
6%
Sparsest Cut
6%
Spectral Approach
6%
Stochastic Optimization
10%
Strongly Convex
6%
Strongly Convex Optimization
13%
Sub-linear Regret
6%
Sublinear Time
13%
Theory of Computing
6%
Tight
10%
Time Approximation
10%
Time Series Forecasting
9%
Two-player Games
8%
Variance Reduction
10%
Variation in Cost
13%
Weak Learning
10%
With Memory
6%
