Patents by Inventor Satyen Chandrakant Kale

Satyen Chandrakant Kale has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20230394310
    Abstract: Generally, the present disclosure is directed to systems and methods that perform adaptive optimization with improved convergence properties. The adaptive optimization techniques described herein are useful in various optimization scenarios, including, for example, training a machine-learned model such as, for example, a neural network. In particular, according to one aspect of the present disclosure, a system implementing the adaptive optimization technique can, over a plurality of iterations, employ an adaptive effective learning rate while also ensuring that the effective learning rate is non-increasing.
    Type: Application
    Filed: August 22, 2023
    Publication date: December 7, 2023
    Inventors: Sashank Jakkam Reddi, Sanjiv Kumar, Manzil Zaheer, Satyen Chandrakant Kale
  • Patent number: 11775823
    Abstract: Generally, the present disclosure is directed to systems and methods that perform adaptive optimization with improved convergence properties. The adaptive optimization techniques described herein are useful in various optimization scenarios, including, for example, training a machine-learned model such as, for example, a neural network. In particular, according to one aspect of the present disclosure, a system implementing the adaptive optimization technique can, over a plurality of iterations, employ an adaptive effective learning rate while also ensuring that the effective learning rate is non-increasing.
    Type: Grant
    Filed: September 8, 2020
    Date of Patent: October 3, 2023
    Assignee: GOOGLE LLC
    Inventors: Sashank Jakkam Reddi, Sanjiv Kumar, Manzil Zaheer, Satyen Chandrakant Kale
  • Publication number: 20230113984
    Abstract: Generally, the present disclosure is directed to systems and methods that perform adaptive optimization with improved convergence properties. The adaptive optimization techniques described herein are useful in various optimization scenarios, including, for example, training a machine-learned model such as, for example, a neural network. In particular, according to one aspect of the present disclosure, a system implementing the adaptive optimization technique can, over a plurality of iterations, employ an adaptive learning rate while also ensuring that the learning rate is non-increasing.
    Type: Application
    Filed: December 14, 2022
    Publication date: April 13, 2023
    Inventors: Sashank Jakkam Reddi, Sanjiv Kumar, Satyen Chandrakant Kale
  • Patent number: 11586904
    Abstract: Generally, the present disclosure is directed to systems and methods that perform adaptive optimization with improved convergence properties. The adaptive optimization techniques described herein are useful in various optimization scenarios, including, for example, training a machine-learned model such as, for example, a neural network. In particular, according to one aspect of the present disclosure, a system implementing the adaptive optimization technique can, over a plurality of iterations, employ an adaptive learning rate while also ensuring that the learning rate is non-increasing.
    Type: Grant
    Filed: September 13, 2018
    Date of Patent: February 21, 2023
    Assignee: GOOGLE LLC
    Inventors: Sashank Jakkam Reddi, Sanjiv Kumar, Satyen Chandrakant Kale
  • Publication number: 20200401893
    Abstract: Generally, the present disclosure is directed to systems and methods that perform adaptive optimization with improved convergence properties. The adaptive optimization techniques described herein are useful in various optimization scenarios, including, for example, training a machine-learned model such as, for example, a neural network. In particular, according to one aspect of the present disclosure, a system implementing the adaptive optimization technique can, over a plurality of iterations, employ an adaptive effective learning rate while also ensuring that the effective learning rate is non-increasing.
    Type: Application
    Filed: September 8, 2020
    Publication date: December 24, 2020
    Inventors: Sashank Jakkam Reddi, Sanjiv Kumar, Manzil Zaheer, Satyen Chandrakant Kale
  • Patent number: 10769529
    Abstract: Generally, the present disclosure is directed to systems and methods that perform adaptive optimization with improved convergence properties. The adaptive optimization techniques described herein are useful in various optimization scenarios, including, for example, training a machine-learned model such as, for example, a neural network. In particular, according to one aspect of the present disclosure, a system implementing the adaptive optimization technique can, over a plurality of iterations, employ an adaptive effective learning rate while also ensuring that the effective learning rate is non-increasing.
    Type: Grant
    Filed: October 18, 2019
    Date of Patent: September 8, 2020
    Assignee: Google LLC
    Inventors: Sashank Jakkam Reddi, Sanjiv Kumar, Manzil Zaheer, Satyen Chandrakant Kale
  • Publication number: 20200175365
    Abstract: Generally, the present disclosure is directed to systems and methods that perform adaptive optimization with improved convergence properties. The adaptive optimization techniques described herein are useful in various optimization scenarios, including, for example, training a machine-learned model such as, for example, a neural network. In particular, according to one aspect of the present disclosure, a system implementing the adaptive optimization technique can, over a plurality of iterations, employ an adaptive effective learning rate while also ensuring that the effective learning rate is non-increasing.
    Type: Application
    Filed: October 18, 2019
    Publication date: June 4, 2020
    Inventors: Sashank Jakkam Reddi, Sanjiv Kumar, Manzil Zaheer, Satyen Chandrakant Kale
  • Publication number: 20200090031
    Abstract: Generally, the present disclosure is directed to systems and methods that perform adaptive optimization with improved convergence properties. The adaptive optimization techniques described herein are useful in various optimization scenarios, including, for example, training a machine-learned model such as, for example, a neural network. In particular, according to one aspect of the present disclosure, a system implementing the adaptive optimization technique can, over a plurality of iterations, employ an adaptive learning rate while also ensuring that the learning rate is non-increasing.
    Type: Application
    Filed: September 13, 2018
    Publication date: March 19, 2020
    Inventors: Sashank Jakkam Reddi, Sanjiv Kumar, Satyen Chandrakant Kale
  • Patent number: 10594640
    Abstract: One or more computing devices, systems, and/or methods for message classification are provided. For example, a set of messages is clustered into a set of clusters. A cluster comprises messages with similar features (e.g., similar subject lines, message body content, sender information, recipient information, structure, user action such as reading or deleting, spam vote information, etc.). Cluster features are computed for the clusters based upon features of messages within such clusters. A first table, comprising cluster entries corresponding cluster features of clusters, and a second table, comprising message entries corresponding to clusters to which messages are assigned, are created. Message features of a message are created, using the first table and second table, based upon features of the message and cluster features of clusters to which the message is assigned. A message classifier is used to classify the message (e.g., spam, safe, a threat, etc.) based upon the message features.
    Type: Grant
    Filed: December 1, 2016
    Date of Patent: March 17, 2020
    Assignee: Oath Inc.
    Inventors: David Pal, Satyen Chandrakant Kale, Yongxin Xi, Ilambharathi Kanniah, Yuval Peduel, Zohar Shay Karnin, Jyh-Shin Shue
  • Patent number: 10510021
    Abstract: Systems and methods for evaluating a loss function or a gradient of the loss function. In one example embodiment, a computer-implemented method includes partitioning a weight matrix into a plurality of blocks. The method includes identifying a first set of labels for each of the plurality of blocks with a score greater than a first threshold value. The method includes constructing a sparse approximation of a scoring vector for each of the plurality of blocks based on the first set of labels. The method includes determining a correction value for each sparse approximation of the scoring vector. The method includes determining an approximation of a loss or a gradient of a loss associated with the scoring function based on each sparse approximation of the scoring vector and the correction value associated with the sparse approximation of the scoring vector.
    Type: Grant
    Filed: June 7, 2019
    Date of Patent: December 17, 2019
    Assignee: Google LLC
    Inventors: Satyen Chandrakant Kale, Daniel Holtmann-Rice, Sanjiv Kumar, Enxu Yan, Xinnan Yu
  • Publication number: 20190378037
    Abstract: Systems and methods for evaluating a loss function or a gradient of the loss function. In one example embodiment, a computer-implemented method includes partitioning a weight matrix into a plurality of blocks. The method includes identifying a first set of labels for each of the plurality of blocks with a score greater than a first threshold value. The method includes constructing a sparse approximation of a scoring vector for each of the plurality of blocks based on the first set of labels. The method includes determining a correction value for each sparse approximation of the scoring vector. The method includes determining an approximation of a loss or a gradient of a loss associated with the scoring function based on each sparse approximation of the scoring vector and the correction value associated with the sparse approximation of the scoring vector.
    Type: Application
    Filed: June 7, 2019
    Publication date: December 12, 2019
    Inventors: Satyen Chandrakant Kale, Daniel Holtmann-Rice, Sanjiv Kumar, Enxu Yan, Xinnan Yu
  • Publication number: 20180159808
    Abstract: One or more computing devices, systems, and/or methods for message classification are provided. For example, a set of messages is clustered into a set of clusters. A cluster comprises messages with similar features (e.g., similar subject lines, message body content, sender information, recipient information, structure, user action such as reading or deleting, spam vote information, etc.). Cluster features are computed for the clusters based upon features of messages within such clusters. A first table, comprising cluster entries corresponding cluster features of clusters, and a second table, comprising message entries corresponding to clusters to which messages are assigned, are created. Message features of a message are created, using the first table and second table, based upon features of the message and cluster features of clusters to which the message is assigned. A message classifier is used to classify the message (e.g., spam, safe, a threat, etc.) based upon the message features.
    Type: Application
    Filed: December 1, 2016
    Publication date: June 7, 2018
    Inventors: David Pal, Satyen Chandrakant Kale, Yongxin Xi, Ilambharathi Kanniah, Yuval Peduel, Zohar Shay Karnin, Jyh-Shin Shue
  • Publication number: 20100198685
    Abstract: Described is a paid search advertising technology in which ratings values are computed for advertisements (or other web content items) based upon head-to-head evaluations as to which advertisement or advertisements were selected (clicked) from among a set of advertisements that were shown together. Records of a query log contain data of advertisements that were shown together, and each advertisement of those shown together that was clicked. Pairs of advertisements are selected, with the rating value of an advertisement that was clicked increased, and the rating value of the non-clicked advertisement decreased. Only those pairs in which one advertisement was selected and another was not selected may be used as a pair. Elo ratings formulas may be employed for the increasing and decreasing computations. The rating values may be combined with other prediction results into a combined result used to select and/or rank advertisements for returning with a query response.
    Type: Application
    Filed: January 30, 2009
    Publication date: August 5, 2010
    Applicant: Microsoft Corporation
    Inventors: Mohsen Bayati, Mark Braverman, Satyen Chandrakant Kale, Yury Makarychev