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.
This paper finds efficient algorithms for approximating Markov networks with k-tree topologies.
This work presents novel algorithms for learning Bayesian network structures with bounded treewidth. Both exact and approximate methods are developed. The exact method combines mixed-integer linear programming formulations for structure learning and treewidth computation. The approximate method consists in uniformly sa…
Let be a countable group that splits as a free product of groups of the form , where is a finitely generated free group. We identify the closure of the outer space for the axes topology with the space of projective minimal, \emph{very small} …
In this paper, we investigate the statistical features of the weighted international-trade network. By finding the maximum weight spanning trees for this network we make the extraction of the truly relevant connections forming the network's backbone. We discuss the role of large-sized countries (strongest economies) in…
We propose a novel self-attention mechanism that can learn its optimal attention span. This allows us to extend significantly the maximum context size used in Transformer, while maintaining control over their memory footprint and computational time. We show the effectiveness of our approach on the task of character lev…
We show for an alternating knot the minimal boundary slope of an essential spanning surface is given by the signature plus twice the minimum degree of the Jones polynomial and the maximal boundary slope of an essential spanning surface is given by the signature plus twice the maximum degree of the Jones polynomial. For…
This paper shows neural networks can solve complex graph problems efficiently.
Statistical uncertainty of different filtration techniques for market network analysis is studied. Two measures of statistical uncertainty are discussed. One is based on conditional risk for multiple decision statistical procedures and another one is based on average fraction of errors. It is shown that for some import…
We propose a new complexity measure for Markov decision processes (MDPs), the maximum expected hitting cost (MEHC). This measure tightens the closely related notion of diameter [JOA10] by accounting for the reward structure. We show that this parameter replaces diameter in the upper bound on the optimal value span of a…
New insights into optimization and generalization for linear models.
Method for factor analysis in short panels without assuming sphericity or Gaussianity.
LoBoost improves local conformal prediction for gradient-boosted trees without extra data splits.
We consider two connected aspects of maximum likelihood estimation of the parameter for high-dimensional discrete graphical models: the existence of the maximum likelihood estimate (mle) and its computation. When the data is sparse, there are many zeros in the contingency table and the maximum likelihood estimate of th…
Weighted SVM (or fuzzy SVM) is the most widely used SVM variant owning its effectiveness to the use of instance weights. Proper selection of the instance weights can lead to increased generalization performance. In this work, we extend the span error bound theory to weighted SVM and we introduce effective hyperparamete…
The problem of maximum-likelihood (ML) estimation of discrete tree-structured distributions is considered. Chow and Liu established that ML-estimation reduces to the construction of a maximum-weight spanning tree using the empirical mutual information quantities as the edge weights. Using the theory of large-deviations…
The study compares Bayesian and frequentist approaches in deep learning.
New spanning 3-disks found for unlink in 4-sphere.
Bayesian Entropy Neural Networks enforce constraints on deep learning predictions.
Cryptocurrency market becomes more cross-correlated over time.
Market portfolio decomposed into body and tail legs
We consider the problem of consistently matching multiple sets of elements to each other, which is a common task in fields such as computer vision. To solve the underlying NP-hard objective, existing methods often relax or approximate it, but end up with unsatisfying empirical performance due to a misaligned objective.…
Sharp bounds for spanning tree entropy in planar lattices.
Totally geodesic surfaces found in knots and links.
We provide a new theory for nodewise regression when the residuals from a fitted factor model are used. We apply our results to the analysis of the consistency of Sharpe ratio estimators when there are many assets in a portfolio. We allow for an increasing number of assets as well as time observations of the portfolio.…
Test-asset construction affects factor model performance.
This study analyzes information flow networks in Chinese stock sectors using transfer entropy.
The Jones polynomial can be expressed in terms of spanning trees of the graph obtained by checkerboard coloring a knot diagram. We show there exists a complex generated by these spanning trees whose homology is the reduced Khovanov homology. The spanning trees provide a filtration on the reduced Khovanov complex and a …
A new classification method based on Minimum Spanning Trees
We introduce a globally-convergent algorithm for optimizing the tree-reweighted (TRW) variational objective over the marginal polytope. The algorithm is based on the conditional gradient method (Frank-Wolfe) and moves pseudomarginals within the marginal polytope through repeated maximum a posteriori (MAP) calls. This m…
Ancient curves span halfplanes via flow.
Refines knot defect measurement in 3D and 4D.
Spanning attack improves black-box attacks with unlabeled data.
We consider embedded ring-type surfaces (that is, compact, connected, orientable surfaces with two boundary components and Euler-Poincaré characteristic zero) in of constant mean curvature which meet planes and in constant contact angles and and bound, together with those planes, a…
Proves bounds on spanning two-forests and random cut sizes.
Alexander polynomial equals spanning tree count at t=1.
Study decomposes market portfolio into body and tail legs, revealing systematic differences.
We introduce the warping polynomial of an oriented knot diagram. In this paper, we characterize the warping polynomial, and define the span of a knot to be the minimal span of the warping polynomial for all diagrams of the knot. We show that the span of a knot is one if and only if it is non-trivial and alternating, an…
In this paper we present a hybrid active sampling strategy for pairwise preference aggregation, which aims at recovering the underlying rating of the test candidates from sparse and noisy pairwise labelling. Our method employs Bayesian optimization framework and Bradley-Terry model to construct the utility function, th…
Maximum a posteriori (MAP) inference over discrete Markov random fields is a fundamental task spanning a wide spectrum of real-world applications, which is known to be NP-hard for general graphs. In this paper, we propose a novel semidefinite relaxation formulation (referred to as SDR) to estimate the MAP assignment. A…
Tests factor models by decomposing market into body and tail legs, revealing inconsistent results.
New spanning tree model connects knot homology, s-invariant, and exotic discs.
We derive properties of the cdf of random variables defined as saddle-type points of real valued continuous stochastic processes. This facilitates the derivation of the first-order asymptotic properties of tests for stochastic spanning given some stochastic dominance relation. We define the concept of Markowitz stochas…
New algorithms find optimal policies without knowing MDP span.
Non-spanning identification of scheduled event risk in option pricing.
New invariants measure how far spanning surfaces are from being compressible.
Study Murasugi sum in 4D for knotted surfaces, defining arborescent surfaces.
Nonorientable spanning surfaces of periodic knots can have arbitrarily high first Betti number.
For a spanning tree T of a connected graph G and for a labelling φ: E(T) \rightarrow {+, -}, φis called an alternating sign on a spanning tree T of a graph G if for any cotree edge e \in E(G)-E(T), the unique path in T joining both end vertices of e has alternating signs. In the present note, we prove that any graph ha…