English
Related papers

Related papers: High-Dimensional Regression with Gaussian Mixtures…

200 papers

In this work, we propose to tackle the problem of domain generalization in the context of \textit{insufficient samples}. Instead of extracting latent feature embeddings based on deterministic models, we propose to learn a domain-invariant…

Machine Learning · Computer Science 2024-02-12 Kecheng Chen , Elena Gal , Hong Yan , Haoliang Li

In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of random diffusion problems. Using a standard stochastic collocation scheme, we first approximate the infinite dimensional random problem by a…

Numerical Analysis · Mathematics 2016-06-20 Jonas Ballani , Daniel Kressner , Michael Peters

The high-dimensional data setting, in which p >> n, is a challenging statistical paradigm that appears in many real-world problems. In this setting, learning a compact, low-dimensional representation of the data can substantially help…

Machine Learning · Computer Science 2018-08-07 Micol Marchetti-Bowick , Benjamin J. Lengerich , Ankur P. Parikh , Eric P. Xing

Well-calibrated probabilistic regression models are a crucial learning component in robotics applications as datasets grow rapidly and tasks become more complex. Unfortunately, classical regression models are usually either probabilistic…

Machine Learning · Computer Science 2023-09-12 Hany Abdulsamad , Peter Nickl , Pascal Klink , Jan Peters

Latent Gaussian models have a rich history in statistics and machine learning, with applications ranging from factor analysis to compressed sensing to time series analysis. The classical method for maximizing the likelihood of these models…

Machine Learning · Computer Science 2023-06-07 Alexander Lin , Bahareh Tolooshams , Yves Atchadé , Demba Ba

In this paper, we propose a method for the approximation of the solution of high-dimensional weakly coercive problems formulated in tensor spaces using low-rank approximation formats. The method can be seen as a perturbation of a minimal…

Numerical Analysis · Mathematics 2015-02-13 Marie Billaud-Friess , Anthony Nouy , Olivier Zahm

Unsupervised learning aims at the discovery of hidden structure that drives the observations in the real world. It is essential for success in modern machine learning. Latent variable models are versatile in unsupervised learning and have…

Machine Learning · Computer Science 2016-06-13 Furong Huang

Approximate Bayesian inference on the basis of summary statistics is well-suited to complex problems for which the likelihood is either mathematically or computationally intractable. However the methods that use rejection suffer from the…

Computation · Statistics 2010-05-04 M. G. B. Blum , O. Francois

We study the problem of treatment effect estimation in randomized experiments with high-dimensional covariate information, and show that essentially any risk-consistent regression adjustment can be used to obtain efficient estimates of the…

Methodology · Statistics 2022-06-08 Stefan Wager , Wenfei Du , Jonathan Taylor , Robert Tibshirani

We propose a likelihood ratio based inferential framework for high dimensional semiparametric generalized linear models. This framework addresses a variety of challenging problems in high dimensional data analysis, including incomplete…

Machine Learning · Statistics 2015-11-24 Yang Ning , Tianqi Zhao , Han Liu

In recent years, data dimensionality has increasingly become a concern, leading to many parameter and dimension reduction techniques being proposed in the literature. A parameter-wise co-clustering model, for data modelled via continuous…

Machine Learning · Statistics 2020-10-01 M. P. B. Gallaugher , C. Biernacki , P. D. McNicholas

This paper aims to front with dimensionality reduction in regression setting when the predictors are a mixture of functional variable and high-dimensional vector. A flexible model, combining both sparse linear ideas together with…

Statistics Theory · Mathematics 2024-01-29 Silvia Novo , Germán Aneiros , Philippe Vieu

High-dimensional time series data appear in many scientific areas in the current data-rich environment. Analysis of such data poses new challenges to data analysts because of not only the complicated dynamic dependence between the series,…

Methodology · Statistics 2022-06-22 Di Wang , Ruey S. Tsay

Latent variable models for ordinal data represent a useful tool in different fields of research in which the constructs of interest are not directly observable. In such models, problems related to the integration of the likelihood function…

Methodology · Statistics 2012-06-26 Silvia Bianconcini , Silvia Cagnone

Quadratic regression goes beyond the linear model by simultaneously including main effects and interactions between the covariates. The problem of interaction estimation in high dimensional quadratic regression has received extensive…

Methodology · Statistics 2019-01-23 Cheng Wang , Binyan Jiang , Liping Zhu

To address the common problem of high dimensionality in tensor regressions, we introduce a generalized tensor random projection method that embeds high-dimensional tensor-valued covariates into low-dimensional subspaces with minimal loss of…

Methodology · Statistics 2025-10-03 Roberto Casarin , Radu Craiu , Qing Wang

Sliced inverse regression is a popular tool for sufficient dimension reduction, which replaces covariates with a minimal set of their linear combinations without loss of information on the conditional distribution of the response given the…

Machine Learning · Statistics 2018-09-18 Kean Ming Tan , Zhaoran Wang , Tong Zhang , Han Liu , R. Dennis Cook

Advancements in modern science have led to the increasing availability of non-Euclidean data in metric spaces. This paper addresses the challenge of modeling relationships between non-Euclidean responses and multivariate Euclidean…

Methodology · Statistics 2025-05-13 Su I Iao , Yidong Zhou , Hans-Georg Müller

In this paper, we study the problem of estimating latent variable models with arbitrarily corrupted samples in high dimensional space ({\em i.e.,} $d\gg n$) where the underlying parameter is assumed to be sparse. Specifically, we propose a…

Machine Learning · Statistics 2020-10-20 Di Wang , Xiangyu Guo , Shi Li , Jinhui Xu

We consider the problem of computing a Gaussian approximation to the posterior distribution of a parameter given a large number N of observations and a Gaussian prior, when the dimension of the parameter d is also large. To address this…

Data Structures and Algorithms · Computer Science 2023-03-28 Marc Lambert , Silvère Bonnabel , Francis Bach
‹ Prev 1 3 4 5 6 7 10 Next ›