Research map / Bandits and online learning / Online convex optimization and games
Efficient Online Portfolio with Logarithmic Regret
Haipeng Luo, Chen-Yu Wei, Kai Zheng
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Use a lower-bounded simplex with x_i ≥ 1/(NT) | BARRONS · Online portfolio management | regret | Improved |
| Replace the adaptive beta tuning with a standard doubling schedule | BARRONS · Online portfolio management | regret | Mixed |
| Run a grid of BARRONS copies and select among them with Hedge | BARRONS · Online portfolio management | time per round: MN^{3.5} | Hurt |
Closest papers by meaning
- Online Min-Max Optimization: From Individual Regrets to Cumulative Saddle Points (NeurIPS 2026 · similarity 0.89)
- An Equivalence Between Static and Dynamic Regret Minimization (NeurIPS 2024 · similarity 0.87)
- On the Universal Near Optimality of Hedge in Combinatorial Settings (NeurIPS 2025 · similarity 0.86)
- Dynamic Regret Reduces to Kernelized Static Regret (NeurIPS 2025 · similarity 0.86)
- Wait-Less Offline Tuning and Re-solving for Online Decision Making (ICML 2025 · similarity 0.86)
- Fully Unconstrained Online Learning (NeurIPS 2024 · similarity 0.85)
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.
