arXiv subjects

Ratnik Gandhi

Publications and source records attributed to Ratnik Gandhi.

4 recordsLinked to original sources

arXiv2018

Correlated discrete data generation using adversarial training

Generative Adversarial Networks (GAN) have shown great promise in tasks like synthetic image generation, image inpainting, style transfer, and anomaly detection. However, generating discrete data is a challenge. This work presents an adversarial training based correlated discrete data (CDD) generation model. It also details an approach for conditional CDD generation. The results of our approach are presented over two datasets; job-seeking candidates skill set (private dataset) and MNIST (public dataset). From quantitative and qualitative analysis of these results, we show that our model performs better as it leverages inherent correlation in the data, than an existing model that overlooks correlation.

cs.LG↗

arXiv2017

Updating Singular Value Decomposition for Rank One Matrix Perturbation

An efficient Singular Value Decomposition (SVD) algorithm is an important tool for distributed and streaming computation in big data problems. It is observed that update of singular vectors of a rank-1 perturbed matrix is similar to a Cauchy matrix-vector product. With this observation, in this paper, we present an efficient method for updating Singular Value Decomposition of rank-1 perturbed matrix in $O(n^2 \ \text{log}(\frac{1}ε))$ time. The method uses Fast Multipole Method (FMM) for updating singular vectors in $O(n \ \text{log} (\frac{1}ε))$ time, where $ε$ is the precision of computation.

cs.LG↗

arXiv2010

An Algebraic Approach for Computing Equilibria of a Subclass of Finite Normal Form Games

A Nash equilibrium has become important solution concept for analyzing the decision making in Game theory. In this paper, we consider the problem of computing Nash equilibria of a subclass of generic finite normal form games. We define "rational payoff irrational equilibria games" to be the games with all rational payoffs and all irrational equilibria. We present a purely algebraic method for computing all Nash equilibria of these games that uses knowledge of Galois groups. Some results, showing properties of the class of games, and an example to show working of the method concludes the paper.

cs.GT↗

arXiv2010

Some Algebraic Properties of a Subclass of Finite Normal Form Games

We study the problem of computing all Nash equilibria of a subclass of finite normal form games. With algebraic characterization of the games, we present a method for computing all its Nash equilibria. Further, we present a method for deciding membership to the class of games with its related results. An appendix, containing an example to show working of each of the presented methods, concludes the work.

cs.GT↗