Srinath Sridhar Email & Phone Number

California, United States

San Francisco, CA, US

AI and specifically NLP has made tremendous progress in the early R&D phase over the last 2 years. The progress we will make in their industrial applications over the next decade is truly going to be remarkable. Regie.ai, our recommendation engine, is going to help bring all this R&D effort to help businesses with the content they use to communicate.

PiNK test is the future of early detection of Breast cancer using blood draws instead of mammograms. Using cutting-edge AI to leverage multi-analyte liquid biopsy and clinical data, PiNK test aims to improve specificity and sensitivity simultaneously to over 99% which is significantly higher than mammograms. The liquid biopsy test still costs roughly the.

Investor in several Silicon Valley startups.

San Francisco, California, US

Mountain View, California, US

My work at BloomReach can be summarized as building version 1.0 of many of its products and technologies. Every single one of these products below were built from complete scratch all the way to production. About half were built single-handedly and half with a very small team of 1-2 other engineers.BloomSearch: Author of the first production data pipeline.

First 100 engineers of Facebook. Search Ranking: Built the first machine learning based search ranking algorithm for Facebook to improve on a rules based method. This involved collecting all the search query, click-through and downstream action logs, defining and building features, defining loss functions, running a regression to find coefficients for.

Mountain View, CA, US

Duplicate Image Detection: Developed an algorithm based on locality sensitive hashing to automatically detect duplicate images. The primary purpose of this was to have human raters blacklist images and have automatically all the other near duplicate images blacklisted immediately as well and removed from Google product search. Distinguishing.

Pittsburgh, PA, US

Clustering: We developed several fast algorithms to perform clustering. Specifically, one of our algorithms solved the problem of planted bisection on graphs. Bisection or Max-Cut is a well known NP-complete problem. But if the clusters are 'planted', that is, the vertices of the graph are sampled from two clusters that are separated beyond a certain.

Oakland, California, US

Cold Spring Harbor, New York, US

Phd, Computer Science - Algorithms

Bachelor Of Science - Bs, Computer Science (Honors)