Search Results for author:
Found 6 papers, 4 papers with code
Efficient Combinatorial Optimization via Heat Diffusion
Combinatorial optimization problems are widespread but inherently challenging due to their discrete nature. The primary limitation of existing methods is that they can only access a small fraction of the solution space at each iteration, resulting in limited efficiency for searching the global optimal.
Probabilistic computation and uncertainty quantification with emerging covariance
Building robust, interpretable, and secure AI system requires quantifying and representing uncertainty under a probabilistic perspective to mimic human cognitive abilities.
Preconditioned Score-based Generative Models
Compared with the latest generative models (\eg, CLD-SGM, DDIM, and Analytic-DDIM), PDS can achieve the best sampling quality on CIFAR-10 at a FID score of 1. 99.
Accelerating Score-based Generative Models with Preconditioned Diffusion Sampling
However, a fundamental limitation is that their inference is very slow due to a need for many (e. g., 2000) iterations of sequential computations.
Accelerating Score-based Generative Models for High-Resolution Image Synthesis
To ensure stability of convergence in sampling and generation quality, however, this sequential sampling process has to take a small step size and many sampling iterations (e. g., 2000).
Sampling Before Training: Rethinking the Effect of Edges in the Process of Training Graph Neural Networks
Graph neural networks (GNN) demonstrate excellent performance on many graph-based tasks; however, they also impose a heavy computational burden when trained on a large-scale graph.
