Abstract: Systems and methods for content customization are described. According to one aspect, a content customization apparatus is provided. The apparatus includes a processor; a memory storing instructions executable by the processor; a user feature component configured to generate user feature vectors representing user features for a plurality of users, respectively; a group selection component configured to select a treatment group and a control group based on the user feature vectors; a machine learning model configured to train a treatment effect estimator based on the user feature vectors and outcome data for the treatment group and the control group; and a content component configured to provide customized content based on the treatment effect estimator.

Abstract: Systems and methods for data augmentation are described. Embodiments of the present disclosure receive a dataset that includes a plurality of nodes and a plurality of edges, wherein each of the plurality of edges connects two of the plurality of nodes; compute a first nonnegative matrix representing a homophilous cluster affinity; compute a second nonnegative matrix representing a heterophilous cluster affinity; compute a probability of an additional edge based on the dataset using a machine learning model that represents a homophilous cluster and a heterophilous cluster based on the first nonnegative matrix and the second nonnegative matrix; and generate an augmented dataset including the plurality of nodes, the plurality of edges, and the additional edge.

Abstract: Systems and methods for dynamic user profile management are provided. One aspect of the systems and methods includes receiving, by a lookup component, a request for a user profile; computing, by a profile component, a time-to-live (TTL) refresh value for the user profile based on a lookup history of the user profile; updating, by the profile component, a TTL value of the user profile based on the request and the TTL refresh value; storing, by the profile component, the user profile and the updated TTL value in the edge database; and removing, by the edge database, the user profile from the edge database based on the updated TTL value.

Abstract: Systems and methods for dynamic user profile projection are provided. One or more aspects of the systems and methods includes computing, by a prediction component, a predicted number of lookups for a future time period based on a lookup history of a user profile using a lookup prediction model; comparing, by the prediction component, the predicted number of lookups to a lookup threshold; and transmitting, by a projection component, the user profile to an edge server based on the comparison.

Abstract: Multi-modal machine-learning model training techniques for search are described that overcome conventional challenges and inefficiencies to support real time output, which is not possible in conventional training techniques. In one example, a search system is configured to support multi-modal machine-learning model training. This includes use of a preview mode and an expanded mode. In the preview mode, a preview segment is generated as part of real time training of a machine learning model. In the expanded mode, the preview segment is persisted as an expanded segment that is used to train and utilize an expanded machine-learning model as part of search.

Abstract: In implementations of item transfer control systems, a computing device implements a transfer system to receive input data describing types of requested items and corresponding quantities of the types of requested items to receive at each of a plurality of destination sites and types of available items and corresponding quantities of the types of available items that are available at each of a plurality of source sites. The transfer system constructs a flow network having a source node for each of the plurality of the source sites and a destination node for each of the plurality of the destination sites. An integral approximate solution is generated that transfers the corresponding quantities of the types of requested items to each of the plurality of the destination sites using a maximum flow solver and the flow network.

Abstract: Machine-learning model retargeting techniques are described. In one example, training data is generated by extrapolating feedback data collected from entities. These techniques supports an ability to identify a wider range of thresholds and corresponding entities than those available in the feedback data. This also provides an opportunity to explore additional thresholds than those used in the past through extrapolating operations outside of a range used to define a segment, for which, the feedback data is captured. These techniques also support retargeting of a machine-learning model for a secondary label that is different than a primary label used to initially train the machine-learning model.

Abstract: Multi-modal machine-learning model training techniques for search are described that overcome conventional challenges and inefficiencies to support real time output, which is not possible in conventional training techniques. In one example, a search system is configured to support multi-modal machine-learning model training. This includes use of a preview mode and an expanded mode. In the preview mode, a preview segment is generated as part of real time training of a machine learning model. In the expanded mode, the preview segment is persisted as an expanded segment that is used to train and utilize an expanded machine-learning model as part of search.

Abstract: In implementations of item transfer control systems, a computing device implements a transfer system to receive input data describing types of requested items and corresponding quantities of the types of requested items to receive at each of a plurality of destination sites and types of available items and corresponding quantities of the types of available items that are available at each of a plurality of source sites. The transfer system constructs a flow network having a source node for each of the plurality of the source sites and a destination node for each of the plurality of the destination sites. An integral approximate solution is generated that transfers the corresponding quantities of the types of requested items to each of the plurality of the destination sites using a maximum flow solver and the flow network.

Abstract: In implementations of item transfer control systems, a computing device implements a transfer system to receive input data describing types of requested items and corresponding quantities of the types of requested items to receive at each of a plurality of destination sites and types of available items and corresponding quantities of the types of available items that are available at each of a plurality of source sites. The transfer system constructs a flow network having a source node for each of the plurality of the source sites and a destination node for each of the plurality of the destination sites. An integral approximate solution is generated that transfers the corresponding quantities of the types of requested items to each of the plurality of the destination sites using a maximum flow solver and the flow network.

Abstract: Systems and methods for training a neural network are described. One or more embodiments of the present disclosure include training a neural network based on a first combined gradient of a loss function at a plurality of sampled elements of a dataset; receiving an insertion request that indicates an insertion element to be added to the dataset, or a deletion request that indicates a deletion element to be removed from the dataset, wherein the deletion element is one of the plurality of sampled elements; computing a second combined gradient of the loss function by adding the insertion element to the dataset or by replacing the deletion element with a replacement element from the dataset; determining whether the first combined gradient and the second combined gradient satisfy a stochastic condition; and retraining the neural network to obtain a modified neural network based on the determination.

Abstract: In implementations of item transfer control systems, a computing device implements a transfer system to receive input data describing types of requested items and corresponding quantities of the types of requested items to receive at each of a plurality of destination sites and types of available items and corresponding quantities of the types of available items that are available at each of a plurality of source sites. The transfer system constructs a flow network having a source node for each of the plurality of the source sites and a destination node for each of the plurality of the destination sites. An integral approximate solution is generated that transfers the corresponding quantities of the types of requested items to each of the plurality of the destination sites using a maximum flow solver and the flow network.

Abstract: Techniques and systems are described for analytics system entity resolution. Typed higher-order node combinations are determined within a dataset, and an amount of similarity between two arbitrary nodes within the dataset is determined based on the typed higher-order node combinations. The amount of similarity enables the digital analytics to accurately perform source resolution of portions of the dataset to a respective source, and may be utilized to control output of digital content to a client device.

Abstract: In implementations of systems for generating recommendations, a computing device implements a recommendation system to receive prior interaction data describing prior interactions of entities with items. The recommendation system processes the prior interaction data and segments the entities into a first set and a second set. The entities included in the first set have greater numbers of prior interactions with the items than the entities included in the second set. The recommendation system then generates subset data describing a subset of the entities in the first set. This subset excludes entities having numbers of the prior interactions with the items below a threshold. The recommendation system forms a recommendation model based on the subset data and the system uses the recommendation model to generate a recommendation for display in a user interface.

Abstract: In implementations of higher-order graph clustering and embedding, a computing device receives a heterogeneous graph representing a network. The heterogeneous graph includes nodes that each represent a network entity and edges that each represent an association between two of the nodes in the heterogeneous graph. To preserve node-type and edge-type information, a typed graphlet is implemented to capture a connectivity pattern and the types of the nodes and edges. The computing device determines a frequency of the typed graphlet in the graph and derives a weighted typed graphlet matrix to sort graph nodes. Sorted nodes are subsequently analyzed to identify node clusters having a minimum typed graphlet conductance score. The computing device is further implemented to determine a higher-order network embedding for each of the nodes in the graph using the typed graphlet matrix, which can then be concatenated into a matrix representation of the network.

Abstract: In implementations of systems for generating recommendations, a computing device implements a recommendation system to receive prior interaction data describing prior interactions of entities with items. The recommendation system processes the prior interaction data and segments the entities into a first set and a second set. The entities included in the first set have greater numbers of prior interactions with the items than the entities included in the second set. The recommendation system then generates subset data describing a subset of the entities in the first set. This subset excludes entities having numbers of the prior interactions with the items below a threshold. The recommendation system forms a recommendation model based on the subset data and the system uses the recommendation model to generate a recommendation for display in a user interface.

Abstract: Techniques and systems are described for analytics system entity resolution. Typed higher-order node combinations are determined within a dataset, and an amount of similarity between two arbitrary nodes within the dataset is determined based on the typed higher-order node combinations. The amount of similarity enables the digital analytics to accurately perform source resolution of portions of the dataset to a respective source, and may be utilized to control output of digital content to a client device.

Abstract: In implementations of higher-order graph clustering and embedding, a computing device receives a heterogeneous graph representing a network. The heterogeneous graph includes nodes that each represent a network entity and edges that each represent an association between two of the nodes in the heterogeneous graph. To preserve node-type and edge-type information, a typed graphlet is implemented to capture a connectivity pattern and the types of the nodes and edges. The computing device determines a frequency of the typed graphlet in the graph and derives a weighted typed graphlet matrix to sort graph nodes. Sorted nodes are subsequently analyzed to identify node clusters having a minimum typed graphlet conductance score. The computing device is further implemented to determine a higher-order network embedding for each of the nodes in the graph using the typed graphlet matrix, which can then be concatenated into a matrix representation of the network.

Abstract: In implementations of higher-order network embedding, a computing device maintains interconnected data in the form of a graph that represents a network, the graph including nodes that each represent entities in the network and node associations that each represent edges between the nodes in the graph. The computing device includes a network embedding module that is implemented to determine a frequency of k-vertex motifs for each of the edges in the graph, and derive motif-based matrices from the frequency of each of the k-vertex motifs in the graph. The network embedding module is also implemented to determine a higher-order network embedding for each of the nodes in the graph from each of the motif-based matrices. The network embedding module can then concatenate the higher-order network embeddings into a matrix representation.

Abstract: In implementations of higher-order network embedding, a computing device maintains interconnected data in the form of a graph that represents a network, the graph including nodes that each represent entities in the network and node associations that each represent edges between the nodes in the graph. The computing device includes a network embedding module that is implemented to determine a frequency of k-vertex motifs for each of the edges in the graph, and derive motif-based matrices from the frequency of each of the k-vertex motifs in the graph. The network embedding module is also implemented to determine a higher-order network embedding for each of the nodes in the graph from each of the motif-based matrices. The network embedding module can then concatenate the higher-order network embeddings into a matrix representation.