A new KF handles outliers without MSE loss.
problem Outliers degrade Kalman filter performance.
method NUV priors, EM and AM for variance estimation.
result Outlier-insensitive KF outperforms existing methods.
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
48 results for “Outlier Insensitivity”
Functional Output Regression with Infimal Convolution: Exploring the Huber and -insensitive Lossesstat.ML
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.
RHPSVM improves SVM performance with robust loss function.
problem Outliers and resampling instability in SVM models.
method RHPSVM uses a rescaled Huberized pinball loss function.
result RHPSVM outperforms existing SVM models in noisy and small-sample scenarios.
Efficient SVD algorithm robust to outliers.
problem Outliers in data matrix affect SVD accuracy and speed.
method Spherically Normalized SVD (SpherSVD) algorithm.
result Significantly faster and more robust than existing methods.
Though very popular, it is well known that the EM for GMM algorithm suffers from non-Gaussian distribution shapes, outliers and high-dimensionality. In this paper, we design a new robust clustering algorithm that can efficiently deal with noise and outliers in diverse data sets. As an EM-like algorithm, it is based on …
A new asymmetric -insensitive pinball loss function based support vector quantile regression modelstat.ML
In this paper, we propose a novel asymmetric -insensitive pinball loss function for quantile estimation. There exists some pinball loss functions which attempt to incorporate the -insensitive zone approach in it but, they fail to extend the -insensitive approach for quantile estimation in true sense. The propo…
Proposes a fair pricing framework insensitive to protected covariates.
problem Ensuring fair prices for financial products without using discriminatory covariates.
method Develops a discrimination-insensitive pricing framework using optimization and KL divergence.
result Proves existence and uniqueness of discrimination-insensitive pricing measures.
A new method for support vector regression using a data-driven insensitive parameter.
problem Determining an optimal insensitive parameter in support vector regression.
method A data-driven approach to approximate the insensitive parameter by minimizing a generalized loss function based on the likelihood principle.
result The proposed method outperforms traditional support vector regression methods and has lower computational costs.
New SVM model balances sparsity and robustness in noisy data.
problem Noise sensitivity and lack of sparsity in traditional SVM models.
method Combines elastic net loss with robust loss framework, integrates with SVM, uses half-quadratic algorithm.
result Proves sparsity and robustness, outperforms traditional SVMs in noisy environments.
SRHM explains deep learning's hierarchy and insensitivity to transformations.
problem Understanding how deep networks learn hierarchical and invariant representations.
method Introducing sparsity to generative hierarchical models of data.
result Hierarchical representations and insensitivity to transformations correlate strongly with deep network performance.
New algorithm reduces dimensionality in stochastic optimization.
problem Stochastic optimization in high-dimensional problems.
method Proposes a sparsity-inducing stochastic gradient-free (SI-SGF) algorithm.
result Proves dimension-free query complexity in convex and strongly convex cases.
A new model for complex cells accounts for insensitivity to image shifts.
problem Complex cells' response to image shifts.
method Linear combination of Gaussian derivatives at a single position.
result Maximum response insensitive to small shifts of the image.
Develops a new method for neural network significance testing without strict constraints.
problem Testing neural networks without bounded weights or specific architectural constraints.
method Uses Rademacher complexity bounds, weakened Sobolev space membership conditions, and a modified sieve space construction.
result Achieves optimal convergence rates and valid asymptotic distributions for test statistics.
Paper relaxes differential privacy for correlated features, improving privacy-utility trade-off.
problem Standard differential privacy ignores feature correlation, leading to suboptimal privacy-utility balance.
method Introduces CorrDP framework that accounts for feature correlation, using total variation distance for quantification.
result CorrDP algorithms outperform standard DP in synthetic and real-world datasets with insensitive features.
A new method improves Bayesian inference for multimodal posteriors.
problem Insensitivity to well-separated modes in multimodal posteriors.
method Weighted Kernel Stein Discrepancy method.
result Significantly improved mode sensitivity compared to standard KSD-Bayes.
A new method recovers latent potentials from graph flows, preserving ordering and stability.
problem Recovering latent potentials from graph flows is ill-posed and standard methods collapse the ordering.
method Gauge-invariant, parameter-insensitive regularization using Dirichlet energy.
result The method preserves ordering and stability across different regularization strengths.
For many tasks and data types, there are natural transformations to which the data should be invariant or insensitive. For instance, in visual recognition, natural images should be insensitive to rotation and translation. This requirement and its implications have been important in many machine learning applications, a…
Diffusion models accurately recover mixture weights from generated samples despite score function insensitivity.
problem Score-based generative models often fail to learn correct relative mode amplitudes (mixture weights) from generated samples.
method Relate diffusion score matching (DSM) loss to mixture weight estimation error, define diffusion score sensitivity index (DSSI), and prove its governing role in mixture weight recovery.
result Generated samples can accurately recover mixture weights from the DSM loss, even when the target score is insensitive to mixture weights.
Tree ensemble kernels for Bayesian optimization with known constraints over mixed-feature spacesstat.ML
Tree ensemble kernels improve Bayesian optimization for mixed features and constraints.
problem Optimizing over mixed-feature spaces with known constraints.
method Kernel interpretation of tree ensembles as Gaussian Process prior, compatible optimization formulation for acquisition function, integration of known constraints.
result Framework outperforms state-of-the-art methods for mixed-feature spaces and constraints.
This paper proposes a novel '-support vector quantile regression' (-SVQR) model for the quantile estimation. It can facilitate the automatic control over accuracy by creating a suitable asymmetric -insensitive zone according to the variance present in data. The proposed -SVQR model uses the fraction of …
PANDA improves linear discriminant analysis in high dimensions with minimal tuning.
problem Linear discriminant analysis in high-dimensional settings.
method PANDA: a tuning-insensitive method for linear discriminant analysis.
result PANDA achieves optimal convergence rates in estimation error and misclassification rate.
We propose an inlier-based outlier detection method capable of both identifying the outliers and explaining why they are outliers, by identifying the outlier-specific features. Specifically, we employ an inlier-based outlier detection criterion, which uses the ratio of inlier and test probability densities as a measure…
A novel approach ODAR detects outliers for clustering.
problem Outliers interfere with clustering algorithms, leading to unreliable results.
method Feature transformation to separate outliers and normal objects into distinct clusters.
result ODAR improves clustering accuracy on 7 out of 10 datasets.
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…
New framework detects outliers in non-IID categorical data.
problem Existing outlier detection methods fail in non-IID data.
method Value-value graph-based representation and outlierness propagation.
result Significant improvement in AUC on complex data sets.
Equity default-swaps pay the holder a fixed amount of money when the underlying spot level touches a (far-down) barrier during the life of the instrument. While most pricing models give reasonable results when the barrier lies within the range of liquidly traded strikes of plain-vanilla option prices, the situation is …
Outlier detection aims to identify unusual data instances that deviate from expected patterns. The outlier detection is particularly challenging when outliers are context dependent and when they are defined by unusual combinations of multiple outcome variable values. In this paper, we develop and study a new conditiona…
Paper proposes methods to make OT robust to outliers.
problem Optimal transport is sensitive to outliers.
method Detect outliers using adversarial training, adjust transport cost based on classifier predictions.
result Outliers are detected and do not affect transport in experiments.
Outlier detection plays an essential role in many data-driven applications to identify isolated instances that are different from the majority. While many statistical learning and data mining techniques have been used for developing more effective outlier detection algorithms, the interpretation of detected outliers do…
Advances in sensor technology have enabled the collection of large-scale datasets. Such datasets can be extremely noisy and often contain a significant amount of outliers that result from sensor malfunction or human operation faults. In order to utilize such data for real-world applications, it is critical to detect ou…
Survey compares methods for generating artificial outliers.
problem Difficulty in detecting genuine outliers.
method Generates artificial outliers to approximate genuine ones.
result Variability in quality of generation approaches.
Paper tackles outlier detection in signals modeled by generative models with theoretical guarantees.
problem Recovering signals from linear measurements with sparse outliers.
method Proposes an iterative ADMM algorithm and gradient descent algorithm for outlier detection using and squared norm minimization.
result Establishes theoretical recovery guarantees for signal reconstruction under sparse outliers.
Transforms distance-based outlier scores into interpretable probabilistic estimates.
problem Difficult interpretation of distance-based outlier scores.
method Generic transformation of scores into probabilistic estimates using distance probability distributions.
result Probabilistic transformation improves interpretability without impacting detection performance.
Generates synthetic data for benchmarking unsupervised outlier detection.
problem Difficulty in benchmarking unsupervised outlier detection due to rare and varied outliers in real data.
method Proposes a generic process to generate synthetic data with insightful characteristics.
result Demonstrates practicality of the generic process through a benchmark with state-of-the-art detection methods.
We analyze dropout in deep networks with rectified linear units and the quadratic loss. Our results expose surprising differences between the behavior of dropout and more traditional regularizers like weight decay. For example, on some simple data sets dropout training produces negative weights even though the output i…
A novel unsupervised outlier detection method using Randomized PCA Forest.
problem Unsupervised outlier detection in datasets.
method Randomized Principal Component Analysis (RPCA) Forest for deriving an outlier score.
result Superior performance compared to classical and state-of-the-art methods.
HLoOP detects outliers in hyperbolic 2-space.
problem Detecting local outliers in hyperbolic 2-space.
method Combines nearest neighbor finding and probabilistic scoring in hyperbolic space.
result Promising results on WordNet dataset.
Robust PCA, the problem of PCA in the presence of outliers has been extensively investigated in the last few years. Here we focus on Robust PCA in the outlier model where each column of the data matrix is either an inlier or an outlier. Most of the existing methods for this model assumes either the knowledge of the dim…
New outlier detection method using graph Laplacian spectrum boosts performance.
problem Detecting outliers in large datasets efficiently.
method Boosted outlier detection based on graph Laplacian spectrum.
result Outperforms existing methods on synthetic datasets.
We evaluate how modern outlier detection methods perform in identifying outliers in e-commerce conversion rate data. Based on the limitations identified, we then present a novel method to detect outliers in e-commerce conversion rate. This unsupervised method is made more business relevant by letting it automatically a…
A new method centers outliers in robust PCA without manual intervention.
problem Outliers in robust PCA require manual centering, complicating the analysis.
method Introduces a 'bias trick' to automatically center non-outliers.
result First optimal RPCA algorithm with automatic centering.
In decision-making systems, it is important to have classifiers that have calibrated uncertainties, with an optimisation objective that can be used for automated model selection and training. Gaussian processes (GPs) provide uncertainty estimates and a marginal likelihood objective, but their weak inductive biases lead…
Enhances clustering for functional data, robust to outliers.
problem Challenges of clustering infinite-dimensional functional data and outlier sensitivity.
method Extends OCLUST algorithm to handle functional data, trimming outliers.
result Strong performance in clustering and outlier identification on simulated and real-world datasets.
A new method detects outliers using ensembles of Dirichlet process mixtures.
problem Challenges in unsupervised outlier detection using Dirichlet process mixtures.
method Ensembles of Dirichlet process Gaussian mixtures with random subspace and subsampling.
result Empirically outperforms existing approaches in unsupervised outlier detection.
Rare data in a large-scale database are called outliers that reveal significant information in the real world. The subspace-based outlier detection is regarded as a feasible approach in very high dimensional space. However, the outliers found in subspaces are only part of the true outliers in high dimensional space, in…
Robust PCA, the problem of PCA in the presence of outliers has been extensively investigated in the last few years. Here we focus on Robust PCA in the column sparse outlier model. The existing methods for column sparse outlier model assumes either the knowledge of the dimension of the lower dimensional subspace or the …
ODIM detects outliers by under-fitting generative models, outperforming other methods.
problem Identifying outliers in unlabeled data without supervision.
method Develops ODIM, a method that uses under-fitted deep generative models to detect outliers.
result ODIM outperforms other methods in detecting outliers efficiently and accurately.
XGBOD combines unsupervised and supervised methods for better outlier detection.
problem Enhanced outlier detection from normal observations in various datasets.
method Hybrid approach using unsupervised representation learning to improve a supervised classifier.
result XGBOD outperforms competing methods across seven datasets.