English
Related papers

Related papers: Outlier Robust Multivariate Polynomial Regression

200 papers

In offline reinforcement learning (RL), the absence of active exploration calls for attention on the model robustness to tackle the sim-to-real gap, where the discrepancy between the simulated and deployed environments can significantly…

Machine Learning · Computer Science 2024-06-28 He Wang , Laixi Shi , Yuejie Chi

We consider the variable selection problem in linear regression. Suppose that we have a set of random variables $X_1,...,X_m,Y,\epsilon$ such that $Y=\sum_{k\in \pi}\alpha_kX_k+\epsilon$ with $\pi\subseteq \{1,...,m\}$ and $\alpha_k\in…

Statistics Theory · Mathematics 2010-12-21 Joe Suzuki

We study the problem of high-dimensional linear regression in a robust model where an $\epsilon$-fraction of the samples can be adversarially corrupted. We focus on the fundamental setting where the covariates of the uncorrupted samples are…

Machine Learning · Computer Science 2018-06-04 Ilias Diakonikolas , Weihao Kong , Alistair Stewart

In "Unlabeled Sensing", one observes a set of linear measurements of an underlying signal with incomplete or missing information about their ordering, which can be modeled in terms of an unknown permutation. Previous work on the case of a…

Information Theory · Computer Science 2020-07-14 Hang Zhang , Martin Slawski , Ping Li

We propose an outlier robust multivariate time series model which can be used for detecting previously unseen anomalous sounds based on noisy training data. The presented approach doesn't assume the presence of labeled anomalies in the…

Sound · Computer Science 2022-02-07 Wo Jae Lee , Karim Helwani , Arvindh Krishnaswamy , Srikanth Tenneti

We consider the problem of efficiently solving a system of $n$ non-linear equations in ${\mathbb R}^d$. Addressing Smale's 17th problem stated in 1998, we consider a setting whereby the $n$ equations are random homogeneous polynomials of…

Data Structures and Algorithms · Computer Science 2024-12-10 Andrea Montanari , Eliran Subag

A basic model in sequential decision making is the Markov decision process (MDP), which is extended to Robust MDPs (RMDPs) by allowing uncertainty in transition probabilities and optimizing against the worst-case transition probabilities…

Computational Complexity · Computer Science 2026-05-11 Ali Asadi , Krishnendu Chatterjee , Alipasha Montaseri , Ali Shafiee

We study the minimum number of constraints needed to formulate random instances of the maximum stable set problem via linear programs (LPs), in two distinct models. In the uniform model, the constraints of the LP are not allowed to depend…

Computational Complexity · Computer Science 2016-10-26 Gábor Braun , Samuel Fiorini , Sebastian Pokutta

Regression is the workhorse of statistics, and is often faced with real data that contain outliers. When these are casewise outliers, that is, cases that are entirely wrong or belong to a different population, the issue can be remedied by…

Methodology · Statistics 2026-03-06 Jakob Raymaekers , Peter J. Rousseeuw

We consider a basic problem in unsupervised learning: learning an unknown \emph{Poisson Binomial Distribution}. A Poisson Binomial Distribution (PBD) over $\{0,1,\dots,n\}$ is the distribution of a sum of $n$ independent Bernoulli random…

Data Structures and Algorithms · Computer Science 2015-02-18 Constantinos Daskalakis , Ilias Diakonikolas , Rocco A. Servedio

Classical multivariate statistics measures the outlyingness of a point by its Mahalanobis distance from the mean, which is based on the mean and the covariance matrix of the data. A multivariate depth function is a function which, given a…

Methodology · Statistics 2021-05-06 Karl Mosler , Pavlo Mozharovskyi

Let $\mathscr{F}_{n,d}$ be the class of all functions $f:\{-1,1\}^n\to[-1,1]$ on the $n$-dimensional discrete hypercube of degree at most $d$. In the first part of this paper, we prove that any (deterministic or randomized) algorithm which…

Machine Learning · Computer Science 2024-10-23 Alexandros Eskenazis , Paata Ivanisvili , Lauritz Streck

In the random geometric graph model $\mathsf{Geo}_d(n,p)$, we identify each of our $n$ vertices with an independently and uniformly sampled vector from the $d$-dimensional unit sphere, and we connect pairs of vertices whose vectors are…

Probability · Mathematics 2021-11-23 Siqi Liu , Sidhanth Mohanty , Tselil Schramm , Elizabeth Yang

We study the convergence of a random iterative sequence of a family of operators on infinite dimensional Hilbert spaces, inspired by the Stochastic Gradient Descent (SGD) algorithm in the case of the noiseless regression, as studied in [1].…

Functional Analysis · Mathematics 2022-09-02 Soumyadip Ghosh , Yingdong Lu , Tomasz J. Nowicki

Nonparametric regression models offer a way to understand and quantify relationships between variables without having to identify an appropriate family of possible regression functions. Although many estimation methods for these models have…

Methodology · Statistics 2023-04-07 Matias Salibian-Barrera

We provide an algorithm for properly learning mixtures of two single-dimensional Gaussians without any separability assumptions. Given $\tilde{O}(1/\varepsilon^2)$ samples from an unknown mixture, our algorithm outputs a mixture that is…

Data Structures and Algorithms · Computer Science 2014-05-20 Constantinos Daskalakis , Gautam Kamath

The paper studies upper bounds for the total variation distance between two polynomials of a special form in random vectors satisfying the Doeblin-type condition. Our approach is based on the recent results concerning Nikolskii--Besov-type…

Probability · Mathematics 2023-08-07 Egor Kosov , Anastasia Zhukova

Robust estimators of large covariance matrices are considered, comprising regularized (linear shrinkage) modifications of Maronna's classical M-estimators. These estimators provide robustness to outliers, while simultaneously being…

Statistics Theory · Mathematics 2018-07-04 Nicolas Auguin , David Morales-Jimenez , Matthew R. McKay , Romain Couillet

Recent progress in deep latent variable models has largely been driven by the development of flexible and scalable variational inference methods. Variational training of this type involves maximizing a lower bound on the log-likelihood,…

Machine Learning · Computer Science 2016-06-02 Andriy Mnih , Danilo J. Rezende

We say that a classifier is \emph{adversarially robust} to perturbations of norm $r$ if, with high probability over a point $x$ drawn from the input distribution, there is no point within distance $\le r$ from $x$ that is classified…

Data Structures and Algorithms · Computer Science 2025-05-21 Jane Lange , Arsen Vasilyan