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,742 papers · 148 categories

Trend · papers per month

138277415553 · Jun 202019922001200920172026
48 results for radially contoured distributions

Paper proposes a new Wasserstein distance for mixtures of radially contoured distributions.

problem Generalization of Wasserstein distance to non-elliptically contoured distributions.
method Relaxed formulation for mixtures of radially contoured distributions without marginal consistency.
result The new distance yields more stable error and better color distribution in image transfer tasks.

Improved image learning using elliptically contoured tensor-variate distributions.

problem Inadequate statistical analysis for tensor-valued data, especially with heavier or lighter tails.
method Developed a family of elliptically contoured tensor-variate distributions and derived their properties and procedures for estimation.
result Tensor-variate classification rules and tensor-on-tensor regression better predict and characterize data than TVN-based methods.

New algorithm radVI improves variational inference by optimizing radial profiles.

problem Gaussian approximations often fail to capture the radial profile of complex distributions.
method Optimizes over radial profiles in variational inference, providing theoretical guarantees.
result Theoretical convergence guarantees for radVI, improving over existing VI methods.

Describing shapes by suitable measures in object segmentation, as proposed in [24], allows to combine the advantages of the representations as parametrized contours and indicator functions. The pseudo-Riemannian structure of optimal transport can be used to model shapes in ways similar as with contours, while the Kanto…

2013-09-09abs ↗pdf ↗

In this paper we consider planar sections and visual contours of co-dimension one affine immersions. The main theorem says that the third order Taylor expansion of the difference between the visual contour and planar section functions is exactly the cubic form. We also consider parameterizations on two dimensional affi…

2010-03-30abs ↗pdf ↗

A new algorithm flattens multi-modal distributions for better deep learning.

problem Bayesian learning in big data with multi-modal distributions.
method Contour Stochastic Gradient Langevin Dynamics (CSGLD) algorithm.
result The CSGLD algorithm avoids local traps in deep neural networks.

Machine learning models have been shown vulnerable to adversarial attacks launched by adversarial examples which are carefully crafted by attacker to defeat classifiers. Deep learning models cannot escape the attack either. Most of adversarial attack methods are focused on success rate or perturbations size, while we a…

2018-12-01abs ↗pdf ↗

Persistent homology analysis provides means to capture the connectivity structure of data sets in various dimensions. On the mathematical level, by defining a metric between the objects that persistence attaches to data sets, we can stabilize invariants characterizing these objects. We outline how so called contour fun…

2019-06-11abs ↗pdf ↗

New Riemannian radial distributions help estimate parameters on symmetric spaces.

problem Challenges in manifold data analysis due to lack of parametric distributions.
method Introduced Riemannian radial distributions on symmetric spaces, utilized symmetry, and developed M-estimators.
result MLE achieves root-n convergence rate up to logarithmic terms, demonstrating optimality.

Wide class of elliptically contoured distributions is a popular model of stock returns distribution. However the important question of adequacy of the model is open. There are some results which reject and approve such model. Such results are obtained by testing some properties of elliptical model for each pair of stoc…

2019-07-24abs ↗pdf ↗

The paper studies curves in surfaces using flow-spines and apparent contours.

problem Understanding curves in arbitrary surfaces using flow-spines and apparent contours.
method By considering generic curves and their apparent contours relative to a traversing flow, the paper reconstructs curves and allows them to vary up to homotopy.
result A finite set of local moves on decorated graphs allows for the reconstruction and variation of curves within a fixed generic flow.

The contour map of estimation error of Expected Shortfall (ES) is constructed. It allows one to quantitatively determine the sample size (the length of the time series) required by the optimization under ES of large institutional portfolios for a given size of the portfolio, at a given confidence level and a given esti…

2015-02-22abs ↗pdf ↗

We present a new implementation of anisotropic mean curvature flow for contour recognition. Our procedure couples the mean curvature flow of planar closed smooth curves, with an external field from a potential of point-wise charges. This coupling constrains the motion when the curve matches a picture placed as backgrou…

2018-03-10abs ↗pdf ↗

The paper finds surfaces closest to being flat that span a given contour.

problem Finding surfaces in R3\mathbb{R}^3 that are as flat as possible while spanning a given contour.
method The approach involves minimizing the total Gaussian curvature squared and solving a system of PDEs.
result The optimal surface is shown to be controlled by a biharmonic equation with specific boundary conditions.

Completeness of the eigenfunctions of a quantum mechanical system is crucial for its probability interpretation. By using the method of contour integral we give properly normalized eigenfunctions for both discrete and continuum spectrum of the Morse potential, and explicitly prove the completeness relation. As an appli…

2010-10-19abs ↗pdf ↗

Proposes a new network to improve nuclei segmentation in histopathology images.

problem Challenges in separating overlapped nuclei in histopathology images.
method Introduces a bending loss regularized network to minimize contour points with large curvatures.
result Outperforms six state-of-the-art approaches on five quantitative metrics.

SympFormer accelerates attention blocks using inertial dynamics on density spaces.

problem Improving the efficiency of self-attention blocks in Transformers.
method Introduced accelerated attention blocks derived from inertial Nesterov dynamics on density spaces.
result Accelerated attention blocks converge faster than classical blocks while preserving oracle calls.

Gradient-based training and pruning for radial basis function networks in materials physics.

problem Interpretable and robust machine learning for materials physics problems.
method Gradient-based training and pruning of radial basis function networks with closed-form optimization criteria.
result Pruned models provide compact and interpretable versions of larger models, offering insights into atom-level migration processes.

Method learns radial basis function distributions from samples.

problem Learning radial basis function distributions from training samples.
method Projected particle Langevin optimization method with distributionally robust optimization.
result Empirical measure of Langevin particles converges to a reflected Itô diffusion-drift process.

We derive a new radial link for binary classification under shared elliptical distributions.

problem Binary classification under shared-generator elliptical class-conditional distributions.
method We derive the Bayes radial-link family from the within-class radius law and estimate it by a finite fractional-power stochastic-polynomial projection.
result The derived link is asymptotically Bayes-optimal and significantly better than QDA on various benchmarks.

Study examines maximal domains of radial harmonic functions across different curvature types.

problem Understanding maximal domains of radial harmonic functions in various curvature settings.
method Analysis of harmonic spaces with positive, zero, and negative curvature.
result Characterization of maximal domains for radial harmonic functions in different curvature contexts.

Convexity properties are preserved under radial transformations in hyperbolic and spherical geometries.

problem Preserving convexity in hyperbolic and spherical geometries under radial transformations.
method Used Poincaré disk model for hyperbolic geometry and stereographic projection for spherical geometry to prove preservation of convexity under radial expansion and contraction.
result Radial expansion and contraction preserve hyperbolic and spherical convexity, respectively.

New methods for ZZ-transform inversion and Wiener-Hopf factorization.

problem Efficient numerical inversion of ZZ-transforms and factorization of functions.
method Sinh-deformations of contours, variable changes, and simplified trapezoid rule.
result High precision and speed in evaluating moments and constructing filters.

Bayesian approach approximates probability functions of Gaussian mixtures.

problem Approximating probability functions of non-spherical Gaussian mixtures.
method Bayesian decomposition, spherical radial decomposition, random sampling.
result Established differentiability and integral representation of gradient for probability functions.

Functor connects symplectic and contact structures via cutting and blowups.

problem Establishing a functorial relationship between symplectic and contact structures.
method Developed a cutting procedure and its inverse for manifolds with boundary and equivariant transverse maps, then applied it to non-symplectic and non-contact structures.
result Obtained an inverse functor for equivariant radial-squared blowups.

New distributions allow greedy arm selection in sparse bandit problems.

problem Sparse contextual bandit problem with sparse parameters and feature distributions.
method Introduced new distribution classes and demonstrated that mixtures of these distributions are also greedy-applicable.
result Greedy algorithm applicable to a wider range of arm feature distributions, including those with origin-asymmetric support.

The paper tightens bounds on distances between Reeb graphs.

problem Certifying quasi-universality of distances between Reeb graphs.
method Establishes tight bi-Lipschitz bounds for various distances.
result Proves strict universality of the functional contortion distance for contour trees and coincides with interleaving distance for merge trees.

Study complete gradient Ricci solitons with zero radial Weyl curvature.

problem Characterize complete gradient Ricci solitons with specific curvature properties.
method Classify complete gradient Ricci solitons with zero radial Weyl curvature for dimensions n4n \geq 4.
result Completely classified complete gradient Ricci solitons with zero radial Weyl curvature.