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

62125187249 · Jun 202019922001200920172026
48 results for Total Variation

Ideas from the image processing literature have recently motivated a new set of clustering algorithms that rely on the concept of total variation. While these algorithms perform well for bi-partitioning tasks, their recursive extensions yield unimpressive results for multiclass clustering tasks. This paper presents a g…

2013-06-05abs ↗pdf ↗

The paper studies curves in Riemannian manifolds using total variation flow.

problem Analyzing the evolution of curves in Riemannian manifolds using total variation.
method Defining and proving the existence of strong solutions to the flow equations, showing variational equality, and proving convergence.
result Strong solutions converge to a constant map in finite time for non-positive sectional curvature.

Optimal pre-processing reduces disparate impact by minimizing total variation distance.

problem Achieving fairness in data outputs based on protected attributes.
method Using pre-processing to enforce fairness, minimizing total variation distance between pre-processed and original data distributions.
result The problem of fairness can be formulated as a linear program, efficiently solvable.

We show a very simple and general total second variation formula for Perelman's W\mathcal{W}-functional at arbitrary points in the space of Riemannian metrics. Moreover we perform a study of the properties of the variations of Kähler structures. We deduce a quite simple and general total second variation formula for P…

2012-01-04abs ↗pdf ↗

We derive variational formulas for the total Q-prime curvature under the deformation of strictly pseudoconvex domains in a complex manifold. We also show that the total Q-prime curvature agrees with the renormalized volume of such domains with respect to the complete Einstein-Kähler metric. In the appendix, by Rod Gove…

2015-10-12abs ↗pdf ↗

We study the theoretical properties of image denoising via total variation penalized least-squares. We define the total vatiation in terms of the two-dimensional total discrete derivative of the image and show that it gives rise to denoised images that are piecewise constant on rectangular sets. We prove that, if the t…

2019-11-17abs ↗pdf ↗

SaR-SVM-STV improves hyperspectral image classification with shape-adaptive reconstruction and denoising.

problem Classifying hyperspectral images with limited labeled data.
method Shape-adaptive Reconstruction (SaR) for pixel preprocessing, SVM for probability estimation, and Smoothed Total Variation (STV) for denoising.
result SaR-SVM-STV outperforms SVM-STV with fewer labeled data.

Study variations of Riemannian submersions to maintain geodesic fibers and positive curvatures.

problem Maintain geodesic fibers and positive sectional curvatures in Riemannian submersions.
method Vary Riemannian metrics while keeping fibers totally geodesic and horizontal distribution fixed.
result Conditions for making sectional curvatures positive and existence of fat submersions.

We examine the total mixed scalar curvature of a fixed distribution as a functional of a pseudo-Riemannian metric. We develop variational formulas for quantities of extrinsic geometry of the distribution to find the critical points of this action. Together with the arbitrary variations of the metric, we consider also v…

2016-09-29abs ↗pdf ↗

Estimates parameters of interconnected linear systems using total variation penalization.

problem Joint estimation of parameters in interconnected linear dynamical systems.
method Total variation penalized least-squares estimator.
result The MSE goes to zero as the number of systems increases, even with constant trajectory length.

Sharp inequality between TV and Hellinger distances for Gaussian mixtures.

problem Understanding the relationship between total variation and Hellinger distances for Gaussian mixtures.
method Established a general upper bound on Hellinger distance in terms of TV distance raised to a power, demonstrating sharpness with specific examples.
result The Hellinger distance between two Gaussian mixtures is bounded by the TV distance raised to a power 1o(1)1-o(1), where o(1)o(1) is of order 1/loglog(1/TV)1/\log\log(1/\mathrm{TV}).

Paper proposes a method to estimate total variation distance for synthetic data fidelity.

problem Assessing the fidelity of synthetic data generated by AI.
method Discriminative approach to estimate total variation distance between two distributions.
result Estimation of total variation distance reduces to quantifying Bayes risk in classification.

Paper introduces a new method to model epidemic dynamics with varying parameters.

problem Capturing discontinuous variations in epidemic model parameters.
method Total variation regularization with Iterated Nelder--Mead optimization.
result The method accurately models epidemic dynamics with instant changes.

Example shows learnable distributions not privately learnable.

problem Learnable distributions under non-private conditions not transferable to differential privacy.
method Example of a distribution class learnable up to constant error in total variation distance but not under differential privacy.
result Contradicts conjecture of Ashtiani on learnability under differential privacy.

Graphs with non-negative Ollivier-Ricci curvature cannot be expanders.

problem Understanding the relationship between graph curvature and expansion properties.
method Proving an inequality linking isoperimetric profiles to total variation decay of random walks.
result Graphs with non-negative Ollivier-Ricci curvature cannot be expanders.

The paper shows diffusion models can converge faster to a target distribution with low-dimensional structure.

problem Improving the convergence rate of diffusion models to target distributions.
method Analyzing DDIM and DDPM samplers under low-dimensional structure assumptions.
result The iteration complexities of DDIM and DDPM are no greater than k/εk/\varepsilon in total variation distance.

Study variations of metrics on Riemannian submersions to preserve fiber geometry.

problem Preserving specific geometries of fibers under metric variations on Riemannian submersions.
method Formulated conditions for preserving fiber geometry (totally geodesic, umbilical, minimal) and examined variations of sectional curvatures.
result Conditions for metric to be a critical point of integrated squared norms of fiber curvatures, with non-negative second variation.

In recent years, total variation (TV) and Euler's elastica (EE) have been successfully applied to image processing tasks such as denoising and inpainting. This paper investigates how to extend TV and EE to the supervised learning settings on high dimensional data. The supervised learning problem can be formulated as an…

2012-06-18abs ↗pdf ↗

We deal with irregular curves contained in smooth, closed, and compact surfaces. For curves with finite total intrinsic curvature, a weak notion of parallel transport of tangent vector fields is well-defined in the Sobolev setting. Also, the angle of the parallel transport is a function with bounded variation, and its …

2019-06-25abs ↗pdf ↗

We decompose the evidence lower bound to show the existence of a term measuring the total correlation between latent variables. We use this to motivate our ββ-TCVAE (Total Correlation Variational Autoencoder), a refinement of the state-of-the-art ββ-VAE objective for learning disentangled representations, requiring n…

2018-02-14abs ↗pdf ↗

Error estimates found between SGD with momentum and Langevin diffusion.

problem Quantifying the difference between SGD with momentum and Langevin diffusion.
method Established error estimates using 1-Wasserstein and total variation distances.
result Quantitative error estimates between SGD with momentum and underdamped Langevin diffusion.

New method relaxes TV distance for two-sample testing without distributional assumptions.

problem Challenges in certifying equality or providing tight bounds on TV distance for two distributions.
method Examined blurred total variation distance, a relaxation of TV distance.
result Provided theoretical guarantees for upper and lower bounds on blurred TV distance.

Hypergraphs allow one to encode higher-order relationships in data and are thus a very flexible modeling tool. Current learning methods are either based on approximations of the hypergraphs via graphs or on tensor methods which are only applicable under special conditions. In this paper, we present a new learning frame…

2013-12-18abs ↗pdf ↗

The paper studies circle packings on surfaces with boundary and their total geodesic curvatures.

problem Existence and rigidity of circle packings with conical singularities.
method Variational principle and combinatorial Ricci flow.
result Existence and rigidity of circle packings with prescribed total geodesic curvature.

Algorithm learns affine transformations robustly from corrupted samples.

problem Learning affine transformations from corrupted samples.
method New geometric certificate and iterative improvement method.
result Total variation distance of O(ε)O(ε) between learned and original distributions.

The total curvature of complex hypersurfaces in $\bC^{n+1}$ and its variation in families appear to depend not only on singularities but also on the behaviour in the neighbourhood of infinity. We find the asymptotic loss of total curvature towards infinity and we express the total curvature and the Gauss-Bonnet defect …

2004-07-05abs ↗pdf ↗

The paper finds circle packings with specific curvatures in hyperbolic geometry.

problem Finding circle packings with prescribed total geodesic curvatures and discrete Gaussian curvatures.
method Established existence and rigidity via variational principle, introduced combinatorial p-th Calabi flows.
result Introduced combinatorial p-th Calabi flows to find circle packings with prescribed curvatures.

Proves sufficiency of countable test plans for BV functions on metric spaces.

problem Recovering BV functions and their measures on arbitrary metric spaces.
method Proves sufficiency of countable test plans on arbitrary metric measure spaces and geodesics on CD(K,N){\sf CD}(K,N) spaces.
result Countable test plans are sufficient for BV functions and their measures on metric spaces.

Optimized α\alpha-posteriors reduce KL divergence from true posterior in parametric misspecification.

problem Reduction of KL divergence from true posterior in parametric model misspecification.
method Derivation of Bernstein-von Mises theorem and optimization of α\alpha-posteriors.
result Optimized α\alpha-posteriors minimize KL divergence from true posterior, especially in severe misspecification.

Using Green's theorem we reduce the variation of the total mean curvature of a smooth surface in the Euclidean 3-space to a line integral of a special vector field and obtain the following well-known theorem as an immediate consequence: the total mean curvature of a closed smooth surface in the Euclidean 3-space is sta…

2008-11-29abs ↗pdf ↗

Robust Bayesian inference improves model performance on discrete data.

problem Misspecification of discrete-valued models leads to poor inference and prediction.
method Total Variation Distance (TVD) for discrepancy, efficient estimator and inference method.
result Our approach significantly improves predictive performance on various data.

We consider point clouds obtained as random samples of a measure on a Euclidean domain. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. Our goal is to develop mathematical tools needed to study the consistency, as the number of availa…

2014-03-25abs ↗pdf ↗