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 improves normalizing flows by combining MLE and sliced-Wasserstein distance for better data fidelity.
SGE-Kriging reduces high-dimensional surrogate modelling costs.
Gaussian mixture models (GMM) are powerful parametric tools with many applications in machine learning and computer vision. Expectation maximization (EM) is the most popular algorithm for estimating the GMM parameters. However, EM guarantees only convergence to a stationary point of the log-likelihood function, which c…
Elliptical slice sampling converges geometrically, providing reliable sampling for Bayesian learning.
We propose an exact slice sampler for Hierarchical Dirichlet process (HDP) and its associated mixture models (Teh et al., 2006). Although there are existing MCMC algorithms for sampling from the HDP, a slice sampler has been missing from the literature. Slice sampling is well-known for its desirable properties includin…
Motivated by the growing popularity of variants of the Wasserstein distance in statistics and machine learning, we study statistical inference for the Sliced Wasserstein distance--an easily computable variant of the Wasserstein distance. Specifically, we construct confidence intervals for the Sliced Wasserstein distanc…
Approximate Bayesian Computation (ABC) is a popular method for approximate inference in generative models with intractable but easy-to-sample likelihood. It constructs an approximate posterior distribution by finding parameters for which the simulated data are close to the observations in terms of summary statistics. T…
Bayesian approach for multivariate density regression of complex data.
We consider supervised dimension reduction problems, namely to identify a low dimensional projection of the predictors $\-x$ which can retain the statistical relationship between $\-x$ and the response variable . We follow the idea of the sliced inverse regression (SIR) and the sliced average variance estimation (SA…
Hierarchical beta process has found interesting applications in recent years. In this paper we present a modified hierarchical beta process prior with applications to hierarchical modeling of multiple data sources. The novel use of the prior over a hierarchical factor model allows factors to be shared across different …
Survey of SDR methods for high-dimensional regression and embedding.
Study on shake slice knots and proves 0-shake slice knots are slice.
Proves certain knots are slice without shaking.
Proves a special knot type is slice.
Bayesian DDR models complex multivariate distributions.
New findings on knots that are both topologically and rationally slice.
Regular sliceness implies once-stably decomposable sliceness in symplectizations.
We consider linear slices of the space of Kleinian once-punctured torus groups; a linear slice is obtained by fixing the value of the trace of one of the generators. The linear slice for trace 2 is called the Maskit slice. We will show that if traces converge `horocyclically' to 2 then associated linear slices converge…
The paper defines new knot genera and finds bounds for stabilization distances.
New knots found with tough, unsliceable discs.
The study examines obstructions to links being shake slice.
A new slicing method speeds up sliced Wasserstein estimation.
ABI bypasses likelihood intractability with nonparametric distribution matching.
A knot is said to be slice if it bounds a smooth properly embedded disk in the 4-ball. We demonstrate that the Conway knot, 11n34 in the Rolfsen tables, is not slice. This completes the classification of slice knots under 13 crossings, and gives the first example of a non-slice knot which is both topologically slice an…
Khovanov homology fails to differentiate certain slice disks.
Characterizes values of slice-torus invariants related to knot genus.
We show that if the connected sum of two knots with coprime Alexander polynomials is doubly slice, then the Ozsváth-Szabó correction terms as smooth double sliceness obstructions vanish for both knots. Recently, Jeffrey Meier gave smoothly slice knots that are topologically doubly slice, but not smoothly doubly slice. …
The study classifies slice pretzel links and Seifert fiber spaces.
Study slice-regular polynomial functions via twistor space group actions.
The paper shows some Montesinos links can't be doubly sliced strongly.
Study shows most knots in a family are not slice.
We use techniques of Freedman and Teichner to prove that, under certain circumstances, the multi-infection of a slice link is again slice (not necessarily smoothly slice). We provide a general context for proving links are slice that includes many of the previously known results.
Study on slicing knots in 4-manifolds, focusing on CP^2-slicing numbers.
New invariant measures doubly slice links, disproving previous bounds.
New knots show linear independence in slice concordance.
Study shows certain knots can't be sliced using 2-fold branched covers.
Bing doubling is an operation which produces a 2-component boundary link B(K) from a knot K. If K is slice, then B(K) is easily seen to be boundary slice. In this paper, we investigate whether the converse holds. Our main result is that if B(K) is boundary slice, then K is algebraically slice. We also show that the Ras…
In the present paper we extend the definition of slice-torus invariant to links. We prove a few properties of the newly-defined slice-torus link invariants: the behaviour under crossing change, a slice genus bound, an obstruction to strong sliceness, and a combinatorial bound. Furthermore, we provide an application to …
We use recently introduced Rasmussen invariant to find knots that are topologically locally-flatly slice but not smoothly slice. We note that this invariant can be used to give a combinatorial proof of the slice-Bennequin inequality. Finally, we compute the Rasmussen invariant for quasipositive knots and show that most…
Paper explores properties of slice-matching operators for measure transfer.
We prove that there are infinitely many -knots which are topologically slice, but not smoothly slice, which was a conjecture proposed by Béla András Rácz.
Minimum expected distance estimation (MEDE) algorithms have been widely used for probabilistic models with intractable likelihood functions and they have become increasingly popular due to their use in implicit generative modeling (e.g. Wasserstein generative adversarial networks, Wasserstein autoencoders). Emerging fr…
The paper calculates the slicing degree of knots using advanced homology theories.
We study the classification of slice disks of knots up to isotopy and diffeomorphism using an invariant in knot Floer homology. We compute the invariant of a slice disk obtained by deform-spinning, and show that it can be effectively used to distinguish non-isotopic slice disks with diffeomorphic complements. Given a s…
A new approach simplifies Sliced-Wasserstein distances to improve learning performance.
New lower bound for doubly slice genus using knot signatures.
New proof for some knots being topologically slice.
We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds. A focus is given to dimension 3 where slicings are normal surfaces. In the case of 2-neighborly 3-manifolds and quadrangulated slicings, a lower bound on the number of quadrilaterals of normal surfaces depending on the …