{"total":13,"rows":[{"id":"2411.00109","title":"Prospective Learning: Learning for a Dynamic Future","created":"2024-10-31","cited_by_count":4,"area":null},{"id":"2601.02193","title":"Learning with Monotone Adversarial Corruptions","created":"2026-01-05","cited_by_count":4,"area":null},{"id":"2504.10428","title":"Smoothed Analysis of Learning from Positive Samples","created":"2025-04-14","cited_by_count":3,"area":null},{"id":"2512.09892","title":"Provably Learning from Modern Language Models via Low Logit Rank","created":"2025-12-10","cited_by_count":3,"area":null},{"id":"2603.04546","title":"Oracle-efficient Hybrid Learning with Constrained Adversaries","created":"2026-03-04","cited_by_count":3,"area":null},{"id":"2609.33760","title":"Oracle-Efficient Online Classification with Stochastic Inputs and Adversarial Outputs","created":"2026-09-27","cited_by_count":3,"area":null},{"id":"2504.10598","title":"Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks","created":"2025-04-14","cited_by_count":2,"area":null},{"id":"2506.00135","title":"Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning","created":"2025-05-30","cited_by_count":2,"area":null},{"id":"2602.17918","title":"Distribution-Free Sequential Prediction with Abstentions","created":"2026-02-20","cited_by_count":1,"area":null},{"id":"2602.20585","title":"Characterizing Online and Private Learnability under Distributional Constraints via Generalized Smoothness","created":"2026-02-24","cited_by_count":1,"area":null},{"id":"2605.07155","title":"Regret-Oracle Complexity Tradeoffs in Agnostic Online Learning","created":"2026-05-08","cited_by_count":1,"area":null},{"id":"2605.12664","title":"Profit Maximization in Bilateral Trade against a Smooth Adversary","created":"2026-05-12","cited_by_count":1,"area":null},{"id":"2609.32478","title":"Agnostic Smoothed Online Regression with Adversarial Responses","created":"2026-09-26","cited_by_count":0,"area":null}],"next_cursor":null}