schaeferbasti commited on
Commit
c54fafc
·
1 Parent(s): f167230

Fix figure descriptions

Browse files
Files changed (1) hide show
  1. index.html +8 -14
index.html CHANGED
@@ -82,8 +82,8 @@
82
  intervals from cluster-bootstrap resamples of the datasets. The left bar of each method is
83
  shaded by <span class="stab">stability</span> (how little the selected subset changes across
84
  bootstrap resamples of the data), the right bar by <span class="val">validity</span> (how well
85
- injected noise features are rejected); darker is better for both, see the Stability and
86
- Validity tabs. Hatched bars have no stability or validity result yet.
87
  </p>
88
  </div>
89
  <div id="lb-table">
@@ -93,14 +93,8 @@
93
  <p>Methods are compared within a <em>comparison group</em>: one dataset split, one downstream
94
  model configuration and one feature budget. The selection is shared with the Performance Trade-offs tab.</p>
95
  <ul>
96
- <li><strong>Type</strong>: the paper's functional taxonomy (Appendix A). <em>Search</em>
97
- methods evaluate many feature subsets with a model-dependent utility: forward search (SFS),
98
- backward search (SBE, MarkovBlanket) and leave-one-out (LOCO). <em>Non-search</em> methods
99
- avoid repeated subset evaluations and rely on a proxy instead: correlation (F-Test), distance
100
- ((R)ReliefF, LaplacianScore), information theory (MI, mRMR, GainRatio), trees (CART,
101
- RFImportance) and regularization (Lasso, ElasticNet). Random is the baseline.</li>
102
- <li><strong>#</strong> and <strong>Elo</strong>: rank by Elo, with gold, silver and bronze for the three best; +/− give the
103
- 95% interval (the Elo rating is explained under the figure above).</li>
104
  <li><strong>Avg. rank</strong>: mean rank of the method's downstream error within the groups (1 is best).</li>
105
  <li><strong>Improvability</strong>: mean relative gap <code>(error − best error) / error</code> to
106
  the best method of the group (0 is best).</li>
@@ -110,8 +104,8 @@
110
  <li><strong>Budgets</strong>: budget <em>i</em> of <em>b</em> keeps <code>ceil(d · i / (b + 1))</code>
111
  of a dataset's <code>d</code> features when <code>d ≤ 100</code>, and <code>ceil(d ^ (i / (b + 1)))</code>
112
  otherwise.</li>
113
- <li><strong>Time</strong>: median wall-clock time of the selection. <strong>Fallback</strong>:
114
- share of runs in which the method ran out of time and random features filled the budget.</li>
115
  </ul>
116
  </div>
117
  </div>
@@ -149,10 +143,10 @@
149
  <iframe class="frame sa-frame fig-frame" id="plot-pareto" title="Pareto front of improvement over Random against feature selection time per 1k features" style="height:470px"></iframe>
150
  <figcaption class="caption">
151
  <strong>Predictive performance against selection time.</strong> Improvement of the
152
- downstream error over Random (%, higher is better) against the feature selection time per
153
  1,000 features (log scale, left is faster), averaged over budgets, downstream models and
154
  splits per dataset, then over datasets. Orange methods are on the Pareto front: no other
155
- method is both faster and better. As in the paper, LaplacianScore is left out of the
156
  figure (far below Random); its values are in the CSV.
157
  </figcaption>
158
  </figure>
 
82
  intervals from cluster-bootstrap resamples of the datasets. The left bar of each method is
83
  shaded by <span class="stab">stability</span> (how little the selected subset changes across
84
  bootstrap resamples of the data), the right bar by <span class="val">validity</span> (how well
85
+ injected noise features are rejected); darker is better for both. For details, see the Stability and
86
+ Validity tabs.
87
  </p>
88
  </div>
89
  <div id="lb-table">
 
93
  <p>Methods are compared within a <em>comparison group</em>: one dataset split, one downstream
94
  model configuration and one feature budget. The selection is shared with the Performance Trade-offs tab.</p>
95
  <ul>
96
+ <li><strong>Type</strong>: the method type following the <a href="https://arxiv.org/abs/2610.13644" target="_blank" rel="noopener">paper</a>'s functional taxonomy (Appendix A)
97
+ <li><strong>Elo</strong>: rank by Elo, +/− give the 95% interval (Elo rating is explained under the figure above).</li>
 
 
 
 
 
 
98
  <li><strong>Avg. rank</strong>: mean rank of the method's downstream error within the groups (1 is best).</li>
99
  <li><strong>Improvability</strong>: mean relative gap <code>(error − best error) / error</code> to
100
  the best method of the group (0 is best).</li>
 
104
  <li><strong>Budgets</strong>: budget <em>i</em> of <em>b</em> keeps <code>ceil(d · i / (b + 1))</code>
105
  of a dataset's <code>d</code> features when <code>d ≤ 100</code>, and <code>ceil(d ^ (i / (b + 1)))</code>
106
  otherwise.</li>
107
+ <li><strong>Time</strong>: median wall-clock time of the selection.</li>
108
+ <li><strong>Fallback</strong>: share of runs in which the method ran out of time and random features filled the budget.</li>
109
  </ul>
110
  </div>
111
  </div>
 
143
  <iframe class="frame sa-frame fig-frame" id="plot-pareto" title="Pareto front of improvement over Random against feature selection time per 1k features" style="height:470px"></iframe>
144
  <figcaption class="caption">
145
  <strong>Predictive performance against selection time.</strong> Improvement of the
146
+ downstream model error over Random (%, higher is better) against the feature selection time per
147
  1,000 features (log scale, left is faster), averaged over budgets, downstream models and
148
  splits per dataset, then over datasets. Orange methods are on the Pareto front: no other
149
+ method is both faster and better. LaplacianScore is left out of the
150
  figure (far below Random); its values are in the CSV.
151
  </figcaption>
152
  </figure>