Soham Tamba is a Machine Learning Engineer with 11 years of experience building and deploying deep learning and personalization systems, currently focused on personalization at LinkedIn after a recent stint as an Applied Scientist at Walmart Labs. He has a strong research-to-production track record—fine-tuning and serving LLMs and optimizing low-latency DL inference for e-commerce APIs—backed by an NYU MS (3.94 GPA) and top-tier undergraduate performance from NIT Goa. Soham’s roots in algorithmic research and high-performance computing show through open-source contributions to Julia’s LightGraphs, where he accelerated graph algorithms (e.g., a 63% PageRank speedup) and implemented cache-efficient and parallel variants. Comfortable across the stack, he combines academic rigor in adversarial robustness and transfer learning with practical experience shipping scalable APIs and mentoring OSS contributors. Based in Mountain View, he blends systems-level performance optimization with applied ML for product personalization, often surfacing subtle efficiency gains that materially reduce production latency.
11 years of coding experience
5 years of employment as a software developer
Master's degree, Computer Science, 3.939/4.000, Master's degree, Computer Science, 3.939/4.000 at New York University
Bachelor's degree, Computer Science, 9.21/10.00, Bachelor's degree, Computer Science, 9.21/10.00 at National Institute of Technology Goa
An optimized graphs package for the Julia programming language
Role in this project:
Back-end Developer & Algorithm Specialist
Contributions:24 commits, 33 PRs, 175 comments in 1 year 1 month
Contributions summary:Soham primarily focused on optimizing and implementing graph algorithms within the Julia programming language. Their work involved correcting memory allocation issues in Prim's Minimum Spanning Tree (MST) implementation and improving Kruskal's MST algorithm. The user also added a graph coloring algorithm using a greedy heuristic and implemented and optimized cache-efficient Floyd-Warshall and Johnson shortest path algorithms. Additionally, the user refactored the Kruskal's algorithm to utilize a disjoint set data structure and implemented parallel versions of several graph algorithms, thereby improving the performance of the library.
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.
Request Free Trial
Soham Tamba - Machine Learning Engineer at LinkedIn