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.
GRCN improves GCNs by predicting missing edges and revising weights.
RoGAT enhances GAT robustness against adversarial attacks.
Inverse problems correspond to a certain type of optimization problems formulated over appropriate input distributions. Recently, there has been a growing interest in understanding the computational hardness of these optimization problems, not only in the worst case, but in an average-complexity sense under this same i…
Revises GNN neighborhood aggregation for more accurate node classification.
A method for selecting pseudo-labeled data in semi-supervised learning using generalized Bayes and soft revision.
Locally connected boundaries of Coxeter groups are studied.
Most of real-world graphs are dynamic, i.e., they change over time by a sequence of update operations. While the regression problem has been studied for static graphs and temporal graphs, it is not investigated for general dynamic graphs. In this paper, we study regression over dynamic graphs. First, we present the not…
Upper bounds on revised first Betti number and torus stability for RCD spaces.
This is a substantially revised version. The Kontsevich integral of a knot is a graph-valued invariant which (when graded by the Vassiliev degree of graphs) is characterized by a universal property; namely it is a universal Vassiliev invariant of knots. We introduce a second grading of the Kontsevich integral, the Eule…
Constructs real algebraic functions with both compact and non-compact preimages.
SPLICE simulates incurred losses and their revisions.
CROQ optimizes LLM decision-making by narrowing down choices and improving accuracy.
The Kontsevich integral of a knot is a powerful invariant which takes values in an algebra of trivalent graphs with legs. Given a Lie algebra, the Kontsevich integral determines an invariant of knots (the so-called colored Jones function) with values in the symmetric algebra of the Lie algebra. Recently A. Kricker and …
While accelerators such as GPUs have limited memory, deep neural networks are becoming larger and will not fit with the memory limitation of accelerators for training. We propose an approach to tackle this problem by rewriting the computational graph of a neural network, in which swap-out and swap-in operations are ins…
GNNGuard defends Graph Neural Networks against structural perturbations.
Revised ct-SNE improves t-SNE for visualizing data beyond labels.
A framework for cost of belief revision in uncertain agents.
Revised proof shows ribbonness of surface-links in 4-sphere.
Study on RCD(0,N) spaces with small linear diameter growth.
Proposes HetSANN for learning heterogeneous graph structures without meta-paths.
New method identifies uncertainty shocks in financial markets using revised VIX.
Two DRL policies collaborate to solve NP-hard routing problems.
From SA-CCR to RSA-CCR: making SA-CCR self-consistent and appropriately risk-sensitive by cashflow decomposition in a 3-Factor Gaussian Market Model
Bayesian logistic regression improves clinical risk prediction models over time.
Neural Networks (NN) have recently emerged as backbone of several sensitive applications like automobile, medical image, security, etc. NNs inherently offer Partial Fault Tolerance (PFT) in their architecture; however, the biased PFT of NNs can lead to severe consequences in applications like cryptography and security …
We study a class of 3-dimensional paracontact metric manifolds and we revise some of the results obtain in \cite{SS}.
This paper has been withdrawn, because its material has been revised and became part of paper math.GT/0010184
Zero-shot and few-shot learning aim to improve generalization to unseen concepts, which are promising in many realistic scenarios. Due to the lack of data in unseen domain, relation modeling between seen and unseen domains is vital for knowledge transfer in these tasks. Most existing methods capture seen-unseen relatio…
We analyze differences between two information-theoretically motivated approaches to statistical inference and model selection: the Minimum Description Length (MDL) principle, and the Minimum Message Length (MML) principle. Based on this analysis, we present two revised versions of MML: a pointwise estimator which give…
CASPER improves DAG structure learning by integrating graph structure into score function.
This is a survey article, to appear in the Proceedings of the 2018 International Congress of Mathematicians. (Revised, with added and updated references.)
We establish a surgery formula for 3-dimensional Seiberg-Witten monopoles under (+1) Dehn surgery on a knot in a homology 3-sphere. (substantial revision)
The study finds significant power-law cross correlations in Bitcoin's return-volatility dynamics.
This is an expanded version of the lecture course the second author gave at Winterbraids VI in Lille in February 2016. Version 2: revision incorporating referee remarks.
This paper has been withdrawn by the authors. Significantly revised versions of the results of this paper are now available in arXiv:0707.0487v2 and arXiv:0808.3169v1.
Many real-world problems can be reduced to combinatorial optimization on a graph, where the subset or ordering of vertices that maximize some objective function must be found. With such tasks often NP-hard and analytically intractable, reinforcement learning (RL) has shown promise as a framework with which efficient he…
We use the maximum entropy principle for pricing the non-life insurance and recover the Bühlmann results for the economic premium principle. The concept of economic equilibrium is revised in this respect.
This paper supplies two possible resolutions of Fortune's (2000) margin-loan pricing puzzle. Fortune (2000) noted that the margin loan interest rates charged by stock brokers are very high in relation to the actual (low) credit risk and the cost of funds. If we live in the Black-Scholes world, the brokers are presumabl…
This paper is a revised version of a previously posted paper in arxiv. The authors posted it as a new submission by mistake. The latest version of the paper can be found at arXiv:math-ph/0512003v2
We construct a new type of geometric knot theory, plumbers' knots, and solve the problems of distinguishing and enumerating such knots at a fixed level of complexity. (v2) Minor edits, added theorem 3.18. (v3) Substantial revisions, essentially completely rewritten in places.
This is the first of two articles in which we give a proof - for a broad class of four-manifolds - of Witten's conjecture that the Donaldson and Seiberg-Witten series coincide, at least through terms of degree less than or equal to c-2, where c is a linear combination of the Euler characteristic and signature of the fo…
We study canonical decompositions of postcritically finite branched coverings of the 2-sphere, as defined by K. Pilgrim. We show that every hyperbolic cycle in the decomposition does not have a Thurston obstruction. It is thus Thurston equivalent to a rational map.
We construct Bott-type and equivariant Seiberg-Witten Floer homology and cohomology for 3-manifolds, in particular rational homology spheres, and prove their diffeomorphism invariance. This paper is a revised version of math.DG/9701010. Some typos are removed.
We use sutured manifold theory, essential laminations and essential branched surfaces to establish the upper bounds of distances between certain types of nonsimple Dehn surgery slopes. This is the revised version of an earlier preprint {\it Dehn surgery and simple manifolds.}
New evidence refutes old conjectures about knot homology ranks, suggesting new congruences.
The aim of this paper is to show that Lawson's foliation on the 5-sphere admits a smooth leafwise symplectic structure. The main part of the construction is to show that the Fermat type cubic surface admits an end-periodic symplectic structure.
These revised lecture notes are an expository account of part of the proof of Thurston's Ending Lamination Conjecture for Kleinian surface groups, which states that such groups are uniquely determined by invariants that describe the asymptotic structure of the ends of their quotient manifolds.
Revises Gauss's Lemma using metrical distortion and differential slip.