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

57114171228 · Jun 202019922001200920172026
48 results for divergence map

New method uses SoS densities and α-divergences for efficient sequential transport maps.

problem Efficiently generating samples from approximated densities.
method Sequential transport maps using Sum-of-Squares (SoS) densities and α-divergences.
result Convex optimization problems with efficient semidefinite programming solutions.

In this paper we investigate the higher dimensional divergence functions of mapping class groups of surfaces and of CAT(0)--groups. We show that, for mapping class groups of surfaces, these functions exhibit phase transitions at the rank (as measured by thrice the genus plus the number of punctures minus 3). We also pr…

2013-05-14abs ↗pdf ↗

Study measures complexity of surfaces using a new graph to prove group properties.

problem Understanding the complexity and structure of mapping class groups.
method Introduces a non-peripheral curve graph and uses it to analyze the structure of mapping class groups.
result Proves properties of the mapping class group based on the complexity measure.

This work improves understanding of symmetrizing Bregman divergences on positive definite matrices.

problem Understanding which mean to use for symmetrizing Bregman divergences on positive definite matrices.
method Axiomatic definition of mean functionals and variational principles over the cone of positive definite matrices.
result The arithmetic mean is canonical for forward symmetrization, and the arithmetic, log-Euclidean, and harmonic means for reverse symmetrization.

Global solutions found for a wave-Klein-Gordon system with strong couplings in divergence form.

problem Global well-posedness of a wave-Klein-Gordon system with strong couplings in divergence form.
method Constructed an auxiliary system with shifted primitives to handle the strong couplings.
result Established global well-posedness theorem for the wave-Klein-Gordon system.

Privacy amplification improved through contraction coefficients and EγE_γ-divergence.

problem Improving privacy guarantees in iterative algorithms.
method Using contraction coefficients derived from EγE_γ-divergence to determine differential privacy parameters.
result Tighter bounds on differential privacy parameters of iterative algorithms.

The paper explores geometry of probability measures and barycenter maps.

problem Understanding the space of probability measures and their barycenter.
method Information geometry, Fisher metric, dualistic structures, divergences, geodesics.
result Recent developments in the geometry of probability measures and barycenter.

We describe work on solutions of certain non-divergence type and therefore non-variational elliptic and parabolic systems on manifolds. These systems include Hermitian and affine harmonics which should become useful tools for studying Hermitian and affine manifolds, resp. A key point is that in addition to the standard…

2010-11-14abs ↗pdf ↗

Rank-statistic method approximates ff-divergences without density-ratio estimation.

problem Approximating ff-divergences without explicit density-ratio estimation.
method Mapping distribution rank histograms to discrete ff-divergence and averaging over random projections.
result The rank-statistic estimator is a lower bound of the true ff-divergence and converges under mild conditions.

We succeed in writing 2-dimensional conformally invariant non-linear elliptic PDE (harmonic map equation, prescribed mean curvature equations...etc) in divergence form. This divergence free quantities generalize to target manifolds without symmetries the well known conservation laws for harmonic maps into homogeneous s…

2006-03-15abs ↗pdf ↗

This paper introduces ff-DPO, a generalized approach to Direct Preference Optimization using diverse divergence constraints.

problem Aligning large language models with human preferences while mitigating safety risks.
method Incorporates diverse divergence constraints to simplify the relationship between reward and optimal policy, eliminating the need for estimating the normalizing constant.
result Optimizes LLMs to align with human preferences more efficiently and under a broader set of divergence constraints.

Gradient descent dynamics in quadratic regression models are analyzed, revealing five phases: monotonic, catapult, periodic, chaotic, and divergent.

problem Analyzing the dynamics of gradient descent in quadratic regression models.
method Fine-grained bifurcation analysis of gradient descent dynamics using a cubic map parameterized by the step-size.
result Gradient descent dynamics in quadratic regression models exhibit five distinct phases: monotonic, catapult, periodic, chaotic, and divergent.

Divergence functions of a metric space estimate the length of a path connecting two points AA, BB at distance n\le n avoiding a large enough ball around a third point CC. We characterize groups with non-linear divergence functions as groups having cut-points in their asymptotic cones. By Olshanskii-Osin-Sapir, that…

2008-01-27abs ↗pdf ↗

We propose a general framework to learn deep generative models via \textbf{V}ariational \textbf{Gr}adient Fl\textbf{ow} (VGrow) on probability spaces. The evolving distribution that asymptotically converges to the target distribution is governed by a vector field, which is the negative gradient of the first variation o…

2019-01-24abs ↗pdf ↗

We study the Hadamard finite part of divergent integrals of differential forms with singularities on submanifolds. We give formulae for the dependence of the finite part on the choice of regularization and express them in terms of a suitable local residue map. The cases where the submanifold is a complex hypersurface i…

2016-11-15abs ↗pdf ↗

We give a generalization of Thurston's Bounded Image Theorem for skinning maps, which applies to pared 3-manifolds with incompressible boundary that are not necessarily acylindrical. Along the way we study properties of divergent sequences in the deformation space of such a manifold, establishing the existence of compa…

2016-01-21abs ↗pdf ↗

In this paper we explore relationships between divergence and thick groups, and with the same techniques we estimate lengths of shortest conjugators. We produce examples, for every positive integer n, of CAT(0) groups which are thick of order n and with polynomial divergence of order n+1, both these phenomena are new. …

2011-10-22abs ↗pdf ↗

Study optimal transport costs with zero MTW tensor, finding new families of costs and divergence functions.

problem Characterize optimal transport costs with zero MTW tensor.
method Optimal transport theory, information geometry, solving nonlinear ODEs.
result Found new families of costs and divergence functions.

New insights into how large learning rates affect transformer training dynamics.

problem Understanding how large learning rates impact the training of transformer models.
method Analyzing a simplified linear transformer model with a two-factor product map.
result Large learning rates can lead to various training outcomes including cycles, chaos, or divergence.

Bi-Lipschitz flows approximate a wide range of distributions.

problem Characterizing the expressivity of bi-Lipschitz normalizing flows.
method Linking score regularity to transport map bi-Lipschitzness via probability flow ODE.
result Gaussian pullbacks induced by bi-Lipschitz variance-preserving transport maps are L1L^1-dense among all probability densities.

Matrix SMD converges to unique solution minimizing Bregman divergence.

problem High-dimensional multi-output classification and matrix completion problems.
method Stochastic Mirror Descent with matrix parameters and matrix mirror functions.
result Matrix SMD converges exponentially to the unique solution minimizing Bregman divergence.

The study quantifies geodesic divergence on Riemannian planes with bounded geometry.

problem Understanding geodesic divergence on Riemannian planes with specific geometric constraints.
method Recalling quasi-redirection and using it to quantify geodesic divergence, compactifying Riemannian planes into D2\mathbb{D}^2 or S2\mathbb{S}^2.
result Necessary and sufficient conditions for the quasi-redirecting compactification being S2\mathbb{S}^2 are derived in terms of asymptotic cones.

The paper studies degenerations of rational maps and their limits as geometrically finite rational maps.

problem Understanding the limits of quasi post-critically finite degenerations of rational maps.
method Constructing limits as geometrically finite rational maps on a tree of Riemann spheres, proving boundedness, and giving convergence criteria.
result Progress towards Thurston's compactness theorem and double limit theorem in complex dynamics.

This paper contains two main results. The first is the existence of an equivariant Weil-Petersson geodesic in Teichmueller space for any choice of pseudo-Anosov mapping class. As a consequence one obtains a classification of the elements of the mapping class group as Weil-Petersson isometries which is parallel to the T…

2002-08-01abs ↗pdf ↗

Unified toolkit for comparing neural representations using SRTD and NTS.

problem Heuristic asymmetry and unbounded scores in existing divergences.
method Developed SRTD and NTS to address these issues.
result Unified, robust, and scale-invariant metric for comparing neural representations.

For a Lie algebroid, divergences chosen in a classical way lead to a uniquely defined homology theory. They define also, in a natural way, modular classes of certain Lie algebroid morphisms. This approach, applied for the anchor map, recovers the concept of modular class due to S. Evans, J.-H. Lu, and A. Weinstein.

2003-10-06abs ↗pdf ↗

MAP inference for general energy functions remains a challenging problem. While most efforts are channeled towards improving the linear programming (LP) based relaxation, this work is motivated by the quadratic programming (QP) relaxation. We propose a novel MAP relaxation that penalizes the Kullback-Leibler divergence…

2012-06-18abs ↗pdf ↗

A new method speeds up computation of Sinkhorn divergences to linear time.

problem Expensive computation of Sinkhorn divergences for comparing probability distributions.
method Using positive features to approximate ground costs, reducing computation time to linear.
result Sinkhorn divergences can be computed in linear time, scaling as O(nr).

The basin of infinity of a polynomial map $f : {\bf C} \arrow {\bf C}$ carries a natural foliation and a flat metric with singularities, making it into a metrized Riemann surface X(f)X(f). As ff diverges in the moduli space of polynomials, the surface X(f)X(f) collapses along its foliation to yield a metrized simplicial t…

2006-08-30abs ↗pdf ↗

This paper introduces a neural sampler for scalable sampling from complex distributions.

problem Efficiently sampling from high-dimensional un-normalized distributions.
method Neural implicit sampler trained with KL and Fisher divergence methods.
result The neural sampler generates large batches of samples with low computational costs.

We propose a framework for solving high-dimensional Bayesian inference problems using \emph{structure-exploiting} low-dimensional transport maps or flows. These maps are confined to a low-dimensional subspace (hence, lazy), and the subspace is identified by minimizing an upper bound on the Kullback--Leibler divergence …

2019-05-31abs ↗pdf ↗