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

8152330 · May 202619922001200920172026
48 results for inlier fraction

New robust regression method works with fewer data points than previous methods.

problem Adversary can corrupt most of the data, making traditional regression models unreliable.
method Developed a Huber loss estimator for robust linear regression with nearly linear sample size and inverse-polynomial inlier fraction.
result The Huber loss estimator is consistent for nearly linear sample size and inverse-polynomial inlier fraction.

Develops efficient estimators for PCA and sparse regression in the presence of oblivious outliers.

problem Estimation of PCA and sparse regression in the presence of a small fraction of corrupted data.
method Designs efficient estimators using Huber loss with non-smooth regularizers like the ℓ1 norm or nuclear norm.
result Achieves consistent estimation error approaching zero as the number of observations grows.

We give the first polynomial-time algorithm for robust regression in the list-decodable setting where an adversary can corrupt a greater than 1/21/2 fraction of examples. For any α<1α< 1, our algorithm takes as input a sample {(xi,yi)}in\{(x_i,y_i)\}_{i \leq n} of nn linear equations where αnαn of the equations satisfy $y_i = \l…

2019-05-14abs ↗pdf ↗

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.

A novel framework IMBoost improves outlier detection by leveraging the inlier memorization effect.

problem Challenges in unsupervised outlier detection, especially when inliers and outliers are not well-separated or form dense clusters.
method IMBoost framework that incorporates active learning to selectively acquire informative labels and explicitly reinforce the inlier memorization effect.
result IMBoost significantly outperforms state-of-the-art active outlier detection methods and requires less computational cost.

ALTBI enhances outlier detection by maximizing the inlier-memorization effect.

problem Improving outlier detection models via optimization of inlier-memorization effect.
method ALTBI introduces two techniques: increasing mini-batch size and using adaptive threshold for truncated loss function.
result ALTBI achieves state-of-the-art performance in identifying outliers with lower computation costs.

Algorithm finds a subspace minimizing distances to inliers with outliers.

problem Finding a kk-dimensional subspace minimizing distances to inliers with outliers.
method Extends dimension reduction techniques and bi-criteria approximations based on sampling.
result Efficient algorithm for multiplicative (1+ε)(1+ε)-approximation of optimal solution.

The paper analyzes how conformal prediction works with contaminated reference data.

problem The impact of contamination on the validity and power of conformal prediction methods.
method The paper analyzes the impact of contamination on the validity of conformal methods and proposes a data-cleaning framework to enhance power.
result The proposed data-cleaning framework can effectively enhance power while maintaining type-I error control.

We propose a neural network for unsupervised anomaly detection with a novel robust subspace recovery layer (RSR layer). This layer seeks to extract the underlying subspace from a latent representation of the given data and removes outliers that lie away from this subspace. It is used within an autoencoder. The encoder …

2019-03-30abs ↗pdf ↗

Improved algorithm for conditional linear regression with heterogeneous covariances.

problem Identifying a linear predictor for a fraction of data with varying covariances.
method Polynomial time algorithm using Disjunctive Normal Form (DNF) to identify a condition and linear predictor.
result Removed requirement for similar covariances in each condition term, improving algorithm applicability.

New method estimates robust mean in high dimensions with minimized outliers.

problem Estimating the mean in high dimensions when a fraction of data is corrupted.
method Formulating the problem as 0\ell_0-norm minimization under second moment constraints, and using 1\ell_1 and p\ell_p minimization techniques.
result The proposed method achieves order optimal robust mean estimation and significantly outperforms existing methods.

This work presents a fast and non-convex algorithm for robust subspace recovery. The data sets considered include inliers drawn around a low-dimensional subspace of a higher dimensional ambient space, and a possibly large portion of outliers that do not lie nearby this subspace. The proposed algorithm, which we refer t…

2014-06-24abs ↗pdf ↗

Consider a dataset of vector-valued observations that consists of noisy inliers, which are explained well by a low-dimensional subspace, along with some number of outliers. This work describes a convex optimization problem, called REAPER, that can reliably fit a low-dimensional model to this type of data. This approach…

2012-02-18abs ↗pdf ↗

This describes a statistical technique called "tonsuring" for exploratory data analysis in finance. Instead of rejecting "outlier" data that conflicts with the model, this strips out "inlier" data to get a clearer picture of how the market changes for larger moves.

2011-10-20abs ↗pdf ↗

The idea of Innovation Search was proposed as a data clustering method in which the directions of innovation were utilized to compute the adjacency matrix and it was shown that Innovation Pursuit can notably outperform the self representation based subspace clustering methods. In this paper, we present a new discovery …

2019-12-30abs ↗pdf ↗

New estimator tackles multi-task linear regression with outliers, avoiding eigenvalue lower bounds.

problem Multi-task linear regression with contaminated tasks and eigenvalue lower bounds failure.
method Matrix-weighted norm regularization and relative balancedness condition.
result Prediction MSE bounds match Duan and Wang (2023) under weaker spectral assumptions.

CLSVAE repairs systematic errors in images with minimal labeled data.

problem Repairing systematic errors in data, especially in images.
method CLSVAE models inliers as a smaller latent space representation, separating inlier and outlier patterns.
result CLSVAE achieves superior repairs with less than 2% labeled data, outperforming other methods.

DCASE 2021 ASD task tackles domain-shifted anomalous sound detection.

problem Detecting unknown anomalous sounds under domain-shifted conditions.
method Ensemble of outlier exposure and inlier modeling detectors, feature learning from machine identification.
result Two types of remarkable approaches were adopted by top teams.

This paper considers the problem of robust subspace recovery: given a set of NN points in RD\mathbb{R}^D, if many lie in a dd-dimensional subspace, then can we recover the underlying subspace? We show that Tyler's M-estimator can be used to recover the underlying subspace, if the percentage of the inliers is larger t…

2012-06-07abs ↗pdf ↗

Smoothed analysis is a powerful paradigm in overcoming worst-case intractability in unsupervised learning and high-dimensional data analysis. While polynomial time smoothed analysis guarantees have been obtained for worst-case intractable problems like tensor decompositions and learning mixtures of Gaussians, such guar…

2018-11-29abs ↗pdf ↗

In this work we present a new approach on studying dynamical systems. Combining the two ways of expressing the uncertainty, using probabilistic theory and credibility theory, we have research the generalized fractional hybrid equations. We have introduced the concepts of generalized fractional Wiener process, generaliz…

2009-09-15abs ↗pdf ↗

Introduces fractional k-dimensional measure bridging fractional length and area.

problem Defining fractional measures for dimensions between 0 and n-1.
method Introduces a parameterized fractional measure σσ that converges to Hausdorff measure.
result Fractional measure converges to Hausdorff measure with a known constant factor.

The theory of derivative of noninteger order goes back to Leibniz, Liouville and Riemann. Derivatives of fractional order have found many applications in recent studies in mechanics, physics, economics. In this paper we define the fractional tangent bundle on a manifold, using a method of Radu Miron. The fractional Lei…

2007-09-15abs ↗pdf ↗

Let SgS_g be a closed orientable surface of genus g2g \geq 2 and CC a simple closed nonseparating curve in FF. Let tCt_C denote a left handed Dehn twist about CC. A \textit{fractional power} of tCt_C of \textit{exponent} $\fraction{\ell}{n}$ is an $h \in \Mod(S_g)$ such that hn=tCh^n = t_C^{\ell}. Unlike a root of a $t…

2012-07-16abs ↗pdf ↗

We formulate the fractional Ricci flow theory for (pseudo) Riemannian geometries enabled with nonholonomic distributions defining fractional integro-differential structures, for non-integer dimensions. There are constructed fractional analogs of Perelman's functionals and derived the corresponding fractional evolution …

2010-04-05abs ↗pdf ↗

Modeling financial markets with memory using fractional calculus and Brownian motion.

problem Capturing memory effects in financial markets using stochastic models.
method Fractional Langevin equation with colored noise generated by fractional Brownian motion.
result Anomalous marginal glass phase observed in some regions of the system.

For the degree corrected stochastic block model in the presence of arbitrary or even adversarial outliers, we develop a convex-optimization-based clustering algorithm that includes a penalization term depending on the positive deviation of a node from the expected number of edges to other inliers. We prove that under m…

2019-06-07abs ↗pdf ↗

In this paper we established the condition for a curve to satisfy stochas- tic fractional HP (Hamilton-Pontryagin) equations. These equations are described using It^o integral. We have also considered the case of stochastic fractional Hamiltonian equa- tions, for a hyperregular Lagrange function. From the stochastic fr…

2009-06-24abs ↗pdf ↗