Interactive Learning Course | Home Works & Quiz | Fall 2021 | Prof. Majid Nili

c++ implementation of algorithms for solving regret-minimising database queries

This repository contains code for the paper "Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem".

A python implementaion of Counterfactual Regret Minimization using numba

FD-RMS

POMRL: No-Regret Learning-to-Plan with Increasing Horizons [TMLR 2023]

Paper implementation of Sequential Learning for Multi-Channel Wireless Network Monitoring With Channel Switching Costs

Create a platform that recommends sustainable farming practices to farmers based on their specific location, soil type, crop choice, and climate conditions. Incorporating data on sustainable agriculture methods could help in increasing crop yield, reducing environmental impact, and promoting biodiversity.

A visualization of a Regret Minimization Learning algorithm for Two Person games, but Avatar themed! 15-251 Fall 2020 Project

A regret minimization approach to training Generative Adversarial Networks (GANs). This was my project in the "Algorithms and Optimization for Big Data" course.

Source code for Regret synthesis for two-player turn-based game played on graphs - ICRA 22

Project on preference learning - ENSAE ParisTech

This repository contains several implementations of multi-armed bandit (MAB) agents applied to a simulated cricket match where an agent selects among different strategies with the goal of maximizing runs while minimizing the risk of getting out.

Probabilistic Future Video Frame Prediction using Generative Adversarial Networks by employing a regret minimization strategy for training GANs.