English
Related papers

Related papers: Ensemble Average Analysis of Non-Adaptive Group Te…

200 papers

Matching is a widely used causal inference design that aims to approximate a randomized experiment using observational data by forming matched sets of treated and control units based on similarities in their covariates. Ideally, treated…

Methodology · Statistics 2026-04-06 Jianan Zhu , Jeffrey Zhang , Zijian Guo , Siyu Heng

To develop a machine sound monitoring system, a method for detecting anomalous sound is proposed. Exact likelihood estimation using Normalizing Flows is a promising technique for unsupervised anomaly detection, but it can fail at…

Audio and Speech Processing · Electrical Eng. & Systems 2021-03-17 Kota Dohi , Takashi Endo , Harsh Purohit , Ryo Tanabe , Yohei Kawaguchi

A distributed adaptive algorithm for estimation of sparse unknown parameters in the presence of nonGaussian noise is proposed in this paper based on normalized least mean fourth (NLMF) criterion. At the first step, local adaptive NLMF…

Information Theory · Computer Science 2015-12-09 Mojtaba Hajiabadi

Sparse signal representations based on linear combinations of learned atoms have been used to obtain state-of-the-art results in several practical signal processing applications. Approximation methods are needed to process high-dimensional…

Machine Learning · Computer Science 2020-02-17 Fredrik Sandin , Sergio Martin-del-Campo

While image-text foundation models have succeeded across diverse downstream tasks, they still face challenges in the presence of spurious correlations between the input and label. To address this issue, we propose a simple three-step…

Computer Vision and Pattern Recognition · Computer Science 2025-08-27 Beier Zhu , Jiequan Cui , Hanwang Zhang , Chi Zhang

The convergence of expectation-maximization (EM)-based algorithms typically requires continuity of the likelihood function with respect to all the unknown parameters (optimization variables). The requirement is not met when parameters…

Signal Processing · Electrical Eng. & Systems 2024-04-18 Geethu Joseph

A sensitivity analysis in an observational study assesses the robustness of significant findings to unmeasured confounding. While sensitivity analyses in matched observational studies have been well addressed when there is a single outcome…

Methodology · Statistics 2015-11-05 Colin B. Fogarty , Dylan S. Small

The problem of detecting anomalies in multiple processes is considered. We consider a composite hypothesis case, in which the measurements drawn when observing a process follow a common distribution with an unknown parameter (vector), whose…

Information Theory · Computer Science 2020-04-22 Bar Hemo , Tomer Gafni , Kobi Cohen , Qing Zhao

We presented an efficient algorithm, fast adaptive flat-histogram ensemble (FAFE), to estimate the density of states (DOS) and to enhance sampling in large systems. FAFE calculates the means of an arbitrary extensive variable $U$ in…

Statistical Mechanics · Physics 2008-11-13 Xin Zhou , Yi Jiang

A common technique to reduce model bias in time-series forecasting is to use an ensemble of predictive models and pool their output into an ensemble forecast. In cases where each predictive model has different biases, however, it is not…

Machine Learning · Computer Science 2023-10-26 Dhruvit Patel , Alexander Wikner

This paper considers the graph signal processing problem of anomaly detection in time series of graphs. We examine two related, complementary inference tasks: the detection of anomalous graphs within a time series, and the detection of…

We consider the problem of inferring the conditional independence graph (CIG) of high-dimensional Gaussian vectors from multi-attribute data. Most existing methods for graph estimation are based on single-attribute models where one…

Machine Learning · Statistics 2025-05-20 Jitendra K Tugnait

This paper studies the sparse identification problem of unknown sparse parameter vectors in stochastic dynamic systems. Firstly, a novel sparse identification algorithm is proposed, which can generate sparse estimates based on least squares…

Optimization and Control · Mathematics 2024-04-02 Ziming Wang , Xinghua Zhu

A nonparametric Bayes approach is proposed for the problem of estimating a sparse sequence based on Gaussian random variables. We adopt the popular two-group prior with one component being a point mass at zero, and the other component being…

Methodology · Statistics 2017-05-31 Yunbo Ouyang , Feng Liang

Model ensembles have long been used in machine learning to reduce the variance in individual model predictions, making them more robust to input perturbations. Pseudo-ensemble methods like dropout have also been commonly used in deep…

Machine Learning · Computer Science 2023-05-31 Pouya Bashivan , Adam Ibrahim , Amirozhan Dehghani , Yifei Ren

There has been a wide interest to extend univariate and multivariate nonparametric procedures to clustered and hierarchical data. Traditionally, parametric mixed models have been used to account for the correlation structures among the…

Statistics Theory · Mathematics 2018-03-02 Jaakko Nevalainen , Denis Larocque , Hannu Oja , Ilkka Pörsti

Falsification is the basis for testing existing hypotheses, and a great danger is posed when results incorrectly reject our prior notions (false positives). Though nonparametric and nonlinear exploratory methods of uncovering coupling…

Methodology · Statistics 2022-06-08 Ameer Ghouse , Gaetano Valenza

In this paper, we study sparse signal detection problems in Degree Corrected Exponential Random Graph Models (ERGMs). We study the performance of two tests based on the conditionally centered sum of degrees and conditionally centered…

Statistics Theory · Mathematics 2021-08-23 Yuanzhe Xu , Sumit Mukherjee

In this paper, we propose a novel framework that combines ensemble learning with augmented graph structures to improve the performance and robustness of semi-supervised node classification in graphs. By creating multiple augmented views of…

Machine Learning · Computer Science 2025-03-25 Maryam Abdolali , Romina Zakerian , Behnam Roshanfekr , Fardin Ayar , Mohammad Rahmati

In this paper, we consider the problem of noiseless non-adaptive group testing under the for-each recovery guarantee, also known as probabilistic group testing. In the case of $n$ items and $k$ defectives, we provide an algorithm attaining…

Information Theory · Computer Science 2020-06-19 Eric Price , Jonathan Scarlett