The paper proves Γ-convergence of discrete tangent-point energies to continuous energies and ropelength, with applications to biarc curves.
problem Proving convergence of discrete tangent-point energies to continuous energies and ropelength.
method Using biarc curves and interpolation, the paper proves Γ-convergence of discretized tangent-point energies to the continuous tangent-point energies and ropelength functional. result Discrete almost minimizing biarc curves converge to ropelength minimizers and minimizers of continuous tangent-point energies.
Regularizes 3D inverse scattering with tangent-point energy for better solutions.
problem Ill-conditioned inverse obstacle scattering problems in 3D.
method Tikhonov regularization using tangent-point energy to penalize surface roughness and ensure well-posedness.
result Regularized solutions converge to true solution as noise level decreases.
Investigates energy minimizers and critical points of scale-invariant tangent-point energies for knots.
problem Finding and characterizing minimizers and critical points of scale-invariant tangent-point energies for closed curves.
method Develops convergence and regularity theories based on fractional Sobolev spaces and new energy functionals.
result Minimizing sequences converge to locally critical embeddings in all but finitely many points, and locally critical embeddings are regular.
In this article we introduce and investigate a new two-parameter family of knot energies TP(p,q) that contains the tangent-point energies. These energies are obtained by decoupling the exponents in the numerator and denominator of the integrand in the original definition of the tangent-point energies. We will firs…
The Palais-Smale condition is proven for various knot energies.
problem Existence and smoothness of minimizing knots in geometric knot theory.
method Proof of the Palais-Smale condition for specific knot energies.
result Existence of minimizing knots and long-time existence of their flows.
A new Riemannian metric on curve spaces is complete and smooth.
problem Defining a complete metric on the space of embedded curves.
method Proposed a new Riemannian metric and proved its completeness.
result The proposed metric is complete in multiple senses.
The paper proves a Fenchel theorem for Gauss maps and shows circles and disks minimize certain energies.
problem Finding minimizers of nonlocal curvature energies.
method Combining Fenchel-type theorems with geometric analysis techniques.
result Circles and disks minimize specific energy functionals.
Gradient flows for knot energies ensure long-term existence of knotted loops.
problem Ensuring long-term existence of knotted loops under various energies.
method Banach gradient flows, curves of maximal slope, logarithmic strain control.
result Established long-time existence of gradient flows for knot energies.
In this paper, we establish compactness for various geometric curvature energies including integral Menger curvature, and tangent-point repulsive potentials, defined a priori on the class of compact, embedded m-dimensional Lipschitz submanifolds in Rn. It turns out that due to a smoothing effect any seq…
New method avoids surface self-collision in geometric optimization.
problem Avoiding self-collision in surface optimization.
method Developed a numerical framework using tangent-point energy and fractional Sobolev inner product.
result Successfully accelerated collision avoidance scheme for triangle meshes.
We prove a monotonicity identity for compact surfaces with free boundaries inside the boundary of unit ball in Rn that have square integrable mean curvature. As one consequence we obtain a Li-Yau type inequality in this setting, thereby generalizing results of Oliveira and Soret, and Fraser and Schoen. In th…
Discrete geometry model approximates Willmore energy.
problem Approximating the Willmore energy for triangulated surfaces.
method A discrete energy defined in the spirit of discrete differential geometry converges to the Willmore energy.
result The discrete energy converges to the Willmore energy in the sense of Γ-convergence. New sampler tackles complex discrete energy landscapes efficiently.
problem Stagnation in gradient-based discrete samplers for non-convex settings.
method DREXEL sampler with Replica Exchange and Adjusted Metropolis.
result Proves samplers satisfy detailed balance and converge to target distribution.
The present chapter gives an overview on results for discrete knot energies. These discrete energies are designed to make swift numerical computations and thus open the field to computational methods. Additionally, they provide an independent, geometrically pleasing and consistent discrete model that behaves similarly …
We introduce a new discretization of O'Hara's Möbius energy. In contrast to the known discretizations of Simon and Kim and Kusner it is invariant under Möbius transformations of the surrounding space. The starting point for this new discretization is the cosine formula of Doyle and Schramm. We then show Γ-convergence…
A new method trains discrete EBMs without sampling.
problem Training EBMs on discrete spaces is hard.
method Energy Discrepancy (ED), a contrastive loss.
result ED offers theoretical guarantees for various perturbation types.
We investigate a discrete version of the Möbius energy, that is of geometric interest in its own right and is defined on equilateral polygons with n segments. We show that the Γ-limit regarding Lq or W1,q convergence, q∈[1,∞] of these energies as n→∞ is the smooth Möbius energy. This re…
In this paper we prove a universal inequality describing the asymptotic behavior of support points for planar continuous curves. As corollaries we get an analogous result for tangent points of differentiable planar curves and some (partially known) assertions on the asymptotic of the mean value points for various class…
The Möbius energy, defined by O'Hara, is one of the knot energies, and named after the Möbius invariant property which was shown by Freedman-He-Wang. The energy can be decomposed into three parts, each of which is Möbius invariant, proved by Ishizeki-Nagasawa. Several discrete versions of Möbius energy, that is, corres…
Graph Energy Matching improves generation quality for molecular graphs.
problem Discrete energy-based models struggle with efficient and high-quality sampling for graph generation.
method Inspired by transport-map optimization, Graph Energy Matching learns a permutation-invariant potential energy to guide sampling.
result GEM matches or surpasses discrete diffusion baselines on molecular graph benchmarks.
Optimal discrete harmonic maps between hyperbolic surfaces are found via minimizing energy.
problem Finding optimal discrete harmonic maps between hyperbolic surfaces.
method Minimizing Dirichlet energy over all possible hyperbolic structures and realizations within a fixed homotopy class.
result At the optimal hyperbolic structure, the discrete harmonic map and edge weights are induced from a weighted Delaunay decomposition.
New geometric interpretation of discrete Willmore energy using rolling spheres connection.
problem Discrete formulation of Willmore energy for simplicial surfaces.
method Geometric interpretation of Möbius invariant discrete Willmore energy using rolling spheres connection.
result Clear geometric interpretations of discrete Willmore energy with manifest Möbius invariance.
Discretizes Helfrich-type energies on surfaces using triangular complexes.
problem Discretizing curvature energies on surfaces of specific type.
method Asymptotic lower bound combined with recovery sequence of triangulations and edge director fields.
result Valid discrete versions of integral curvature energies on surfaces.
Current state-of-the-art discrete optimization methods struggle behind when it comes to challenging contrast-enhancing discrete energies (i.e., favoring different labels for neighboring variables). This work suggests a multiscale approach for these challenging problems. Deriving an algebraic representation allows us to…
New elastic energy for irregular curves defined through polygonal approximations.
problem Defining elastic energy for irregular curves in any space dimension.
method Relaxation process with p-rotation of inscribed polygonals, focusing on geometric curvature distribution. result Energy finite if and only if curve's arc-length parameterization has second order summability.
We investigate the relationship between a discrete version of thickness and its smooth counterpart. These discrete energies are defined on equilateral polygons with n vertices. It will turn out that the smooth ropelength, which is the scale invariant quotient of length divided by thickness, is the Γ-limit of the di…
EBMs trained on discrete data using heat equations on graph structures.
problem Training EBMs on discrete or mixed data.
method Heat equations on graph structures for data perturbation.
result Efficacy demonstrated in various applications.
EB-GFN models discrete data with amortized MCMC sampling.
problem Probabilistic modeling of high-dimensional discrete data.
method EB-GFN combines GFlowNets with energy-based models for efficient sampling.
result EB-GFN effectively models various discrete data tasks.
We address the problem of constructing numerical integrators for nonholonomic Lagrangian systems that enjoy appropriate discrete versions of the geometric properties of the continuous flow, including the preservation of energy. Building on previous work on time-dependent discrete mechanics, our approach is based on a d…
A new functional for simplicial surfaces is suggested. It is invariant with respect to Moebius transformations and is a discrete analogue of the Willmore functional. Minima of this functional are investigated. as an application a bending energy for discrete thin-shells is derived.
The paper analyzes discrete approximations to minimize curve length in Euclidean space.
problem Minimizing the length of curves between two sets in Euclidean space.
method Finite differences and numerical integration for discrete approximations.
result The squared length of the reconstructed curve converges to the squared minimal length with rate O(N−1/2). Proposes a new learning method for RBMs that combines strengths of forward and reverse KLD.
problem Underfitting and mode-collapse issues in RBM learning.
method Ratio divergence learning using target energy.
result Significantly outperforms other learning methods in energy function fitting, mode-covering, and stability.
Improved text generation with constraints using discrete auto-regressive biasing.
problem Balancing fluency and constraint satisfaction in LLM outputs.
method Discrete Auto-regressive Biasing, leveraging gradients in discrete text space.
result Significantly improved constraint satisfaction with comparable fluency.
New method learns discrete graph diffusion via free-energy gradient flows.
problem Challenges in translating continuous diffusion models to discrete spaces.
method Proposes a novel computational approach using a specific metric on the simplex.
result Recover the underlying functional for various graph classes.
Enhances gradient-based discrete samplers with parallel tempering for multimodal distributions.
problem Local minima in high-dimensional, multimodal discrete distributions.
method Combines parallel tempering with discrete Langevin proposal, using Metropolis criterion for swaps.
result Significantly faster mixing and better sampling from complex distributions.
Gradient-based MCMC for discrete spaces improves sampling performance.
problem Sampling in discrete spaces using traditional methods is challenging.
method Introduced new discrete Metropolis-Hastings samplers inspired by MALA, with a novel preconditioning technique.
result Demonstrated strong empirical performance across various challenging sampling problems.
We introduce the discrete Einstein metrics as critical points of discrete energy on triangulated 3-manifolds, and study them by discrete curvature flow of second (fourth) order. We also study the convergence of the discrete curvature flow. Discrete curvature flow of second order is an analogue of smooth Ricci flow.
New taxonomy and improved solvers for discrete energy minimization.
problem Maximum-a-posteriori inference in discrete graphical models.
method Dual block-coordinate ascent rule, theoretical analysis, new solver variants.
result Improved state-of-the-art solver outperforming existing methods on all test instances.
In this paper, we propose a geometric integrator for nonholonomic mechanical systems. It can be applied to discrete Lagrangian systems specified through a discrete Lagrangian defined on QxQ, where Q is the configuration manifold, and a (generally nonintegrable) distribution in TQ. In the proposed method, a discretizati…
Gradient estimation techniques applied to programs with randomness in high energy physics.
problem Differentiating programs with discrete randomness in high energy physics.
method Several gradient estimation techniques, including Stochastic AD method, applied to simplified detector design experiments.
result Development of the first fully differentiable branching program.
We present effective methods to compute equivariant harmonic maps from the universal cover of a surface into a nonpositively curved space. By discretizing the theory appropriately, we show that the energy functional is strongly convex and derive convergence of the discrete heat flow to the energy minimizer, with explic…
We generalize our previous results (Theorem 1 and Corollary 2 in arXiv:1412.4114) and Theorem 1 in arXiv:1502.00668) on the existence of an L2-energy gap for Yang-Mills connections over closed four-dimensional manifolds and energies near the ground state (occupied by flat, anti-self-dual, or self-dual connections) t…
We show that the emerging field of discrete differential geometry can be usefully brought to bear on crystallization problems. In particular, we give a simplified proof of the Heitmann-Radin crystallization theorem (R. C. Heitmann, C. Radin, J. Stat. Phys. 22, 281-287, 1980), which concerns a system of N identical at…
In this thesis I explore challenging discrete energy minimization problems that arise mainly in the context of computer vision tasks. This work motivates the use of such "hard-to-optimize" non-submodular functionals, and proposes methods and algorithms to cope with the NP-hardness of their optimization. Consequently, t…
The paper studies properties of Sliced Wasserstein energy for discrete measures.
problem Optimizing discrete probability measures using Sliced Wasserstein loss.
method Investigates the regularity and optimisation properties of the Sliced Wasserstein energy and its Monte-Carlo approximation.
result Convergence results on the critical points of Monte-Carlo approximations to the Sliced Wasserstein energy.
In the search for appropriate discretizations of surface theory it is crucial to preserve such fundamental properties of surfaces as their invariance with respect to transformation groups. We discuss discretizations based on Möbius invariant building blocks such as circles and spheres. Concrete problems considered in t…
FRAME (Filters, Random fields, And Maximum Entropy) is an energy-based descriptive model that synthesizes visual realism by capturing mutual patterns from structural input signals. The maximum likelihood estimation (MLE) is applied by default, yet conventionally causes the unstable training energy that wrecks the gener…
DNFS trains efficient samplers for discrete distributions using locally equivariant Transformers.
problem Sampling from unnormalised discrete distributions.
method DNFS learns a rate matrix to satisfy the Kolmogorov equation, using control variates and locally equivariant Transformers.
result DNFS achieves efficient and effective sampling across various applications.