Projects

Sparse Regression and Support Recovery bounds for Orthogonal Matching Pursuit

October 05, 2018

Research project, Microsoft Research Lab - India, Bengaluru, India

We study the problem of sparse regression where the goal is to learn a sparse vector that best optimizes a given objective function. Under the assumption that the objective function satisfies restricted strong convexity (RSC), we analyze Orthogonal Matching Pursuit (OMP) and obtain support recovery result as well as a tight generalization error bound for OMP. Furthermore, we obtain lower bounds for OMP, showing that both our results on support recovery and generalization error are tight up to logarithmic factors. To the best of our knowledge, these support recovery and generalization bounds are the first such matching upper and lower bounds (up to logarithmic factors) for any sparse regression algorithm under the RSC assumption.

A case study of Empirical Bayes in Recommendation system

July 11, 2017

Academic Project, Department of Mathematics, Indian Institute of Technology Guwahati

We provide a formulation of empirical bayes described by Atchadé (2011) to tune the hyperparameters of priors used in Bayesian set up of collaborative filter.

Some Approaches of Building Recommendation Systems

May 02, 2017

Bachelor Thesis Project, Department of Mathematics, Indian Institute of Technology Guwahati

The project aims at using different recommendation methods for different kinds of real world data like rating matrices, images and text, using Deep Learning and Optimization.

Mini Search Engine

April 20, 2015

Lab Project, Department of Mathematics, Indian Institute of Technology Guwahati

We used data structures like Hash Tables, Balanced Trees in order to design a text search engine that gives the frequency of the searched word in a given folder of files.