Abstract: A classification device receives sensor data from a set of sensors and generates, using a context classifier having a set of classifier model parameters, a set of raw predictions based on the received sensor data. Temporal filtering and heuristic filtering are applied to the raw predictions, producing filtered predictions. A prediction error is generated from the filtered predictions, and model parameters of the set of classifier model parameters are updated based on said prediction error. The classification device may be a wearable device.

Abstract: A computer-implemented or hardware-implemented method of entity identification, comprising: a) providing a network of nodes with input from a plurality of sensors; b) generating, by each node of the network, an activity level, based on the input from the plurality of sensors; c) comparing the activity level of each node to a threshold level; d) based on the comparing, for each node, setting the activity level to a preset value or keeping the generated activity level; e) calculating a total activity level as the sum of all activity levels of the nodes of the network; f) iterating a)-e) until a local minimum of the total activity level has been reached; and g) when the local minimum of the total activity level has been reached, utilizing a distribution of activity levels at the local minimum to identify a measurable characteristic of the entity. The disclosure further relates to a computer program product and an apparatus for entity identification.

Abstract: The present disclosure discloses a system and method for distributed neural network training. The method includes: computing, by a plurality of heterogeneous computation units (HCUs) in a neural network processing system, a first plurality of gradients from a first plurality of samples; aggregating the first plurality of gradients to generate an aggregated gradient; computing, by the plurality of HCUs, a second plurality of gradients from a second plurality of samples; aggregating, at each of the plurality of HCUs, the aggregated gradient with a corresponding gradient of the second plurality of gradients to generate a local gradient update; and updating, at each of the plurality of HCUs, a local copy of a neural network with the local gradient update.

Abstract: A method for establishing a data-recognition model includes: generating (Z) number of Y-combinations of dithering algorithms from (X) number of dithering algorithms; for each Y-combination, performing a dithering operation on a to-be-processed data group, so as to obtain, in total, (Z) number of size-reduced data groups; performing training operations on a deep neural network using the size-reduced data groups, respectively, so as to generate, for each training operation, a DNN model and a steady deviation; and selecting the Y-combination corresponding to the size-reduced data group that results in the smallest steady deviation as a filter module, and selecting the corresponding DNN model as the data-recognition model.

Abstract: A method includes dividing a plurality of filters in a first layer of a neural network into a first set of filters and a second set of filters, applying each of the first set of filters to an input of the neural network, aggregating, at a second layer of the neural network, a respective one of a first set of outputs with a respective one of a second set of outputs, splitting respective weights of specific neurons activated in each remaining layer, at each specific neuron from each remaining layer, applying a respective filter associated with each specific neuron and a first corresponding weight, obtaining a second set of neuron outputs, for each specific neuron, aggregating one of the first set of neuron outputs with one of a second set of neuron outputs and generating an output of the neural network based on the aggregated neuron outputs.

Abstract: A system and method is disclosed for automated cross-node communication in a distributed directed acyclic graph. The method can include identifying a directed acyclic graph (“DAG”) overlaying a plurality of nodes and identifying the nodes underlying the DAG. A subordinate DAG can be generated in an entry vertex of the DAG. The subordinate DAG can include a vertex for each of the nodes underlying the DAG. Data and metadata can be received at the entry vertex. The data can be delivered to a next vertex in the DAG, and the metadata can be communicated to nodes underlying the DAG via the subordinate DAG.

Abstract: Embodiments of the present disclosure relate to methods, systems and computer program products for causal analysis. In some embodiments, there is provided a computer-implemented method. The method comprises determining, from observation samples of a plurality of factors, a first causal structure indicating a first causal relationship among the plurality of factors, each observation sample including a set of observation values of the plurality of factors; presenting the first causal structure to a user; in response to receiving at least one user input about the first causal structure from the user, executing actions associated with the at least one user input based on the first causal structure; and presenting a result of the execution of the actions to the user. In other embodiments, another method, systems and computer program products are provided.

Abstract: A system and method are disclosed for providing a private multi-modal artificial intelligence platform. The method includes splitting a neural network into a first client-side network, a second client-side network and a server-side network and sending the first client-side network to a first client. The first client-side network processes first data from the first client, the first data having a first type. The method includes sending the second client-side network to a second client. The second client-side network processes second data from the second client, the second data having a second type. The first type and the second type have a common association. Forward and back propagation occurs between the client side networks and disparate data types on the different client side networks and the server-side network to train the neural network.

Abstract: A neural network is augmented to enhance robustness against adversarial attack. In this approach, a fully-connected additional layer is associated with a last layer of the neural network. The additional layer has a lower dimensionality than at least one or more intermediate layers. After sizing the additional layer appropriately, a vector bit encoding is applied. The encoding comprises an encoding vector for each output class. Preferably, the encoding is an n-hot encoding, wherein n represents a hyperparameter. The resulting neural network is then trained to encourage the network to associated features with each of the hot positions. In this manner, the network learns a reduced feature set representing those features that contain a high amount of information with respect to each output class, and/or to learn constraints between those features and the output classes. The trained neural network is used to perform a classification that is robust against adversarial examples.

Abstract: Embodiments for ensemble training in a distributed marketplace in a computing environment. One or more ensemble machine learning models may be provided from a plurality of machine learning models competing within the distributed marketplace that achieve a performance on ensemble training data equal to or greater than a selected performance threshold, wherein the distributed marketplace is a blockchain.

Abstract: Techniques are described herein for selecting, curating, normalizing, enriching, and synthesizing the results of user experience tests. In some embodiments, a system identifies a qualitative element within a result set for a user experience test. The system then selects a machine learning model to apply based on one or more attributes associated with the user experience test and generates a predicted visibility, quality, and/or relevance for the qualitative element. Based on the prediction, the system generates a user interface that curates a set of results of the user experience test.

Abstract: A computation unit comprises first, second, and third circuits. The first circuit traverses gradient loss elements gpn and normalized output elements pn and produces an accumulation C. The accumulation C is produced by element-wise multiplying the gradient loss elements gpn with the corresponding normalized output elements pn and summing the results of the element-wise multiplication. The second circuit, operatively coupled to the first circuit, element-wise subtracts the accumulation C from each of the gradient loss elements gpn and produces modulated gradient loss elements gpn?. The third circuit, operatively coupled to the second circuit, traverses the modulated gradient loss elements gpn? and produces gradient loss elements gxn for a function preceding the softmax function. The gradient loss elements gxn are produced by element-wise multiplying the modulated gradient loss elements gpn? with the corresponding normalized output elements pn.

Abstract: A method for programming an activation function is provided. The method includes generating segment data for segmenting the activation function; segmenting the activation function into a plurality of segments using the segment data; and approximating at least one segment of the plurality of segments as a programmable segment. An apparatus for performing the method may include a programmable activation function generator configured to generate segment data for segmenting an activation function; segment the activation function into a plurality of segments using the generated segment data; and approximate at least one segment of the plurality of segments as a programmable segment. By using segment data, various non-linear activation functions, particularly newly proposed or known activation functions with some modifications, can be programmed to be processable in hardware.

Abstract: A method includes obtaining training data for a classifier, the training data comprises one or more target classes, obtaining candidate background classes, selecting negative classes from the candidate background classes, wherein the negative classes exclude candidate background classes that are close to the target classes, wherein the negative classes exclude candidate background classes that are very different from the target classes, and wherein the negative classes include candidate background classes that are similar to the target classes, and training the classifier on a combined set of the selected negative classes and target classes.

Abstract: Provided is an optimal solution determination method for determining optimality of a solution in a combinatorial optimization problem using a computer, including uniformly extracting a plurality of solutions in a solution space of the combinatorial optimization problem as a plurality of first solutions, and estimating a maximum evaluation value in a case where solutions of a number that exceeds the number of the plurality of first solutions are assumed, on the basis of a plurality of first evaluation values respectively corresponding to the plurality of first solutions that are uniformly extracted, as a first maximum evaluation value Z.

Abstract: In an approach for constructing an ensemble model from a set of base learners, a processor performs a plurality of boosting iterations, where: at each boosting iteration of the plurality of boosting iterations, a base learner is selected at random from a set of base learners, according to a sampling probability distribution of the set of base learners, and trained according to a training dataset; and the sampling probability distribution is altered: (i) after selecting a first base learner at a first boosting iteration of the plurality of boosting iterations and (ii) prior to selecting a second base learner at a final boosting iteration of the plurality of boosting iterations. A processor constructs an ensemble model based on base learners selected and trained during the plurality of boosting iterations.

Abstract: Systems and methods of the present disclosure use one or more processor(s) to receive a consumable preference and a daily score intake value associated with a user and to obtain a content data regarding consumable item including an amount of a first nutrient found in the consumable item. The processor(s) utilizes, in real-time, a nutrient prediction machine learning model to ingest the content data regarding the consumable item and predict an amount of a second nutrient in the consumable item based on the content data and a decision tree library of thousand nutrient decision trees. The processor(s) determines zero-scored consumable item based on the daily score intake value, the amount of the first nutrient, the amount of the second nutrient, and the consumable preference. The processor(s) instructs a computing device to utilize a graphical user interface element to identify the zero-scored consumable item on a screen of the computing device.

Abstract: A method for training a generator. The generator is supplied with at least one actual signal that includes real or simulated physical measured data from at least one observation of the first area. The actual signal is translated by the generator into a transformed signal that represents the associated synthetic measured data in a second area. Using a cost function, an assessment is made concerning to what extent the transformed signal is consistent with one or multiple setpoint signals, at least one setpoint signal being formed from real or simulated measured data of the second physical observation modality for the situation represented by the actual signal. Trainable parameters that characterize the behavior of the generator are optimized with the objective of obtaining transformed signals that are better assessed by the cost function. A method for operating the generator, and that encompasses the complete process chain are also provided.

Abstract: A set of classifiable data containing a plurality of classes is ingested. A target class within the plurality of classes is determined. Using the set of classifiable data, an interactive recall rate chart is generated, and the interactive recall rate chart shows a set of target class recall rates against a set of class recall rates for the remainder of the plurality of classes. The interactive recall rate chart is presented to a user. A target class recall rate selection from the set of target class recall rates is received from the user. The set of classifiable data is reclassified, based on the target class recall rate selection.

Abstract: Mechanisms are provided to implement a hardened ensemble artificial intelligence (AI) model generator. The hardened ensemble AI model generator co-trains at least two AI models. The hardened ensemble AI model generator modifies, based on a comparison of the at least two AI models, a loss surface of one or more of the at least two AI models to prevent an adversarial attack on one AI model, in the at least two AI models, transferring to another AI model in the at least two AI models, to thereby generate one or more modified AI models. At least one of the one or more modified AI models then processes an input to generate an output result.