- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Learned Functional Projection (LFP) to recover implied volatility surfaces from sparse, irregular market quotes (function regression problem). The method builds on Function Encoders and differentiable ridge solvers and a shared set of continuous basis functions and uses weighted ridge regression to fit each new surface. The empirical performance is strong on real market data from four equity-index option markets, while surface construction takes only milliseconds.
Critical strengths
None
Critical weaknesses
W1. The methodological contribution seems relatively incremental. It looks more like a direct combination of Function Encoders and ridge-based meta-learning. I acknowledge the contribution of the theoretical analysis, but it remains unclear to me what substantial methodological advance LFP provides beyond adapting these ideas to volatility smoothing.
W2. The baseline comparison is not fully convincing. The comparison with Neural Process methods is missing. Moreover, I have some questions about the GNO setting; see the questions section below.
Questions for authors
Q1 SPX, NDX, RUT are used in the abstract but not defined. These abbreviations should be explained at first use .
Q2. From my understanding, GNO relies on kernel integral to approximate a continuous operator, and the radius of GNO usually has physical meaning. Is GNO appropriately configured for this finance task? I hope the authors to explain its coordinate choice and neighborhood radius. The aggregation of the GNO uses at most 35 neighbors node, in this case, why not use GNN?
Q3. For the experiment part, GNO uses released SPX weights without retraining on the daily dataset, whereas LFP and HyperIV are trained on that dataset. Another minor question for the authors is why does the abstract emphasize the relative improvement over GNO, which is not the strongest baseline as shown in Table 4.1
Q4. I think the task looks closely related to Neural Process-style conditional function regression, so a comparison with state-of-the-art Neural Process baselines would also be informative. (eg. Neural Diffusion/Flow Matching Process)
3 comments
[Continuing previous comment]
Q3: GNO training data and the abstract comparison.
We now report both GNO-20min and GNO-daily. The former uses the officially released SPX weights; the latter is retrained using the same daily SPX training split as the other learned models, directly addressing the comparison under a common daily-data setting.
The original abstract emphasized GNO and HyperIV because they were recent advanced neural methods for implied volatility smoothing, and we aimed to demonstrate the advantages of learning low-dimensional function spaces relative to neural operators and hypernetworks. The revised abstract reports improvements over the strongest error baseline under each protocol: a 39.3% reduction in RW relative to PCA ridge under standard inputs and a 46.5% reduction relative to FlowNP under nine-quote inputs. It also summarizes cross-asset performance, financial regularization, and computational efficiency.
Q1: Abbreviations in the abstract.
We have provided the full index names corresponding to SPX, NDX, RUT, and DJX at their first occurrence.
Dear Reviewer,
Thank you for your valuable feedback. We have carefully addressed all the concerns raised in the reviews.
As the discussion deadline is approaching, we would greatly appreciate it if you could take a moment to review our rebuttal responses and revised PDF, and provide any follow-up feedback, particularly on whether their concerns have been adequately addressed. Thank you for your time!
Best regards,
The Authors
Thank you for your detailed feedback. We have added comparisons with FlowNP, GNO-daily, and VAE, rewritten the Introduction, and added Figure 1.1 and Algorithm 1. The revised PDF is available for download at the top of this page. All revisions are highlighted in blue for easy reference. We address your comments below.
W1: Methodological contribution.
LFP’s central contribution is to select a continuous function space according to its recovery performance under limited observations. We embed coefficient recovery into space learning: coefficients are fitted from input quotes, and prediction error on query quotes jointly optimizes the basis functions and ridge parameter. The learned representation therefore accounts for both surface expressivity and coefficient recoverability.
Our theory shows that even when two spaces represent a target surface exactly, their recovery-risk ratio can be arbitrarily large. Thus, the best approximation space need not be the best recovery space. Controlled experiments with the same network architecture and space dimension further validate this design: recovery-oriented training reduces RW by 29.9% and 11.2% relative to the two alternative training objectives. Our contribution is to establish and validate this recovery-oriented space-learning principle and realize it through a simple shared-basis design that supports financial shape control and fast surface updates. The revised Introduction and Figure 1.1 clarify this motivation and its connection to the method.
W2 and Q4: Comparison with Neural Process methods.
We have added FlowNP, a flow-matching Neural Process method of the type you suggested. The following results are for SPX. RW is reported as a decimal, violation rates as percentages, and latency as median end-to-end inference time.
FlowNP achieves competitive quote prediction, but substantial butterfly violations remain even after incorporating and tuning financial regularization during training. A possible explanation is that butterfly conditions involve second-order spatial derivatives: small pointwise prediction errors do not ensure financially admissible local curvature. For FlowNP, shape regularization must act through the multistep sampling process to constrain the final surface. LFP’s explicit continuous basis representation facilitates direct computation and regularization of surface derivatives.
Furthermore, even with a reduced sampling budget of three samples and eight steps, FlowNP’s GPU inference is approximately 25 times slower than LFP’s, and its CPU inference approximately 1,000 times slower. This computational cost poses a practical challenge when surfaces must be updated frequently as market quotes change, particularly across multiple assets. Full results on accuracy, financial shape, cross-asset transfer, and computational cost have been added to the main paper and appendices.
Q2: GNO coordinates, neighborhoods, and its relationship to GNNs.
We use the GNO developed by Wiedemann et al. specifically for implied volatility smoothing. Its coordinates are r=τ and z=log(K/F)/τ, where τ is time to maturity, K is the strike price, and F is the forward price. Following the publicly released code configuration, the neighborhood radius is 0.3, applied only along the r-axis to control information exchange between maturity slices. At most 35 neighbors per node are retained for the discrete approximation of the kernel integral.
An important motivation for using GNO is its discretization-invariant operator formulation. Option quotes are highly irregular across strikes and maturities, and their locations and number change over time. The model must therefore accommodate different input discretizations and predict surfaces at query coordinates. GNO addresses this through shared coordinate-dependent kernels. It is itself implemented through graph message passing; the 35-neighbor cap is a computational budget and does not change its continuous-operator modeling objective. The rationale for using GNO is therefore its suitability for changing quote sets.
[Continued in the next comment]