Deep nets' complexity and risk are quantified using total path variation.
problem Quantifying the complexity and risk of deep neural networks.
method Using total path variation, the paper establishes relationships between network complexity and statistical risk.
result The statistical risk and metric entropy of deep nets are proportional to the total variation of path weights.
We generalize to tree graphs obtained by connecting path graphs an oracle result obtained for the Fused Lasso over the path graph. Moreover we show that it is possible to substitute in the oracle inequality the minimum of the distances between jumps by their harmonic mean. In doing so we prove a lower bound on the comp…
Improved KL divergence estimators for normalizing flows lead to faster convergence and better approximations.
problem Estimating KL divergences for normalizing flows efficiently and accurately.
method Path-gradient estimators for reverse and forward KL divergences.
result Path-gradient estimators lead to faster convergence and better approximation results.
New findings show score matching's accuracy doesn't ensure numerical stability in diffusion sampling.
problem Numerical stability issues in diffusion sampling despite small forward-marginal error.
method Constructing a smooth score field with arbitrarily small forward-marginal L2 error, showing nonexplosive behavior and moments of every order. result Euler--Maruyama discretizations can converge in probability even when moments diverge, demonstrating failure of weak convergence.
Optimal transport with path constraints for distributions of different masses.
problem Comparing distributions with different total masses under path constraints.
method Introduces a model for unbalanced optimal transport with path constraints, proving existence of solutions.
result Existence of solutions to path constrained unbalanced optimal transport for various constraints.
New path-gradient estimator for continuous normalizing flows.
problem Limitation of simple Gaussian variational distributions in complex applications.
method Proposed a path-gradient estimator for continuous normalizing flows.
result Empirical evidence of superior performance of the new estimator.
Given a smooth manifold M and a totally nonholonomic distribution Δ⊂TM of rank d, we study the effect of singular curves on the topology of the space of horizontal paths joining two points on M. Singular curves are critical points of the endpoint map F:γ↦γ(1) defined on the space Ω of horizonta…
A regularized optimization problem over a large unstructured graph is studied, where the regularization term is tied to the graph geometry. Typical regularization examples include the total variation and the Laplacian regularizations over the graph. When applying the proximal gradient algorithm to solve this problem, t…
The paper proves signatures of non-geometric rough paths can approximate functionals uniformly.
problem Approximating functionals of non-geometric rough paths.
method Extending rough paths with time and quadratic variation terms, proving uniform approximation.
result Linear functionals of extended signatures uniformly approximate continuous functionals.
Enhanced PINN for brittle fracture modeling using transfer learning.
problem Solving brittle fracture problems in physics.
method Physics-informed neural network (PINN) with variational energy minimization and transfer learning.
result The proposed approach yields better accuracy in predicting crack paths compared to conventional PINN.
Derives curvature formulas for convex metric sums and conditions for positive average variation.
problem Understanding how the curvature of a convex sum of metrics changes and whether it can increase the average curvature.
method Explicit formulae for curvature of convex sums of Riemannian metrics, studying total geodesic flat torus.
result Necessary and sufficient conditions for positive average variation of curvature of \(g_t\).
The paper shows that almost every path structure is not variational.
problem Determining if a path structure is variational.
method Generalized Douglas's result to higher dimensions and analyzed path geometries with infinitesimal symmetries.
result Almost every path structure is not variational.
Unified approach to DP problems using Gumbel distribution and variational Bayesian inference.
problem Solving classical optimal path problems in a probabilistic framework.
method Gumbel distribution and variational Bayesian inference for latent optimal paths.
result Unified approach transforms DP problems into directed acyclic graphs with Gibbs distribution.
We develop a Malliavin calculus on the horizontal path space of a totally geodesic Riemannian foliation. As a first application, under suitable assumptions, we prove a log-Sobolev inequality for a natural one-parameter family of infinite-dimensional Ornstein-Uhlenbeck type operators. As a second application, we obtain …
This paper considers possible price paths of a financial security in an idealized market. Its main result is that the variation index of typical price paths is at most 2, in this sense, typical price paths are not rougher than typical paths of Brownian motion. We do not make any stochastic assumptions and only assume t…
Using Vovk's outer measure, which corresponds to a minimal superhedging price, the existence of quadratic variation is shown for "typical price paths" in the space of càdlàg functions possessing a mild restriction on the jumps directed downwards. In particular, this result includes the existence of quadratic 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…
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.
Total variation denoising improves image quality adaptively.
problem Improving image quality from noisy data.
method Total variation regularization for image denoising.
result Denoised images converge to true images at a parametric rate.
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.
Extends tracking guarantees for time-varying variational inequalities.
problem Tracking solutions of time-varying variational inequalities.
method Extends existing results to sublinear solution paths and periodic problems.
result Discrete dynamical systems of periodic time-varying VI can exhibit chaotic behavior or converge to the solution.
We prove that the model-free typical (in the sense of Vovk) càdlàg price paths with mildly restricted downward jumps possess quadratic variation which does not depend on the specific sequence of partitions as long as these partitions are obtained from stopping times such that the oscillations of a path on the consecuti…
We consider the variational complex on infinite jet space and the complex of variational derivatives for Lagrangians of multidimensional paths and study relations between them. The discussion of the variational (bi)complex is set up in terms of a flat connection in the jet bundle. We extend it to supercase using a part…
Infinitesimal gradient boosting is a new algorithm derived from gradient boosting.
problem Improving the efficiency and smoothness of gradient boosting.
method Introduced a new class of randomized regression trees and used a limit process in vanishing-learning-rate asymptotic.
result Convergence of the stochastic algorithm and characterization of the limiting procedure as a unique solution of a nonlinear ODE.
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…
The paper studies metrics that match prescribed geodesics and introduces a variational problem.
problem Finding Riemannian metrics whose geodesics match given paths.
method Introduces a functional E on Riemannian metrics and computes its variational equations.
result Existence of conformally critical metrics in certain cases.
Optimizes diffusion processes for target distributions.
problem Efficiently generating target distributions from point masses.
method Stochastic interpolant framework with conditional expectation drift.
result Optimal diffusion coefficient minimizes path-space KL divergence.
Total variation minimization clusters partially labeled data points.
problem Clustering partially labeled data points in stochastic block models.
method Total variation minimization as a clustering method.
result Total variation minimization allows for accurate clustering under certain model parameters.
New control theory for self-path-dependent problems solves unique constraints.
problem Optimal control with self-path-dependent constraints in stochastic systems.
method Introduces new HJB equations for variational inequalities with historical maximum controls.
result Value functions are viscosity solutions to HJB equations under Lipschitz conditions.
New methods use machine learning to simulate rare transitions in molecular systems.
problem Simulating rare transitions between metastable states in molecular dynamics.
method Generative models and reinforcement learning for importance sampling.
result Efficiently generated transition paths linking metastable states.
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…
The paper derives oracle inequalities for estimators with fast and slow rates.
problem Developing fast and slow oracle inequalities for estimators.
method Direct study of analysis estimator and adaptation of Dalalyan, Hebiri and Lederer's arguments.
result Constant-friendly rates for (square root) total variation regularized estimators over graphs.
We consider idealized financial markets in which price paths of the traded securities are cadlag functions, imposing mild restrictions on the allowed size of jumps. We prove the existence of quadratic variation for typical price paths, where the qualification "typical" means that there is a trading strategy that risks …
We make evident a curvature tensor for every vector sub-bundle of an arbitrary manifold tangent bundle which reduces to the curvature tensor of an Ehresmann connection in the case of the horizontal sub-bundle of the tangent bundle to the total space of the nonlinear fiber bundle on which the connection is defined. Then…
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 …
New analysis of annealing paths in sampling and estimation.
problem Sampling from complex distributions and estimating normalization constants.
method Extending known results on Bregman divergence to quasi-arithmetic means under monotonic embedding.
result Analogous result for quasi-arithmetic means, highlighting the interplay between means, parametric families, and divergence functionals.
New method approximates diffusion process posteriors using moment functions.
problem Approximating posteriors of stochastic differential equations.
method Constructs variational process as controlled prior, approximates posterior with moment functions, uses natural gradient descent.
result Richer variational approximations for state-dependent diffusion terms.
Study on curves in Riemannian surfaces, focusing on total intrinsic curvature.
problem Understanding the total intrinsic curvature of irregular curves in Riemannian surfaces.
method Weak notion of parallel transport, bounded variation of angle, energy functional analysis.
result Total intrinsic curvature of irregular curves matches an energy functional.
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 …
Paper introduces Wasserstein total correlation for disentangled representation learning.
problem Learning disentangled representations from data.
method Adversarial training of a critic to estimate Wasserstein total correlation in variational and Wasserstein autoencoders.
result Proposed method achieves comparable disentanglement performance with less reconstruction loss.
Unified approach to stochastic control, filtering, and stopping using rough paths.
problem Addressing gaps in classical problems of stochastic control, filtering, and stopping.
method Combining rough path theory with controlled rough paths to provide a pathwise deterministic framework.
result Established rigorous connection between candidate solutions and Hamilton-Jacobi-Bellman equation.
Paper proposes a new method to minimize submodular functions with fewer calls to simpler oracles.
problem Minimizing the sum of submodular set functions with limited information.
method Introduces a modified convex problem requiring constrained total variation oracles that can be solved with fewer calls to minimization oracles.
result Shows significant reduction in the number of calls to minimization oracles.
Derives FPDE for equity-linked insurance pricing.
problem Calculating prices for insurance policies with complex payment histories.
method Variational techniques in functional Itô calculus.
result Derives a functional partial differential equation.
We present an exploration of the rich theoretical connections between several classes of regularized models, network flows, and recent results in submodular function theory. This work unifies key aspects of these problems under a common theory, leading to novel methods for working with several important models of inter…
Total variation and mean curvature flows on a Lie group quotient enhance and denoise crossing structures.
problem Preserving crossing curvilinear structures in image enhancement and denoising.
method Lifting images to the homogeneous space M=RdtimesSd−1, applying PDEs for TVF and MCF, and using locally optimal differential frames. result Better preservation of bundle boundaries and angular sharpness in fiber orientation densities at crossings compared to data-driven diffusions.
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.
The paper establishes prediction bounds for trend filtering with higher order total variation penalties.
problem Estimating signals with jumps of varying orders using total variation regularization.
method Combining oracle inequalities and interpolating vectors to bound effective sparsity.
result The ℓ1-penalty on (k−1)extth order differences allows adaptive estimation for k∈{1,2,3,4}. Neural Diffusion Intensity Models simplify Cox processes inference.
problem Intractable nonparametric estimation and posterior inference of latent stochastic intensity in Cox processes.
method Variational framework using neural SDEs, with theoretical guarantee of ELBO maximization coinciding with maximum likelihood estimation.
result Accurate recovery of latent intensity dynamics and posterior paths with significant speedup.