kanchi12P's starred repositories
MNIST_GAN
In this notebook, we'll be building a generative adversarial network (GAN) trained on the MNIST dataset. From this, we'll be able to generate new handwritten digits! GANs were first reported on in 2014 from Ian Goodfellow and others in Yoshua Bengio's lab. Since then, GANs have exploded in popularity. Here are a few examples to check out: Pix2Pix CycleGAN & Pix2Pix in PyTorch, Jun-Yan Zhu A list of generative models The idea behind GANs is that you have two networks, a generator 𝐺 and a discriminator 𝐷 , competing against each other. The generator makes "fake" data to pass to the discriminator. The discriminator also sees real training data and predicts if the data it's received is real or fake. The generator is trained to fool the discriminator, it wants to output data that looks as close as possible to real, training data. The discriminator is a classifier that is trained to figure out which data is real and which is fake. What ends up happening is that the generator learns to make data that is indistinguishable from real data to the discriminator. The general structure of a GAN is shown in the diagram above, using MNIST images as data. The latent sample is a random vector that the generator uses to construct its fake images. This is often called a latent vector and that vector space is called latent space. As the generator trains, it figures out how to map latent vectors to recognizable images that can fool the discriminator. If you're interested in generating only new images, you can throw out the discriminator after training. In this notebook, I'll show you how to define and train these adversarial networks in PyTorch and generate new images!
GAN-in-keras-on-mnist
A GAN approach in keras on the mnist dataset using only MLP's
DBMS_SQL-Notes
DBMS_SQL Notes
Computer_science_fundamentals
Computer science fundamentals
Andrew-NG-Notes
This is Andrew NG Coursera Handwritten Notes.
DSA-Bootcamp-Java
This repository consists of the code samples, assignments, and notes for the Java data structures & algorithms + interview preparation bootcamp of WeMakeDevs.
Competitive-Programming-Resources
Competitive Programming & System Design Resources.
competitive-programming
A one-stop Destination✏️ for all your Competitive Programming Resources.📗📕 Refer CONTRIBUTING.md for contributions
Data-Structures-and-Algorithms
A repository that contains all the Data Structures and Algorithms concepts and their implementation in several ways, programming questions and Interview questions. The main aim of this repository is to help students who are learning Data Structures and Algorithms or preparing for an interview.
github-readme-stats
:zap: Dynamically generated stats for your github readmes
Graphing-Calculator
Graphing Calculator written in Python.
graphing-calculator
Basic graphing calculator application in react