Baijiong-Lin / MOMLLinks
[NeurIPS 2021 | AIJ 2024] Multi-Objective Meta Learning
☆15Updated 11 months ago
Alternatives and similar repositories for MOML
Users that are interested in MOML are comparing it to the libraries listed below
Sorting:
- Exact Pareto Optimal solutions for preference based Multi-Objective Optimization☆65Updated 3 years ago
- ☆74Updated 10 months ago
- This is the official implementation for COSMOS: a method to learn Pareto fronts that scales to large datasets and deep models.☆39Updated 4 years ago
- Bi-level Optimization for Advanced Deep Learning☆46Updated 3 years ago
- Code for "Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Losses"☆28Updated last year
- ☆36Updated last year
- LibMOON is a standard and flexible framework to study gradient-based multiobjective optimization.☆102Updated 3 months ago
- A comprehensive list of gradient-based multi-objective optimization algorithms in deep learning.☆75Updated 4 months ago
- Official implementation of NeurIPS'22 paper "Monte Carlo Tree Search based Variable Selection for High-Dimensional Bayesian Optimization"☆41Updated 2 years ago
- Code for Neural Information Processing Systems (NeurIPS) 2019 paper: Pareto Multi-Task Learning☆138Updated 5 years ago
- Summary of Multitasking Optimization☆82Updated last year
- [NeurIPS 2020 Spotlight Oral] "Training Stronger Baselines for Learning to Optimize", Tianlong Chen*, Weiyi Zhang*, Jingyang Zhou, Shiyu …☆27Updated 3 years ago
- Official implementation of Learning The Pareto Front With HyperNetworks [ICLR 2021]☆104Updated 3 years ago
- [AAAI-23] Improving Pareto Front Learning via Multi-Sample Hypernetworks☆9Updated 10 months ago
- Official implementation for the paper "Sample-Then-Optimize Batch Neural Thompson Sampling", published at NeurIPS 2022.☆10Updated 2 years ago
- Benchmark for bi-level optimization solvers☆47Updated last month
- A PyTorch implementation of various Online & Stochastic optimization algorithms for deep learning☆27Updated 3 years ago
- ☆44Updated 9 months ago
- ☆25Updated 3 years ago
- ☆35Updated 2 years ago
- Study NeuralUCB and regret analysis for contextual bandit with neural decision☆95Updated 3 years ago
- Example code for paper "Bilevel Optimization: Nonasymptotic Analysis and Faster Algorithms"☆49Updated 3 years ago
- ☆25Updated 3 years ago
- Code release for "Supported Policy Optimization for Offline Reinforcement Learning" (NeurIPS 2022), https://arxiv.org/abs/2202.06239☆22Updated 2 years ago
- An official JAX-based code for our NeuraLCB paper, "Offline Neural Contextual Bandits: Pessimism, Optimization and Generalization", ICLR…☆14Updated 3 years ago
- Code for the Population-Based Bandits Algorithm, presented at NeurIPS 2020.☆20Updated 4 years ago
- Repository for Beyond Pinball Loss: Quantile Methods for Calibrated Uncertainty Quantification (NeurIPS 2024)☆43Updated 7 months ago
- Large Language Model for MOEA☆58Updated last year
- An implementation of the 2016 meta-learning paper "Learning to Optimize" from the BAIR lab at Berkeley.☆23Updated 4 years ago
- Deep Reinforcement Learning for Efficient Neural Architecture Search (ENAS) in PyTorch, i.e., AutoML. Code based on the paper https://arx…☆8Updated 2 years ago