Login / Signup
Adaptive Minimax Regret against Smooth Logarithmic Losses over High-Dimensional l1-Balls via Envelope Complexity.
Kohei Miyaguchi
Kenji Yamanishi
Published in:
AISTATS (2019)
Keyphrases
</>
high dimensional
minimax regret
worst case
low dimensional
decision problems
computational complexity
similarity search
data sets
learning algorithm
dimensionality reduction
utility function
bayesian networks
feature space
data points
linear program