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

0111 · Dec 201219922001200920172026
27 results for DPM

DPM-Solver speeds up DPM sampling to 10-20 function evaluations.

problem Slow sampling from Diffusion Probabilistic Models (DPMs).
method Exact formulation of diffusion ODE solutions, using change-of-variable and exponentially weighted integral.
result Generates high-quality samples in 10-20 function evaluations.

Bayesian models overestimate clusters, but practical summaries can correct this.

problem Bayesian mixture models overestimate the number of clusters.
method Simulations and gene expression data analysis using MCMC summarisation.
result Overestimation is limited in finite samples and can be corrected, but misspecification leads to significant overestimation.

Parallel score matching accelerates DPM training and improves density estimation.

problem Extended training periods and limited modeling flexibility in DPMs.
method Partitioning the learning task into independent time sub-intervals and modeling the score at each time point separately.
result Significant acceleration of training process and improved density estimation performance.

The Dirichlet process mixture (DPM) is a ubiquitous, flexible Bayesian nonparametric statistical model. However, full probabilistic inference in this model is analytically intractable, so that computationally intensive techniques such as Gibb's sampling are required. As a result, DPM-based methods, which have considera…

2014-11-04abs ↗pdf ↗

We define Conditional quasi concave Performance Measures (CPMs), on random variables bounded from below, to accommodate for additional information. Our notion encompasses a wide variety of cases, from conditional expected utility and certainty equivalent to conditional acceptability indexes. We provide the characteriza…

2012-12-17abs ↗pdf ↗

Bayesian Additive Regression Trees (BART) is a fully Bayesian approach to modeling with ensembles of trees. BART can uncover complex regression functions with high dimensional regressors in a fairly automatic way and provide Bayesian quantification of the uncertainty through the posterior. However, BART assumes IID nor…

2018-06-29abs ↗pdf ↗

DPM uses deep learning within PDEs to improve physics predictions from small data.

problem Limited data for machine learning in scientific applications.
method Embeds a neural network within a PDE to learn unknown physics from small datasets.
result DPM outperforms existing models in turbulence predictions using LES.

SA-Solver improves stochastic sampling from DPMs.

problem Efficient sampling from Diffusion Probabilistic Models (DPMs) is time-consuming.
method Proposes SA-Solver, an improved stochastic Adams method for solving diffusion SDE.
result SA-Solver achieves improved or comparable performance compared to SOTA methods for few-step sampling.

Deep Penalty Method solves high-dimensional optimal stopping problems using deep learning.

problem High-dimensional optimal stopping problems in American option pricing.
method Inspired by penalty method for PDEs, approximates penalized PDE with Deep BSDE framework.
result Error bound of DPM is O(1λ)+O(λh)+O(h)O(\frac{1}{\lambda}) + O(\lambda h) + O(\sqrt{h}).

CN-DPM model tackles task-free continual learning for neural networks.

problem Current continual learning methods are limited to task-boundary known settings.
method CN-DPM uses a neural Dirichlet process mixture model for expansion-based task-free learning.
result CN-DPM successfully performs task-free continual learning for image classification and generation.

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.

We present a Bayesian nonparametric framework for multilevel clustering which utilizes group-level context information to simultaneously discover low-dimensional structures of the group contents and partitions groups into clusters. Using the Dirichlet process as the building block, our model constructs a product base-m…

2014-01-09abs ↗pdf ↗

Dirichlet process mixture (DPM) models tend to produce many small clusters regardless of whether they are needed to accurately characterize the data - this is particularly true for large data sets. However, interpretability, parsimony, data storage and communication costs all are hampered by having overly many clusters…

2018-02-15abs ↗pdf ↗

Develops a Bayesian method for causal inference with partly censored time-to-event data.

problem Estimating causal effects with unobserved confounders and measurement errors in partly censored time-to-event data.
method Semiparametric Bayesian instrumental variable analysis using a two-stage Dirichlet process mixture model.
result The proposed method outperforms competing methods in simulations and real-world data analysis.

In this paper we propose novel Deformable Part Networks (DPNs) to learn {\em pose-invariant} representations for 2D object recognition. In contrast to the state-of-the-art pose-aware networks such as CapsNet \cite{sabour2017dynamic} and STN \cite{jaderberg2015spatial}, DPNs can be naturally {\em interpreted} as an effi…

2018-05-22abs ↗pdf ↗