Research map / Optimization / Nonconvex and smooth optimization
Optimization Over a Probability Simplex
James Chok, Geoffrey M. Vasil
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 Cauchy-Simplex instead of PFW for d>10 | Cauchy-Simplex · Convex hull projection (hypercube, d in 10..50) | iterations and time | Improved |
| use Cauchy-Simplex instead of PFW at d=10 | Cauchy-Simplex · Convex hull projection (hypercube, d=10) | iterations and time | Hurt |
| use Cauchy-Simplex instead of PFW | Cauchy-Simplex · Optimal question weighting (25 trials) | relative entropy | Hurt |
| use Cauchy-Simplex instead of EGD | Cauchy-Simplex · Optimal question weighting (25 trials) | average run time (s): 5.68 -> 5.22 | Improved |
| use Cauchy-Simplex instead of EGD | Cauchy-Simplex · Universal portfolio NYSE | Sharpe ratio: 14.310 -> 14.360 | Improved |
| use Cauchy-Simplex instead of EGD | Cauchy-Simplex · Universal portfolio SP500 | Sharpe ratio: 4.395 -> 4.595 | Improved |
| use Cauchy-Simplex instead of EGD | Cauchy-Simplex · Universal portfolio DJIA | Sharpe ratio: -8.848 -> -8.714 | Improved |
| use Cauchy-Simplex instead of buy and hold | Cauchy-Simplex · Universal portfolio TSE | Sharpe ratio: 10.225 -> 10.629 for B&H | Hurt |
Closest papers by meaning
- A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles (ICML 2024 · similarity 0.86)
- Dynamic Regret Reduces to Kernelized Static Regret (NeurIPS 2025 · similarity 0.86)
- Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity (NeurIPS 2024 · similarity 0.86)
- Information Complexity of Stochastic Convex Optimization: Applications to Generalization, Memorization, and Tracing (ICML 2024 · similarity 0.86)
- Small-loss Adaptive Regret for Online Convex Optimization (ICML 2024 · similarity 0.86)
- Cumulative Regret Analysis of the Piyavskii–Shubert Algorithm and Its Variants for Global Optimization (AAAI 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.
