SearcharxivSearch

arXiv subjects

Azwar Abdulsalam

Publications and source records attributed to Azwar Abdulsalam.

3 recordsLinked to original sources

RL Post-Training Builds Compositional Reasoning Strategies

Does RL post-training merely amplify primitive skills already latent in a base model, or can it compose primitive skills into new higher-level strategies? We study this question in a fully observable rewrite-grammar environment where the pretraining distribution is known and every generated rewrite can be audited. A Transformer is pretrained on primitive symbol-rewrite chains and post-trained on a Trace-based reasoning task with only a binary final-answer reward. RL solves held-out problems that remain rarely solved by the pretrained model even under much larger sampling budgets, while rejection fine-tuning improves early but plateaus. Trace analysis shows that RL reorganizes primitive competence through a phased compositional mechanism: it first strengthens primitive reductions, then discovers valid composed procedures. These include sequential compositions, which collapse ordered chains of primitive contractions, and parallel compositions, which combine independent primitive contractions in a single step. The composed procedures are not isolated samples; they are reused and consolidated into a stable repertoire. Comparing RL with rejection fine-tuning shows that the key difference is not exploration volume but selectivity: RFT produces many shortcut-like rewrites, much of them invalid, whereas RL concentrates exploration into valid reusable structure. Pretraining ablations show that the emergence of compositional strategies is gated not by primitive exposure alone, but by whether pretraining organizes primitive competence into reduction procedures that RL can later compress. The base model provides weak procedural ingredients; RL builds them into reliable higher-level strategies.

cs.AI

Learning Recurrent Models with Temporally Local Rules

Fitting generative models to sequential data typically involves two recursive computations through time, one forward and one backward. The latter could be a computation of the loss gradient (as in backpropagation through time), or an inference algorithm (as in the RTS/Kalman smoother). The backward pass in particular is computationally expensive (since it is inherently serial and cannot exploit GPUs), and difficult to map onto biological processes. Work-arounds have been proposed; here we explore a very different one: requiring the generative model to learn the joint distribution over current and previous states, rather than merely the transition probabilities. We show on toy datasets that different architectures employing this principle can learn aspects of the data typically requiring the backward pass.

cs.LG

On the Pricing of Currency Options under Variance Gamma Process

The pricing of currency options is largely dependent on the dynamic relationship between a pair of currencies. Typically, the pricing of options with payoffs dependent on multi-assets becomes tricky for reasons such as the non-Gaussian distribution of financial variable and non-linear macroeconomic relations between these markets. We study the options based on the currency pair US dollar and Indian rupee (USD-INR) and test several pricing formulas to evaluate the performance under different volatility regimes. We show the performance of the variance gamma and the symmetric variance gamma models during different volatility periods as well as for different moneyness, in comparison to the modified Black-Scholes model. In all cases, variance gamma model outperforms Black-Scholes. This can be attributed to the control of kurtosis and skewness of the distribution that is possible using the variance gamma model. Our findings support the superiority of variance gamma process of currency option pricing in better risk management strategies.

q-fin.PR