BOML: A Modularized Bilevel Optimization Library in Python for Meta Learning
Not on the map. Why?
Abstract (arXiv)
Meta-learning (a.k.a. learning to learn) has recently emerged as a promising paradigm for a variety of applications. There are now many meta-learning methods, each focusing on different modeling aspects of base and meta learners, but all can be (re)formulated as specific bilevel optimization problems. This work presents BOML, a modularized optimization library that unifies several meta-learning algorithms into a common bilevel optimization framework. It provides a hierarchical optimization pipeline together with a variety of iteration modules, which can be used to solve the mainstream categories of meta-learning methods, such as meta-feature-based and meta-initialization-based formulations. The library is written in Python and is available at https://github.com/dut-media-lab/BOML.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 3; 2023: 1; 2024: 2; 2025: 1; 2026: 1.
10 papers.
- 2021Investigating Bi-Level Optimization for Learning and Vision from a Unified Perspective: A Survey and Beyondcited by 151
- 2021Towards Gradient-based Bilevel Optimization with Non-convex Followers and Beyondcited by 62
- 2023Meta-learning in healthcare: A surveycited by 9
- 2022INTERACT: Achieving Low Sample and Communication Complexities in Decentralized Bilevel Learning over Networkscited by 8
- 2022DIAMOND: Taming Sample and Communication Complexities in Decentralized Bilevel Optimizationcited by 7
- 2022A Penalty-Based Method for Communication-Efficient Decentralized Bilevel Programmingcited by 2
- 2024Nonsmooth Implicit Differentiation: Deterministic and Stochastic Convergence Ratescited by 2
- 2024Advancing Generalized Transfer Attack with Initialization Derived Bilevel Optimization and Dynamic Sequence Truncationcited by 2
- 2026DUET: Decentralized Bilevel Optimization without Lower-Level Strong Convexitycited by 1
- 2025Enhancing Privacy in Decentralized Min-Max Optimization: A Differentially Private Approachcited by 0
- 2026DUET: Decentralized Bilevel Optimization without Lower-Level Strong Convexity19 Jun 2026
- 2025Enhancing Privacy in Decentralized Min-Max Optimization: A Differentially Private Approach10 Aug 2025
- 2024Advancing Generalized Transfer Attack with Initialization Derived Bilevel Optimization and Dynamic Sequence Truncation4 Jun 2024
- 2024Nonsmooth Implicit Differentiation: Deterministic and Stochastic Convergence Rates18 Mar 2024
- 2023Meta-learning in healthcare: A survey5 Aug 2023
- 2022DIAMOND: Taming Sample and Communication Complexities in Decentralized Bilevel Optimization5 Dec 2022
- 2022A Penalty-Based Method for Communication-Efficient Decentralized Bilevel Programming8 Nov 2022
- 2022INTERACT: Achieving Low Sample and Communication Complexities in Decentralized Bilevel Learning over Networks27 Jul 2022
- 2021Towards Gradient-based Bilevel Optimization with Non-convex Followers and Beyond1 Oct 2021
- 2021Investigating Bi-Level Optimization for Learning and Vision from a Unified Perspective: A Survey and Beyond27 Jan 2021