Good data stewardship requires removal of data at the request of the data's owner. This raises the question if and how a trained machine-learning model, which implicitly stores information about its training data, should be affected by such a removal request. Is it possible to "remove" data from a machine-learning mode…
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,695 papers · 148 categories
Trend · papers per month
48 results for “removability”
Selective removal of data subsets can efficiently unlearn unwanted distributions.
problem Efficiently removing unwanted data subsets without losing important information.
method Formalized as distributional unlearning, using Kullback-Leibler divergence constraints to select a small subset of data.
result Proposed method achieves corresponding log-loss bounds and is quadratically more sample-efficient than random removal.
Unified framework for explaining models by removing features.
problem Unclear relationships and preferences among existing model explanation methods.
method Removal-based explanations characterized by three dimensions.
result Unified framework unifies 26 existing methods.
The paper proves removable singularity for nonlocal minimal graphs.
problem Proving removable singularities for nonlocal minimal graphs.
method Analyzing -capacity zero compact sets to ensure graphs are minimal in the entire domain.
result Nonlocal minimal graphs are removable in the entire domain if they are minimal in a set of -capacity zero.
Unified framework for model explanation methods based on feature removal.
problem Unclear relationships and preferences among various model explanation methods.
method Characterizes removal-based explanations along three dimensions.
result Unified 26 existing methods, including widely used approaches.
Removing spurious features can hurt model accuracy and disproportionately affect different groups.
problem Interference from spurious features in robust model performance across different groups.
method Characterization and analysis of spurious feature removal in noiseless overparameterized linear regression.
result Removal of spurious features can decrease accuracy and disproportionately affect different groups, even in balanced datasets.
Removes singularities for Yang-Mills-Higgs fields in higher dimensions.
problem Yang-Mills-Higgs fields with isolated singularities.
method Establishes decay estimates and conformally invariant energy bounds.
result Removable singularity theorem for Yang-Mills-Higgs fields.
New algorithm for mean estimation in add-remove model achieves optimal error.
problem Mean estimation in add-remove model of differential privacy.
method Proposed new algorithm achieving min-max optimality.
result Achieves best possible constant in mean squared error for all ε.
Machine learning confound removal biases results, leading to misleading predictions.
problem Common confound removal methods in machine learning lead to misleading predictions.
method Featurewise removal of confound variance by linear regression before applying ML.
result This common deconfounding approach can leak information, amplifying null or moderate effects.
We call a singularity of a presymplectic form removable in its graph if its graph extends to a smooth Dirac structure over the singularity. An example for this is the symplectic form of a magnetic monopole. A criterion for the removability of singularities is given in terms of regularizing functions for pure spinor…
D3M debiases models by selectively removing problematic examples.
problem Model failures on underrepresented subgroups.
method Isolates and removes specific training examples that cause failures.
result Efficiently trains debiased classifiers with minimal example removal.
PUMA augments models to remove unique data points without performance loss.
problem Preserving model performance while removing unique training data points.
method Explicitly models data influence, reweights remaining data optimally.
result PUMA effectively removes unique data points without performance degradation.
In this paper we prove a local removable singularity theorem for certain minimal laminations with isolated singularities in a Riemannian three-manifold. This removable singularity theorem is the key result used in our proof that a complete, embedded minimal surface in with quadratic decay of curvature ha…
This paper proposes a novel Gaussian process approach to fault removal in time-series data. Fault removal does not delete the faulty signal data but, instead, massages the fault from the data. We assume that only one fault occurs at any one time and model the signal by two separate non-parametric Gaussian process model…
Algorithm removes spurious concepts from neural network representations without harming task performance.
problem Spurious correlations hinder neural network out-of-distribution generalization.
method Iterative algorithm that identifies two orthogonal subspaces in neural network representation.
result Algorithm outperforms existing methods on computer vision and natural language processing benchmarks.
Squint bound improved by removing term.
problem Improving the Squint bound by removing the term.
method Using the Krichevsky--Trofimov algorithm to change the prior.
result Removed the term from the Squint bound.
The study extends removability results for quasiregular curves in Euclidean spaces.
problem Removability of singularities in quasiregular curves.
method Extending a fundamental inequality for volume forms to calibrations and proving a Caccioppoli inequality for quasiregular curves.
result Every non-constant quasiregular curve has infinite energy.
While great progress has been made recently in automatic image manipulation, it has been limited to object centric images like faces or structured scene datasets. In this work, we take a step towards general scene-level image editing by developing an automatic interaction-free object removal model. Our model learns to …
We consider sufficient conditions of local removability of coincidences of maps f,g:N->M, where M,N are manifolds with dimensions dimN>dimM. The coincidence index is the only obstruction to the removability for maps with fibers either acyclic or homeomorphic to spheres of certain dimensions. We also address the normali…
We prove a removal of singularities result for Bach-flat metrics in dimension 4 under the assumption of bounded L^2 norm of curvature, bounded Sobolev constant and a volume growth bound. This result extends the removal of singularities result for special classes of Bach-flat metrics obtained in \cite{TVMOD}. For the pr…
This study examines how removing edges from complete graphs affects Ollivier Ricci curvature.
problem Conditions under which Ollivier Ricci curvature changes sign after edge removal.
method Defined and analyzed graphs obtained by removing matching, vertex incident, and cycle edges from complete graphs.
result Ollivier Ricci curvature remains positive or zero for graphs formed by removing edges from complete graphs.
Minimal surfaces and curves can have singularities removed by isotopy.
problem Removing singularities of minimal surfaces and curves.
method Isotopy through conformal minimal surfaces and null holomorphic curves.
result Branch points and complete ends of finite total curvature can be removed.
Paper explores unsupervised learning for ultrasound image artifact removal.
problem Improving visual quality of ultrasound images from various artifacts.
method Inspired by optimal transport cycleGAN, unsupervised deep learning for artifact removal.
result Unsupervised learning method provides comparable results to supervised learning.
Note removes degeneracy in Kähler geometry estimates.
problem Estimating diameter and inequalities in Kähler geometry with degeneracy.
method Technical improvement of earlier results.
result Established diameter, Green's functions, and Sobolev inequalities without small degeneracy assumption.
Unified analysis of removal-based feature attributions robustness.
problem Robustness of removal-based feature attributions is not well understood.
method Theoretical analysis and upper bounds derivation for removal-based feature attributions under input and model perturbations.
result Upper bounds for the difference between intact and perturbed attributions derived under various perturbation settings.
This paper surveys some recent results on existence, uniqueness and removable singularities for fully nonlinear differential equations on manifolds. The discussion also treats restriction theorems and the strong Bellman principle.
Removing noise from correlations in multivariate stock price datacond-mat.stat-mech
This paper examines the applicability of Random Matrix Theory to portfolio management in finance. Starting from a group of normally distributed stochastic processes with given correlations we devise an algorithm for removing noise from the estimator of correlations constructed from measured time series. We then apply t…
A statistical framework for removing unwanted data domains in machine learning.
problem Removing unwanted data domains in machine learning while preserving desired performance.
method Modeling domains as probability distributions and using hypothesis testing to select samples to remove.
result Characterization of allowable edited data distributions and removal-preservation Pareto frontiers for various distribution families.
An important problem in networked systems is detection and removal of suspected malicious nodes. A crucial consideration in such settings is the uncertainty endemic in detection, coupled with considerations of network connectivity, which impose indirect costs from mistakely removing benign nodes as well as failing to r…
Anisotropic min-max theory constructs stable minimal surfaces in 3-manifolds.
problem Constructing stable anisotropic minimal surfaces in 3-manifolds.
method Anisotropic min-max theory, removable singularity theorems.
result Constructs stable anisotropic minimal surfaces in 3-manifolds without singularities.
Paper develops efficient mechanisms for estimating variance and covariance under differential privacy in the add-remove model.
problem Estimating variance and covariance under differential privacy in the add-remove model.
method Developed mechanisms based on the Bézier mechanism, a novel moment-release framework.
result Proved minimax optimality of the Bézier-based estimator in the high-privacy regime and demonstrated its better utility in instance-wise analysis.
By using Moser's iteration technique, we show some removable singularity theorem of the tension field for biharmonic maps into manifolds of non-positive curvature, and the bubbling theorem of biharmonic maps and also harmonic maps.
Study removes bias from chest X-ray embeddings using orthogonalization.
problem Reduces bias in chest X-ray embeddings due to protected features.
method Orthogonalization technique to remove protected feature effects.
result Orthogonalization removes bias and makes predictions of protected attributes infeasible.
Conformal invariance of two-dimensional variational problems is a condition known to enable a blow-up analysis of solutions and to deduce the removability of singularities. In this paper, we identify another condition that is not only sufficient, but also necessary for such a removability of singularities. This is the …
This paper evaluates debiasing methods on word embeddings to reduce religious bias.
problem Social biases persist in word embeddings, potentially amplifying them in AI applications.
method Investigates and evaluates three multiclass debiasing techniques on three word embeddings.
result ConceptorDebiasing is the most effective method, reducing religious bias by 82-96%.
Remove symmetries to improve model optimization and performance.
problem Symmetries in loss functions trap models in low-capacity states, hindering training and optimization.
method Proposes syre, a simple algorithm to remove symmetries in neural networks.
result Removing symmetries correlates well with improved optimization and performance.
Study on removing sets and uniqueness of diffusion operators on various spaces.
problem Determining the effect of removing small sets on the self-adjointness and uniqueness of diffusion operators.
method Analyzes symmetric diffusion operators on metric measure spaces, proving a truncation result for potentials.
result Characterizes the critical size of removed sets and their effect on operator properties.
Improves GAN performance by identifying and removing harmful training instances.
problem Challenges in applying previous instance removal methods to GANs.
method Proposes influence estimation methods using Jacobian of generator's gradient and instance evaluation scheme based on GAN evaluation metrics.
result Removing harmful instances significantly improves GAN performance.
Predictive models can fail to generalize from training to deployment environments because of dataset shift, posing a threat to model reliability and the safety of downstream decisions made in practice. Instead of using samples from the target distribution to reactively correct dataset shift, we use graphical knowledge …
The paper studies decay near singularities of 3d Yang-Mills-Higgs fields.
problem Understanding isolated singularities of 3d Yang-Mills-Higgs fields.
method Derives decay estimates and applies removable singularity theorems.
result Generalizes removable singularity theorems for 3d Yang-Mills-Higgs fields.
Data ownership and data protection are increasingly important topics with ethical and legal implications, e.g., with the right to erasure established in the European General Data Protection Regulation (GDPR). In this light, we investigate network embeddings, i.e., the representation of network nodes as low-dimensional …
A new method is proposed to compute connectivity measures on multivariate time series with gaps. Rather than removing or filling the gaps, the rows of the joint data matrix containing empty entries are removed and the calculations are done on the remainder matrix. The method, called measure adapted gap removal (MAGR), …
Algorithm removes backdoor watermarks from neural networks robustly.
problem Protecting neural networks from backdoor attacks.
method Neural network laundering algorithm.
result Effective removal of backdoor watermarks with high test accuracy.
DaRE forests enable efficient data deletion from random forests.
problem Efficiently removing data from machine learning models.
method Random Forests with data deletion enabled (DaRE).
result Data deletion from DaRE models is orders of magnitude faster than retraining.
We consider harmonic maps into pseudo-Riemannian manifolds. We show the removability of isolated singularities for continuous maps, i.e. that any continuous map from an open subset of R^m into a pseudo-Riemannian manifold which is two times continuously differentiable and harmonic everywhere outside an isolated point i…
We describe a method for removing the effect of confounders in order to reconstruct a latent quantity of interest. The method, referred to as half-sibling regression, is inspired by recent work in causal inference using additive noise models. We provide a theoretical justification and illustrate the potential of the me…
Perturbation-based explanation methods often measure the contribution of an input feature to an image classifier's outputs by heuristically removing it via e.g. blurring, adding noise, or graying out, which often produce unrealistic, out-of-samples. Instead, we propose to integrate a generative inpainter into three rep…
We prove that for any contact 3-manifold supported by a spinal open book decomposition with planar pages, there is a universal bound on the Euler characteristic and signature of its minimal symplectic fillings. The proof is an application of the spine removal surgery operation recently introduced in joint work of the a…