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.
Divide data into subsets, analyze each, and recombine results for likelihood function computation.
SwISS improves scalability of Bayesian inference for large datasets.
As the amount and complexity of genetic information increases it is necessary that we explore some efficient ways of handling these data. This study takes the "divide and conquer" approach for analyzing high dimensional genomic data. Our aims include reducing the dimensionality of the problem that has to be dealt one a…
Researchers explore non-coherent banding in site-specific recombination.
Site-specific recombination on supercoiled circular DNA molecules can yield a variety of knots and catenanes. Twist knots are some of the most common conformations of these products and they can act as substrates for further rounds of site-specific recombination. They are also one of the simplest families of knots and …
A new evolutionary algorithm improves k-means clustering by recombining the entire population.
A New Trinomial Recombination Tree Algorithm and Its Applications
Paper develops a high-order recombination algorithm for financial modeling.
The theme in this paper is the recombining binomial tree to price American put option when the underlying stock follows constant elasticity of variance(CEV) process. Recombining nodes of binomial tree are decided from finite difference scheme to emulate CEV process and the tree has a linear complexity. Also it is deriv…
We develop a topological model of site-specific recombination that applies to substrates which are the connected sum of two torus links of the form . Then we use our model to prove that all knots and links that can be produced by site-specific recombination on such substrates are contained in one of two…
We categorise coherent band (aka nullification) pathways between knots and 2-component links. Additionally, we characterise the minimal coherent band pathways (with intermediates) between any two knots or 2-component links with small crossing number. We demonstrate these band surgeries for knots and links with small cr…
New RL approach builds short ancestral recombination graphs.
Paper develops a new method for game options in local volatility models.
We extend the tangle model, originally developed by Ernst and Sumners, to include composite knots. We show that, for any prime tangle, there are no rational tangle attachments of distance greater than one that first yield a 4-plat and then a connected sum of 4-plats. This is done by building on results on exceptional D…
Market portfolio decomposed into body and tail legs
Deep learning improves evolutionary algorithms' adaptability.
Study decomposes market portfolio into body and tail legs, revealing systematic differences.
Study of Betti numbers in prodsimplicial complexes for directed graphs, focusing on DNA recombination.
Method recombines image content and style from different images.
The protein recombinase can change the knot type of circular DNA. The action of a recombinase converting one knot into another knot is normally mathematically modeled by band surgery. Band surgeries on a 2-bridge knot N((4mn-1)/(2m)) yielding a (2,2k)-torus link are characterized. We apply this and other rational tangl…
A new tree model, GRST, improves option pricing without log-normality assumptions.
A new data-level recombination strategy improves RGB-D salient object detection.
Parallelized Bayesian quadrature improves sample efficiency and inference.
Paper presents an efficient approach for integrating LSTM language models in LVCSR systems.
New method combines MCMC subposteriors using Gaussian processes.
Improved kernel quadrature with convex weights using subsampling.
We give a short topological proof for Rubermans Theorem about mutation and volume, using the Maskit combination theorem and the homology of the linear group.
A general method to construct recombinant tree approximations for stochastic volatility models is developed and applied to the Heston model for stock price dynamics. In this application, the resulting approximation is a four tuple Markov process. The first two components are related to the stock and volatility processe…
We develop a model characterizing all possible knots and links arising from recombination starting with a twist knot substrate, extending previous work of Buck and Flapan. We show that all knot or link products fall into three well-understood families of knots and links, and prove that given a positive integer , the…
SCAN learns hierarchical visual concepts from unsupervised data.
We develop a topological model of knots and links arising from a single (or multiple processive) round(s) of recombination starting with an unknot, unlink, or (2,m)-torus knot or link substrate. We show that all knotted or linked products fall into a single family, and prove that the size of this family grows linearly …
In plant and animal breeding studies a distinction is made between the genetic value (additive + epistatic genetic effects) and the breeding value (additive genetic effects) of an individual since it is expected that some of the epistatic genetic effects will be lost due to recombination. In this paper, we argue that t…
MCP learns reusable skills for complex tasks by combining simple ones.
Method constructs shadowed polyhedra from divides, linking them to Lefschetz fibrations.
New divide with gleams method simplifies symmetric link representation.
The paper characterizes links in 3D from divides with cusps.
This paper reveals hidden hyperbolic structures in divide links.
Starting from a divide, i.e. a generic immersion of finitely many copies of the interval [0,1] in the disk, we construct a classical link in the 3-sphere. We prove that the link's complement fibers over the circle, if the divide is connected. Moreover, we compute the monodromy diffeomorphism from the combinatorics of t…
New method to encode Weinstein 4-manifolds using multisections with divides.
Construct divide knots with specific genus properties.
I present a formula for the Casson invariant of knots associated with divides. The formula is written in terms of Arnold's invariants of pieces of the divide. Various corollaries are discussed.
This paper gives new and elementary combinatorial topological proofs of the classification of unoriented and oriented rational knots and links. These proofs are based on the known classification of alternating knots through flyping, and the calculus of continued fractions. We characterize the class of strongly invertib…
Divides help construct fibered links from singularities.
New training method for ReLU networks achieves optimal weight size for memorization.
Divide-and-conquer method splits large data sets for efficient analysis.
In the present paper we determine the Thurston-Bennequin invariant of graph divide links, which include all closed positive braids, all divide links and certain negative twist knots. As a corollary of this and a result of P. Lisca and A.I. Stipsicz, we prove that the 3-manifold obtained from the 3-sphere by Dehn surger…
The study describes handle decompositions and Kirby diagrams for line arrangements.
This paper analyzes divide-and-conquer estimators for functional linear regression without assuming target function in the RKHS.