English
Related papers

Related papers: Downsampling for Testing and Learning in Product D…

200 papers

There are many high dimensional function classes that have fast agnostic learning algorithms when assumptions on the distribution of examples can be made, such as Gaussianity or uniformity over the domain. But how can one be confident that…

Machine Learning · Computer Science 2022-11-22 Ronitt Rubinfeld , Arsen Vasilyan

Distribution testing is a fundamental statistical task with many applications, but we are interested in a variety of problems where systematic mislabelings of the sample prevent us from applying the existing theory. To apply distribution…

Data Structures and Algorithms · Computer Science 2023-04-05 Renato Ferreira Pinto , Nathaniel Harms

A $k$-modal probability distribution over the discrete domain $\{1,...,n\}$ is one whose histogram has at most $k$ "peaks" and "valleys." Such distributions are natural generalizations of monotone ($k=0$) and unimodal ($k=1$) probability…

Data Structures and Algorithms · Computer Science 2014-09-16 Constantinos Daskalakis , Ilias Diakonikolas , Rocco A. Servedio

We revisit the fundamental problem of learning with distribution shift, in which a learner is given labeled samples from training distribution $D$, unlabeled samples from test distribution $D'$ and is asked to output a classifier with low…

Data Structures and Algorithms · Computer Science 2024-05-22 Adam R. Klivans , Konstantinos Stavropoulos , Arsen Vasilyan

In the real world, a learning system could receive an input that is unlike anything it has seen during training. Unfortunately, out-of-distribution samples can lead to unpredictable behaviour. We need to know whether any given input belongs…

Machine Learning · Computer Science 2019-08-21 Alireza Shafaei , Mark Schmidt , James J. Little

In traditional models of supervised learning, the goal of a learner -- given examples from an arbitrary joint distribution on $\mathbb{R}^d \times \{\pm 1\}$ -- is to output a hypothesis that is competitive (to within $\epsilon$) of the…

Machine Learning · Computer Science 2025-05-02 Gautam Chandrasekaran , Adam Klivans , Vasilis Kontonis , Raghu Meka , Konstantinos Stavropoulos

We study the problem of learning a distribution from samples, when the underlying distribution is a mixture of product distributions over discrete domains. This problem is motivated by several practical applications such as crowd-sourcing,…

Machine Learning · Statistics 2014-05-20 Prateek Jain , Sewoong Oh

Most work on supervised learning research has focused on marginal predictions. In decision problems, joint predictive distributions are essential for good performance. Previous work has developed methods for assessing low-order predictive…

Machine Learning · Statistics 2022-03-01 Ian Osband , Zheng Wen , Seyed Mohammad Asghari , Vikranth Dwaracherla , Xiuyuan Lu , Benjamin Van Roy

The framework of distribution testing is currently ubiquitous in the field of property testing. In this model, the input is a probability distribution accessible via independently drawn samples from an oracle. The testing task is to…

Data Structures and Algorithms · Computer Science 2022-09-22 Sourav Chakraborty , Eldar Fischer , Arijit Ghosh , Gopinath Mishra , Sayantan Sen

In this paper, we consider the problem of testing properties of joint distributions under the Conditional Sampling framework. In the standard sampling model, the sample complexity of testing properties of joint distributions is exponential…

Computational Complexity · Computer Science 2022-08-03 Rishiraj Bhattacharyya , Sourav Chakraborty

We study a new framework for property testing of probability distributions, by considering distribution testing algorithms that have access to a conditional sampling oracle.* This is an oracle that takes as input a subset $S \subseteq [N]$…

Data Structures and Algorithms · Computer Science 2015-01-19 Clement Canonne , Dana Ron , Rocco A. Servedio

We consider a distributionally robust formulation of stochastic optimization problems arising in statistical learning, where robustness is with respect to uncertainty in the underlying data distribution. Our formulation builds on…

Optimization and Control · Mathematics 2021-06-09 Mert Gürbüzbalaban , Andrzej Ruszczyński , Landi Zhu

We study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution $D$ over $[n]$ and a property $\mathcal{P}$, the goal is to distinguish between…

Data Structures and Algorithms · Computer Science 2016-01-22 Clément L. Canonne , Ilias Diakonikolas , Themis Gouleakis , Ronitt Rubinfeld

We study the problem of Out-of-Distribution (OOD) detection, that is, detecting whether a learning algorithm's output can be trusted at inference time. While a number of tests for OOD detection have been proposed in prior work, a formal…

Machine Learning · Statistics 2023-09-19 Akshayaa Magesh , Venugopal V. Veeravalli , Anirban Roy , Susmit Jha

We present an algorithm for testing halfspaces over arbitrary, unknown rotation-invariant distributions. Using $\tilde O(\sqrt{n}\epsilon^{-7})$ random examples of an unknown function $f$, the algorithm determines with high probability…

Data Structures and Algorithms · Computer Science 2018-11-02 Nathaniel Harms

We extend the learning from demonstration paradigm by providing a method for learning unknown constraints shared across tasks, using demonstrations of the tasks, their cost functions, and knowledge of the system dynamics and control…

Robotics · Computer Science 2019-02-22 Glen Chou , Dmitry Berenson , Necmiye Ozay

A remarkable recent paper by Rubinfeld and Vasilyan (2022) initiated the study of \emph{testable learning}, where the goal is to replace hard-to-verify distributional assumptions (such as Gaussianity) with efficiently testable ones and to…

Machine Learning · Computer Science 2022-11-28 Aravind Gollakota , Adam R. Klivans , Pravesh K. Kothari

In this work, we give a novel general approach for distribution testing. We describe two techniques: our first technique gives sample-optimal testers, while our second technique gives matching sample lower bounds. As a consequence, we…

Data Structures and Algorithms · Computer Science 2016-05-10 Ilias Diakonikolas , Daniel M. Kane

We give the first efficient algorithm for learning halfspaces in the testable learning model recently defined by Rubinfeld and Vasilyan (2023). In this model, a learner certifies that the accuracy of its output hypothesis is near optimal…

Machine Learning · Computer Science 2023-03-14 Aravind Gollakota , Adam R. Klivans , Konstantinos Stavropoulos , Arsen Vasilyan

We study the problem of learning a mixture model of non-parametric product distributions. The problem of learning a mixture model is that of finding the component distributions along with the mixing weights using observed samples generated…

Signal Processing · Electrical Eng. & Systems 2019-04-03 Nikos Kargas , Nicholas D. Sidiropoulos
‹ Prev 1 2 3 10 Next ›