Vikram V. Ramaswamy

I am a PhD student at Princeton University, working with Prof. Olga Russakovsky. I'm interested in fairness in machine learning, and how it applies to visual systems.

Previously, I did my bachelor's and master's degree at IIT Madras, where I was advised by Prof. Jayalal Sarma.

Email  /  CV  /  GitHib

profile photo

Primarily, I'm interested in algorithmic fairness, and how it applies to computer vision. I've also worked in algorithmic lower bounds and complexity theory.

(α - β) denotes alphabetical ordering.

Fair Attribute Classification through Latent Space De-biasing
Vikram V. Ramaswamy , Sunnie S. Y. Kim, Olga Russakovsky
CVPR, 2021

arxiv  /  code

New Query Lower Bounds for Submodular Function Minimization
(α - β) Andrei Graur, Tristan Pollner, V. Ramaswamy , S. Matthew Weinberg
ICTS, 2020


Space Complexity of Reachability Testing in Labelled Graphs
(α - β) V. Ramaswamy, Jayalal Sarma, K. S. Sunil
LATA, 2017


TA for Theory of Computation , Fall 2018-19, Fall 2019-20

TA for Advanced Complexity Theory , Spring 2018-19

TA for Algorithms and Uncertainity, Fall 2018-19
TA for Discrete Math for CS , Spring 2016-17

TA for Computability and Complexity , Fall 2016-17

Website source