Dell Products Inc.

Emc IP Holding Company LLC

Dell & Products L.p.

Pablo Nascimento Da Silva

Paulo Abelha Ferreira

Vinicius Michel Gottin

Adriana Bechara Prado

Tiago Salviano Calmon

Hugo De Oliveira Barbalho

Roberto Nery Stelling Neto

Maira Beatriz Hernandez Moran

Werner Spolidoro Freund

Rômulo Teixeira De Abreu Pinho

Nalinkumar Mistry

Julia Drummond Noce

Romulo Teixeira De Abreu Pinho

Karen Stéfany Martins

Adnan Sahin

Ron Arnan

Hagay Dagan

Iam Palatnik De Sousa

Eric L Caron

Isabella Costa Maia

Techniques are disclosed for dynamic edge-weighted quantization. For example, a system can include at least one processing device including a processor coupled to a memory, the at least one processing device being configured to implement the following steps: selecting edge nodes for sampling based on an edge node sampling algorithm configured to use a specified number of edge nodes to be sampled; causing the selected edge nodes to execute a quantization selection procedure; receiving, from the selected edge nodes, identifications of a quantization procedure based on the quantization selection procedure; and selecting a quantization procedure for each edge node, based on the identifications of the quantization procedures for the selected edge nodes.

Edge-weighted quantization for federated learning

One example method includes receiving a text string that includes multiple words, tokenizing the text string to create a tokenized text string, substituting each token in the tokenized text string with a mask token to create a masked text string, performing an inference process on the masked text string to obtain a respective probability for each token, determining a respective suspicion level for each probability, modulating the suspicion levels to obtain a respective weighted suspicion score for each token, and comparing each of the weighted suspicion scores with a threshold to determine whether any one or more of the words indicate that the text string includes an attack prompt.

Masked language model as a defense against textual adversarial attacks

One example method includes receiving, by a central node, respective data and statistics from each edge node in a group of edge nodes, performing, by the central node, a similarity-based clustering of the edge nodes so that different clusters of edge nodes are defined, sampling, by the central node, edge nodes from each of the clusters to perform a quantization selection method, receiving, by the central node, from the sampled edge nodes, a respective indication of a best-performing quantization method, and electing, by the central node, a quantization method to be used by all the edge nodes.

Similarity-based quantization selection for federated learning with heterogeneous edge devices

An event driven detection model is disclosed. A model operates at a node to identify relevant video data from video streams generated by cameras. Video data that is not relevant is discarded. An objectness score is generated for the relevant video data. The objectness score and position data from position sensors is used to infer an event. When an event is inferred by the model, a decision may be made and performed.

Efficient event-driven object detection at the forklifts at the edge in warehouse environments

One method includes receiving, at a central node, a respective gradient from each node of a cluster, and each of the gradients comprises a respective update to a global machine learning model maintained at the central node, aggregating, by the central node, the gradients to obtain an aggregated gradient for the cluster, and the aggregated gradient is part of a list of aggregated gradients, running, by the central node, a robust aggregation operation on the aggregated gradients in the list to obtain an outlier score for the cluster, and when the outlier score equals or exceeds a specified value, or falls within a specified range of values, identifying the cluster as an outlier, and identifying nodes within the cluster as suspicious.

Lightweight attacker identification method for federated learning with secure byzantine-robust aggregation via clustering

One example method includes performing various operations in a federated learning environment that includes nodes configured and operable to communicate with a central server. The operations include gathering aggregate gradient information from clusters that each include a respective group of some of the nodes, examining the respective gradient information for each of the clusters, and identifying outlier clusters based on the respective aggregate gradient information of those clusters, for each of the clusters identified as an outlier cluster, setting all the nodes in those clusters as suspect nodes, and performing a clustering operation that comprises reassigning each of the suspect nodes to one of the clusters, and a decision to reassign any given one of the suspect nodes is based on an amount of information expected to be obtained as a result of that decision.

Efficient entropy-guided byzantine attacker identification in federated learning

An edge information handling system (IHS) manager includes a storage for storing a labeled data associated with a use counter; and a vehicle counter; and a processor. The processor is programmed to: update an inference module using the labeled data, determine, after the updating, whether the use counter of the labeled data has exceeded a current use threshold, and in response to the use counter of the labeled data exceeding the current use threshold, initiating replacing of the labeled data with new labeled data from a central IHS. The current use threshold is based on the vehicle counter.

System and method for decentralized distributed model adaptation

One example method includes deploying a malware detection model in a production environment, performing a monitoring process that comprises capturing data from the production environment, by the malware detection model, determining, by the malware detection model, that a likelihood that the data belongs to a domain known to the malware detection model falls below a threshold, determining, by the malware detection model, whether or not the data is noise, or comes from a new domain not known to the malware detection model, and when it is determined that the data comes from the new domain, adapting the malware detection model by incorporating knowledge about the new domain in the malware detection model so that the malware detection model is operable to detect malware in the new domain, as well as the known domain.

Continuously propagating knowledge to decipher unknown malware in zero-trust architectures

One example method includes identifying features for operational actions that are to be performed at an edge node of an edge computing system. The features include information used by the edge node to execute the operational actions. A first set of the features is received during an input processing stage. The first set of the features are used in the execution of the operational actions. In response to the execution of the operational actions, a second set of the one or more features are obtained, In response to retrieving the first set of the features or in response to obtaining the second set of the features, a local map is updated to include the features. The local map includes a subset of a global map, where the local map and the global map represent a shared representation of a map structure.

Orchestration of action-input representations for decision making in edge environments

Method for model updating in a federated learning environment, including distributing a current model to client nodes; receiving a first set of gradient sign vectors, wherein each gradient sign vector of the first set of gradient sign vectors is received from one client node; generating a first updated model based on the first set of gradient sign vectors; distributing the first updated model to the plurality of client nodes; storing a first shape parameter and a second shape parameter; receiving, in response to distributing the first updated model, a second set of gradient sign vectors, wherein each gradient sign vector of the second set of gradient sign vectors is received from one client node; generating a second updated model based on the second set of gradient sign vectors, the first shape parameter, and the second shape parameter; and distributing the second updated model to the plurality of client nodes.

Fast converging gradient compressor for federated learning

Peer-based positioning of nodes in an environment is disclosed. A node is able to determine its own position using sources. The sources may include fixed and/or mobile beacons. Each of the sources is associated with a distance error and a position error. These errors, along with distance measurements between the node and each of the sources, are used to determine a position and a total positioning error, which reflects the accuracy of the determined position.

Peer-based positioning of mobile devices

One example method includes receiving at a client node of a federation a global machine-learning model that is to be trained by the client node using a training dataset that is local to the client node. In response to receiving the global machine-learning model, determining at the client node if the global machine-learning model is trending toward an overfitted state using a validation dataset. The overfitted state indicates that the global machine-learning model has not been received from a server that is part of the federation because of a client isolation attack. In response to determining that the global machine-learning model is trending towards the overfitting state, causing the client node to leave the federation. In response to determining that the global machine-learning model is not trending towards the overfitted state, training the global machine-learning model using the training dataset to thereby update the global machine-learning model.

Detecting client isolation attacks in federated learning through overfitting monitoring

Systems and methods for decoupling information into multiple levels of detail based on semantics while providing a compact global representation structure. A tree-based graph represents objects in an environment. The top node provides complete environment information at the lowest level of detail. Leaves of the tree-based graph complement the parent nodes with more detailed local information. This achieved efficient processing, communication, and data compaction.

So-map: a semantic-aware algorithm for optimizing the representation structure of Octomaps

Techniques for edge-enabled trajectory map generation are disclosed herein. For example, a method can include segmenting one or more node trajectories based on data collected at a node, determining one or more initial trajectories based on the segmented node trajectories, and generating a map including trajectories generated by associating attribute data and event data with the initial trajectories.

Edge-enabled trajectory map generation

Real-time event detection is performed on nodes in an environment using position data that is not available to a node in real time but is delayed. A node performs real time event detection by predicting a position of the node based at least in part on delayed position data. The delayed position data is aligned to other sensor data. Aligning the position data may include predicting a position based on dead reckoning and/or a machine learning model. One or more collections of data, each collection including sensor data and predicted position data, is input to a model that performs event detection.

Growing community of inventors

Niterói, Brazil

Pablo Nascimento Da Silva