Files
roam/thesismethod.org
T
2026-08-29 06:59:35 +03:00

58 lines
2.8 KiB
Org Mode
Raw Blame History

This file contains ambiguous Unicode characters
This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.
:PROPERTIES:
:ID: 0543ac39-af9b-40fd-9973-e60576a20695
:END:
#+title: thesis/method
#+filetags: :project: :knowledge: :method:
Chapter 3 of the BGU MSc thesis on ROLL. Core contribution chapter. Currently ~30 pages.
Parent: [[id:6294e2be-6189-4473-b363-a1dd9a75fb9b][thesis]]
** How roll-aoc Works (CRITICAL — post-pivot hero method)
=roll-aoc= optimizes full AUC by:
1. Sampling 100 evenly-spaced FPR points across [0, 1]
2. Computing ROLL's TPR estimate at each point
3. Averaging — this is a Monte Carlo approximation of the AUC integral
This is *not* partial AUC (which integrates over a sub-range).
This is *not* the pairwise ranking formulation (LibAUC/compositional AUC).
It is a direct numerical integration of the ROC curve via 100 ROLL evaluations.
This distinction must be stated clearly in Ch. 3 and Ch. 2 related work.
** Guidelines
- sec:problem-formulation is now notation-only — motivation deferred to Ch. 2
via \Cref{sec:imbalanced-tpr-fpr,sec:neyman-pearson}
- sec:imbalanced-tpr-fpr and sec:neyman-pearson were removed from this chapter and live in Ch. 2
- Both objectives (TPR@FPR and FPR@TPR) are equivalent by negating scores and swapping labels;
all derivations given for TPR@FPR only — FPR@TPR follows by transformation
** Section Structure
| Section | Label | Status |
|---------|-------|--------|
| Problem Formulation (notation only) | sec:problem-formulation | Done |
| The ROLL Framework | sec:roll-framework | Written |
| Differentiability Problem | sec:differentiability-problem | Written |
| Score Distribution Fitting | sec:score-distribution-fitting | Written |
| General ROLL Formulation and Derivation | sec:roll-formulation | Written — core theoretical contribution |
| Gaussian ROLL (forward + gradient) | sec:roll-gaussian | Written |
| Beta ROLL (forward + gradient) | sec:roll-beta | Stub — TBD |
| KDE ROLL (forward + gradient) | sec:roll-kde | Written |
| Properties | sec:roll-properties | Written — gradient balance + locality |
| Custom Backward Pass | sec:roll-backward | Stub — TBD |
| Numerical Stability | sec:roll-numerical-stability | Stub — TBD |
| Bandwidth Estimation (ISJ + scheduling) | sec:kde-bandwidth | Written |
** Gotchas
- KDE backward pass uses inverse-function-theorem approach deliberately; implicit differentiation
was considered and rejected — user needs to explain the derivation in their own words
- Correct gradient of threshold w.r.t. negative-class score:
σ'(τ − x_i) / Σ_j σ'(τ − x_j) where sum is over ALL of B_0 — sympy-verified
- Beta ROLL: translation-invariance does NOT hold when scores pass through sigmoid before fitting;
gradient-balance property breaks for Beta — documented in sec:roll-properties
- Gradient-balance proof uses a uniform-shift argument; requires translation-invariant CDF estimator