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.
The paper triangulates Heisenberg groups with horizontal and straight simplexes.
We present two families of knots which have straight number higher than crossing number. In the case of the second family, we have computed the straight number explicitly. We also give a general theorem about alternating knots that states adding an even number of crossings to a twist region will not change whether the …
Jablan and Radović originally defined two invariants called the Meander number and OGC number of knots for certain classes of knots. We generalize these definitions to all knots and name the straight number and contained straight number of a knot, respectively, and prove they are well defined. We answer two questions a…
This paper improves the efficiency of generative models by optimizing the straightness of Rectified Flow.
Study classifies submanifolds in probability simplex.
The study characterizes straight-line flows in dynamic measure transport.
Study optimal transport on simplex boundary, proving transport map and potential regularity.
A new method learns straight trajectories in one step for optimal flow matching.
Study on straight-line flows for generative modeling with theoretical obstructions.
We generalise a result of Garofalo and Pauls: a horizontally minimal smooth surface embedded in the Heisenberg group is locally a (straight) ruled surface, i.e. it consists of straight lines tangent to a horizontal vector field along a smooth curve. We show additionally that any horizontally minimal surface is locally …
The Bezier simplex fitting is a novel data modeling technique which exploits geometric structures of data to approximate the Pareto front of multi-objective optimization problems. There are two fitting methods based on different sampling strategies. The inductive skeleton fitting employs a stratified subsampling from e…
PRISM identifies simplex vertices from noisy data.
A new optimization method for probability simplex problems.
We establish the second part of Milnor's conjecture on the volume of simplexes in hyperbolic and spherical spaces. A characterization of the closure of the space of the angle Gram matrices of simplexes is also obtained.
Correct method found for drawing precise envelope of straight lines.
A hyperbolic 3-simplex reflection group is a Coxeter group arising as a lattice in the isometry group of hyperbolic 3-space, with fundamental domain a geodesic simplex (possibly with some ideal vertices). The classification of these groups is known, and there are exactly 9 cocompact examples, and 23 non-cocompact examp…
We introduce the non-pure versions of simplicial balls and spheres with minimum number of vertices. These are a special type of non-homogeneous balls and spheres (NH-balls and NH-spheres) satisfying a minimality condition on the number of maximal simplices. The main result is that minimal NH-balls and NH-spheres are pr…
In 1973, J. Cheeger and J. Simons raised the following question that still remains open and is known as the Rational Simplex Problem: Given a geodesic simplex in the spherical 3-space so that all of its interior dihedral angles are rational multiples of , is it true that its volume is a rational multiple of the volu…
Study of straight-line flows on a unique infinite surface.
We study Fredholm properties and index formulas for Dirac operators over complete Riemannian manifolds with straight ends. An important class of examples of such manifolds are complete Riemannian manifolds with pinched negative sectional curvature and finite volume.
A method for diffusion on probability simplex for generative models.
Concrete distribution properties examined on simplex.
Smooth compactness theorem for elasticae, except straight segments.
A new method for SSMF improves upon existing algorithms.
A faster Wasserstein k-means algorithm for histogram data reduces computation and maintains clustering quality.
Proposes an accuracy-preserving calibration method for DNNs.
The limit of energies of a sequence of harmonic maps as their annular domains approach the boundary of moduli space depends upon the boundary point approached. The infinite energy case is associated with limits of images containing ruled surfaces. The finite energy case yields a limit of images, under a suitable topolo…
To make deep neural networks feasible in resource-constrained environments (such as mobile devices), it is beneficial to quantize models by using low-precision weights. One common technique for quantizing neural networks is the straight-through gradient method, which enables back-propagation through the quantization ma…
On the probability simplex, we can consider the standard information geometric structure with the e- and m-affine connections mutually dual with respect to the Fisher metric. The geometry naturally defines submanifolds simultaneously autoparallel for the both affine connections, which we call {\em doubly autoparallel s…
Given a convex body, the -Busemann Random Simplex Inequality is closely related to the centroid body for and , and only in these cases it can be proved using the -Busemann-Petty centroid inequality. We define a convex body and prove an isoperimetric inequality for …
Reintroduces straight-through estimators for binary neural networks.
The paper is devoted to modeling optimal exercise strategies of the behavior of investors and issuers working with convertible bonds. This implies solution of the problems of stock price modeling, payoff computation and min-max optimization. Stock prices (underlying asset) were modeled under the assumption of the geome…
We show an efficient algorithm for the following problem: Given uniformly random points from an arbitrary n-dimensional simplex, estimate the simplex. The size of the sample and the number of arithmetic operations of our algorithm are polynomial in n. This answers a question of Frieze, Jerrum and Kannan [FJK]. Our resu…
Algorithm learns latent simplex from perturbed points in input-sparsity time.
New geometric structures defined on SPD matrices for better understanding.
We provide an elementary proof of a simple, efficient algorithm for computing the Euclidean projection of a point onto the probability simplex. We also show an application in Laplacian K-modes clustering.
New framework estimates staged tree models using hierarchical clustering on the probability simplex.
CAST predicts distribution-valued time series by stabilizing and transporting simplex-supported successors.
Timelike geometry of spherical simplices is shown to be isometric to vector spaces.
In this paper, we investigate the ruled surfaces generated by a straight line according to rotation minimizing frame (RMF). Using this frame of a straight line, we obtained the necessary and sufficient conditions when the ruled surface is developable. Also, we give some new results and theorems related to be the asympt…
The Dirichlet Laplacian in curved tubes of arbitrary cross-section rotating with respect to the Tang frame along infinite curves in Euclidean spaces of arbitrary dimension is investigated. If the reference curve is not straight and its curvatures vanish at infinity, we prove that the essential spectrum as a set coincid…
Paper solves graph matching problem using convex relaxation to the simplex.
In the present paper we calculate the Gromov-Hausdorff distance between an arbitrary simplex (a metric space all whose non-zero distances are the same) and a finite metric space whose non-zero distances take two distinct values (so-called -distance spaces). As a corollary, a complete solution to generalized Borsuk p…
Paper improves Gumbel-Softmax estimator variance reduction.
New method describes entanglement of straight lines in 3D space.
Proves cup product homomorphism for bounded cohomology on negatively curved manifolds.
We present two identities (contiguity relation and variation formula) concerning the volume of a spherically faced simplex in the Euclidean space. These identities are described in terms of Cayley-Menger determinants and their differentials involved with hypersphere arrangements. They are derived as a limit of fundamen…
Investigates VaR behavior for sums of one-sided random variables, showing impossibilities and conditions for super-additivity.