Research
On-device research index

arXiv research

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.

168,657 papers · 148 categories

Trend · papers per month

164327491654 · Jun 202019922001200920172026
48 results for slice functions

Study slice-regular polynomial functions via twistor space group actions.

problem Characterize slice-regular functions and their polynomial subclasses.
method Employ the twistor construction and group actions of PGL(2,H)\mathrm{PGL}(2,\mathbb{H}).
result Characterize slice-regular functions with planar twistor lifts and normal classes of polynomials.

Research examines octonionic slice regular functions and their automorphisms and invariants.

problem Analyzing slice regular functions in the octonionic algebra.
method Investigates automorphisms and invariants of octonionic slice regular functions.
result Characterizes the automorphisms and invariants of octonionic slice regular functions.

We propose fast approximations for the generalized sliced-Wasserstein distance.

problem Efficient approximation of the generalized sliced-Wasserstein distance in high dimensions.
method Deterministic approximations using random projections and concentration of measure results.
result One-dimensional projections of high-dimensional random vectors are approximately Gaussian.

Given a slice regular function f:ΩHHf:Ω\subset\mathbb{H}\to \mathbb{H}, with ΩRΩ\cap\mathbb{R}\neq \emptyset, it is possible to lift it to a surface in the twistor space CP3\mathbb{CP}^{3} of S4H{}\mathbb{S}^4\simeq \mathbb{H}\cup \{\infty\} (see~\cite{gensalsto}). In this paper we show that the same result is true if one rem…

2016-05-27abs ↗pdf ↗

A quaternionic version of Picard's theorem limits how many values a slice regular function can avoid.

problem How many values can a non-constant slice regular function of a quaternionic variable avoid?
method Investigates slice regular functions of quaternionic variables, extending the classical Picard theorem.
result A non-constant slice regular function of a quaternionic variable can avoid at most one value, similar to the classical Picard theorem.

Study knot invariants to answer questions about slice genus and clasp numbers.

problem Whether the difference between the four-dimensional clasp number and the slice genus can be arbitrarily large.
method Equivariant singular instanton theory and Chern--Simons functional.
result Answers a conjecture by Livingston about slicing numbers and provides a lower bound for the unoriented slice genus.

A knot in the three-sphere is doubly slice if it is the cross-section of an unknotted two-sphere in the four-sphere. For low-crossing knots, the most complete work to date gives a classification of doubly slice knots through 9 crossings. We extend that work through 12 crossings, resolving all but four cases among the 2…

2015-04-13abs ↗pdf ↗

We introduce the notion of ascent sliceness of virtual knots. A representative of a virtual knot is an embedding S1Σg×I S^1 \hookrightarrow Σ_{g} \times I , for Σg Σ_g a closed connected oriented surface of genus g g ; the virtual knot represented is slice if there exists a pair consisting of a disc D D and an oriented…

2018-02-05abs ↗pdf ↗

A new method for comparing image probability measures using convolution operators.

problem Efficiently comparing images using conventional sliced Wasserstein methods.
method Proposed convolution sliced Wasserstein (CSW) methods with stride, dilation, and non-linear activation.
result CSW demonstrates favorable performance over conventional sliced Wasserstein in image comparison and deep generative modeling.

New method estimates SW distance using CDFs for scalable data parallelism.

problem Estimating SW distance efficiently for large datasets.
method Estimators based on CDFs of projected measures, avoiding sorting.
result Efficient estimation for large datasets and federated learning.

In this paper, we prove the existence of maximal slices in anti-de Sitter spaces (ADS spaces) with small boundary data at spatial infinity. The main arguments is implicit function theorem. We also get a necessary and sufficient condition for boundary behavior of totally geodesic slice in ADS space. Moreover, we show th…

2006-09-11abs ↗pdf ↗

We establish a general slice theorem for the action of a locally convex Lie group on a locally convex manifold, which generalizes the classical slice theorem of Palais to infinite dimensions. We discuss two important settings under which the assumptions of this theorem are fulfilled. First, using Glöckner's inverse fun…

2018-12-11abs ↗pdf ↗

Efficiently predicts optimal transport plans using sliced potentials.

problem Predicting optimal transport plans across multiple measure pairs efficiently.
method Regression-based and objective-based amortization strategies using sliced optimal transport potentials.
result Efficient and accurate prediction of optimal transport plans for various tasks.

Extends SW and GSW to compare heterogeneous joint distributions.

problem Limited applicability of SW and GSW to heterogeneous joint distributions.
method Introduces HHRT and PGRT to extend SW and GSW.
result H2SW distance for heterogeneous joint distributions.

Elliptical slice sampling converges geometrically, providing reliable sampling for Bayesian learning.

problem Sampling from posterior distributions in Bayesian learning.
method Elliptical slice sampling, geometric ergodicity.
result Elliptical slice sampling yields geometric convergence guarantees under weak regularity assumptions.

Proposes an energy-based sliced Wasserstein distance for improved probability measure comparison.

problem Inefficiencies and limitations in existing sliced Wasserstein distance approaches.
method Introduces an energy-based slicing distribution for better performance and stability.
result Demonstrates superior performance of the EBSW distance in various applications.

Develops slicing method to prove rigidity of scalar curvature on manifolds with boundary.

problem Understanding positive scalar curvature metrics on manifolds with boundary.
method Minimal slicing via capillary hypersurfaces to prove rigidity statements.
result Proves rigidity statement in dimension 4 for specific geometric conditions.

In this paper we develop methods to extend the minimal hypersurface approach to positive scalar curvature problems to all dimensions. This includes a proof of the positive mass theorem in all dimensions without a spin assumption. It also includes statements about the structure of compact manifolds of positive scalar cu…

2017-04-18abs ↗pdf ↗

SGE-Kriging reduces high-dimensional surrogate modelling costs.

problem High-dimensional function approximation for expensive models.
method Splitting training data into slices, using sliced likelihood function, and learning hyper-parameters from sensitivity indices.
result SGE-Kriging achieves comparable accuracy to standard GE-Kriging but with lower training costs.

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…

2013-03-29abs ↗pdf ↗

Researchers find Busemann functions in Wasserstein space, enabling efficient projections and distances.

problem Defining Busemann functions in Wasserstein space for efficient data projections and distances.
method Investigated existence and computation of Busemann functions in Wasserstein space, establishing closed-form expressions for specific cases.
result Explicit projection schemes for probability distributions on \(\mathbb{R}\) enable novel Sliced-Wasserstein distances over Gaussian mixtures and labeled datasets.

This paper proposes a new method to solve functional minimization problems in probability distributions using sliced-Wasserstein gradient flows.

problem Solving functional minimization problems in high-dimensional probability distributions is computationally challenging.
method The paper introduces a new approach using sliced-Wasserstein gradient flows to approximate the Jordan-Kinderlehrer-Otto (JKO) scheme, parameterizing densities with generative models.
result The proposed method is more flexible and computationally tractable compared to existing methods like JKO-ICNN.

We prove a Slice Theorem around closed leaves in a singular Riemannian foliation, and we use it to study the CC^\infty-algebra of smooth basic functions, generalizing to the inhomogeneous setting a number of results by G.~Schwarz. In particular, in the infinitesimal case we show that this algebra is generated by a fin…

2015-11-19abs ↗pdf ↗

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…

2017-11-15abs ↗pdf ↗

The study examines obstructions to links being shake slice.

problem Understanding when links are not shake slice.
method Examined shake concordance and zero surgery manifolds, and provided obstructions based on Arf invariants and algebraic sliceness.
result Links that are shake concordant have homology cobordant zero surgery manifolds, and provided specific obstructions to shake sliceness.

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…

2018-08-08abs ↗pdf ↗