arXiv (All)
open access
Learnable Randomization as Commitment Against Adaptive Optimizers
A pricing page can walk the posted price up to the last amount a buyer still accepts, a recommender can hold back a better item for a barely acceptable promoted one, and a classifier can shift its boundary once applicants change their features. The system predicts the response and then picks the men
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Decoupled Learning and Selection in Slate Recommendation for Privacy and Stability Under Noisy Scores#1077382
- Scaling Bayesian Bandit Encoding with Shared Learning#973879
- What is Learnable in Valiant's Theory of the Learnable?#180637
- The Geometry of Randomized Smoothing on Feasible Sets#1144464
- Security and Privacy in Machine Learning for Health Systems: Strategies and Challenges#328752
Record · ID 1117103
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive