English
Related papers

Related papers: Detecting Low-Degree Truncation

200 papers

We give a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let $p$ be an arbitrary distribution over an interval $I$ which is…

Machine Learning · Computer Science 2013-05-15 Siu-On Chan , Ilias Diakonikolas , Rocco A. Servedio , Xiaorui Sun

We describe a $\tilde{O}(d^{5/6})$-query monotonicity tester for Boolean functions $f:[n]^d \to \{0,1\}$ on the $n$-hypergrid. This is the first $o(d)$ monotonicity tester with query complexity independent of $n$. Motivated by this…

Discrete Mathematics · Computer Science 2019-12-11 Hadley Black , Deeparnab Chakrabarty , C. Seshadhri

A new thresholding method, based on L-statistics and called order thresholding, is proposed as a technique for improving the power when testing against high-dimensional alternatives. The new method allows great flexibility in the choice of…

Statistics Theory · Mathematics 2010-10-21 Min Hee Kim , Michael G. Akritas

Motivated by applications in high-dimensional data analysis where strong signals often stand out easily and weak ones may be indistinguishable from the noise, we develop a statistical framework to provide a novel categorization of the data…

Methodology · Statistics 2013-05-02 X. Jessie Jeng

Unsupervised continual learning aims to learn new tasks incrementally without requiring human annotations. However, most existing methods, especially those targeted on image classification, only work in a simplified scenario by assuming all…

Computer Vision and Pattern Recognition · Computer Science 2022-04-13 Jiangpeng He , Fengqing Zhu

Gradient based optimization methods are the established state-of-the-art paradigm to study strongly entangled quantum systems in two dimensions with Projected Entangled Pair States. However, the key ingredient, the gradient itself, has…

Quantum Physics · Physics 2025-04-15 Anna Francuz , Norbert Schuch , Bram Vanhecke

Learning from data in the presence of outliers is a fundamental problem in statistics. In this work, we study robust statistics in the presence of overwhelming outliers for the fundamental problem of subspace recovery. Given a dataset where…

Data Structures and Algorithms · Computer Science 2020-02-11 Prasad Raghavendra , Morris Yau

Out-of-distribution (OOD) detection aims to detect "unknown" data whose labels have not been seen during the in-distribution (ID) training process. Recent progress in representation learning gives rise to distance-based OOD detection that…

Computer Vision and Pattern Recognition · Computer Science 2023-08-22 Ji Zhang , Lianli Gao , Bingguang Hao , Hao Huang , Jingkuan Song , Hengtao Shen

We study the distributional properties of the linear discriminant function under the assumption of normality by comparing two groups with the same covariance matrix but different mean vectors. A stochastic representation for the…

Statistics Theory · Mathematics 2017-05-09 Taras Bodnar , Stepan Mazur , Edward Ngailo , Nestor Parolya

When using a finite difference method to solve an initial--boundary--value problem, the truncation error is often of lower order at a few grid points near boundaries than in the interior. Normal mode analysis is a powerful tool to analyze…

Numerical Analysis · Mathematics 2018-08-23 Siyang Wang , Anna Nissen , Gunilla Kreiss

When deploying a trained machine learning model in the real world, it is inevitable to receive inputs from out-of-distribution (OOD) sources. For instance, in continual learning settings, it is common to encounter OOD samples due to the…

Machine Learning · Computer Science 2024-01-23 Chuanwen Feng , Wenlong Chen , Ao Ke , Yilong Ren , Xike Xie , S. Kevin Zhou

Label Distribution Learning (LDL) aims to characterize the polysemy of an instance by building a set of descriptive degrees corresponding to the instance. In recent years, researchers seek to model to obtain an accurate label distribution…

Machine Learning · Computer Science 2025-04-03 Pu Wang , Yu Zhang , Zhuoran Zheng

This paper outlines a unified framework for high dimensional variable selection for classification problems. Traditional approaches to finding interesting variables mostly utilize only partial information through moments (like mean…

Methodology · Statistics 2016-11-25 S. Mukhopadhyay , Emanuel Parzen , S. N. Lahiri

Using the intuition that out-of-distribution data have lower likelihoods, a common approach for out-of-distribution detection involves estimating the underlying data distribution. Normalizing flows are likelihood-based generative models…

Machine Learning · Computer Science 2025-01-30 Seyedeh Fatemeh Razavi , Mohammad Mahdi Mehmanchi , Reshad Hosseini , Mostafa Tavassolipour

Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…

Data Structures and Algorithms · Computer Science 2019-08-07 Prasad Raghavendra , Tselil Schramm , David Steurer

Deep neural networks (DNNs) for the semantic segmentation of images are usually trained to operate on a predefined closed set of object classes. This is in contrast to the "open world" setting where DNNs are envisioned to be deployed to.…

Computer Vision and Pattern Recognition · Computer Science 2021-07-28 Robin Chan , Matthias Rottmann , Hanno Gottschalk

Given data drawn from an unknown distribution, $D$, to what extent is it possible to ``amplify'' this dataset and output an even larger set of samples that appear to have been drawn from $D$? We formalize this question as follows: an…

Machine Learning · Computer Science 2024-08-27 Brian Axelrod , Shivam Garg , Vatsal Sharan , Gregory Valiant

Sequential multi-class diagnosis, also known as multi-hypothesis testing, is a classical sequential decision problem with broad applications. However, the optimal solution remains, in general, unknown as the dynamic program suffers from the…

Information Theory · Computer Science 2020-12-07 Jue Wang

High-dimensional planted problems, such as finding a hidden dense subgraph within a random graph, often exhibit a gap between statistical and computational feasibility. While recovering the hidden structure may be statistically possible, it…

Statistics Theory · Mathematics 2026-05-15 Youngtak Sohn , Alexander S. Wein

Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…

Data Structures and Algorithms · Computer Science 2026-02-11 Nick Fischer , Melvin Kallmayer , Leo Wennmann