IDF++ improves integer discrete flows for lossless compression.
problem Theoretical limitations of integer discrete flows for lossless compression.
method Investigated and improved integer discrete flows, addressing gradient bias and architecture modifications.
result Different architecture modifications improve integer discrete flows for lossless compression.
Lossless compression methods shorten the expected representation size of data without loss of information, using a statistical model. Flow-based models are attractive in this setting because they admit exact likelihood optimization, which is equivalent to minimizing the expected number of bits per message. However, con…
New invertible transformations improve flow-based generative models.
problem Improving flow-based generative models for better performance.
method Proposed new invertible transformations and coupling layers.
result New coupling layers achieve better results in IDF.
A new method for discrete data normalizing flows using latent transformations.
problem Challenges in parameterizing bijective transformations for discrete data.
method Predict a distribution over latent transformations to make the marginal likelihood differentiable.
result Discrete-data normalizing flows can be trained using gradient-based learning with unbiased score function estimation.
We propose a novel high-dimensional linear regression estimator: the Discrete Dantzig Selector, which minimizes the number of nonzero regression coefficients subject to a budget on the maximal absolute correlation between the features and residuals. Motivated by the significant advances in integer optimization over the…
The paper studies non-integer curvature flows and proves convergence to spheres under specific conditions.
problem Analyzing the convergence of non-integer curvature flows on rotationally symmetric surfaces.
method Spectral theory of singular Sturm-Liouville operators to construct an eigenbasis and prove convergence.
result The flow converges to a round sphere if the focal points coincide at the poles, otherwise to a non-round Hopf sphere.
Numerous methods for crafting adversarial examples were proposed recently with high success rate. Since most existing machine learning based classifiers normalize images into some continuous, real vector, domain firstly, attacks often craft adversarial examples in such domain. However, "adversarial" examples may become…
The lattice of integer flows of a graph is known to determine the graph up to 2-isomorphism (work of Su--Wagner and Caporaso--Viviani). In this paper we give an algorithmic construction of the graphic matroid $\calM(G)$ of a graph G, given its lattice of integer flows $\calF(G)$. The algorithm can then be applied to …
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.
We establish a necessary and sufficient condition for pairs of integers to arise as the weights at the fixed points of an effective circle action on a compact almost complex 4-manifold with a discrete fixed point set. As an application, we provide a necessary and sufficient condition for a pair of integers to arise as …
Study proves existence of a specific type of flow in geometry.
problem Existence of canonical multi-phase free boundary Brakke flows.
method Global-in-time existence established using Brakke flow and uniform density ratio assumption.
result Existence of the flow with no positive mass on the free boundary for some short time.
The SU(3)-Casson invariant for integral homology 3-spheres as studied by Boden-Herald possesses a 'spectral flow obstruction' to being an integer valued invariant which depends only on the non-degenerate (perturbed) moduli space of flat SU(3)-connections. This obstruction is the non-trivial spectral flow of a family of…
Paper proposes a new generative model for discrete distributions using flows on submanifolds.
problem Discretization issues and complex statistical dependencies in discrete data.
method Continuous normalizing flows on factorizing discrete measures, geodesic flow matching.
result Efficient training and broad applicability demonstrated through experiments.
While normalizing flows have led to significant advances in modeling high-dimensional continuous distributions, their applicability to discrete distributions remains unknown. In this paper, we show that flows can in fact be extended to discrete events---and under a simple change-of-variables formula not requiring log-d…
In this paper, we introduce a parameterized discrete curvature (α-curvature) for piecewise linear metrics on polyhedral surfaces, which is a generalization of the classical discrete curvature. A discrete uniformization theorem is established for the parameterized discrete curvature, which generalizes the discrete uni…
Unified framework for continuous-state discrete flow matching models.
problem Discrete generative modeling with continuous probabilities.
method Introducing α-Flow, a family of CS-DFM models based on information geometry. result Optimal flow matching loss for α-flow minimizes generalized kinetic energy. Study of Ricci flow on discrete surfaces of revolution with constant Gaussian curvature.
problem Understanding Ricci flow on discrete surfaces of revolution.
method Explicit parametrizations and Ricci flow analysis for discrete surfaces of revolution.
result Discrete surfaces of revolution approach constant Gaussian curvature under Ricci flow.
Summarizes quantum field theories with discrete symmetry, classifying representations and anomalies.
problem Classifying representations and anomalies in quantum field theories with discrete symmetry.
method Classification of representations and anomalies using the ring of profinite integers.
result Rich and complex classification of representations and anomalies.
In this paper, we prove some analogues of Payne-Polya-Weinberger, Hile-Protter and Yang's inequalities for Dirichlet (discrete) Laplace eigenvalues on any subset in the integer lattice Zn. This partially answers a question posed by Chung and Oden.
Contractible Vietoris-Rips complexes for integer n proved using discrete Morse theory.
problem Proving contractibility of Vietoris-Rips complexes for Zn. method Used Bestvina-Brady discrete Morse theory to provide a short and improved proof.
result Contractible Vietoris-Rips complexes at large scales for Zn. Discrete Flow Maps bypass sequential prediction limits for parallel text generation.
problem Sequential autoregressive prediction limits large language model speed.
method Flow Maps compress generative trajectories into single-step mappings.
result Discrete Flow Maps surpass previous state-of-the-art results in discrete flow modeling.
DFMs enable flow-based models for multimodal discrete and continuous data.
problem Combining discrete and continuous data for generative models.
method Discrete Flow Models (DFMs) using Continuous Time Markov Chains.
result DFMs achieve state-of-the-art co-design performance for protein structure and sequence generation.
Discrete Gaussian noise preserves privacy and accuracy in differential privacy.
problem Finite computers cannot represent continuous Gaussian noise, leading to privacy breaches and loss of interpretability.
method Introduced and analyzed discrete Gaussian noise, providing privacy and accuracy guarantees similar to continuous Gaussian noise.
result Discrete Gaussian noise offers the same privacy and accuracy as continuous Gaussian noise, with efficient sampling algorithms.
The paper studies deformation of discrete conformal structures on surfaces using combinatorial curvature flows.
problem Finding piecewise constant curvature metrics on surfaces with prescribed combinatorial curvatures.
method Combinatorial curvature flows, including Ricci flow and Calabi flow, are applied to deform Glickenstein's discrete conformal structures.
result The solution of the combinatorial Ricci flow can be uniquely extended and converges exponentially fast for any initial value under certain conditions.
Paper proves EM algorithm convergence for mixtures of discrete and continuous parameters.
problem Nontrivial convergence analysis for EM algorithms with mixed-integer parameters.
method Introduces conditions for EM convergence in mixed-integer optimization.
result Proves convergence of EM-based sparse Bayesian learning algorithm.
Develops a new method for learning discrete distributions without embedding them in a continuous space.
problem Challenges in learning discrete distributions using current methodologies.
method Introduces a MAD invertible map and a mixed variational flow (MAD Mix) for discrete distributions.
result MAD Mix produces more reliable approximations than continuous-embedding flows.
New method reduces discrete flow transitions, improving perplexity estimation.
problem Stochasticity in discrete paths makes rectification strategies ineffective.
method Dynamic-optimal-transport-like minimization objective with minibatch strategies.
result 32 times reduction in transitions for same perplexity.
Fractional combinatorial flow improves surface conformal structures.
problem Improving discrete conformal structures on surfaces.
method Introducing a fractional combinatorial Calabi flow for discrete conformal structures on surfaces.
result Longtime existence and global convergence of the fractional combinatorial Calabi flow for various surface types.
The study tackles modeling high-frequency financial data using continuous distributions, finding them inadequate.
problem Challenges in modeling high-frequency integer price changes with continuous distributions.
method Proposed a modified maximum likelihood estimation procedure to account for the discreteness of high-frequency price changes.
result Traditional GARCH models are not suitable for high-frequency data due to the discreteness of price changes.
Novel framework combines tree-based discretization and ILP matching for causal inference.
problem Challenges in identifying causal relationships from observational data.
method Combines tree-based discretization and ILP matching for causal inference.
result Yields computational efficiency and less biased ATT estimates.
We define Discrete Quasi-Einstein metrics (DQE-metrics) as the critical points of discrete total curvature functional on triangulated 3-manifolds. We study DQE-metrics by introducing some combinatorial curvature flows. We prove that these flows produce solutions which converge to discrete quasi-Einstein metrics when th…
Study on deforming discrete conformal structures on surfaces with boundaries.
problem Deforming discrete conformal structures on surfaces with boundaries.
method Introduce combinatorial Ricci flow and combinatorial Calabi flow, establish longtime existence and global convergence of solutions.
result Effective algorithms for finding discrete hyperbolic metrics on surfaces with totally geodesic boundaries of prescribed lengths.
The paper introduces combinatorial curvature and flow for polyhedral surfaces, proving rigidity and solving the Yamabe problem.
problem Discrete conformal structures on polyhedral surfaces and their rigidity.
method Parameterized combinatorial curvature, combinatorial α-Ricci flow, and flow extension through singularities.
result Existence and convergence of combinatorial α-Ricci flow for solving the Yamabe problem.
Unified error analysis for discrete flow models.
problem Error analysis of discrete flow models.
method Stochastic calculus theory, Girsanov theorem, generator matching, uniformization.
result First error analysis for discrete flow models.
New method for probabilistic modeling of integer submodular functions.
problem Lack of probabilistic modeling for integer submodular functions.
method Proposed Generalized Multilinear Extension and block-coordinate ascent algorithm.
result Demonstrated effectiveness and viability on real-world datasets.
The paper establishes a discrete uniformization theorem for surfaces with piecewise hyperbolic metrics.
problem Finding decorated piecewise hyperbolic metrics with prescribed combinatorial curvature.
method Introduced combinatorial α-Ricci flow with surgery to handle potential singularities and prove longtime existence and convergence.
result Existence of decorated piecewise hyperbolic metrics with prescribed combinatorial α-curvature.
The paper studies stability of discretized Anosov flows.
problem Global stability of discretized Anosov flows.
method Defined and proved equivalence with previous definitions, showed properties through C1 openness and closedness, and established integrability and uniqueness of invariant foliations. result Discretized Anosov flows are globally stable.
New discrete conformal structures on surfaces with boundary, proving global rigidity and constructing hyperbolic metrics.
problem Creating new discrete conformal structures on surfaces with boundary.
method Introducing new discrete conformal structures, proving global rigidity using variational principles, and introducing combinatorial curvature flows.
result Global rigidity of new discrete conformal structures and effective algorithms for constructing hyperbolic metrics.
Flow models have recently made great progress at modeling ordinal discrete data such as images and audio. Due to the continuous nature of flow models, dequantization is typically applied when using them for such discrete data, resulting in lower bound estimates of the likelihood. In this paper, we introduce subset flow…
Bäcklund transformations for smooth and ``space discrete'' Hashimoto surfaces are discussed and a geometric interpretation is given. It is shown that the complex curvature of a discrete space curve evolves with the discrete nonlinear Schrödinger equation (NLSE) of Ablowitz and Ladik, when the curve evolves with the Has…
In this paper we study the (asymptotic and exponential) stability of the m-fold circle as a solution of the p-curve shortening flow (p≥1 an integer).
Normalizing flows are a powerful class of generative models for continuous random variables, showing both strong model flexibility and the potential for non-autoregressive generation. These benefits are also desired when modeling discrete random variables such as text, but directly applying normalizing flows to discret…
In this paper we investigate discrete time trading under integer constraints, that is, we assume that the offered goods or shares are traded in integer quantities instead of the usual real quantity assumption. For finite probability spaces and rational asset prices this has little effect on the core of the theory of no…
In this paper, we study the discrete Morse flow for the Ricci flow on football, which is the 2-sphere with removed north and south poles and with the metric g0 of constant scalar curvature, and and for Porous media equation on a bounded regular domain in the plane. We show that with a suitable assumption about $g(0)…
The paper studies the consistency of mean curvature flow via volumetric varifolds.
problem Consistency of mean curvature flow.
method Discretization using volumetric varifolds and derivation of Brakke approximate equality.
result Derivation of a Brakke approximate equality involving varifold masses and approximate mean curvatures.
Corrected samplers reduce discretization error in discrete flow models without additional computational cost.
problem Discretization error in samplers for discrete flow models.
method Established non-asymptotic error bounds for samplers, proposed time-corrected and location-corrected samplers.
result Location-corrected sampler has lower complexity and better generation quality.
The paper develops algorithms for finding metrics with prescribed combinatorial curvature on polyhedral surfaces.
problem Finding metrics with prescribed combinatorial curvature on polyhedral surfaces.
method Discrete uniformization theorem, combinatorial α-Yamabe flow, combinatorial α-Calabi flow, edge flipping surgery.
result Longtime existence and convergence of combinatorial α-Yamabe flow and combinatorial α-Calabi flow with surgery.
Classifies Anosov flows on figure-eight knot surgeries.
problem Classifying Anosov flows on Dehn surgeries on the figure-eight knot.
method Combining Plante's classification of M(0) with Schwider's branched surfaces.
result M(r) carries a unique Anosov flow if r is an integer, and no Anosov flow if r is not an integer.