AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions

Shinsaku Sakaue, Taihei Oki

NeurIPS 2022 · Learning theory and algorithms › Sample complexity · approach: Computational thresholds in graphs and structure · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Bound warm-start iterations using the \ell_\infty distance between prediction and optimumDCA-based warm-start for weighted perfect bipartite matching · Weighted perfect bipartite matchingtime complexity: \mathrm{O}(m\sqrt{n}\norm{\hat{p} - p^*}_1) -> \mathrm{O}(m\sqrt{n}\norm{p^* - \hat{p}}_\infty)Improved
Learn predictions by minimizing expected \ell_\infty error rather than expected \ell_1 errorPrediction learning · Batch prediction learningsample complexity: \mathrm{O}(C^2n^3\log n) -> \mathrm{O}(C^2n)Improved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy