Research
On-device research index

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.

168,742 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for discrete image

A new method for computing image curvature efficiently and accurately.

problem Low performance, low accuracy, and requirement of second order differentiability in conventional computation schemes.
method Proposes a novel discrete computation scheme for weighted Gaussian curvature.
result More accurate, computationally more efficient, and does not require second order differentiability.

We discretize a cost functional for image registration problems by deriving Taylor expansions for the matching term. Minima of the discretized cost functionals can be computed with no spatial discretization error, and the optimal solutions are equivalent to minimal energy curves in the space of kk-jets. We show that t…

2014-12-23abs ↗pdf ↗

We consider a general theory of curvatures of discrete surfaces equipped with edgewise parallel Gauss images, and where mean and Gaussian curvatures of faces are derived from the faces' areas and mixed areas. Remarkably these notions are capable of unifying notable previously defined classes of surfaces, such as discre…

2009-01-29abs ↗pdf ↗

New method learns disentangled discrete representations using categorical variational autoencoders.

problem Learning disentangled representations from discrete latent spaces.
method Replaced standard Gaussian VAE with a categorical VAE to mitigate rotational invariance.
result Categorical distributions improve learning of disentangled representations.

We construct a sequence of primitive-stable representations of free groups into PSL(2,C) whose ranks go to infinity, but whose images are discrete with quotient manifolds that converge geometrically to a knot complement. In particular this implies that the rank and geometry of the image of a primitive-stable representa…

2010-09-30abs ↗pdf ↗

Generative Adversarial Networks (GAN) have shown great promise in tasks like synthetic image generation, image inpainting, style transfer, and anomaly detection. However, generating discrete data is a challenge. This work presents an adversarial training based correlated discrete data (CDD) generation model. It also de…

2018-04-03abs ↗pdf ↗

Remasking improves the quality of discrete diffusion models for natural language and image generation.

problem Limited iterative refinement in masked discrete diffusion models.
method Introducing ReMDM sampler that allows remasking during inference.
result Remasking enables better quality outputs with increased sampling steps.

Masking diffusion outperforms other discrete diffusion models by incorporating jump times into the model.

problem Improving the performance of discrete diffusion models.
method Conditioning on the jump schedule of discrete Markov processes.
result Schedule-conditioned discrete diffusion (SCUD) models outperform classical and masking diffusion models.

Let ee denote the Euler class on the space Hom(Γg,PSL(2,R))Hom(Γ_g, PSL(2,\mathbb R)) of representations of the fundamental group ΓgΓ_g of the closed surface ΣgΣ_g of genus gg. Goldman showed that the connected components of Hom(Γg,PSL(2,R))Hom(Γ_g, PSL(2,\mathbb R)) are precisely the inverse images e1(k)e^{-1}(k), for 22gk2g22-2g\leq k\leq 2g-2, and t…

2005-02-28abs ↗pdf ↗

New method improves inference for discrete diffusion models, achieving better quality and efficiency.

problem High dimensionality of discrete diffusion models causes inference challenges.
method Developed high-order numerical inference schemes for discrete diffusion models.
result Second-order accuracy of the θθ-Trapezoidal method in KL divergence.

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…

2019-05-19abs ↗pdf ↗

A new method learns discrete representations for images and videos, improving upon previous models.

problem Learning discrete representations for images and videos to improve performance.
method Depthwise application of Vector Quantized Variational Autoencoders (VQVAE) to feature axis.
result 33% improvement in performance compared to previous discrete models.

The paper tackles interpreting DCM with image data by addressing data isomorphism.

problem Interpreting DCM with image data due to isomorphic information.
method Proposes and benchmarks two methodologies: architectural adjustments and data source mitigation.
result Direct data source mitigation is more effective for maintaining DCM's interpretability.

Study uses multi-task Bayesian optimization to speed up SVM hyperparameter tuning for nodules diagnosis.

problem Redundant and time-consuming hyperparameter tuning for SVM classifiers in medical imaging.
method Employed multi-task Bayesian optimization to accelerate hyperparameter search.
result Multi-task Bayesian optimization significantly accelerates hyperparameter search.

In discrete differential geometry, it is widely believed that the discrete Gaussian curvature of a polyhedral vertex star equals the algebraic area of its Gauss image. However, no complete proof has yet been described. We present an elementary proof in which we compare, for a particular normal vector, its winding numbe…

2019-09-19abs ↗pdf ↗

The curvature regularities are well-known for providing strong priors in the continuity of edges, which have been applied to a wide range of applications in image processing and computer vision. However, these models are usually non-convex, non-smooth and highly non-linear, the first-order optimal condition of which ar…

2019-12-01abs ↗pdf ↗

New Fourier metrics equivalent to Wasserstein distances in image processing.

problem Equivalence of Fourier-based and Wasserstein metrics in imaging problems.
method Extensions of Fourier-based metrics to handle different centers of mass and discrete measures, showing equivalence to Wasserstein distances.
result New Fourier metrics are equivalent to Wasserstein distances with explicit constants, improving runtime in image processing.

We apply belief propagation to a Bayesian bipartite graph composed of discrete independent hidden variables and discrete visible variables. The network is the Discrete counterpart of Independent Component Analysis (DICA) and it is manipulated in a factor graph form for inference and learning. A full set of simulations …

2015-05-26abs ↗pdf ↗

Deep network predicts action sequences for complex tasks from a scene image.

problem Scalable task and motion planning from initial scene images.
method Deep convolutional recurrent neural network that predicts action sequences.
result Predicts promising action sequences, reducing motion planning problems.

Probabilistic models with discrete latent variables naturally capture datasets composed of discrete classes. However, they are difficult to train efficiently, since backpropagation through discrete variables is generally not possible. We present a novel method to train a class of probabilistic models with discrete late…

2016-09-07abs ↗pdf ↗

We present a general theory of fractal transformations and show how it leads to a new type of method for filtering and transforming digital images. This work substantially generalizes earlier work on fractal tops. The approach involves fractal geometry, chaotic dynamics, and an interplay between discrete and continuous…

2011-02-15abs ↗pdf ↗

Gradient-based framework for optimizing text prompts in diffusion models.

problem Efficiently optimizing prompts in text-to-image diffusion models with large domain space and non-differentiable embeddings.
method Formulated as discrete optimization over language space, designed compact subspaces, and introduced shortcut text gradient.
result Empirically discovered prompts that enhance or destroy image faithfulness.

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…

2019-11-17abs ↗pdf ↗

Paper proposes a method to speed up discrete diffusion models by distilling many steps into few.

problem Challenges in capturing dependencies between elements in discrete diffusion models.
method Proposes 'mixture' models and loss functions to distill many sampling steps into few.
result Effective in distilling pretrained discrete diffusion models across image and language domains.

DDPD separates generation into planning and denoising for improved efficiency.

problem Efficiently denoise corrupted data during generation.
method Separates generation into a planner and denoiser, selecting denoising positions based on corruption severity.
result DDPD outperforms traditional methods on language and image generation benchmarks.

Attempts to build a discrete theory for rational maps on the sphere via circle packing have foundered on discretization effects in locating branch points. The authors remove this impediment by introducing generalized branch points. A generalized branch point need no longer be attached to an individual circle, but with …

2016-07-10abs ↗pdf ↗

Direct optimization of binary latent VAEs achieves competitive results without sampling.

problem Training VAEs with discrete latent variables using standard methods is challenging.
method Applied evolutionary algorithms to directly optimize discrete latent distributions.
result Direct optimization is efficient and competitive in zero-shot learning.

Simplified masked diffusion models improve discrete data generation.

problem Complex model formulations and unclear relationships hinder discrete data generative modeling.
method Developed a simple and general framework for masked diffusion models.
result Models trained on OpenWebText surpass prior diffusion language models and outperform autoregressive models.

Formalizes concepts as latent variables in hierarchical models for high-dimensional data.

problem Lack of formalization and theoretical insights for learning discrete concepts from high-dimensional data.
method Formalizes concepts as latent causal variables in a hierarchical model, formulates conditions for concept identification.
result Conditions for identifying latent hierarchical models in unsupervised data, handling complex structures and high-dimensional data.

Exact guidance for discrete data improves posterior sampling efficiency.

problem Inefficient guidance for discrete data in posterior sampling.
method Derive exact transition rate for desired distribution given learned discrete flow matching model.
result Significantly improved efficiency with single forward pass per sampling step.

Neural networks learn discrete tasks on continuous data via emergent geometry.

problem Understanding how neural networks perform discrete computations on continuous data.
method Analysis of Riemannian pullback metric across neural network layers.
result Neural networks learn to discretize continuous inputs and perform logical operations on these discretized variables.