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…
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.
Trend · papers per month
The paper studies curves in Riemannian manifolds using total variation flow.
Optimal pre-processing reduces disparate impact by minimizing total variation distance.
We show a very simple and general total second variation formula for Perelman's -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…
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…
We consider the problem of estimating a function defined over locations on a -dimensional grid (having all side lengths equal to ). When the function is constrained to have discrete total variation bounded by , we derive the minimax optimal (squared) estimation error rate, parametrized by …
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…
The total variation distance is a core statistical distance between probability measures that satisfies the metric axioms, with value always falling in . This distance plays a fundamental role in machine learning and signal processing: It is a member of the broader class of -divergences, and it is related to …
Through the direct study of the analysis estimator we derive oracle inequalities with fast and slow rates by adapting the arguments involving projections by Dalalyan, Hebiri and Lederer (2017). We then extend the theory to the square root analysis estimator. Finally, we focus on (square root) total variation regularize…
SaR-SVM-STV improves hyperspectral image classification with shape-adaptive reconstruction and denoising.
Study variational properties of curves in half-plane with area constraints.
Study variations of Riemannian submersions to maintain geodesic fibers and positive curvatures.
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…
Estimates parameters of interconnected linear systems using total variation penalization.
Sharp inequality between TV and Hellinger distances for Gaussian mixtures.
Paper proposes a method to estimate total variation distance for synthetic data fidelity.
Paper introduces a new method to model epidemic dynamics with varying parameters.
We consider the problem of minimizing the sum of submodular set functions assuming minimization oracles of each summand function. Most existing approaches reformulate the problem as the convex minimization of the sum of the corresponding Lovász extensions and the squared Euclidean norm, leading to algorithms requiring …
Proximal algorithms applied to current deformation into cycles.
Example shows learnable distributions not privately learnable.
New method for mesh denoising using TGV of normal vector field.
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.
Study variations of metrics on Riemannian submersions to preserve fiber geometry.
Unsupervised learning of disentangled representations involves uncovering of different factors of variations that contribute to the data generation process. Total correlation penalization has been a key component in recent methods towards disentanglement. However, Kullback-Leibler (KL) divergence-based total correlatio…
A main task in data analysis is to organize data points into coherent groups or clusters. The stochastic block model is a probabilistic model for the cluster structure. This model prescribes different probabilities for the presence of edges within a cluster and between different clusters. We assume that the cluster ass…
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…
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 …
We develop a variational theory of geodesics for the canonical variation of the metric of a totally geodesic foliation. As a consequence, we obtain comparison theorems for the horizontal and vertical Laplacians. In the case of Sasakian foliations, we show that sharp horizontal and vertical comparison theorems for the s…
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…
Error estimates found between SGD with momentum and Langevin diffusion.
New method relaxes TV distance for two-sample testing without distributional assumptions.
We focus on the maximum regularization parameter for anisotropic total-variation denoising. It corresponds to the minimum value of the regularization parameter above which the solution remains constant. While this value is well know for the Lasso, such a critical value has not been investigated in details for the total…
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…
The paper studies circle packings on surfaces with boundary and their total geodesic curvatures.
New bounds on neural network convergence using information theory.
Total variation regularization and total variation flows (TVF) have been widely applied for image enhancement and denoising. To include a generic preservation of crossing curvilinear structures in TVF we lift images to the homogeneous space of positions and orientations as a Lie group…
Algorithm learns affine transformations robustly from corrupted samples.
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 …
The paper finds circle packings with specific curvatures in hyperbolic geometry.
Efficiently estimates binary product distributions with privacy.
Proves sufficiency of countable test plans for BV functions on metric spaces.
Optimized -posteriors reduce KL divergence from true posterior in parametric 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…
Robust Bayesian inference improves model performance on discrete data.
While it is believed that denoising is not always necessary in many big data applications, we show in this paper that denoising is helpful in urban traffic analysis by applying the method of bounded total variation denoising to the urban road traffic prediction and clustering problem. We propose two easy-to-implement m…
We develop variation formulas on almost-product (e.g. foliated) pseudo-Riemannian manifolds, and we consider variations of metric preserving orthogonality of the distributions. These formulae are applied to Einstein-Hilbert type actions: the total mixed scalar curvature and the total extrinsic scalar curvature of a dis…
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…