Sanjiv Kumar mainly focuses on Artificial intelligence, Pattern recognition, Mathematical optimization, Locality-sensitive hashing and Feature hashing. His work deals with themes such as Hash function and Computer vision, which intersect with Artificial intelligence. His Pattern recognition research includes themes of Contextual image classification, Object detection, Graph and Image retrieval.
His Mathematical optimization study combines topics in areas such as Algorithm, Rounding and Exponential function. Sanjiv Kumar interconnects Universal hashing and Dynamic perfect hashing in the investigation of issues within Locality-sensitive hashing. He has researched Hopscotch hashing in several fields, including Theoretical computer science, 2-choice hashing, Open addressing, Nearest neighbor search and K-independent hashing.
His primary scientific interests are in Artificial intelligence, Pattern recognition, Algorithm, Machine learning and Embedding. His work on Computer vision expands to the thematically related Artificial intelligence. K-nearest neighbors algorithm is closely connected to Hash function in his research, which is encompassed under the umbrella topic of Pattern recognition.
He focuses mostly in the field of Algorithm, narrowing it down to matters related to Mathematical optimization and, in some cases, Exponential function. Sanjiv Kumar has included themes like Contextual image classification and Training set in his Machine learning study. His research on Embedding also deals with topics like
His primary areas of investigation include Artificial intelligence, Machine learning, Transformer, Embedding and Pattern recognition. His research on Artificial intelligence often connects related areas such as Convergence. His studies in Machine learning integrate themes in fields like Training set and Federated learning.
His Transformer study incorporates themes from Theoretical computer science, Information retrieval and Computer engineering. The various areas that Sanjiv Kumar examines in his Embedding study include Classifier and Feature learning. His Pattern recognition study integrates concerns from other disciplines, such as Smoothing and Logit.
The scientist’s investigation covers issues in Artificial intelligence, Machine learning, Transformer, Convergence and Deep learning. His Artificial intelligence study frequently draws connections between adjacent fields such as Simple. His Machine learning research incorporates themes from Simple and Training set.
His Transformer research includes elements of Self attention, Embedding and Information retrieval. His biological study spans a wide range of topics, including Key and Clipping. His work carried out in the field of Deep learning brings together such families of science as Smoothing, Stochastic gradient descent, Stochastic optimization and Hyperparameter.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
On the Convergence of Adam and Beyond
Sashank J. Reddi;Satyen Kale;Sanjiv Kumar.
international conference on learning representations (2018)
On the Convergence of Adam and Beyond
Sashank J. Reddi;Satyen Kale;Sanjiv Kumar.
international conference on learning representations (2018)
Hashing with Graphs
Wei Liu;Jun Wang;Sanjiv Kumar;Shih-fu Chang.
international conference on machine learning (2011)
Hashing with Graphs
Wei Liu;Jun Wang;Sanjiv Kumar;Shih-fu Chang.
international conference on machine learning (2011)
Semi-Supervised Hashing for Large-Scale Search
Jun Wang;S. Kumar;Shih-Fu Chang.
IEEE Transactions on Pattern Analysis and Machine Intelligence (2012)
Semi-Supervised Hashing for Large-Scale Search
Jun Wang;S. Kumar;Shih-Fu Chang.
IEEE Transactions on Pattern Analysis and Machine Intelligence (2012)
Semi-supervised hashing for scalable image retrieval
Jun Wang;Sanjiv Kumar;Shih-Fu Chang.
computer vision and pattern recognition (2010)
Semi-supervised hashing for scalable image retrieval
Jun Wang;Sanjiv Kumar;Shih-Fu Chang.
computer vision and pattern recognition (2010)
Discriminative random fields: a discriminative framework for contextual interaction in classification
Sanjiv Kumar;Hebert.
international conference on computer vision (2003)
Discriminative random fields: a discriminative framework for contextual interaction in classification
Sanjiv Kumar;Hebert.
international conference on computer vision (2003)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Columbia University
Google (United States)
University of California, Los Angeles
Google (United States)
Carnegie Mellon University
MIT
Columbia University
Tencent (China)
Carnegie Mellon University
Google (United States)
Spanish National Research Council
Toulouse Institute of Computer Science Research
University of Oregon
Fluminense Federal University
State University of New York
Yale University
Brigham and Women's Hospital
University of California, Irvine
The University of Texas at Austin
University of California, Los Angeles
Michigan State University
Bangor University
The University of Texas Health Science Center at San Antonio
VA Palo Alto Health Care System
Medical University of Silesia
Murdoch University