Patents by Inventor Aditya Vithal Nori
Aditya Vithal Nori 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).
-
Patent number: 11755743Abstract: This disclosure describes methods and systems for protecting machine learning models against privacy attacks. A machine learning model may be trained using a set of training data and causal relationship data. The causal relationship data may describe a subset of features in the training data that have a causal relationship with the outcome. The machine learning model may learn a function that predicts an outcome based on the training data and the causal relationship data. A predefined privacy guarantee value may be received. An amount of noise may be added to the machine learning model to make a privacy guarantee value of the machine learning model equivalent to or stronger than the predefined privacy guarantee value. The amount of noise may be added at a parameter level of the machine learning model.Type: GrantFiled: September 3, 2019Date of Patent: September 12, 2023Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Amit Sharma, Aditya Vithal Nori, Shruti Shrikant Tople
-
Publication number: 20230267381Abstract: A predictor has a memory which stores at least one example for which an associated outcome is not known. The memory stores at least one decision tree comprising a plurality of nodes connected by edges, the nodes comprising a root node, internal nodes and leaf nodes. Individual ones of the nodes and individual ones of the edges each have an assigned module, comprising parameterized, differentiable operations, such that for each of the internal nodes the module computes a binary outcome for selecting a child node of the internal node. The predictor has a processor configured to compute the prediction by processing the example using a plurality of the differentiable operations selected according to a path through the tree from the root node to a leaf node.Type: ApplicationFiled: April 25, 2023Publication date: August 24, 2023Inventors: Aditya Vithal NORI, Antonio CRIMINISI, Ryutaro TANNO
-
Patent number: 11676078Abstract: A predictor has a memory which stores at least one example for which an associated outcome is not known. The memory stores at least one decision tree comprising a plurality of nodes connected by edges, the nodes comprising a root node, internal nodes and leaf nodes. Individual ones of the nodes and individual ones of the edges each have an assigned module, comprising parameterized, differentiable operations, such that for each of the internal nodes the module computes a binary outcome for selecting a child node of the internal node. The predictor has a processor configured to compute the prediction by processing the example using a plurality of the differentiable operations selected according to a path through the tree from the root node to a leaf node.Type: GrantFiled: July 23, 2018Date of Patent: June 13, 2023Assignee: Microsoft Technology Licensing, LLCInventors: Aditya Vithal Nori, Antonio Criminisi, Ryutaro Tanno
-
Publication number: 20210064760Abstract: This disclosure describes methods and systems for protecting machine learning models against privacy attacks. A machine learning model may be trained using a set of training data and causal relationship data. The causal relationship data may describe a subset of features in the training data that have a causal relationship with the outcome. The machine learning model may learn a function that predicts an outcome based on the training data and the causal relationship data. A predefined privacy guarantee value may be received. An amount of noise may be added to the machine learning model to make a privacy guarantee value of the machine learning model equivalent to or stronger than the predefined privacy guarantee value. The amount of noise may be added at a parameter level of the machine learning model.Type: ApplicationFiled: September 3, 2019Publication date: March 4, 2021Inventors: Amit SHARMA, Aditya Vithal NORI, Shruti Shrikant TOPLE
-
Publication number: 20200005148Abstract: A predictor has a memory which stores at least one example for which an associated outcome is not known. The memory stores at least one decision tree comprising a plurality of nodes connected by edges, the nodes comprising a root node, internal nodes and leaf nodes. Individual ones of the nodes and individual ones of the edges each have an assigned module, comprising parameterized, differentiable operations, such that for each of the internal nodes the module computes a binary outcome for selecting a child node of the internal node. The predictor has a processor configured to compute the prediction by processing the example using a plurality of the differentiable operations selected according to a path through the tree from the root node to a leaf node.Type: ApplicationFiled: July 23, 2018Publication date: January 2, 2020Inventors: Aditya Vithal NORI, Antonio CRIMINISI, Ryutaro TANNO
-
Publication number: 20180285778Abstract: A sensor data processor is described comprising a memory storing a plurality of trained expert models. The machine learning system has a processor configured to receive an unseen sensor data example and, for each trained expert model, compute a prediction from the unseen sensor data example using the trained expert model. The processor is configured to aggregate the predictions to form an aggregated prediction, receive feedback about the aggregated prediction and update, for each trained expert, a weight associated with that trained expert, using the received feedback. The processor is configured to compute a second aggregated prediction by computing an aggregation of the predictions which takes into account the weights.Type: ApplicationFiled: June 20, 2017Publication date: October 4, 2018Inventors: Aditya Vithal NORI, Antonio CRIMINISI, Siddharth ANCHA, Loïc LE FOLGOC
-
Publication number: 20180260531Abstract: A method of training a random decision tree to give improved generalization ability is described. At a split node of the random decision tree a plurality of training sensor data elements available at the split node are divided into a tuning set and a validation set. A plurality of models is formed using the tuning set, each model using different values of parameters of the split node. Performance of the models at splitting the validation set between left and right child nodes of the split node is computed and used to select one of the models.Type: ApplicationFiled: March 10, 2017Publication date: September 13, 2018Inventors: Aditya Vithal Nori, Antonio Criminisi, Siddharth Ancha, Loïc Le Folgoc
-
Publication number: 20180260719Abstract: A machine learning system is described which has a memory storing at least one trained random decision tree and parameters of a plurality of clusters associated with the trained random decision tree. A processor of the machine learning system pushes a sensor data element through the trained random decision tree to compute a prediction and to obtain values of features associated with the sensor data element. The processor selects one of the clusters by comparing the features associated with the received sensor data element and the parameters of the clusters. The memory stores at least one cluster-specific random decision tree, which has been trained using data from the selected cluster. The processor is configured to push the prediction through the cluster-specific random decision tree to compute another prediction. The clusters group together sensor data elements which give rise to similar pathways when pushed through the trained random decision tree.Type: ApplicationFiled: March 10, 2017Publication date: September 13, 2018Inventors: Aditya Vithal Nori, Antonio Criminisi, Loïc Le Folgoc
-
Patent number: 10007866Abstract: A training engine is described which has a memory arranged to access a neural network image classifier, the neural network image classifier having been trained using a plurality of training images from an input space, the training images being labeled for a plurality of classes. The training engine has an adversarial example generator which computes a plurality of adversarial images by, for each adversarial image, searching a region in the input space around one of the training images, the region being one in which the neural network is linear, to find an image which is incorrectly classified into the plurality of classes by the neural network. The training engine has a processor which further trains the neural network image classifier using at least the adversarial images.Type: GrantFiled: April 28, 2016Date of Patent: June 26, 2018Assignee: Microsoft Technology Licensing, LLCInventors: Antonio Criminisi, Aditya Vithal Nori, Dimitrios Vytiniotis, Osbert Bastani, Leonidas Lampropoulos
-
Publication number: 20170316281Abstract: A training engine is described which has a memory arranged to access a neural network image classifier, the neural network image classifier having been trained using a plurality of training images from an input space, the training images being labeled for a plurality of classes. The training engine has an adversarial example generator which computes a plurality of adversarial images by, for each adversarial image, searching a region in the input space around one of the training images, the region being one in which the neural network is linear, to find an image which is incorrectly classified into the plurality of classes by the neural network. The training engine has a processor which further trains the neural network image classifier using at least the adversarial images.Type: ApplicationFiled: April 28, 2016Publication date: November 2, 2017Inventors: Antonio Criminisi, Aditya Vithal Nori, Dimitrios Vytiniotis, Osbert Bastani, Leonidas Lampropoulos
-
Patent number: 8079020Abstract: This paper describes preferential path profiling, which enables profiling a specified subset of all possible program paths with very low overhead. Preferential path profiling compactly identifies paths of interest using an array. More specifically, PPP assigns a unique and compact path index identifier to all interesting paths that can be used to index into a path array. The path array contains a second path value identifier that is used to distinguish interesting paths from other program paths This path numbering allows the implementation of preferential path profiling to use array-based counters instead of hash table-based counters for identifying paths of interest and gathering path profiles, which significantly reduces execution time and computational resource overhead during profiling.Type: GrantFiled: March 5, 2007Date of Patent: December 13, 2011Assignee: Microsoft CorporationInventors: Trishul Amit Madhukar Chilimbi, Kapil Vaswani, Aditya Vithal Nori
-
Publication number: 20080222614Abstract: This paper describes preferential path profiling, which enables profiling a specified subset of all possible program paths with very low overhead. Preferential path profiling compactly identifies paths of interest using an array. More specifically, PPP assigns a unique and compact path index identifier to all interesting paths that can be used to index into a path array. The path array contains a second path value identifier that is used to distinguish interesting paths from other program paths This path numbering allows the implementation of preferential path profiling to use array-based counters instead of hash table-based counters for identifying paths of interest and gathering path profiles, which significantly reduces execution time and computational resource overhead during profiling.Type: ApplicationFiled: March 5, 2007Publication date: September 11, 2008Applicant: Microsoft CorporationInventors: Trishul Amit Madhukar Chilimbi, Kapil Vaswani, Aditya Vithal Nori