Abstract: Described are techniques for storing and retrieving items using a robotic device for moving items. Any combinations of image data depicting a manipulator interacting with an item, sensor data from sensors instrumenting the manipulator or item, item data regarding characteristics of the item, and constraint data relating to characteristics of the robotic device may be used to generate one or more configurations for the robotic device. The configurations may include points of contact and force vectors for contacting the item using the robotic device.

Abstract: A real-time stereo video signal of a captured scene with a physical foreground object and a physical background is received. In real-time, a foreground/background separation algorithm is used on the real-time stereo video signal to identify pixels from the stereo video signal that represent the physical foreground object. A video sequence may be produced by rendering a 3D virtual reality based on the identified pixels of the physical foreground object.

Abstract: Described are techniques for storing and retrieving items using a robotic manipulator. Images depicting a human interacting with an item, sensor data from sensors instrumenting the human or item, data regarding physical characteristics of the item, and constraint data relating to the robotic manipulator or the item may be used to generate one or more configurations for the robotic manipulator. The configurations may include points of contact and force vectors for contacting the item using the robotic manipulator.

Abstract: Variables of observation records to be used to generate a machine learning model are identified as candidates for quantile binning transformations. In accordance with a particular concurrent binning plan generated for a particular variable, a plurality of quantile binning transformations are applied to the particular variable, including a first transformation with a first bin count and a second transformation with a different bin count. The first and second transformations result in the inclusion of respective parameters or weights for binned features in a parameter vector of the model. In a post-training phase run of the model, at least one parameter corresponding to a binned feature is used to generate a prediction.

Abstract: Online recommendations are tracked through a forwarding service. The forwarding service can provide such statistics to an ad service, which can provide incentives to the recommending user and a consuming user. Example incentives may include an accumulation of points by the recommending user, a discount to the consuming user if a purchase is made in response to the recommendation, etc. To determine how much of an incentive each participant in the recommendation flow receives, a graph is created to model the recommendation flow and incentives are allocated using a cooperative game description based on this graph that associates each participant with a power index that represents that participants share of the incentive.

Abstract: Described are techniques for storing and retrieving items using a robotic manipulator. Images depicting a human interacting with an item, sensor data from sensors instrumenting the human or item, data regarding physical characteristics of the item, and constraint data relating to the robotic manipulator may be used to generate one or more configurations for the robotic manipulator. Points of contact and force vectors of the configurations may correspond to the points of contact and force vectors determined from the images and sensor data.

Abstract: One or more techniques and/or systems are disclosed for predicting propagation of a message on a social network. A predictive model is trained to determine a probability of propagation of information on the social network using both positive and negative information propagation feedback, which may be collected while monitoring the social network over a desired period of time for information propagation. A particular message can be input to the predictive model, which can determine a probability of propagation of the message on the social network, such as how many connections may receive at least a portion of the message and/or a likelihood of at least a portion of the message reaching respective connections in the social network.

Abstract: Variables of observation records to be used to generate a machine learning model are identified as candidates for quantile binning transformations. In accordance with a particular concurrent binning plan generated for a particular variable, a plurality of quantile binning transformations are applied to the particular variable, including a first transformation with a first bin count and a second transformation with a different bin count. The first and second transformations result in the inclusion of respective parameters or weights for binned features in a parameter vector of the model. In a post-training phase run of the model, at least one parameter corresponding to a binned feature is used to generate a prediction.

Abstract: Processing a request is disclosed. A request associated with a first identifier is received. A selected request handler is selected among a first plurality of request handlers to process the request. The selection of the selected request handler is based at least in part on the first identifier. The request is processed using a second identifier included in the request. Processing the request includes using a local version of a data associated with the second identifier and stored in a storage managed by the selected request handler. The local version of the data has been updated using a centralized version of the data. The centralized version of the data has been determined using processing performed by a second plurality of request handlers. The selected request handler is included in the second plurality of request handlers.

Abstract: A real-time stereo video signal of a captured scene with a physical foreground object and a physical background is received. In real-time, a foreground/background separation algorithm is used on the real-time stereo video signal to identify pixels from the stereo video signal that represent the physical foreground object. A video sequence may be produced by rendering a 3D virtual reality based on the identified pixels of the physical foreground object.

Abstract: One or more techniques and/or systems are disclosed for predicting propagation of a message on a social network. A predictive model is trained to determine a probability of propagation of information on the social network using both positive and negative information propagation feedback, which may be collected while monitoring the social network over a desired period of time for information propagation. A particular message can be input to the predictive model, which can determine a probability of propagation of the message on the social network, such as how many connections may receive at least a portion of the message and/or a likelihood of at least a portion of the message reaching respective connections in the social network.

Abstract: A real-time stereo video signal of a captured scene with a physical foreground object and a physical background is received. In real-time, a foreground/background separation algorithm is used on the real-time stereo video signal to identify pixels from the stereo video signal that represent the physical foreground object. A video sequence may be produced by rendering a 3D virtual reality based on the identified pixels of the physical foreground object.

Abstract: One or more techniques and/or systems are disclosed for predicting propagation of a message on a social network. A predictive model is trained to determine a probability of propagation of information on the social network using both positive and negative information propagation feedback, which may be collected while monitoring the social network over a desired period of time for information propagation. A particular message can be input to the predictive model, which can determine a probability of propagation of the message on the social network, such as how many connections may receive at least a portion of the message and/or a likelihood of at least a portion of the message reaching respective connections in the social network.

Abstract: A recommender system may he used to predict a user behavior that a user will give in relation to an item. In an embodiment such predictions are used to enable items to be recommended to users. For example, products may be recommended to customers, potential friends may be recommended to users of a social networking tool, organizations may be recommended to automated users or other items may be recommended to users. In an embodiment a memory stores a data structure specifying a bi-linear collaborative filtering model of user behaviors. In the embodiment an automated inference process may be applied to the data structure in order to predict a user behavior given information about a user and information about an item. For example, the user information comprises user features as well as a unique user identifier.

Abstract: Methods, systems, and media are provided for a dynamic batch strategy utilized in parallelization of online learning algorithms. The dynamic batch strategy provides a merge function on the basis of a threshold level difference between the original model state and an updated model state, rather than according to a constant or pre-determined batch size. The merging includes reading a batch of incoming streaming data, retrieving any missing model beliefs from partner processors, and training on the batch of incoming streaming data. The steps of reading, retrieving, and training are repeated until the measured difference in states exceeds a set threshold level. The measured differences which exceed the threshold level are merged for each of the plurality of processors according to attributes. The merged differences which exceed the threshold level are combined with the original partial model states to obtain an updated global model state.

Abstract: Processing a prepared update is disclosed. A prepared update associated with a request that has been used by the sender to update a local version of a data associated with the sender is received from a sender. Based at least in part on an identifier included in the prepared update, a selected data handler is selected among a plurality of data handlers. The selected data handler is used to update a centralized version of the data at least in part by using the received prepared update. The centralized version of the data has been previously updated using a plurality of prepared updates received from a plurality of senders. The updated centralized version of the data is sent to update the local version of the data associated with the sender.

Abstract: A recommender system may be used to predict a user behavior that a user will give in relation to an item. In an embodiment such predictions are used to enable items to be recommended to users. For example, products may be recommended to customers, potential friends may be recommended to users of a social networking tool, organizations may be recommended to automated users or other items may be recommended to users. In an embodiment a memory stores a data structure specifying a bi-linear collaborative filtering model of user behaviors. In the embodiment an automated inference process may be applied to the data structure in order to predict a user behavior given information about a user and information about an item. For example, the user information comprises user features as well as a unique user identifier.

Abstract: Machine learning techniques may be used to train computing devices to understand a variety of documents (e.g., text files, web pages, articles, spreadsheets, etc.). Machine learning techniques may be used to address the issue that computing devices may lack the human intellect used to understand such documents, such as their semantic meaning. Accordingly, a topic model may be trained by sequentially processing documents and/or their features (e.g., document author, geographical location of author, creation date, social network information of author, and/or document metadata). Additionally, as provided herein, the topic model may be used to predict probabilities that words, features, documents, and/or document corpora, for example, are indicative of particular topics.

Abstract: Knowledge corroboration is described. In an embodiment many judges provide answers to many questions so that at least one answer is provided to each question and at least some of the questions have answers from more than one judge. In an example a probabilistic learning system takes features describing the judges or the questions or both and uses those features to learn an expertise of each judge. For example, the probabilistic learning system has a graphical assessment component which aggregates the answers in a manner which takes into account the learnt expertise in order to determine enhanced answers. In an example the enhanced answers are used for knowledge base clean-up or web-page classification and the learnt expertise is used to select judges for future questions. In an example the probabilistic learning system has a logical component that propagates answers according to logical relations between the questions.

Abstract: Matchmaking processes at online game services often result in players having to wait unacceptably long times to receive a match or immediately receiving a poorly matched session. By using a matchmaking process which dynamically adapts a good balance is achieved between the quality of proposed matches (for example, in terms of how balanced, interesting and fun those matches are likely to be) and the waiting time for potential matches. A matchmaking threshold is specified. When a player seeks a match a waiting time is observed, for example, as to how long that player waits until starting a game or dropping out. Information about such waiting times is used to dynamically update the matchmaking threshold. The update is made on the basis of a relationship between information about the observed waiting time and a target waiting time. Further control may be achieved by using separate matchmaking thresholds and target waiting times for different game categories.