Goto

Collaborating Authors

 customer


Why Walmart and OpenAI Are Shaking Up Their Agentic Shopping Deal

WIRED

After OpenAI's Instant Checkout feature fell short, Walmart is instead embedding its Sparky chatbot directly into ChatGPT and Google Gemini. Since November, Walmart has let some ChatGPT users order a limited selection of products without ever leaving OpenAI's chatbot interface. Sales have been disappointing, a Walmart executive vice president exclusively tells WIRED. The results suggest that a future where chatbots and AI agents take over ecommerce is still a way off, if it ever materializes. Last year, OpenAI made a bet that it could boost revenue by charging a commission on purchases made through ChatGPT.


DoorDash Reservations Scored America's Most Exclusive Restaurants

WIRED

After the rise (and fall) of reservation scalping, DoorDash and a host of apps are fighting to book you a seat at the country's most exclusive restaurants. At The Eighty-Six in Manhattan, exclusivity is the point. The luxe, 11-table steakhouse is the sort of place that lavishes caviar and aged mimolette cheese on its potatoes, and crows that your market-price duck was raised by one Dr. Taylor Swift has reportedly dined there in a Miu Miu skirt. Reservations are a scarce commodity that the restaurant, and New York law forbids you from selling one. "Access is the main asset," wrote food writer Helen Rosner in a recent New Yorker review of The Eighty-Six. "The product is the door, and what a door!



Assortment Optimization Under the Mallows model

Neural Information Processing Systems

We consider the assortment optimization problem when customer preferences follow a mixture of Mallows distributions. The assortment optimization problem focuses on determining the revenue/profit maximizing subset of products from a large universe of products; it is an important decision that is commonly faced by retailers in determining what to offer their customers. There are two key challenges: (a) the Mallows distribution lacks a closed-form expression (and requires summing an exponential number of terms) to compute the choice probability and, hence, the expected revenue/profit per customer; and (b) finding the best subset may require an exhaustive search. Our key contributions are an efficiently computable closed-form expression for the choice probability under the Mallows model and a compact mixed integer linear program (MIP) formulation for the assortment problem.


The Iran War Is Throwing Global Shipping Into Chaos

WIRED

Flexport CEO Ryan Petersen says the conflict is stranding cargo and threatening inflation. After years of chaos in the global supply chain, Ryan Petersen, CEO of the logistics company Flexport, felt 2026 might offer some modicum of order. The pandemic was firmly in the rearview mirror. Red Sea shipping channels--which had been closed due to the Gaza crisis--were finally opening. The Supreme Court struck down many of Donald Trump's tariffs, and some Flexport customers were hoping for refunds.


Code Metal Raises 125 Million to Rewrite the Defense Industry's Code With AI

WIRED

The Boston startup uses AI to translate and verify legacy software for defense contractors, arguing modernization can't come at the cost of new bugs. Code Metal, a Boston-based startup that uses AI to write code and translate it into other programming languages, just closed a $125 million Series B funding round from new and existing investors. The news comes just a few months after the startup raised $36 million in series A financing led by Accel. Code Metal is part of a new wave of startups aiming to modernize the tech industry by using AI to generate code and translate it across programming languages. One of the questions that persists about AI-assisted code, though, is whether the output is any good--and what the consequences might be if it's not.




Language models are weak learners

Neural Information Processing Systems

A central notion in practical and theoretical machine learning is that of a weak learner, classifiers that achieve better-than-random performance (on any given distribution over data), even by a small margin. Such weak learners form the practical basis for canonical machine learning methods such as boosting.


Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models

Yining Wang, Xi Chen, Yuan Zhou

Neural Information Processing Systems

In this paper we consider the dynamic assortment selection problem under an uncapacitated multinomial-logit (MNL) model. By carefully analyzing a revenue potential function, we show that a trisection based algorithm achieves an item-independent regret bound of Op? T log log T q, which matches information theoretical lower bounds up to iterated logarithmic terms. Our proof technique draws tools from the unimodal/convex bandit literature as well as adaptive confidence parameters in minimax multi-armed bandit problems.