Patents by Inventor Perepu SATHEESH KUMAR

Perepu SATHEESH KUMAR 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: 20240113947
    Abstract: Embodiments herein may e.g. relate to a method performed by a network node (12) for handling one or more operations in a communications network comprising a plurality of computing devices (10,11) performing one or more tasks. The network node (12) obtains an indication of a failure of an operation in the communications network; and obtains one or more parameters to resolve the failure. The one or more parameters relate to resources of the plurality of computing devices (10,11) and the communications network (1), wherein the one or more parameters are structured in an hierarchic manner and defined by a task of a capability, a resource used for the task, and a service level for the task. The network node (12) generates a plan by taking an aimed service level into account as well as the obtained one or more parameters; and executes one or more operations using the generated plan.
    Type: Application
    Filed: December 11, 2020
    Publication date: April 4, 2024
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Perepu SATHEESH KUMAR, Saravanan M
  • Publication number: 20240095525
    Abstract: A computer-implemented method for building a machine learning (ML) model is provided. The method includes training a ML model using a set of input data, wherein the ML model includes a plurality of layers and each layer includes a plurality of filters, and wherein the set of input data includes class labels; obtaining a set of output data from training the ML model, wherein the set of output data includes class probabilities values; determining, for each layer in the ML model, by using the class labels and the class probabilities values, a working value for each filter in the layer; determining, for each layer in the ML model, a dominant filter, wherein the dominant filter is determined based on whether the working value for the filter exceeds a threshold; and building a subset ML model based on each dominant filter for each layer, wherein the subset ML model is a subset of the ML model.
    Type: Application
    Filed: February 4, 2021
    Publication date: March 21, 2024
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Perepu SATHEESH KUMAR, M SARAVANAN, Sai Hareesh ANAMANDRA
  • Publication number: 20240046111
    Abstract: A computer-implemented method includes: obtaining loss functions including: a first loss function associated with a first reinforcement learning, RL, model performed by a first local agent, wherein the first loss function is a function of one or more first parameters; and a second loss function associated with a second RL model at a second local agent, wherein the second loss function is a function of one or more second parameters; determining a combined loss function based on the loss functions; minimizing the combined loss function with respect to the first parameters and the second parameters to determine updated values for the first parameters and updated values for the second parameters; initiating execution of a first updated action by the first local agent based on the updated values of the first parameters; and initiating execution of a second updated action by the second local agent based on the updated values of the second parameters.
    Type: Application
    Filed: December 22, 2020
    Publication date: February 8, 2024
    Inventors: Kaushik DEY, Perepu SATHEESH KUMAR
  • Publication number: 20230297844
    Abstract: A method for distributed learning at a local computing device is provided. The method includes: training a local model of a first model type on local data, wherein the local data comprises a first set of labels; testing the local model on a portion of global data pertaining to the first set of labels, wherein the global data comprises a second set of labels and the first set of labels is a strict subset of the second set of labels; as a result of testing the local model on the portion of the global data pertaining to the first set of labels, producing a first set of probabilities corresponding to the first set of labels; and sending the first set of probabilities corresponding to the first set of labels to a central computing device.
    Type: Application
    Filed: July 17, 2020
    Publication date: September 21, 2023
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Perepu SATHEESH KUMAR, Gautham Krishna GUDUR
  • Publication number: 20230153633
    Abstract: A method for training a central model in a federated learning system is provide. The method includes receiving a first update from a first local model of a set of local models; receiving a second update from a second local model of the set of local models; enqueueing the first update and the second update in one more queues corresponding to the set of local models; selecting an update from the one or more queues to apply to a central model based on determining that a selection criteria is satisfied, the selection criteria being related to a quality of the central model; and applying the selected update to the central model or instructing a node to apply the selected update to the central model.
    Type: Application
    Filed: October 7, 2019
    Publication date: May 18, 2023
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Swarup Kumar MOHALIK, Perepu SATHEESH KUMAR, Anshu SHUKLA
  • Patent number: 11652709
    Abstract: A method for managing computation load of a fog node is disclosed, wherein a computation capacity of the fog node is predicted to become unavailable to a fog network. The method comprises identifying a candidate set of nodes for computational load transfer from the fog node. The method further comprises obtaining a computation graph representing computation in the fog network, and using a learning model to identify a morphism from the obtained computation graph to a new computation graph, in which the fog node is not included. The identified morphism comprises a sequence of one or more morphing operations that replaces the fog node in the obtained computation graph with a topology of one or more nodes selected from the candidate set. The method further comprises causing computation performed at the fog node to be transferred to one or more nodes of the candidate set.
    Type: Grant
    Filed: November 9, 2018
    Date of Patent: May 16, 2023
    Assignee: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Saravanan Mohan, Arindam Banerjee, Perepu Satheesh Kumar
  • Publication number: 20230142351
    Abstract: Methods and systems for searching and retrieving information. In one aspect, there is a method of retrieving information using a knowledge base. The method comprises receiving a search query entered by a user and using a first model to identify a category corresponding to the received search query. The method further comprises based on the received search query, a loss function of the first model, and an objective function of a second model, identifying T topics corresponding to the received search query, and performing a search for the received search query only on a part of the knowledge base that is associated with the identified category and/or the identified topics. The method further comprises retrieving one or more files associated with the identified category and/or the identified topics.
    Type: Application
    Filed: March 28, 2020
    Publication date: May 11, 2023
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Saravanan M, Perepu SATHEESH KUMAR
  • Publication number: 20230065937
    Abstract: A method performed by a local client computing device is provided. The method includes training a local model using data from the local client computing device, resulting in a local model update; sending the local model update to a central server computing device; receiving from the central server computing device a first updated global model; determining that the first updated global model does not meet a local criteria, wherein determining that the first updated global model does not meet a local criteria comprises computing a score based on the first updated global model, wherein the score exceeds a threshold; in response to determining that the first updated global model does not meet a local criteria, sending to the central server computing device context information; and receiving from the central server computing device a second updated global model.
    Type: Application
    Filed: January 16, 2020
    Publication date: March 2, 2023
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Perepu SATHEESH KUMAR, Saravanan M, Senthamiz Selvi ARUMUGAM
  • Patent number: 11570238
    Abstract: In one aspect, a method performed by a network node for predicting a probability of state change of a node (e.g., a fog node) in a network is provided. The network node determines a set of weights based on attributes of the node. The network node estimates the probability of state change of the node using the determined set of weights and a set of one or more attribute values related to the node where determining the set of weights includes maximizing an evaluation value associated to the node.
    Type: Grant
    Filed: December 22, 2017
    Date of Patent: January 31, 2023
    Assignee: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: Saravanan Mohan, Arindam Banerjee, Perepu Satheesh Kumar
  • Publication number: 20230004776
    Abstract: A method for detecting and reducing the impact of deficient nodes in a machine learning system is provided. The method includes receiving a local model update from a first local client node; determining a change in accuracy caused by the local model update; determining that the change in accuracy is below a first threshold; and in response to determining that the change in accuracy is below the first threshold, sending a request to the first local client node signaling the first local client node to compress local model updates.
    Type: Application
    Filed: December 5, 2019
    Publication date: January 5, 2023
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Perepu SATHEESH KUMAR, Saravanan M
  • Publication number: 20220351039
    Abstract: A method on a central node or server is provided.
    Type: Application
    Filed: October 4, 2019
    Publication date: November 3, 2022
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Perepu SATHEESH KUMAR, Saravanan M., Swarup Kumar MOHALIK, Ankit JAUHARI, Anshu SHUKLA
  • Publication number: 20220329506
    Abstract: The present disclosure relates to a method performed by a cloud node (104) for handling sensor nodes and fog nodes in a communications system (100), wherein the communications system comprises a plurality of sensor nodes (110) located at a plurality of locations, to be handled by the fog nodes (120), the method comprising obtaining (S300) a first number of sensor nodes and their respective locations, out of said plurality of sensor nodes, to monitor the communications system in its entirety, based on measurements from at least some of the plurality of sensor nodes at their respective locations; determining (S310) a second number of said fog nodes and their respective location, based on the first number of sensor nodes and a connectivity capacity of said second number of fog nodes, where the second number of fog nodes is determined to cover said first number of sensor nodes; ranking (S320) said second number of fog nodes according to a conditional probability of failure for the second number of fog nodes, base
    Type: Application
    Filed: September 6, 2019
    Publication date: October 13, 2022
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Perepu SATHEESH KUMAR, Saravanan M
  • Publication number: 20220156658
    Abstract: A method for managing resources includes applying an ensemble model having a plurality of sub-models such that an output of the ensemble model is a weighted average of predictions from the sub-models, and is a prediction of multiple parameters. The method includes determining that an accuracy of the ensemble model is below a first threshold; and as a result, optimizing weights for the predictions from the sub-models. Optimizing weights for the predictions from the sub-models includes: updating the weights selected by the reinforcement learning by looking ahead over a prediction horizon and optimizing the reward function at the given time instance. The method further includes using the prediction of the multiple parameters to manage resources.
    Type: Application
    Filed: March 5, 2019
    Publication date: May 19, 2022
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Saravanan MOHAN, Perepu SATHEESH KUMAR
  • Publication number: 20220147954
    Abstract: The present disclosure relates to methods, as well as corresponding systems, computer programs, computer program products, and computer-readable media. The method comprises training a model to predict, based on data about a collection of uses of a communication service, whether the collection of uses of the communication service is likely to lead to a billing dispute. The training is performed using historical data. The historical data includes data about multiple collections of uses of the communication service and information regarding whether bills generated for the respective collections of uses of the communications service have been disputed by customers. The method comprises obtaining data about a new collection of uses of the communication service by a customer. The method comprises predicting, using the trained model, whether the new collection of uses of the communication service is likely to lead to a billing dispute.
    Type: Application
    Filed: February 28, 2019
    Publication date: May 12, 2022
    Inventors: Saravanan Mohan, Kollapalli Ganesh, Perepu Satheesh Kumar
  • Publication number: 20220101140
    Abstract: A method for explaining deep-learning models is provided. The method includes extracting a set of features from a first deep-learning model for a first set of training data; clustering the set of features into N groups, wherein N represents a number of unique labels in the first set of training data; forming a clustering matrix from the N groups; and determining dominant columns in the clustering matrix to form a subset of the set of features.
    Type: Application
    Filed: June 14, 2019
    Publication date: March 31, 2022
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Perepu SATHEESH KUMAR, SARAVANAN M
  • Publication number: 20220058075
    Abstract: A method (200) for identifying a fault in data representing a target variable of a system is disclosed. The system comprises a plurality of variables and each variable is represented by a data stream. The method comprises obtaining a reference data set for a set of variables in the system including the target variable (202), obtaining an operational data set for the set of variables in the system including the target variable (204) and, for each of the reference and operational data sets, constructing an adjacency matrix between the target variable and the other variables in the set of variables (208), wherein the adjacency matrix is constructed on the basis of a metric calculated between the target variable and the other variables of the set (208a).
    Type: Application
    Filed: December 12, 2018
    Publication date: February 24, 2022
    Applicant: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Perepu SATHEESH KUMAR, N Hari KUMAR
  • Publication number: 20220014932
    Abstract: The embodiments herein relate to a method performed by a cloud node. The cloud node obtains measurements from at least some of the sensor nodes. The cloud node mathematically determines a minimum number of sensor nodes and their optimal locations. Based on the obtained measurements and the mathematically determined optimal locations, the cloud node graphically determines an optimal location for each of the minimum number of sensor nodes. The cloud node compares the mathematically and the graphically determined optimal locations. When the comparison indicates that the mathematically and graphically determined optimal locations are the same, the cloud node determines a minimum number of fog nodes. Based on the optimal location of sensor nodes, the cloud node determines an optimal location for each of the minimum number of fog nodes.
    Type: Application
    Filed: November 19, 2018
    Publication date: January 13, 2022
    Inventors: Perepu SATHEESH KUMAR, Saravanan MOHAN
  • Publication number: 20210392055
    Abstract: A method for managing computation load of a fog node is disclosed, wherein a computation capacity of the fog node is predicted to become unavailable to a fog network. The method comprises identifying a candidate set of nodes for computational load transfer from the fog node. The method further comprises obtaining a computation graph representing computation in the fog network, and using a learning model to identify a morphism from the obtained computation graph to a new computation graph, in which the fog node is not included. The identified morphism comprises a sequence of one or more morphing operations that replaces the fog node in the obtained computation graph with a topology of one or more nodes selected from the candidate set. The method further comprises causing computation performed at the fog node to be transferred to one or more nodes of the candidate set.
    Type: Application
    Filed: November 9, 2018
    Publication date: December 16, 2021
    Inventors: Saravanan MOHAN, Arindam BANERJEE, Perepu SATHEESH KUMAR
  • Patent number: 11089436
    Abstract: A method and a determining device for determining a set of locations for a number of devices are disclosed. For each distance measure of multiple distance measures, the determining device generates a respective pair of clusters. The determining device determines information metrics. The determining device performs first actions. While a difference between a respective information metric and a further respective information metric is greater than a threshold, the determining device performs second actions, comprising replacing said replaceable pair with said weighted pair, replacing the respective information metric for said replaceable pair with said further respective information metric for said weighted pair, and performing said first actions. The determining device selects the set of locations based on the weighted pair of clusters. A corresponding computer program is also disclosed.
    Type: Grant
    Filed: February 26, 2018
    Date of Patent: August 10, 2021
    Assignee: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Perepu Satheesh Kumar, Mohan Saravanan
  • Publication number: 20210194890
    Abstract: A method and a system are presented for enabling coordinated executions of actions in a distributed computing system with untrusted local computing agents. A smart contract including plans is recorded in a blockchain database. Each plan includes actions to be executed by a respective one of the local computing agents. Execution of a first action of a first set of actions to be executed by a first local computing agent is requested. Execution of a second action of a second set of actions to be executed by a second local computing agent is requested. Responsive to determining, based on the smart contract, that the first action can be executed, the first local computing agent is caused to execute the first action and responsive to determining, based on the smart contract, that the second action cannot be executed, the second local computing agent is caused to not execute the second action.
    Type: Application
    Filed: September 14, 2018
    Publication date: June 24, 2021
    Inventors: Swarup Kumar MOHALIK, Ramamurthy BADRINATH, Sandhya BASKARAN, Perepu SATHEESH KUMAR, Anshu SHUKLA