New approach combines likelihood and adversarial losses for better precipitation predictions.
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.
Trend · papers per month
This paper shows how to perform likelihood inference for complex graphical models efficiently.
Develops likelihood-based methods for trawl processes, improving forecasting accuracy.
Novel approach for SEM in small samples with .
Latent class model (LCM), which is a finite mixture of different categorical distributions, is one of the most widely used models in statistics and machine learning fields. Because of its non-continuous nature and the flexibility in shape, researchers in practice areas such as marketing and social sciences also frequen…
We study likelihood-based methods for distribution regression with deep generative models.
Generates high-quality images using sparse DCT representations.
Likelihood-based generative models are a promising resource to detect out-of-distribution (OOD) inputs which could compromise the robustness or reliability of a machine learning system. However, likelihoods derived from such models have been shown to be problematic for detecting certain types of inputs that significant…
Study on deep learning for speckle noise reduction in imaging modalities.
Supervised topic models utilize document's side information for discovering predictive low dimensional representations of documents. Existing models apply the likelihood-based estimation. In this paper, we present a general framework of max-margin supervised topic models for both continuous and categorical response var…
Unified continuous diffusion model outperforms discrete alternatives in scalability and quality.
Paper proposes robust method to detect risk heterogeneity across ethnic groups.
This paper proposes a unified framework to quantify local and global inferential uncertainty for high dimensional nonparanormal graphical models. In particular, we consider the problems of testing the presence of a single edge and constructing a uniform confidence subgraph. Due to the presence of unknown marginal trans…
The paper analyzes the power of MX CI tests and finds likelihood-based statistics most powerful.
In conventional supervised pattern recognition tasks, model selection is typically accomplished by minimizing the classification error rate on a set of so-called development data, subject to ground-truth labeling by human experts or some other means. In the context of speech processing systems and other large-scale pra…
Deep generative models for graph-structured data offer a new angle on the problem of chemical synthesis: by optimizing differentiable models that directly generate molecular graphs, it is possible to side-step expensive search procedures in the discrete and vast space of chemical structures. We introduce MolGAN, an imp…
We consider training probabilistic classifiers in the case of a large number of classes. The number of classes is assumed too large to perform exact normalisation over all classes. To account for this we consider a simple approach that directly approximates the likelihood. We show that this simple approach works well o…
In a series of recent papers Barndorff-Nielsen and Shephard introduce an attractive class of continuous time stochastic volatility models for financial assets where the volatility processes are functions of positive Ornstein-Uhlenbeck(OU) processes. This models are known to be substantially more flexible than Gaussian …
Proposes a model to generate 3D-aware images from 2D images.
We propose a permutation-invariant loss function designed for the neural networks reconstructing a set of elements without considering the order within its vector representation. Unlike popular approaches for encoding and decoding a set, our work does not rely on a carefully engineered network topology nor by any addit…
Paper proposes methods to learn sub-manifolds and estimate densities in normalizing flows.
EL framework certifies and flags bias in ML models without distributional assumptions.
This paper develops embeddings that preserve likelihood-based statistical inference.
Differentiable resampling improves particle filter performance.
Improved estimation for imbalanced data using log odds correction and optimal sampling.
A new approach uses partial likelihood to improve tree-based density estimation and inference.
Improves sample quality of generative models using energy-based methods.
We model leverage as stochastic but independent of return shocks and of volatility and perform likelihood-based inference via the recently developed iterated filtering algorithm using S&P500 data, contributing new evidence to the still slim empirical support for random leverage variation.
We address the problem of likelihood based inference for correlated diffusion processes using Markov chain Monte Carlo (MCMC) techniques. Such a task presents two interesting problems. First, the construction of the MCMC scheme should ensure that the correlation coefficients are updated subject to the positive definite…
Flexible selective inference using flow-based transport maps.
SkewD robustly discovers causal relationships in skewed noise models.
Paper develops methods for estimating and forecasting integer-valued trawl processes.
The paper addresses speckle noise in coherent imaging systems.
Phylogenetic tree inference using deep DNA sequencing is reshaping our understanding of rapidly evolving systems, such as the within-host battle between viruses and the immune system. Densely sampled phylogenetic trees can contain special features, including "sampled ancestors" in which we sequence a genotype along wit…
New binary AA methods improve on existing techniques.
A fundamental aspect of biological information processing is the ubiquity of sequence-function relationships -- functions that map the sequence of DNA, RNA, or protein to a biochemically relevant activity. Most sequence-function relationships in biology are quantitative, but only recently have experimental techniques f…
Sparse high dimensional graphical model selection is a topic of much interest in modern day statistics. A popular approach is to apply l1-penalties to either (1) parametric likelihoods, or, (2) regularized regression/pseudo-likelihoods, with the latter having the distinct advantage that they do not explicitly assume Ga…
A deep Neyman-Scott process uses Poisson processes for efficient inference in complex point processes.
Paper proposes a surrogate model for efficient experience rating in large insurance portfolios.
Unified framework for binary responses using AUC loss and low-rank constraint.
Efficient neural Bayes estimators for censored peaks-over-threshold models improve inference speed and accuracy.
Develops diffusion models for time-varying correlation on the circle.
New method corrects selection bias in complex models.
BPVAE enhances VAE robustness to OOD inputs.
We introduce an alternative closed form lower bound on the Gaussian process () likelihood based on the Rényi -divergence. This new lower bound can be viewed as a convex combination of the Nyström approximation and the exact . The key advantage of this bound, is its capability to control a…
New findings suggest deep generative models can misclassify outliers, requiring new evaluation methods.
Accurate statistical models of neural spike responses can characterize the information carried by neural populations. But the limited samples of spike counts during recording usually result in model overfitting. Besides, current models assume spike counts to be Poisson-distributed, which ignores the fact that many neur…
In a recent paper [1] we introduced the Fuzzy Bayesian Learning (FBL) paradigm where expert opinions can be encoded in the form of fuzzy rule bases and the hyper-parameters of the fuzzy sets can be learned from data using a Bayesian approach. The present paper extends this work for selecting the most appropriate rule b…