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.
New method for tensor completion using nonconvex dual total variation.
problem Tensor completion from partial measurements with exponential-family noise.
method Proposed dual-TV (DTV) regularizers for tensor completion under exponential-family noise.
result Theoretical upper bounds on recovery error for tensor completion.
Network Lasso clusters sparse graph clusters efficiently.
problem Local graph clustering of sparse and chain-like clusters.
method Network Lasso minimizes total variation of cluster indicator signals.
result Network Lasso handles sparse clusters difficult for spectral clustering.
Totally geodesic dual leaves on curved manifolds are also curved.
problem Characterizing dual leaves of nonnegatively curved polar manifolds.
method Proving dual leaves are totally geodesic and closed, and inducing a Riemannian submersion.
result Dual leaves of nonnegatively curved polar manifolds are themselves nonnegatively curved and totally geodesic.
A complete surface of constant mean curvature 1 (CMC-1) in hyperbolic 3-space with constant curvature -1 has two natural notions of "total curvature"-- one is the total absolute curvature which is the integral over the surface of the absolute value of the Gaussian curvature, and the other is the dual total absolute cur…
We propose and analyze a method for semi-supervised learning from partially-labeled network-structured data. Our approach is based on a graph signal recovery interpretation under a clustering hypothesis that labels of data points belonging to the same well-connected subset (cluster) are similar valued. This lends natur…
We review recent results on classifying complete constant mean curvature 1 (CMC 1) surfaces in hyperbolic 3-space with low total curvature. There are two natural notions of "total curvature" -- one is the total absolute curvature, which is the integral over the surface of the absolute value of the Gaussian curvature, a…
In this paper, the dual Orlicz curvature measure is proposed and its basic properties are provided. A variational formula for the dual Orlicz-quermassintegral is established in order to give a geometric interpretation of the dual Orlicz curvature measure. Based on the established variational formula, a solution to the …
Unified federated learning via GTV minimization.
problem Training local models for decentralized datasets with network structure.
method Formulated federated learning as GTV minimization, developed a decentralized algorithm.
result Upper bound on local model parameters deviation, revealing conditions for pooling homogeneous datasets.
We survey our recent results on classifying complete constant mean curvature 1 (CMC-1) surfaces in hyperbolic 3-space with low total curvature. There are two natural notions of "total curvature"-- one is the total absolute curvature which is the integral over the surface of the absolute value of the Gaussian curvature,…
We propose a systematic construction of native Banach spaces for general spline-admissible operators L. In short, the native space for L and the (dual) norm ∥⋅∥X′ is the largest space of functions f:Rd→R such that ∥Lf∥X′<∞, subj…
DualVDT improves time-series forecasting with a novel dual reparametrized structure.
problem Time-series forecasting with improved performance and analytical rigor.
method Dual reparametrized variational mechanisms on VAE, latent score based generative model, reverse time stochastic differential equation, variational ancestral sampling, KL divergence reduction.
result Advanced performance in time-series forecasting with reduced KL divergence.
New algorithm speeds up large-scale statistical inference.
problem Efficiently solving large-scale mean-field variational inference problems.
method Developed a novel primal-dual algorithm (PD-VI) and a block-preconditioned extension (P2D-VI) for mean-field variational inference. result PD-VI and P2D-VI achieve faster convergence and better solution quality compared to existing methods. 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…
Solves a generalized dual Minkowski problem for specific values of q.
problem Finding solutions to the generalized dual Minkowski problem for given q and star bodies.
method Variational methods
result Existence of solutions for q<0 and 0≤q≤1, sufficient condition for q>1.
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.
Improves SVGP methods for faster and more accurate Gaussian process inference.
problem Efficient non-conjugate Gaussian process inference.
method Dual parameterization of SVGP methods using site parameters.
result Faster and more accurate inference with tighter evidence lower bound.
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.
This paper accelerates TV regularization algorithms by unrolling proximal gradient descent.
problem Solving Total Variation (TV) regularized problems with iterative algorithms.
method Unrolling proximal gradient descent solvers to learn their parameters.
result Two approaches to compute derivatives through proximal operators improve performance.
We apply the network Lasso to classify partially labeled data points which are characterized by high-dimensional feature vectors. In order to learn an accurate classifier from limited amounts of labeled data, we borrow statistical strength, via an intrinsic network structure, across the dataset. The resulting logistic …
We show a very simple and general total second variation formula for Perelman's 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…
In this paper we develop a relative version of T-duality in generalized complex geometry which we propose as a manifestation of mirror symmetry. Let M be an n-dimensional smooth real manifold, V a rank n real vector bundle on M, and nabla a flat connection on V. We define the notion of a nabla-semi-flat generalized com…
We study the totally null surfaces of the neutral Kaehler metric on certain 4-manifolds. The tangent spaces of totally null surfaces are either self-dual (α-planes) or anti-self-dual (β-planes) and so we consider α-surfaces and β-surfaces. The metric of the examples we study, which include the spaces of oriente…
The paper studies dual pairs of generic conformally flat hypersurfaces in 4-space.
problem Understanding the relationship between a generic conformally flat hypersurface and its dual.
method Developing discrete hypersurfaces of the dual for all positive integers n, and constructing approximations from dual invariants.
result Clarifying the correspondence between a generic conformally flat hypersurface and its dual in R4. Extends polydisk theorem to Hartogs domains over symmetric domains.
problem Rigidity phenomena in Riemannian manifolds.
method Extension of polydisk theorem to Hartogs domains over arbitrary symmetric domains.
result Dual of a Hartogs domain over a bounded symmetric domain admits no totally geodesic immersion into any compact Riemannian manifold.
Optimal hedging framework with variational preferences under convex risk measures.
problem Optimal hedging with variational preferences under convex risk measures.
method Theoretical hedging optimization framework with dual representation of risk measures and utilities.
result Derivation of optimality and indifference pricing conditions.
An index theorem for the anti-self-dual deformation complex on anti-self-dual orbifolds with singularities conjugate to ADE-type is proved. In 1988, Claude Lebrun gave examples of scalar-flat Kähler ALE metrics with negative mass, on the total space of the bundle O(−n) over S2. A corollary of this index …
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 n locations on a d-dimensional grid (having all side lengths equal to n1/d). When the function is constrained to have discrete total variation bounded by Cn, we derive the minimax optimal (squared) ℓ2 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…
Triangulates permutahedra for Coxeter groups, revealing braid group connections.
problem Triangulating permutahedra for Coxeter groups.
method Constructs triangulations using total linear stability and height functions.
result Explicitly relates two braid group presentations.
This work proposes a novel method for semi-supervised learning from partially labeled massive network-structured datasets, i.e., big data over networks. We model the underlying hypothesis, which relates data points to labels, as a graph signal, defined over some graph (network) structure intrinsic to the dataset. Follo…
The total variation distance is a core statistical distance between probability measures that satisfies the metric axioms, with value always falling in [0,1]. This distance plays a fundamental role in machine learning and signal processing: It is a member of the broader class of f-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…
GCAE uses density estimation to achieve reliable disentanglement in latent space.
problem Disentangled learning representations suffer from reliability issues.
method GCAE uses Gaussian Channel Autoencoder with Dual Total Correlation (DTC) to avoid the curse of dimensionality.
result GCAE achieves highly competitive and reliable disentanglement scores.
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 variational properties of curves in half-plane with area constraints.
problem Characterize critical points of inverse mean curvature.
method Variational analysis of curves with boundary constraints.
result Existence and stability of critical points with prescribed area.
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 construct the Nahm transform for Higgs bundles over a Riemann surface of genus at least 2 as hyperholomorphic connections on the total space of the tangent bundle of its dual Jacobian.
Totally isotropic surfaces in S6 are not necessarily Willmore surfaces. Therefore it is the first goal of this paper to derive a geometric characterization of totally isotropic Willmore two-spheres in S6. This will naturally yield to a description of such surfaces in terms of the loop group language. Moreover, ap…
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.
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.
Variational problems that involve Wasserstein distances have been recently proposed to summarize and learn from probability measures. Despite being conceptually simple, such problems are computationally challenging because they involve minimizing over quantities (Wasserstein distances) that are themselves hard to compu…
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 1−o(1), where o(1) is of order 1/loglog(1/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.
Revisits shallow neural networks using Lipschitz norms and measures.
problem Existence and compactness of minimizers in neural network formulations.
method Mean field parametrization, signed measures, duality pairings, Kantorovich-Rubinstein norms.
result Compactness results and uniform large data limits for empirical risk minimization.
A method to improve sequential learning by keeping past data errors in check.
problem Challenges in sequential learning with Gaussian processes due to accumulating errors.
method Memory-based dual sparse variational Gaussian processes.
result Improves accuracy in inference and learning for various applications.
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.