This paper introduces a new notion of dimensionality of probabilistic models from an information-theoretic view point. We call it the "descriptive dimension"(Ddim). We show that Ddim coincides with the number of independent parameters for the parametric class, and can further be extended to real-valued dimensionality w…
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,657 papers · 148 categories
Trend · papers per month
21 results for “DDIM”
A new algorithm improves posterior sampling for linear inverse problems.
problem Efficiently sampling from posterior distributions in noisy linear inverse problems.
method Proposes \pddim, a DDIM-type sampler that separately samples along singular directions of the measurement operator.
result The method converges to the Bayesian posterior conditioned on the measurements.
Detecting Signs of Model Change with Continuous Model Selection Based on Descriptive Dimensionalitycs.LG
Detects model changes in data streams using Ddim.
problem Early detection of model changes in data streams.
method Continuous model selection based on Ddim.
result Early warning signals of model changes.
PNDMs accelerate DDPMs by treating them as differential equations on manifolds.
problem Accelerate DDPMs while maintaining sample quality.
method Propose pseudo numerical methods (PNDMs) to solve differential equations on manifolds.
result PNDMs generate higher quality images with only 50 steps compared to 1000-step DDIMs (20x speedup).
The paper interprets diffusion models as gradient descent and proposes a new sampler.
problem Improving the efficiency and quality of diffusion models.
method Interprets diffusion models as gradient descent and proposes a new sampler.
result The new sampler achieves state-of-the-art FID scores and generates high quality samples.
The paper shows diffusion models can converge faster to a target distribution with low-dimensional structure.
problem Improving the convergence rate of diffusion models to target distributions.
method Analyzing DDIM and DDPM samplers under low-dimensional structure assumptions.
result The iteration complexities of DDIM and DDPM are no greater than in total variation distance.
Paper accelerates diffusion models, improving sampling speed.
problem Low sampling speed in score-based diffusion models.
method Design of novel training-free algorithms for deterministic and stochastic samplers.
result Accelerated samplers converge faster with improved rates.
New algorithm speeds up diffusion model sampling 4-14 times.
problem Time-consuming sampling from diffusion models.
method Parallelizing autoregressive process through fixed-point iteration.
result ParaTAA reduces inference steps by 4-14 times.
Paper analyzes convergence of DDPM for general distributions.
problem Theoretical understanding of DDPM's convergence properties remains limited.
method Introduced a relaxed smoothness condition and proved near-optimal convergence rates.
result Established a convergence rate of \( \widetilde{O}\left(\frac{d\min\{d,L^2\}}{T^2}
ight) \) in Kullback-Leibler divergence.
New analysis improves convergence guarantees for diffusion-based samplers in Wasserstein distance.
problem Improving convergence guarantees for diffusion-based generative models.
method Simple framework to analyze discretization, initialization, and score estimation errors.
result First Wasserstein convergence bound for the Heun sampler and improved results for Euler sampler.
Improved sampling for Diffusion Models by accounting for covariance.
problem Sampling quality degradation in few-step Diffusion Models.
method Covariance-aware sampler using Tweedie's formula and Fourier-space decomposition.
result Consistently superior samples compared to state-of-the-art samplers.
Restoration-Degradation Beyond Linear Diffusions: A Non-Asymptotic Analysis For DDIM-Type Samplerscs.LG
Develops new bounds for deterministic samplers in diffusion models.
problem Analyzing deterministic samplers in diffusion generative models.
method Operational interpretation of deterministic sampling; restoration and degradation steps.
result First polynomial convergence bounds for DDIM-type samplers.
Efficient methods accelerate diffusion model sampling.
problem Slow sample generation in diffusion models.
method Conjugate Integrators and Splitting Integrators.
result Hybrid method achieves best FID scores.
Unified analysis for deterministic samplers in diffusion models.
problem Challenges in analyzing deterministic samplers for diffusion models.
method Unified convergence analysis framework.
result Achieved polynomial iteration complexity for DDIM-type samplers.
The paper analyzes how guidance affects diffusion models using Gaussian mixture models.
problem Understanding how guidance influences diffusion models in specific contexts.
method Theoretical study using Gaussian mixture models and comparison inequalities for differential equations.
result Guidance boosts classification confidence but reduces distribution diversity, leading to lower differential entropy.
A new first-order sampler improves diffusion probabilistic model sampling quality.
problem The belief that first-order methods are inherently slower for diffusion probabilistic model sampling.
method A novel training-free, first-order sampler that approximates the forward-value evaluation via a one-step lookahead predictor.
result The proposed sampler provably approximates the ideal forward-value trajectory while retaining first-order convergence and can improve sample quality under the same NFE budget.
New samplers reduce NFEs for diffusion models.
problem High NFEs in diffusion models.
method Quasi-Taylor samplers based on ideal derivatives.
result Reduced NFEs for image synthesis.
Improved image generation quality using closed-form discriminator guidance in diffusion models.
problem Enhancing the quality of images generated by diffusion models.
method Theoretical framework to analyze GAN discriminator's effect on Langevin sampling, proposing IPM-GAN optimization as smoothed score-matching.
result Closed-form kernel-based discriminator guidance improves metrics like CLIP-FID and KID.
SPLICE generates accurate time-series imputations with reliable prediction intervals.
problem Lack of reliability guarantees in time-series imputation models.
method Modular framework combining latent generative imputation with distribution-free prediction intervals.
result SPLICE achieves lowest mean Load-only MSE and best CRPS on various datasets.
A new framework RTK accelerates diffusion inference by breaking down the process into fewer, more efficient subproblems.
problem Efficiently generating data from trained diffusion models using discretized reverse SDEs or ODEs.
method Developed a general RTK framework that decomposes the diffusion process into fewer, more balanced subproblems, using MALA and ULD for sampling.
result The RTK-MALA and RTK-ULD algorithms achieve faster convergence rates and lower error compared to existing methods.
Provably Robust Score-Based Diffusion Posterior Sampling for Plug-and-Play Image Reconstructioneess.IV
Develops a robust method for image reconstruction from limited data.
problem Inference of unknown images from few measurements, often ill-posed.
method Introduces DPnP, a diffusion plug-and-play method combining likelihood and score-based samplers.
result Establishes performance guarantees for DPnP, demonstrating robustness and efficiency.