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

88176264352 · Jun 202019922001200920172026
48 results for example removal

The Kinoshita graph is the most famous example of a Brunnian theta graph, a nontrivial spatial theta graph with the property that removing any edge yields an unknot. We produce a new family of diagrams of spatial theta graphs with the property that removing any edge results in the unknot. The family is parameterized by…

2015-08-12abs ↗pdf ↗

Traditional text classifiers are limited to predicting over a fixed set of labels. However, in many real-world applications the label set is frequently changing. For example, in intent classification, new intents may be added over time while others are removed. We propose to address the problem of dynamic text classifi…

2019-11-04abs ↗pdf ↗

We study the problem of removable singularities for degenerate elliptic equations. Let F be a fully nonlinear second-order partial differential subequation of degenerate elliptic type on a manifold X. We study the question: Which closed subsets E in X have the property that every F-subharmonic function (subsolution) on…

2013-03-02abs ↗pdf ↗

Ahpatron improves online kernel learning with tighter mistake bounds.

problem Improving mistake bounds in online kernel learning with budget constraints.
method Introducing Ahpatron, a new model that uses an aggressive updating rule and a budget maintenance mechanism to approximate AVP.
result Ahpatron achieves tighter mistake bounds compared to previous models.

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%.

In this paper we investigate how the volume of hyperbolic manifolds increases under the process of removing a curve, that is, Dehn drilling. If the curve we remove is a geodesic we are able to show that for a certain family of manifolds the volume increase is bounded above by πlπ\cdot l where ll is the length of the g…

1995-06-13abs ↗pdf ↗

Under certain assumptions on CAT(0) spaces, we show that the geodesic flow is topologically mixing. In particular, the Bowen-Margulis' measure finiteness assumption used in recent work of Ricks is removed. We also construct examples of CAT(0) spaces which do not admit finite Bowen-Margulis measure.

2015-09-18abs ↗pdf ↗

We develop analytical methods for nonlinear Dirac equations. Examples of such equations include Dirac-harmonic maps with curvature term and the equations describing the generalized Weierstrass representation of surfaces in three-manifolds. We provide the key analytical steps, i.e., small energy regularity and removable…

2007-07-30abs ↗pdf ↗

Bayesian unlearning uses Bayes' rule to remove data from a model, but faces challenges in obtaining the exact posterior.

problem Removing data from a trained model while maintaining model accuracy.
method Uses Laplace approximation and Variational Inference to approximate the updated posterior.
result Insights on the applicability of Bayesian unlearning in practical scenarios for neural networks.

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…

2019-11-08abs ↗pdf ↗

When learning a new concept, not all training examples may prove equally useful for training: some may have higher or lower training value than others. The goal of this paper is to bring to the attention of the vision community the following considerations: (1) some examples are better than others for training detector…

2013-11-25abs ↗pdf ↗

Researchers extend Chen, Erchenko, and Gogolev's result to more cases.

problem Embedding manifolds with hyperbolic geodesic trapped sets into compact manifolds with Anosov geodesic flows.
method Explains how assumptions can be removed to apply the result to all reasonable 3D examples.
result A broader applicability of the original result to all reasonable 3D examples.

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.

This paper shows that there are symplectic four-manifolds M with the following property: a single isotopy class of smooth embedded two-spheres in M contains infinitely many Lagrangian submanifolds, no two of which are isotopic as Lagrangian submanifolds. The examples are constructed using a special class of symplectic …

1998-03-19abs ↗pdf ↗

Since deep neural networks are over-parameterized, they can memorize noisy examples. We address such a memorization issue in the presence of label noise. From the fact that deep neural networks cannot generalize to neighborhoods of memorized features, we hypothesize that noisy examples do not consistently incur small l…

2019-10-22abs ↗pdf ↗

The paper proves removable singularity for nonlocal minimal graphs.

problem Proving removable singularities for nonlocal minimal graphs.
method Analyzing (s,1)(s, 1)-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 (s,1)(s, 1)-capacity zero.

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.

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.

In practice, there are often explicit constraints on what representations or decisions are acceptable in an application of machine learning. For example it may be a legal requirement that a decision must not favour a particular group. Alternatively it can be that that representation of data must not have identifying in…

2015-11-18abs ↗pdf ↗

In this paper we refine the construction and related estimates for complete Constant Mean Curvature surfaces in Euclidean three-space developed in Kapouleas (1990) by adopting the more precise and powerful version of the methodology which was developed in Kapouleas (1995). As a consequence we remove the severe restrict…

2012-10-11abs ↗pdf ↗

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 R3\mathbb{R}^3 with quadratic decay of curvature ha…

2013-08-29abs ↗pdf ↗

The paper quantifies how much of a 4-ball must be removed to squeeze into a cylinder, proving a lower bound on the Minkowski dimension.

problem Quantifying how much of a 4-ball must be removed to fit into a cylinder.
method Gromov's non-squeezing theorem and Minkowski dimension analysis.
result The Minkowski dimension of the removed set is at least 2, with an example showing this is optimal for certain radii.

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…

2015-07-02abs ↗pdf ↗

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.

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…

2001-03-25abs ↗pdf ↗

In this paper, we consider domino tilings of regions of the form D×[0,n]\mathcal{D} \times [0,n], where D\mathcal{D} is a simply connected planar region and nNn \in \mathbb{N}. It turns out that, in nontrivial examples, the set of such tilings is not connected by flips, i.e., the local move performed by removing two adjace…

2014-10-28abs ↗pdf ↗

Bayesian approach scores influential training examples for model predictions.

problem Enhance interpretability and safety of machine learning models.
method Formulate TDA as a Bayesian information-theoretic problem, scoring subsets by information loss.
result Method aligns with classical influence scores while promoting diversity for subsets.