- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper studies contextual link adaptation with a linear latent capacity and a known calibrated noise CDF. SOLA applies Online Newton Step to the ACK/NACK negative log-likelihood and greedily selects the throughput-maximizing rate under its current estimate. The derived bounds throughput suboptimality by squared prediction error and then reduces it to exp-concave likelihood regret, obtaining logarithmic expected regret.
Critical strengths
- A strong connection between the observation and the theoretical guarantee.
- The paper distinguishes standard deviations from confidence intervals. This makes the practical case more credible.
Critical weaknesses
- The technical novelty is relatively limited. The estimator is standard ONS, and the objective has the same structure as binary-feedbackr evenue maximization with a known demand model.
- The empirical contribution of the proposed algorithm is not isolated. The conducted experimental results support the practical scenarios, but do not establish the advantage of the analyzed second-order update over a simpler likelihood update.
Questions for authors
-
Could you compare directly with the closest known-CDF contextual-pricing or likelihood-learning methods?
-
In the same setup, how do a first-order likelihood update and the practical SOLA implementation compare?
-
Which contextual and calibration information is available to each method in the finite-MCS SALAD comparison?