Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

295988117 · Jun 202019922001200920172026
48 results for outlier handling

Outlier detection amounts to finding data points that differ significantly from the norm. Classic outlier detection methods are largely designed for single data type such as continuous or discrete. However, real world data is increasingly heterogeneous, where a data point can have both discrete and continuous attribute…

2016-08-17abs ↗pdf ↗

New robust MPCA method handles casewise and cellwise outliers in tensor data.

problem Outliers, especially casewise and cellwise, affect the performance of standard MPCA.
method Uses a single loss function to reduce the influence of both types of outliers and missing values.
result The new method improves robustness and performance in tensor data analysis.

Clustering, or unsupervised classification, is a task often plagued by outliers. Yet there is a paucity of work on handling outliers in clustering. Outlier identification algorithms tend to fall into three broad categories: outlier inclusion, outlier trimming, and post hoc outlier identification methods, with the forme…

2019-07-02abs ↗pdf ↗

Cluster analysis and outlier detection are strongly coupled tasks in data mining area. Cluster structure can be easily destroyed by few outliers; on the contrary, outliers are defined by the concept of cluster, which are recognized as the points belonging to none of the clusters. Unfortunately, most existing studies do…

2018-01-05abs ↗pdf ↗

A robust model handles up to 25% of outliers in time-series data for power flow calculations.

problem Handling outliers in time-series data for accurate power flow calculations.
method Robust data-driven process model with Schweppe-type generalized maximum likelihood estimator and projection statistics for outlier weighting.
result The model can handle up to 25% of outliers in the training data set.

Proposes CE-BASS for robust Kalman filtering with innovative and additive outliers.

problem Robustness to both innovative and additive outliers in Kalman filtering.
method Particle mixture Kalman filter with re-sampling of past states.
result CE-BASS efficiently handles multi-modality and trend changes in hidden state distributions.

Adaptive methods learn from multiple datasets, leveraging similarities and robust to outliers.

problem Simultaneously analyze multiple datasets with possible similarities and differences.
method Adaptive multi-task learning methods that automatically utilize similarities and handle differences.
result Sharp statistical guarantees and robustness against outlier tasks demonstrated.

A new robust regression method handles outliers in high-dimensional data.

problem Outliers in high-dimensional data make conventional regression methods ineffective.
method Robust penalized least squares of depth trimmed residuals regression.
result The new method outperforms existing methods in estimation and prediction accuracy.

Notwithstanding the popularity of conventional clustering algorithms such as K-means and probabilistic clustering, their clustering results are sensitive to the presence of outliers in the data. Even a few outliers can compromise the ability of these algorithms to identify meaningful hidden structures rendering their o…

2011-04-22abs ↗pdf ↗

Paper proposes DMGD for integrating outlier and community detection in graph embedding.

problem Outlier nodes affect graph embedding of regular nodes, especially in networks with multiple communities.
method DMGD integrates outlier and community detection with node embedding using multiclass graph description.
result DMGD detects outliers relative to their communities and achieves better node embedding compared to state-of-the-arts.

New algorithms detect outliers in high-dimensional data with arbitrary shapes.

problem Challenges of high dimensionality and varying cluster shapes in traditional outlier detection methods.
method Cluster Catch Digraphs (CCDs) and their variants (U-MCCD, UN-MCCD, SU-MCCD, SUN-MCCD).
result U-MCCD efficiently identifies outliers with high true negative rates, and SU-MCCD improves handling of non-uniform clusters.

Scalable and robust TR decomposition for large-scale data with missing entries and outliers.

problem Handling large-scale tensor data with missing entries and outliers.
method Auto-weighted steepest descent method for missing entries and outliers identification, FGMC and RStS strategies.
result Outperforms existing TR decomposition methods in the presence of outliers and runs faster than robust tensor completion algorithms.

Proposes GMOTE for better handling imbalanced data.

problem Classification of imbalanced data.
method Generates minority class instances using Gaussian Mixture Model, considering outliers through Mahalanobis distance.
result Shows better accuracy and F1-Score when combined with CART or SVM.

A new robust Wasserstein distance is proposed to handle outliers in probability distributions.

problem Outliers in probability distributions make Wasserstein distances sensitive and impractical.
method Introduces a new outlier-robust Wasserstein distance Wpε\mathsf{W}_p^\varepsilon.
result Achieves strong robust estimation guarantees under the Huber ε\varepsilon-contamination model.

InfoOT improves data alignment by maximizing mutual information.

problem Optimal transport's limitations in handling clusters, outliers, and new data.
method InfoOT extends optimal transport by maximizing mutual information while minimizing distances.
result InfoOT outperforms optimal transport in domain adaptation, cross-domain retrieval, and single-cell alignment.

Non-negative matrix factorization (NMF) minimizes the Euclidean distance between the data matrix and its low rank approximation, and it fails when applied to corrupted data because the loss function is sensitive to outliers. In this paper, we propose a Truncated CauchyNMF loss that handle outliers by truncating large e…

2019-06-02abs ↗pdf ↗

MTLRRC improves MTL by robustly clustering tasks and detecting outliers.

problem Improving MTL by handling outlier tasks and sharing common information.
method Robust regularized clustering with non-convex group penalties.
result MTLRRC effectively detects and clusters tasks, improving overall performance.

New framework detects out-of-distribution data by considering intrinsic ID attributes in outliers.

problem Deploying reliable machine learning systems requires effective out-of-distribution detection.
method Structured multi-view-based out-of-distribution detection learning (MVOL) framework.
result MVOL effectively utilizes both auxiliary OOD datasets and wild datasets with noisy in-distribution data.

Many sensors, such as range, sonar, radar, GPS and visual devices, produce measurements which are contaminated by outliers. This problem can be addressed by using fat-tailed sensor models, which account for the possibility of outliers. Unfortunately, all estimation algorithms belonging to the family of Gaussian filters…

2015-09-14abs ↗pdf ↗

Paper extends RPD for better handling multiple modalities and non-convexity.

problem Handling multiple modalities and non-convexity in data clouds.
method Computes RPD in a reproducing kernel Hilbert space using kernel principal component analysis.
result The method outperforms RPD and is comparable to other models on benchmark datasets.

New EM algorithm for mixtures of elliptical distributions handles missing data and outliers.

problem Missing data imputation for noisy and non-Gaussian data.
method Investigation of a new EM algorithm for mixtures of elliptical distributions.
result The proposed algorithm is robust to outliers and competitive with other methods.

Robustness to outliers is a central issue in real-world machine learning applications. While replacing a model to a heavy-tailed one (e.g., from Gaussian to Student-t) is a standard approach for robustification, it can only be applied to simple models. In this paper, based on Zellner's optimization and variational form…

2017-10-18abs ↗pdf ↗

The paper introduces a new FOR framework using Huber and ε-insensitive losses.

problem Handling outliers and sparsity in functional output regression.
method Proposes a flexible FOR framework with infimal convolution losses and computable algorithms.
result Demonstrates efficiency and effectiveness on synthetic and real-world data.

Effective and accurate model selection is an important problem in modern data analysis. One of the major challenges is the computational burden required to handle large data sets that cannot be stored or processed on one machine. Another challenge one may encounter is the presence of outliers and contaminations that da…

2016-10-19abs ↗pdf ↗

Improved DP SO with large Lipschitz parameters, handling outliers and heavy-tailed data.

problem Differential privacy in stochastic optimization with large Lipschitz parameters.
method Assumes bounded k-th order moments, provides linear-time algorithms for smooth convex and non-smooth convex losses.
result Improved risk bounds scaling with k-th moment, not uniform Lipschitz parameter.