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

Trend · papers per month

4795142189 · Jun 202019922001200920172026
48 results for inversive distance

Inversive distance circle packing metric was introduced by P Bowers and K Stephenson \cite{BS} as a generalization of Thurston's circle packing metric \cite{T1}. They conjectured that the inversive distance circle packings are rigid. For nonnegative inversive distance, Guo \cite{Guo} proved the infinitesimal rigidity a…

2017-05-08abs ↗pdf ↗

Proves rigidity of circle packings in the plane, generalizing previous work.

problem Rigidity of infinite inversive distance circle packings in the plane.
method Maximal principle for generic weighted Delaunay inversive distance circle packings and ring lemma for inversive distance circle packings in hexagonal triangulated plane.
result Proves Bowers-Stephenson's conjecture for inversive distance circle packings.

Inversive distance circle packing on surfaces was introduced by Bowers-Stephenson as a generalization of Thurston's circle packing and conjectured to be rigid. The infinitesimal and global rigidity of circle packing with nonnegative inversive distance were proved by Guo and Luo respectively. The author proved the globa…

2019-04-25abs ↗pdf ↗

This work characterizes, analytically and numerically, two major effects of the quadratic Wasserstein (W2W_2) distance as the measure of data discrepancy in computational solutions of inverse problems. First, we show, in the infinite-dimensional setup, that the W2W_2 distance has a smoothing effect on the inversion pro…

2019-11-15abs ↗pdf ↗

The paper introduces a new Wasserstein distance for approximating posteriors in inverse problems.

problem Approximating posterior measures in inverse problems using conditional Wasserstein distances.
method Introduces a conditional Wasserstein distance with restricted couplings and derives its dual.
result Shows that conditional Wasserstein GANs can yield favorable properties for posterior sampling.

This paper investigates several global rigidity issues for polyhedral surfaces including inversive distance circle packings. Inversive distance circle packings are polyhedral surfaces introduced by P. Bowers and K. Stephenson as a generalization of Andreev-Thurston's circle packing. They conjectured that inversive dist…

2010-10-15abs ↗pdf ↗

In this paper, we generalize Chow-Luo's combinatorial Ricci flow to inversive distance circle packing setting. Although the solution to the generalized flow may develop singularities in finite time, we can always extend the solution so as it exists for all time and converges exponentially fast. Thus the generalized flo…

2016-04-28abs ↗pdf ↗

The paper proves the existence of a unique circle packing on hyperbolic surfaces.

problem Proving the existence of a unique inversive distance circle packing on hyperbolic polyhedral surfaces.
method Deforming the surface by discrete Ricci flow, doing surgery by edge flipping, and using a variational principle of a convex Ricci potential.
result There exists a unique inversive distance circle packing that is discrete conformal to the original one.

The subject of this article is the introduction of a new concept of well-posedness of Bayesian inverse problems. The conventional concept of (Lipschitz, Hellinger) well-posedness in [Stuart 2010, Acta Numerica 19, pp. 451-559] is difficult to verify in practice and may be inappropriate in some contexts. Our concept sim…

2019-02-26abs ↗pdf ↗

Given a triangulated surface MM, we use Ge-Xu's αα-flow \cite{Ge-Xu1} to deform any initial inversive distance circle packing metric to a metric with constant αα-curvature. More precisely, we prove that the inversive distance circle packing with constant αα-curvature is unique if αχ(M)0αχ(M)\leq 0, which generalize And…

2017-09-28abs ↗pdf ↗

The aim of the paper is to investigate the relation between inverse limit of branched manifolds and codimension zero laminations. We give necessary and sufficient conditions for such an inverse limit to be a lamination. We also show that codimension zero laminations are inverse limits of branched manifolds. The inverse…

2012-04-28abs ↗pdf ↗

The paper extends the Discrete Schwarz-Pick Lemma to circle packings with obtuse intersections and disjoint packings.

problem Proving the Discrete Schwarz-Pick Lemma for circle packings with various inversive distances.
method Using a variational principle for circle packings with inversive distances, the paper extends the lemma to a broader range of packings.
result The Discrete Schwarz-Pick Lemma holds for circle packings with inversive distances in (1,1](-1,1], provided an additional condition on triangle weights.

The MEM method uses data-driven priors for linear inverse problems, proving convergence and estimating differences.

problem Linear inverse problems with approximate priors.
method Maximum Entropy on the Mean (MEM) method with data-driven priors.
result Empirical mean convergence and estimates for prior differences based on epigraphical distance.

Reconstructing manifolds from partial distance and heat kernel data.

problem Reconstructing a manifold from noisy distance measurements and heat kernel data.
method Approximate reconstruction of a manifold from partial distance and heat kernel data with noise.
result A stable reconstruction of the manifold can be achieved from noisy heat kernel data.

IDA adapts to non-iid data in federated learning for medical imaging.

problem Statistical heterogeneity in federated learning data, especially in medical imaging.
method IDA (Inverse Distance Aggregation) is a novel adaptive weighting approach for clients based on meta-information.
result IDA outperforms Federated Averaging in handling unbalanced and non-iid data in federated learning.

Generative models improve inverse problems by providing tailored priors.

problem Analyzing the error in inverse problems solved with generative priors.
method Quantitative error bounds for minimum Wasserstein-2 generative models.
result The error in the posterior due to the generative prior is bounded by the prior's error in Wasserstein-1 distance.

Unified framework recovers exact input from SOM activation patterns.

problem Generating high-dimensional data from Self-Organizing Maps (SOMs).
method Inverting SOM activation patterns to recover input, using linear system and Tikhonov regularization.
result MUSIC framework produces coherent semantic transitions and maintains high classifier confidence.

Study improves estimation of functions from noisy data using convex penalties.

problem Estimating functions from noisy point evaluations of linear operators.
method Tikhonov regularization with convex and pp-homogeneous penalty functionals.
result Derives concentration rates for regularized solutions in symmetric Bregman distance.

New method finds metrics on surfaces with prescribed curvatures using circle packings and surgery.

problem Finding piecewise Euclidean metrics on surfaces with prescribed combinatorial curvatures.
method Combinatorial curvature flows with surgery for inversive distance circle packings.
result Longtime existence and global convergence of combinatorial curvature flows with surgery.

We present constructions inspired by the Ma-Schlenker example of~\cite{Ma:2012hl} that show the non-rigidity of spherical inversive distance circle packings. In contrast to the use in~\cite{Ma:2012hl} of an infinitesimally flexible Euclidean polyhedron, embeddings in de Sitter space, and Pogorelov maps, our elementary …

2016-07-02abs ↗pdf ↗

This paper reviews SDR methods for multivariate response regression.

problem Handling sufficient dimension reduction for multivariate response regression.
method Characterizes SDR estimators as inverse or forward regression methods.
result Pooled marginal, projective resampling, distance-based, ordinary least squares, partial least squares, and semiparametric SDR estimators are discussed.

Hierarchical clustering uses OWA operators to generalize linkage methods and avoid dendrogram inversions.

problem Avoiding unaesthetic inversions in hierarchical clustering dendrograms.
method OWA-based linkages combined with the Lance-Williams formula and conditions on weight generators.
result Conditions for weight generators to produce dendrograms without inversions.

Let (N,g)(N,g) be a Riemannian manifold with the distance function d(x,y)d(x,y) and an open subset MNM\subset N. For xMx\in M we denote by DxD_x the distance difference function Dx:F×FRD_x:F\times F\to \mathbb R, given by Dx(z1,z2)=d(x,z1)d(x,z2)D_x(z_1,z_2)=d(x,z_1)-d(x,z_2), z1,z2F=NMz_1,z_2\in F=N\setminus M. We consider the inverse problem of determining …

2015-10-21abs ↗pdf ↗

Proves existence of unique circle packings on polyhedral surfaces.

problem Existence of unique circle packings on polyhedral surfaces with specified discrete curvature.
method Constructs diffeomorphism between fiber bundles, uses discrete Ricci flow and edge flipping.
result Proves existence of unique inversive distance circle packings.

The paper shows how to use hyperplanes and hyperballs interchangeably using inversive geometry.

problem Tackles the interchangeability of hyperplanes and hyperballs in discriminative boundaries.
method Applies inversive geometry to transform Euclidean data into spherical data and back, providing explicit formulae.
result Shows a duality between hyperspherical caps and hyperballs, providing explicit formulae to map between them.

We consider an enlarged dimension reduction space in functional inverse regression. Our operator and functional analysis based approach facilitates a compact and rigorous formulation of the functional inverse regression problem. It also enables us to expand the possible space where the dimension reduction functions bel…

2015-03-12abs ↗pdf ↗

Proof of existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.

problem Existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.
method Construct an isotopic map instead of edge-flipping algorithm, generalizing Dyer et al's method.
result Strict proof of existence and uniqueness of weighted Voronoi-Delaunay on polyhedral surfaces.

A method detects vehicles far from tunnel CCTV using AI.

problem Tunnel CCTV's height limits detection of far-away vehicles.
method Object detection algorithm with inverse perspective transform.
result Deep learning model trained on warped images detects vehicles more accurately.

We study surfaces with decorations and prove uniformization in non-Euclidean geometries.

problem Discrete conformal equivalence in non-Euclidean geometries.
method Variational principle and continuous deformation.
result One master theory of discrete conformal equivalence across different geometries.

Researchers reconstruct simple Riemannian manifolds from boundary wave arrival times.

problem Reconstructing Riemannian manifolds from unknown interior sources and arrival times.
method Discrete metric approximation using labeled Gromov--Hausdorff distance.
result Finite-time approximations converge to the true Riemannian manifold.

A new framework enhances IDW models for complex industrial datasets.

problem Low performance of IDW models in complex industrial datasets.
method Deep reinforcement learning network to enhance IDW models and learn hyperparameters.
result The proposed framework achieves differential spatial prediction and is more accurate than current IDW models.

The paper analyzes Tikhonov regularization in Hilbert scales for statistical inverse problems.

problem Statistical inverse problems in Hilbert scales with general noise.
method Tikhonov regularization scheme with conditional stability estimates and high probability error bounds.
result Explicit rates of convergence for oversmoothing and regular cases over defined regularity classes.

Paper tackles estimating initial conditions of spatio-temporal processes from sparse data.

problem Estimating initial conditions of spatio-temporal advection-diffusion processes from sparse data.
method Regularized convex optimization problem with Alternating Direction Method of Multipliers.
result Efficient solutions for non-uniform and shifted uniform sampling schemes.