Research map / Learning theory and algorithms / Prediction and decision losses
Discrete-Smoothness in Online Algorithms with Predictions
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Improved Bounds for Online Facility Location with Predictions (AAAI 2025 · similarity 0.87)
- Overcoming Brittleness in Pareto-Optimal Learning Augmented Algorithms (NeurIPS 2024 · similarity 0.85)
- Online Algorithms with Uncertainty-Quantified Predictions (ICML 2024 · similarity 0.84)
- Algorithms with Calibrated Machine Learning Predictions (ICML 2025 · similarity 0.84)
- Methods with Local Steps and Random Reshuffling for Generally Smooth Non-Convex Federated Optimization (ICLR 2025 · similarity 0.84)
- Online Conformal Prediction via Online Optimization (ICML 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
