English
Related papers

Related papers: Score matching estimators for directional distribu…

200 papers

Testing procedures for assessing specific parametric model forms, or for checking the plausibility of simplifying assumptions, play a central role in the mathematical treatment of the uncertain. No certain answers are obtained by testing…

Directional estimation is a common problem in many tracking applications. Traditional filters such as the Kalman filter perform poorly because they fail to take the periodic nature of the problem into account. We present a recursive filter…

Systems and Control · Computer Science 2013-05-01 Gerhard Kurz , Igor Gilitschenski , Simon Julier , Uwe D. Hanebeck

We consider the estimation of Dirichlet Process Mixture Models (DPMMs) in distributed environments, where data are distributed across multiple computing nodes. A key advantage of Bayesian nonparametric models such as DPMMs is that they…

Machine Learning · Statistics 2017-09-20 Ruohui Wang , Dahua Lin

This paper is concerned with general nonlinear regression models where the predictor variables are subject to Berkson-type measurement errors. The measurement errors are assumed to have a general parametric distribution, which is not…

Statistics Theory · Mathematics 2009-08-21 Liqun Wang

Estimating some mathematical expectations from partially observed data and in particular missing outcomes is a central problem encountered in numerous fields such as transfer learning, counterfactual analysis or causal inference. Matching…

Statistics Theory · Mathematics 2025-05-01 Simon Viel , Lionel Truquet , Ikko Yamane

We study the theoretical behavior of denoising score matching--the learning task associated to diffusion models--when the data distribution is supported on a low-dimensional manifold and the score is parameterized using a random feature…

Machine Learning · Computer Science 2026-04-14 Anand Jerry George , Nicolas Macris

We consider the consensual distributed optimization problem in the Riemannian context. Specifically, the minimization of a sum of functions form is studied where each individual function in the sum is located at the node of a network. An…

Optimization and Control · Mathematics 2020-09-08 Suhail M. Shah

One of the most common methods for statistical inference is the maximum likelihood estimator (MLE). The MLE needs to compute the normalization constant in statistical models, and it is often intractable. Using unnormalized statistical…

Statistics Theory · Mathematics 2016-04-26 Takafumi Kanamori , Takashi Takenouchi

We show that the Bregman divergence provides a rich framework to estimate unnormalized statistical models for continuous or discrete random variables, that is, models which do not integrate or sum to one, respectively. We prove that recent…

Machine Learning · Computer Science 2012-02-20 Michael Gutmann , Jun-ichiro Hirayama

Finite mixtures of matrix normal distributions are a powerful tool for classifying three-way data in unsupervised problems. The distribution of each component is assumed to be a matrix variate normal density. The mixture model can be…

Methodology · Statistics 2013-03-07 Cinzia Viroli

By using a certain second order differential equation, the notion of adapted coordinates on Finsler manifolds is defined and some classifications of complete Finsler manifolds are found. Some examples of Finsler metrics, with positive…

Differential Geometry · Mathematics 2008-12-19 A. Asanjarani , B. Bidabad

We propose a Likelihood Matching approach for training diffusion models by first establishing an equivalence between the likelihood of the target data distribution and a likelihood along the sample path of the reverse diffusion. To…

Machine Learning · Statistics 2026-01-23 Lei Qian , Wu Su , Yanqi Huang , Song Xi Chen

A composite likelihood is an inference function derived by multiplying a set of likelihood components. This approach provides a flexible framework for drawing inference when the likelihood function of a statistical model is computationally…

Methodology · Statistics 2024-12-10 Giuseppe Alfonzetti , Ruggero Bellio , Yunxiao Chen , Irini Moustaki

In this paper, the maximum spacing method is considered for multivariate observations. Nearest neighbour balls are used as a multidimensional analogue to univariate spacings. A class of information-type measures is used to generalize the…

Statistics Theory · Mathematics 2019-04-19 Kristi Kuljus , Bo Ranneby

We consider the fundamental problem of matching a template to a signal. We do so by M-estimation, which encompasses procedures that are robust to gross errors (i.e., outliers). Using standard results from empirical process theory, we derive…

Statistics Theory · Mathematics 2020-09-10 Ery Arias-Castro , Lin Zheng

We introduce an optimization model for maximum likelihood-type estimation (M-estimation) that generalizes a large class of existing statistical models, including Huber's concomitant M-estimator, Owen's Huber/Berhu concomitant estimator, the…

Statistics Theory · Mathematics 2018-10-09 Patrick L. Combettes , Christian L. Müller

Many machine learning applications are naturally formulated as optimization problems on Riemannian manifolds. The main idea behind Riemannian optimization is to maintain the feasibility of the variables while moving along a descent…

Optimization and Control · Mathematics 2024-06-05 Andi Han , Pratik Jawanpuria , Bamdev Mishra

This paper considers a simulation-based estimator for a general class of Markovian processes and explores some strong consistency properties of the estimator. The estimation problem is defined over a continuum of invariant distributions…

Probability · Mathematics 2010-01-14 Manuel S. Santos

This paper considers the problem of minimizing the summation of a differentiable function and a nonsmooth function on a Riemannian manifold. In recent years, proximal gradient method and its invariants have been generalized to the…

Optimization and Control · Mathematics 2021-11-16 Wen Huang , Ke Wei

Distribution matching is the process of invertibly mapping a uniformly distributed input sequence onto sequences that approximate the output of a desired discrete memoryless source. The special case of a binary output alphabet and…

Information Theory · Computer Science 2017-12-19 Patrick Schulte , Bernhard C. Geiger