We construct integral bases for the SO(3)-TQFT-modules of surfaces in genus one and two at roots of unity of prime order and show that the corresponding mapping class group representations preserve a unimodular Hermitian form over a ring of algebraic integers. For higher genus surfaces the Hermitian form sometimes must…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,657 papers · 148 categories
Trend · papers per month
26 results for “Integral-based”
Quantum algorithm speeds up pricing of financial derivatives.
problem Pricing autocallable options efficiently.
method Integration-based exponential amplitude loading technique.
result 50x reduction in circuit depth for payoff component.
We give a definition of higher dimensional iterated integrals based on integration over membranes. We prove basic properties of this definition and formulate a conjecture which extends Chen's de Rham Theorem for iterated integrals to the membrane case.
Convolution operations designed for graph-structured data usually utilize the graph Laplacian, which can be seen as message passing between the adjacent neighbors through a generic random walk. In this paper, we propose PAN, a new graph convolution framework that involves every path linking the message sender and recei…
We introduce a model for the short-term dynamics of financial assets based on an application to finance of quantum gauge theory, developing ideas of Ilinski. We present a numerical algorithm for the computation of the probability distribution of prices and compare the results with APPLE stocks prices and the S&P500 ind…
PAN uses path integrals for graph convolution and pooling, improving GNN performance.
problem Designing efficient graph convolution and pooling for graph neural networks.
method Path integral based graph convolution and pooling using learnable weights for path lengths.
result PAN achieves state-of-the-art performance on various graph classification/regression tasks.
New method models MTPP without predefined intensity functions.
problem Parameterizing conditional joint PDF for MTPP.
method IFIB framework, modeling directly.
result Superior experimental results on real and synthetic data.
We construct representations of the braid groups B_n on n strands on free Z[q,q^-1,s,s^-1]-modules W_{n,l} using generic Verma modules for an integral version of quantum sl_2. We prove that the W_{n,2} are isomorphic to the faithful Lawrence Krammer Bigelow representations of B_n after appropriate identification of par…
Discrete forms of the scalar, sectional and Ricci curvatures are constructed on simplicial piecewise flat triangulations of smooth manifolds, depending directly on the simplicial structure and a choice of dual tessellation. This is done by integrating over volumes which include appropriate samplings of hinges for each …
We present VegasFlow, a new software for fast evaluation of high dimensional integrals based on Monte Carlo integration techniques designed for platforms with hardware accelerators. The growing complexity of calculations and simulations in many areas of science have been accompanied by advances in the computational too…
We introduce a novel Bayesian hybrid matrix factorisation model (HMF) for data integration, based on combining multiple matrix factorisation methods, that can be used for in- and out-of-matrix prediction of missing values. The model is very general and can be used to integrate many datasets across different entity type…
Combines experimental and historical data for robust policy evaluation.
problem Policy evaluation with mixed data sources, especially experimental vs historical.
method Linear integration of estimators from experimental and historical data, optimized for MSE minimization.
result Proposed estimators outperform traditional methods in ridesharing company data.
We find two bases for the lattices of the SU(2)-TQFT-theory modules of the torus over given rings of integers. We use variant of the bases defined in [GMW]for the lattices of the SO(3)-TQFT-theory modules of the torus. Moreover, we discuss the quantization functors (V_{p},Z_{p}) for p=1, and p=2. Then we give concrete …
Consider a real algebraic variety, , of dimension . If its complexification, $\C X$, is a rational homology manifold (at least in a neighborhood of ), then the intersection form in $\C X$ defines a bilinear form in -homologies of . Analizing it, one can obtain an information about , as it …
Deep neural networks with memory learn reduced equations from partial data.
problem Constructing governing equations for unknown dynamical systems from limited data.
method Formulate a discrete approximation of memory integrals, use deep neural networks to incorporate history terms.
result Deep neural networks can learn reduced equations with memory from partial data.
New scalarizing functions improve multi-objective Bayesian optimisation.
problem Improving multi-objective Bayesian optimisation efficiency.
method Comparing two infill criteria based on hypervolume improvement.
result Effective scalarizing functions enhance hypervolume maximisation.
Exponential families and mixture families are parametric probability models that can be geometrically studied as smooth statistical manifolds with respect to any statistical divergence like the Kullback-Leibler (KL) divergence or the Hellinger divergence. When equipping a statistical manifold with the KL divergence, th…
The learning of predictive models for data-driven decision support has been a prevalent topic in many fields. However, construction of models that would capture interactions among input variables is a challenging task. In this paper, we present a new preference learning approach for multiple criteria sorting with poten…
Improves accuracy of SMCI estimators without expanding sum regions.
problem Intractable multiple summations in evaluating expectations on the Ising model.
method Combining multiple SMCI estimators using generalized least squares (GLS).
result The proposed method can improve accuracy without combinatorial explosion.
Analyzes valuation of derivative claims with asymmetric funding costs and WWR.
problem Valuing and hedging derivative claims with bilateral cash flows in asymmetric funding and risk environments.
method Characterizes pre-default claim value as solution to a non-linear Cauchy problem, applies stochastic representation under linear funding policy.
result Derivative claim value can be represented as a portfolio of European options and admits an analytical formula involving elementary functions and Gaussian integrals.
We construct a path integral based on the coupling of the Liouville action and the Mabuchi K-energy on a one-dimensional complex manifold. To the best of our knowledge this is the first rigorous construction of such an object and this is done by means of probabilistic tools. Both functionals play an important role resp…
SAVeD detects dataset versions without metadata, improving accuracy and separation.
problem Difficulty in identifying similar versions of structured datasets.
method Contrastive learning with modified SimCLR pipeline, generating and contrasting augmented table views.
result SAVeD achieves higher accuracy and separation scores on unseen tables.
Advanced AI model predicts stock movements post earnings reports.
problem Inaccurate stock predictions from earnings reports.
method Fine-tuned LLMs with QLoRA compression, integrating financial and market data.
result Significantly improved predictive accuracy compared to benchmarks.
This work introduces a new metric for comparing imprecise probability models.
problem Quantifying differences between imprecise probability models.
method Integral imprecise probability metric framework based on Choquet integral.
result IIPM enables comparison across different imprecise probability models and quantifies epistemic uncertainty.
ProGO optimizes non-convex functions without gradients, outperforming existing methods.
problem Challenges in global optimization, especially with non-convex functions and limited gradient information.
method Probabilistic approach using multidimensional integration and latent slice sampler.
result ProGO converges to global optima efficiently and outperforms existing methods.
New BGs use diffusion models to improve sampling from complex distributions.
problem Sampling from complex, multi-modal distributions is challenging.
method Combines diffusion models with annealed Monte Carlo for improved sampling.
result Second-order denoising kernels can improve performance in high-dimensional spaces.