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: 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: Embodiments of the present disclosure provide systems, methods, and computer storage media for optimizing computing resources generally associated with cloud-based media services. Instead of decoding digital assets on-premises to stream to a remote client device, an encoded asset can be streamed to the remote client device. A codebook employable for decoding the encoded asset can be embedded into the stream transmitted to the remote client device, so that the remote client device can extract the embedded codebook, and employ the extracted codebook to decode the encoded asset locally. In this way, not only are processing resources associated with on-premises decoding eliminated, but on-premises storage of codebooks can be significantly reduced, while expensive bandwidth is freed up by virtue of transmitting a smaller quantity of data from the cloud to the remote client device.

Abstract: Techniques for recommending hashtags, including trending hashtags, are disclosed. An example method includes accessing a graph. The graph includes video nodes representing videos, historical hashtag nodes representing historical hashtags, and edges indicating associations among the video nodes and the historical hashtag nodes. A trending hashtag is identified. An edge is added to the graph between a historical hashtag node representing a historical hashtag and a trending hashtag node representing the trending hashtag, based on a semantic similarity between the historical hashtag and the trending hashtag. A new video node representing a new video is added to the video nodes of the graph. A graph neural network (GNN) is applied to the graph, and the GNN predicts a new edge between the trending hashtag node and the new video node. The trending hashtag is recommended for the new video based on prediction of the new edge.

Abstract: A topic mapping system generates customized mapping schemas for multiple topic sets. The topic mapping system generates document clusters that represent groups of digital documents. The topic mapping system also generates, for each topic set, a document-topic mapping data object (“DTM data object”) that describes a customized mapping schema of the document clusters to labels in the topic set. The topic mapping system identifies customized groups of documents for responding to multiple requests that have a particular keyword. For each request, the topic mapping system identifies a particular topic set and DTM data object associated with a computing system that provided the request. Based on the keyword, the topic mapping system identifies documents that are categorized according to the customized mapping schema in the DTM data object. The topic mapping system can provide customized groups of documents to respective computing systems that provided the multiple requests.

Abstract: Systems and methods for resource allocation are described. The systems and methods include receiving utilization data for computing resources shared by a plurality of users, updating a pricing agent using a reinforcement learning model based on the utilization data, identifying resource pricing information using the pricing agent, and allocating the computing resources to the plurality of users based on the resource pricing information.

Abstract: A system and method for content distribution without tracking is described. The system and method includes determining that device identifiers are not available for a first digital content channel; identifying a first cluster of users and a second cluster of users based on the determination that device identifiers are not available; providing first content and second content via the first digital content channel; monitoring user interactions on the first digital content channel to obtain a first conversion rate for users in the first cluster that receive the first content and a second conversion rate for users in the second cluster that receive the second content; computing a cross-cluster treatment effect based on the first conversion rate and the second conversion rate; computing a treatment effect for the first content based on the cross-cluster treatment effect; and providing the first content to a subsequent user based on the treatment effect.

Abstract: A search system facilitates efficient and fast near neighbor search given item vector representations of items, regardless of item type or corpus size. To index an item, the search system expands an item vector for the item to generate an expanded item vector and selects elements of the expanded item vector. The item is index by storing an identifier of the item in posting lists of an index corresponding to the position of each selected element in the expanded item vector. When a query is received, a query vector for the item is expanded to generate an expanded query vector, and elements of the expanded query vector are selected. Candidate items are identified based on posting lists corresponding to the position of each selected element in the expand query vector. The candidate items may be ranked, and a result set is returned as a response to the query.

Abstract: Various disclosed embodiments are directed to using one or more algorithms or models to select a suitable or optimal variation, among multiple variations, of a given content item based on feedback. Such feedback guides the algorithm or model to arrive at suitable variation result such that the variation result is produced as the output for consumption by users. Further, various embodiments resolve tedious manual user input requirements and reduce computing resource consumption, among other things, as described in more detail below.

Abstract: Residual vectors are compressed in a lossless compression scheme suitable for cloud DVR video content applications. Thus, a cloud DVR service provider can take many copies of the same file stored in the cloud and save storage space by compressing those copies while still maintaining their status as distinct copies, one per user. Vector quantization is used for compressing already-compressed video streams (e.g., MPEG streams). As vector quantization is a lossy compression scheme, the residual vector has to be stored to regenerate the original video stream at the decoding (playback) node. Entropy coding schemes like Arithmetic or Huffman coding can be used to compress the residual vectors. Additional strategies can be implemented to further optimize this residual compression. In some embodiments, the techniques operate to provide a 25-50% improvement in compression. Storage space is thus more efficiently used and video transmission may be faster in some cases.

Abstract: The present disclosure relates to systems, methods, and non-transitory computer readable media that utilize collaborative filtering and a reinforcement learning model having an actor-critic framework to provide digital content items across client devices. In particular, in one or more embodiments, the disclosed systems monitor interactions of a client device with one or more digital content items to generate item embeddings (e.g., utilizing a collaborative filtering model). The disclosed systems further utilize a reinforcement learning model to generate a recommendation (e.g., determine one or more additional digital content items to provide to the client device) based on the user interactions. In some implementations, the disclosed systems utilize the reinforcement learning model to analyze every negative and positive interaction observed when generating the recommendation.

Abstract: The present disclosure relates to systems, non-transitory computer-readable media, and methods for generating automatic suggestions to effectively modify the organization of an ingested data collection without destruction of the underlying raw data. In particular, in one or more embodiments, the disclosed systems utilize multiple machine learning models in sequence to determine likelihoods that the organizational structure of an ingested data collection should be modified in various ways. In response to generating these likelihoods, the disclosed systems generate corresponding automatic suggestions to modify the organization of the ingested data collection. In response to a detected selection of one or more of the automatic suggestions, the disclosed systems read data out of the ingested data collection in accordance with the selected automatic suggestions to effectively modify the organization of the ingested data collection.

Abstract: This disclosure describes methods, non-transitory computer readable storage media, and systems that intelligently generate and modify schedules of task sequences utilizing a graph neural network and/or reinforcement learning model. For example, the disclosed system utilizes a graph neural network to generate performance efficiency scores indicating predicted performances of the sets of tasks. Additionally, the disclosed systems utilizes the performance efficiency scores to rank sets of tasks and then determine a schedule including an ordered sequence of tasks. Furthermore, disclosed system generates modified schedules in response to detecting a modification to the schedule. For example, the disclosed system utilizes a reinforcement learning model to provide recommendations of new tasks or task sequences deviating from the schedule in the event of an interruption. The disclosed system also utilizes the reinforcement learning model to learn from user choices to inform future scheduling of tasks.

Abstract: An improved electronic communication system schedules transmission of electronic communications based on a predicted open time and click time. The open and click times are predicted from a machine learning model that is trained to optimize for both tasks. Additionally, when training the machine learning model, the loss used for adjusting the system to achieve a desired accuracy may be a biased loss determined from a function that penalizes overpredicting the open time. As such, the loss value may be determined by different set of rules depending on whether the predicted time is greater than the actual time or not.

Abstract: Techniques are disclosed for real-time bidding (e.g., for dynamic online content placement) using an optimized final bid. The final bid is determined based on a predicted clearing price and an initial bid. The initial bid represents a value to a prospective content provider, and may be computed based on campaign information. The predicted clearing price is a predicted amount paid, and may be predicted using a model trained using historical winning bids data. The clearing price may be predicted using a quantile regression model, where the quantile can be selected to control bid aggressiveness. In some cases, the quantile is determined based on pacing in an overall campaign. Once the initial bid and the predicted clearing price are calculated, the final bid is computed based on the initial bid and the predicted clearing price.

Abstract: Embodiments of the present disclosure provide systems, methods, and computer storage media for optimizing computing resources generally associated with cloud-based media services. Instead of decoding digital assets on-premises to stream to a remote client device, an encoded asset can be streamed to the remote client device. A codebook employable for decoding the encoded asset can be embedded into the stream transmitted to the remote client device, so that the remote client device can extract the embedded codebook, and employ the extracted codebook to decode the encoded asset locally. In this way, not only are processing resources associated with on-premises decoding eliminated, but on-premises storage of codebooks can be significantly reduced, while expensive bandwidth is freed up by virtue of transmitting a smaller quantity of data from the cloud to the remote client device.

Abstract: Residual vectors are compressed in a lossless compression scheme suitable for cloud DVR video content applications. Thus, a cloud DVR service provider can take many copies of the same file stored in the cloud and save storage space by compressing those copies while still maintaining their status as distinct copies, one per user. Vector quantization is used for compressing already-compressed video streams (e.g., MPEG streams). As vector quantization is a lossy compression scheme, the residual vector has to be stored to regenerate the original video stream at the decoding (playback) node. Entropy coding schemes like Arithmetic or Huffman coding can be used to compress the residual vectors. Additional strategies can be implemented to further optimize this residual compression. In some embodiments, the techniques operate to provide a 25-50% improvement in compression. Storage space is thus more efficiently used and video transmission may be faster in some cases.

Abstract: Techniques are disclosed for real-time bidding (e.g., for dynamic online content placement) using an optimized final bid. The final bid is determined based on a predicted clearing price and an initial bid. The initial bid represents a value to a prospective content provider, and may be computed based on campaign information. The predicted clearing price is a predicted amount paid, and may be predicted using a model trained using historical winning bids data. The clearing price may be predicted using a quantile regression model, where the quantile can be selected to control bid aggressiveness. In some cases, the quantile is determined based on pacing in an overall campaign. Once the initial bid and the predicted clearing price are calculated, the final bid is computed based on the initial bid and the predicted clearing price.

Abstract: Embodiments of the present disclosure provide systems, methods, and computer storage media for mitigating latencies associated with the encoding of digital assets. Instead of waiting for codebook generation to complete in order to encode a digital asset for storage, embodiments described herein describe a shifting codebook generation and employment technique that significantly mitigates any latencies typically associated with encoding schemes. As a digital asset is received, a single codebook is trained based on each portion of the digital asset, or in some instances along with each portion of other digital assets being received. The single codebook is employed to encode subsequent portion(s) of the digital asset as it is received. The process continues until an end of the digital asset is reached or another command to terminate the encoding process is received. To encode an initial portion of the digital asset, a bootstrap codebook can be employed.

Abstract: This disclosure relates to methods, non-transitory computer readable media, and systems that can initially train a machine-learning-logo classifier using synthetic training images and incrementally apply the machine-learning-logo classifier to identify logo images to replace the synthetic training images as training data. By incrementally applying the machine-learning-logo classifier to determine one or both of logo scores and positions for logos within candidate logo images, the disclosed systems can select logo images and corresponding annotations indicating positions for ground-truth logos. In some embodiments, the disclosed systems can further augment the iterative training of a machine-learning-logo classifier to include user curation and removal of incorrectly detected logos from candidate images, thereby avoiding the risk of model drift across training iterations.