English
Related papers

Related papers: Sparse Identification of Posynomial Models

200 papers

We consider real polynomials in finitely many variables. Let the variables consist of finitely many blocks that are allowed to overlap in a certain way. Let the solution set of a finite system of polynomial inequalities be given where each…

Optimization and Control · Mathematics 2007-05-23 David Grimm , Tim Netzer , Markus Schweighofer

The challenges for non-intrusive methods for Polynomial Chaos modeling lie in the computational efficiency and accuracy under a limited number of model simulations. These challenges can be addressed by enforcing sparsity in the series…

Machine Learning · Statistics 2020-06-24 Panagiotis Tsilifis , Iason Papaioannou , Daniel Straub , Fabio Nobile

A widely used method to create a continuous representation of a discrete data-set is regression analysis. When the regression model is not based on a mathematical description of the physics underlying the data, heuristic techniques play a…

Statistics Theory · Mathematics 2013-07-18 Giovanni Mana , Paolo Alberto Giuliano Albo , Simona Lago

Ordinary differential equations (ODE) have been widely used for modeling dynamical complex systems. For high-dimensional ODE models where the number of differential equations is large, it remains challenging to estimate the ODE parameters…

Methodology · Statistics 2022-06-20 Muye Nanshan , Nan Zhang , Xiaolei Xun , Jiguo Cao

The Gaussian Process Latent Variable Model (GP-LVM) is a non-linear probabilistic method of embedding a high dimensional dataset in terms low dimensional `latent' variables. In this paper we illustrate that maximum a posteriori (MAP)…

Machine Learning · Statistics 2013-07-02 James Barrett , Anthony C. C. Coolen

Approximate vanishing ideal is a concept from computer algebra that studies the algebraic varieties behind perturbed data points. To capture the nonlinear structure of perturbed points, the introduction of approximation to exact vanishing…

Machine Learning · Statistics 2019-11-11 Hiroshi Kera , Yoshihiko Hasegawa

Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. They were first dedicated to linear variable selection but numerous extensions have now emerged such as structured sparsity or kernel…

Machine Learning · Computer Science 2011-11-24 Francis Bach , Rodolphe Jenatton , Julien Mairal , Guillaume Obozinski

One fundamental goal of high-dimensional statistics is to detect or recover planted structure (such as a low-rank matrix) hidden in noisy data. A growing body of work studies low-degree polynomials as a restricted model of computation for…

Statistics Theory · Mathematics 2022-06-22 Tselil Schramm , Alexander S. Wein

Selecting interpretable feature sets in underdetermined ($n \ll p$) and highly correlated regimes constitutes a fundamental challenge in data science, particularly when analyzing physical measurements. In such settings, multiple distinct…

Machine Learning · Computer Science 2026-02-10 Kateřina Henclová , Václav Šmídl

Gaussian processes (GPs) provide a framework for Bayesian inference that can offer principled uncertainty estimates for a large range of problems. For example, if we consider regression problems with Gaussian likelihoods, a GP model enjoys…

Machine Learning · Computer Science 2022-12-21 Felix Leibfried , Vincent Dutordoir , ST John , Nicolas Durrande

Mixture models are widely used to fit complex and multimodal datasets. In this paper we study mixtures with high dimensional sparse latent parameter vectors and consider the problem of support recovery of those vectors. While parameter…

Machine Learning · Computer Science 2022-09-13 Arya Mazumdar , Soumyabrata Pal

It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…

Optimization and Control · Mathematics 2021-06-14 Yibo Xu , Warren Adams , Akshay Gupte

In a polynomial regression model, the divisibility conditions implicit in polynomial hierarchy give way to a natural construction of constraints for the model parameters. We use this principle to derive versions of strong and weak hierarchy…

Computation · Statistics 2020-01-23 Hugo Maruri-Aguilar , Simon Lunagomez

In this work we study convergence properties of sparse polynomial approximations for a class of affine parametric saddle point problems. Such problems can be found in many computational science and engineering fields, including the Stokes…

Numerical Analysis · Mathematics 2018-09-28 Peng Chen , Omar Ghattas

Two complementary approaches have been extensively used in signal and image processing leading to novel results, the sparse representation methodology and the variational strategy. Recently, a new sparsity based model has been proposed, the…

Computer Vision and Pattern Recognition · Computer Science 2015-08-17 Raja Giryes , Michael Elad , Alfred M. Bruckstein

Sparse regression has recently emerged as an attractive approach for discovering models of spatiotemporally complex dynamics directly from data. In many instances, such models are in the form of nonlinear partial differential equations…

Dynamical Systems · Mathematics 2020-01-29 Patrick A. K. Reinbold , Daniel R. Gurevich , Roman O. Grigoriev

We study the theoretical properties of the fused lasso procedure originally proposed by \cite{tibshirani2005sparsity} in the context of a linear regression model in which the regression coefficient are totally ordered and assumed to be…

Statistics Theory · Mathematics 2023-06-28 Fan Wang , Oscar Hernan Madrid Padilla , Yi Yu , Alessandro Rinaldo

Anomalies and outliers are common in real-world data, and they can arise from many sources, such as sensor faults. Accordingly, anomaly detection is important both for analyzing the anomalies themselves and for cleaning the data for further…

Machine Learning · Statistics 2018-11-13 Haitao Liu , Randy C. Paffenroth , Jian Zou , Chong Zhou

Sparse system identification is the data-driven process of obtaining parsimonious differential equations that describe the evolution of a dynamical system, balancing model complexity and accuracy. There has been rapid innovation in system…

Machine Learning · Computer Science 2023-02-22 Alan A. Kaptanoglu , Lanyue Zhang , Zachary G. Nicolaou , Urban Fasel , Steven L. Brunton

Synthesis problems for linkages in kinematics often yield large structured parameterized polynomial systems which generically have far fewer solutions than traditional upper bounds would suggest. This paper describes statistical models for…

Robotics · Computer Science 2020-10-05 Jonathan D. Hauenstein , Samantha N. Sherman