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

14294357 · Jun 202019922001200920172026
48 results for pointwise corruption

The paper proposes a method to detect and filter noisy or mislabeled data using pointwise mutual information.

problem Detecting and filtering noisy or mislabeled data in deep learning models.
method A mutual information-based framework quantifying statistical dependencies between inputs and labels.
result The method effectively filters low-quality samples, improving classification accuracy by up to 15%.

Develops a new robust risk measure for neural networks.

problem Adversarial risk metrics fail to capture probabilistic perturbations and poor train-test generalization.
method Statistically robust risk (SRR) framework considering pointwise corruption distributions.
result SRR provides superior generalization performance compared to adversarial risks.

We introduce the notions of pointwise almost h-slant submanifolds and pointwise almost h-semi-slant submanifolds as a generalization of slant submanifolds, pointwise slant submanifolds, semi-slant submanifolds, and pointwise semi-slant submanifolds. We have characterizations and investigate the integrability of distrib…

2013-12-12abs ↗pdf ↗

Study properties of pointwise k-slant submanifolds in Kähler manifolds.

problem Characterize the integrability of component distributions in Kähler manifolds.
method Characterization through integrability and totally geodesic cases.
result Characterize the integrability of component distributions in Kähler manifolds.

Study minimax robustness in statistical estimation under Wasserstein contamination.

problem Adversarial perturbations in statistical data.
method Developed minimax theory for qr\ell_q^r losses under Wasserstein-rr contaminations.
result Exact minimax risk identified for joint contaminations in location estimation and prediction in linear regression.

Develops a comprehensive theory of corruption in supervised learning.

problem Widespread corruption in data collection affects supervised learning problems.
method Introduces a general theory of corruption using Markov kernels, distinguishing and comparing corruption types.
result Establishes a unified framework for corruption types and develops mitigation strategies.

The paper studies a new type of submanifolds in product spaces.

problem Characterizing and understanding warped product pointwise bi-slant submanifolds.
method Introduced and studied warped product pointwise bi-slant submanifolds of locally product Riemannian manifolds.
result Characterization results and non-trivial examples of these submanifolds.

Robustly infers manifold density and geometry under high-dimensional noise.

problem Inaccurate kernel density estimation under high-dimensional noise.
method Doubly stochastic normalization of Gaussian kernel.
result Robust tools for density estimation, noise magnitude estimation, and distance approximation.

New algorithm robust to label corruptions in active learning.

problem Active learning under unknown adversarial label corruptions.
method Proposed a new active learning algorithm that is provably correct without assumptions on corruptions.
result Achieves minimax label complexity in non-corrupted setting and only requires additional labels to achieve desired accuracy in corrupted setting.

Study on slant submanifolds with new conditions and transitivity.

problem Conditions for slant submanifolds under different structures.
method Analyzes pointwise slant submanifolds under two anti-commuting almost Hermitian structures and their transitivity.
result Property of being pointwise slant is transitive on a class of proper pointwise slant immersed submanifolds.

Study improves image classifier robustness to random p-norm corruptions.

problem Improving robustness of image classifiers to real-world imperceptible corruptions.
method Training and testing with random p-norm corruptions, evaluating robustness against different p-norms.
result Training with a combination of p-norm corruptions significantly improves robustness.

Unified framework for corruption-robust linear bandits with optimal gap-dependent misspecification bounds.

problem Effective learning in linear bandits with corrupted rewards across different corruption models.
method Unified framework for analyzing strong and weak corruption, connection to gap-dependent misspecification, and specialized algorithm.
result Optimal bounds for gap-dependent misspecification in linear bandits.

We report quantitative relations between corruption level and economic factors, such as country wealth and foreign investment per capita, which are characterized by a power law spanning multiple scales of wealth and investments per capita. These relations hold for diverse countries, and also remain stable over differen…

2007-05-01abs ↗pdf ↗

CUTS removes corruption from models without clean data, improving utility and security.

problem Removing corruption from models without access to clean training data.
method CUTS uses a proxy set to amplify corruption and subtract it from model weights.
result CUTS recovers a large fraction of lost utility and nearly eliminates attacks with minimal damage.

The paper studies geometric properties of a specific type of submanifolds in Kaehler manifolds.

problem Analyzing the geometry of pointwise semi-slant warped products in locally conformal Kaehler manifolds.
method The study extends Chen's inequality for CR-warped product submanifolds and investigates equality cases.
result Several results extend Chen's inequality for CR-warped product submanifolds in Kaehler manifolds.

Binary classification improves with a small fraction of corrupted labels.

problem Binary classification with corrupted labels.
method Established corruption as a form of regularization and computed upper bounds on estimation error.
result Corruption is beneficial only up to a small fraction of the total sample, scaling with the square root of the sample size.

In this paper we study general rotational surfaces in the 4- dimensional Euclidean space E4 and give a characterization of flat general rotation surface with pointwise 1-type Gauss map. Also, we show that a non-planar flat general rotation surface with pointwise 1-type Gauss map is a Lie group if and only if it is a Cl…

2013-02-12abs ↗pdf ↗

We study the problem of corrupted sensing, a generalization of compressed sensing in which one aims to recover a signal from a collection of corrupted or unreliable measurements. While an arbitrary signal cannot be recovered in the face of arbitrary corruption, tractable recovery is possible when both signal and corrup…

2013-05-11abs ↗pdf ↗

New algorithm optimizes noisy, potentially corrupted functions.

problem Optimizing unknown functions with noisy bandit feedback, especially when evaluations are corrupted.
method Fast-Slow GP-UCB algorithm, combining robust and non-robust evaluations, enlarged confidence bounds.
result Theoretical analysis upper bounds cumulative regret, showing dependencies on corruption level and kernel.

Study bounds derivatives of solutions to a specific equation on domains.

problem Bounding second derivatives of solutions to the σkσ_k-Yamabe equation.
method Proves local pointwise second derivative estimates for positive W2,pW^{2,p} solutions.
result Establishes bounds for derivatives of solutions to the σkσ_k-Yamabe equation.

New algorithm reduces linear contextual bandit regret with adversarial corruption.

problem Linear contextual bandit with adversarial reward corruption.
method Optimism in the face of uncertainty principle, weighted ridge regression.
result Achieves nearly optimal regret for both corrupted and uncorrupted cases.

We extend the model of stochastic bandits with adversarial corruption (Lykouriset al., 2018) to the stochastic linear optimization problem (Dani et al., 2008). Our algorithm is agnostic to the amount of corruption chosen by the adaptive adversary. The regret of the algorithm only increases linearly in the amount of cor…

2019-09-04abs ↗pdf ↗

Picket guards against corrupted data in machine learning models.

problem Data corruption biases models and invalidates predictions.
method PicketNet detects corrupted data using self-supervised deep learning; flags corrupted queries online.
result Picket consistently protects models from corrupted data during training and deployment.

We use methods from network science to analyze corruption risk in a large administrative dataset of over 4 million public procurement contracts from European Union member states covering the years 2008-2016. By mapping procurement markets as bipartite networks of issuers and winners of contracts we can visualize and de…

2019-09-18abs ↗pdf ↗

Our goal in this paper is to develop an effective estimator of fractal dimension. We survey existing ideas in dimension estimation, with a focus on the currently popular method of Grassberger and Procaccia for the estimation of correlation dimension. There are two major difficulties in estimation based on this method. …

2013-12-09abs ↗pdf ↗

An affine hypersurface MM is said to admit a pointwise symmetry, if there exists a subgroup GG of Aut(TpM){\rm Aut}(T_p M) for all pMp\in M, which preserves (pointwise) the affine metric hh, the difference tensor KK and the affine shape operator SS. Here, we consider 3-dimensional indefinite affine hyperspheres, i.e. $S…

2009-10-19abs ↗pdf ↗

The main purpose of this paper is to formalize the modelling process, analysis and mathematical definition of corruption when entering into a contract between principal agent and producers. The formulation of the problem and the definition of concepts for the general case are considered. For definiteness, all calculati…

2018-04-06abs ↗pdf ↗

Algorithm maximizes total reward in multi-agent bandits with adversarial corruptions.

problem Maximizing total reward in multi-agent bandits with adversarial corruptions.
method Proposes a cooperative learning algorithm robust to adversarial corruptions.
result Demonstrates an additive O((L/Lmin)C)O((L / L_{\min}) C) regret term for an adversary with unknown corruption budget.

New algorithm robustly trains deep neural networks under corrupted supervision.

problem Training deep neural networks with corrupted supervision data.
method Unified framework for classification and regression, focusing on collective impact of data points on average gradient.
result Achieves strong guarantees without assuming the type of corruption, robust under various types of corruption.

It is known that there exist no warped product semi-slant submanifolds in Kaehler manifolds \cite{Sahin}. Recently, Chen and Garay studied pointwise-slant submanifolds of almost Hermitian manifolds in \cite{CG} and obtained many new results for such submanifolds. In this paper, we first introduce pointwise semi-slant s…

2013-10-10abs ↗pdf ↗

We inspect a possible clustering structure of the corruption perception among 134 countries. Using the average linkage clustering, we uncover a well-defined hierarchy in the relationships among countries. Four main clusters are identified and they suggest that countries worldwide can be quite well separated according t…

2015-01-31abs ↗pdf ↗

This study tackles adversarial corruption in model-based reinforcement learning.

problem Adversarial corruption in model-based reinforcement learning.
method Maximum likelihood estimation (MLE) approach for learning transition model in both online and offline settings.
result Proves a regret of ildeO(T+C) ilde{\mathcal{O}}(\sqrt{T} + C) for CR-OMLE and a suboptimality of O(C/n)\mathcal{O}(C/n) for CR-PMLE.