A regret minimization approach to training Generative Adversarial Networks (GANs). This was my project in the "Algorithms and Optimization for Big Data" course.
-
Updated
Dec 5, 2018
A regret minimization approach to training Generative Adversarial Networks (GANs). This was my project in the "Algorithms and Optimization for Big Data" course.
Project on preference learning - ENSAE ParisTech
A visualization of a Regret Minimization Learning algorithm for Two Person games, but Avatar themed! 15-251 Fall 2020 Project
Interactive Learning Course | Home Works & Quiz | Fall 2021 | Prof. Majid Nili
c++ implementation of algorithms for solving regret-minimising database queries
POMRL: No-Regret Learning-to-Plan with Increasing Horizons [TMLR 2023]
Probabilistic Future Video Frame Prediction using Generative Adversarial Networks by employing a regret minimization strategy for training GANs.
A python implementaion of Counterfactual Regret Minimization using numba
Source code for Regret synthesis for two-player turn-based game played on graphs - ICRA 22
Paper implementation of Sequential Learning for Multi-Channel Wireless Network Monitoring With Channel Switching Costs
This repository contains code for the paper "Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem".
Add a description, image, and links to the regret-minimization topic page so that developers can more easily learn about it.
To associate your repository with the regret-minimization topic, visit your repo's landing page and select "manage topics."