A new algorithm improves model-based reinforcement learning by guiding latent representations.
problem Improving model-based reinforcement learning through additional supervision.
method Proposed a novel asymmetric representation learning objective using latent guidance.
result Significantly improved performance over previous asymmetric approaches.
Gradient guidance improves diffusion models for optimizing specific objectives.
problem Improving diffusion models for specific optimization tasks.
method Established a mathematical framework for gradient-guided diffusion, linking it to optimization theory. Developed a modified gradient guidance method and iteratively fine-tuned version.
result Gradient-guided diffusion models are essentially solutions to regularized optimization problems, preserving latent structure.
New method improves uncertainty quantification in latent variable models.
problem Uncertainty quantification in latent variable models with SGLD-Gibbs.
method Statistical scaling limit theory for SGLD-Gibbs, proposing hyperparameter tuning.
result Explicit guidance on hyperparameter tuning for SGLD-Gibbs ensures meaningful uncertainty quantification.
Unsupervised discovery of latent representations, in addition to being useful for density modeling, visualisation and exploratory data analysis, is also increasingly important for learning features relevant to discriminative tasks. Autoencoders, in particular, have proven to be an effective way to learn latent codes th…
Certified guidance ensures generative models always meet planning objectives.
problem Lack of guarantees for generated outputs satisfying planning objectives.
method Certified guidance modifies generative models without retraining, ensuring outputs meet STL specifications.
result Certified guidance produces models that are always correct, unlike non-certified methods.
Study on DiTs' rates of approximation and estimation under various data assumptions.
problem Investigating statistical rates of conditional diffusion transformers.
method Discretization and Taylor expansion of conditional diffusion score function under Hölder smooth data assumption.
result Establishes statistical limits for conditional and unconditional DiTs, offering practical guidance.
New method guides pretrained diffusion models without additional training.
problem Guidance methods for diffusion models often require extra training or are task-specific.
method Variational Control using Diffusion Trajectory Matching (DTM)
result Achieves state-of-the-art results on various problems.
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.
Improved image translation using asymmetric gradient guidance.
problem Trade-off between style transformation and content preservation in diffusion models.
method Asymmetric gradient guidance to guide reverse diffusion sampling.
result Our method outperforms state-of-the-art models in image translation tasks.
A new method for sampling from posterior distributions in Bayesian inverse problems.
problem Sampling from posterior distributions in Bayesian inverse problems is challenging due to intractable terms.
method Proposes a novel approach that decomposes the transitions, allowing a trade-off between complexity of guidance term and prior transitions.
result Validated through experiments on various inverse problems, including challenging cases with latent diffusion models as priors.
SAMI learns disentangled representations from data.
problem Learning disentangled representations from data.
method Combines diffusion models and VAEs to learn disentangled representations.
result SAMI learns disentangled representations that are interpretable and useful.
Unified framework for self-supervised learning via latent distribution matching.
problem Lack of a unifying theoretical framework for diverse SSL methods.
method Casting SSL as latent distribution matching (LDM): maximizing alignment and uniformity.
result Derives a Bayesian filtering model and proves identifiable latent representations.
High-dimensional diffusion models suffer from distorted samples due to CFG.
problem Distortions in high-dimensional guided diffusion models.
method Analytical tools from statistical physics, dynamic mean-field theory.
result Distortions arise in high-dimensional settings due to class separability issues.
Confidence-based filtering reveals latent structure in diffusion models.
problem Unclear latent structure in diffusion models.
method Confidence scores from a classifier.
result Class-relevant latent structure emerges under confidence-based filtering.
Study on reliability of latent reuse in diffusion models under distribution shift.
problem When can latent spaces from a source dataset be reused for a target dataset with different distributions?
method Considered a source-target setting with approximately low-dimensional datasets near different subspaces. Analyzed the target-domain score error due to principal-angle misalignment and target ambient noise.
result Latent reuse is reliable only if the source and target subspaces are close and the target ambient noise is not too amplified.
Improved autoencoders guide latent sentence representations for better text generation and manipulation.
problem Current autoencoders struggle to maintain coherent latent spaces for meaningful text manipulations.
method Adversarial autoencoders with a denoising objective (DAAE) to guide latent space geometry.
result DAAE provides the best trade-off between generation quality and reconstruction capacity.
Misspecification-Aware Simulation-Based Inference via Side-Channel Guidance
problem Simulation-based inference (SBI) of latent parameters is hindered by simulator misspecification.
method Misspecification-Aware Simulation-Based Inference (MA-SBI) turns side-channel text into a posterior correction.
result MA-SBI matches the oracle posterior across 10 seeds and two backbones.
Generative model disentangles dark matter halo properties.
problem Entangling physical factors in generative model latent spaces.
method Auxiliary-variable-guided framework with halo mass and concentration.
result Reveals mass-concentration scaling relation and identifies unusual halo formation.
Paper compares two methods for inferring network structures in presence of latent confounders.
problem Inferring network structures in presence of latent confounders.
method Gaussian graphical models with latent variables (LVGGM) and PCA-based removal of confounding (PCA+GGM).
result Proposes a new method combining strengths of LVGGM and PCA+GGM, proving consistency and convergence rate.
New model generates realistic single-cell gene expression data.
problem Generating realistic single-cell gene expression profiles is challenging.
method scLDM, a latent diffusion model using Diffusion Transformers and linear interpolants.
result Superior performance in generating realistic single-cell gene expression data.
This work formalizes guidance in diffusion models and introduces a stochastic control framework.
problem Lack of a solid theoretical foundation for guidance scheduling in diffusion models.
method Introduces a stochastic optimal control framework to cast guidance scheduling as an adaptive optimization problem.
result Establishes a principled foundation for more effective guidance in diffusion models.
Framework for training-free guidance in discrete diffusion models for molecular generation.
problem No equivalent training-free guidance methods for discrete diffusion models.
method Framework using guidance functions for discrete data.
result Demonstrated utility on molecular graph generation tasks.
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.
Diffusion models improve sample quality with guidance, proving it works for general data distributions.
problem Theoretical understanding of guidance effect in diffusion models for general data distributions.
method Analyzing diffusion guidance under general data distributions, proving improvement in sample quality.
result Guidance improves the average reciprocal of the classifier probability, aligning with its motivation.
Research shows guidance in diffusion models does not sample from intended distribution, affecting boundary sampling.
problem Clarifying the misconception that guidance modifies the data distribution in diffusion models.
method Rigorous proof and fine-grained analysis of guidance dynamics in two cases: mixtures of compactly supported distributions and mixtures of Gaussians.
result Guidance leads to sampling more heavily from the boundary of the support of the conditional distribution as the parameter increases.
Regression problems assume every instance is annotated (labeled) with a real value, a form of annotation we call \emph{strong guidance}. In order for these annotations to be accurate, they must be the result of a precise experiment or measurement. However, in some cases additional \emph{weak guidance} might be given by…
Unified approach to guided generation techniques.
problem Controlling the generative process of flow/diffusion models.
method Unified posterior and end-to-end guidance techniques.
result Unified posterior guidance as a greedy strategy of end-to-end guidance.
Improved image quality in diffusion models by limiting guidance to a specific noise level range.
problem Improving image quality in diffusion models with guidance.
method Restricting guidance to a specific noise level range.
result Significantly improved FID score from 1.81 to 1.40 in ImageNet-512.
Modified EAT method improves Poisson gradient estimation.
problem Challenging differentiation through Poisson-distributed latent variables.
method Exponential Arrival Time (EAT) simulation with modifications and Gumbel-SoftMax relaxation.
result Modified EAT method provides unbiased first moment and reduced second-moment bias.
New insights into optimizing latent representations in hierarchical VAEs.
problem Optimizing latent representations in hierarchical VAEs for various applications.
method Identifying a general class of inference models and deriving theoretical bounds on performance.
result Guidance for practitioners on optimal regions in rate-space for different applications.
Pixel-space diffusion models outperform latent models on high-resolution image synthesis.
problem Efficiency and quality trade-off in high-resolution image synthesis.
method Sigmoid loss-weighting, simplified architecture, and resolution scaling.
result Achieved 1.5 FID on ImageNet512, new SOTA results on other datasets.
Jeffrey guidance extends diffusion-model control to more complex applications.
problem Controlling diffusion models beyond simple cases like conditional sampling.
method Leveraging Jeffrey's rule of conditioning to update marginal distributions towards a target distribution.
result Significant reductions in FID on CIFAR-10 and FFHQ with Inception embeddings as the target.
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.
New study on guidance in masked diffusion models, showing how it shapes sampling dynamics.
problem Understanding how guidance influences the sampling behavior of masked diffusion models.
method Derived explicit solution to guided reverse dynamics, analyzing effects in 1D and 2D.
result Guidance amplifies class-specific regions and suppresses shared regions, affecting covariance structures.
Proposes a method to learn from historical data for personalized decision-making.
problem Sample hunger in sequential decision-making algorithms for personalized medicine.
method Identifiable latent bandit framework using nonlinear independent component analysis.
result Optimal decision-making with shorter exploration time than classical bandits.
The paper analyzes CFG in masked diffusion models and proposes a new method to improve sample quality.
problem Improving sample quality in conditional generation with CFG in masked diffusion models.
method Analyzing CFG's effect in a low-dimensional masked diffusion model, revealing early-stage guidance harms quality and late-stage improves it. Proposed a novel method to smooth transitions between distributions.
result The proposed method improves sample quality via a simple one-line code change.
SDG uses optimal control to improve classifier guidance in low-density regions.
problem Inefficient guidance in low-density regions of posterior distributions.
method Integrates stochastic optimal control with Stein variational inference to compute the steepest descent direction.
result SDG improves guidance in low-density regions, outperforming standard methods.
New method controls classifier guidance in diffusion models.
problem Improving classifier guidance in diffusion models.
method Cross-entropy control of classifier gradients.
result Effective guidance vectors with mean squared error O(dε). New method for LLMs to learn reasoning by optimizing latent variables.
problem Teaching LLMs to generate logical justifications for answers.
method Formalized reasoning as latent variable model, derived FEM objective, designed sampling schemes.
result Prompt Posterior Sampling (PPS) outperforms other schemes in learning to reason.
Record linkage involves merging records in large, noisy databases to remove duplicate entities. It has become an important area because of its widespread occurrence in bibliometrics, public health, official statistics production, political science, and beyond. Traditional linkage methods directly linking records to one…
In this paper, we study the problem of author identification under double-blind review setting, which is to identify potential authors given information of an anonymized paper. Different from existing approaches that rely heavily on feature engineering, we propose to use network embedding approach to address the proble…
Self-guidance controls image generation by extracting properties from diffusion model representations.
problem Generating images from text descriptions is challenging due to the complexity of visual details.
method Self-guidance uses internal representations of diffusion models to control image generation.
result Properties like object shape, location, and appearance can be extracted and used to steer image generation.
SFG improves on-manifold sampling without labels or additional training.
problem Guiding score-based models on manifolds without labeled data or extra training.
method Developed saddle-free guidance (SFG) that uses curvature of log density estimates.
result SFG achieves state-of-the-art metrics in image generation without labeled data or additional training.
New model for high rank matrix completion with online and batch methods.
problem Matrix completion for high rank matrices with latent structure.
method Kernel trick to map data into a high dimensional feature space, explicit parametrization of low dimensional subspace, online fitting procedure.
result Online method can handle streaming data and adapt to non-stationary latent structure.
New method aligns diffusion models for inference-time properties without retraining.
problem Aligning pre-trained diffusion models for desired inference-time properties.
method Variationally stable Doob's matching for provable guidance estimation.
result Consistent estimator of guidance with non-asymptotic convergence guarantees.
Diffusion models enhance SBI with flexible parameter and observation learning.
problem Efficient and accurate estimation of latent parameters from simulations and real data.
method Score-based diffusion models, guidance, score composition, flow matching, consistency models, joint modeling.
result Flexibility and versatility in modeling various problems.
Proposes a thermodynamic work minimization framework for guiding generative models.
problem Guiding generative models in sparse-data regimes with limited target samples or constraints.
method Regularization framework inspired by thermodynamic work, introducing Path Guidance and Observable Guidance.
result Improves sample efficiency and reduces bias in molecular simulations.
Synthetic tabular data synthesis models balance utility and risk.
problem Generating synthetic tabular data for regulated domains.
method Latent flow models with various learning targets, paths, and sampling methods.
result Velocity and posterior matching objectives yield higher utility, while score and noise matching achieve lower risk.