Sandeep Routray

Sandeep Routray

MS in Machine Learning

Carnegie Mellon University

Biography

I am a first-year MSML student at Carnegie Mellon University. I work at the intersection of scene understanding, self-supervised learning and robotics. Some of the problems that interest me are:

  • learning actionable representations from scenes encompassing multiple modalities like images, videos, depth maps and 3D data.
  • understanding scenes at different levels of abstraction, from pixel level all the way up to the image level
  • understanding hierarchical relationships among the abstractions, and leveraging them for tasks in robotics.

Previously, I was employed full-time at Samsung Research, Seoul, where I designed a framework, called Map View to extract vectorized home layouts from floorplan images in the wild. Here is our solution showcased at CES 2024 . I have also been a research fellow at the Vector Institute for AI , where I worked with Prof. Sanja Fidler leveraging inter‑image relationships for object‑centric self‑supervised learning.

I graduated from Indian Institute of Technology Kanpur in May 2021, majoring in Electrical Engineering with minors in Machine Learning. I worked on natural language processing, optimization algorithms, stochastic modelling, and wireless networks during my undergraduate days.

For details, check my CV (short) and CV .

Interests
  • Computer Vision
  • Self/Weakly-Supervised Learning
  • Scene Understanding
  • Reinforcement Learning
Education
  • MS in Machine Learning, 2026

    Carnegie Mellon University

  • Btech in Electrical Engineering with Minors in Machine Learning, 2021

    Indian Institute of Technology Kanpur

Recent Publications

Quickly discover relevant content by filtering publications.
(2020). CS-NET at SemEval-2020 Task 4: Siamese BERT for ComVE. In SemEval 2020.

PDF Cite Code Project

(2020). Spectral Efficiency in Poisson Cluster Based HetNets with Users-Basestations Correlation. In ANTS 2020.

PDF Cite Project Video

Projects

*
Smooth Minimax Optimisation in Non-Euclidean Space Using Bregman Divergence Framework
Minimax type of problems arise in several domains such as machine learning, optimization, statistics, communication, and game theory. However, a majority of results are established for the Euclidean norm due to its special self-dual nature.
Smooth Minimax Optimisation in Non-Euclidean Space Using Bregman Divergence Framework
Resource Allocation in OFDMA Systems Using Reinforcement Learning
Long Term Evolution (LTE) makes use of Orthogonal Frequency Division Multiplexing (OFDM) to achieve high downlink data rates. Based on channel conditions of users, a resource scheduler can use dynamic resource allocation to provide best resource to users and optimize system performance.
Resource Allocation in OFDMA Systems Using Reinforcement Learning