SearcharxivSearch

arXiv subjects

Sumit Sourabh

Publications and source records attributed to Sumit Sourabh.

6 recordsLinked to original sources

Amortized Interventional Forecasting for Multivariate CIR Processes

Mean-reverting dynamics are pervasive in finance, and the Cox--Ingersoll--Ross (CIR) process is a standard model for the time series they produce, from short rates to credit default swap (CDS) spreads. Yet CIR models capture only \emph{correlated} co-movement, not \emph{causal} influence between series, so they cannot answer the system's response when one series is externally shocked, which observational conditionals confound with historical co-movement. We make two contributions. First, an amortized model for distributional causal effect estimation that frames trajectories as time-stamped observations and predicts the calibrated multi-horizon shock response without retraining per scenario. Second, a causal multivariate CIR data-generating process that supplies the paired observational and interventional ground truth that real markets cannot. We instantiate and calibrate the framework on CDS spreads as a testbed. CIR-ACTIVA's validity is established on synthetic ground truth, independent of how well the simulator matches reality, while practical grounding is assessed by backtesting the generated traces against real CDS data. Against observational and amortized causal-inference baselines, CIR-ACTIVA leads on both causal selectivity in the joint distribution and horizon-resolved calibration, retaining its selectivity once the interventional law varies over the horizon, with gains concentrating at short horizons. This opens up a class of what-if queries on coupled spread systems, CDS stress testing among them, that observational forecasters cannot answer.

cs.LG

Canonicity and Relativized Canonicity via Pseudo-Correspondence: an Application of ALBA

We generalize Venema's result on the canonicity of the additivity of positive terms, from classical modal logic to a vast class of logics the algebraic semantics of which is given by varieties of normal distributive lattice expansions (normal DLEs), aka `distributive lattices with operators'. We provide two contrasting proofs for this result: the first is along the lines of Venema's pseudo-correspondence argument but using the insights and tools of unified correspondence theory, and in particular the algorithm ALBA; the second closer to the style of Jónsson. Using insights gleaned from the second proof, we define a suitable enhancement of the algorithm ALBA, which we use prove the canonicity of certain syntactically defined classes of DLE-inequalities (called the meta-inductive inequalities), relative to the structures in which the formulas asserting the additivity of some given terms are valid.

cs.LO

Algebraic modal correspondence: Sahlqvist and beyond

The present paper proposes a new introductory treatment of the very well known Sahlqvist correspondence theory for classical modal logic. The first motivation for the present treatment is {\em pedagogical}: classical Sahlqvist correspondence is presented in a uniform and modular way, and, unlike the existing textbook accounts, extends itself to a class of formulas laying outside the Sahlqvist class proper. The second motivation is {\em methodological}: the present treatment aims at highlighting the {\em algebraic} and {\em order-theoretic} nature of the correspondence mechanism. The exposition remains elementary and does not presuppose any previous knowledge or familiarity with the algebraic approach to logic. However, it provides the underlying motivation and basic intuitions for the recent developments in the Sahlqvist theory of nonclassical logics, which compose the so-called unified correspondence theory.

math.LO

Sahlqvist theory for impossible worlds

We extend unified correspondence theory to Kripke frames with impossible worlds and their associated regular modal logics. These are logics the modal connectives of which are not required to be normal: only the weaker properties of additivity and multiplicativity are required. Conceptually, it has been argued that their lacking necessitation makes regular modal logics better suited than normal modal logics at the formalization of epistemic and deontic settings. From a technical viewpoint, regularity proves to be very natural and adequate for the treatment of algebraic canonicity Jónsson-style. Indeed, additivity and multiplicativity turn out to be key to extend Jónsson's original proof of canonicity to the full Sahlqvist class of certain regular distributive modal logics naturally generalizing Distributive Modal Logic. Most interestingly, additivity and multiplicativity are key to Jónsson-style canonicity also in the original (i.e. normal) DML. Our contributions include: the definition of Sahlqvist inequalities for regular modal logics on a distributive lattice propositional base; the proof of their canonicity following Jónsson's strategy; the adaptation of the algorithm ALBA to the setting of regular modal logics on two non-classical (distributive lattice and intuitionistic) bases; the proof that the adapted ALBA is guaranteed to succeed on a syntactically defined class which properly includes the Sahlqvist one; finally, the application of the previous results so as to obtain proofs, alternative to Kripke's, of the strong completeness of Lemmon's epistemic logics E2-E5 with respect to elementary classes of Kripke frames with impossible worlds.

math.LO

Generalized Vietoris Bisimulations

We introduce and study bisimulations for coalgebras on Stone spaces [14]. Our notion of bisimulation is sound and complete for behavioural equivalence, and generalizes Vietoris bisimulations [4]. The main result of our paper is that bisimulation for a $\mathbf{Stone}$ coalgebra is the topological closure of bisimulation for the underlying $\mathbf{Set}$ coalgebra.

cs.LO

Characterizing Successful Formulas: the Multi-agent Case

Characterization of successful formulas in Public Announcement Logic (PAL) is a well known open problem in Dynamic Epistemic Logic. Recently, Holliday and ICard have given a complete characterization for the single agent case. However, the problem for the multi-agent case is open. This paper gives a partial solution to the problem, characterizing the subclass of the language consisting of unary operators, and discusses methods to give a complete solution.

cs.MA