Reproducibility artifact for Sharp Root Anti-Concentration via Projective Incidence and Ordered Root Laws by Zijun Wang, Yuchen Miao, Yifan Hu, and Huanmin Liu. The paper's results are analytic; this repository provides executable identity checks and seeded illustrations of the geometric and learning-theoretic mechanisms.
After the one-time setup below, one command reproduces every test, figure, and table:
bash reproduce_all.shCPU only · Python 3.10+ · fixed seeds · about one minute on a recent laptop
python3 -m venv .venv
source .venv/bin/activate
python -m pip install -e ".[test]"
bash reproduce_all.shThe script runs the complete test suite before regenerating the contents of figures/ and results/. To run only the tests:
python -m pytest| Study | Paper connection | Run | Main outputs |
|---|---|---|---|
| Cube incidence | Dimension-free example, Equation (19) | python experiments/dimension_free.py |
Hitting ratios, exact reference, Wilson intervals |
| Gaussian-RBF graph SSL | Equation (56), Theorem 5.1 | python experiments/rbf_graph_ssl.py |
Transitions, utilities, online regret |
| Common-offset polynomial law | Mechanism used in Theorem 5.2 | python experiments/common_offset_demo.py |
Coefficient curve, translated root law |
| Consistency checks | Analytic and online interfaces | python -m pytest |
Incidence, derivatives, timing, root translation |
For the feature curve
Only the two active coordinates are sampled; integrating out the remaining coordinates leaves the root event unchanged. The experiment compares the exact dimension-free value with seeded Monte Carlo estimates and pointwise 95% Wilson intervals.
The RBF experiment instantiates the transition-to-regret pipeline. It solves the grounded harmonic systems directly, constructs the piecewise-constant cost-sensitive utilities, and runs full-information Hedge on the horizon-dependent parameter grid.
The regret panel separates two finite comparators: regret to the algorithm grid is exact, while the second curve uses the union of that grid with a dense evaluation grid. Error bars are pointwise normal-approximation 95% intervals over 30 independent cost/action repetitions, conditional on the fixed oblivious base-instance sequence.
The transition and utility panels come from the same fixed maximum-horizon run. A deterministic rule selects an illustrative score curve; its selection metadata and the displayed rounds are recorded with the numerical outputs.
For a fixed polynomial
- Exact checks. The test suite covers the cube hitting identity, the cube-section incidence formula, harmonic-score derivatives, the online action/observation order, and polynomial root translation.
- Online timing. Utility matrices are precomputed by the oblivious environment and remain hidden from the learner.
act()receives no utility input; the current utility row reachesobserve()only after the action is fixed. - Numerics. Grounded linear systems are solved directly. No matrix inverse or determinant expansion is evaluated numerically.
- Randomness. All generators use fixed, explicitly recorded seeds. Figures are saved in both PNG and vector PDF formats; tables and configuration metadata are saved as CSV files.
The full protocol, comparator definitions, figure-selection rules, and output inventory are documented in docs/REPRODUCIBILITY.md.
experiments/ figure and table generators
src/sharp_root_ac/ incidence, harmonic-extension, online-learning,
and polynomial-shift routines
tests/ equation- and protocol-level checks
figures/ generated PNG and vector PDF figures
results/ generated CSV summaries and metadata
docs/ reproduction protocol and output inventory
Citation metadata are provided in CITATION.cff and are also available through GitHub's Cite this repository menu.
Released under the MIT License.