New AI Math Fixes Messy Data Without Extra Cost
Your apps could get smarter and cheaper, even with imperfect information.
We consider online binary prediction with paid stochastic features, where the learner can spend resources to obtain better observations of the underlying features. This setting is motivated by applications such as medical testing, where additional cost can provide more precise measurements of patient's features for predicting a binary outcome.
At each round, a latent feature is drawn i.i.d., the response is generated through a logistic model, and the learner chooses how much to pay before observing a noisy version of the feature. The goal of learner is to jointly control prediction loss and acquisition cost.
In contrast to the former result on the online linear regression with paid features, covariance information alone is no longer sufficient: two noise distributions with the same covariance may induce different optimal logistic losses, and lower variance can even lead to higher loss. Under a structural ordering in which larger payments yield better observations by removing independent noise, we obtain $\widetilde O(\sqrt{T})$ regret when the noise structure is known and $\widetilde O(T^{2/3})$ regret when it is unknown, with matching lower bounds up to logarithmic factors.
- A new AI method called 'paid logistic regression' improves predictions with noisy data, like typos or blurry images, without expensive extra steps.
- It could make everyday AI tools—like spam filters and recommendation systems—more accurate and cheaper to run.
- The approach is simpler than previous methods, so smaller companies can use it, not just big tech.
Why It Matters
Better AI with messy data means fewer errors in apps you use, potentially saving time and money.