Abstract: In a method for training a federated learning model, a server obtains a target split mode corresponding to a training node in response to determining that the training node satisfies a preset splitting condition. The server notifies a client to perform, based on the target split mode, node splitting. The server performs a next round of training by taking a left subtree node generated by performing the node splitting as a new training node until an updated training node does not satisfy the preset splitting condition. The server performs a next round of training by taking another non-leaf node of the boosting tree as a new training node. The server stops training and generates a target federated learning model in response to determining that a node dataset of the plurality of boosting trees is empty.

Abstract: A dialogue robot generation method, a dialogue robot management platform, and a storage medium. The dialogue robot generation method comprises: obtaining at least one first function module associated with a dialogue robot to be generated (101); obtaining a calling sequence of the at least one first function module (102); and calling the at least one first function module on the basis of the calling sequence by means of a preset model container to generate a dialogue robot (103).

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains a function call for a function that calculates an attribute associated with a machine learning model. For each argument of the function call, the system identifies a parameter type of the argument, wherein the parameter type represents a type of data used with the machine learning model. The system also obtains a value accessor for retrieving features specific to the parameter type and obtains a value represented by the argument using the value accessor. The system then calculates the attribute by applying the function to the value and uses the attribute to execute the machine learning model.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains a hierarchical representation containing a set of namespaces of a set of features shared by a set of statistical models. Next, the system uses the hierarchical representation to obtain, from one or more execution environments, a subset of the features for use in calculating the derived feature. The system then applies a formula from the hierarchical representation to the subset of the features to produce the derived feature. Finally, the system provides the derived feature for use by one or more of the statistical models.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains feature configurations for a set of features and a command for inspecting a data set that is produced using the feature configurations. Next, the system obtains, from the feature configurations, one or more anchors containing metadata for accessing the set of features in an environment and a join configuration for joining a feature with one or more additional features. The system then uses the anchors to retrieve feature values of the features and zips the feature values according to the join configuration without matching entity keys associated with the feature values. Finally, the system outputs the zipped feature values in response to the command.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains a function call for a function that calculates an attribute associated with a machine learning model. For each argument of the function call, the system identifies a parameter type of the argument, wherein the parameter type represents a type of data used with the machine learning model. The system also obtains a value accessor for retrieving features specific to the parameter type and obtains a value represented by the argument using the value accessor. The system then calculates the attribute by applying the function to the value and uses the attribute to execute the machine learning model.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains a model definition and a training configuration for a machine-learning model, wherein the training configuration includes a set of required features, a training technique, and a scoring function. Next, the system uses the model definition and the training configuration to load the machine-learning model and the set of required features into a training pipeline without requiring a user to manually identify the set of required features. The system then uses the training pipeline and the training configuration to update a set of parameters for the machine-learning model. Finally, the system stores mappings containing the updated set of parameters and the set of required features in a representation of the machine-learning model.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains a hierarchical representation containing a set of namespaces of a set of features shared by a set of statistical models. Next, the system uses the hierarchical representation to obtain, from one or more execution environments, a subset of the features for use in calculating the derived feature. The system then applies a formula from the hierarchical representation to the subset of the features to produce the derived feature. Finally, the system provides the derived feature for use by one or more of the statistical models.

Abstract: This invention describes a quick 3D-to-2D point matching algorithm. The major contribution is to substitute a new O(2n) algorithm for the traditional N! method by introducing a convex hull based enumerator and projecting a 3D point set into a 2D plane yields a corresponding 2D point set. In some cases, matching information is lost during the projection. Therefore, to compute projection parameters, the recovery of the 3D-to-2D correspondence is important. Traditionally, an exhaustive enumerator permutes all the potential matching sets and a calibration computation is used to choose the lowest residual error computed parameters as “correct” one. Our enumerator shrinks the search space by computing the convex hull for both 2D and 3D points set, validating the potential matching cases with a horizon validation and, finally, applying recursive computation to further reduce the searching space.