Paper uses DNN-based MoM-GAN to estimate contaminated data distributions.
problem Estimating distributions of data with outliers or contamination.
method Combines GAN and MoM estimation with DNN for modeling.
result DNN-based MoM-GAN achieves better error bounds than other methods.
Paper shows MoM is optimal under adversarial contamination for certain distributions.
problem Optimality of MoM under adversarial contamination.
method Upper and lower bounds for MoM's error under adversarial contamination.
result MoM is (minimax) optimal for distributions with finite variance and infinite variance with finite absolute moments.
This paper is the first in a series whose goal is to understand the structure of low-volume complete orientable hyperbolic 3-manifolds. Here we introduce Mom technology and enumerate the hyperbolic Mom-n manifolds for n <= 4.
This work robustifies Wasserstein distance estimation with MoM estimators for outlier-polluted data.
problem Estimating Wasserstein distance between two distributions with outliers.
method Introducing MoM-based robust estimators for Wasserstein distance.
result Consistent MoM-based estimators for Wasserstein distance with convergence rates.
This is an expository paper on Mom-technology, describing the recent work of the authors in this area (found in arXiv:math/0606072, arXiv:0705.4325, and arXiv:0809.0346) concerning the use of Mom-technology to find the minimum-volume compact hyperbolic 3-manifold and the 10 smallest cusped hyperbolic 3-manifolds. In ad…
The so-called Mom-structures on hyperbolic cusped 3-manifolds without boundary were introduced by Gabai, Meyerhoff, and Milley, and used by them to identify the smallest closed hyperbolic manifold. In this work we extend the notion of a Mom-structure to include the case of 3-manifolds with non-empty boundary that does …
We enumerate the small-volume manifolds that can be obtained by Dehn filling on Mom-2 and Mom-3 manifolds as defined by Gabai, Meyerhoff, and the author. In so doing we complete the proof that the Weeks manifold is the minimum-volume compact hyperbolic 3-manifold, as well as enumerating the 10 smallest one-cusped hyper…
Paper introduces MoM-KDE for robust density estimation robust to anomalous data.
problem Density estimation robustness to anomalous data.
method Combines Kernel Density Estimation and Median-of-Means principle.
result Achieves competitive results with lower computational complexity compared to other robust estimators.
Paper improves statistical efficiency of median-of-means estimator for Byzantine robust distributed inference.
problem Byzantine robustness in distributed learning systems.
method Variance reduced median-of-means (VRMOM) estimator for Byzantine robust distributed inference.
result Achieves a fast convergence rate with only a constant number of rounds of communications.
Study improves generalization bounds for machine learning models in the presence of outliers.
problem Improving model robustness against outliers in machine learning.
method Median-of-Means (MoM) estimator and concentration properties analysis under contamination.
result Derives generalization guarantees for pairwise learning in contaminated data.
Improved MoM estimator enhances classical shadows protocol for quantum measurements.
problem Efficient estimation of expectation values with reduced measurement shots.
method Modified median-of-means estimator with optimal constants and U-statistics.
result Improved performance of modified estimator for Clifford measurements.
New robust estimators achieve subgaussian bounds using VC-dimension.
problem Robust estimation of sparse and corrupted data.
method Use of VC-dimension to measure statistical complexity.
result First robust estimators for sparse estimation with subgaussian rate.
New method robustifies topological data analysis against outliers.
problem Outliers make topological data analysis unstable.
method Proposed a robust distance function (MoM Dist) for persistent homology.
result MoM Dist sublevel filtrations and weighted filtrations are consistent estimators in adversarial settings.
Paper proposes robust compressed sensing using generative models.
problem Estimating high-dimensional vectors from noisy linear equations with heavy-tailed or outlier data.
method Inspired by Median-of-Means (MOM), proposes an algorithm for robust recovery.
result Guarantees recovery for heavy-tailed data, even in the presence of outliers.
Introduces robust convex clustering with Median of Means for better data clustering.
problem Challenges in convex clustering with high-dimensional data and noise/outliers.
method Integrates convex clustering with Median of Means estimator for robustness and efficiency.
result Enhanced clustering performance on large-scale datasets compared to existing methods.
A new PCA method robust to outliers using Median of Means.
problem PCA's failure to detect true structure in noisy data.
method Median of Means (MoM) approach for robust PCA.
result Achieves optimal convergence rates without assumptions on outliers.
Unified framework for robust clustering under various dissimilarity measures.
problem Improving center-based clustering methods to handle outliers and non-Euclidean data.
method Median-of-Means (MoM) estimation framework with uniform concentration bounds.
result Strong consistency and error rate of O(n−1/2) under mild conditions. This paper is the second in a series whose goal is to understand the structure of low-volume complete orientable hyperbolic 3-manifolds. Using Mom technology, we prove that any one-cusped hyperbolic 3-manifold with volume <= 2.848 can be obtained by a Dehn filling on one of 21 cusped hyperbolic 3-manifolds. We also sho…
This paper extends Median-of-Means to new learning problems involving pairwise comparisons.
problem Learning from pairwise comparisons in machine learning.
method Segmenting data into blocks, comparing pairs of decision rules, and declaring the winner based on majority performance.
result The Median-of-Means approach maintains robustness and performance under various sampling schemes.
New method improves mean estimation for heavy-tailed data.
problem Estimating mean of heavy-tailed distributions.
method Median-of-Means (MoM) with symmetrization technique.
result Improved sample complexity bound for mean estimation.
This paper analyzes EM algorithm for softmax mixture models in high dimensions.
problem Modeling heterogeneous populations choosing from multiple attributes.
method Comprehensive analysis of the EM algorithm for softmax mixture models (SMMs), proving identifiability and convergence.
result EM algorithm recovers mixture atoms at near-parametric rate under suitable initialization.
New algorithm robustly learns from corrupted demonstrations, even with constant fraction of noise.
problem Learning from corrupted demonstrations where a fraction of data is noise or outliers.
method Proposes a novel robust algorithm using a Median-of-Means (MOM) objective.
result Guarantees accurate policy estimation even with constant fraction of outliers, similar to classical methods in expert demonstration settings.
NeuroMemFPP uses LSTM to estimate FPP parameters with high accuracy.
problem Estimating parameters of fractional Poisson process with memory and long-range dependence.
method Recurrent Neural Network (RNN), specifically Long Short-Term Memory (LSTM), for parameter estimation.
result The LSTM-based approach reduces MSE by about 55.3% compared to traditional MOM method.
We propose a method of moments (MoM) algorithm for training large-scale implicit generative models. Moment estimation in this setting encounters two problems: it is often difficult to define the millions of moments needed to learn the model parameters, and it is hard to determine which properties are useful when specif…
The Kalman filter and Heston model are used to estimate asset prices and trading performance.
problem Estimating asset prices using stochastic models.
method Kalman filter applied to mean-reverting processes and Heston model with method of moments.
result The Kalman filter and Heston model provide effective methods for estimating asset prices and trading performance.
Paper improves spectral learning of HMMs to avoid local optima and improve robustness.
problem Spectral learning of HMMs can get stuck in local optima and degrade due to unchecked error propagation.
method Developed a novel algorithm (PSHMM) and online learning variants to mitigate error propagation and nonstationarity.
result PSHMM provides more robust estimation and forecasting compared to SHMM and B-W algorithm.
IGNIS uses neural networks to estimate copula parameters robustly.
problem Pathological properties of Archimedean copulas make traditional estimators brittle.
method Unified neural estimation framework with multi-input architecture and softplus output layer.
result Accurate and stable estimates for real-world datasets.
We propose a new clustering algorithm that is robust to the presence of outliers in the dataset. We perform Lloyd-type iterations with robust estimates of the centroids. More precisely, we build on the idea of median-of-means statistics to estimate the centroids, but allow for replacement while constructing the blocks.…
Proposes a robust clustering method using the Median-of-Means estimator.
problem Noise and outliers in data affect clustering quality and require specifying the number of clusters.
method Integrates model-based and centroid-based clustering methods using the Median-of-Means estimator.
result Mitigates noise effects and estimates the number of clusters automatically.
Unified framework for robust linear predictions without distributional assumptions.
problem Robust linear predictions in the presence of outliers and model misspecification.
method Unified robust framework for linear prediction problems on Hilbert spaces, using Median of Means (MoM) approach.
result Achieves an error rate of \(O(\max\left\{|\mathcal{O}|^{1/2}n^{-1/2}, |\mathcal{I}|^{1/2}n^{-1}
ight\}+ε)\) for misspecification level \(ε\), matching best-known rates.