Research map / Learning theory and algorithms / Combinatorial and search optimization
Asymptotic Risk of Bézier Simplex Fitting
Akinori Tanaka, Akiyoshi Sannai, Ken Kobayashi, Naoki Hamada
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 optimal skeleton-wise sample allocation instead of all-at-once fitting | Bézier simplex fitting, degree 2 · Simplex dimensions M=2–8 | asymptotic risk: 3.0 / N -> 2.91421 / N; 6.0 / N -> 5.49632 / N; 10.0 / N -> 8.66660 / N; 15.0 / N -> 11.9936 / N; 21.0 / N -> 15.1663 / | Improved |
| Use optimal skeleton-wise sample allocation instead of all-at-once fitting | Bézier simplex fitting, degree 3 · Simplex dimension M=2 | asymptotic risk: 4.0 / N -> 3.72726 / N | Improved |
| Use optimal skeleton-wise sample allocation instead of all-at-once fitting | Bézier simplex fitting, degree 3 · Simplex dimensions M=3–8 | asymptotic risk: 10.0 / N -> 10.6472 / N; 20.0 / N -> 23.8821 / N; 35.0 / N -> 44.7548 / N; 56.0 / N -> 73.1387 / N; 84.0 / N -> 107.570 | Hurt |
| Use optimal rather than equal skeleton sample allocation | Inductive skeleton fitting · Synthetic instances, D=2 and D=3 | MSE | Improved |
| Use inductive skeleton fitting rather than all-at-once fitting | Location problem · Location problem, D=2, N=50 and 100 | MSE: 2.855e-04 $\pm$ 2.114e-05 -> 2.691e-04 $\pm$ 8.541e-06; 2.660e-04 $\pm$ 1.227e-05 -> 2.608e-04 $\pm$ 5.946e-06 | Improved |
| Use inductive skeleton fitting rather than all-at-once fitting | Location problem · Location problem, D=3, N=50 and 100 | MSE: 3.596e-04 $\pm$ 7.935e-05 -> 3.269e-04 $\pm$ 3.969e-05; 2.810e-04 $\pm$ 1.569e-05 -> 2.796e-04 $\pm$ 1.478e-05 | No clear effect |
| Use all-at-once rather than inductive skeleton fitting | Group lasso · Group lasso, D=2 and D=3, N=50 and 100 | MSE: 1.041e-04 $\pm$ 1.614e-05 vs 4.966e-04 $\pm$ 1.848e-05; 8.949e-05 $\pm$ 6.083e-06 vs 5.020e-04 $\pm$ 1.276e-05; 4.354e-0 | Improved |
Closest papers by meaning
- Bézier Simplex Fitting: Describing Pareto Fronts of´ Simplicial Problems with Small Samples in Multi-Objective Optimization (AAAI 2019 · similarity 0.89)
- Simplex Constrained Sparse Optimization via Tail Screening (JMLR 2025 · similarity 0.83)
- Iterative Hessian Sketch: Fast and Accurate Solution Approximation for Constrained Least-Squares (JMLR 2016 · similarity 0.83)
- Geometric Multi-Model Fitting With a Convex Relaxation Algorithm (CVPR 2018 · similarity 0.82)
- Extensions to the Proximal Distance Method of Constrained Optimization (JMLR 2022 · similarity 0.82)
- One Sample Fits All: Approximating All Probabilistic Values Simultaneously and Efficiently (NeurIPS 2024 · similarity 0.81)
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.
