Fetching the paper…
Reading the bibliography…
In practice, optimization models are often prone to unavoidable inaccuracies due to dubious assumptions and corrupted data.
Convex Functions and Dual Extremum Problems
Ralph T Rockafellar · 1963
Earlier work this paper cites.
Convex Analysis
Ralph T Rockafellar · 1970
Earlier work this paper cites.
Conjugate Duality and Optimization
Ralph T Rockafellar · 1974
Earlier work this paper cites.
Extensions of subgradient calculus with applications to optimization
Ralph T Rockafellar · 1985
Earlier work this paper cites.
On approximations and stability in stochastic programming
Peter Kall · 1987
Earlier work this paper cites.
Stability in two-stage stochastic programming
Stephen M Robinson and Roger J-B Wets · 1987
Earlier work this paper cites.
Stability and sensitivity analysis for stochastic programming
Jitka Dupacova · 1990
Earlier work this paper cites.
An exact penalization viewpoint of constrained optimization
James V Burke · 1991
Earlier work this paper cites.
Distribution sensitivity in stochastic programming
Werner Römisch and Rüdiger Schultz · 1991
Earlier work this paper cites.
Optimization: Algorithms and Consistent Approximations
Elijah Polak · 1997
Earlier work this paper cites.
Variational Analysis
Ralph T Rockafellar and Roger J-B Wets · 1998
Earlier work this paper cites.
Robust optimization–methodology and applications
Aharon Ben-Tal and Arkadi Nemirovski · 2002
Earlier work this paper cites.
Convex Analysis in General Vector Spaces
Constantin Zalinescu · 2002
Earlier work this paper cites.
Bi-Level Strategies in Semi-Infinite Programming
Oliver Stein · 2003
Earlier work this paper cites.
Stochastic Finance
Hans Föllmer and Alexander Schied · 2004
Earlier work this paper cites.
Optimal design with probabilistic objective and constraints
Johannes O Royset, Armen Der Kiureghian, and Elijah Polak · 2006
Earlier work this paper cites.
Stability of ε \varepsilon -approximate solutions to convex stochastic programs
Werner Römisch and Roger J-B Wets · 2007
Earlier work this paper cites.
Duality in robust optimization: primal worst equals dual best
Amir Beck and Aharon Ben-Tal · 2009
Earlier work this paper cites.
Robust Optimization
Aharon Ben-Tal, Laurent El Ghaoui, and Arkadi Nemirovski · 2009
Earlier work this paper cites.
Learning multiple layers of features from tiny images
Alex Krizhevsky · 2009
Earlier work this paper cites.
Strong duality in robust convex programming: complete characterizations
Vaithilingam Jeyakumar and Guoyin Li · 2010
Earlier work this paper cites.
MNIST handwritten digit database
Yann LeCun, Corinna Cortes, and CJ Burges · 2010
Earlier work this paper cites.
Lipschitz behavior of the robust regularization
Adrian S Lewis and C H Jeffrey Pang · 2010
Earlier work this paper cites.
On buffered failure probability in design and optimization of structures
Ralph T Rockafellar and Johannes O Royset · 2010
Earlier work this paper cites.
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Heinz H Bauschke and Patrick L Combettes · 2011
Cited alongside, same era.
Theory and applications of robust optimization
Dimitris Bertsimas, David B Brown, and Constantine Caramanis · 2011
Cited alongside, same era.
Robust conjugate duality for convex optimization under uncertainty with application to data classification
Guoyin Li, Vaithilingam Jeyakumar, and Gue Myung Lee · 2011
Cited alongside, same era.
Learning word vectors for sentiment analysis
Andrew L Maas, Raymond E Daly, Peter T Pham, Dan Huang, Andrew Y Ng, and Christopher Potts · 2011
Cited alongside, same era.
Neyman-Pearson classification, convexity and stochastic constraints
Philippe Rigollet and Xin Tong · 2011
Cited alongside, same era.
Generalized McCormick relaxations
Joseph K Scott, Matthew D Stuber, and Paul I Barton · 2011
Approximations and solution estimates in optimization
Johannes O Royset · 2018
Later among the works it cites.
Trimmed statistical estimation via variance reduction
Aleksandr Aravkin and Damek Davis · 2019
Later among the works it cites.
Optimistic distributionally robust optimization for nonparametric likelihood approximation
Viet Anh Nguyen, Soroosh Shafieezadeh Abadeh, Man-Chung Yue, Daniel Kuhn, and Wolfram Wiesemann · 2019
Later among the works it cites.
Maximization of AUC and buffered AUC in binary classification
Matthew Norton and Stan Uryasev · 2019
Later among the works it cites.
DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter
Victor Sanh, Lysandre Debut, Julien Chaumond, and Thomas Wolf · 2019
Later among the works it cites.
An optimistic perspective on offline reinforcement learning
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
Johannes O Royset and Eng Yau Pee · 2012
Cited alongside, same era.
Robust solutions of optimization problems affected by uncertain probabilities
Aharon Ben-Tal, Dick Den Hertog, Anja De Waegenaere, Bertrand Melenberg, and Gijs Rennen · 2013
Cited alongside, same era.
Stability and sensitivity of stochastic dominance constrained optimization models
Darinka Dentcheva and Werner Römisch · 2013
Cited alongside, same era.
The fundamental risk quadrangle in risk management, optimization and statistical estimation
Ralph T Rockafellar and Stan Uryasev · 2013
Cited alongside, same era.
Surrogate duality for robust optimization
Satoshi Suzuki, Daishi Kuroiwa, and Gue Myung Lee · 2013
Cited alongside, same era.
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Jerome Bolte, Shoham Sabach, and Marc Teboulle · 2014
Cited alongside, same era.
Rishabh Agarwal, Dale Schuurmans, and Mohammad Norouzi · 2020
Later among the works it cites.
Fatou’s lemma for weakly converging measures under the uniform integrability condition
Eugene A Feinberg, Pavlo O Kasyanov, and Yan Liang · 2020
Later among the works it cites.
Optimistic distributionally robust policy optimization
Jun Song and Chaoyue Zhao · 2020
Later among the works it cites.
Adversarial weight perturbation helps robust generalization
Dongxian Wu, Shu-Tao Xia, and Yisen Wang · 2020
Later among the works it cites.
Contextual decision-making under parametric uncertainty and data-driven optimistic optimization
Junyu Cao and Rui Gao · 2021
Later among the works it cites.
Statistics of robust optimization: A generalized empirical likelihood approach
John C Duchi, Peter W Glynn, and Hongseok Namkoong · 2021
Later among the works it cites.
A data-driven approach to beating SAA out-of-sample
Jun-ya Gotoh, Michael Jong Kim, and Andrew Lim · 2021
Later among the works it cites.
DFO: A robust framework for data-driven decision-making with outliers
Nan Jiang and Weijun Xie · 2021
Later among the works it cites.
Good and bad optimization models: Insights from Rockafellians
Johannes O Royset · 2021
Later among the works it cites.
An Optimization Primer
Johannes O Royset and Roger J-B Wets · 2021
Later among the works it cites.
Formalizing generalization and robustness of neural networks to weight perturbations
Yu-Lin Tsai, Chia-Yi Hsu, Chia-Mu Yu, and Pin-Yu Chen · 2021
Later among the works it cites.
Mathematical foundations of robust and distributionally robust optimization
Jianzhe Zhen, Daniel Kuhn, and Wolfram Wiesemann · 2021
Later among the works it cites.
Trimmed constrained mixed effects models: Formulations and algorithms
Peng Zheng, Ryan Barber, Reed J D Sorensen, Christopher J L Murray, and Aleksandr Aravkin · 2021
Later among the works it cites.
Deep learning with label noise: A hierarchical approach
Li Chen, Ningyuan (Teresa) Huang, Cong Mu, Hayden S Helm, Kate Lytvynets, Weiwei Yang, and Carey E Priebe · 2022
Closest in time.
On sample average approximation for two-stage stochastic programs without relatively complete recourse
Rui Chen and James Luedtke · 2022
Closest in time.
LoRA: Low-rank adaptation of large language models
Edward J Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen · 2022
Closest in time.
Diametrical risk minimization: Theory and computations
Matthew Norton and Johannes O Royset · 2022
Closest in time.
Let’s make block coordinate descent converge faster: Faster greedy rules, message-passing, active-set complexity, and superlinear convergence
Julie Nutini, Issam Laradji, and Mark Schmidt · 2022
Closest in time.
Learning to reject meets OOD detection: Are all abstentions created equal?
Harikrishna Narasimhan, Aditya Krishna Menon, Wittawat Jitkrittum, and Sanjiv Kumar · 2023
Closest in time.