Fetching the paper…
Reading the bibliography…
Bi-Level Optimization (BLO) is originated from the area of economic game theory and then introduced into the optimization community.
H. Von Stackelberg and S. H. Von, The theory of the market economy . Oxford University Press, 1952
1952
Earlier work this paper cites.
J. Fortuny-Amat and B. McCarl, “A representation and economic interpretation of a two-level programming problem,” Journal of the Operational Research Society , vol. 32, no. 9, pp. 783–792, 1981
1981
Earlier work this paper cites.
G. Anandalingam and D. White, “A solution method for the linear static stackelberg problem using penalty functions,” IEEE Transactions on Automatic Control , vol. 35, no. 10, pp. 1170–1173, 1990
1990
Earlier work this paper cites.
U.-P. Wen and S.-T. Hsu, “Linear bi-level programming problems—a review,” Journal of the Operational Research Society , vol. 42, no. 2, pp. 125–133, 1991
1991
Earlier work this paper cites.
P. Hansen, B. Jaumard, and G. Savard, “New branch-and-bound rules for linear bilevel programming,” SIAM Journal on scientific and Statistical Computing , vol. 13, no. 5, pp. 1194–1217, 1992
1992
Earlier work this paper cites.
G. Anandalingam and T. L. Friesz, “Hierarchical optimization: An introduction,” Annals of Operations Research , vol. 34, no. 1, pp. 1–11, 1992
1992
Earlier work this paper cites.
L. Vicente, G. Savard, and J. Júdice, “Descent approaches for quadratic bilevel programming,” Journal of Optimization Theory and Applications , vol. 81, no. 2, pp. 379–399, 1994
1994
Earlier work this paper cites.
G. Savard and J. Gauvin, “The steepest descent direction for the nonlinear bilevel programming problem,” Operations Research Letters , vol. 15, no. 5, pp. 265–272, 1994
1994
Earlier work this paper cites.
D. Ralph and S. Dempe, “Directional derivatives of the solution of a parametric nonlinear program,” Mathematical programming , vol. 70, no. 1, pp. 159–172, 1995
1995
Earlier work this paper cites.
P. Loridan and J. Morgan, “Weak via strong stackelberg problem: new results,” Journal of Global Optimization , vol. 8, no. 3, pp. 263–287, 1996
1996
Earlier work this paper cites.
S. Thrun and L. Pratt, “Learning to learn: Introduction and overview,” in Learning to Learn , 1998
1998
Earlier work this paper cites.
S. Dempe and J. F. Bard, “Bundle trust-region algorithm for bilinear bilevel programming,” Journal of Optimization Theory and Applications , vol. 110, no. 2, pp. 265–288, 2001
2001
Earlier work this paper cites.
O. Chapelle, V. Vapnik, O. Bousquet, and S. Mukherjee, “Choosing multiple parameters for support vector machines,” Machine Learning , vol. 46, no. 1-3, pp. 131–159, 2002
2002
Earlier work this paper cites.
A. U. Raghunathan and L. T. Biegler, “Mathematical programs with equilibrium constraints (mpecs) in process engineering,” Computers & chemical engineering , no. 10, pp. 1381–1392, 2003
2003
Earlier work this paper cites.
J. Lu, C. Shi, G. Zhang, and D. Ruan, “An extended branch and bound algorithm for bilevel multi-follower decision making in a referential-uncooperative situation,” International Journal of Information Technology Decision Making , vol. 6, no. 02, pp. 371–388, 2007
2007
Earlier work this paper cites.
S. Dempe, J. Dutta, and B. Mordukhovich, “New necessary optimality conditions in optimistic bilevel programming,” Optimization , vol. 56, no. 5-6, pp. 577–604, 2007
2007
Earlier work this paper cites.
M. Solodov, “An explicit descent method for bilevel convex optimization,” Journal of Convex Analysis , vol. 14, no. 2, p. 227, 2007
2007
Earlier work this paper cites.
C.-s. Foo, C. B. Do, and A. Y. Ng, “Efficient multiple hyperparameter learning for log-linear models,” in NeurPIS , 2008
2008
Earlier work this paper cites.
G. Kunapuli, K. P. Bennett, J. Hu, and J.-S. Pang, “Classification model selection via bilevel programming,” Optimization Methods & Software , vol. 23, no. 4, pp. 475–489, 2008
2008
Earlier work this paper cites.
G. Kunapuli, A bilevel optimization approach to machine learning . Citeseer, 2008
2008
Earlier work this paper cites.
K. P. Bennett, G. Kunapuli, J. Hu, and J.-S. Pang, “Bilevel optimization and machine learning,” in IEEE World Congress on Computational Intelligence , 2008, pp. 25–47
2008
Earlier work this paper cites.
M. W. Seeger, “Cross-validation optimization for large scale structured classification kernel methods,” The Journal of Machine Learning Research , vol. 9, no. Jun, pp. 1147–1178, 2008
2008
Earlier work this paper cites.
B. A. Pearlmutter and J. M. Siskind, “Reverse-mode ad in a functional framework: Lambda the ultimate backpropagator,” ACM Transactions on Programming Languages and Systems , vol. 30, no. 2, pp. 1–36, 2008
2008
Earlier work this paper cites.
A. Chinchuluun, P. M. Pardalos, and H.-X. Huang, “Multilevel (hierarchical) optimization: complexity issues, optimality conditions, algorithms,” in Applied Mathematics and Global Optimization , 2009
2009
Earlier work this paper cites.
R. T. Rockafellar and R. J.-B. Wets, Variational analysis . Springer Science & Business Media, 2009, vol. 317
2009
Earlier work this paper cites.
A. Tsoukalas, W. Wiesemann, B. Rustem et al. , “Global optimisation of pessimistic bi-level problems,” Lectures on Global Optimization , vol. 55, pp. 215–243, 2009
2009
Earlier work this paper cites.
E. S. H. Neto and Á. R. De Pierro, “On perturbed steepest descent methods with inexact line search for bilevel convex optimization,” Optimization , vol. 60, no. 8-9, pp. 991–1008, 2011
2011
Earlier work this paper cites.
J. Domke, “Generic methods for optimization-based modeling,” in Artificial Intelligence and Statistics , 2012
2012
Earlier work this paper cites.
H. I. Calvete, C. Galé, S. Dempe, and S. Lohse, “Bilevel problems over polyhedra with extreme point optimal solutions,” Journal of Global Optimization , vol. 53, no. 3, pp. 573–586, 2012
2012
Earlier work this paper cites.
S. Dempe and J. Dutta, “Is bilevel programming a special case of a mathematical program with complementarity constraints?” Mathematical programming , vol. 131, no. 1, pp. 37–48, 2012
2012
Earlier work this paper cites.
S. Zha, T. N. Pappas, and D. L. Neuhoff, “Hierarchical bilevel image compression based on cutset sampling,” in ICIP , 2012, pp. 2517–2520
2012
Earlier work this paper cites.
B. Kohli, “Optimality conditions for optimistic bilevel programming problem using convexifactors,” Journal of Optimization Theory and Applications , vol. 152, no. 3, pp. 632–651, 2012
2012
Earlier work this paper cites.
S. Dempe and J. Dutta, “Is bilevel programming a special case of a mathematical program with complementarity constraints?” Mathematical Programming , vol. 131, pp. 37–48, 2012
2012
Earlier work this paper cites.
G. B. Allende and G. Still, “Solving bilevel programs with the kkt-approach,” Mathematical Programming , vol. 138, no. 1-2, pp. 309–332, 2013
2013
Earlier work this paper cites.
S. Ukkusuri, K. Doan, and H. A. Aziz, “A bi-level formulation for the combined dynamic equilibrium based traffic signal control,” Procedia-Social and Behavioral Sciences , vol. 80, no. 7, pp. 729–752, 2013
2013
Earlier work this paper cites.
K. Kunisch and T. Pock, “A bilevel optimization approach for parameter learning in variational models,” SIAM Journal on Imaging Sciences , vol. 6, no. 2, pp. 938–983, 2013
2013
Earlier work this paper cites.
J. Bergstra, D. Yamins, and D. Cox, “Making a science of model search: Hyperparameter optimization in hundreds of dimensions for vision architectures,” in ICML , 2013
2013
Earlier work this paper cites.
W. Wiesemann, A. Tsoukalas, P.-M. Kleniati, and B. Rustem, “Pessimistic bilevel optimization,” SIAM Journal on Optimization , vol. 23, no. 1, pp. 353–380, 2013
2013
Earlier work this paper cites.
A. V. Malyshev and A. S. Strekalovsky, “On global search for pessimistic solution in bilevel problems,” International Journal of Biomedical Soft Computing and Human Sciences: the official journal of the Biomedical Fuzzy Systems Association , vol. 18, no. 1, pp. 57–61, 2013
2013
Earlier work this paper cites.
Z. Wan, L. Mao, and G. Wang, “Estimation of distribution algorithm for a class of nonlinear bilevel programming problems,” Information Sciences , vol. 256, pp. 184–196, 2014
2014
Earlier work this paper cites.
C.-A. Deledalle, S. Vaiter, J. Fadili, and G. Peyré, “Stein unbiased gradient estimator of the risk (sugar) for multiple parameter selection,” SIAM Journal on Imaging Sciences , vol. 7, no. 4, pp. 2448–2487, 2014
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” in NeurIPS , 2014
2014
Earlier work this paper cites.
R. Kicsiny, Z. Varga, and A. Scarelli, “Backward induction algorithm for a class of closed-loop stackelberg games,” European Journal of Operational Research , vol. 237, no. 3, pp. 1021–1036, 2014
2014
Earlier work this paper cites.
S. Dempe, B. S. Mordukhovich, and A. B. Zemkoho, “Necessary optimality conditions in pessimistic bilevel programming,” Optimization , vol. 63, no. 4, pp. 505–533, 2014
2014
Earlier work this paper cites.
S. Dempe, V. Kalashnikov, G. A. Pérez-Valdés, and N. Kalashnykova, “Bilevel programming problems,” Energy Systems. Springer, Berlin , 2015
2015
Earlier work this paper cites.
P. Ochs, R. Ranftl, T. Brox, and T. Pock, “Bilevel optimization with nonsmooth lower level problems,” in SSVM , 2015
2015
Earlier work this paper cites.
D. Maclaurin, D. Duvenaud, and R. Adams, “Gradient-based hyperparameter optimization through reversible learning,” in ICML , 2015
2015
Earlier work this paper cites.
N. Couellan and W. Wang, “Bi-level stochastic gradient for large scale support vector machine,” Neurocomputing , vol. 153, 2015
2015
Earlier work this paper cites.
K. A. Khan and P. I. Barton, “A vector forward mode of automatic differentiation for generalized derivative evaluation,” Optimization Methods and Software , vol. 30, no. 6, pp. 1185–1212, 2015
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
S. Dempe and S. Franke, “On the solution of convex bilevel optimization problems,” Computational Optimization and Applications , vol. 63, no. 3, pp. 685–703, 2016
2016
Earlier work this paper cites.
A. B. Zemkoho, “Solving ill-posed bilevel programs,” Set-Valued and Variational Analysis , vol. 24, no. 3, pp. 423–448, 2016
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
F. Pedregosa, “Hyperparameter optimization with approximate gradient,” arXiv:1602.02355 , 2016
2016
Earlier work this paper cites.
K. Li and J. Malik, “Learning to optimize,” arXiv:1606.01885 , 2016
2016
Earlier work this paper cites.
S. Ravi and H. Larochelle, “Optimization as a model for few-shot learning,” in ICLR , 2016
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
J. Ho and S. Ermon, “Generative adversarial imitation learning,” NeurIPS , vol. 29, pp. 4565–4573, 2016
2016
Earlier work this paper cites.
P. Zhou, C. Zhang, and Z. Lin, “Bilevel model-based discriminative dictionary learning for recognition,” IEEE transactions on image processing , vol. 26, no. 3, pp. 1173–1187, 2016
2016
Earlier work this paper cites.
B. Fernando and S. Gould, “Learning end-to-end video classification with rank-pooling,” in ICML , 2016, pp. 1187–1196
2016
Earlier work this paper cites.
M. Andrychowicz, M. Denil, S. Gomez, M. W. Hoffman, D. Pfau, T. Schaul, B. Shillingford, and N. De Freitas, “Learning to learn by gradient descent by gradient descent,” in NeurIPS , 2016
2016
Earlier work this paper cites.
H. Mendoza, A. Klein, M. Feurer, J. T. Springenberg, and F. Hutter, “Towards automatically-tuned neural networks,” in AutoML , 2016
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
J. Luketina, M. Berglund, K. Greff, and T. Raiko, “Scalable gradient-based tuning of continuous regularization hyperparameters,” in ICML , 2016
2016
Earlier work this paper cites.
Y. Zheng, G. Zhang, J. Han, and J. Lu, “Pessimistic bilevel optimization model for risk-averse production-distribution planning,” Information Sciences , vol. 372, pp. 677–689, 2016
2016
Earlier work this paper cites.
A. Sinha, P. Malo, and K. Deb, “A review on bilevel optimization: from classical to evolutionary approaches and applications,” IEEE Transactions on Evolutionary Computation , vol. 22, no. 2, pp. 276–295, 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
Y. Chen, M. W. Hoffman, S. G. Colmenarejo, M. Denil, T. P. Lillicrap, M. Botvinick, and N. Freitas, “Learning to learn without gradient descent by gradient descent,” in ICML , 2017
2017
Earlier work this paper cites.
B. Amos and J. Z. Kolter, “Optnet: Differentiable optimization as a layer in neural networks,” in ICML , 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
C. Finn, P. Abbeel, and S. Levine, “Model-agnostic meta-learning for fast adaptation of deep networks,” in ICML , 2017
2017
Earlier work this paper cites.
Y. Li, J. Song, and S. Ermon, “Infogail: Interpretable imitation learning from visual demonstrations,” in NeurIPS , 2017, pp. 3815–3825
2017
Earlier work this paper cites.
L. Calatroni, C. Cao, J. C. De Los Reyes, C.-B. Schönlieb, and T. Valkonen, “Bilevel approaches for learning of variational imaging models,” Variational Methods: In Imaging and Geometric Control , vol. 18, no. 252, p. 2, 2017
2017
Earlier work this paper cites.
S. Ruder, “An overview of multi-task learning in deep neural networks,” arXiv:1706.05098 , 2017
2017
Earlier work this paper cites.
Y. Lee and S. Choi, “Meta-learning with adaptive layerwise metric and subspace,” in ICML , 2017
2017
Cited alongside, same era.
E. Weinan, “A proposal on machine learning via dynamical systems,” Communications in Mathematics and Statistics , vol. 5, no. 1, pp. 1–11, 2017
2017
Cited alongside, same era.
A. G. Baydin, B. A. Pearlmutter, A. A. Radul, and J. M. Siskind, “Automatic differentiation in machine learning: a survey,” The Journal of Machine Learning Research , vol. 18, no. 1, pp. 5595–5637, 2017
2017
Cited alongside, same era.
A. N. Gomez, M. Ren, R. Urtasun, and R. B. Grosse, “The reversible residual network: Backpropagation without storing activations,” in NeurIPS , 2017
2017
Cited alongside, same era.
S. Dempe, “Bilevel optimization: Theory, algorithms, applications and a bibliography,” in Bilevel Optimization , 2020, pp. 581–672
2020
Later among the works it cites.
S. Wogrin, S. Pineda, and D. A. Tejada-Arango, “Applications of bilevel optimization in energy and electricity markets,” in Bilevel Optimization , 2020, pp. 139–168
2020
Later among the works it cites.
Y. Hu, X. Wu, and R. He, “TF-NAS: rethinking three search freedoms of latency-constrained differentiable neural architecture search,” in ECCV , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
H. Zhang, W. Chen, Z. Huang, M. Li, Y. Yang, W. Zhang, and J. Wang, “Bi-level actor-critic for multi-agent coordination,” in AAAI , vol. 34, no. 05, 2020, pp. 7325–7332
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
S. Sabach and S. Shtern, “A first order method for solving convex bilevel optimization problems,” SIAM Journal on Optimization , vol. 27, no. 2, pp. 640–660, 2017
2017
Cited alongside, same era.
2018
Cited alongside, same era.
L. Franceschi, P. Frasconi, S. Salzo, R. Grazzi, and M. Pontil, “Bilevel programming for hyperparameter optimization and meta-learning,” in ICML , 2018
2018
Cited alongside, same era.
2018
Cited alongside, same era.
B. El-Sobky and Y. Abo-Elnaga, “A penalty method with trust-region mechanism for nonlinear bilevel optimization problem,” Journal of Computational and Applied Mathematics , vol. 340, pp. 360–374, 2018
2018
Cited alongside, same era.
A. Sinha, S. Bedi, and K. Deb, “Bilevel optimization based on kriging approximations of lower level optimal value function,” in 2018 IEEE Congress on Evolutionary Computation (CEC) , 2018, pp. 1–8
2018
Cited alongside, same era.
D. Aussel and C. Lalitha, Generalized Nash equilibrium problems, Bilevel programming and MPEC . Springer, 2018
2018
Cited alongside, same era.
2020
Later among the works it cites.
J. Chen, P. Mu, R. Liu, X. Fan, and Z. Luo, “Flexible bilevel image layer modeling for robust deraining,” in ICME , 2020
2020
Later among the works it cites.
R. Liu, Z. Li, Y. Zhang, X. Fan, and Z. Luo, “Bi-level probabilistic feature learning for deformable image registration,” in IJCAI , 2020
2020
Later among the works it cites.
H. I. Calvete and C. Galé, “Algorithms for linear bilevel optimization,” in Bilevel Optimization , 2020
2020
Later among the works it cites.
R. Liu, P. Mu, X. Yuan, S. Zeng, and J. Zhang, “A generic first-order algorithmic framework for bi-level programming beyond lower-level singleton,” in ICML , 2020
2020
Later among the works it cites.
A. Sharma, “Optimistic variants of single-objective bilevel optimization for evolutionary algorithms,” International Journal of Computational Intelligence and Applications , no. 03, p. 2050020, 2020
2020
Later among the works it cites.
S. E. Yimer, P. Kumam, and A. G. Gebrie, “Proximal gradient method for solving bilevel optimization problems,” Mathematical and Computational Applications , no. 4, p. 66, 2020
2020
Later among the works it cites.
A. B. Zemkoho and S. Zhou, “Theoretical and numerical comparison of the karush–kuhn–tucker and value function reformulations in bilevel optimization,” Computational Optimization and Applications , pp. 1–50, 2020
2020
Later among the works it cites.
T. Okuno and A. Takeda, “Bilevel optimization of regularization hyperparameters in machine learning,” in Bilevel Optimization , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
H. Dong, B. Zou, L. Zhang, and S. Zhang, “Automatic design of cnns via differentiable neural architecture search for polsar image classification,” IEEE Transactions on Geoscience and Remote Sensing , vol. 58, no. 9, pp. 6362–6375, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
L. Wang, Q. Cai, Z. Yang, and Z. Wang, “On the global optimality of model-agnostic meta-learning: Reinforcement learning and supervised learning,” in ICML , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
W. Jiang and S. Siddiqui, “Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent,” EURO Journal on Computational Optimization , vol. 8, no. 1, pp. 85–101, 2020
2020
Later among the works it cites.
J. Lorraine, P. Vicol, and D. Duvenaud, “Optimizing millions of hyperparameters by implicit differentiation,” in AISTATS , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
J. Bae and R. B. Grosse, “Delta-stn: Efficient bilevel optimization for neural networks using structured response jacobians,” in NeurIPS , 2020
2020
Later among the works it cites.
J. Guo, X. Zhu, C. Zhao, D. Cao, Z. Lei, and S. Z. Li, “Learning meta face recognition in unseen domains,” in CVPR , 2020
2020
Later among the works it cites.
Q. Wu, Z. Lin, G. Wang, H. Chen, B. F. Karlsson, B. Huang, and C.-Y. Lin, “Enhanced meta-learning for cross-lingual named entity recognition with minimal resources.” in AAAI , 2020
2020
Later among the works it cites.
J. W. Soh, S. Cho, and N. I. Cho, “Meta-transfer learning for zero-shot super-resolution,” in CVPR , 2020
2020
Later among the works it cites.
P. Tian, Z. Wu, L. Qi, L. Wang, Y. Shi, and Y. Gao, “Differentiable meta-learning model for few-shot semantic segmentation.” in AAAI , 2020
2020
Later among the works it cites.
J.-Y. Hsu, Y.-J. Chen, and H.-y. Lee, “Meta learning for end-to-end low-resource speech recognition,” in ICASSP , 2020
2020
Later among the works it cites.
C. Jiang, H. Xu, W. Zhang, X. Liang, and Z. Li, “Sp-nas: Serial-to-parallel backbone search for object detection,” in CVPR , 2020
2020
Later among the works it cites.
A. Noy, N. Nayman, T. Ridnik, N. Zamir, S. Doveh, I. Friedman, R. Giryes, and L. Zelnik, “Asap: Architecture search, anneal and prune,” in AISTATS , 2020
2020
Later among the works it cites.
T. Elsken, B. Staffler, J. H. Metzen, and F. Hutter, “Meta-learning of neural architectures for few-shot learning,” in CVPR , 2020
2020
Later among the works it cites.
Q. Yao, J. Xu, W.-W. Tu, and Z. Zhu, “Efficient neural architecture search via proximal iterations.” in AAAI , 2020
2020
Later among the works it cites.
S. Hu, S. Xie, H. Zheng, C. Liu, J. Shi, X. Liu, and D. Lin, “Dsnas: Direct neural architecture search without parameter retraining,” in CVPR , 2020
2020
Later among the works it cites.
Q. Yu, D. Yang, H. Roth, Y. Bai, Y. Zhang, A. L. Yuille, and D. Xu, “C2fnas: Coarse-to-fine neural architecture search for 3d medical image segmentation,” in CVPR , 2020
2020
Later among the works it cites.
T. Li, J. Zhang, K. Bao, Y. Liang, Y. Li, and Y. Zheng, “Autost: Efficient neural architecture search for spatio-temporal prediction,” in KDD , 2020
2020
Later among the works it cites.
J. Guo, K. Han, Y. Wang, C. Zhang, Z. Yang, H. Wu, X. Chen, and C. Xu, “Hit-detector: Hierarchical trinity architecture search for object detection,” in CVPR , 2020
2020
Later among the works it cites.
C. He, H. Ye, L. Shen, and T. Zhang, “Milenas: Efficient neural architecture search via mixed-level reformulation,” in CVPR , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
H. Yin, D. Li, X. Li, and P. Li, “Meta-cotgan: A meta cooperative training paradigm for improving adversarial text generation.” in AAAI , 2020
2020
Later among the works it cites.
C. Gao, Y. Chen, S. Liu, Z. Tan, and S. Yan, “Adversarialnas: Adversarial neural architecture search for gans,” in CVPR , 2020
2020
Later among the works it cites.
C. Jin, P. Netrapalli, and M. Jordan, “What is local optimality in nonconvex-nonconcave minimax optimization?” in ICML , 2020, pp. 4880–4889
2020
Later among the works it cites.
Y. Zhang, Q. Cai, Z. Yang, and Z. Wang, “Generative adversarial imitation learning with neural network parameterization: Global optimality and convergence rate,” in ICML , 2020, pp. 11 044–11 054
2020
Later among the works it cites.
J. Yang, I. Borovikov, and H. Zha, “Hierarchical cooperative multi-agent reinforcement learning with skill discovery,” in AAMAS , 2020
2020
Later among the works it cites.
R. Liu, J. Liu, Z. Jiang, X. Fan, and Z. Luo, “A bilevel integrated model with data-driven layer ensemble for multi-modality image fusion,” IEEE Transactions on Image Processing , vol. 30, pp. 1261–1274, 2020
2020
Later among the works it cites.
H. Li and L. Zhang, “A bilevel learning model and algorithm for self-organizing feed-forward neural networks for pattern classification,” IEEE Transactions on Neural Networks and Learning Systems , 2020
2020
Later among the works it cites.
B. Stadie, L. Zhang, and J. Ba, “Learning intrinsic rewards as a bi-level optimization problem,” in UAI , 2020, pp. 111–120
2020
Later among the works it cites.
Q. Pham, D. Sahoo, C. Liu, and S. C. Hoi, “Bilevel continual learning,” arXiv:2007.15553 , 2020
2020
Later among the works it cites.
R. Liu, P. Mu, J. Chen, X. Fan, and Z. Luo, “Investigating task-driven latent feasibility for nonconvex image modeling,” IEEE Transactions on Image Processing , vol. 29, pp. 7629–7640, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
T. Stouraitis, I. Chatzinikolaidis, M. Gienger, and S. Vijayakumar, “Online hybrid motion planning for dyadic collaborative manipulation via bilevel optimization,” IEEE Transactions on Robotics , vol. 36, no. 5, pp. 1452–1471, 2020
2020
Later among the works it cites.
S. Mounsaveng, I. Laradji, I. Ben Ayed, D. Vazquez, and M. Pedersoli, “Learning data augmentation with online bilevel optimization for image classification,” in WACV , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
Z. Borsos, M. Mutnỳ, and A. Krause, “Coresets via bilevel optimization for continual learning and streaming,” in NeurIPS , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
F. Yousefian, “Bilevel distributed optimization in directed networks,” arXiv:2006.07564 , 2020
2020
Later among the works it cites.
Y. Liu, Y. Su, A.-A. Liu, B. Schiele, and Q. Sun, “Mnemonics training: Multi-class incremental learning without forgetting,” in CVPR , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
J. Wang, J. Wu, H. Bai, and J. Cheng, “M-nas: Meta neural architecture search.” in AAAI , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
R. Grazzi, L. Franceschi, M. Pontil, and S. Salzo, “On the iteration complexity of hypergradient computation,” in ICML , 2020
2020
Later among the works it cites.
L. Lampariello and S. Sagratella, “Numerically tractable optimistic bilevel problems,” Computational Optimization and Applications , vol. 76, no. 2, pp. 277–303, 2020
2020
Later among the works it cites.
J. Dutta and T. Pandit, “Algorithms for simple bilevel programming,” in Bilevel Optimization , 2020, pp. 253–291
2020
Later among the works it cites.
A. Raghu, M. Raghu, S. Bengio, and O. Vinyals, “Rapid learning or feature reuse? towards understanding the effectiveness of maml,” in ICLR , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
A. Fallah, A. Mokhtari, and A. Ozdaglar, “On the convergence theory of gradient-based model-agnostic meta-learning algorithms,” in SIATATS , 2020
2020
Later among the works it cites.
B. Zeng, “A practical scheme to compute the pessimistic bilevel optimization problem,” INFORMS Journal on Computing , vol. 32, no. 4, pp. 1128–1142, 2020
2020
Later among the works it cites.
J. Liu, Y. Fan, Z. Chen, and Y. Zheng, “Methods for pessimistic bilevel optimization,” in Bilevel Optimization , 2020, pp. 403–420
2020
Later among the works it cites.
J. Y. Jane, “Constraint qualifications and optimality conditions in bilevel optimization,” in Bilevel Optimization , 2020, pp. 227–251
2020
Later among the works it cites.
P. Borges, C. Sagastizábal, and M. Solodov, “A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming,” Mathematical Programming , 2020
2020
Later among the works it cites.
L. Jing and Y. Tian, “Self-supervised visual feature learning with deep neural networks: A survey,” IEEE transactions on pattern analysis and machine intelligence , vol. PP, no. 99, pp. 1–1, 2020
2020
Later among the works it cites.
Y. Liu and R. Liu, “Boml: A modularized bilevel optimization library in python for meta learning,” in ICME , 2021
2021
Closest in time.
2021
Closest in time.
R. Liu, P. Mu, X. Yuan, S. Zeng, and J. Zhang, “A generic descent aggregation framework for gradient-based bi-level optimization,” in ICML , 2021
2021
Closest in time.
R. Liu, X. Liu, X. Yuan, S. Zeng, and J. Zhang, “A value-function-based interior-point method for non-convex bi-level optimization,” 2021
2021
Closest in time.
T. Kis, A. Kovács, and C. Mészáros, “On optimistic and pessimistic bilevel optimization models for demand response management,” Energies , vol. 14, no. 8, p. 2095, 2021
2021
Closest in time.
Y. Shehu, P. T. Vuong, and A. Zemkoho, “An inertial extrapolation method for convex simple bilevel optimization,” Optimization Methods and Software , vol. 36, no. 1, pp. 1–19, 2021
2021
Closest in time.