Maplebear Inc.

Tilman Drerup

Jonathan Gu

Levi Boxell

Robert Fletcher

Tejaswi Tenneti

Haixun Wang

Sharath Rao Karikurve

Changyao Chen

Vinesh Reddy Gudla

Rob Donnelly

Raochuan Fan

Cameron Nicholas Taylor

Bo Xiao

Amin Akbari

Matias Cersosimo

Jennifer Wiersema

Rustin Partow

Oleksii Stepanian

Michael Kurish

Ying Li

Matthew Wean

Pedro Tanure Veloso

Ben Lowenstein

Nour Alkhatib

Yixi Ouyang

An online system may receive, from a content provider, a content presentation campaign that includes one or more objectives. The online system may define a set of one or more policy functions that automatically controls the content presentation campaign. A policy function may control one or more criteria in bidding content slots. The online system may monitor a realized outcome of the content presentation campaign. The online system may apply a reinforcement learning algorithm in adjusting the set of policy functions. The reinforcement learning algorithm adjusts one or more parameters in the set of policy functions to reduce a difference between the realized outcome and the desired outcome set by the content provider. The online system generates an adjusted set of policy functions and uses the adjusted set of policy functions in bidding content slots to present one or more content items provided by the content provider.

Automated policy function adjustment using reinforcement learning algorithm

An online system configures one or more system AI agent instances that interact with user AI agents and performs one or more tasks on behalf of the online system. Thus, responsive to detecting the presence of a user AI agent representing a particular user, the online system directs the session for the user to communicate and interact with a system AI agent.

AI agent-driven interaction model for applications

An online system displays items to a user in search results based on appeasement scores for the items, adjusted according to how specific the search query is. The online system receives a search query from a user of an online system. The online system computes a query specificity score, a measure of the specificity of the search query. The online system accesses candidate items from a database that potentially match the search query. For each candidate item, the online system may compute or predict an appeasement score. The online system adjusts the appeasement score based on the query specificity score such that a more specific query weights the appeasement score lower than a less specific query. The online system may then compute a ranking score based on the adjusted appeasement score and display the candidate items to the user based on their ranking scores.

Ranking search results based on appeasement signals and query specificity

An online concierge system fulfills orders for items offered by retailers and may increase the price of an item offered by a retailer in some instances. The online concierge system applies a markup to an item by applying a pricing policy to a category including the item. To optimize application of pricing policies to categories, the online concierge system categorizes items offered by the retailer and applies an outcome model to combinations of categories and pricing policies. From the output of the outcome model, the online concierge system selects a set of categories and corresponding pricing policies. Using a price adjustment model, the online concierge system determines modifications to one or more of the pricing policies of the set to enforce one or more constraints across multiple pricing policies.

Counterfactual evaluation of policies for categories of items using machine learning prediction of outcomes

An online system uses an offline iterative clustering process to evaluate the performance of a set of content selection frameworks. To perform an iteration of the iterative clustering process, an online system clusters the testing example data into a set of clusters. An online system computes a set of framework scores for each of the generated clusters. An online system computes an improvement score for each cluster based on the performance scores of the clusters. To determine whether to perform another iteration, an online system computes an aggregated improvement score based on the improvement scores of the clusters. If an online system determines that the aggregated improvement score does not meet the threshold, an online system performs another iteration of the process above. When an online system finishes the iterative process, an online system outputs the improvement scores of the most-recent iteration.

Counterfactual policy evaluation of model performance

Growing community of inventors

Palo Alto, CA, United States of America

Tilman Drerup