Fetching the paper…
Reading the bibliography…
In high-stakes machine learning applications, it is crucial to not only perform well on average, but also when restricted to difficult examples.
Risk aversion in the small and in the large
J. W. Pratt · 1978
Earlier work this paper cites.
Linear programming
K. G. Murty · 1983
Earlier work this paper cites.
Some np-complete problems in quadratic and nonlinear programming
K. G. Murty and S. N. Kabadi · 1987
Earlier work this paper cites.
Principles of risk minimization for learning theory
V. Vapnik · 1992
Earlier work this paper cites.
Titanic, triumph and tragedy
J. P. Eaton and C. A. Haas · 1995
Earlier work this paper cites.
Convolutional networks for images, speech, and time series
Y. LeCun, Y. Bengio, et al · 1995
Earlier work this paper cites.
Teacher’s corner: A note on interpretation of the paired-samples t test
D. W. Zimmerman · 1997
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Y. LeCun, L. Bottou, Y. Bengio, P. Haffner, et al · 1998
Earlier work this paper cites.
Coherent measures of risk
P. Artzner et al · 1999
Earlier work this paper cites.
Adaptive game playing using multiplicative weights
Y. Freund and R. E. Schapire · 1999
Earlier work this paper cites.
Optimization of conditional value-at-risk
R. T. Rockafellar, S. Uryasev, et al · 2000
Earlier work this paper cites.
New support vector algorithms
B. Schölkopf, A. J. Smola, R. C. Williamson, and P. L. Bartlett · 2000
Earlier work this paper cites.
The nonstochastic multiarmed bandit problem
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire · 2002
Earlier work this paper cites.
Portfolio optimization with conditional value-at-risk objective and constraints
P. Krokhmal, J. Palmquist, and S. Uryasev · 2002
Earlier work this paper cites.
Mirror descent and nonlinear projected subgradient methods for convex optimization
A. Beck and M. Teboulle · 2003
Earlier work this paper cites.
Minimizing the sum of the k largest functions in linear time
W. Ogryczak and A. Tamir · 2003
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
M. Zinkevich · 2003
Earlier work this paper cites.
Convex approximations of chance constrained programs
A. Nemirovski and A. Shapiro · 2006
Earlier work this paper cites.
Large deviations bounds for estimating conditional value-at-risk
D. B. Brown · 2007
Earlier work this paper cites.
Power-law distributions in empirical data
A. Clauset, C. R. Shalizi, and M. E. Newman · 2009
Earlier work this paper cites.
Rare event simulation using Monte Carlo methods
G. Rubino and B. Tuffin · 2009
Earlier work this paper cites.
Lectures on stochastic programming: modeling and theory
A. Shapiro, D. Dentcheva, and A. Ruszczyński · 2009
Earlier work this paper cites.
Risk management in the oil supply chain: a cvar approach
M. C. Carneiro et al · 2010
Earlier work this paper cites.
Hedging structured concepts
W. M. Koolen, M. K. Warmuth, and J. Kivinen · 2010
Cited alongside, same era.
Cvar-minimising hedging by a smoothing method
T. Tarnopolskaya and Z. Zhu · 2010
Cited alongside, same era.
Algorithms for adversarial bandit problems with multiple plays
T. Uchiya, A. Nakamura, and M. Kudo · 2010
Cited alongside, same era.
Entropic value-at-risk: A new coherent risk measure
A. Ahmadi-Javid · 2012
Cited alongside, same era.
Towards minimax policies for online linear optimization with bandit feedback
S. Bubeck, N. Cesa-Bianchi, and S. M. Kakade · 2012
Cited alongside, same era.
Combinatorial bandits
N. Cesa-Bianchi and G. Lugosi · 2012
Cited alongside, same era.
Deep residual learning for image recognition
K. He, X. Zhang, S. Ren, and J. Sun · 2016
Later among the works it cites.
Stochastic gradient methods for distributionally robust optimization with f-divergences
H. Namkoong and J. C. Duchi · 2016
Later among the works it cites.
Minimizing the maximal loss: How and why
S. Shalev-Shwartz and Y. Wexler · 2016
Later among the works it cites.
Risk-constrained reinforcement learning with percentile risk criteria
Y. Chow, M. Ghavamzadeh, L. Janson, and M. Pavone · 2017
Later among the works it cites.
UCI machine learning repository, 2017
D. Dua and C. Graff · 2017
Later among the works it cites.
Learning with average top-k loss
Y. Fan, S. Lyu, Y. Ying, and B. Hu · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. E. Hinton, N. Srivastava, A. Krizhevsky, I. Sutskever, and R. R. Salakhutdinov · 2012
Cited alongside, same era.
Determinantal point processes for machine learning
A. Kulesza, B. Taskar, et al · 2012
Cited alongside, same era.
Risk-aversion in multi-armed bandits
A. Sani, A. Lazaric, and R. Munos · 2012
Cited alongside, same era.
Regret in online combinatorial optimization
J.-Y. Audibert, S. Bubeck, and G. Lugosi · 2013
Cited alongside, same era.
A probabilistic theory of pattern recognition , volume 31
L. Devroye, L. Györfi, and G. Lugosi · 2013
Cited alongside, same era.
Prospect theory: An analysis of decision under risk
D. Kahneman and A. Tversky · 2013
Cited alongside, same era.
Variance-based regularization with convex objectives
H. Namkoong and J. C. Duchi · 2017
Later among the works it cites.
Automatic differentiation in pytorch
A. Paszke et al · 2017
Later among the works it cites.
Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms
H. Xiao, K. Rasul, and R. Vollgraf · 2017
Later among the works it cites.
Learning in non-convex games with an optimization oracle
N. Agarwal, A. Gonen, and E. Hazan · 2018
Later among the works it cites.
Data-driven distributionally robust optimization using the wasserstein metric: Performance guarantees and tractable reformulations
P. M. Esfahani and D. Kuhn · 2018
Later among the works it cites.
Bandit algorithms
T. Lattimore and C. Szepesvári · 2018
Later among the works it cites.
Asymptotic equivalence of fixed-size and varying-size determinantal point processes
S. Barthelmé, P.-O. Amblard, N. Tremblay, et al · 2019
Closest in time.
Online variance reduction with mixtures
Z. Borsos, S. Curi, K. Y. Levy, and A. Krause · 2019
Closest in time.
Exact sampling of determinantal point processes with sublinear time preprocessing
M. Dereziński, D. Calandriello, and M. Valko · 2019
Closest in time.
A survey on bias and fairness in machine learning
N. Mehrabi, F. Morstatter, N. Saxena, K. Lerman, and A. Galstyan · 2019
Closest in time.
Fairness risk measures
R. Williamson and A. Menon · 2019
Closest in time.
Multi-player bandits: The adversarial case
P. Alatur, K. Y. Levy, and A. Krause · 2020
Closest in time.
Distributionally robust bayesian optimization
J. Kirschner, I. Bogunovic, S. Jegelka, and A. Krause · 2020
Closest in time.
Learning bounds for risk-sensitive learning
J. Lee, S. Park, and J. Shin · 2020
Closest in time.
Pac-bayesian bound for the conditional value at risk
Z. Mhammedi, B. Guedj, and R. C. Williamson · 2020
Closest in time.
Statistical learning with conditional value at risk
T. Soma and Y. Yoshida · 2020
Closest in time.